Peer Revenue Now accepting positions

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Monday 9 November

Quantum Physics

An efficient classical algorithm for OTOCs in chaotic quantum dynamics

Estimating out-of-time-ordered correlators (OTOCs) in individual instances of random quantum circuits has been proposed as a candidate for verifiable quantum advantage, and demonstrated to be hard for conventional classical algorithms such as tensor networks and Monte Carlo. Using insights from quantum chaos, we develop and implement a polynomial-time classical algorithm for the four-point ${\rm OTOC}^{(1)}$ and the eight-point ${\rm OTOC}^{(2)}$ in typical instances of one-dimensional (1D) quantum circuits. Our results demonstrate average-case classical tractability of estimating OTOCs in the sensitive regime where circuit-to-circuit fluctuations are large. Our algorithm organizes the OTOC into a rapidly converging series, where the leading term includes contributions from histories within permutation degrees of freedom in the replicated Hilbert space, and subleading terms arise from excursions outside this space. Although chaos is often viewed as an insurmountable barrier to classical simulation, our algorithm exploits a form of dephasing caused by chaos, which suppresses the subleading terms. We provide strong theoretical and numerical evidence to support this suppression. Further, we demonstrate that practical implementations of our algorithm estimate ${\rm OTOC}^{(1)}$ and ${\rm OTOC}^{(2)}$ in 1D circuits with high accuracy, achieving higher signal-to-noise ratio at larger circuit depths compared to recent 2D experiments by Google. Extending our algorithm to higher dimensions, and resolving the status of quantum advantage in 2D OTOCs, remain open problems.
Read the full abstract

All authors Yunchao Liu, Yihui Quek, Shreya Vardhan, Tianci Zhou

Cosmology and Nongalactic Astrophysics

Gravitational waves and the exit from de Sitter in Inflation without an Inflaton

In Inflation without an Inflaton (IWI), second-order de Sitter (dS) gravitons generate primordial curvature as the Coulomb-type potential of their gradient stress. Each pair contributes $(p/k)^2$, yielding exponential enhancement over the contributing e-folds. With exact Bunch-Davies evolution, this solution satisfies all four scalar second-order Einstein equations in pure dS. The retarded transverse-traceless solution instead has a UV kernel of order unity, $(k/p)^2$ below the scalar kernel, and a one-loop correction $\Delta^2_{h,2}/\Delta^2_h\simeq0.04\,\Delta^2_h$. Its source acts before internal freeze-out, but oscillatory cancellations prevent tensor enhancement. We evolve the curvature through a smooth exit into radiation domination. Conserved curvature resides on the vacuum-decay hypersurface. A global depletion clock holds each scale on zero-shear time for $N_{\rm w}$ e-folds after horizon exit before local release, giving all scales equal enhancement. Energy-momentum conservation feeds the depleted vacuum energy into a non-vacuum sector, modeled as radiation. Deep in radiation domination, $\Delta^2_\zeta=c_w\Delta_h^4e^{N_{\rm w}}/20$, with clock-dependent $c_w$, $n_s-1=-4\epsilon$, and $n_T=-2\epsilon$. The spectrum is adiabatic and Gaussian; super-horizon $\zeta$ is conserved to better than $10^{-4}$, and changing the adiabatic exit fluid alters it by less than $0.2\%$. A direct radiation exit requires $31\lesssim N_{\rm w}\lesssim50$, or $3\times10^{-6}\lesssim r\lesssim0.036$. At interferometer frequencies, $\Omega_{\rm GW}h^2\simeq2\times10^{-21}$–$3\times10^{-17}$, accessible to BBO for $r\gtrsim0.01$ and ultimate DECIGO for $r\gtrsim10^{-5}$; CMB B-mode searches probe $r\gtrsim10^{-3}$. Above $k_{\rm end}e^{-N_{\rm w}}$, the scalar spectrum steepens to $k^{-1}$, suppressing $\mu$-distortions for sharp release when $N_{\rm w}\gtrsim45$.
Read the full abstract

All authors Daniele Bertacca, Raul Jimenez, Sabino Matarrese, Mariam Abdelaziz, Marisol Traforetti

Lattice Field Theory

The structure of the pion at large $N_c$

We compute the pion quark momentum fraction in the large-$N_c$ limit using the Twisted Eguchi-Kawai (TEK) reduced model. Gauge configurations for different values of the lattice spacing are generated with the pure-gauge TEK action, while the pion correlators are computed for different quark masses with maximally twisted mass fermions. The bare matrix element corresponding to the quark momentum fraction is obtained using the Feynman-Hellmann method, and we use perturbative renormalization factors to connect to the $\overline{\mathrm{MS}}$ scheme at $2\,\mathrm{GeV}$. A global analysis at several lattice spacings, pion masses, and values of $N_c$ yields $\langle x\rangle_q^{\overline{\mathrm{MS}}}(2\,\mathrm{GeV}) = 0.267(105)$ at the physical pion mass in the large-$N_c$ limit. This value is significantly smaller than existing $N_c=3$ determinations from phenomenology and lattice QCD, indicating that, in the large-$N_c$ limit, the pion's light-cone momentum is carried predominantly by gluons.
Read the full abstract

