Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Thursday 10 September

Materials Science

Sparse data limit what a mechanistic corrosion model can predict

Mechanistic corrosion models are routinely fitted with four to six parameters to a few measurements and extrapolated across service lifetimes, yet whether the data determine them is rarely tested. We identify a reduced point defect model for the duplex oxide on Nb-stabilized AISI 347 in simulated boiling-water-reactor water from published depth profiles at three exposure times, by differentiable inversion graded against a closed-form reference. Profile likelihood, a 1000-member bootstrap and a prior-relaxation test agree that one of the five parameters is undetermined and a second only weakly so, and that 95% of the fit statistic rests on three chromium points. The kinetics track an empirical power law over the calibration window but diverge from it by a factor of 3.5 to 6.3 at ten years, outside the propagated uncertainty band. That separation, not the thickness it brackets, is what these data determine; an exposure near 3000 hours would resolve it.
Read the full abstract

Quantum Physics

Computational framework for quantum state tomography of spin ensembles

We present Tomography-NMR, an open-source Python package that reconstructs quantum density matrices from spectroscopic measurement data. The package implements a complete analysis pipeline for two-qubit quantum state tomography based on the product operator formalism: raw time-domain signals are Fourier-transformed into frequency-domain spectra, spectral peak intensities are mapped to expansion coefficients of the density matrix, and the full quantum state is reconstructed. Three integration methods are provided for different use cases: direct peak height measurement and fixed-parameter numerical integration require no theoretical reference and are suited to unknown states, achieving fidelities of approximately 98% on a benchmark set of known states, while a systematic parameter optimization against a known target state achieves reconstruction fidelities exceeding 99% for the same benchmark states. While the detailed theoretical framework for quantum state tomography is well established, the practical procedures for extracting density matrices from experimental spectra are often inadequately documented in the literature and obscured within proprietary software. This package addresses that gap by providing a fully transparent, reproducible implementation of every analysis step, from spectral preprocessing to density matrix visualization. The software has been validated on experimentally prepared two-qubit states measured via nuclear magnetic resonance (NMR) spectroscopy of coupled $^{31}$P nuclei. Average reconstruction fidelities range from 0.975 to 0.995 across a benchmark set of 20 two-qubit states, including the computational basis states, Bell states, and the outputs of three fundamental quantum gates (CNOT, H, and T). Although developed for NMR, the modular architecture facilitates adaptation to other spectroscopic platforms and alternative measurement protocols.
Read the full abstract

Machine Learning

AdamX: Cosine similarity meets gradient descent

We introduce AdamX, a first-order optimizer that incorporates cosine similarity as an adaptive mechanism for controlling update magnitudes. The proposed method is scalable, model-agnostic, and straightforward to integrate into existing training pipelines. We further introduce a variance rectification scheme that promotes smoother optimization during the early stages of training. Overall, we provide empirical evidence that AdamX achieves competitive convergence rates across a range of benchmark datasets and architectures. Performance is evaluated in terms of the number of epochs required to reach predefined performance thresholds under a fixed hyperparameter budget. Code and Experiments available at: https://github.com/FranciscoCaldas/adamX.
Read the full abstract

Logic

Every subset of a topological Ramsey space is Ramsey in the Solovay model

We provide a proof, free of ultrafilters and almost reduction, that every subset of a topological Ramsey space is Ramsey in the Solovay model.

Computation and Language

Epistemic orientation predicts legislative effectiveness among members of the US Congress

Truth and evidence-based communication provide important foundations for democratic governance, accountability, and collective decision-making. Prior work shows that evidence-oriented language in US congressional floor speeches has declined since the mid-1970s, alongside broader changes in legislative productivity and polarization. This study shifts the analysis from congressional sessions to individual members of Congress to examine whether epistemic orientation varies systematically across legislators and whether it relates to political behavior and legislative effectiveness. Using the Evidence-Minus-Intuition (EMI) score, we measure the relative prevalence of evidence-oriented versus intuition-oriented language in congressional floor speeches and Twitter posts. We link these measures to legislator-level data on ideology, institutional position, communication context, and Legislative Effectiveness Score (LES). The results show that more ideologically extreme members use less evidence-oriented language on the congressional floor. EMI also exhibits cross-platform consistency with members who use more evidence-oriented language in floor speeches also being more evidence-oriented on Twitter, although EMI is lower on Twitter overall. Finally, EMI in congressional speeches is positively associated with individual legislative effectiveness, even after accounting for ideology and extensive political, institutional, demographic, topical, and communication volume controls. These findings suggest that evidence-oriented language is not only an aggregate feature of congressional discourse but also a meaningful attribute of individual-level legislative communication and effectiveness.
Read the full abstract

