Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Monday 14 September

Signal Processing

Multiscale Visibility Theory: A Task-Relative Operator-Geometric Framework for Observation, Robustness, and Detectability

Multiscale Visibility Theory (MVT) is introduced as a task-relative operator-geometric framework for determining how prescribed information survives and remains accessible through a structured observation architecture. Rather than evaluating observation quality by transform magnitude, output energy, rank, or signal prominence alone, MVT measures the accessibility of a specified task direction or task subspace through the row space of the composite operator A_A = R_E W_rho H_beta P_Omega. Unlike projection-based diagnostic frameworks centered on discrimination between nominal and fault-related system behavior, MVT tracks an independently prescribed task as observation architecture, scale, representation, and retained access vary. The formulation unifies exact stagewise retention, task-subspace preservation, scale-indexed visibility and stability, worst-case erasure robustness, collective visibility, covariance-normalized statistical separation, and decision sufficiency while keeping geometric accessibility, statistical detectability, and decision adequacy mathematically distinct. A reproducible MATLAB implementation verifies the analytical relations using a controlled synthetic benchmark with a weak 260-Hz prescribed task and a stronger 380-Hz nuisance. Within the same frequency-indexed observation family, task visibility is maximized at 260 Hz, whereas complete-signal observation energy is maximized at 380 Hz. At the nominal noise level, D_max = 18 > Gamma_D = 8.563847350668, yielding a decision-visible interval of 258.5-261.5 Hz. A four-row phase-redundant observer preserves full task-model visibility through two row erasures, while two individually subthreshold branches at 258 and 262 Hz become jointly decision-visible with D_12 = 10.470833520729. All 12 numerical audits satisfy the 10^-10 tolerance.
Read the full abstract

Strongly Correlated Electrons

Charge order before superconductivity in the doped kagome Dirac spin liquid

Doping a quantum spin liquid is expected to produce a superconductor. We show that for the Dirac spin liquid on the kagome lattice the doped charge orders first. The charge is carried by a chargon doublet whose two gauge components are degenerate on the square and triangular lattices, and the kagome lattice, as the line graph of the honeycomb lattice, splits them. One component disperses and condenses in four valleys. The other has flat lowest bands and stays empty over a window in the bare mass whose width, $(\sqrt6-1)t$, follows from the band structure alone. Within that window, in the mean-field chargon theory constructed from the projective symmetry group of the spin liquid, the doped state forms charge and loop-current crystals with the electromagnetic U(1) unbroken and no superconductivity. Pairing requires a gapped descendant of the spin liquid as the parent and then takes the form of a pair-density wave, with no uniform $d+id$ channel at leading order and none at any order for the crystals at the $M$ point. The predicted charge order is odd under the twofold rotation and has no cubic invariant, which distinguishes it from the charge order of the kagome metals.
Read the full abstract

Combinatorics

Augmented singular cohomology, uniform matroids, and real-rootedness

We study the singular cohomology rings of toric varieties associated with several fans arising from uniform matroids. These rings generalize the Chow and augmented Chow rings of matroids. For the singular cohomology ring arising from the augmented Bergman fan of a uniform matroid, we construct an explicit basis derived from the retral basis for the singular cohomology ring of a uniform matroid introduced by the first author. We prove that the augmented Bergman fan does not yield a singular cohomology ring that satisfies the quasi-projective Strong Lefschetz property, whereas a suitable modification of the fan does. We then investigate the zeros of the corresponding refined Hodge–Poincaré polynomials. For uniform matroids, we prove that the refined Hodge–Poincaré polynomials associated with both the singular cohomology ring and the modified augmented singular cohomology ring are real-rooted. The former result resolves a conjecture of the first author. These results extend the real-rootedness theorem of Brändén and the second author for the Chow polynomials of uniform matroids. Finally, we relate the failure of real-rootedness for the augmented singular cohomology ring to the failure of Lefschetz properties.
Read the full abstract

Instrumentation and Methods for Astrophysics

MUSHY: Multimodal Flow-Based Amortized Bayesian Inference for Spectroscopic Data Fusion

We are in an era of unprecedented spectroscopic data availability, with surveys such as APOGEE, GALAH, and DESI observing millions of stars. However, data are heterogeneous and to date, efforts to exploit synergies between surveys have been limited. In particular, there is a lack of principled methods that combine spectroscopic data from different surveys to improve inference of physical parameters. In this work we present a new method, MUSHY, for spectroscopic data fusion. MUSHY is an amortized Bayesian inference method, using a rectified flow model with multimodal inputs to learn a posterior distribution over physical parameters. Using synthetic spectra generated via ATLAS12/SYNTHE, including realistic instrumental effects and noise, we demonstrate that MUSHY can precisely infer physical parameters with well-calibrated posteriors from any combination of surveys, with multimodal inputs providing stronger constraints on the posterior than single-survey data alone. This work paves the way for principled combination of spectroscopic data from heterogeneous sources.
Read the full abstract