Computers and Society

Beyond Falsehoods 2026: Global Trends in the Regulation of Misinformation and Disinformation

This report examines global legislative and regulatory responses to misinformation, disinformation, and mal-information (MDM) between 1995 and 2025. Drawing on an expanded and updated dataset of 409 coded regulatory and policy entries, including hard and soft law, policy measures, and proposed or draft instruments, it analyses their growth, geographic distribution, substantive focuses, and regulatory designs, which represent the various approaches taken against MDM, as well as early evidence of their implementation. The central finding is sustained and accelerating regulatory growth. Annual activity increased from 11 instruments in 2016 to 46 in 2023, 67 in 2024, and 71 in 2025. The number of instruments currently in force has reached 282, despite 34 measures having been repealed, withdrawn, or judicially invalidated. This growth has also been accompanied by a shift in regulatory focus. Earlier measures relied heavily on broad prohibitions of "false information," whereas more recent measures increasingly target specific harms, including deepfakes, election interference, non-consensual intimate imagery, and child safety. Regulatory responsibility is also increasingly being placed on platforms rather than solely on individual creators and users.
Read the full abstract

Optimization and Control

Learning Rate Decay Can Exponentially Accelerate SGD for Global Optimization of Nonconvex Functions

Stochastic Gradient Descent (SGD) is a workhorse algorithm for continuous optimization. It is a folk belief among deep learning practitioners that learning rate decay in SGD substantially improves performance. However, it has remained unclear whether learning rate decay offers an asymptotic advantage for global nonconvex optimization. We answer this question in the affirmative by demonstrating a natural class of nonconvex functions for which, we prove that SGD with learning rate decay requires exponentially fewer gradient queries for global optimization than SGD with any fixed learning rate in the small-step size regime. To the best of our knowledge, this is the first exponential advantage that has been demonstrated for learning rate decay. The class of functions we consider includes many popular benchmark nonconvex functions. Our results provide a robust explanatory theory for the empirically observed benefits of learning rate decay for global optimization. We show that annealing performs the non-logconcave sampling task associated to the optimization problem in polynomial time, via a novel application of weak Poincaré inequalities.
Read the full abstract

All authors Guneykan Ozgul, Dylan Herman, Junhyung Lyle Kim, Shree Hari Sureshbabu, Shouvanik Chakrabarti

Optimization and Control

Adaptive Output Regulation of Linear Systems with Unknown Harmonic Exosystems and Additive Noise

This paper addresses error-feedback output regulation for known multivariable linear plants subject to an unknown exosystem and additive Gaussian process and measurement noise. The exosystem generates constant and sinusoidal signals, but its dimension, frequencies, and coupling matrices are unavailable. An output-injection transformation represents the external action through known channels. A causal observer then produces a residual independent of the applied input, whose filtered output separates into a harmonic signal, stationary colored Gaussian noise, and a decaying transient. Using this observation model, a Fourier procedure consistently identifies the number and values of the active positive frequencies in the presence of noise. The identified frequencies determine a regulator through interpolation with stable residual filters. A contractive filter realization, nonexpansive state resizing, and bounded gain updates ensure closed-loop moment bounds uniformly over the selected filter orders. If the gain bound contains the ideal interpolation gain, the adaptive plant response and tracking error converge in mean square to those of the corresponding known-frequency regulator. The limiting mean-square tracking error is a linear function of the process- and measurement-noise covariances. In the absence of both noises, the tracking error converges to zero.
Read the full abstract

Systems and Control

Certified Zonotopic Reachability Analysis for Trajectory Tracking on Lie Groups

Autonomous vehicles track planned trajectories close to obstacles. Unknown disturbances make them deviate from these trajectories. With a bound on the tracking error that disturbances can cause, a planned trajectory can be certified as safe before execution. Existing set-based methods bound the tracking error by one invariant ellipsoid for the whole trajectory or by intervals, which are both conservative. For aerial and space vehicles, the tracking error evolves on a matrix Lie group with nonlinear dynamics. However, for group-affine systems, the error dynamics are linear in Lie algebra coordinates when the vehicle receives the inputs of the reference. The control input and the disturbance enter through the inverse right Jacobian, a matrix that depends on the error. We propagate the linear part of the error dynamics with zonotopes and enclose the effect of the inverse right Jacobian on the disturbance in closed form. The resulting tubes are tight and provably contain all reachable tracking errors in continuous time. When some error components have no input, the inverse right Jacobian leaves unmatched nonlinear terms in the closed loop. None of the tested methods certifies such a closed loop. Hybrid coordinates make these terms matched, so that our controller cancels every nonlinear term that does not contain the disturbance. Our tubes give tighter bounds than the ellipsoid method in simulations of a planar aircraft and a fully actuated multirotor and in real flights of a quadrotor, where the tube contains every measured attitude error. Under larger disturbances and the same feedback gain, the ellipsoid method yields no valid ellipsoid, whereas our tubes remain valid.
Read the full abstract