Audio and Speech Processing

RetroThinker: Enabling Retrospective Thinking in Speech LLMs

Speech large language models (SpeechLLMs) offer reduced latency and retain paralinguistic nuances that are typically lost in cascaded automatic speech recognition (ASR) and text-based LM architectures. However, they continue to lag behind text-only LLMs on complex reasoning tasks, while real-time spoken interaction imposes strict latency constraints. Although prior works employ Chain-of-Thought (CoT) and concurrent reasoning to enhance reasoning capabilities without inducing prohibitive delays, an inherent accuracy-latency trade-off persists. In this paper, we investigate whether a streaming SpeechLLM can dynamically revise its reasoning traces on the fly. We introduce RetroThinker, a multi-stage post-training framework that equips the Moshi model to self-verify and forward-correct CoT steps during inference. RetroThinker combines supervised fine-tuning (SFT) on curated retrospective thinking data with length-based direct preference optimization (DPO) to optimize retrospective during early reasoning (i.e., reasoning concurrently while the user speaks). Evaluated on the GSM8K benchmark, RetroThinker significantly improves the accuracy-latency trade-off over non-retrospective baselines, achieving an 11% absolute accuracy gain at a comparable latency.
Read the full abstract

All authors Yi-Jen Shih, Puyuan Peng, Abdelrahman Mohamed, David Harwath

Game Theory

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.
Read the full abstract

Materials Science

High-Temperature ferromagnetism from site-selective filling in (Fe,Ni)$_{6-\delta}$GeTe$_2$

The discovery of high-temperature ferromagnetism in the metallic van der Waals (vdW) system Fe$_N$GeTe$_2$ has brought two-dimensional (2D) magnets into technologically relevant temperature scales. Specifically at N = 5, dilution of magnetic moments by nickel substitution counterintuitively achieves a record high Curie temperature of 478~K. Unraveling the origin of this nickel-substitution-induced enhancement is complicated by the compound's structural complexity, coexistent itinerant and local magnetic contributions, and mesoscopic compositional domains. Through coordinated structural and electronic characterization, we identify that the high-T$_C$ magnetic phase arises from a strain-stabilized Fe$_6$GeTe$_2$ nano-precipitate. Combining first-principles calculations and spin- and angle-resolved photoemission spectroscopy (ARPES), we uncover a site-specific electronic landscape in which interior iron atoms primarily host localized moments while the outer iron atoms neighboring the tellurium layers produce spin-polarized itinerant carriers that cross the vdW gap. The large energy cost associated with homogeneous nickel substitution is found to favor the spontaneous precipitation of the crystallographically and electronically “clean” high-T$_C$ phase. Finally, we compare metal-rich vdW magnets with binary magnetic alloys, and discuss the unifying roles of nano-precipitates in stabilizing otherwise unattainable bulk phases. Our work provides mechanistic insights into the record-high T$_C$ ferromagnetism in (Fe,Ni)$_{5+\delta}$GeTe$_2$, establishing a rigorous foundation for the atomic engineering of vdW magnetic metals informed by direct electronic signatures.
Read the full abstract

All authors Tyler L. Werner, Jonathan T. Reichanadter, Xiang Chen, Pranab K. Nag, Luna Y. Liu, Yu-Tsun Shao, Hongrui Zhang, Mingyang Guo, Wenxin Li, Zhibo Kang, Han Wu, Makoto Hashimoto, Donghui Lu, Turgut Yilmaz, Elio Vescovo, Sung-Kwan Mo, Barat Achinuq, Alexei Fedorov, Jacob C. Ruff, Ming Yi, Qiong Ma, David A. Muller, Eduardo H. da Silva Neto, Robert J. Birgeneau, Jeffrey B. Neaton, Yu He

Materials Science

High-fidelity k$\cdot$p representations of first-principles electronic band structures through covariant renormalization