Human-Computer Interaction

Pulla: A Parsons Problem Tool for Fine-Grained Behavioral Tracing and Instructor-Facing Problem-Solving Analysis

Existing Parsons problem tools primarily focus on correctness, indicating whether a student solved a problem, but providing limited visibility into the underlying problem-solving process. We address this gap by introducing Pulla, a Parsons problem tool that instruments programming assignments to capture fine-grained interaction data. These behavioral traces allow the system to surface recurring difficulty patterns, giving instructors actionable insights to inform targeted intervention decisions. This paper describes our experience in developing and deploying Pulla. We deployed the tool in two university courses: an upper-division software design course at the University of Houston (United States) and an introductory programming course at Aalto University (Finland). By analyzing the data collected, we identified common difficulty patterns, including misidentifying exception types, confusing return with the throw/raise mechanism, and incorrect control-flow ordering.
Read the full abstract

All authors Daniel Prol, Juho Leinonen, Arto Hellas, Saleh Alkhamees, Amin Alipour

Cosmology and Nongalactic Astrophysics

NERV: Neural-network Enhanced Reconstruction of the UniVerse with Application to Baryon Acoustic Oscillations in the BOSS DR12 Galaxy Sample

We present the first application of neural-network-based baryon acoustic oscillation (BAO) reconstruction to real galaxy survey data, restoring the acoustic signature damped by nonlinear structure growth. {NERV} (Neural-network Enhanced Reconstruction of the UniVerse) augments standard reconstruction with a convolutional neural network trained on cubic $N$-body simulations, and explicitly accounts for realistic observational effects including the curved-sky geometry, the redshift-dependent selection function, and finite survey boundaries, by tessellating the survey volume into local patches. We validate the method on the MultiDark-Patchy mock catalogs, recovering unbiased BAO dilation parameters. Applied to the BOSS DR12 galaxy sample, NERV improves the precision of the BAO distance measurements significantly. These results establish neural reconstruction as a practical component of BAO analyses for ongoing surveys such as DESI, with the potential to substantially tighten constraints on the cosmic expansion history and the nature of dark energy.
Read the full abstract

All authors Shi-Hui Zang, Hong-Ming Zhu, Tian-Xiang Mao, Ue-Li Pen

High Energy Physics (Phenomenology)

Towards High-Energy Factorization at Full NLO for Quarkonium Production

Heavy-quarkonium hadroproduction at the LHC can access kinematic configurations in which the partonic center-of-mass energy is much larger than the quarkonium mass and transverse momentum. Fixed-order predictions may become unstable in this regime because large logarithms of the collision energy are not resummed. Extending high-energy factorization beyond leading logarithms requires process-dependent impact factors at next-to-leading order (NLO). We report the first complete NLO BFKL impact factors, with exact heavy-quark-mass dependence, for the production of the NRQCD states ${}^1S_0^{[1]}$, ${}^1S_0^{[8]}$, and ${}^3S_1^{[8]}$. The real-emission calculation is combined with the previously known virtual corrections through a local subtraction procedure. Soft singularities cancel, initial-state collinear poles are absorbed into the parton distributions, and rapidity divergences are removed by BFKL factorization. These results provide the ingredients needed for full-NLL studies of forward quarkonium and of quarkonium-associated production with a large rapidity separation.
Read the full abstract

All authors Michael Fucilla, Jean-Philippe Lansberg, Maxim Nefedov, Lech Szymanowski, Samuel Wallon

Strongly Correlated Electrons

Fractional vortices in a spin-isotropic spiral spin liquid

Spiral spin liquids are magnetic states whose classical ground-state manifold consists of planar incommensurate spin spirals with wave vectors lying on a continuous ring or surface in reciprocal space. The resulting subextensive degeneracy suppresses magnetic long-range order and gives rise to liquid-like behavior. Despite numerous material realizations and theoretical investigations, the structure of low-temperature spin configurations of spin-isotropic Heisenberg spiral spin liquids has remained poorly understood. Here, we classify and characterize the classical topological defects supported by these systems. We uncover a rich family of vortex types involving concerted windings of spin directions, spiral-plane normals, and wave-vector orientations, yielding a $\mathbb{Z} \times \mathbb{Z}_2$ classification. Remarkably, the elementary defects are half-vortices carrying fractional $2\pi$ windings in both spin and momentum space and obey fusion rules resembling to those of Ising anyons. Large-scale classical simulations of a square-lattice spiral spin liquid reveal that these vortices are dense in the spiral-spin-liquid regime, and bind tightly below an order-by-disorder phase transition, eventually fusing to vacuum.
Read the full abstract