All authors Yanliang Huang, Peng Xie, Zhen Zhang, Zhuoqi Zeng, Amr Alanwar

Optimization and Control

Riemannian Real-Time Optimization for Robotics: Active Set SQP Parametric Pathfollowing

Robot optimal control often combines Euclidean states with configurations on Lie groups and other smooth manifolds. This paper develops a parametric Riemannian Newton pathfollowing method based on homotopy quadratic programs and parallel strict-working-set tasks. It specifies the event handling, working-set exchanges, matrix factor updates, synchronization, and residual checks used by the algorithm. Tracking guarantees are given under mildly degenerate regularity conditions and the Riemannian strong second-order sufficient condition. Drone navigation and arm manipulation are formulated as geometric optimal-control problems, including finite-force grasp acquisition, transport and supported release. Numerical examples illustrate drone navigation and arm pick-and-place through KKT-residual histories and MuJoCo simulations, together with preliminary initialization results for the full-horizon optimal-control problems.
Read the full abstract

High Energy Physics (Phenomenology)

Quality time in extra dimensions: axion quality and radion cosmology

Higher-form symmetries can protect extra-dimensional axions, but additional symmetry breaking can still spoil the solution to the strong CP problem. We focus on electrically charged matter and magnetic gauging in a five-dimensional circle compactification where the axion arises from an Abelian gauge field and the radius is dynamical. We discuss two mechanisms for stabilising the radius/radion using Casimir energy from fields neutral under the Abelian gauge field, with and without an additional periodic scalar winding around the compact circle. Both admit Minkowski and de Sitter minima. At the Minkowski minima (with radion masses of $100$–$170\,\mathrm{TeV}$), electrically charged matter induces a residual strong CP angle of order $10^{-17}$ and shifts the radius negligibly. Magnetic gauging remains compatible after including its additional degree of freedom in the Casimir spectrum, provided its coupling is sufficiently small. We observe that increasing the radius suppresses charged-matter breaking relative to QCD but increases magnetic breaking contribution. We also determine the radion decay channels, including the graviphoton, and study reheating from a possible radion-dominated era without scalar winding or magnetic gauging. For a non-minimal Higgs-curvature coupling $\xi=7$, the visible-sector reheating temperature is about $85\,\mathrm{MeV}$ with a dark-radiation contribution of $\Delta N_{\rm eff}\approx0.02$. The entropy released during radion decay dilutes the axion abundance, allowing axions with $f_a=10^{14}\,\mathrm{GeV}$ and an initial misalignment angle $\vartheta_i\approx0.43$ to account for the entire observed dark matter abundance. For the same decay constant, reproducing this abundance in radiation domination requires $\vartheta_i\approx0.065$.
Read the full abstract

Functional Analysis

Separable $\mathcal L_{\infty}$-spaces with Kalton's property $Q$

We construct separable $\mathcal L_\infty$-spaces with Kalton's property $Q$, which, to the best of our knowledge, are the first known examples of this kind. Our technique employs the Bourgain–Pisier construction and a quantitative analysis of metric types in limits of finite-dimensional $\eta$-admissible embeddings. The argument rests on two complementary estimates: approximate radial centres yield asymptotic separation of tree increments, while an admissibility inequality yields asymptotic gain, leading to concentration on Kalton's interlacing graphs. This leads to an abstract criterion for property $Q$ in terms of asymptotic separation $AS_\theta$ and asymptotic gain $AG_\alpha$. We illustrate the limitations of this criterion with Johnson–Lindenstrauss spaces. Our examples exclude uniform embeddings of the unit ball of $c_0$, strengthening in a nonlinear direction the classical Bourgain–Delbaen phenomenon. As an application, every separable Banach space embeds isometrically into a separable $\mathcal L_\infty$-space whose unit ball is not a uniform retract of the unit ball of its bidual.
Read the full abstract

Computation and Language

PORT: Preference Optimization via Robust Token-Level Reweighting