The k$\cdot$p method can be applied directly to first-principles energies and momentum matrix elements, but the resulting models converge slowly with the number of bands and are inexact wherever the underlying Hamiltonian is nonlocal. We show that both limitations can be largely removed by renormalizing the eigenvalue spectra of the Hermitian momentum matrices. These spectra are gauge invariant, and are identical along symmetry-related directions; hence scaling the recurring magnitudes provides a modest set of parameters that preserves degeneracies and crystal symmetry without needing to construct a symmetry-adapted basis. We choose to renormalize the models against reference eigenvalues and band velocities on rays out of a high-symmetry point. For GaP, a 15-band model can reproduce the band structure in the near-gap reference regions within a few meV. For zincblende and wurtzite AlN, similar accuracy requires 30- or 85-band models, which in the case of zincblende is traced to the strong warping in the [110] direction. The scheme readily generalizes to rocksalt PbTe, which includes spin-orbit coupling, and has $L$-centered valence- and conduction-band extrema. Further, we demonstrate, for GaP, how compact four-band Hamiltonians can be obtained by downfolding within the same renormalization scheme. Moreover, by changing the fitting regime to encompass the entire Brillouin zone, the scheme can be used to generate full-zone models that reproduce the density of states. A practical use of the method is illustrated with a 59-band k$\cdot$p model for GaP, which can be evaluated on meshes far denser than the reference calculation, that in turn can be used both to resolve fine features in the density of states and to compute the hole conductivity at low temperature.
Read the full abstract

Artificial Intelligence

Explainability Assistant: A Conversational XAI Interface for Interpreting Energy Consumption Models

Energy consumption forecasting relies on increasingly complex machine learning (ML) models, such as Genetic Programming-based symbolic regressors, whose predictions can be difficult for facility managers and building operators to interpret. Explainable Artificial Intelligence (XAI) techniques address this opacity, but traditional XAI dashboards require substantial technical expertise and provide limited flexibility for dynamic, context-aware inquiry. Conversational XAI systems offer a promising alternative; however, previous approaches, such as TalkToModel, were constrained by rigid custom grammars and achieved only 76.8% intent-parsing accuracy. This paper introduces the Explainability Assistant, an open-source conversational XAI system that leverages the function-calling capabilities of modern Large Language Models (LLMs) to overcome these limitations. The system achieves 94% intent-parsing accuracy, supports flexible natural language interaction, and adapts to different ML problem types without task-specific fine-tuning. We present the system's architecture and report results from a comparative evaluation conducted with energy domain specialists, contrasting the Explainability Assistant with a traditional XAI dashboard. The evaluation suggests improved usability and consistent task accuracy, with all experts unanimously preferring the conversational interface for practical use.
Read the full abstract

All authors Rodion Krjutškov, Eduard Barbu, Nikos Sakkas, Sofia Yfanti

Artificial Intelligence

From Parameters to Answers: How LLMs Retrieve and Use Their Internal Knowledge

How does a language model's dependence on query-routing information and target knowledge change as it answers a question? We study this question through layerwise interventions on the hidden state at the end of the question. Across Qwen, Llama, and Gemma, we compare country-continent questions with noun, adjective, and code answers while keeping several fitted measurements distinct. A pair-conditioned request direction describes which country is queried in natural single-country questions; a global request direction describes first- versus second-country requests in paired questions; separate selection candidates test control among contents already available in the hidden state. A diagnostic reanalysis of frozen Qwen natural-question states shows that the pair-conditioned direction grows stronger before interventions on it begin to alter later fitted knowledge, with this causal window opening while answer-supporting content is still forming. The paired three-model trajectories are not uniform: Gemma shows a partially overlapping mid-layer routing-content profile, whereas Llama has no sustained routing-effect window under the same gates. In the paired protocol, dependence on the global request direction decreases from fixed earlier to later layer sets while dependence on fitted content persists. A matched Qwen comparison shows that the pair-conditioned direction retains a late effect, so this operational handoff concerns the global fitted direction rather than all request information. These results separate early readability, natural strength, causal steering, and later content dependence.
Read the full abstract

All authors Wenkang Wei, Yuan Fang, Renhe Jiang, Hong Cheng, Xingtong Yu

Strongly Correlated Electrons

Sub-cycle doublon-holon dynamics in one-dimensional Mott insulators revealed by two-color high-harmonic spectroscopy