Robotics

Beyond Single-Axis Testing: Paired Evaluation of Compound Robustness in Vision-Language-Action Policies

Vision-language-action policies are typically evaluated one perturbation at a time, providing a useful diagnosis of their sensitivity to individual distribution shifts. Real-world deployment, however, may involve several shifts simultaneously, and it remains unclear how these individual robustness measurements compose. We ask whether compound robustness can be inferred from single-axis evaluations. We introduce LIBERO-CTRL, a six-axis benchmark that pairs each initial state across single-axis conditions and a matched simultaneous condition. This design reveals two opposing outcome changes that aggregate success rates cannot distinguish: emergent failures, where all single-axis rollouts succeed but the simultaneous rollout fails, and compensated successes, where at least one single-axis rollout fails but the simultaneous rollout succeeds. Because one transition decreases compound success while the other increases it, they can cancel, making aggregate compound performance appear consistent with single-axis measurements even when individual outcomes differ substantially. These opposing transitions can largely cancel in aggregate: even when the difference between the two transition rates is not statistically distinguishable from zero, as many as 29.0% of matched initial states still change outcome. Across six policies and three severity levels, such outcome changes reach 34.5% in the most affected condition. The relative prevalence of the two transitions varies across policies and severities, while the transition rates remain similar under independent re-evaluation of stochastic policies. Compound robustness therefore cannot be characterized from aggregate single-axis success rates alone; matched per-instance evaluation is needed to reveal how joint perturbations alter behavior.
Read the full abstract

Cryptography and Security

Vulnerability Localization Benchmark: Measuring Agentic Security Analysis at Repository Scale

Language-model agents increasingly operate over complete software repositories, yet cybersecurity evaluations primarily measure whether they can detect, reproduce, or repair vulnerabilities rather than whether they can locate the relevant code. We study vulnerability localization: given a weakness class and an unfamiliar repository, identify the implementation files associated with that weakness. We introduce the Vulnerability Localization Benchmark (VLoc Bench), comprising 500 real world vulnerabilities from 290 repositories across six package ecosystems and 147 CWE categories. Each task pairs repository snapshots immediately before and after a security fix. On the vulnerable snapshot, an agent receives only the CWE description and read-only terminal access and must return the affected files; on the patched snapshot, it must determine that the recorded vulnerability is no longer present. We evaluate 27 language models and four static-analysis tools under a common agent interface. Repository-scale vulnerability localization remains difficult: the strongest system achieves 0.229 File F1, and 38.4% of tasks receive no correct localization from any evaluated model. We further find that stronger localization does not imply reliable behavior after remediation: systems that identify vulnerable files effectively can still report unsupported locations on patched repositories. These results establish vulnerability localization as a distinct repository-scale capability and provide a setting for studying both how security agents search for vulnerable code and when they should refrain from reporting it.
Read the full abstract

All authors Aman Priyanshu, Supriti Vijay, Kimia Majd, Xuhong He, Fraser Burch, Takahiro Matsumoto, Jianliang He, Baturay Saglam, Arthur Goldblatt, Zhuoran Yang, Amin Karbasi

Computation and Language

HypoEvolve: Genetic Algorithms Enable Multi-Agent LLMs to Discover Scientific Hypotheses

Scientific agents contribute to hypothesis discovery by synthesizing evidence, assessing proposals, and developing new explanations. Recent systems combine scientific agents with evolutionary search through critique, comparison, and revision. However, how different forms of agent collaboration affect hypothesis quality remains an open question. Answering this question requires separating the effects of agents' scientific capabilities from those of their collaboration. A framework must therefore preserve agents' scientific roles and support rules for combining, revising, and retaining hypotheses. Building on this view, we introduce HypoEvolve, which makes collaboration explicit through successive updates to a hypothesis population. Specifically, we propose a generational genetic algorithm to coordinate specialized large language model (LLM) agents that integrate mechanistic arguments, reconsider assumptions, and assess evidence and testability. Each generation specifies how scientific judgments and new proposals reshape the population, making collaboration effects on hypothesis quality directly testable. Moreover, we design our evaluation around scientifically meaningful hypotheses that explain how a proposed intervention could work. Drug repurposing links these explanations to target-level biological claims assessed against external evidence. Specifically, we adapt DepMap and Open Targets into complementary external measures grounded in experimental, genetic, and clinical evidence. Across 34 cancer types, HypoEvolve achieves the highest scores against six baselines on both measures. DepMap selectivity reaches 0.171, versus 0.115 for the strongest baseline. Gains over single-pass generation also generalize to held-out cancer types. HypoEvolve advances a vision of autonomous science in which AI research teams achieve a capacity for discovery beyond that of individual models.
Read the full abstract

