Exactly Solvable and Integrable Systems
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 2 September
We construct isomonodromy transformations for linear $q$-difference systems of the form $Y(qz)=A(z)Y(z)$, where $A(z)=A_0+z A_1$ has diagonal leading coefficient. These transformations shift eigenvalues of the leading coefficient $A_1$ together with roots of $\det A(z)$. They lift compatibility to the right eigenpairs of $A(z)$, yielding a discrete local tau function. The resulting deformation equations preserve the Birkhoff connection matrix, and reduce in their $q\to 1$ limit to the isomonodromic deformation of a meromorphic connection on $\mathbb P^1$ with an irregular singularity of Poincaré rank one at $\infty$.
Instrumentation and Methods for Astrophysics
The Impact of Artificial Space Objects on Optical Astronomy as Determined from 32 Million Photometric Observations
Photometric observations of satellites, rockets and space debris brighter than magnitudes 6.0, 7.0 and 8.0 are characterized. Those magnitudes pertain to different levels of interference with astronomy as defined by the International Astronomical Union. The densities of objects per square degree of sky and brighter than the magnitudes listed above are 0.38 e-3, 0.76 e-3 and 1.10 e-3, respectively. Probabilities of objects appearing on astronomical images depend on the field of view and the exposure duration. For objects brighter than magnitude 7.0 the probability that one will appear on a 10 second exposure of a 10 degree square field of view is 15%. The probability that an object is visible to the unaided eye under dark sky conditions is 59%. These percentages represent all nighttime hours. We discuss how they change with the Sun's distance below the horizon. Examination of data for objects launched since the start of the spacecraft constellation era shows that satellites account for most of the bright observations. If the plans of satellite operators to launch a million spacecraft are realized, nearly every astronomical image of a few seconds duration and several degrees in size may be contaminated during several hours of each night. Finally, people viewing the night sky may perceive satellites more strongly than stars.
Read the full abstract
Earth and Planetary Astrophysics
POSEIDON III: The Aligned Orbit of the Hot Neptune Around the Hot Star WASP-195
Stellar obliquities provide important clues as to the formation and migration histories of planetary systems, but measurements remain scarce for Neptune-mass planets, especially those orbiting hot stars (above the Kraft break). Here we present observations of the Rossiter-McLaughlin effect in the hot-star/hot-Neptune system WASP-195 ($T_{\rm eff}=6470\pm100$ K, $v\sin{i_\star}=10.5\pm1.1$ km s$^{-1}$) obtained with the Keck Planet Finder and NEID spectrographs. A joint analysis of these observations, archival photometry, and archival radial velocities yields a sky-projected stellar obliquity of $\lambda=-10\pm7^\circ$, consistent with spin-orbit alignment. This makes WASP-195 one of the few hot-star/hot-Neptune systems with a measured obliquity. Archival radial velocities from SOPHIE exclude Jupiter-mass planets within approximately 3 au at $5\sigma$ confidence. The aligned and nearly circular orbit is naturally consistent with a history of disk-driven migration, although coplanar high-eccentricity migration or Roche-lobe overflow cannot be ruled out. We also investigate why so few Neptunes around hot stars have measured obliquities. Their scarcity likely reflects a combination of the lower intrinsic occurrence of short-period Neptunes around hot stars and the difficulty of confirming planet candidates in this regime, where rapid stellar rotation broadens spectral lines and hampers conventional radial-velocity confirmation. Rapid rotation also increases the detectability of the Rossiter-McLaughlin effect, a feature that could help to widen the planet confirmation bottleneck while expanding the obliquity census of small planets around hot stars.
Read the full abstract
Machine Learning
A Common Measure of Communication for Speech Brain-Computer Interfaces
Speech brain-computer interfaces (speech BCIs) translate neural activity into language, offering a path towards restoring speech for people with paralysis and, more broadly, enabling new forms of natural human-computer interaction. Despite this promise, the field lacks a common measure of progress because systems use different datasets, recording methods, types of speech, and vocabularies, so their reported scores are rarely comparable. Underlying this measurement problem are two unresolved questions: (i) what distribution of words should a speech BCI enable a user to communicate, and (ii) how much information from this distribution can a system convey. We address both by deriving open-vocabulary mutual information (OVMI), an information-theoretic quantity that measures the information conveyed by a decoder relative to a reference distribution over the words a user may wish to communicate. This allows capabilities measured under different conditions, such as distinct vocabularies, to be evaluated on a common communication scale. We show that ordinarily reported accuracy, word error rate (WER), and other metrics computed only over the words a system supports can overstate how much of a user's intended speech the system can communicate. We then use OVMI to compare existing systems, expose trade-offs between how much of the user's language a system supports and how accurately it decodes those words, show that these comparisons depend on what the user is expected to communicate, and demonstrate that selecting a vocabulary to maximise OVMI yields up to 16.3% relative improvement in accuracy across three speech domains. OVMI therefore provides the speech BCI community with a principled way to compare heterogeneous systems, improve vocabulary design, and measure progress in the field.
Read the full abstract
Computer Vision
SolarWM: Open Data and Scalable Training for Long-Horizon Video World Models
We introduce SolarWM, a fully open foundation for building interactive video world models from data preparation through long-horizon inference. Training across heterogeneous data sources and video backbones is challenging: datasets differ in temporal scale, camera geometry, visual quality, motion, and captioning styles, while video generators use distinct representations and architectures. Naive data mixing and model-specific implementations therefore produce inconsistent supervision and make results difficult to reproduce and compare. SolarWM addresses this coupling with a reconfigurable multi-source data engine and a backbone-native adaptation framework. The engine converts 1.43 million canonical clips from 10 datasets into a unified, frame-aligned contract covering visual observations, metric camera geometry, captions, quality metadata, selection decisions, and provenance, while decoupling source processing from mixture construction. Under shared camera-conditioning, training, and inference interfaces, we instantiate four 5B–33B models based on Wan2.2, LTX-2.5, and MiniMax-H3 while preserving their native representations and objectives. A unified three-stage recipe combines bidirectional adaptation, teacher-forced autoregressive initialization, and distribution matching distillation. The resulting causal models enable real-time interaction over rollouts ranging from minutes to hours after being trained on only 5s sequences. By releasing the resulting data, pipeline, recipes, weights, and framework, SolarWM provides a reproducible and extensible foundation for interactive world-model research.
Read the full abstract
Artificial Intelligence
Discriminative World Models for Web Agents
Recent web agents use world models for test-time action selection by sampling candidate actions, predicting the resulting web states, and ranking them with a ranker model or a Process Reward Model (PRM). These world models are typically trained via supervised next-state prediction to generate fixed representations like HTML or AXTree snapshots. However, this objective is misaligned with the downstream ranker, which relies on predicted states being discriminative across candidates to accurately score them. To address this, we introduce predicted-state matching, a training objective where the predicted representation must distinguish the true resulting state from those reached by alternative actions. We train these models using a branching web-agent dataset derived from WebArena Go-Browse trajectories, where every decision point contains multiple alternative actions and their resulting states. Experiments on our held-out predicted-state matching benchmark show that our approach outperforms world models trained with supervised next-state prediction. We further show that our approach improves PRM-style action ranking on WebPRMBench compared with action-only PRMs and PRMs augmented with supervised-next-state world models. Finally, on WebArena-Lite, using our world model for test-time action selection improves end-to-end task success. Our project page is available at: https://dhruvpendharkar.github.io/dwm/.
Read the full abstract
Dynamical Systems
Chebyshev's method applied to polynomials with rotational symmetry
We investigate the dynamics of Chebyshev's method applied to the polynomial family $p_n(z)=z(z^n-1)$ for $n>1$. The resulting map is denoted by $C_n$. It is proved that the immediate basins corresponding to the non-zero roots are unbounded and simply connected. We also show that the Julia set of $C_n$ is connected. It is proved that the immediate basin of the root at the origin exhibits a different behavior: it is unbounded for $n\leq 16$ and bounded for $n\geq 17$. We establish that $C_n$ is convergent whenever $n\leq 16$ or $n$ is odd. Finally, we determine the symmetry group of $C_n$ and prove that it coincides with the symmetry group of the polynomial $p_n$, thereby confirming, for this family, a conjecture proposed by Nayak and Pal.
Read the full abstract
Materials Science
Repairing PBE-Spurious Metallicity for HSE06-Level Screening of 2D Photocatalysts for Green Hydrogen Production
Semilocal PBE calculations can remove viable photocatalysts before screening by labeling narrow-gap semiconductors as metals. We address this failure mode in the Computational 2D Materials Database (C2DB) by combining leakage-aware repair of PBE-spurious metallicity with HSE06–PBE $\Delta$-learning. Stage~I classifies HSE06-unknown PBE metals using structural, chemical, magnetic, and stability descriptors, while excluding HSE06/GW quantities and PBE electronic shortcuts. Stage~II learns $E_g^{HSE} - E_g^{PBE}$ for the corrected insulating population. The curated XGBoost regressor reconstructs HSE06 gaps with a mean absolute error of 0.108~eV ($R^2=0.989$), compared with 1.036~eV for raw PBE. The Stage~I classifier is used only for triage because the labeled true-metal class contains 29 materials; its best holdout performance gives 87.5% accuracy, 0.286 true-metal recall, and 0.643 balanced accuracy. The corrected pH~0 electronic screen yields 10 strict and 29 initial relaxed green-hydrogen photocatalyst candidates. Four strict and 18 relaxed candidates would fail the same 1.6–2.8~eV gap window at the PBE level. Targeted VASP HSE06 calculations for six ML-predicted compounds give material-level MAEs of 0.417, 0.182, and 0.110~eV for the C2DB-native, Magpie+structural, and curated models, respectively; \feat{1AgBr-1} shifts above the upper gap cutoff, leaving 28 retained relaxed candidates. The workflow shows that high-fidelity correction must be evaluated by candidate membership, not only by global regression error.
Read the full abstract
Number Theory
A new proof that more than $2/3$ of the zeros of the Riemann zeta function are simple and on the critical line
We obtain a new, conceptually simpler, unconditional proof that more than $67.25\%$ of the non-trivial zeros of the Riemann zeta function are simple and on the critical line, and that at least $83.62\%$ of the non-trivial zeros are distinct. Our approach also yields two new unconditional estimates on simple zeros and zeros on the critical line. More precisely, we prove that the proportion of zeros that are simple or lie on the critical line (or both) is at least $88.76\%$, and that the average of the proportions of simple zeros and of zeros on the critical line is at least $83.62\%$. A proof of the bounds for simple zeros on the critical line and for distinct zeros was very recently produced by an internal research version of Claude developed by Anthropic and subsequently verified by two mathematicians at Anthropic, Levent Alpöge and Ralph Furman, whereas our two additional estimates are neither stated nor proved in the Claude paper. The argument produced by Claude is technically intricate, and its main mechanism is not immediately transparent. It combines several ingredients from linear algebra, including a finite-dimensional matrix representation of Weil's Hermitian form and a rank–trace inequality for Hermitian matrices, with a second moment calculation over the zeros using the explicit formula. Our new approach proceeds by replacing the entire finite-dimensional matrix framework by a single Hilbert space inequality, which allows for a direct application of Montgomery's theorem on the pair correlation of zeros of the zeta function, in the unconditional form obtained by Baluyot, Goldston, Suriajaya and Turnage-Butterbaugh.
Read the full abstract
Machine Learning
Graph Machine: Towards Better Pretraining via Edges
We introduce the Graph Machine (GM), an architecture that maintains an $O(n)$-sized state and accesses it through sparse, dynamic routing. Unlike methods with fixed-size states or sparse but static routing, GM preserves $O(n)$ complexity in its sparse layers without restricting the potentially accessible state size to $O(1)$. Instead, GM uses edges - pointer-like objects updated differentiably by a referral mechanism resembling pointer chasing. We replace 75% of the dense Transformer layers in Qwen3-0.6B with GM sparse layers and pretrain from scratch on 15.7B tokens. With only 2 of 4,096 tokens retrieved per KV head in each sparse layer, loss degrades only slightly; with 4, the best model marginally improves loss.
Read the full abstract
Cryptography and Security
Overcoming the Randomness-Utility Trade-off in Answering Differentially Private Linear Queries
We study the question of answering linear queries with differential privacy using few (expected) random bits. We provide a randomness-efficient analog of the $\| \cdot \|_K$-norm mechanism of Hardt and Talwar [HT10]. For the $\ell_\infty$-error, our algorithm can answer $d$ linear queries with $O(d / \varepsilon)$ error using $O(\log d)$ random bits, improving upon algorithms of Canonne et al. and Ghentiyala [CSV25, Ghe26]; this is optimal when $\varepsilon \le 1/d$. We also provide a computationally efficient version of our algorithm, albeit with an $O(\log d)$ multiplicative increase in the error.
Read the full abstract
Analysis of PDEs
On the cut locus of Hamilton–Jacobi equations I: structure and propagation via the touching approach
For a semiconcave function with linear modulus, we introduce the cut locus through a touching approach and prove that it coincides with the variational cut locus defined via the Lax–Oleinik semigroup, independently of the Hamiltonian. Cut points are characterized by the emptiness of the proximal subdifferential of $\phi$, which we use as the analytic criterion behind the touching definition. We introduce the degree of regularity $R_\phi$, which measures the $C^{1,1}$ deviation of $\phi$, and prove the quantitative relation $R_\phi(x)\sim 1/\tau_{\phi,H}(x)$ with the cut time function, valid pointwise up to explicit truncation constants. From this relation we derive a separation estimate for calibrated curves, showing that no conjugate points occur before the cut locus. This estimate supplies the tools for the propagation results. Cut points propagate globally along generalized characteristics for the evolutionary Hamilton–Jacobi equation, and Alexandrov points propagate forward along calibrated curves, with the second derivative satisfying a matrix Riccati equation. We also show that the cut locus is a Lebesgue null set and give a streamlined proof of Alexandrov's theorem. Finally, we give necessary and sufficient conditions for the cut locus of a weak KAM solution to be closed, in terms of the cut time function, the $C^{1,1}$ support, and the degree of regularity.
Read the full abstract
Differential Geometry
Finite-Time Singularities of the Kähler–Ricci Flow on Fano Bundles
We study collapsing finite-time singularities of the unnormalized Kähler–Ricci flow on Fano bundles arising in the analytic minimal model program. For a Fano bundle $X^n\rightarrow Y^m$, we prove a maximal splitting theorem by the Kähler-Ricci flow that every tangent space at a fixed limiting point splits globally as \((\C^m,g_{\rm E},J_0)\times(Z',d',J')\). If the fibre has complex dimension one, we prove a global Type-I bound for the full curvature tensor and show that the ambient and intrinsic diameters of every fibre are uniformly comparable to \(\sqrt{T-t}\). Furthermore, every tangent flow at any fixed limiting point is the round shrinking cylinder \(\C^m\times\PP^1\).
Read the full abstract
Accelerator Physics
Controlling a digital twin of the CEBAF injector from EPICS
The Experimental and Instrumental Control System EPICS is used to control magnets and to read data from diagnostic devices in the CEBAF accelerator. We describe a prototype system where an EPICS installation, local on a laptop or Raspberry Pi, controls beam optics simulations. They can be running on the same computer or on a separate computer connected via the network. The prototype focuses on modeling and controlling the moderately complex injector beam line of CEBAF, which only comprises a few dozen magnets and beam monitors.
Read the full abstract
Mathematical Software
GRADSOLVE: fast exact gradients for ODE ensembles on GPUs
Ordinary differential equations (ODEs) underlie models in science and engineering, and many applications need derivatives of their solutions with respect to parameters. Ensembles of independent trajectories suit graphics processing units (GPUs), but current GPU software forces a trade-off: the fastest ensemble solvers cannot be differentiated in reverse mode at the speed they solve, and the solvers built for differentiation solve more slowly. No single tool has yet offered a reverse-mode gradient at the speed of a fused-kernel solve. We present GRADSOLVE, an open-source JAX library for solving and reverse-mode differentiating low-dimensional ODE ensembles on NVIDIA GPUs. It records the steps an adaptive solver accepts and differentiates a fixed-step replay of them; the returned gradient is the exact discrete adjoint of those steps, the same derivative Diffrax returns by default, obtained more cheaply from a fixed-length chain than from an adaptive loop. It targets ensembles differentiated many times against one recorded mesh, keeps Diffrax as a fallback, and supports explicit and Rosenbrock integrators. Used as a solver, GRADSOLVE's forward-only kernel ran 2.8x faster than DiffEqGPU.jl; used for gradients, once a record exists, it computed them 5.6-14.1x faster than Diffrax's checkpointed adjoint at matched forward-state accuracy across three GPU generations, the advantage narrowing on large ensembles and, on stiff systems, down to parity at tight accuracy. GRADSOLVE is released at https://github.com/ECLIPSE-AI4Science/gradsolve.
Read the full abstract
Statistics Applications
Learning CNN Filters via Generalized Stein's Method
Convolutional Neural Networks (CNNs) have undoubtedly revolutionized image data analysis and the field of computer vision. As the cornerstone of CNNs, the convolution operation enables the networks to extract abstract features and uncover hidden relationships in the image data. This paper considers the problem of estimating convolution filters from a statistical perspective using a classical tool — Stein's formula. We first formulate CNNs into a general index model with matrix-valued input, where convolution filters can be viewed as index vectors. Furthermore, we propose a novel singular value decomposition (SVD) based approach to accurately learn the convolution filters based on a generalized version of the first-order Stein's formula. Theoretical analysis suggests that our estimation achieves an optimal convergence rate, comparable to that of generalized linear models where the link function is known. Extensive simulation studies and real data analyses demonstrate that our approach outperforms popular deep learning algorithms, such as Adam. Notably, our method extends beyond filter estimation and can be applied to nonlinear dimension reduction, providing a viable pathway for representation learning.
Read the full abstract
High Energy Physics (Phenomenology)
Radiative and Dalitz decays of $\Upsilon(1S)$ in the light of the ATOMKI X17 anomaly
We study the radiative decay $\Upsilon(1S)\to \eta_b\gamma$ and the Dalitz decay $\Upsilon(1S)\to \eta_b e^+ e^-$ within the framework of the Covariant Confined Quark Model. We provide theoretical predictions for the hadronic form factor, the radiative decay constant, and the decay branching fractions. Within the Standard Model we predict $\Gamma(\Upsilon(1S)\to\eta_b \gamma) = 9.3(9)\, \textrm{eV}$ and $\Gamma(\Upsilon(1S)\to\eta_b e^+ e^-) = 4.8(5)\times 10^{-2}\, \textrm{eV}$. The contribution of the hypothetical ATOMKI $X17$ vector boson to the Dalitz channel is also investigated.
Read the full abstract
Programming Languages
Causal Probabilistic Programming via Magmadic Do-Notation
We introduce a do-notation metalanguage for causal probabilistic programming. The metalanguage is based on magmads: non-associative monads. We derive causal probabilistic programming constructs from non-associativity and the primitives of probabilistic programming.
Game Theory
Approximately Efficient Multidimensional Bilateral Trade
A central challenge in mechanism design is to develop truthful trade mechanisms that maximize the expected gains-from-trade (GFT) in two-sided markets. Because achieving the full GFT is generally impossible, the literature has focused on constant-factor approximations—a notoriously difficult problem even in simple settings. It was only recently that a breakthrough result by [DMSW22] achieved a constant-factor approximation for single-item bilateral trade. The same guarantee was later extended to single-dimensional matching markets with general downward-closed constraints [BRTW26]. Most existing results, however, are limited to single-dimensional agents. A notable multi-dimensional exception is [CGMZ21]. They considered a market with one constrained-additive buyer and $n$ single-dimensional sellers and provided a mechanism that achieves a $\log^2(n)$ approximation to the second-best GFT, i.e., the maximum expected GFT theoretically achievable by any mechanism satisfying Bayesian Incentive Compatibility (BIC), Interim Individual Rationality (IIR), and ex-ante Weak Budget Balance (WBB). In this paper, we study multi-dimensional bilateral trade problem where both sides of the market are multi-dimensional. We start with one buyer with XOS valuation and one seller with an additive cost function. We then generalize to a market with $n$ XOS buyers and one additive seller. Assuming independent items' values and costs, in both settings we propose simple mechanisms that are BIC, IIR, and ex-ante WBB, while achieving a constant fraction of the optimal (first-best) expected GFT.
Read the full abstract
Classical Analysis and ODEs
Estimating the number of real zeros of linear combinations of radicals of polynomials
We obtain upper bounds for the number of real zeros of functions of the form $$ f(x) = \sum_{k=1}^{n} c_k \bigl(P_k(x)\bigr)^{\alpha_k}, $$ where $c_k, \alpha_k \in \mathbb{R}$ and each $P_k$ is a real polynomial of degree at most $d$ that is non-negative on an interval $I\subset \mathbb{R}$. We improve previously known exponential upper bounds for the number of roots on $I$ to bounds that are polynomial in $n$, linear in $d$, and independent of the exponents $\alpha_k$. For linear combinations of square roots of positive quadratic polynomials on $\mathbb{R}$ we prove the linear bound $2n$, answering a question of N.~Alon. A modification of the argument yields a linear bound for a question of A.~Gabrielov, D.~Novikov, and B.~Shapiro related to Maxwell's conjecture. The article describes two independent approaches: an elementary ODE method in the general case, which also gives a polynomial bound for the number of critical points of one dimensional Gaussian mixtures, and a PDE method for the case of positive quadratic polynomials, which connects the problem to the number of nodal domains of solutions to $\Delta u + \lambda u = 0$ on the punctured hyperbolic plane. As a byproduct of the second approach, we describe a curious relation between axially symmetric harmonic functions on $\mathbb{R}^3\setminus\{(x,0,0)\}$ and Laplace-Beltrami eigenfunctions on the hyperbolic plane with eigenvalue $1/4$.
Read the full abstract
Optimization and Control
Gaussian-Restricted Barycenters for KL-Unbalanced Optimal Transport: Variational Theory and Fixed-Point Convergence
We study Gaussian-restricted barycenters for quadratic two-sided Kullback–Leibler unbalanced optimal transport with independent marginal penalties and no coupling entropy. Exact profiling of the barycenter mass reduces the problem to a smooth Gaussian shape functional with endogenous Gibbs weights. We establish global attainment, derive the stationary moment equations, and construct a reverse-KL majorization–minimization (MM) iteration whose full sequence converges from every nondegenerate Gaussian initialization to a stationary fixed point. The diagonal second variation induces a parallel-sum tensor coupling the Bures–Wasserstein and Fisher–Rao metrics; its finite-mass extension admits a radial cone representation. Under common penalty scaling, global minimizers converge to a Gaussian Wasserstein barycenter with effective weights; for sufficiently large penalties, the minimizer is unique and admits a first-order analytic expansion. In the small-penalty regime, the distance of every global minimizer to the compact maximizer set of a weighted Chernoff affinity functional vanishes with respect to the mean–covariance parameter distance. Numerical experiments illustrate MM descent, local contraction, and the two penalty limits.
Read the full abstract
Statistical Methodology
Statistical Inference for Probability Barycenters and Kolmogorov Moments
A probability coordinate chart is a continuous strictly increasing bijection that transports observations to the open unit interval, where averaging is always well defined. For barycentric inference, the first coordinate moment is returned through the inverse chart. Higher initial coordinate moments similarly generate initial Kolmogorov moments by pullback, while centred coordinate moments remain on the probability scale. We develop inference for these quantities under fixed, intrinsic, and estimated charts. For a fixed benchmark chart, the coordinate mean is the primary inferential object. Confidence intervals are constructed on the probability scale and then transported through the inverse chart, preserving the geometry and allowing asymmetry on the observation scale. Hoeffding's inequality also provides finite-sample distribution-free intervals. The intrinsic case requires different treatment. The empirical cumulative distribution function is not an admissible chart, and its natural generalised plug-in construction collapses exactly to a middle order statistic. Feasible intrinsic inference therefore reduces to median inference. This self-induced functional is distinguished from the frozen oracle construction, which has a different asymptotic variance. For estimated location-scale charts, the asymptotic expansion contains a calibration correction for the first-order effect of learning the chart from the same sample. This yields an influence-function variance estimator and a bootstrap procedure that recalibrates the chart in every resample. Joint covariance theory is developed for vectors of initial and centred coordinate moments, with initial Kolmogorov moments obtained by inverse-chart pullback. The framework separates variation on the probability scale, amplification by the inverse chart, and uncertainty from chart calibration.
Read the full abstract
High Energy Physics (Phenomenology)
Inelastic Dark Photon Dark Matter for the LUX-ZEPLIN High-Recoil Event and the Galactic Halo Gamma-Ray Excess
We show that a dark-photon dark matter framework can simultaneously account for two recently reported anomalies: the halo-like Galactic gamma-ray excess identified by Totani in 15 years of Fermi-LAT data, and the $E_{\rm nr}=248\pm23\,({\rm stat})\pm23\,({\rm sys})$ keV nuclear-recoil event of interest reported by the LUX-ZEPLIN Collaboration. The dark matter is a $U(1)_X$ dark photon $X$ with mass $m_X=420$ GeV, stabilized by a dark parity that forbids kinetic mixing with the Standard Model photon. A light scalar mediator $\phi$, required to explain the Totani excess via Sommerfeld enhancement, is joined by a second light scalar $\phi'$ that couples a nearly degenerate heavier vector partner $V$ to $X$. The resulting inelastic transition $X+N\to V+N$, with mass splitting $\delta\simeq316$ keV close to the kinematic endpoint for $m_X=420$ GeV, naturally reproduces the localized LZ event once the detector energy resolution is included, while leaving the relic abundance and the halo phenomenology of the original Totani-motivated benchmark essentially unchanged.
Read the full abstract
High Energy Astrophysical Phenomena
Magnetized accretion onto rapidly spinning binary black holes: mini-disk thermodynamics, magnetic transport, and dual jets
Supermassive binary black holes embedded in gas-rich environments are promising multi-messenger sources for pulsar timing arrays and future space-borne gravitational-wave interferometers. Their electromagnetic emission is governed by nonlinear plasma dynamics around the binary and is expected to inherit variability associated with the orbital motion thereof. Because active galactic nuclei are intrinsically stochastic, identifying robust binary signatures requires predictive models that connect large-scale circumbinary flows to the black holes. Previous relativistic simulations of accreting binaries have mostly focused on smaller separations and lower spins. We perform three-dimensional general relativistic magnetohydrodynamic simulations of a relaxed, magnetized circumbinary disk accreting onto an equal-mass binary black hole with a separation of $30$ gravitational radii and dimensionless spin $\chi=0.9$. At these separations, the mini-disks around each black hole are persistent mass reservoirs but still show pronounced amplitude modulations governed by the eccentric circumbinary disk and the sloshing gas between the mini-disks. We analyze how the magnetic flux is transported from the circumbinary disk to the horizons, launching powerful dual jets with energy extraction efficiencies reaching $\approx 40\%$. The horizon-threading flux and jet luminosity alternate between the two black holes, producing an on-off dual-jet state. The wide jet funnels interact above the binary and form a persistent current sheet favorable to reconnection. We explore the influence of mini-disk thermodynamics, comparing efficient and inefficient cooling inside the cavity. Hotter mini-disks are less massive, exhibit weaker coherent periodicity, and launch less luminous jets despite comparable horizon-threading magnetic flux.
Read the full abstract
Cryptography and Security
When Does Authorization End? Effect Closure at Provider Boundaries
Revocation completion, clean state, or operation success can leave authorized work able to cause an effect the application rejects while the provider stays within its contract. We call the absence of all such paths policy-relative effect closure, or effect closure for short. Thus, a grant is closed when its existing authorizations retain no such path, and it cannot issue any new ones. We present EFFECTBOUND, which uses an evidence-supported finite contract to decide whether an interface can truthfully report closure while required work completes. It reduces this to finite control with hidden state and returns a strategy, an impossibility certificate, or no verdict when evidence is insufficient. Machine-checked proofs establish the reduction and checker soundness; the checker derives closure results and validates certificates. Across GitHub, Kubernetes, NATS, and Kafka, closure fails in three ways: an interface lacks a needed control, clean visible state hides active work, or the model stops before the effect frontier—the last point where the effect can be prevented. The GitHub tool cannot bind a merge to the reviewed commit; a controlled run confirms that it may merge a different commit. NATS can report no stored or pending messages while dispatched work can still publish downstream. In Kafka, all fixed-set brokers had applied the revocation, yet an earlier authorized request could still append. We add a gate that blocks new use of revoked authority and delays return until earlier in-flight work completes. In a fixed-set Kafka~4.3.1 test deployment, this closes the studied synchronous, nontransactional write path without blocking unrelated requests. For a grant, authorization ends only when issuance stops and no earlier authorization can reach an effect the application rejects.
Read the full abstract
Quantum Physics
A quantum oracle separation between QMA(2) and QMA
We find a quantum oracle relative to which $\mathsf{QMA} \neq \mathsf{QMA}(2)$. As a consequence, we resolve the no-disentanglers conjecture of Watrous: for every $\epsilon+\delta<1$, any $(\epsilon,\delta)$-disentangler requires input size exponential in the number of output qubits. Our proof combines the unitarily invariant polynomial method of She and Yuen (ITCS '23) with a new construction based on the symmetric and antisymmetric subspace projectors, reducing the $\mathsf{QMA}$ lower bound to the approximate degree of $\mathrm{OR}$.
Read the full abstract
Computer Vision
Thinking in Pictures: A Systematic Benchmark for Reasoning-driven Image Generation
Recent advancements in unified generative models (UGMs) and world simulators have achieved unprecedented results in visual perception and synthesis. However, these models primarily rely on surface-level event alignment, leaving the capacity for high-level visual reasoning underexplored. True visual generative intelligence demands "Reasoning-to-Generation", an ability to infer latent rules from visual inputs and manifest solutions through precise, logically constrained visual outcomes. We introduce RIG-BENCH, a novel comprehensive benchmark that systematically evaluates Reasoning-driven Image Generation (RIG) across four cognitively demanding domains: Concept-based, Transformation-based, Pattern & Structure, and Scenario-based. Featuring 2000 curated samples, RIG-BENCH serves as a rigorous stress test for RIG. Our extensive evaluations of state-of-the-art UGMs and image/video generation models reveal a significant reasoning-generation gap, wherein models frequently produce locally plausible but globally illogical outputs. RIG-BENCH provides a vital diagnostic framework to guide the development of next-generation, logically grounded UGMs and world simulators.
Read the full abstract
High Energy Astrophysical Phenomena
Vortex pinning and the elastic response of neutron-star crusts II. Non-axisymmetric loading and Magnus mountains
Pinned superfluid vortices transmit a Magnus force to the neutron-star crust. A non-axisymmetric component of the superfluid-lattice lag can therefore support a persistent mass quadrupole. We calculate the l=m=2 response of self-gravitating, radially stratified spherical stars with SLy4 and BSk21 backgrounds, using a local microscopic pinning cap and a density-dependent Coulomb-lattice shear modulus. For a 1.4 M_sun star at 100 Hz, the equilibrium-compression maxima are epsilon=2.67x10^-9 (SLy4) and 2.44x10^-9 (BSk21). The global quadrupole is strikingly insensitive to the shear prescription: replacing mu=0.01P by the Coulomb profile and strongly varying uncertain edge layers changes the result only at the percent level. The dominant internal sensitivity is instead compressional. A density-resolved compressional kernel increases through the inner crust and steepens close to the crust-core interface, particularly for BSk21, showing that the deep inner crust controls the EoS dependence of the mountain. A fixed-composition calculation is used only as a non-relaxed sensitivity diagnostic, not as the secular prediction. At a common true local velocity benchmark, our fiducial ellipticities remain more than an order of magnitude below the complementary two-component cylindrical calculation of Gangwar & Jones (2026). We argue that the comparison points to the relative superfluid-lattice degree of freedom as the natural next ingredient for a common spherical model. The main result is therefore physical rather than numerical: the Magnus-mountain scale is robust to shear microphysics, while the deep-crust compressional response sets the leading uncertainty of the one-displacement model.
Read the full abstract
Numerical Analysis
Continuous data assimilation in steady Navier-Stokes equations with unknown viscosity: robust and efficient solvers and fast parameter recovery
Recent advances in equation discovery methods such as SINDy have highlighted the growing interest in identifying governing parameters and models directly from data. In this work, we take a complementary approach grounded in analysis and numerical PDE methods: we recover an unknown viscosity in steady Navier-Stokes equations (NSE) from partial incompressible flow observations using continuous data assimilation (CDA). We propose a simple and efficient parameter recovery algorithm and also a nonlinear solver for CDA-NSE. Together, this creates a highly efficient technique for recovering an unknown viscosity from partial solution data. Our analysis establishes the well-posedness of steady CDA-NSE, quadratic convergence of the parameter recovery algorithm, and quadratic convergence of a CDA-Picard + CDA-Newton nonlinear solver. Numerical experiments illustrate that the methods are very effective in restoring parameters quickly, even with poor initial guesses.
Read the full abstract
Robotics
Towards Trustworthy Autonomous Robots: An Explainable AI-Based Decision Framework
Autonomous robots powered by deep learning face a fundamental auditability challenge: when incidents occur, investigators cannot reconstruct why the system made specific decisions. This paper presents TRACE (Transparent Reasoning Architecture for Credible Execution), a decision framework that ensures every autonomous action can be traced back to sensor evidence through documented causal chains. The framework organizes decision-making into four auditable layers: Semantic Perception for evidence-grounded entity recognition, Belief Reasoning for probabilistic state estimation with causal graphs, Action Synthesis for constraint-aware planning with counterfactual documentation, and Execution Verification for compliance monitoring. TRACE is model-agnostic yet designed to integrate learning-based perception modules (CNNs, transformers) while preserving decision-level auditability. We evaluate the framework using three objective metrics: Evidence Traceability (sensor-to-decision linkage), Decision Reconstructability (post-hoc analysis capability), and Temporal Continuity (audit trail completeness). Experimental evaluation on warehouse robot navigation demonstrates that TRACE achieves 98.6% evidence traceability, 99.0% temporal continuity, and 98.1% decision reconstructability across 500 simulated decision cycles. Post-hoc methods like LIME provide feature attributions but lack the artifact structure needed for decision-level reconstruction. The framework addresses EU AI Act requirements for high-risk system transparency and contributes to Explainable AI for safety-critical autonomous systems.