Machine Learning
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 8 November
We study the numerical approximation of Schrödinger Bridges in the setting where samples from the target distribution are unavailable and only an unnormalized target density is given. In this regime, the widely used iterative proportional fitting (IPF) procedure (and its variants) often exhibits severe numerical instabilities, stemming from ill-conditioned underlying control problems and from the fact that the optimal solution may lie far from the initialization. To address these issues, we propose a trust region variant of IPF that constrains successive updates to remain at a fixed Kullback-Leibler divergence from the current iterate. This restriction significantly improves numerical stability. Moreover, we show that the resulting method admits an interpretation as a mirror descent scheme with an adaptively chosen step size. We demonstrate the effectiveness of our approach on several challenging sampling tasks.
Robotics
PA-SaR: Perception-Aware Learning, Control, and Coordination for Multi-Robot Search and Rescue
Autonomous SaR requires robots to explore unknown or partially known environments, avoid hazards, coordinate team activities, and guide discovered victims to safety. Improving individual capabilities of robots does not necessarily improve mission outcomes: safer motion can restrict the exploration behavior, faster discovery can increase the rescue demand, and effective guidance depends on victim responses. We introduce PA-SaR, a mathematical and architectural framework for coordinating heterogeneous local control, learning-based exploration, supervisory task allocation, and adaptive approach-lead victim guidance around mission-level objectives. PA- SaR distinguishes environmental ground-truth, robot-specific perceptions, and simulated victim behavior. This provides a common basis for integrating complementary mechanisms and analyzing their interactions across mission stages. We demonstrate the framework through single- and multi-robot simulation studies incorporating model-predictive and learning-based exploration, perception-based safety shielding, event-driven task allocation, and adaptive victim guidance. The results show trade-offs between collision avoidance and search completion, indicate that supervisory allocation improves search completion beyond information sharing alone, and demonstrate that increased exploration does not necessarily yield more rescues. Adaptive guidance increases rescues relative to continuous leading, without a detected improvement in mean or final victim trust or a reduction in mortality. These findings support evaluating local control, team coordination, and evacuation as related but distinct aspects of autonomous SaR within the considered simulation environments.
Read the full abstract
Quantum Physics
Pauli propagation in adaptive local frames
The cost of Pauli propagation depends on the local basis in which the evolving operator is expanded. We show that its Pauli complexity splits into an occupation part, invariant under local rotations and bounded from below by the operator mass and length distributions, and a flavour part that a suitable basis can remove. We introduce frame-adaptive Pauli propagation (FAPP), which rotates the basis of every qubit, gate by gate, to the principal axes of the operator's local polarisation, exactly and within the memory structure of Pauli propagation. This simple rule achieves most of what the best local frame can, and the polarisation predicts how much any local frame can gain. In the Ising chain in transverse and longitudinal fields, FAPP lowers the truncation error at fixed memory by up to an order of magnitude and the memory by a size-independent factor of three; on the infinite two-dimensional lattice it needs up to seven times fewer strings for a given certified accuracy, and in Clifford circuits doped with T gates two to eight times fewer.
Read the full abstract
Robotics
ColNav: Uncertainty-Aware Spacetime Collision Checking with Bounding Volume Hierarchies
Safe navigation for mobile robots in dynamic and uncertain environments requires planning paths that avoid collisions with other moving targets. Typically this involves forward propagating the robot motion and checking for collisions at sampled points in space and time. Such methods can miss collisions between sampled points and are not robust to uncertainty in the state estimates. We propose ColNav, a robust collision check formulation with geometric volumes. The key aspect of our approach is encoding the uncertainty in the targets' and the ego robot's positions and velocities into spacetime tubes, in two variants that consume bounded-set and Gaussian uncertainty descriptions, respectively. The tubes are organised in bounding volume hierarchies, so that a single tree traversal covers the entire horizon, rather than testing sampled time instants, and returns a robust geometric certificate together with an estimate of the time to collision. Static and dynamic obstacles share the same representation. Our approach reaches the goal with a 100% success rate under prediction model mismatch, where the best baseline reaches 65%, and maintains up to three times the clearance in dense traffic. We also validate real-time operation on a physical robot.
Read the full abstract
History and Overview of Mathematics
A software infrastructure proposal for mathematical research with AI agents
In 2026, AI agents began to produce mathematical results. They formalize complete theorems and settle open problems faster than a research group can review the results. The difficulty is shifting to organizing that output, deciding which results to trust and understanding them as a group. Current tools address particular problems or assist individual researchers, and none of them is designed as the shared working environment of a research group. We propose the design of a self-hosted environment in which a group of people and agents does its daily mathematical work. It consists of a small open core, which each group deploys with the resources it has and adapts through extensions. The core records who did what and gives every message and result a stable address. We also outline how the formal libraries of different groups, maintained mostly by agents, can form a network. We describe Stemma, an early prototype that implements part of the proposal, and illustrate it with a synthetic example.
Read the full abstract
Computer Vision
MICE: Multi-animal Interaction Context Encoder - A Hierarchical Foundation Model for Mouse Behavior
Quantifying mouse behavior from pose is a foundational tool in neuroscience, ethology, drug discovery, and animal welfare. Self-supervised foundation models are a natural fit, but a foundation model for mouse behavior must handle social behavior - many behaviors that matter (aggression, courtship, mounting, allogrooming) are inherently multi-animal. Existing self-supervised pose models fall short: they encode each animal independently and discard interaction signal, hard-code the animal count, and pretrain one dataset at a time. We introduce MICE (Multi-animal Interaction Context Encoder), a hierarchical foundation model for mouse behavior that pretrains jointly on six mouse-pose corpora spanning one to four mice and 7 to 27 keypoints. MICE combines a hierarchical individual encoder capturing per-mouse kinematics at multiple temporal scales with a Perceiver-style social encoder whose learned latent codebook decouples parameter count from animal count, so a single checkpoint serves any group size without retraining. Across four evaluation protocols spanning six datasets, MICE matches or exceeds prior keypoint-based baselines, and layer-wise probing shows the social stage incrementally improves discriminability beyond the individual encoder. Code, weights, and data are available at https://github.com/eric0708/MICE.
Read the full abstract
Medical Physics
Hyperelasticity as an efficient regularizer for 2D-3D thoracic motion models
Patient-specific motion models enable real-time volumetric imaging of the thorax from a single x-ray projection, but most existing approaches require hours of training. The VM-DS framework trains in minutes, yet its image-space self-consistency regularizer accounts for 40% of the motion-model fitting time and does not prevent the fitted fields from folding. In this paper, we explore a range of regularization approaches including scaling-and-squaring, bending energy, diffusion, first-order inverse consistency, isotropic total variation, a negative-Jacobian hinge, |log det J|, a control-point injectivity bound and hyperelastic regularization. Hyperparameters were selected on two development cases from the public DIR-Lab 4D dataset under rules fixed in advance, and the regularizers were tested on eight held-out cases. At a fixed number of training steps, the hyperelastic term trained in 5.6 against 8.4 min and gave a lower held-out TRE (2.5 mm). With a quarter of the motion-model budget it matched the baseline (2.7 mm), and at every budget from 2 to 17 min its mean TRE was lower by 0.3-0.5 mm. Hyperelastic fields had no folded voxel in any held-out view, whereas baseline fields folded in 83 % of views, with image similarity unchanged. A hyperelastic volume penalty can therefore replace image-space self-consistency, matching accuracy with 3-5 minutes of training and removing folding, bringing on-the-day motion models closer to routine use in image-guided interventions. Code will be available at https://github.com/Image-X-Institute/Voxelmap/tree/hyper
Read the full abstract
Solar and Stellar Astrophysics
Evolving stellar wind environment around M dwarfs and its influence on magnetic star-planet interactions
M dwarfs are the most abundant group of stars in the Galaxy and they are expected to host a large number of exoplanets orbiting in the habitable zone. It is believed that stellar winds of M dwarfs can have a substantial effect on these exoplanets and on the observations of these systems. However, a systematic investigation of how the stellar winds of M dwarfs varies on timescales of a few months to years and how this impacts exoplanets around these stars is missing. We aim to investigate how variability of magnetic field properties of M dwarfs affects their stellar winds, which is essential for future studies of star-planet interactions (SPIs) and planetary habitability. Such variability might shed light on whether SPI signatures are going to repeat. We have compiled a total of 18 magnetic field maps for 6 M dwarfs, with masses between 0.1 and 0.6 $M_\odot$, and rotation periods between 2.7 and 175.6 days. We use these maps as input of 3D magnetohydrodynamic stellar wind simulations. We derive the mass-loss rate, the angular momentum-loss rate, and the Alfvén radius. For the stars with confirmed exoplanets (DS Leo, YZ Cet, and GJ 1151) we investigate the variability of stellar wind properties at the orbit. We find mass-loss rates between $1.0\times10^{-14}~M_\odot~{\rm yr^{-1}}$ and $2.3 \times 10^{-13}~M_\odot~{\rm yr^{-1}}$ and angular momentum-loss rates between $4.6 \times 10^{27}~{\rm erg}$ and $4.9 \times 10^{31}~{\rm erg}$. For individual stars the Alfvén radius, mass-loss rate, and angular momentum-loss rate varied with time by up to a factor of 1.5, 3.8, and 7.4 respectively. Our results follow the observational relation between mass-loss rate and X-ray flux. Due to the time-varying Alfvén surface, exoplanets orbiting DS Leo and YZ Cet move in and out of the sub-Alfvénic regime, affecting the nature of star-planet interactions and prospects for their detection.
Read the full abstract
Logic in Computer Science
Spectral Stability, Fatou Basin Contraction, and Machine-Checked Multipliers in Holomorphic Extensions of Generalized Syracuse Dynamics
We embed the Syracuse operator $T(n) = n/2$ (even $n$), $T(n) = (3n+1)/2$ (odd $n$) and the Collatz map $C(n)$ into $\mathbb{C}$ via entire functions of exponential type $\pi$: $f(z) = \frac{1}{4}(1 + 4z - (1 + 2z)\cos(\pi z))$ and $F(z) = \frac{1}{4}(2 + 7z - (2 + 5z)\cos(\pi z))$. We prove five results: (1) every integer periodic cycle $C \subset \mathbb{N}^+$ of $T$ is a strictly attracting Fatou cycle of $f$ with multiplier $\mu_f(C) = 3^{N_{\mathrm{odd}}}/2^N = \prod_{n \in C\text{ odd}} \frac{3n}{3n+1} \in (0,1)$, and $\mu_f(O_{1,2}) = \mu_F(O_{1,4,2}) = 3/4 < 1$; (2) on the Fatou basin $B(O_{1,2})$, $g = f^{\circ 2}$ conjugates to $\Phi_j(g(z)) = \frac{3}{4}\Phi_j(z)$ with Koenigs Taylor jets $c_2(1) = -\frac{13}{2}\pi^2$ and $d_2(2) = -\frac{9}{2}\pi^2$; (3) the Schwarzian derivative is strictly negative on $\mathbb{Z}$ ($S(f)(n) \le 3\pi^2 - \frac{3}{8}\pi^4 \approx -6.9196 < 0$), and a repelling Julia 2-cycle $O_{\mathrm{rep}} \subset J(f)$ ($\mu \approx 1.2148 > 1$) isolates $B(O_{1,2})$; (4) on $(\mathbb{Z}_2, \mu_{\mathrm{Haar}})$, the 2-adic Lyapunov exponent $\lambda_{\mathrm{Haar}} = \frac{1}{2}\ln(3/4) \approx -0.143841 < 0$ equals $\frac{1}{2}\ln|\mu_f(O_{1,2})|$; and (5) we certify 20 theorems in Lean 4 (anc/CollatzAttractor.lean, 0 sorry). These results establish local Fatou invariants and 2-adic ergodic averages for $f(z)$, leaving open whether every $n_0 \in \mathbb{N}^+$ lies in $\bigcup_{k \ge 0} f^{-k}(B(O_{1,2}))$.
Read the full abstract
Human-Computer Interaction
Feel My Focus: Gaze-Triggered Digital Twin Creation for Remote Collaboration
We present Feel My Focus, a gaze-triggered mixed reality (MR) demonstration that enables rapid creation and sharing of lightweight 3D digital twins during remote collaboration. Unlike systems that use gaze primarily as a referential pointer, Feel My Focus treats sustained visual attention as a generative action: a fixation on a physical object initiates single-image capture, attention-guided segmentation, and one-shot 3D reconstruction, allowing a remote partner to inspect and discuss the object in situ. The system integrates gaze-tracking glasses, modular segmentation and reconstruction services, and an MR client for runtime streaming and interaction. This design prioritizes responsiveness and experiential continuity over photometric fidelity. We report observations from a public demonstration, highlighting design trade-offs, failure modes, and user control considerations for deploying gaze-triggered generative systems in real-world collaborative settings.
Read the full abstract
Analysis of PDEs
Stabilization of an Euler–Bernoulli beam equation with distributed damping and interior time delay
In this paper, we investigate the effect of a fixed time delay on the internal stabilization of an Euler–Bernoulli beam clamped at one end with distributed damping. Under appropriate assumptions on the feedback weights, we first establish that the problem is well-posed using semigroup theory. Furthermore, using the multiplier method combined with a suitable Lyapunov functional, we prove the exponential stability of the system.
Read the full abstract
Differential Geometry
Polar foliations on the Cayley plane
We classify polar foliations on the Cayley projective plane, completing the classification of polar foliations on compact rank one symmetric spaces.
Analysis of PDEs
Exponential stabilization of an Euler–Bernoulli beam via internal feedback under distributed time delay
In this paper, we investigate the internal stabilization of a closed-loop system which consists of an Euler–Bernoulli beam subjected to a structural damping mechanism with a distributed delay into the domain. Under appropriate assumptions on the weights of the delay term and internal damping, we first prove the well-posedness of the system by a semigroup approach. Then, by constructing an appropriate Lyapunov functional and utilizing the multiplier method, we establish the exponential decay of the system energy.
Read the full abstract
Human-Computer Interaction
Trail Making Tests in Extended Reality: A Critical Review with Implications for Cognitive Ageing
Extended reality (XR) versions of the Trail Making Test and Color Trails Test are promising for assessing and training cognition in older adults. However, each XR adaptation is a new instrument, whose display, interaction technique, timing rules and layouts may change what it measures. This critical narrative review maps these implementations by software lineage and appraises their evidence for assessment and training against common criteria. The Trail Making Test in Virtual Reality (TMT-VR), whose source code was inspected, serves as a measurement case. XR trail-making tests showed convergence with paper and computerised versions, varying by test part and sample, and clinical group differences (e.g., Parkinson's disease, mild cognitive impairment). However, gaps in reliability (e.g., randomised forms), validation (e.g., norms, prospective samples) and reporting (e.g., error handling, build identity) emerged, and no training benefit attributable to the trail-making component was identified. The TMT-VR case shows how interaction technique, timing rule, error handling and unlogged layouts shape a score's meaning. Future tests should log layouts and events, estimate alternate-form reliability and undergo prospective validation, and training trials should isolate the trail-making component. Several XR trail-making tests have moved beyond feasibility, and reported tolerability during supervised sessions supports further evaluation in older adults.
Read the full abstract
Metric Geometry
The sharp bound on the distance between the centers of mass of a convex body and its boundary
We prove that the distance between the centers of mass $c(K)$ and $c(\partial K)$ of a convex body $K$ and its boundary $\partial K$, respectively, does not exceed $ D_n$ times the width of $K$ in the direction of the vector joining $c(\partial K)$ and $c(K)$. The constant $D_n$ is optimal and coincides with the sharp constant in the problem of bounding the distance between the orthogonal projection of the centroid of a convex body onto a hyperplane and the centroid of its orthogonal projection onto that hyperplane.
Read the full abstract
Systems and Control
Predictive Neuromorphic Control of a Scanning Mirror System: An Event-Centric Framework
Organizing control around events can reduce sensing and actuation demands while directly linking control decisions to the occurrence and timing of desired system behaviors. This paper proposes a novel event-centric model predictive control (MPC) framework that unifies event sensing, event prediction, and event regulation. Events define the feedback information, prediction horizon, and event-timing objectives, placing them at the center of predictive control design. The framework is developed for a scanning mirror system equipped with a baseline neuromorphic controller composed of spiking neurons that supports sparse actuation. The control objective is to achieve prescribed zero-crossing times and a desired scanning range while minimizing the mechanical energy transferred between the actuator and the mirror. A sampling-based algorithm is presented to obtain suboptimal solutions of the event-centric MPC optimization problem without requiring an explicit event-to-event prediction model. By grounding predictive optimization in events, the proposed framework opens a new direction for MPC design and its integration with neuromorphic control.
Read the full abstract
Artificial Intelligence
An Interpretable Fuzzy Tree for Turbofan Remaining Useful Life with an Auditable Per-Component Diagnostic Layer
Data-driven remaining useful life (RUL) estimators for turbofan engines are accurate but opaque, and their internal features typically encode remaining life rather than any specific component's state. This paper presents an interpretable genetic fuzzy tree that predicts RUL from cruise-condition sensor means on N-CMAPSS while exposing a per-component diagnostic layer inspectable rule by rule. The tree follows the engine hierarchy: sensors to component health, then to bounded component damage, spool damage, and RUL, so each level answers a different maintenance question. Training is staged so the prognostic objective cannot reshape the diagnostic layers: health leaves are fitted to physical targets and frozen, a deterministic fuzzy damage map with fleet-referenced thresholds is imposed on each component, and only the aggregation is optimized for RUL. It consumes 13 cruise-mean scalars per cycle rather than a trajectory, which removes any sequence model. On the native split it reaches 8.44 cycles RMSE on the multi-fault subset and 11.51 across all modes with 333 free parameters, 411 total rules, 32 to 12,000 times fewer than compiled baselines. An exhaustive sensor search bounds which components are diagnosable under the tested cruise-mean design, and the rule base is structured to admit formal verification, which this study does not discharge.
Read the full abstract
Artificial Intelligence
Characterizing Scanpath Decoding Pipelines with Perturbation Profiles
When a scanpath descriptor supports a classification, it is rarely clear what the classification rests on. We propose perturbation profiles. Five transformations each target one stated property of every scanpath (fixation order, the coupling of durations to positions, the duration distribution, orientation and handedness, and fine spatial structure) while preserving a listed set of invariants. The classifier is refit, and the change in participant-held-out AUC is the pipeline's sensitivity to that property. Intervals come from a participant bootstrap that refits the classifier; in simulations they were conservative (99.7% coverage; standard errors about 1.8 times the empirical spread). We profiled nine descriptors on thirteen binary problems from three public datasets, with a within-fold AUC and class-balanced folds and a stated rule for which sensitivities to interpret. Of 565 intervals, 95 excluded zero; 80 were robust to the pooled AUC, 20 fold partitions and longer runs (36 of them within +/-0.05 AUC), and 45 also held with boosted trees. Most came from GazeBase (322 participants). Permuting fixation order raised the AUC of a descriptor based on mean saccade amplitude, because permuted amplitude has as its expectation the mean pairwise distance, a measure of spread. A "comprehension" contrast pooled over two programs was a contrast between their layouts: it vanished among trials of the same program, and synthetic gaze drawn from the layout alone reproduced the program contrast beneath it. For native versus non-native readers, spatial jitter at the scale of text lines reduced recurrence's discrimination. A Python package is released.
Read the full abstract
Number Theory
Simple algebraic groups with good reduction, the genus problem, and unramified cohomology
We obtain a number of new results on the arithmetic of linear algebraic groups over higher-dimensional fields. In particular, we resolve some key open questions over 2-dimensional global fields, such as the finiteness of the genus of spinor groups of quadratic forms of dimension $\geq 10$. We also extend various finiteness results to new classes of fields, including function fields of $p$-adic surfaces. Our arguments rely in a crucial way on new finiteness results for unramified cohomology.
Read the full abstract
Differential Geometry
Geometric Endpoints, Global Trajectories, and Teichmüller Projection for the Möbius-Invariant Willmore Flow
We study endpoints and conformal projection of the Möbius-invariant Willmore flow in the round three-sphere. Under uniform nonumbilicity or an integrable weighted condition, image-measure transport yields a unique finite-time integral-varifold limit. Reduced Hopf trajectories have unique anchored finite-time profile and marked conformal endpoints at arbitrary energy. Every smooth global reduced trajectory converges smoothly modulo reparametrization to an elastic profile, with quantitative rates and finite dissipation length. We compute the differential of the conformal-class projection along reduced trajectories and prove that its maximal rank persists at every finite time when it holds initially. Near the Clifford torus, Hopf tori with the same marked conformal type can have noncollinear projected velocities, ruling out a common autonomous Teichmüller equation even after positive time recalibrations.
Read the full abstract
Hardware Architecture
Practical Deep Learning-Based Block Demapping for mmWave MIMO Systems
Deep learning is expected to play a central role in 6G systems, by enabling data-driven physical layer designs that can adapt to practical wireless impairments. This is particularly important for millimetre-wave (mmWave) multiple-input multiple-output (MIMO) systems, which are strongly affected by residual channel distortions, interference, and hardware non-idealities that are difficult to capture with analytical models. In this paper, we propose a deep learning-based soft demapper that performs block-wise processing of received symbols instead of conventional symbol-wise detection. The demapper employs a one-dimensional convolutional neural network to learn temporal structure induced by practical propagation and hardware effects, while producing soft bit outputs compatible with soft-decision decoding stages. The proposed approach is trained and evaluated for a 4$\times$4 wideband mmWave MIMO system at 60~GHz, using an over-the-air dataset collected across multiple days and settings. Experimental results demonstrate consistent improvements over a conventional soft-decision demapper, including up to a 2.6$\times$ reduction in bit error rate for 16QAM and up to a 17.6$\times$ reduction for 64QAM under real over-the-air mmWave MIMO conditions. The proposed demapper is further implemented on a Zynq RFSoC platform using a reconfigurable convolution engine and fixed-point arithmetic, achieving an approximately 34.3$\times$ speedup compared to a processor-based implementation, and demonstrating that learning-based demapping can be deployed efficiently on resource-constrained edge hardware.
Read the full abstract
Combinatorics
Combinatorial Invariants for Metacyclic Groups
We study product-one invariants of finite metacyclic groups, with particular attention to metacyclic $p$-groups. For semidirect products $C_n\rtimes C_m$ such that $\operatorname{ord}_n(\ell)=m$ and $\operatorname{ord}_q(\ell)=m$ for every prime divisor $q$ of $n$, we give a short proof of the known formula for the small Davenport constant and determine the exact value of the $\eta$-constant. When $n=p$ is prime, we use Vosper's theorem to obtain a growth result for products of non-trivial conjugacy classes contained in $C_p$, from which we derive a block-saturation principle for product-one sequences. For split metacyclic $p$-groups, we determine the small Davenport constant in terms of the order and the exponent, and obtain bounds for the $\eta$-constant and the Erdős–Ginzburg–Ziv constant. The Davenport bound is also extended to finite nilpotent split metacyclic groups. Our approach relies in part on a general quotient-lifting principle for the three invariants $\mathsf d$, $\eta$, and $\mathsf s$. For non-cyclic metacyclic $p$-groups, this principle applies through the Frattini quotient, which is isomorphic to $C_p^2$. We further establish upper and lower bounds for the Erdős–Ginzburg–Ziv constant of arbitrary metacyclic $p$-groups, and show that both bounds are best possible within this class. The lifting method also provides a short proof of a known theorem of Han and Zhang for groups $C_m\ltimes C_n$ with $m\mid n$. Finally, we determine the Olson constant of the dihedral group $D_{2p}$, for every prime $p>3$, in terms of the Olson constant of $C_p$.
Read the full abstract
Cryptography and Security
Attack Injection to Vehicle Reactions: Extensible Closed-Loop Adversarial Evaluation Framework
Autonomous vehicles can use information exchanged with other vehicles and roadside infrastructure to support driving decisions. However, applications that rely on this information can make unsafe decisions when it is falsified. Studying the resulting traffic effects requires following received information through application decisions, vehicle reactions, and subsequent interactions. We present an extensible closed-loop adversarial evaluation framework built on VaN3Twin, a platform for traffic and wireless network simulation, with a diverse attack library and a labelled dataset covering benign and attack conditions. A key advantage of the framework is that it can be extended with additional attacks, message paths, receiving applications, and logging fields. The added library contains 76 configurable attack profiles adapted to message formats defined by the European Telecommunications Standards Institute. These profiles are organized into nine groups of related attacks, referred to as suites. The framework connects live attack injection and simulated network delivery to receiving applications, whose selected commands update vehicle movement. The resulting state feeds subsequent message generation, closing the loop. The dataset links physical vehicle states and message exchanges to attack labels, application decisions, selected commands, and traffic outcomes. Evaluation with individual and combined attack suites confirmed execution of all profiles, and every suite produced requests linked to attacked messages. A recorded sequence also showed a vehicle reacting to an attacked message and subsequently influencing another vehicle through an unmodified message describing its updated movement. These findings demonstrate how live injection and vehicle feedback support the study of direct and indirect effects as traffic evolves.
Read the full abstract
Quantum Physics
Proof of the Aaronson-Ambainis Conjecture: An Exposition
We give an exposition of a recent proof of the Aaronson-Ambainis conjecture, which states that every degree-$d$ polynomial $p : \{0,1\}^n \to [0,1]$ has a variable of influence at least $\mathrm{poly}(\mathrm{Var}(p)/d)$. This implies that quantum query algorithms for decision problems can be efficiently simulated classically on most inputs. It also yields a near-equivalence between the status of the $\mathsf{BPP}$ vs. $\mathsf{BQP}$ problem in the random oracle and unrelativized worlds. We organize the proof around four main steps and discuss how each connects to the literature on the analysis of boolean functions and probabilistic combinatorics. To bring out the key ideas, we do not optimize parameters, and our presentation yields weaker exponents than the original. $\textbf{Authors' note.}$ The proof was discovered by David Turturean using a research system developed at Physical Superintelligence (PSI), in combination with a non-public Anthropic model. The proof was then shared with the authors, who worked to understand it and prepare this exposition. Anthropic's public models were used in this process. The authors did not receive financial compensation from Anthropic or PSI. This article is not intended for publication at a conference or in a journal.
Read the full abstract
Statistics Theory
Sparse Fault Detection in Linear Systems: Equivalence of GLR Tests and $\ell_1$-regularized Least Squares
This paper studies the detection of an impulsive fault of unknown time and input channel in a linear system with unknown initial state and Gaussian measurement noise. First, we show that the generalized likelihood ratio test, after the initial state is eliminated by projection onto the parity space, is the zero-solution test of a weighted lasso with an unpenalized nuisance block; the regularization parameter is the test threshold, and for unknown noise variance the same holds for the square-root lasso. Second, we show that the null distribution depends on the system only through a Gram matrix, so that the threshold is computed exactly and offline, and we compare it with closed-form bounds. Third, we characterize the fraction of a fault that survives the projection: we give it in closed form through observability Gramians, we show that it converges to a geometrically decaying profile for strictly stable systems, and that, for systems with unit-modulus modes, it grows linearly with the fault time as a fraction of the record length. Numerical studies, including a two-input, two-output example, illustrate the results.
Read the full abstract
Signal Processing
Karhunen-Loève Transforms of Autoregressive Windows Based on Matched Symmetry Groups
The Karhunen-Loève transform of a window of a stationary autoregressive process of any order $p$ is described through its poles, extending the Algebraic Diversity framework, which selects a transform by the matched group. For simple roots every basis vector is a sum of at most $p$ sinusoids, at the frequencies where the spectrum equals the eigenvalue, plus modes decaying from the ends. The window covariance differs from a member of the class diagonalized by the type-II discrete cosine transform by a closed-form matrix of rank $2p$, exactly when no pole is zero, so the eigenvalues interlace spectrum samples on the cosine grid, and the coding-gain loss of the cosine transform is an exact function of that matrix with computable bounds: for the $8\times8$ Markov block of image coding at pole $0.95$ it is below 1.2 percent. By Kronecker's theorem the rank is at most $2\max(p,q)$ for rational spectra; a moving-average window departs in its Hankel corners, and an integrated (ARIMA) window departs by low rank from the type-VII sine class, exact for the random walk. The exact symmetry is generically the reflection and contains a wreath product for interleaved windows; the dihedral group of the even extension is matched approximately, the dominant pole's sign choosing cosine or sine. The two groups give the transform a fast form: a parity fold, half-length cosine cores and a cascade of at most $p$ first-order Cauchy stages, exactly $p$ for a minimal AR($p$) model. The first-order case recovers results obtained by other means.
Read the full abstract
Combinatorics
When Strategies Do Not Determine Play: Infinite Hat-Guessing Games on Subsets of the Reals
We study infinite hat-guessing games indexed by linearly ordered sets $S\subseteq\mathbb R$, where players guess sequentially using information determined by the order. While well-ordered standing sets admit the naive, recursive definition of play, we found a surprising example showing that this approach fails for non-well-ordered ones, where local decision rules do not determine a unique global outcome. By requiring uniqueness of play, we aim to provide a natural framework for hat-guessing games on arbitrary standing sets. For the classical visibility model, it was previously known due to Glivický that at most one incorrect guess can be guaranteed when $S$ is well-ordered. We prove the same result for backwards well-ordered sets, even in the case when $S$ has no first element. In the full-visibility version of the game, Glivický proved that at most one incorrect guess can be guaranteed if the standing set has a first element. We extend this result to arbitrary nonempty standing sets.
Read the full abstract
Machine Learning
GenISys: Integrated Ship Systems Design Using Subsystem-Conditional Tabular Diffussion
Ship design requires coordinating coupled subsystems to satisfy engineering constraints and balance competing performance and cost objectives. Generative artificial intelligence has supported component design, but integrated ship generation must also account for interactions among hull geometry, structure, propulsion, and operation. This paper presents GenISys, a framework for generating integrated systems, demonstrated through early-stage bulk-carrier design. Its dataset contains 217,999 proposed designs, including 16,247 that satisfy the formulated engineering constraints. The proposed simultaneous conditional denoising diffusion probabilistic model (SCDDPM) generates subsystems together, allowing each subsystem model to respond to changes elsewhere during generation. Experiments compare this approach with monolithic whole-ship generation and sequential subsystem generation across five independent training runs per architecture. In a study targeting lower cost per tonne of cargo transported, designs were generated for a required voyage range of 5,000 nautical miles. SCDDPM produced designs satisfying the formulated engineering constraints and meeting a common low-cost target in 55.70% of generation requests, compared with 51.10% for the monolithic model and 47.54% for the sequential model. These correspond to 9.0% and 17.2% more qualifying designs, respectively, while maintaining similar estimated transport costs. These results show how generative artificial intelligence can coordinate subsystems to generate feasible, high-performing integrated systems.
Read the full abstract
Artificial Intelligence
ODSA: Orchestrated Discovery and Self-Aggregation
Test-time scaling improves the accuracy of a language model's answers by spending more computation at inference time. Established methods do so either sequentially, revising a single solution over several passes, or in parallel, generating several independent solutions and selecting among them. We present ODSA (Orchestrated Discovery and Self-Aggregation), an LLM-directed scaling framework in which an orchestrator LLM is given existing test-time scaling methods as actions — discovery of a new independent solution, comparison of existing solutions to build a better one, and acceptance of a proposed answer, which triggers its verification — and directs stateless workers to carry them out. The orchestrator does not solve the problem itself: it allocates computation, feeds the results of earlier actions into later ones, and takes every action from a single context, so that each decision is informed by everything tried before. On Humanity's Last Exam, ODSA improves accuracy by 4.7 to 18.0 points across three models over a single direct call to the model with no test-time scaling. On LiveCodeBench, where a single direct call already solves most problems, it improves accuracy by 0.6 to 14.0 points.
Read the full abstract
Analysis of PDEs
A Talenti-type rigidity theorem and P-function constraints for the Pompeiu–Schiffer problem in every dimension
Schiffer's conjecture asserts that the ball is the only bounded domain, with boundary homeomorphic to a sphere, carrying a nonconstant Neumann eigenfunction of the Laplacian that is constant on the boundary; for such domains it is equivalent to the Pompeiu problem. In 2026 it was disproved in the plane and in many higher dimensions by computer-assisted and analytic constructions. We study what survives. Our main result is a Talenti-type theorem valid in every dimension $N\ge2$: if the eigenfunction $u$ stays strictly below its boundary value $c>0$, then $kR^*\ge j_{N/2,1}$, where $k^2$ is the eigenvalue, $R^*$ the radius of the ball of equal volume and $j_{N/2,1}$ the first positive zero of $J_{N/2}$; equality holds only for the ball. We compare this threshold with the unconditional bound $kR^*\ge 2^{1/N}j_{N/2-1,1}$ given by the Krahn–Szegő inequality. Using Payne's P-function $P=|\nabla u|^2+\lambda u^2$ we prove that every Schiffer domain satisfies $\max|u|>\sqrt N\,|c|$, together with pointwise and distance bounds. We correct the shape-optimization approach of an earlier work by computing the optimality condition of the associated boundary functional with an adjoint state. Using the transcendence of the zeros of Bessel functions of integer and half-integer order, we prove the infinitesimal rigidity of the ball, in every dimension, both for the Schiffer problem and for the Berenstein problem. Finally, we reconstruct numerically the convex four-dimensional counterexample of Guo and check the above statements on it.