All authors Jieyuan Liu, Mengzhou Hu, Jefferson Chen, JungHo Kong, Pratibha Jagannatha, Yiming Gao, Dexter Pratt, Hsin-Yuan Lee, Zhiting Hu, Trey Ideker, Wei Wang, Eric P. Xing, Zhen Wang

Number Theory

Low moments of Hecke eigenvalue sums

We show that partial sums of the Sato–Tate random multiplicative functions introduced by Cogdell and Michel exhibit better-than-square-root cancellation. The proof proceeds via a connection to multiplicative chaos, following Harper's seminal work. By a non-trivial adaptation of Harper's derandomization argument for character sums, we also obtain upper bounds for low moments of Hecke eigenvalue sums and of Hecke eigenforms near the cusp $0$; to our knowledge, this is the first appearance of multiplicative chaos in the context of automorphic forms on $\mathrm{GL}(2)$. A novel ingredient is the introduction of Hecke $s$-norms.
Read the full abstract

Optimization and Control

An Adaptive Linesearch-free Method for Monotone Variational Inequalities under Local Lipschitz Continuity

The forward-reflected-backward (FRB) splitting solves monotone inclusions involving the sum of a maximally monotone operator and a monotone Lipschitz continuous operator. Each iteration performs one resolvent step and one evaluation of the Lipschitz operator, together with a reflection term with coefficient equal to one that reuses the operator value from the previous iteration. We consider the setting where the maximally monotone operator is the subdifferential of a proper, closed, convex function. We identify the admissible range of constant reflection coefficients, namely all values larger than one half for a sufficiently small stepsize. We then propose a linesearch-free adaptive variant of FRB for locally Lipschitz continuous operators, in which both the stepsize and the reflection coefficient change across iterations. The stepsize is computed in closed form from a simple local Lipschitz estimate, without knowledge of a global Lipschitz constant, while keeping the iteration cost of FRB. The analysis of both methods relies on a new Lyapunov function that combines the distance to a solution, a residual, and a gap-related term. Alongside nonasymptotic rates, we derive explicit lower bounds on the generated stepsizes, and report numerical experiments on minimax problems, equilibrium models, and regularized regression.
Read the full abstract

Quantum Physics

Strong-coupling quantum optics in free space with holes in a Fermi sea

Coherent and efficient light-matter interfaces between an atom and a single mode of the electromagnetic field are essential for quantum technologies. Traditionally, these systems employ optical cavities or waveguides to isolate a specific mode of light, but a more recent approach is to engineer antennas from ordered configurations of trapped ultracold atoms that exhibit controllable and directed scattering. In this work, we propose a method to engineer an antenna from the center-of-mass wavefunction of a single atom, which can produce directed emission and thereby exhibit strong coupling to a target mode of light in free space. We predict that the resulting single-atom cooperativity can be comparable to the current state of the art in optical cavity and waveguide QED experiments. Building on this approach, we show that a wavepacket antenna becomes a single-atom mirror in the linear response regime. We study the modified dipole-dipole interactions and band structure of chains of such emitters, which can exhibit sub- and superradiance at spacings much larger than the wavelength of the light. Extending our approach to multi-level atoms, we propose a method to achieve arbitrary spatial scattering from a single atom, including uni-directional spontaneous emission. Finally, we elucidate how our approach can enhance cooperative scattering in conventional arrays of tightly trapped atoms.
Read the full abstract

All authors Hao Wang, Hayden C. Orth, Duo Xu, Emily J. Davis

Numerical Analysis

Multiscale and stability analysis of an Aw-Rascle-Zhang-type model with driver-dependent acceleration

We introduce a new traffic flow model. The main idea is to describe acceleration effects in the Aw-Rascle-Zhang model through an additional driver-dependent equation, thereby allowing individual driver characteristics to evolve dynamically rather than being prescribed solely by the traffic density. The resulting system provides a hyperbolic description of traffic dynamics and admits an explicit analysis of its characteristic structure, Riemann problem, and entropy properties. To investigate the stability of the proposed model, we perform a Chapman-Enskog expansion up to second order and derive the corresponding diffusive and higher-order corrections. This analysis reveals how the stability properties depend on the underlying velocity and pressure functions. Several examples are presented to illustrate the theoretical results.
Read the full abstract

High Energy Physics (Phenomenology)