Solid-state high-harmonic spectroscopy is becoming an emerging tool for probing nonequilibrium many-body dynamics. Yet, direct measurements of strongly driven, sub-optical-cycle dynamics in correlated materials during high-harmonic emission remain largely unexplored. Here, we measure high-harmonic emission chirp in a prototypical one-dimensional Mott insulator, which encodes strongly driven doublon-holon dynamics at sub-optical-cycle timescales. We observe a positive chirp for above band gap harmonics, indicating that high harmonics are dominated by doublon-holon recombinations. We further show a harmonic order-dependent dephasing, which can be understood through different doublon-holon excursion distances associated with each harmonic. These results reveal coherent doublon-holon dynamics and their ultrafast dephasing in Mott insulators, which is relevant to other nonequilibrium light-induced phenomena, such as Floquet engineering.
Read the full abstract

All authors Lance Hatch, Aditya Verma, Eric Schultz, Hanjun Yang, Priscila Rosa, Genda Gu, Igor Zaliznyak, Giulio Vampa, Laimei Nie, Hanzhe Liu

Spectral Theory

Regular hyperbolic tilings have no $\ell^2$ eigenfunctions

We show that the adjacency operator of the $1$-skeleton of any regular tiling of the hyperbolic plane has no nonzero square-integrable eigenfunctions. As a consequence, the same holds for every infinite connected regular graph admitting a proper planar embedding with regular dual.
Read the full abstract

High Energy Physics (Theory)

Chiral Spin(7) Sigma Models and Topological Modular Forms

We construct canonical chiral $\mathcal N=(0,1)$ sigma models on Spin(7) manifolds. The Spin(7) structure fixes the rank-seven bundle of the left-moving fermions, whose quadratic index matches the tangent representation, so the internal anomalies cancel while the rank difference leaves the gravitational anomaly of one right-moving Majorana–Weyl fermion. A transverse section of the left-moving bundle has a 1D zero locus with induced String structure, and we compute its class in the first torsion group of topological modular forms. The class is nonzero precisely when the Euler characteristic of the target is odd. The standard Joyce action on the torus has no internal finite-group anomaly and can be gauged to define an exact chiral spin QFT. We show that the orbifold Euler characteristic is even throughout the diagonal Joyce family generated by coordinate reflections and half-shifts preserving the Cayley form. By contrast, a free antiholomorphic quotient of the Fermat sextic is a compact torsion-free Spin(7) target with Euler characteristic 1305 and realizes the nonzero class.
Read the full abstract

Quantum Physics

PureSuperQMA(exp) = BellPureSymQMA(poly) = QMA via Dimension-Free Bosonic Argmax