Preference optimization has become a central approach for aligning large language models with human values, but its effectiveness depends heavily on the quality of preference annotations. In practice, preference data is often noisy due to annotation errors and ambiguity. Existing robust preference optimization methods primarily operate at the sequence level, implicitly treating entire responses as uniformly correct or incorrect. However, rejected responses may still contain informative reasoning steps, while preferred responses can include subtle errors. In this work, we propose Preference Optimization via Robust Token-level reweighting (PORT), a fine-grained framework for robust alignment under noisy preferences. PORT performs token-level reweighting using the empirical cumulative distribution function (CDF) of token log-probabilities, yielding an efficient forward-pass-only proxy to gradient-norm penalization that selectively suppresses corrupted tokens without additional backward-pass computation. We provide theoretical analysis showing that PORT reduces the gradient bias from noisy preference labels by minimizing an upper bound on the bias term. Extensive experiments across diverse noise settings demonstrate that PORT consistently improves robustness and outperforms existing sequence-level baselines. The code is available at https://github.com/osu-srml/PORT
Read the full abstract

All authors Ding Zhu, Xiukun Wei, Tian Xie, Zhihui Zhu, Xueru Zhang, Mohammad Mahdi Khalili

Artificial Intelligence

Sage-Taiyi: A Metacognitive Architecture for Scientific Discovery

We introduce Sage-Taiyi, a metacognition-inspired architecture that uses accumulated scientific understanding to guide what to investigate next and how to investigate it. Through explicit monitoring and control, the system revises its understanding of evidence, assumptions, and unresolved questions, then uses these assessments to adapt research targets and select reusable reasoning methods. On Taiyi-Bench, an AI co-scientist ideation benchmark comprising 265 tasks from 50 papers across ten disciplines, Sage-Taiyi ranks first on all eight metrics of historical rediscovery and open-ended ideation, achieving an Overall score of 54.0 compared with 47.9 for the strongest baseline, AI Scientist-v2. It also performs well on two external scientific ideation benchmarks. Five expert-guided collaborations further connect its proposals to experimental and computational validation across chemistry, materials science, and engineering. In chemistry, reaction-condition optimization raises the yield of cobalt-catalyzed carbonylation from trace amounts to 84% and photocatalytic allylic amination from 13% to 69%. These results support metacognitive regulation as an approach to scientific ideation and its progression toward practical validation.
Read the full abstract

All authors Weida Wang, Benteng Chen, Yigeng Jiang, Shuchen Pu, Weiping Shen, Zichao Liu, Yulin Su, Zitong Wang, Siyu Zhou, Zifu Wang, Yizhi Li, Xin Zong, Yuning Yang, Jixiang Bi, Yuan Wang, Chuyi Peng, Shiyao Geng, Qi Zhang, Kuan Lu, Mengzhu Li, Weiwang Xu, Peishan Xiang, Chengjun Liu, Chengrui Wei, Fangchen Yu, Shengji Tang, Yichen Jiang, Jingqi Ye, Cheng Yang, Tao Hu, Jianbiao Mei, Qinglong Cao, Kun Li, Yixin Chen, Shengyuan Xu, Juncheng Xiao, Yiheng Wang, Ruizhe Chen, Shiyang Feng, Runmin Ma, Xiangchao Yan, Zongsheng Cao, Haomeng Hu, Yu Ke, Taihui Wu, Meng Dai, Xu Guo, Haoyang Peng, Yinglong Ni, Pingsen Shi, Xiaosong Wang, Shuyue Hu, Haijun Li, Sherry Dongqi Bao, Yang Yang, Chao Yang, Jie Hou, Tianfan Fu, Yi Gong, Jin Zeng, Mao Su, Hongxia Hao, Fanyang Mo, Fenghua Ling, Tianshu Yu, Yunqi Cai, Baihong Chi, Yuelu Chen, Jingwei Wang, Lei Wang, Chuncheng Bu, Shide Lv, Guangyu Wang, Yuqiang Li, Chunfeng Song, Lei Bai, Hui Wang, Xujun Fu, Li Cao, Dahua Lin, Xing Xie, Bowen Zhou, Wenlong Zhang, Pinlong Cai, Peng Ye, Aiwen Lei, Jie Li, Shengchun Wang, Bo Zhang, Shufei Zhang

Logic in Computer Science

A Hoare Logic for Continuous-Time Stochastic Processes

Programming language researchers have developed a wide array of tools to reason about probabilistic programs, but it remains unclear how to apply these proof techniques to continuous-time stochastic processes. To bridge this gap, we propose a verification method for properties of continuous-time stochastic processes by reasoning about them as standard programs. To demonstrate our approach, we define a continuous semantics for a probabilistic imperative language $\mathrm{pWhile}^{\mathrm{dt}}$ by taking the Kuratowski limit of the standard semantics, which collects limit points of the standard program semantics as the time-step approaches zero. Then, we present a Hoare-style logic that uses loop invariants and decreasing functions to verify properties of continuous programs. To establish soundness, we identify a broad class of assertions that are preserved from the standard semantics to the continuous semantics. To demonstrate our approach, we verify properties of ten continuous-time stochastic processes modeled in $\mathrm{pWhile}^{\mathrm{dt}}$, including variants of Brownian motion and a stochastic hybrid system.
Read the full abstract