DM induced neutron disappearance as the origin of the LZ nuclear recoil event

We investigate dark-matter-induced neutron disappearance as an interpretation of the high-energy nuclear recoil event reported by LUX-ZEPLIN. An incoming dark matter (DM) particle annihilates a bound neutron into an invisible scalar, leaving a recoiling daughter nucleus. For each accessible daughter state, two-body kinematics fixes the recoil energy in the zero-velocity limit, producing a line spectrum broadened by halo velocities. We identify parameter regions for benchmark DM masses of 5 and 50 GeV that can account for the event near 248 keV without producing events at lower energy. We examine collider constraints in an illustrative ultraviolet completion and recast Borexino data to constrain accompanying nuclear de-excitation signals. More generally, the DM-induced neutron disappearance provides a framework for interpreting localized nuclear recoil excesses in future direct-detection experiments.
Read the full abstract

Artificial Intelligence

Recurrent Graph Neural Networks with Set-Based Aggregation

Recurrent GNNs iterate message passing to convergence, and their logical characterizations to date rely on multi-set aggregation, graded (counting) logics, and halting or acceptance conditions that cannot be verified from the network's parameters. We study recurrent GNNs with set-based aggregation and identify sufficient conditions checkable from the weights for networks to compile into formulas and formulas into networks. The main result is an effective, two-directional equivalence between a class of networks and the Boolean closure of reachability and safety properties, the fragment B$\Sigma^{\circ}_1$ of the modal $\mu$-calculus. The fragment is not an artifact: it is the exact expressive level of stabilization over finite vocabulary, which supports fixed points of a single polarity and Boolean combinations thereof, but not the composition of fixed points of opposite polarities. The correspondence needs no counting logic, no external halting signal, and no non-effective acceptance condition, yielding a verifiable path from weights to symbolic explanations for networks meeting the conditions.
Read the full abstract

General Relativity and Quantum Cosmology

Distinguishing cosmology, astrophysics and systematics: the Bayesian search for a primordial gravitational-wave background in next-generation observatories

Next-generation gravitational-wave observatories like Cosmic Explorer will provide an unprecedented opportunity to probe the cosmological stochastic gravitational-wave background, providing insight into the early Universe that is inaccessible with other means. We investigate the prospects for measuring a Gaussian cosmological gravitational-wave background in Cosmic Explorer in the presence of a distinguishable, non-Gaussian foreground of binary black hole mergers, using a Bayesian search that simultaneously fits binary black hole and background parameters. We successfully recover a Gaussian cosmological background with a signal-to-noise ratio of 5 in one day of simulated data in Cosmic Explorer without contamination from unresolved signals or data exclusion. However, when introducing waveform systematic errors to our analysis, our inference on the stochastic background parameters becomes biased and can falsely infer the presence of a background when there is none. The bias is driven by signal mismatches at low frequencies (<20 Hz), especially when the recovery waveform is missing physical effects included in the injected signals. While we propose a metric for diagnosing if measurements will be strongly biased by waveform systematics, our results suggest improvements in waveform modeling or other mitigation techniques will be required to accurately recover a primordial stochastic gravitational-wave background in next-generation detectors.
Read the full abstract

Algebraic Geometry

Two proofs of the Cassels–Swinnerton-Dyer conjecture for cubic surfaces

The Cassels–Swinnerton-Dyer conjecture asserts that a cubic hypersurface contains a rational point if and only if it contains a point of degree coprime to $3$, or, equivalently, a zero-cycle of degree $1$. The case of smooth cubic surfaces in characteristic zero has been reduced by Coray (1976) and Voisin (2026) to the case of points of degree $4$. We give two independent proofs of this missing case and use a lifting argument to extend the result to smooth cubic surfaces over arbitrary fields. We further give a separate argument for the case of singular cubic surfaces, extending previous work of Coray over perfect fields. Altogether, this proves the Cassels–Swinnerton-Dyer conjecture for cubic surfaces.
Read the full abstract

High Energy Physics (Theory)

String charge density/bit threads correspondence and its S-duality in type IIB supergravity

We identify the spatial projection of a conserved string charge density with a bit-thread flow. This correspondence gives bit threads a string worldsheet description and allows us to compute black hole entropy from the maximal entropy flux of a worldsheet-derived current. We first reproduce the BTZ entropy and then extend the construction to the ten-dimensional F1-NS5-P and D1-D5-P systems. Under Type IIB S-duality, the F1 current maps to the D1 current. Although the local currents, metrics, and flow norms change, the maximal physical flux remains unchanged and gives the same entropy. This provides a nontrivial check of the correspondence. Finally, we propose a D1-D5 boundary-matching conjecture. In the coarse-grained picture, each string-charge line defines an entropy-carrying tube. The boundary CFT entanglement entropy and the bulk black hole entropy both fix the product of the number of tubes and the maximum entropy carried by each tube. For a fixed tube discretization, they assign the same capacity to each tube. They therefore describe the same conserved maximal entropy flux, providing an information-flow interpretation of the equality between entanglement entropy and black hole entropy.
Read the full abstract