Pure-state consistency problems naturally lead to quantum proof systems in which a single pure witness must satisfy many acceptance constraints. The corresponding class $\mathsf{PureSuperQMA}$ was previously known to lie between $\mathsf{QMA}$ and $\mathsf{QMA}(2)$, and Kamminga and Rudolph (ITCS'26) conjectured that both containments are strict. In this paper, we prove the following surprising complexity collapses $$ \mathsf{QMA} = \mathsf{PureSuperQMA} = \mathsf{PureSuperQMA}(\text{exp}) = \mathsf{BellPureSymQMA}(\text{poly}) $$ Here $\mathsf{PureSuperQMA}(\text{exp})$ allows exponentially many checks which are uniformly indexed and efficiently generated, while requiring an inverse-polynomial violation margin and an inverse-polynomial fraction of violated checks for the NO cases. $\mathsf{BellPureSymQMA}(\text{poly})$ is a related model that requires the prover to give the verifier polynomially many copies of a pure state, which the verifier measures separately with logarithmic output length for each local measurement, before processing the outcomes jointly. The main technical ingredient is a dimension-free stability bound for symmetric tensor states. Our simulations use polynomially many witness registers and combine a random-pair SWAP test with a permutation-invariant lift of the original verification procedure. The key step is to show that, on the symmetric subspace, the extremal verification value is close to that of some tensor-power witness with dimension-independent error. Applying this argument to the two verification models yields both simulations. As a consequence, exact $k$-local pure-state consistency is $\mathsf{QMA}$-complete for every fixed $k\ge2$, and so are the corresponding exact bosonic and fermionic pure $N$-representability problems.
Read the full abstract

All authors William Gay, Fernando Granha Jeronimo, Lenny Liu, Itai Leigh, Pei Wu, Haochen Xu

Functional Analysis

Critical Schatten exponents for the Berger-Coburn endpoint problem

Berger and Coburn showed that boundedness of a Toeplitz operator $T_g$ on the Fock space controls the heat transform $g^{(t)}$ for $1/4<t<1$, and conjectured that $T_g$ is bounded if and only if $g^{(1/4)}$ is bounded. Looi recently disproved the forward implication by constructing a bounded $T_g$ with unbounded $g^{(1/4)}$. We prove that the reverse implication also fails, even for a real-valued admissible symbol $g$ with $g^{(1/4)}\in C_0(\mathbb{C}^n)$, and that the forward implication fails even when $T_g\in S_p$ for every finite $p>1$. Our counterexamples come from Baire category and closed graph arguments, which yield no explicit symbols. Despite this two-sided failure, the forward implication has a sharp Schatten-class form: $\|g^{(1/4)}\|_\infty\le 2^n\|T_g\|_{S_1}$ for every admissible symbol $g$ with $T_g$ trace class. We show that the constant $2^n$ is optimal and that the same estimate holds with $S_p$ in place of $S_1$ for $T_g\in S_p$ when $0<p\le1$. For $p>1$, no corresponding uniform estimate holds, even for smooth compactly supported symbols. We also determine the optimal constants in the Berger–Coburn estimates for $1/4<t\le1$. Finally, for $1\le p<\infty$, we show that the equivalence $T_g\in S_p$ if and only if $g^{(1/4)}\in L^p$ holds exactly when $p=2$, answering a question of Bauer, Coburn, and Isralowitz.
Read the full abstract

Cryptography and Security

BlueSTAR: Tiered Agentic Architecture for Autonomous Cyber Defense

Cyber attacks are increasingly automated, narrowing the time available for human analysts to detect, reason about, and respond to intrusions. Large language models (LLMs) offer a promising foundation for autonomous cyber defense because they can correlate heterogeneous evidence and reason about previously unseen threats. However, directly applying LLMs to operational security telemetry is impractical: raw logs arrive faster than current models can process them, individual events are often ambiguous, and unconstrained LLM actions can introduce significant operational risk. We present BlueSTAR, a tiered agentic architecture for autonomous cyber defense in enterprise IT/OT networks. BlueSTAR first transforms high-volume security telemetry into compact indicators of compromise. We further introduce a resilience metric that jointly captures attacker reach, impact on mission-critical assets, and disruption caused by defensive actions. We evaluate BlueSTAR on two live enterprise IT/OT cyber ranges using seven attack chains based on real-world intrusion techniques. Across attack chains, BlueSTAR retains the fast containment of deterministic response for known threats while successfully defending against attacks requiring contextual and cross-cycle reasoning, including credential theft, repeated compromise, concurrent attackers, and attacks against physical processes.
Read the full abstract

All authors Simona Boboila, Xavier Cadet, Edward Koh, Daniel Balasubramanian, Dirk Van Bruggen, Peter Chin, Alina Oprea

Computation and Language

IndicTriMix: Developing Language Identification Datasets and Models for Tri-Language Code-Mixing

Language identification in code-mixed text, largely observed in social media, is highly essential when users frequently switch between multiple languages within a single utterance. Accurately identifying the languages of code-mixed tokens becomes an urgent necessity. Traditional language identification models, designed for monolingual text, are not well suited for token-level language identification in code-mixed settings. We formulate the task as a sequence labeling problem and fine-tune contextual transformer-based models MuRIL and XLM-RoBERTa best suited for Indian languages. We evaluate these systems on three different data configurations (Hindi, Gujarati, and Bengali) to predict language labels for individual tokens. We release a benchmark for language identification in code-mixed tokens with manually annotated test sets. We propose two approaches of code-mixed generation using parallel sentences of three languages. The trained models demonstrate the effectiveness of contextual embeddings for token-level language identification in multilingual social media text. For reproducibility and to facilitate future research, we publicly release our fine-tuned models.
Read the full abstract

All authors Pruthwik Mishra, Rudra Trivedi, Avi Patel, Ashok Urlana, Shrikant Malviya

Solar and Stellar Astrophysics

A Homogenized Catalogue of Variable Stars in the Globular Cluster M22: Membership, Physical Parameters, and Distance

We present a photometric analysis of the variable stars in the field of the globular cluster M22 (NGC 6656), using time-series photometry from the literature and from OGLE and Gaia-DR3 data. From a sample of 666 variable stars in the field, we identify 94 as cluster members, including 10 RRab, 17 RRc, 2 Type II Cepheids, 15 SX Phe, 15 SR stars and 22 eclipsing binaries. Fourteen of these members are not included in the Catalogue of Variable Stars in Globular Clusters. Through the Fourier decomposition of the RR Lyrae light curves, we derived $[\mathrm{Fe/H}] = -1.73 \pm 0.17$ dex and $d = 3.27 \pm 0.14$ kpc. Among the RRc stars, V15 shows an additional frequency with a frequency ratio $f_{0.61}/f_\mathrm{1O} = 0.6152$, consistent with the RR$_{0.61}$ phenomenon. Using P-L relations for member SX Phe stars, we obtained $d = 3.31 \pm 0.17$ kpc, consistent with the RR Lyrae distance. We constructed a CMD comprising only cluster members, which allows us to confirm the evolutionary status of the cluster's RR Lyrae stars. None of the fitted isochrones satisfactorily reproduces the CMD morphology, which is consistent with the presence of multiple stellar populations in M22.
Read the full abstract

All authors M. A. Yepez, B. Moreno-Amaro, M. Ornelas-Castañeda, A. Arellano Ferro, D. Deras

Quantum Physics

PPT states of almost maximal Schmidt number

We construct PPT states on $\mathbb{C}^m \otimes\mathbb{C}^n$ that have Schmidt number asymptotically approaching the smaller local dimension. More specifically, we construct a PPT state with Schmidt number at least $$ \left\lceil \frac{m + n - ((m - n)^2 + 4(m + n - 1))^{1/2}}{2} \right\rceil. $$ In the case of equal local dimensions ($m = n$), this becomes $n - \lfloor(2n - 1)^{1/2}\rfloor$, far exceeding the previous constructions which achieved $n/2 + O(1)$. In the case of unequal local dimensions, our result shows that there exists a PPT state on $\mathbb{C}^n \otimes \mathbb{C}^{3n-4}$ with Schmidt number at least $n-1$.
Read the full abstract

Number Theory

Bounded asymptotic bases for linear forms

For a vector of positive integers $\mathbf{b} = (b_1,\ldots,b_h)$ with $\gcd(b_1,\ldots,b_h) = 1$, we study sets $A \subseteq \mathbb{N}$ for which every sufficiently large integer has a bounded positive number of representations \[ n = b_1 x_1 + \cdots + b_h x_h \qquad (x_1,\ldots,x_h\in A). \] We prove that such a set exists for every binary vector $\mathbf{b} \neq (1,1)$, and for some general higher-dimensional families, including $\mathbf{b} = (u_1, p^d u_2, \ldots, p^{(h-1)d} u_h)$ where $p\nmid u_1\cdots u_h$.
Read the full abstract

Quantum Physics

The cost of simulating classically tractable quantum circuits and dynamics

Determining whether a quantum evolution can be efficiently simulated classically is central to understanding the boundary between classical and quantum computation. However, polynomial-time simulability is an asymptotic statement, and does not by itself determine whether the (quantum-inspired) classical simulation is actually practical. Indeed, different polynomial scalings can lead to vastly different computational costs, particularly when expensive preprocessing or quantum data acquisition is required. In this work, we ask whether classically simulable quantum dynamics are in practice more resource-efficient to simulate classically than to execute directly on quantum hardware. We analyze this question using three resource metrics, quantum sample, quantum time, and classical time complexity, for several widely studied classically simulable circuit families. Using representative hardware-level estimates, we identify regimes in which quantum simulation can be faster despite the existence of a polynomial-time classical algorithm, as well as regimes in which classical simulation remains more efficient. At the same time, the large quantum sampling cost needed to characterize unknown input states can make this polynomial-time classical simulation prohibitively expensive with current cloud-based hardware access prices. Ultimately, our work indicates that guarantees of classical simulability with polynomial resources alone are insufficient to determine the preferred implementation.
Read the full abstract

All authors Su Yeon Chang, Supanut Thanasilp, Zoë Holmes, M. Cerezo

Combinatorics

A General Inequality for Walks in Graphs

Let $G$ be a graph and $w_k(G)$ denote the number of walks in $G$ of length $k$. For sequences $a_1, \cdots, a_n$ and $b_1, \cdots, b_n$ of non-negative integers such that $a_1 + \cdots + a_n = b_1 + \cdots + b_n$, we determine a simple necessary and sufficient condition on $a_1, \cdots, a_n, b_1, \cdots, b_n$ for the inequality \[ w_{a_1}(G) \cdots w_{a_n}(G) \geq w_{b_1}(G) \cdots w_{b_n}(G) \] to hold for any graph $G$.
Read the full abstract

Probability

$\beta$-Skewed Maximal Spanning Forests

The Free $\mathbf{w}$-Maximal Spanning Forest (FMaxSF) is a weighted generalization of the classical Free Minimal Spanning Forest (FMSF) that is able to detect nonhyperfiniteness in percolation on nonunimodular graphs. We introduce a parameterized family of invariant random spanning forests that interpolates between these models. For every finite positive value of the parameter $\beta$, the construction retains many of the desired properties of FMaxSF while also admitting the finite-subtree forcing property of FMSF. We study local limits of these forests and, in particular, show that the small-$\beta$ limit of the wired variant coincides with FMSF if and only if $p_h=p_u$, where $p_h$ is the threshold for the existence of heavy clusters and $p_u$ is the uniqueness threshold for Bernoulli$(p)$ percolation. Finally, we show that the Free and the Wired $\mathbf{w}$-Maximal Spanning Forests may coincide even if $p_h<p_u$, providing a negative answer to a question of Terlov and Timár.
Read the full abstract

Accelerator Physics

Coupling periodic-cell and finite-bunch dynamics for structured photocathodes

Patterning a photocathode with submicrometre features can enhance nonlinear photoemission by concentrating the optical field, but the surface geometry can also increase the transverse momentum spread of the emitted electrons. Resolving nanoscale surface fields across an injector-scale illuminated area within a full rf gun simulation is computationally demanding. To couple these scales, we developed an approach which combines a self-consistent finite flat-cathode calculation with the particle-resolved difference between matched structured and flat periodic calculations. The finite calculation determines the macroscopic bunch evolution and space-charge field. The periodic difference determines the local change caused by the surface. For a finite but relatively small test problem, comparison with a fully resolved finite-array WarpX calculation gives differences of 1.3% in rms energy spread and less than 0.1% in projected normalized emittance. We then apply the method to representative FEL photoinjector parameters with a 100 pC emitted source distributed over more than half a million periods, and track the composed bunch through an L-band rf gun and solenoid. The initial difference between the projected horizontal and vertical emittances becomes much smaller after rf acceleration and solenoid focusing. At 1.52 m downstream of the cathode, the projected emittances are nearly equal and exceed those of the matched flat-cathode reference by less than 2% in both planes. The central-slice emittances exceed the reference values by approximately 3% horizontally and 5% vertically.
Read the full abstract

Networking

From Open RAN to Open Spectrum: A Programmable, Intelligent Architecture for Multi-Service Spectrum Coexistence

Considering sharing or coexistence from the perspective of spectrum alone fails to recognize that any spectrum-enabled service also requires (i) radio and processing infrastructure and (ii) a protocol stack, including waveforms and signal processing pipelines. The efficiency of spectrum coexistence frameworks such as Citizen Broadband Radio Service (CBRS) is thus limited to optimizing resource allocation across a single dimension. How to address this limitation, however, remains an open challenge, especially considering the diversity of requirements and operational modes across spectrum services (e.g., sensing, communications, navigation, or positioning). This article introduces Open Spectrum, an architecture that brings softwarization, programmability, and open interfaces to heterogeneous spectrum services, extending the open Radio Access Network (RAN) principles beyond wireless networking. We propose to combine spectrum, services, and infrastructure in a common pool. Its resources are shared and orchestrated by a Spectrum Intelligent Controller (SIC), with plug-and-play spectrum applications, i.e., Spectrum Applications (sApps), and data-driven Radio-Frequency Interference (RFI) modeling using Digital Twins (DTs). We describe the Open Spectrum architecture, shared infrastructure pool, and operational workflows for tenant onboarding and incentives, conflict resolution, and service sharing across sensing, radionavigation, radiolocation, and cellular systems. System-level simulations using the BostonTwin urban DT and Sionna ray tracing show that there exist performance-driven incentives in sharing infrastructure and sharing across multiple services, enabling increased access to spectrum and improvement in median Signal to Interference plus Noise Ratio (SINR) of up to 12 dB.
Read the full abstract

All authors Michele Polese, Minh Dat Nguyen, Paolo Testolina, Tommaso Melodia

Machine Learning

Model-Aware Schedules Improve Generation via Fiberwise Optimal Transport

Diffusion and flow-matching schedules control the signal and noise coefficients that mix data and noise along affine probability paths. Minimizing a kinetic action defined on coefficient paths, motivated by optimal transport, helps explain strong baselines but remains model-agnostic and ignores prediction error. Here we introduce a model-aware schedule construction based on fiberwise optimal transport. At a fixed time and state on the probability path, compatible signal/noise decompositions form an affine fiber. We define a fiberwise prediction risk by averaging optimal-transport costs between the true and predictor-induced decompositions within these fibers. On a fixed coefficient curve, combining this risk with coefficient-path kinetic action yields a closed-form optimal time allocation. This construction extends to general linear prediction targets, and the risk profile can be estimated from an early baseline checkpoint. We evaluate DDPMs and flow matching across prediction targets, training configurations, risk-estimation checkpoints, datasets, and architectures. Our model-aware schedules consistently outperform strong baselines, including a 38.6% relative FID reduction for flow matching on CIFAR-10 at 16 function evaluations. Each model-agnostic kinetic baseline determines its own kinetic reference coordinate. In these coordinates, fiberwise-risk profiles from independently trained models in different settings align closely after normalization to unit area. The resulting schedule deformations used in training also align, suggesting empirical universality across the evaluated models and settings. Pretrained-checkpoint diagnostics extend this normalized-risk agreement to larger conditional latent diffusion and 2-RF models. A frozen analytic allocation template retains most of the model-aware improvement without further risk estimation or model-specific fitting.
Read the full abstract

All authors Luyi Jia, Boyan Zhang, Yilun Liu, Steffen Rulands

Cryptography and Security

Atlas: Efficient Verifiable Semantic Search

Semantic search is a core primitive of modern applications, powering recommender systems, web search, and retrieval-augmented generation for language models. The provider controls the index and query execution, leaving clients to trust that results come from the right algorithm over the intended index. A provider may truncate search to cut cost, bias results, or otherwise deviate from the specified execution undetected. Verifiability can remove this trust assumption by proving that results follow the agreed algorithm over a committed index. Realizing this efficiently is hard, as retrieval at scale relies on HNSW, a graph-based algorithm whose data-dependent traversal maps poorly onto the fixed constraint systems of zero-knowledge proofs. Prior verifiable systems therefore target regular, cluster-based indices that are easier to encode, sacrificing the recall of graph-based search. We present Atlas, a system that lets a provider prove a query was answered correctly against its committed index without revealing the index. At its core is a new zero-knowledge proof for HNSW search, built on three techniques: preprocessing that shifts all database-dependent cost offline, so per-query proving scales with the traversal rather than the database; a restructuring of HNSW into a fixed-size-state procedure that we prove returns the same result; and a timestep-tagged batching that merges the per-step arguments of the entire traversal into one. Atlas is the first to demonstrate verifiable graph-based search at scale, proving a query in under a second on the SIFT1M benchmark and in 2.0 seconds at 100 million vectors, while maintaining the recall of plaintext HNSW and revealing nothing about the index beyond the result. In a complete RAG pipeline, Atlas' proven retrieval preserves end-to-end answer quality, and reaches higher quality at lower proving cost than all prior verifiable retrieval systems.
Read the full abstract

All authors Nikolay Avramov, Hidde Lycklama, Alexander Viand, Anwar Hithnawi

High Energy Physics (Phenomenology)

Signatures of Invisible Fermions in $\Lambda_b^0 \to \Lambda_c^+ \ell^- \bar{X}_{\rm inv}$ Decays

We investigate the effects of a massive invisible fermion in $\Lambda_b^0 \to \Lambda_c^+ \ell^- \bar{X}_{\rm inv}$ decays using a model-independent weak effective theory. Through a comprehensive angular analysis, we show that a nonzero invisible-particle mass leaves characteristic imprints on angular observables that can distinguish massless and massive invisible states. We further demonstrate that these observables provide strong discrimination among vector/axial-vector, scalar/pseudoscalar, and tensor interactions, as well as between left- and right-handed quark and lepton current operators.
Read the full abstract