Cryptography and Security

DeepChronos: Temporal Neuro-Symbolic Reasoning for Multi-Step Attack Detection

Modern cyber threats commonly unfold as multi-step attacks comprising temporally and causally related phases. Current defenses commonly follow a detect first and correlate later paradigm. Intrusion detection systems classify events independently, while downstream systems reconstruct attack progression from the resulting alerts or audit records. In this context, learning-based detectors learn attack-step dependencies implicitly as statistical regularities in the data and cannot guarantee that their predictions follow the real attack progression. Conversely, correlation systems represent attack relationships explicitly, but apply this knowledge only after the underlying attack observations have been detected. We present DEEPCHRONOS, a neuro-symbolic network intrusion detection system that shifts the paradigm from detect first and correlate later to detection through logical progression. DEEPCHRONOS combines learned flow-level evidence with explicit attack-phase rules, temporal prerequisites, and previously inferred phases, allowing the evolving attack history to inform and constrain each detection decision. Evaluations on DARPA 2000 and AIT-LDS V2 show that DEEPCHRONOS improves macro F1 over purely neural baselines by up to 11.3%, eliminates causal violations under strict temporal constraints, and maintains millisecond-scale inference latency. These results demonstrate that integrating explicit attack progression knowledge into detection produces more accurate and temporally coherent multi-step attack predictions.
Read the full abstract

All authors Sofia Burkow, Andrea Agiollo, Enkeleda Bardhi, Fernando Kuipers, Kaitai Liang, Georgios Smaragdakis

Analysis of PDEs

On regularity and stability results of global weak solutions to two-dimensional Navier-Stokes equations with density-dependent viscosity and vacuum

For the initial and initial-boundary value problems of the two-dimensional (2D) incompressible Navier-Stokes equations with density-dependent viscosity and vacuum, Lions' global weak solutions are shown to possess additional regularity, via establishing some key a priori decay-in-time rates for the approximate problem, under suitable smallness condition on the density-dependent viscosity. In addition, large-time decay rates of the pressure and gradient of velocity are obtained, which are even exponential in time for bounded domains or the periodic case. Note that these results hold without any smallness conditions on the initial data, even for initially vanishing density.
Read the full abstract

Differential Geometry

The Cheng–Yau gradient estimate for Jacobi fields

We prove a pointwise gradient estimate for positive Jacobi fields on minimal hypersurfaces of dimension two and three, inspired by the Cheng–Yau estimate for harmonic functions. The estimate also controls the second fundamental form, and so provides yet another proof of the stable Bernstein theorem in dimensions two and three.
Read the full abstract

Quantum Physics

Succinct Infinite-Horizon Lyapunov and LQR Value Problems Are BQP-Complete

Fundamental tasks in linear systems analysis and control require evaluating infinite-horizon output energies for autonomous systems and optimal value functions for controlled systems. These quantities are characterized by Lyapunov and algebraic Riccati equations, respectively. In this work, we study promise problems for their evaluation when the system matrices are sparse and represented succinctly by Boolean circuits specifying their nonzero entries, with input length polynomial in the logarithm of the system dimension. For dissipative autonomous systems with coordinate-vector initial states, we define the succinct Lyapunov value problem (SLV). Its extension to linear-quadratic optimal control is the succinct LQR value problem (SLQRV). We prove that SLV is $\BQP$-hard: every problem in bounded-error quantum polynomial time ($\BQP$) reduces to it in polynomial time. We then establish that the more general SLQRV problem admits a quantum algorithm running in time polynomial in the succinct input length. Since SLV is a special case of SLQRV, both problems are $\BQP$-complete. Consequently, unless bounded-error probabilistic polynomial time coincides with $\BQP$, no classical randomized algorithm can solve either problem on all promised instances in time polynomial in the succinct input length.
Read the full abstract

Number Theory

On the higher-order Titchmarsh divisor problem

For every fixed integer $k\geq2$ and every fixed nonzero integer $h$, we prove that, as $x\to\infty$, \begin{equation*} \sum_{x<n\leq2x}\Lambda(n)\tau_k(n+h) \sim C_{k,h}x(\log x)^{k-1}, \end{equation*} where $\tau_k$ is the $k$-fold divisor function and $C_{k,h}>0$ is a constant depending only on $k$ and $h$.
Read the full abstract

All authors Guangwei Hu, Guangshi Lü, Zhiwei Wang, Jie Wu

Machine Learning (Statistics)

From Granger causality to causal structure in dynamical systems