Game Theory

Core Up-To-One for Participatory Budgeting with Additive Utilities

We study participatory budgeting with additive utilities. We introduce a selection rule based on utility-weighted harmonic entropy and a cost penalty, and prove that it returns budget-feasible outcomes satisfying core-up-to-one.

Representation Theory

Interval endomorphism algebras of posets: Reedy structure, combinatorics, and homological theory

Let $P$ be a finite connected poset and let $\Lambda_P$ be the opposite endomorphism algebra of the direct sum of all interval representations of $P$ over a field. Via projectivization, this algebra governs resolutions relative to interval-decomposable representations, which arise naturally in persistence theory. We first show that $\Lambda_P$ carries a Reedy algebra structure in the sense of Dalezios–Šťovíček. Its Reedy degree is given by the cardinality of the indexing interval, and the induced quasi-hereditary order is given by reverse interval cardinality. With respect to the resulting quasi-hereditary structure, we give a concrete combinatorial description of the standard modules and construct explicit projective resolutions of these modules. Using these resolutions, we reduce the calculation of standard–simple Ext groups to the reduced cohomology of simplicial complexes determined by the interval combinatorics. Order reversal gives the corresponding simple–costandard formula. Building on these calculations, we determine all simple–simple Ext groups. These groups are one-dimensional in a unique degree when the corresponding pair of intervals is saturated, and vanish otherwise. As a consequence, we obtain an exact combinatorial formula for the global dimension of $\Lambda_P$, which in particular shows that it is independent of the coefficient field. As an application, for the $m$ by $\ell$ grid $G_{m,\ell}$ with $m\geq\ell\geq2$, we give the explicit formula $\operatorname{gldim}\Lambda_{G_{m,\ell}}=\min\{2\ell,m+\ell-2\}$. This also gives an explicit formula for the interval-resolution global dimension of these grids, settling the corresponding grid conjectures of Asashiba–Escolar–Nakashima–Yoshiwaki and determining the stable value and the precise stabilization threshold.
Read the full abstract

Quantum Physics

Achieving perfect completeness for one- and two-message quantum proof systems

While quantum interactive proof systems using at least three messages can achieve perfect completeness, as shown by Kitaev and Watrous (STOC 2000), whether perfect completeness is achievable for one- and two-message quantum proof systems has remained open. For the one-message case, whether $\sf QMA$ can achieve perfect completeness was posed as an open problem in Watrous (FOCS 2000) and Aharonov and Naveh (2002); for the two-message case, the corresponding problems were (implicitly) posed in Jain, Upadhyay, and Watrous~(FOCS 2009) and Kobayashi, Le Gall, and Nishimura (SICOMP, 2019). In this work, we establish that ${\sf QIP}(2)$, ${\rm qq}\text{-}{\sf QAM}$, $\sf QAM$, and $\sf QMA$ can achieve perfect completeness. Here ${\rm qq}\text{-}{\sf QAM}$ denotes the class of promise problems admitting two-message quantum-public-coin quantum interactive proof systems in which the verifier's only message consists of half-EPR pairs. Our main technical contributions are the follows: 1. For $\sf QMA$ (and directly for $\sf QAM$), an exactly constructible block-encoded matrix whose kernel certifies yes instances, constructed from the acceptance operator induced by the verification circuit. This also yields an alternative proof of ${\sf QCMA}={\sf QCMA}_1$. 2. For ${\sf QIP}(2)$ (and implicitly ${\rm qq}\text{-}{\sf QAM}$), a new turn-halving transformation that preserves completeness and ensures that the resulting proof system retains at least two messages, provided that the terminal state before the final measurement is efficiently preparable.
Read the full abstract

Instrumentation and Methods for Astrophysics

Disentangling 3D Magnetic Field Geometry from Turbulence: A Polarization-Based Classification Method

We develop a decision tree classifier that recovers 3D magnetic field geometry from synthetic polarization and position angle maps of a magnetized, turbulent field. We test the classifier for a series of geometries: Uniform, Wavy, Helical, and Hourglass. The classifier is calibrated across a range of Alfvénic Mach numbers and injected Stokes Q,U noise levels for each geometry. Our models show the median and skewness of the polarization fraction, as well as the position angle circular variance, vary systematically with both geometry and the Alfvénic Mach number. We find that the 3D geometry can be isolated by using a variety of polarization and position angle metrics to break degeneracies. The classifier recovers most geometries well for sub-Alfvénic cases (Alfvénic Mach Number < 1). For Alfvénic Mach Number > 1, polarization and position angle statistics converge across all geometries and the classifier fails to recover the magnetic field structure.
Read the full abstract

