Computer Vision
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 31 August
Composable scene modeling aims to recover a real indoor scene as complete, editable object assets arranged as observed, giving robot simulation and embodied AI a simulation-ready replica of the real environment whose objects can be manipulated individually. Existing pipelines decompose the task into three steps—parse the observations into instances, generate an asset for each, and place each asset back—but every step presumes an input that a cluttered capture rarely provides: accurate instance geometry, unoccluded views, and assets that accurately match the observations. We propose Lucida, which keeps this order but redistributes the requirements, so each step consumes only what a real capture reliably provides and precision is reached at the end of the pipeline rather than demanded at its start. Lucida parses the video into a scene graph whose nodes carry per-instance multi-view evidence, generates a complete asset for each instance from its evidence, and places assets with GizmoAct, a VLM policy that casts placement as multi-turn GUI interaction, manipulating the object's gizmo in a closed loop and deciding itself when alignment is reached. Across scene-level 3D object detection, object pose estimation, and scene reconstruction, Lucida improves mAP over Boxer by 69% on R2S-Scene, raises ADD-SB@0.05 from 57.8% to 83.4% on CA-1M, and increases scene F-Score from 0.794 for SAM3D to 0.924.
Computer Vision
RealOOB: A Definition-Consistent Real-World Oriented Occlusion Boundary Benchmark
Occlusion boundaries (OBs) are pixel-level image boundaries corresponding to surface visibility discontinuities caused by occlusion. Through precise boundary localisation and occlusion orientation, OBs encode local surface layout and depth ordering, providing geometry-driven mid-level cues for scene understanding. However, progress in pixel-level OB estimation has been limited by fragmented supervision: Existing benchmarks often suffer from limited coverage, category-specific designs, missing self-occlusion annotations, or inconsistent annotation definitions. Meanwhile, modern edge detectors and monocular depth estimators have become strong boundary and geometry predictors, yet their relationship to definition-consistent OBs remains underexplored. We introduce RealOOB, a carefully annotated real-world benchmark with 4.26M definition-consistent, geometry-grounded OB labels covering both inter-object and self-occlusion boundaries, together with validity-aware occlusion-orientation maps that restrict supervision to pixels whose cross-boundary depth ordering is reliably measurable. Based on RealOOB, we evaluate forty OB estimators and edge detectors alongside six monocular depth estimators. Our evaluation reveals a clear gap in occlusion reasoning: modern edge detectors perform competitively with OB methods in localisation, whereas orientation prediction remains challenging for all evaluated methods. Meanwhile, even strong depth estimators often fail to exhibit measurable geometry at true OBs. We believe RealOOB provides a strong reference benchmark for the OB estimation community and a real-world testbed for assessing depth discontinuities and geometry fidelity in broader low-level vision tasks. Dataset and code will be released.
Read the full abstract
Machine Learning
What Emerges and What Breaks in Self-Play Driving
Training autonomous driving policies through pure self-play has recently shown promising results. Following Gigaflow and Puffer- Drive, we train driving policies in a similar self-play fashion, but extend the models from MLPs to Transformers and train on the high-definition map of a real city, where we ultimately aim to deploy them. On the CARLA and Waymax benchmarks, our policies fall short of Gigaflow, and we trace the gap to specific failure modes, including reward hacking at traffic lights and a missing incentive to stop at stop signs. We further analyze which traffic rules emerge from self-play and how closely they match human driving, and we confirm that reward conditioning yields the intended diversity of driving behaviors. A demonstration of a trained policy is available at https://laursisask-ut.github.io/eccvdemo.
Read the full abstract
Software Engineering
ProofPulse: Interactive Proof Coverage Analysis for Dafny
Deductive verification ensures that an implementation satisfies its specification, but successful verification does not guarantee the quality of the specification. As such, weak specifications and redundant invariants may create overconfidence in “verified” code. We present \proofpulse, a tool for Dafny that diagnoses specification quality using a three-valued proof coverage model. By analyzing proof dependencies, ProofPulse distinguishes between elements that contribute to specification intent, those used only for auxiliary checks, and those irrelevant to any proof obligation. Evaluated against an oracle of 252 programs from the dafny-synthesis benchmark, ProofPulse provides a high-precision signal for specification weaknesses, particularly unnecessary preconditions and vacuous proofs. With unsat-core minimization, ProofPulse achieves perfect precision for precondition classification and reduces false positives across all evaluated categories. These results show that proof coverage is a practical complement to verification. Although it cannot fully capture semantic intent, it can reveal weak proof coupling in programs that otherwise appear fully verified. Just as a pulse check distinguishes vitality from the mere absence of symptoms, ProofPulse exposes weaknesses in proofs that technically verify successfully but still suffer from inadequate or redundant code and specifications.
Read the full abstract
Computer Vision
A Composition-Aware Pretraining Framework for Geospatial Foundation Models
Geospatial foundation models have emerged as state-of-the-art methods for downstream Earth observation tasks. However, existing pretraining methodologies process imagery through a single-concept lens, failing to capture the highly compositional nature of complex satellite scenes. We propose a composition-aware pretraining framework that explicitly encodes fractional land-cover mixtures. Each satellite image cell is mapped to a histogram representing its fractional land-cover distribution, which we term the "composition target". These targets serve as the primary prediction objective and are distilled into the backbone using Earth Mover's Distance. Experimental evaluation shows that composition-aware pretraining yields substantial gains on region-level understanding tasks requiring semantic similarity judgment, including zero-shot image retrieval and scene classification, while remaining competitive on tasks requiring fine-grained spatial precision, such as segmentation and object detection. With a 36.8M-parameter backbone, our framework outperforms SatMAE and Prithvi-EO-2.0, which contain 303M and 600M parameters, respectively, in most retrieval and scene classification settings. On the fine-grained ForestNet-12 dataset, a rigorous testbed for compositional discrimination, our method boosts baseline mAP@10 from 0.279 to 0.434, a 55.6% relative improvement, providing direct evidence for the effectiveness of explicit composition modeling. The code implementation can be found at https://github.com/05kashyap/GFM_Composition_Pretraining
Read the full abstract
Logic
Most properties are undecidable even in $\mathop{\mathsf{NExt}} \mathsf{Grz}_t$
We investigate decidability of properties in the lattice $\mathop{\mathsf{NExt}} \mathsf{Grz}_t$ of extensions of the Grzegorczyk tense logic $\mathsf{Grz}_t$ and the lattice $\mathop{\mathsf{NExt}} \mathsf{S4}_t$ of reflexive and transitive tense logics, with applications to the lattice $\mathop{\mathsf{Ext}} \mathsf{biIPC}$ of bi-superintuitionistic logics. We prove that a broad class of properties is undecidable in $\mathop{\mathsf{NExt}} \mathsf{Grz}_t$, including tabularity, Kripke completeness, the finite model property, and decidability, which also yields their undecidability in $\mathop{\mathsf{NExt}} \mathsf{S4}_t$. We also construct infinitely many tabular extensions of $\mathsf{Grz}_t$ (and thus of $\mathsf{S4}_t$) whose coincidence problems are undecidable, while presenting one tabular extension of $\mathsf{Grz}_t$ and infinitely many ones of $\mathsf{S4}_t$ with a decidable coincidence problem. As a consequence, we obtain that the finite model property and tabularity are undecidable in $\mathop{\mathsf{Ext}} \mathsf{biIPC}$, and that there are infinitely many tabular extensions of $\mathsf{biIPC}$ whose coincidence problems are undecidable. These results clarify some similarities and differences between $\mathop{\mathsf{NExt}} \mathsf{Grz}_t$ and $\mathop{\mathsf{NExt}} \mathsf{Grz}$, $\mathop{\mathsf{NExt}} \mathsf{S4}_t$ and $\mathop{\mathsf{NExt}} \mathsf{S4}$, as well as $\mathop{\mathsf{Ext}} \mathsf{biIPC}$ and $\mathop{\mathsf{Ext}} \mathsf{IPC}$. The proofs adapt Chagrov's method of reducing from an undecidable problem for Minsky machines. We isolate and explicitly formulate the method of good valuations, a recurring technique underlying several proofs in the literature that use large frames, making it available for further applications.
Read the full abstract
Instrumentation and Detectors
A general framework for disturbance compensation in airborne and seaborne gravimetry supported by machine learning
High-accuracy measurement systems operating in complex operational environments, such as airborne and seaborne gravimetry, are severely affected by interacting external influences (disturbances) including temperature variations, inertial accelerations, and platform rotations. This work aims to develop and prove a general method for compensating such disturbances beyond the limits of conventional approaches. We present a general framework based on three pillars: a multi-sensor system, supervised machine learning, and a dedicated laboratory -training platform-. This measurement technique was investigated through two experimental case studies relevant to airborne and seaborne gravimetry: (i) temperature and thermal-gradient rejection in a high-sensitivity tri-axial accelerometer, and (ii) pitch and roll rejection for vertical acceleration estimation. The experiments highlighted that, although the general framework provides a useful guideline, its application to airborne and seaborne gravimetry is challenging and not straightforward, requiring the development of dedicated and innovative experimental solutions. This difficulty arises from the specific nature of the measurand-gravity-which cannot be easily varied under controlled conditions. In this work, we present a dedicated approach to addressing these challenges.
Read the full abstract
Optimization and Control
Computing Equilibria in Simulation-Based Insurance Markets with Discontinuous Demand
We study equilibrium computation in simulation-based games motivated by competition in natural-hazard insurance markets. The motivating application considers a multi-region market in which each insurer selects regional pricing and reinsurance decisions to maximize expected financial performance subject to multi-period insolvency constraints. Competitors' decisions affect both profitability and insolvency feasibility through the insured portfolio. Consequently, the strategic interaction defines a generalized Nash game with discontinuous player objectives induced by discrete household purchase decisions and potentially nonconvex feasible sets generated by the insolvency constraints. Discontinuity, nonconvex feasibility, and simulation-defined objectives and constraints complicate the direct use of standard optimality-based equilibrium formulations. Moreover, repeated evaluation of the multi-period simulator makes equilibrium search computationally expensive. To address these computational challenges, we develop an evaluation-efficient framework for computing approximate local equilibria, which combines a response optimizer tailored to the distinct structures of pricing and reinsurance with damped better-response dynamics to mitigate cycling. In a case study of the North Carolina hurricane insurance market, the framework identifies multiple approximate local equilibrium candidates both with and without a household affordability cap and finds no profitable sampled unilateral deviations within the tested neighborhoods under the original simulation model. A representative equilibrium candidate is computed in approximately 5–10 minutes on a single GPU, making repeated equilibrium analyses computationally practical.
Read the full abstract
Mesoscale and Nanoscale Physics
Supermoiré Reconstruction and Topological Mosaics in Twisted Trilayer WSe$_2$ and MoTe$_2$
We investigate lattice relaxation and band structures of helical and alternating twisted trilayer WSe$_2$ and MoTe$_2$ using machine-learning force fields and large-scale ab initio calculations. Interference between the two bilayer moiré lattices generates a supermoiré lattice that, upon relaxation, reconstructs into a few dominant domain types with locally commensurate bilayer moiré lattices. Because the systems lack $C_{2z}$ symmetry, domains otherwise related by this symmetry become energetically and topologically distinct, unlike in twisted trilayer graphene. Band structure calculations show that the topmost valence bands originate from the $K$ ($K'$) valleys and carry domain-dependent valley Chern numbers. The resulting supermoiré lattice hosts a mosaic of topologically inequivalent domains, offering a platform for exploring correlated and topological physics.
Read the full abstract
Solar and Stellar Astrophysics
Study of Butterfly-Shaped Coronal Hole Evolution Across the Solar Disk
We studied the evolution of a butterfly-shaped coronal hole (CH) observed from 2025 September 8 to 14 using SDO/AIA 193~Å\ images and SDO/HMI line-of-sight magnetograms. The CH boundary was identified using a fixed 100~DN intensity threshold, and its area, mean EUV intensity, and total unsigned magnetic flux were tracked across the solar disk. As the CH approached the central meridian, its area increased from approximately $7.70\times10^{16}$ to $1.63\times10^{17}$~m$^{2}$ and its unsigned magnetic flux from $8.68\times10^{21}$ to $1.91\times10^{22}$~Mx, while the mean 193~Å\ intensity decreased from about 61 to 45~DN. The area and unsigned flux showed similar temporal trends, whereas the intensity varied oppositely. Near central-meridian passage, these quantities remained relatively stable for several days. A high-speed solar-wind stream was detected at 1~AU about 2–4 days later, reaching 600–750~km~s$^{-1}$, consistent with the CH being its likely solar source. These results link the morphological, radiative, and magnetic evolution of the CH with the subsequent high-speed solar-wind stream.
Read the full abstract
Computation and Language
TopoCompress: Long Context Compression via Graph-Wired Semantic Trajectories
Long-context compression is essential for reducing the cost and latency of large language model inference. However, existing methods can fragment important evidence, require additional training or alignment, and often depend on the target model for effective compression. We introduce TopoCompress, a training-free and model-agnostic framework that compresses long contexts by selecting coherent semantic spans. TopoCompress first scores each span using dense and lexical query relevance together with semantic acceleration. It then constructs a hybrid graph that connects spans based on semantic similarity and sequential adjacency, and propagates the query-guided relevance scores over the graph. Across five long-context tasks-HotpotQA, 2WikiMQA, MuSiQue, Qasper, and MultiFieldQA-en-TopoCompress consistently outperforms strong compression baselines. Notably, TopoCompress achieves performance comparable to the strongest baseline while using a 4x smaller compression budget, and provides a 1.41x smaller compression time over the fastest baseline.
Read the full abstract
Number Theory
Normal and Lognormal Asymptotics for Lattice-Point Counts in Random Translates of High-Dimensional Balls
Let the center of a $d$-dimensional Euclidean ball be uniformly distributed modulo $\mathbb Z^d$. We study the resulting number of integer lattice points as the dimension and radius tend to infinity. The critical scale is $4\pi^2R_d^2/(d+2)=\log d$. In a logarithmic window around this scale, the logarithm of the lattice-point count divided by the volume satisfies a central limit theorem. At a fixed offset from the critical scale this yields a genuine lognormal limit. Above the critical scale, the count-to-volume ratio converges to $1$ in measure; its normalized error has a standard normal limit, and its variance satisfies an asymptotic formula.
Read the full abstract
Statistical Mechanics
Kinetic temperatures and inertial effects in a nonequilibrium bead-spring model
We investigate a nonequilibrium steady-state model consisting of two coupled beads with arbitrary masses in contact with two thermal baths at different temperatures. Using a covariance-matrix approach together with numerical simulations of the underdamped Langevin dynamics, we characterize steady-state probability distributions, heat transport, and entropy production. We show that irreversibility measures such as entropy production and heat current are invariant under an exchange of the bead masses, whereas energy-storage observables depend explicitly on the mass arrangement in a symmetrical set up. This reveals a fundamental distinction: energy observables exhibit path dependence in singular mass limits, while transport and irreversibility remain well defined. We show that kinetic temperatures provide the natural variables governing the thermodynamics of the system: their difference controls transport and entropy production, while their sum determines the mean energy via a model specific generalized equipartition relation. In the infinite-mass limit, only constitutive relations expressed in terms of kinetic temperatures remain meaningful. Thus, energy, transport, and irreversibility are unified through kinetic temperatures as the organizing variables. We also derive an effective temperature that defines an equilibrium-like canonical distribution. Finally, we analyze the notion of ergodicity and show that the time-averaged observables converge significantly faster than the ensemble averages.
Read the full abstract
Number Theory
Reduced APN permutations and a disproof of the Galois-ring lifting conjecture
We construct infinite families of reduced almost perfect nonlinear (APN) permutations of $\mathbb{F}_{2^m}$ that admit coefficientwise permutation lifts to $\mathrm{GR}(2^k,m)$ for every $k>1$. These families disprove Conjecture~2 of Rønjom and Sandrib (Cryptogr. Commun., 2026), even for reduced polynomial representatives. For every odd $m\ge5$ with $3\nmid m$, we obtain explicit seven-term polynomials over $\mathbb{F}_2$ with formal derivative identically one. We derive them from a complete criterion for the reduced representative of $A(x)^{2^s+1}$ to have no critical point in $\mathbb{F}_{2^m}$, where $A$ is an invertible linearized polynomial and $\gcd(s,m)=1$. We then apply the cube case to construct a second family of degree $2^{m-1}+2$, whose nonconstant derivatives avoid zero by an explicit trace identity. A fixed parameter in $\mathbb{F}_{32}$ gives this family in every dimension $m=5r$ with $r$ odd, including a degree-$18$ example over $\mathbb{F}_{32}$. Both constructions remain in Gold linear equivalence classes, so liftability of reduced representatives is not invariant under invertible $\mathbb{F}_2$-linear input changes. We obtain the lifting conclusions from the standard Galois-ring permutation criterion. We also verify a degree-$24$ example supplied by Zhang and Haobo, prove a trace-adjoint criterion for reduced quadratic functions, and interpret the derivative condition through ramification at rational points.
Read the full abstract
Differential Geometry
Isodiametric-type upper bounds for Steklov eigenvalues
Let $n\geq 2$. We establish isodiametric-type upper bounds for Steklov eigenvalues of bounded Lipschitz domains $\Omega$ in Euclidean space $\mathbb{R}^n$ and hyperbolic space $\mathbb{H}^n$. In Euclidean space, we prove \[ D(\Omega)\sigma_k(\Omega)\leq C(n)k, \] with optimal dependence on $k$. For domains in either $\mathbb{R}^n$ or $\mathbb{H}^n$, we establish \[ D(\Omega)\sigma_k(\Omega)\leq C(n)k^2\left(\frac{|\Omega|^{\frac{1}{n}}}{D(\Omega)}\right)^{\frac{n}{n-1}}. \] The exponent of the volume-diameter ratio is optimal in both settings, and with this exponent fixed, the quadratic dependence on $k$ is also optimal. Interpolating the preceding volume-diameter estimate with a volume-normalized Steklov bound, we further obtain \[ D(\Omega)\sigma_k(\Omega)\leq C(n)k^{1+\frac{1}{2n-1}} \] in hyperbolic space. These results answer Open Question 4.37 affirmatively and resolve the hyperbolic part of Open Question 4.35, both posed in [5].
Read the full abstract
Astrophysics of Galaxies
Stellar streams around dwarf galaxies are observationally rare in the local Universe
The frequency and properties of stellar streams around dwarf galaxies remain observationally under-explored. Building a statistically significant sample is challenging because dwarf galaxies are smaller, fainter, and far more numerous than massive galaxies. We present the first results from a systematic survey for stellar streams around dwarf galaxies. We first introduce a classification metric for satellite accretion features (streams, shells, and asymmetric stellar haloes) using DECam imaging from the DES and DECaLS surveys. Applying this metric to the DES footprint, we find a low observed frequency of accretion features (5.1$\%$) and no bona fide stellar streams (with only one identified in DECaLS). We consider whether the apparent excess of shells relative to streams can be explained by observational biases. Our results indicate that stellar streams are observationally rare in the local Universe, motivating further theoretical work to determine whether this reflects genuine differences in merger rates across galaxy mass regimes.
Read the full abstract
Statistical Methodology
Aggregate Disambiguation Systems
Natural-language tasks can elicit different verdicts from protocol-following evaluators that receive the same declared information. We study aggregate disambiguation systems (ADSs). Given a task and a candidate solution, each evaluator casts a binary vote on whether the solution should be accepted, and the system aggregates the votes of a finite panel. The target is protocol reproducibility relative to an explicitly declared evaluator reference, not semantic truth. We separate fixed finite censuses, probabilistic evaluator populations, and growing-census limits, since their endpoint laws and guarantees are not interchangeable. In the population setting, we use finite samples to estimate how often a finite panel reaches the same decision as the declared evaluator population. We provide a lower confidence bound on the fraction of candidate solutions for which the disagreement probability is at most a chosen tolerance. The calculation accounts separately for sampling candidate solutions and sampling evaluators. The construction permits arbitrary dependence among columns induced by shared evaluator rows and uses exact binomial intervals at the evaluator layer and an exact one-sided binomial inversion at the generator layer. Simulations check the implementation against known population coverages and expose power limitations.
Read the full abstract
Machine Learning
Geometric Attractor Monitoring: A Robust and Frugal Framework for Multi-modal Industrial Robotic Cycles
Monitoring the health of heterogeneous industrial robot fleets is severely challenged by the multi-modal nature of their operational cycles and a persistent scarcity of run-to-failure data. Standard data-driven approaches, particularly deep learning architectures relying on sequential reconstruction, often struggle in this specific setting; they tend to over-smooth complex dynamics, masking early signs of degradation. To address these industrial constraints, we reframe the monitoring problem through a framework based on Phase Space Reconstruction (PSR). Instead of predicting temporal sequences, this framework transforms univariate sensor data into a geometric attractor, explicitly unfolding the mechanical states independently of their temporal occurrence. By evaluating various anomaly scoring techniques within this space, we demonstrate that discrete support estimation provides an effective and computationally frugal Health Indicator (HI). Validated on a real-world dataset of 21 heterogeneous robots over three years and a synthetic Langevin system, our approach outperforms standard deep learning baselines. We show that aligning the algorithmic bias with the geometric properties of the target system yields a pragmatic, traceable and easily deployable approach perfectly tailored to the realities of industrial constraints.
Read the full abstract
Logic in Computer Science
Schwarz: Solver-Aware Agentic Program Verification
Agentic verification systems can often generate source-level specifications that look plausible, but plausibility is not enough: the verifier must still turn those specifications into SMT obligations that the solver can prove. When this step fails, current LLM-driven loops usually expose only a coarse verifier error, timeout, or unknown solver result. The model cannot tell whether the specification is wrong, a helper lemma is missing, the proof context contains irrelevant facts, or the obligation needs a different theory view. This paper presents Schwarz, an agentic verification harness that makes SMT-backed proof failure local, checkable, and repairable. Schwarz turns failed verification into obligation-local repair tasks: program-point snapshots expose checked facts at a boundary, local lemmas let the agent propose missing proof steps, and theory-aware solver policies guide the agent toward solver-friendly formulations for numeric, quantified, memory, and floating-point obligations. We implement Schwarz for C and Rust/Verus and evaluate it on 1,475 tasks. On 475 benchmarks from recent agentic verification tools, Schwarz solves 95.2% of the tasks. On 1,000 tasks from the SV-COMP 2026 ReachSafety track, averaging 1,427 LOC, Schwarz solves 91.5% of the tasks, compared with 60.1% for CPAchecker. Ablations and comparison with a pure-agent baseline show that solver-aware repair is effective and scalable.
Read the full abstract
Strongly Correlated Electrons
Chiral Color Ice: Exact Local Handedness Constraints and Möbius Zero Modes in Frustrated Magnets
Local constraints govern the low-energy physics of frustrated matter, but familiar ice-type rules constrain flux-like quantities and are insensitive to handedness. Here we show that handedness itself can be imposed as an exact local quantum constraint without selecting an axis in spin space. We construct positive-semidefinite, SU(2)-invariant parent Hamiltonians whose complete zero-energy space on a tetrahedron has a prescribed chirality sign, rather than selecting a particular chiral wave function. For spin-1/2 the local term is a rank-one projector onto a chiral tetrahedral singlet, while for arbitrary spin it factorizes as $B^\dagger B$ through a singlet-annihilation operator, with a completely characterized kernel given by the span of the globally rotated chiral color-ice states. For coherent states, the same zero-energy condition becomes an $S$-independent nonlinear constraint in which three spin directions determine the fourth through a Möbius transformation; compositions of these maps define constraint holonomies on extended lattices. Connecting the same local constraint in different ways produces qualitatively different collective regimes: corner-sharing lattices retain exponentially large quantum ground-state kernels, with rigorous lower bounds exceeding conventional ice benchmarks; edge-sharing lattices support subdimensional plane or line zero modes; while triangular constructions suppress nonuniform coherent deformations and contain the complete Anderson tower of tetrahedral magnetic order at exactly zero energy. Two inequivalent triangular coverings further show that harmonic zero-mode counting does not determine the size of the quantum kernel. These results establish a tractable setting in which local handedness, nonlinear constraint geometry, and quantum degeneracy can be disentangled and related directly to the connectivity of the constraint network.
Read the full abstract
Statistical Methodology
From Test Performance to Risk-Based Effect Sizes: A Unified Wald-Type Framework to Design Clinical Validation Studies for Binary and Survival Outcomes
Clinical validation studies of predictive tests are usually designed to focus on sensitivity ($Se$) and specificity ($Sp$), while statistical power is often calculated on regression-effect scales (e.g., risk ratio, hazard ratio). However, these quantities are statistically connected. Here, we provide closed-form links from sensitivity, specificity, and disease prevalence ($\pi$) to predictive risks, risk contrasts, and Wald-type variance, power, and sample-size formulas for binary and fixed-horizon survival outcomes. Analyses of statistical efficiency via C- and D-optimal principles demonstrate how prevalence and threshold choices affect study efficiency, supporting rapid decisions in preliminary studies and informing the design of subsequent, larger studies. Simulations show good calibration across most realistic scenarios; when events are rare and test effects are simultaneously very large, continuity and minimum-event corrections are needed to stabilize the approximation. We illustrate the framework with a case study describing use of the coronary artery calcium score for predicting incident cardiovascular disease in patients with type 2 diabetes mellitus. The formulas let investigators check power and required enrollment directly from $(Se,Sp,\pi)$, without running a separate simulation for each design candidate.
Read the full abstract
Disordered Systems and Neural Networks
Learning rules for complex-valued patterns in networks of oscillators
In this article, we extend learning rules from real binary to complex-valued spins. This formulation allows for a robust and natural representation of grayscale patterns, where spins behave as multi-state neurons and can be stored in a complex-valued weight matrix. We describe a rule that performs better than standard methods, such as Hebbian learning, to encode information in a suitable form for pattern retrieval with networks of oscillators. Since in neural networks it is of interest to have local and incremental learning rules, we prove the extension of a result by Diederich and Opper with our complex-valued spin formulation. We then test the behavior of the associative memory for the system of oscillators under different circumstances for both real-valued, as well as complex-valued correlated and random patterns.
Read the full abstract
Combinatorics
On the structure of graphs with given odd girth and large algebraic connectivity
A classical result of Andrásfai, Erdős, and Sós states that every $n$-vertex graph with odd girth at least $2k+1$ and minimum degree larger than $\frac{2n}{2k+1}$ is bipartite. Rather than imposing a minimum-degree condition, in this paper we investigate conditions on algebraic connectivity that force graphs of given odd girth to have a simple structure. The algebraic connectivity of a graph $G$, denoted by $\mu_2(G)$, is the second smallest eigenvalue of its Laplacian matrix. Our main results are as follows. 1. Every $n$-vertex triangle-free graph $G$ with $\mu_2(G)\geq \frac{n}{3}$ is bipartite. Moreover, the constant $\frac{1}{3}$ is asymptotically best possible. 2. For $k\geq 3$, every $n$-vertex graph $G$ of odd girth at least $2k+1$ with $\mu_2(G)>\frac{4n}{6k-1}$ is bipartite. 3. For $k\geq 22$, every $n$-vertex graph $G$ of odd girth at least $2k+1$ with $\mu_2(G)>\frac{3456n}{k^3}$ is bipartite. Moreover, the term $k^{-3}$ is asymptotically best possible.
Read the full abstract
Number Theory
An Explicit Belyi Map for the Wiman Sextic and Cusp Forms for a Noncongruence Subgroup
In this paper, we explicitly determine an algebraic Belyi function on a unique smooth projective model $\widetilde{W}$ of the Wiman sextic curve $W$ and describe its complex uniformization in terms of modular functions associated with a certain noncongruence subgroup $\Gamma_{\widetilde{W}} \subset {\rm SL}_2(\mathbb{Z})$. As an application, we give a direct proof of the unbounded denominators conjecture for weight $2$ cusp forms with respect to $\Gamma_{\widetilde{W}}$. The conjecture is now known in full generality by the work of Calegari, Dimitrov, and Tang, following earlier progress including work of Dong, Lin, and Ng. Our proof, however, uses a degeneration of $\widetilde{W}$ over $\mathbb{F}_{5}$ together with explicit Puiseux series expansions and is substantially different from the methods employed in their work.
Read the full abstract
Logic in Computer Science
Computational free will as global selection: from sheaf-theoretic gluing to a conditional separation of P and NP
We formalise computational free will by separating locally constrained admissibility from the selection of one global continuation. Global sections of a finite choice presheaf form an admissible set, GLUE; SELECT singles out the continuation realised at a pre-identified occurrence. A uniform trace relation certifies that continuation efficiently after the act, although it is assumed not to be uniformly anticipable in polynomial time from the prior occurrence input. Under explicit uniformity, balance, historical-completeness, and unique-projection assumptions, this trace defines a total FNP search relation with no deterministic polynomial-time selector. Thus existence of computational free will in the stated sense implies a separation between polynomially verifiable and polynomially solvable search, and hence that P differs from NP. The result is conditional and gives no unconditional class separation.
Read the full abstract
Analysis of PDEs
Tumor boundary instability induced by pressure feedback
We consider a Hele–Shaw-type tumor growth model obtained from the incompressible limit of a porous-medium equation. The limiting model preserves the patch structure of the tumor density and therefore admits a single free-boundary formulation. We investigate how a pressure-feedback parameter associated with the homeostatic pressure affects boundary stability. Using asymptotic analysis, we study boundary perturbations of finite-radius tumors and planar traveling fronts and derive the corresponding stability criteria. For planar fronts, the stability thresholds are further shown to be bifurcation points from which nonsymmetric traveling waves emerge. Our results indicate that pressure feedback can induce boundary instability in parameter regimes where the model without pressure feedback remains stable.
Read the full abstract
Atmospheric and Oceanic Physics
Uncertainty-Aware End-to-End AI Weather Forecasting: Disentangling Observation and Model Contributions
End-to-end weather forecasting systems produce skillful global gridded and station forecasts directly from raw Earth observations, replacing the numerical weather prediction pipeline, including data assimilation, at a fraction of its cost. These systems are deterministic and issue no uncertainty. Here we render the Aardvark Weather model probabilistic by attaching one stochastic mechanism to each component: learned, input-dependent noise at the observation encoder, aimed at the uncertainty inherited from the observing system, and Monte Carlo dropout in the processor, aimed at the uncertainty of the learned dynamics. The resulting nested ensemble attributes forecast spread to the two sources through a law-of-total-variance decomposition, cross-checked by withholding observation streams. Probabilistic finetuning significantly improves the mean forecast, by 11% on average across variables and lead times. The ensemble is close to calibrated against ERA5 through the medium range, is at least as accurate as the deterministic model at weather stations while beating it in relative economic value at every lead time, and remains considerably behind the operational ECMWF IFS ensemble. The encoder branch behaves as observation-driven uncertainty. Component-attributed uncertainty makes end-to-end forecasts more transparent, a step toward observation-driven digital twins of the atmosphere.
Read the full abstract
Signal Processing
Doppler Effect in High-Mobility Free Space Optical Links with Multicarrier Intensity Modulation
In this paper, we investigate the impact of Doppler-induced time scaling in intensity-modulation/direct-detection (IM/DD) multicarrier free-space optical links subject to high mobility. Modeling the Doppler effect as a single-sideband frequency shift applied to the analytic signal waveform, we show that it produces a baseband-equivalent phase rotation, resulting in a common-phase error (CPE), in addition to Dirichlet-kernel inter-carrier interference (ICI), even though the optical carrier phase is removed through photo-detection. The numerical results based on DC-biased optical orthogonal frequency-division multiplexing (DCO-OFDM), show that at small Doppler shifts, the CPE component dominates and can be effectively compensated through pilot-aided phase tracking, while the induced ICI remains rather negligible. At larger Doppler shifts, however, ICI becomes dominant and results in a bit-error-rate floor, highlighting the need for both CPE tracking and ICI mitigation. This is particularly relevant for optical links with small subcarrier spacing and large Doppler shifts, such as those in low-Earth-orbit satellite-to-ground and inter-satellite transmission scenarios.
Read the full abstract
Human-Computer Interaction
LipCoder: Voice-Enabled Coding Toolkit
AI-assisted programming environments have accelerated software development, giving rise to new paradigms like vibe coding. However, their benefits remain largely inaccessible to visually impaired programmers, as existing screen readers and assistive tools offer limited support for these emerging workflows. We introduce LipCoder, a voice-centric programming toolkit designed to deliver editor-level functionality through auditory and speech-based interfaces. LipCoder offers features comprising speech feedback and earcon cues for comprehension and validation, as well as natural language input for navigation and modification. In an exploratory evaluation, 5 visually impaired programmers performed a series of coding tasks comparing LipCoder with a baseline of VSCode, Copilot, and VoiceOver. Quantitative trends and qualitative feedback point to directions for auditory-first design that may broaden accessibility in speech-driven coding environments.
Read the full abstract
Neural and Evolutionary Computing
Conjoint Audio-to-Spikes Encoding and Processing for Efficient Neuromorphic Speech Recognition
Obtaining data from neuromorphic sensors and processing it with Spiking Neural Networks is a promising solution to lower the energy cost of artificial intelligence. The current rarity of natively neuromorphic datasets promotes the development of software tools to translate input sensory data into spikes. However, highly bio-mimetic simulators can be challenging to implement on digital hardware. In this work, we evaluate the neuromorphic encoding and subsequent classification of audio into spikes using a non-learnable, high-level, programmable encoder targeting hardware implementation on FPGA. We quantify the pipeline's efficiency with hardware-agnostic metrics based on the quantitative spiking activity. Our study focuses on the simultaneous optimisation of encoder and classifier: the first provides efficient and informative data so that the latter achieves a better performance with an overall lower energy cost at learning and inference. This work introduces the first end-to-end neuromorphic spike-encoding and evaluation of the TIMIT dataset. Our simple feedforward network reaches a classification accuracy of 99.77% on a spike-encoded Heidelberg Digits, overcoming the neuromorphic state of the art on this benchmark dataset.