The idea of testing whether the past of one signal improves the prediction of another can be traced back to Wiener. It was Granger who formalized the concept. Granger causality has become one of the most widely used tools to infer directed interactions between the components of a system. The name however can be misleading: it detects predictive relations among the measured signals, not causal relations among the mechanisms that generate them. This article starts by reviewing recent advances in observation-space Granger analysis. It then follows a path to directed structure in latent dynamical models, and asks under which conditions that structure can be read causally.
Read the full abstract

Robotics

Sliding into Balance: Benefits of a Sliding Payload for Load Distribution and Disturbance Rejection in Dual-UAV Transportation

This paper analyzes the cooperative transportation of a payload suspended from two drones in which, instead of being attached to two independent ropes, the payload is allowed to slide along a single rope connecting both UAVs. First, a planar nondimensional dynamical model of the sliding motion with viscous friction is presented. Then, considering stationary drones, this configuration is compared with a fixed payload with the same total rope length, both at equilibrium and under disturbances. The analytical results show that the sliding payload equalizes the tension in both rope segments for any relative position of the drones, so that no rope loses tension at equilibrium; it doubles the region reachable by the payload and, except for low friction combined with a large drone separation, it enlarges the set of admissible disturbances. Finally, a dynamic simulation also shows that under realistic gusty wind profiles, the average tension imbalance between the drones is reduced with respect to the fixed-payload solution.
Read the full abstract

Quantum Physics

Sequential vs parallel Strategies for Sharing Quantum Advantage in Communication Tasks

Information can be extracted from a quantum system in a sustainable manner, allowing the system to be reused for further information extraction through subsequent interactions. We investigate the possibility of consensus between two experimentally feasible methods, namely, parallel and sequential sharing, that enable multiple observers to extract information encoded in a quantum system. We show that any statistics generated by a parallel sharing strategy can be reproduced by a sequential strategy when only two observers are involved. However, when more than two observers participate in sharing quantum correlations, certain statistics achievable through parallel strategies cannot be reproduced by sequential strategies. Moreover, we demonstrate that sharing quantum advantage through a parallel strategy is impossible for a class of communication tasks involving two decoding measurements, thereby establishing an arbitrarily large gap between the sustainability of quantum advantage under sequential and parallel strategies. This naturally raises the question of whether this impossibility extends to communication tasks involving more than two decoding measurements. We show that, while parallel sharing of quantum advantage is impossible in a 3-bit random access code (RAC), it becomes possible in a 3-bit parity-oblivious RAC, where at most two observers can simultaneously obtain a quantum advantage by performing measurements on two imperfect clones of the initially prepared quantum system. Our findings have potential applications in the development of quantum communication networks and distributed quantum information processing.
Read the full abstract

Optimization and Control

Transport, Entropy, and the Cost of Dependence: Maximum Conditional Entropy under Transport Constraints

Maximum-entropy inference under Wasserstein constraints can be computationally challenging due to the underlying optimization over transport couplings. We investigate a tractable alternative based on maximizing conditional entropy under an average transport constraint. On Euclidean spaces, this formulation admits an explicit generalized-Gaussian additive-noise solution, providing a feasible approximation to the Wasserstein-constrained problem without solving an optimal transport problem. We establish quantitative bounds on the resulting optimality gap by showing that the two formulations admit a common feasible-marginal representation, with their discrepancy characterized by the mutual information retained between the nominal and perturbed variables. For discretely supported nominal distributions, we further obtain an exact decomposition of the gap into a marginal-entropy gain and a weighted Jensen-Shannon divergence.
Read the full abstract

Algebraic Geometry

Functorial Homological Mirror Symmetry for Acyclic Cluster Varieties

We introduce the formalism of cluster models, a class of log Calabi-Yau varieties obtained from smooth quasi-affine toric varieties by iterated affine blowups along non-toric codimension 2 centers determined by a really full rank quiver. Cluster models include the truncated cluster varieties of Gross, Hacking, and Keel with respect to really full rank quivers, all really full rank acyclic cluster varieties, and all open toric subvarieties of $\mathbb{C}^n\times(\mathbb{C}^*)^m$. We then construct mirrors to cluster models via iterated Weinstein handle attachments to toric mirrors, so that the corresponding skeleta acquire compact pieces, and we prove homological mirror symmetry for all cluster models, compatibly with freezing, deleting, and contracting vertices of the quiver. This extends toric mirror symmetry and its naturalities beyond the cotangent bundle. In particular, we obtain homological mirror symmetry for all really full rank acyclic cluster varieties. We develop this package with a view towards conjectures of Marsh, Rietsch, and Williams about mirror symmetry for Grassmannians and closed positroid varieties. Motivated by these, we also conjecture that open positroid varieties are self-mirror. Assuming a natural ansatz, we prove this for a class of positroid varieties that includes nontrivial cells in every Grassmannian and all cells in finite-type Grassmannians. Towards this end we introduce a new combinatorial input, the notion of weak $k$-booleanness for permutations and braids.
Read the full abstract