Quantum Physics

Quantum Codes for Generalized Amplitude-damping Noise

Quantum error correcting (QEC) plays a crucial role in protecting quantum information against decoherence and enabling scalable, reliable quantum computing. One of the most realistic and ubiquitous sources of noise affecting quantum hardware today is generalized amplitude-damping (GAD) noise. Conventional, deterministic QEC codes struggle to correct for GAD noise because of their inherent structure, leading to fidelity losses that scale linearly with the damping strength. In this work, we introduce the framework of probabilistic approximate quantum error correction (PAQEC), that combines the flexibility of approximate QEC with the potential of post-selected recovery, enabling high-fidelity, resource-efficient error correction. We construct a five-qubit permutation-invariant code that, under probabilistic recovery, achieves a fidelity loss quadratic in the damping strength, thus outperforming existing QEC codes. Formulating PAQEC as an optimization problem, we present a numerical technique based on Charnes-Cooper and semidefinite programming to identify the optimal recovery map for any PAQEC code. Our results establish PAQEC as a powerful tool for developing resource-efficient, high-fidelity quantum codes tailored to realistic noise, with promising implications for near-term quantum devices and future fault-tolerant architectures.
Read the full abstract

All authors Sourav Dutta, Anubhab Rudra, Manav Seksaria, Anil Prabhakar, Prabha Mandayam

Analysis of PDEs

Boundary regularity of harmonic functions in $C^1$ slit domains

We establish precise upper and lower estimates for harmonic functions vanishing on the slit of a $C^1$ slit domain, with no assumption that the slit lies in a hyperplane. The classical $\sqrt{d}$ growth near the edge, $d$ being the distance to the slit, persists in this generality, up to an explicit factor \[\exp\Big( \pm C \int_\rho^r \omega(s)\, \frac{ds}{s} \Big)\] determined by the $C^1$-modulus of continuity $\omega$ of the slit, where $\rho < r$ are the two scales being compared. The upper estimates allow a right-hand side and non-zero boundary data. The correction factors remain bounded above and below by positive constants as $\rho\to0$ precisely when $\omega$ satisfies the Dini condition. Moduli of continuity beyond the Dini regime, as is the case for the logarithmic moduli arising at singular sets in relevant free boundary problems, were not covered by the previous $C^{1,\alpha}$ theory. Previously, the $\sqrt{d}$ growth was known for slits contained in a hyperplane, which additionally have a $C^{1,\alpha}$ edge (De Silva, Savin). For Lipschitz slits, there are boundary Harnack principles, but no growth rate is identified precisely. The main technical ingredient is a change of coordinates flattening a Lipschitz slit domain onto the model half-hyperplane slit, with quantitative estimates up to second order. The construction is geometric and does not use the equation, so we expect it to be useful for other boundary regularity problems.
Read the full abstract

All authors Joan Domingo-Pasarin, Pablo Hidalgo-Palencia, Alejandro Martínez, Clara Torres-Latorre

Materials Science

An Open-Source Hardware and Software Toolkit to Enable Agentic RHEED-Guided Thin-Film Synthesis

Reflection high-energy electron diffraction (RHEED) provides rich information about evolving surfaces during thin-film growth, but non-automated, operator-dependent alignment and fragmented analysis workflows limit its potential in fully autonomous synthesis. Here, we present an open-source hardware and software toolkit that makes RHEED control and quantitative analysis accessible to operators and artificial intelligence (AI) agents. Demonstrated on a pulsed laser deposition system, the toolkit provides programmable electron-optics control, automated beam alignment and rocking-curve acquisition, and a training-free method for crystallographic azimuthal alignment. The auto RHEED application extracts structural and growth-related observables through shared graphical and programmatic interfaces, including a Model Context Protocol (MCP) server. An agent-driven demonstration shows how natural-language requests can guide the selection, configuration, and execution of quantitative analyses. An extensible adapter interface streamlines the incorporation of community-developed methods for AI analysis and RHEED simulation as they emerge, supported by Markdown implementation guides designed for AI coding agents. These capabilities support complementary descriptions of surface evolution through physical measurements and learned image representations while providing a practical route for incorporating new computational methods. Together, these tools reduce barriers to automated and agentic RHEED measurements and establish a foundation for future agentic control of thin-film synthesis guided by the evolving surface.
Read the full abstract

All authors Asraful Haque, Christopher M. Rouleau, Rama K. Vasudevan, Sumner B. Harris

Robotics

Touch2Trace: Tactile-Driven Imitation Learning for Dexterous Cable Tracing

Dexterous manipulation of deformable objects demands continuous fingertip-level regulation of pressure, friction, and incipient slip. We study one of the most challenging cases: dexterous cable tracing, feeding a cable through the hand with repeated pinch-and-curl motions of the thumb and index finger. We introduce Touch2Trace, a tactile-driven imitation-learning system for this task, and provide, to our knowledge, the first systematic real-world characterization of how encoder pretraining, control rate, temporal context, and spatial resolution each shape policy performance. The winning learning recipe combines a tactile encoder pretrained for a custom 32 x 32 piezoresistive sensor (TacV5) via self-supervised learning with a lightweight transformer policy trained on teleoperated demonstrations via behavior cloning, deployed at 60 Hz on a Tesollo DG-5F hand. Tactile feedback without vision or explicit cable-state estimation significantly improves tracing performance versus a proprioception-only baseline: from 0.2 cm to 20.1 cm mean distance and 0% to 93% success rate, with zero-shot transfer to unseen cables and routing conditions. The results quantify the influence of key parameters in tactile-driven systems for reliable dexterous deformable object manipulation.
Read the full abstract

All authors Matteo Grimaldi, David Klee, Ziling Chen, Tong Jian, Wonju Lee, Wenjie Lu, Tao Yu, Saleh Nabi

Biological Physics

Multiflagellarity facilitates bacterial upstream motility

Upstream swimming drives bacterial spreading and surface colonization. Many pathogens encounter fluid flows as they infect the intestines, lungs, and urinary tract, so how bacteria use their flagella to counter these flows matters for disease and treatment. Yet how morphology and flagellar arrangement govern motility against flow remains unknown. Here, we investigate the biophysical determinants of rheotaxis by combining microfluidics, directed evolution, genetics, holography, and hydrodynamics simulations. Using upstream swimming competitions, we find that peritrichous E. coli and S. enterica rapidly outcompete monotrichous P. aeruginosa and V. cholerae, accumulating upstream at densities up to five orders of magnitude higher, even though Vibrio swims three times as fast. Motility selection experiments show that rheotaxis increases with flagellar number and length, confirmed by overexpressing the master regulator flhD/C. Three-dimensional holography and single-cell tracking reveal that multiflagellarity stabilizes surface residence and promotes the weathervane effect that reorients cells upstream, a mechanism further supported by simulations that fully resolve flagellar arrangement and fluid-structure interactions. These results establish multiflagellarity as a key facilitator of upstream navigation, governed by near-wall residence and shear-driven reorientation rather than by swimming speed.
Read the full abstract

All authors Ran Tao, Nathaniel C. Esteves, Wanho Lee, Lauren Altman, Liuni Chen, David Gao, Ling Li, Yongsam Kim, Jun Zhu, Sookkyung Lim, Arnold J. T. M. Mathijssen

Artificial Intelligence

Pilot Early, Commit Late: A Real-Options Model of Enterprise AI Adoption under Rapid Technological Progress

Artificial intelligence presents firms with an unusual timing problem. The technology frontier is improving rapidly, implementation is partly irreversible, and organization-specific capabilities are accumulated through action. This paper develops a two-period decision model of AI deployment under uncertainty in which a firm chooses among immediate deployment, a limited pilot, and waiting. Deployment earns current operating value but exposes the firm to architectural obsolescence; waiting preserves the option to adopt after the frontier is observed; a pilot sacrifices current operating value to build organization-specific learning without full commitment. The model yields five central timing results and a sixth comparative result on where learning occurs. First, a mean-preserving increase in frontier uncertainty raises the value of waiting and piloting but leaves immediate deployment unchanged when its payoff is affine in the frontier. Second, faster expected frontier progress can reduce the relative attractiveness of immediate deployment when deployed architecture captures only a limited share of future improvement. Third, a pilot dominates waiting exactly when the expected value of the capability it builds exceeds its cost. Fourth, sufficiently valuable organization-specific learning creates a nonempty region in which "pilot early, commit late" is optimal. Fifth, there is a closed-form modularity threshold above which immediate deployment dominates the best outside option. Sixth, production learning and pilot-specific learning affect the timing margin differently. A continuous-time extension recovers the standard result that uncertainty raises the adoption threshold while capability and modularity lower it. The paper separates deploying, experimenting, and waiting, and shows why rapid progress can rationally increase experimentation without justifying irreversible commitment.
Read the full abstract