Computation and Language

The Narrative Gap: Can LLMs Help Us Navigate Diverse Narratives Across Languages?

Large language models (LLMs) increasingly mediate how people seek and consume information, including accounts that differ across languages and regions, especially on contested topics. Supporting diverse information seeking requires models to help users navigate competing narratives across languages and information streams. We define six capabilities necessary for diverse multilingual information seeking: three foundational capabilities for narrative inclusion, narrative exclusion, and missing narrative identification; and three higher-level capabilities for presenting diverse narratives, preserving narrative coverage under confirmatory queries, and maintaining information parity across languages. To guide the development of those information seeking capabilities, we introduce NarrativeBench, a benchmark comprising 1,333 news articles in 23 publication languages across 23 contested topics and 460 Reddit-grounded queries. Evaluating 14 LLMs across 24 query languages, we find that current models lack the capabilities needed to reliably navigate diverse narratives, limiting users' control over the perspectives they receive and leaving substantial gaps in exposure to competing accounts even when diversity is explicitly requested. Information access also differs across query framings and languages, risking echo chambers, linguistic filter bubbles, and information disparities that weaken the common ground needed for democratic discourse. NarrativeBench provides a foundation for developing information systems that give users across languages and regions agency to navigate diverse narratives.
Read the full abstract

All authors Nikhil Sharma, Kelly Marchisio, Kenton Murray, Ziang Xiao

High Energy Physics (Phenomenology)

A possible signature of neutrino spin precession in the J-PARC muon $g-2$ experiment

We examine a possible signature of the neutrino angular-momentum contribution to the muon magnetic anomaly measurement in the J-PARC E34 experiment. In previous papers we argued that the angular momentum carried by the unobserved neutrino pair may leave an uncertainty in the anomaly inferred from the time modulation of detected positrons. At Fermilab the highly relativistic muons make the forward-emission approximation suitable for this estimate. The lower muon momentum at J-PARC requires the decay kinematics to be treated explicitly. We integrate the longitudinal momentum of the neutrino pair using the positron energy distribution and asymmetry derived from the theoretical weak-decay spectrum, and the same event-counting weight $N(E)A(E)$ is employed for both experiments. For positron energies between $1.5$ and $2.9$ GeV at Fermilab and between $200$ and $275$ MeV at J-PARC, the proposed correction is smaller at J-PARC by $0.415\pm0.176$ ppm, when the most optimistic E34 precision is assumed. The expected difference amounts to $2.36$ standard deviations if the future measurement is centred on this value. The calculation thus identifies an experimental comparison which may test the proposed effect independently of the hadronic contribution to the Standard Model prediction. We also examine the possibility of testing the effect by comparing measurements at two different muon momenta. With a fixed positron energy threshold of 200 MeV, the maximum sensitivity is obtained at a muon beam energy of 245 MeV. The predicted difference relative to the nominal J-PARC configuration has significance of $4.88\sigma$ for the most optimistic experimental sensitivity.
Read the full abstract

Mathematical Physics

Global Asymptotics of a Toda Soliton Condensate with Random Scattering Data

We study a dense $N$-soliton condensate for the infinite Toda lattice in the limit $N \to \infty$. In contrast to previous mathematical studies of soliton gases where the norming constants are assumed to be deterministic or infinitesimal, we consider initial scattering data where both the discrete eigenvalues and the norming constants are independent random variables. The norming constants $\gamma_j$ are allowed to be arbitrarily large under a mild moment condition $\mathbb{E}[\gamma_j^\nu] < \infty$ ($\nu > 1$). Our main result is divided into two parts. First, we develop a probabilistic Riemann–Hilbert framework to show that the system self-averages: despite large, independent fluctuations in the initial data, the random Toda lattice variables converge deterministically to an effective continuum model at a polynomial rate $\mathcal{O}(N^{-\delta})$ for $0 < \delta < 1/2$. Second, by performing the Deift–Zhou nonlinear steepest descent analysis of the continuum problem, we obtain the complete leading-order macroscopic description of the lattice across the entire space-time plane. The solution decomposes into five distinct finite-gap regimes, characterized explicitly by modulated elliptic and genus-2 waves with an error of order $\mathcal{O}(1/\ln N)$. In contrast to the straight characteristic rays typical of standard soliton gas limits, the interfaces separating these five macroscopic regimes in the space-time plane are genuinely non-linear curves; in particular, the boundary of the modulated genus-2 region is completely non-linear. Finally, under our assumptions, we establish the Nonlinear Dispersion Relations for the Toda soliton condensate and prove that the macroscopic ensemble averages are determined by the soliton gas density of states.
Read the full abstract

Machine Learning

Clique Constraints for Exact Causal Structure Learning

Exact score-based causal structure learning supports explicit structural constraints and optimisation certificates, but its branch-and-cut search can be computationally demanding. We augment exact causal structure learning methods with an upper bound on the maximum clique size of the learned undirected skeleton, enforced at integer candidates through lazy cycle and clique constraints. On static linear-Gaussian Erdős-Rényi and scale-free DAGs, we evaluate callback order, alternative clique-cut policies, incumbent repair, fractional separation, and Big-M bounds. We report causal-recovery metrics jointly with optimality gaps, primal and dual bounds, node throughput, MIPSOL events, and callback cost. Two variants receive particular attention: B3 selects the most violated minimal (k+1)-clique inequality at each callback, whereas C3 repairs an infeasible integer candidate by deleting violating edges and refitting affected regression columns using QR-based least squares. The results do not indicate that clique constraints uniformly accelerate optimisation. However, their benefit depends on graph density, sample size, and cut-management policy, while large collections of correlated constraints can reduce node throughput. Tighter valid Big-M bounds reduced the fixed-budget optimality gap in most tested settings, without necessarily changing SHD or F1 at a fixed time limit. These findings characterize the computational trade-offs of clique-constrained exact causal learning, and identify selective separation and incumbent repair as promising directions.
Read the full abstract

All authors Xiaoyu He, Pavel Rytíř, Petr Ryšavý, Jakub Mareček

Quantum Physics

$\mathsf{EQP}\subseteq\mathsf{IP}$ Does Not Relativize

We construct a recursive oracle $O$ and a unary language $L\in\mathsf{EQP}^O\setminus(\mathsf{IP}^O\cup\mathsf{PH}^O)$, strengthening the $\mathsf{BQP}$ versus $\mathsf{IP}$ oracle separation of Bouland et al. to exact quantum computation. The separation is based on a variant of the Forrelation problem in which the normalized correlation of one Boolean function with the Fourier transform of another is promised to be exactly $+1/2$ or $-1/2$. The main technical contribution is a repair method that constructs distributions supported on these exact levels while preserving the indistinguishability needed for the $\mathsf{IP}$ and $\mathsf{PH}$ lower bounds. A uniform polynomial-time quantum algorithm distinguishes the two cases with certainty using only three oracle queries.
Read the full abstract

High Energy Physics (Phenomenology)

Nucleon transversity from dihadron data and x-dependent lattice QCD constraint

We extract collinear transversity distributions and dihadron fragmentation functions in a joint neural-network analysis of dihadron production in electron-positron annihilation, semi-inclusive deep-inelastic scattering, and polarized proton-proton collisions. We incorporate lattice QCD calculation of isovector transversity, which constrains the up-down flavor differences for quarks and antiquarks over broad momentum fraction range complementary to data. Matched fits with and without the lattice input describe the experimental data comparably well. Including the lattice input shifts the down-valence distribution toward more negative values and enhances up-valence transversity at large $x$. The magnitude of the central down-valence result exceeds the reference Soffer inequalities, motivating further test of positivity constraints.
Read the full abstract

All authors Hongxin Dong, Yuan-Yuan Huang, Tianbo Liu, Xiaomin Shen, Peng Sun, Xiaonu Xiong, Jian-Hui Zhang, Yuxiang Zhao, Yiyu Zhou, Ruilin Zhu

Algebraic Geometry

Semiampleness of Hodge line bundles and b-semiampleness of the moduli part

We give proofs of Hodge semiampleness and b-semiampleness without using o-minimality. We establish a geometric semiampleness criterion for line bundles on proper algebraic spaces. Let $(X,D)$ be a log smooth pair with $X$ a proper algebraic space. For an integral polarizable pure variation of Calabi–Yau type on $X\setminus D$ with unipotent local monodromy, let $L$ be its extended highest Hodge line. If $L$ is numerically integrable and has torsion combinatorial monodromy, then $L$ is semiample. We also prove semiampleness of extended Griffiths lines. We construct normal projective period compactifications on which a positive power of the Griffiths line extends to an ample line bundle. As an application, we prove that the moduli b-divisor $\mathbf{M}$ of a projective lc-trivial fibration over a normal algebraic variety is b-semiample, provided that the generic boundary is effective. Suppose further that the geometric generic pair is klt and its boundary is big, with nonzero coefficients in a fixed finite set $I\subset(0,1)\cap\mathbb{Q}$. Then $c\mathbf{M}$ is b-Cartier and b-free for an integer $c>0$ depending only on the relative dimension and $I$. We extend b-semiampleness to analogous projective fibrations over normal complex analytic bases, assuming a global relative polarization and an invertible log pluricanonical sheaf pulled back from the base.
Read the full abstract