Peer Revenue Publish or profit

Papers

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

All of arXiv

Friday 4 September

Optimization and Control

Decomposition of Sparse Integer Programs via Nonlinear Edge Encodings and Column-and-Row Generation

A wide range of sparse integer programs admit a block structure in which subproblems interact through a small set of shared variables. Dualizing the linking equalities yields a decomposable Lagrangian relaxation, but generally introduces a duality gap. Recent work shows that this gap can be closed while preserving decomposability by dualizing exponentially large families of redundant nonlinear consistency constraints on the shared variables. We develop a computational framework for exploiting this idea without explicitly constructing the resulting exponentially large relaxation. Our framework combines nonlinear edge encodings of shared-variable consistency with a column-and-row generation (CRG) algorithm that generates local integer solutions by pricing and encoding constraints by separation. With complete encodings and exact separation, the framework recovers the exact relaxation while retaining independent optimization over the blocks. We introduce several encoding families and establish exponential separations among them: the Generalized family can require exponentially fewer constraints than the Vertex, Monomial, or Reflected families, yet can itself require exponentially many constraints on instances for which a single problem-specific encoding suffices. Computational experiments on decomposed stable-set and dominating-set instances show that CRG substantially outperforms a monolithic formulation across a range of tree topologies and coupling strengths. The results also show that richer encoding families need not perform better computationally, highlighting the choice of encoding as a central issue in effective decomposition.
Read the full abstract

Dynamical Systems

A sharp embedding theorem for topological dynamical systems

Let $(X,T)$ be a topological dynamical system, and let $\dim(X,T)$ denote Meyerovitch's dynamical dimension. We prove that, for every integer $n\geq1$, if $\dim(X,T)<n/2$, then the set of maps $f\in C(X,[0,1]^n)$ for which the orbit map $$ I_f: X\longrightarrow([0,1]^n)^{\mathbb{Z}}, \qquad I_f(x)=\bigl(f(T^k x)\bigr)_{k\in\mathbb{Z}}, $$ is a topological embedding is a dense $G_\delta$ set. Consequently, $(X,T)$ embeds into $(([0,1]^n)^{\mathbb{Z}},\sigma)$ for some integer $n\geq1$ if and only if $\dim(X,T)<\infty$. The constant $1/2$ and the strict inequality are optimal.
Read the full abstract

Artificial Intelligence

What LLM Trading Agents Actually Do in Production: A Six-Month, Population-Scale Record from Two Fleets

We present a continuous, population-scale measurement record of autonomous language-model trading agents operating in production across two systems with one design lineage: DX Terminal Pro (3,505 user-funded vaults trading real ETH in Base memecoin markets for 21 days, February to March 2026) and the DXAP live alpha fleet (500 to 599 user-created agents all-history, 91 to 117 concurrently active, trading Hyperliquid perpetuals, June to August 2026). The record spans roughly six months, 7.5M single-model invocations with about 300K onchain actions, and a further 231,638 multi-tool turns producing 14,596 fills. Four findings carry the paper. First, the operating layer determines behavior more than anything written in strategy text: a risk slider explains leverage (+0.425 per level), agent fixed effects absorb 60% of variance, and a leaderboard render boundary causally routes selection (regression discontinuity 1.75x at the top-3 cut). Second, sizing is volatility-blind: median leverage is 5.0x in every volatility sextile, and one posture-slider cell (11% of the book) holds 62% of liquidations. Third, agents capture almost none of the upside they reach: 43.2% of positions saw at least +300 bps of favorable excursion within 24h, yet 49.3% of those closed with a negative trade return; a mechanical bracket recovers +39.0 bps per position. Fourth, neither fleet shows a directional edge. The DXAP fleet is not profitable and trails a matched Hyperliquid retail benchmark (41% vs. 50% roundtrip win rate). A paired-replay league of frontier models on 416 captured production scenarios finds decision quality statistically indistinguishable at this horizon, while choice stability differs sharply across model families. Every headline survives day-clustered inference, permutation nulls, and a common-fee restatement; the paper closes with a 17-rule methodology canon bought with our own retractions.
Read the full abstract

All authors T.J. Barton, Chris Constantakis, Patti Hauseman, Annie Mous, Alaska Hoffman, Brian Bergeron, Hunter Goodreau

Computer Vision

Full-Page Optical Music Recognition of Handwritten Monophonic Scores

Full-page end-to-end Optical Music Recognition seeks to transcribe entire music pages directly into symbolic notation, avoiding the limitations of traditional pipelines that rely on accurate staff segmentation. Recent Transformer-based architectures have achieved strong performance on typeset scores, relying on large-scale synthetic data for pretraining. However, their applicability to handwritten music remains largely unexplored. In this work, we study full-page transcription on handwritten monophonic collections and analyze the impact of synthetic pretraining in this setting. To investigate which factors are most relevant during pretraining, we introduce a generator capable of producing visually coherent full-page scores in both typeset and handwritten styles. Experiments on three real handwritten datasets provide a comparative evaluation of several full-page pipelines and different synthetic pretraining strategies. The results suggest that the benefits of synthetic pretraining are primarily associated with learning structural layout conventions rather than with visual similarity to the target handwriting.
Read the full abstract

All authors Adrian Rosello, Antonio Ríos-Vila, David Rizo, Jorge Calvo-Zaragoza

Computer Vision

Srijika: OpenType-Layout-Reusing Font Restyling for Nine Indic Scripts

We present Srijika, a system for producing installable OpenType fonts for nine Brahmic scripts: Devanagari, Tamil, Bengali, Telugu, Kannada, Malayalam, Gujarati, Gurmukhi, and Odia. Rather than generating fonts from scratch, Srijika restyles glyph outlines from shaping-complete template fonts. It preserves the template's cmap and GSUB closure and its GPOS data under a documented metric policy, making every output a complete font by construction. This addresses a central challenge of Indic font generation: hundreds to thousands of conjuncts, half forms, and matra variants must remain mutually consistent under OpenType shaping. Srijika produces 66 TTFs: 57 curated presets and nine open-vocabulary showcase fonts. All pass the OpenType Sanitizer, while HarfBuzz and CoreText reproduce the template glyph-ID sequences on conjunct-heavy probes. A full-closure audit covering 80,915 glyphs and 54,812 anchors quantifies metric changes. Natural-language style selection uses Lipika, a retrieval index over approximately 650 open-license font families. A reference-conditioned latent diffusion model redraws template glyphs in the selected style, followed by content gating, harmonization, and shaped-cluster verification with fallback to template outlines. We evaluate against no-learning baselines. On diffusion-training-family-held-out SSIM gates, template copying outperforms generation on 50 of 56 faces. Style movement is measurable only with an internal same-model embedding whose training corpus includes the held-out families, so these results require caution. A learned baseline, independent style metric, and human study are outside this report's scope. Our contributions are the layout-reusing formulation and pipeline, its nine-script audit and benchmark, and a negative-results catalogue covering failed conditioning, objective choices, and data-hull limits of reference-guided restyling.
Read the full abstract

Cosmology and Nongalactic Astrophysics

Do DESI-DR2 BAO data imply a coupling of dark matter and dark energy?

We revisit an interacting dark matter (DM) – dark energy (DE) model characterized by the interaction function $Q = \Gamma \rho_x$, where $\Gamma$ is a constant coupling parameter and $\rho_x$ is the energy density of DE. This type of interaction is independent of the Hubble rate or other external parameters, but depends only on the fundamental properties of DE, such as its equation of state (EoS), $w_x$. We pay special attention to $w_x$ and study three distinct interacting scenarios distinguished by the nature of $w_x$, i.e. $w_x =-1$ (when DE corresponds to the vacuum energy), $w_{x} < -1$ (when DE has a phantom behavior), and $w_x > -1$ (quintessential DE). We constrain all of them using the most recent cosmological datasets, including CMB from Planck 2018, BAO from DESI DR2, and three compilations of SNIa (PantheonPlus, Union3, and DES-Dovekie). Our analyses reveal that evidence of interaction is supported in scenarios with $w_x =-1$ and $w_x < -1$ when all three datasets are combined, but from the Bayesian evidence analysis, $\Lambda$CDM remains favored over these interacting scenarios. Regarding the $S_8$ parameter, when $w_x > -1$, this interacting scenario leads to mildly lower estimates across all datasets.
Read the full abstract

All authors Weiqiang Yang, Sibo Zhang, Dinorah Barbosa, Marco Antonio Alvarez, Supriya Pan, Leila Graef

Quantum Physics

Robustness of Dynamical Casimir Effect-Induced Quantum Synchronization

The robustness of quantum synchronization induced by the dynamical Casimir effect (DCE) is analyzed within a circuit quantum electrodynamics (cQED) architecture consisting of two superconducting qubits coupled to a shared, parametrically driven cavity. Using a Lindblad master equation approach, this study evaluates the impact of various decoherence channels (including photon loss, relaxation, thermal excitation, and pure dephasing) on the resulting synchronization dynamics. The results demonstrate that DCE-induced synchronization persists under dissipation rates achievable in state-of-the-art superconducting platforms, confirming its experimental feasibility. Among the studied mechanisms, pure dephasing is identified as the dominant factor limiting the fidelity of the synchronized state. Furthermore, it is shown that in strongly dissipative regimes, the Pearson correlation coefficient may overestimate the degree of quantum synchronization, as environmental relaxation can generate classical correlations that mimic synchronized behavior. These findings establish the parameter regimes necessary for observing genuine DCE-induced quantum synchronization and provide practical guidelines for future cQED experiments.
Read the full abstract

Machine Learning

Robustness of LLM-Generated SystemVerilog Assertions to Semantics-Preserving RTL Transformations

Large language models (LLMs) are increasingly being explored for automating SystemVerilog Assertion (SVA) generation, yet most evaluations report correctness on a single syntactic representation of an input. Such point accuracy does not reveal whether a model's correct output is stable when the same RTL behavior is written differently. This paper presents a controlled metamorphic evaluation of LLM-based SVA generation under semantics-preserving RTL transformations. Starting from the VERT dataset, we construct a quality-filtered conditional-control pool and a stratified 40-program evaluation set containing 295 assignment behaviors. We evaluate two open code models, Qwen2.5-Coder-7B and DeepSeek-Coder-V2-Lite, with an identical evaluation prompt and greedy decoding. Three transformations are studied: operand reordering, deterministic identifier renaming, and redundant parenthesization. Beyond baseline and transformed accuracy, we measure conditional robustness, invariance failure, and any-flip rate, with 10,000-sample clustered bootstrap intervals at the RTL-program level. Across all six model-transformation conditions, 9.7%-27.0% of behaviors that were correct on the original RTL become incorrect after a semantics-preserving transformation. Aggregate accuracy can therefore hide substantial instability: under identifier renaming, DeepSeek-Coder-V2-Lite improves from 53.9% to 63.7% accuracy while 19.5% of its originally correct behaviors fail. Manual review of 30 sampled correct-to-wrong transitions identifies dropped path predicates, branch-polarity errors, Boolean-structure corruption, and output-contract violations. The results show that point accuracy alone is insufficient for characterizing LLM reliability in assertion generation and motivate robustness-aware evaluation for AI-assisted hardware verification.
Read the full abstract

Quantum Physics

Minimum Cardinalities of Multipartite Unextendible Product Bases

In quantum information theory, the state space of a multipartite quantum system is modeled by a tensor product. In the tensor-product space $\C^{d_1}\otimes\cdots\otimes\C^{d_p}$, a nonzero vector is a product state if it can be written as $\ket{\varphi_1}\otimes\cdots\otimes\ket{\varphi_p}$ with $\ket{\varphi_j}\in\C^{d_j}\setminus\{0\}$. An unextendible product basis (UPB) is a finite family of pairwise orthogonal product states such that no nonzero product state is orthogonal to all of them. UPBs play a key role in investigating quantum entanglement and nonlocal phenomena. Finding a smallest UPB is a natural extremal problem: it asks how few pairwise orthogonal product states suffice to prevent any further product state from being added. The general minimum-size problem for UPBs has been studied for over two decades since the seminal work of Alon and Lovász. Let $f_m(d_1,\ldots,d_p)$ be the minimum cardinality of a UPB in the space, and let \(f_{LB}(d_1,\ldots,d_p)=1+\sum_{j=1}^{p}(d_j-1)\) be the natural lower bound. Alon and Lovász determined exactly when \(f_m\) attains the lower bound \(f_{LB}\), but the obstructed multipartite cases remained open in general. We prove a stabilization theorem: for every non-all-qubit system with $p\ge3$, whenever the natural lower bound $f_{LB}$ is unattainable, the true minimum is exactly $f_{LB}+1$. Precisely, if the number of even local dimensions $d_i$ is positive and even, and at least one local dimension is greater than two, then \(f_m(d_1,\ldots,d_p)=f_{LB}(d_1,\ldots,d_p)+1\). The proof is built on a unified graph-theoretic framework. Our result, together with earlier work, settles the minimum size problem for UPBs in all finite quantum systems.
Read the full abstract

Fluid Dynamics

Direct Numerical Simulation of Thermoacoustically Unstable Flames Via Non-Drifting Acoustic Delay Characteristic Boundary Conditions

Thermoacoustic instability in premixed flames results from the coupling between the flame's heat release, as determined by combustion parameters, and surrounding acoustics, as determined by combustor geometry. A primary instability results in flame flattening as intrinsic flame instability modes are stabilised. Secondary thermoacoustic instability results in a parametric flame instability and drastic growth of acoustic amplitudes. Due to their relative expense, numerical simulations of these phenomena remain scarce. In this work, Direct Numerical Simulations (DNS) of thermoacoustically unstable idealised premixed flames in a tube with acoustically closed upstream and open downstream ends are presented. Results herein demonstrate nonlinear saturation of the primary instability as the flame flattens as well as an oscillating flame fingering characteristic of the unsteady Rayleigh-Taylor effect. To reduce computational cost, we perform DNS only on the region surrounding the flame. Acoustics at in- and outflows are described using the Navier-Stokes Characteristic Boundary Condition (NSCBC) method to model their delayed reentry into the domain in a formulation referred to as the Acoustic Delay Characteristic Boundary Condition (ADCBC) method. A new Averaged Proportional and Integral Linear Relaxation (APILR) method is also introduced, which modifies the Classic Linear Relaxation (CLR) method to maintain time-averaged values of inflow velocity and outflow pressure. Here, an integral control term is used to remove non-zero equilibrium time-averaged inflow velocities which impinge control over flame position. Both new methods demonstrate their capability in inert and counterflow flames test cases. These methods enable the numerical simulation of combustion instabilities at significantly reduced computational expense.
Read the full abstract

All authors Benjamin L. Cookman, Jack R. C. King, Raphaël C. Assier, Steven J. Lind

Algebraic Geometry

Tame polynomial automorphisms

The group of polynomial automorphisms of the affine n-space is an interesting large group. A slightly simpler group is its subgroup of tame automorphisms. Natural problems about these groups include the existence of normal subgroups, the classification of finite subgroups, the Tits alternative, and the possible dynamical degrees of their elements. One method to investigate these questions is via some actions on some metric spaces, namely the coset complex and the valuation complex, that we introduce in detail. This paper is a survey focusing on the following three cases: dimension 2, dimension 3, and dimension 4 for tame automomorphism preserving a nondegenerate quadratic form.
Read the full abstract

Statistical Methodology

Robust Community Detection for Noisy Networks with Covariates: Application to Functional Brain Networks

Community detection is fundamental to understanding the modular organization in functional brain networks, yet noise in neuroimaging-derived networks and auxiliary node-level covariates pose critical challenges. Existing methods typically either assume networks are noise-free or ignore covariate information. We propose a Bayesian framework for recovering a shared latent community structure from multiple noisy network realizations and auxiliary covariates. The model combines a degree-corrected stochastic block model for the latent network, a block-structured noise model linking noisy observations to latent edges, and a covariate cluster model for node-level attributes. This specification allows anatomical or functional attributes of regions of interest to contribute information when network signals are weak or sparse. We develop an efficient Markov chain Monte Carlo algorithm for posterior sampling and select the number of communities using the widely applicable information criterion, avoiding prior specification of this quantity. Simulation studies demonstrate improved community recovery relative to existing methods across varying noise levels, covariate signal strengths, and numbers of noisy networks, with larger gains when network noise is moderate to high or only a small number of noisy networks is available. Applications to functional brain networks from the Alzheimer's Disease Neuroimaging Initiative and the Human Connectome Project identify biologically interpretable structures and capture disease-related reorganization and individual-level variation.
Read the full abstract

All authors Zeyu Hu, Frederick H. Xu, Suprateek Kundu, Yize Zhao, Li Shen, Jun Yan, Wenrui Li

High Energy Physics (Theory)

Birth and Death in Two-color ABJM

We solve exactly the leading quantum deformation of the two-point metric of half-BPS operators in $U(2)\times U(2)$ ABJM theory at finite rank. In the natural coupling-independent Schur frame, its tree-normalized two-loop correction is a Jacobi operator on the chain of two-row Young diagrams. A ground-state transform maps it to a reversible birth–death process whose stationary distribution is the Plancherel measure conditioned on diagrams with at most two rows. Its eigenmodes are Racah polynomials, its large-$n$ limit approaches radial Ornstein–Uhlenbeck dynamics, and an equivalent two-spin description identifies the Jacobi operator with a restricted $SU(2)$ Casimir.
Read the full abstract

Number Theory

Lower bounds for some value sets over finite fields: incidence geometry and Bourgain's group expansion theorem

We develop two transition principles for lower-bounding value sets generated by structured sequences over prime fields. A reciprocal-affine family with $M$ internal transitions and bounded quotient multiplicity has image size $\gg \min{M,p}^{8/15}$. This recovers the factorial-residue bound and yields the same exponent for arithmetic Pochhammer products, Gaussian $q$-factorials, derangement numbers, and the numbers of ordered subsets. A second theorem treats nonzero sequences whose consecutive ratios evolve under a nondegenerate M"obius transformation: their value sets have size $\gg \min{M,p}^{1/2+\eta}$ for an absolute constant $\eta>0$. As consequences, fixed rows of Pascal's triangle and the initial half-blocks of the Catalan and central binomial sequences exceed the square-root scale. The proofs combine transition quotients with, respectively, Cartesian-product point-line incidence geometry and Bourgain's expansion-based incidence theorem in $\mathrm{SL}_2(\mathbb{F}_p)$.
Read the full abstract

Soft Condensed Matter

From agent-based dynamics to a kinetic theory of jellyfish swarms

Massive jellyfish swarms observed at sea can extend over tens of kilometres and contain millions of individuals, yet the mechanisms governing their formation and large-scale dynamics remain poorly understood. Agent-based models provide a framework for describing this dynamics based on jellyfish responses to ocean currents and environmental cues, but become computationally prohibitive when extended to large populations and spatial scales relevant to ocean circulation. Here we derive a continuous kinetic theory from an active-particle model of jellyfish motion. The resulting Fokker-Planck framework incorporates transport by prescribed currents, stochastic reorientation, direct interactions and stimulated steering, allowing chemical signalling to be represented through a coupled field. We further derive a hydrodynamic closure for large swarms by exploiting the separation between fast orientational and slow spatial dynamics, yielding a reduced density equation suitable for implementation in ocean-current models. This framework provides a route from individual behavioural mechanisms to continuum descriptions of jellyfish populations and establishes a basis for constraining model parameters using observations and in-situ measurements. This approach offers a theoretical foundation for future numerical prediction of large jellyfish swarm formation and evolution in realistic ocean flows.
Read the full abstract

All authors Nicolas Perez, Erik Gengel, Zafrir Kuplik, Eyal Heifetz

Machine Learning

Endogenous Exploration in Reinforcement Learning with Intrinsic Curiosity

We propose a reinforcement learning framework in which exploration is driven by intrinsic curiosity, designed for scenarios where environments are non-stationary and rewards are sparse, delayed, uninformative, or absent. In our model, action selection is guided by a combination of external rewards and an epistemic motivation mechanism that biases the agent toward structured exploratory directions. The central hypothesis is that effective exploration emerges at intermediate levels of incoherence, while performance degrades under both overly rigid and overly disordered dynamics. To test this idea, we implement the framework on top of a Liquid State Machine (LSM) substrate and evaluate it on two standard benchmarks: the discrete-action LunarLanderv2 and the continuous-control BipedalWalkerv3. The proposed method achieves competitive performance on both tasks relative to established deep RL algorithms, including Proximal Policy Optimization (PPO) and Intrinsic Curiosity Module (ICM). We further show that the curiosity window is not recovered in Active Inference agents under the same analysis, suggesting that the proposed dynamics capture a distinct exploration regime
Read the full abstract

Statistical Mechanics

Distribution of currents in a system of active particles with biased hops and Ising interactions

We consider an ensemble of particles performing a biased random walk on a two-dimensional lattice. Due to the adhesion between particles (nearest-neighbor Ising interactions), the probability of hopping depends on the number of neighbors and the strength of adhesive interaction. The asymmetry in the hopping directions leads to a macroscopic current of particles through the system. We theoretically compute the distribution of currents and verify the results in stochastic particle simulations. To make theoretical progress, one has to determine the probabilities of various particle configurations such as single particles, pairs, and different configurations of three-particle clusters. These probabilities are theoretically derived by formulating rate equations for the concentrations of various structures resembling Becker-Döring cluster equations. One intriguing finding is that the concentration of left-handed triplets is not equal to the concentration of right-handed triplets for non-zero asymmetry of hops and non-zero interaction between particles.
Read the full abstract

Symbolic Computation

Maximal rank of $4\times 4\times 4$ and $k\times 4\times 3$ tensors over $\mathbb{F}_2$

We determine the maximum rank of $4\times 4\times 4$ and $k\times 4\times 3$ multidimensional arrays over the finite field $\mathbb{F}_2$. These results are made possible by a new method of enumerating non-isomorphic tensors.

Rings and Algebras

Extremal Rota-Baxter operators on matrix algebras

We classify all Rota-Baxter operators of weight $\lambda$ on $M_n(F)$ over a field $F$ of characteristic zero whose minimal polynomial has maximal degree and show that in both cases $\lambda = 0$ and $\lambda \neq 0$ such an operator is conjugate to exactly one operator.

Mesoscale and Nanoscale Physics

Gauge-covariant magnetic Bloch sums for general multiorbital Hofstadter models

We formulate a unified treatment of the Hofstadter problem for general two-dimensional multiorbital Peierls tight-binding Hamiltonians using a gauge-covariant magnetic Bloch-sum basis. The construction retains the full Bravais geometry, arbitrary intracell orbital positions, and the original hopping table, so lattice geometry, orbital embedding, hopping range, and orbital content can all be handled within the same framework. At rational flux $\Phi/\Phi_0=p/q$, commuting magnetic translations reduce the Peierls Hamiltonian to minimal $qN_{\rm orb}\times qN_{\rm orb}$ blocks. Their dimension depends only on the flux through the primitive cell, even when the fractional orbital coordinates are irrational. Electromagnetic gauge transformations act by unitary conjugation within the construction and do not alter the required magnetic supercell. We derive an explicit sparse matrix in an oblique Landau gauge and establish the associated band counting, spectral redundancy, Chern-number formulation, magnetic spatial constraints, and flux periodicity. Numerical examples include elementary lattices, topological and flat-band models, and a spinful 22-band Wannier Hamiltonian of monolayer $\mathrm{MoS}_2$, demonstrating a direct interface with first-principles electronic-structure calculations. As a complementary representation, we also derive exact generalized Harper equations from the same hopping data and relate them to the finite magnetic-Bloch blocks.
Read the full abstract

All authors Hao Shi, Tianyu Qiao, Wangqian Miao, Jin-Tao Jin, Quansheng Wu, Xi Dai

Quantum Physics

Ordered-Angle Coding for Exact Multiuser Unanimity Testing

We introduce ordered-angle coding for binary-unanimity testing among $n$ transformation-only users in a serial quantum architecture inherited from Loop-Back communication. User $B_i$ fixes one private sign across a logical word and applies $R(s_i\alpha_j)$ in trial $j$. If $w$ users choose the negative sign, serial composition gives $R[(n-2w)\alpha_j]$. We show that every fixed same-axis pulse that is deterministic for both unanimous inputs under the binary Bell readout has $\alpha_j=q_j\pi/(2n)$ with integer $q_j$. For a nonadaptive word $\mathbf q=(q_1,\ldots,q_m)$, a mixed Hamming weight imitates the unanimous signature with probability \[ M_{\mathbf q}(w)=\prod_{j=1}^{m}\cos^2\!\left(\frac{\pi q_jw}{n}\right). \] Within this complete deterministic-unanimity pulse family, a finite perfect word exists if and only if $n$ is a power of two. For $n=2^r$, the dyadic word $(1,2,4,\ldots,2^{r-1})$ is exact and pulse-minimal with $m_{\min}=r=\log_2n$ trials. It replaces the $O(n^2\log(1/\varepsilon))$ worst-case burden of repeated smallest-angle tests by exact $O(\log n)$ verification. Odd primes instead admit balanced statistical words with uniform mixed-weight imitation $2^{-(p-1)}$. For actual operations $R(s_i\alpha_j+\delta_{ij})$, an ideal rejecting position is lifted to $\sin^2\Delta_j$, where $\Delta_j=\sum_i\delta_{ij}$. This yields explicit robustness bounds with angular and binary-readout errors. Bell entanglement is not required for the additive algebra, but it keeps the traveler locally maximally mixed in every honest trial. We therefore present the result as a coded multiuser relation primitive with optional raw conference-key-candidate use, not as a composably secure conference-key protocol.
Read the full abstract

Quantum Physics

$N$-dimensional discrete Fourier transform via bosonic Hamiltonian

The discrete Fourier transform (DFT) underpins many classical algorithms and is a fundamental unitary operator for quantum information processing. Implementing the $N$-dimensional DFT in photonic integrated circuits (PICs) is limited by the cascades of Mach-Zehnder interferometers that current architectures require. Here we propose bosonic Hamiltonians that realize the $N$-dimensional DFT through a single stage of multimode evolution, complemented only by phase shifters before and after the interaction region, in a geometry suited to 3D waveguides. Modeling the system as a graph, where edges correspond to couplings and the vertices are the waveguides, we obtain analytical solutions for complete graphs up to $N=6$ and numerical solutions up to $N=31$. For non-complete graphs, different propagation constants are required in the Hamiltonian. We report all solutions for $N\leq 8$, partial exploration for $N=9$, and selected cases for $N=10$, together with three conjectures that guide the numerical search for $N \geq 11$. These configurations circumvent the vanishing evanescent coupling strength imposed by the waveguide separation, and a closed-form sensitivity criterion selects those that are admissible as a waveguide layout and least sensitive to fabrication error. We also uncover the missing non-affine parameters of the $6$-dimensional DFT, and show that the scaling law for implementing the $N$-dimensional DFT with our building blocks is $\mathcal{O}(N\log\log{N})$. This allows assembling the $2520$-dimensional DFT with only $2625$ interferometers, in contrast to the $\approx 3\times 10^6$ of Reck and Clements architectures.
Read the full abstract

All authors Edgar Barriga, Camila Muñoz, Alejandro Muñoz, Santiago Rojas-Rojas, Pablo Solano, Carla Hermann-Avigliano, Aldo Delgado

Artificial Intelligence

The convergent laboratory: when AI reasoning, autonomous experiments, high performance and quantum computing reshape chemistry

This Comment emerges from TPC26 (https://tpc26.org), a conference convening leaders from academia, national laboratories, and industry who are reshaping materials science discovery. The meeting explored how AI, autonomous agents, self-driving labs, higher performance and quantum computing converge to amplify their individual impact on materials science discovery. The perspectives here reflect the firsthand experiences of researchers at these frontiers and capture the essence of this global endeavor. As AI-driven reasoning, autonomous agentic frameworks, self-driving laboratories, and fault-tolerant quantum processors mature simultaneously, we offer this Comment as a reference at what we believe is a tipping point of transformative advances and productive disruption in the chemical sciences.
Read the full abstract

All authors Eliu Huerta, Xiaoyun Wang, Geetika Gupta, Edward H. Sargent, Cameron J. Owen, Victor Fung, Abhishek Mitra, Austin Cheng, Emma Bouchard, Shams Mehdi

Signal Processing

Joint Average Contiguous Duration of Correlated Fading Envelopes

Average contiguous duration (ACD) measures the mean time for which a fading envelope remains continuously inside a bounded amplitude interval. This letter extends the concept to two correlated observations by introducing joint average contiguous duration (JACD) and joint average fade duration (JAFD). Both metrics are expressed as joint-region occupancy probabilities divided by the corresponding inward boundarycrossing rates. For correlated Rayleigh fading, closed-form JACD and JAFD expressions are derived using the bivariate Rayleigh cumulative distribution function (CDF), Rayleigh level-crossing rates, and conditional Rician probabilities. As an application, reciprocal secret-key generation (SKG) is considered through JACD-based multilevel quantization and raw key generation rate (KGR) expressions. Numerical results show that JACD-balanced quantization improves the worst-bin joint duration, same-bin occupancy, and sample-wise raw KGR compared with marginalACD balancing.
Read the full abstract

All authors Muhammad Adil, Syed Junaid Nawaz, Ernestina Cianca, Wali Ullah Khan, Salman A. AlQahtani

Information Theory

A Nuclear-Norm Lower Bound for Dithered Scalar Quantization of Matrix Products

We consider the problem of minimizing error in quantized matrix multiplication $C=AB$. Scalar quantization of the factors introduces rounding errors whose scale depends on the maximum absolute entries – the ranges – of their rows and columns. These ranges determine the quantization grid steps. To reduce the error, we optimize over product-preserving transformations that alter the factor ranges and grid steps without changing $C$. Specifically, we seek the smallest leading expected squared error over invertible inner changes of basis and orthogonal outer rotations. Under independent, zero-mean subtractive dither noise on an unbounded lattice, we prove the output-only bound $E_{\rm lead} \ge (c_A+c_B)/K \Vert AB\Vert_*^2$, where $K$ is the inner dimension, $c_A$ and $c_B$ are normalized noise variances, and $\Vert AB\Vert_*$ is the nuclear norm. The bound is tight: an SVD-aligned Hadamard construction attains the infimum whenever a Hadamard matrix of order $K$ exists, including every power of two, while an SVD-aligned DCT construction is within a factor of two for every $K$. Without outer rotations, Gram-matrix balancing minimizes factorization energy, and finite-set flattening achieves the bound within $C\log(K(m+n))$. For power-of-two $K$, conditional expectations deterministically select the Hadamard signs in $O((m+n)K^2)$ exact-real operations. Synthetic experiments verify both constructions and illustrate the tradeoff between regularization and conditioning. These results characterize the full-gauge optimum and quantify the cost of preserving row and column indices.
Read the full abstract

All authors Piyush Sao, Narasinga Miniskar, Pedro Valero-Lara, Keita Teranishi, Sudip Seal

Nuclear Experiment

Measurement of the $^{99}$Tc $\beta$ spectrum with Silicon Drift Detectors

The need for reliable calculations of Nuclear Matrix Elements is compelling for the next generation of neutrinoless double-beta decay experiments. This requires nuclear models to be validated against experimental data, such as non-unique forbidden $\beta$ decays, which have been found sensitive to details in nuclear calculations, most importantly to the renormalization of the axial and vector currents. %, parametrized as a quenching of $g_A$ and $g_V$. We report here a measurement of the 2$^{nd}$ forbidden $^{99}$Tc $\beta$ spectrum performed for the first time with Silicon Drift Detectors, state-of-the-art semiconductor detectors for low-energy spectroscopy. We designed a novel hybrid spectrometer using a LYSO crystal read by a SiPM to precisely calibrate our main detector and to accurately measure the background. We then compared our measured spectrum with one obtained using cryogenic calorimeters, as well as with predictions from the Realistic Shell Model. Starting from Realistic Shell Model calculations performed with Bare decay operators, we carried out a Bayesian analysis to extract the average quenching factors required to reproduce both the measured spectral shape and the experimental half-life, obtaining $q_{g_A}=0.40(1)$ and $q_{g_V}=0.47(1)$. These values quantify the average renormalization of the axial and vector currents, respectively, and were compared with those predicted by RSM calculations employing Effective decay operators, thereby providing a benchmark for assessing the ability of the model to describe the second-forbidden $\beta$ decay of $^{99}\mathrm{Tc}$. More broadly, this comparison tests the reliability of the theoretical framework also used to predict $0\nu\beta\beta$ nuclear matrix elements.
Read the full abstract

All authors Andrea Nava, Andrea Del Contrasto, Leonardo Bernardini, Matteo Biassoni, Tommaso Bradanini, Chiara Brofferio, Marco Carminati, Silvia Capelli, Francesco Cappuzzello, Manuela Cavallaro, Massimiliano Clemenza, Giovanni De Gregorio, Giulio Gagliardi, Giorgio Grosso, Nunzio Itaco, Irene Nutini, Alessia Pozzi, Nicola Zorzi

General Relativity and Quantum Cosmology

Effective Field Theory of Gravity in Relativistic Media

We develop an effective field theory of gravity in relativistic media. Integrating out the medium leaves vacuum gravity with updated Feynman rules: a graviton propagator dressed by the stress-energy two-point function of the environment, medium-induced bulk graviton vertices from higher correlators, and generalized worldline couplings encoded in matched Wilson coefficients. The diagram topologies are unchanged from vacuum, so different media (perfect fluids, collisionless matter, coherent scalar fields such as wave dark matter) are not different theories but different correlators inserted into the same diagrams. We derive the in-medium rules for a relativistic fluid and obtain the full 1PN Einstein-Infeld-Hoffmann potential, the 1PN Stokes drag, the gravitational self-energy and a generalized Christodoulou memory whose new tensor structure records the orientation of the medium's anisotropy, turning the permanent strain into an $\textit{astrophysical weathervane}$. The same rules activate phenomena forbidden in vacuum: the sound pole converts the symmetry-protected, non-running black-hole Love number into a resonant, running one, and graviton splitting $h\to hh$ is open into the longitudinal branch of the dressed propagator, and gives the transverse graviton a width, $\Gamma=G_N\omega^3(1-c_s^2)^2/120c_s^3$, a $\textit{gravitational opacity}$ set by the sound speed. The same vertex makes a graviton suffer dynamical friction. We assess observational prospects, from dephasing and tidal resonances within reach of the Einstein Telescope and LISA to proof-of-principle memory and opacity signatures.
Read the full abstract

Computer Vision

Facial Age Estimation for Age Fraud Detection in National ID Systems

Identity fraud during biometric enrollment and updates remains a major challenge for large-scale national identity systems. A common fraud vector is misrepresenting one's age to access age-restricted services or welfare schemes. In this work, we present SwinAge, a facial age estimation system designed for use within the Aadhaar biometric enrollment pipeline, to assist quality-check (QC) operators to flag potential age-related fraud. This is critical for a system like Aadhaar (the world's largest national identity programme), that holds about 1.5 billion unique identities, with 22.4 million new enrollments and 283 million updates in the last year. Building upon the SwinFace architecture with landmark-based similarity (warp affine) alignment, we train on a large in-house dataset of 1.45 million face images and evaluate on an independent, age-stratified test set of 283K images, both drawn from an ethnically diverse population of 716K unique subjects. We investigate three Aadhaar-specific operational thresholds (5, 18, and 60 years) and propose a deployment triage framework that flags suspected cases for manual review. Following NIST FATE, we report false acceptance/rejection rates (FAR/FRR) at each threshold rather than aggregate accuracy: at 1% FAR the model achieves an FRR of 3% (<5yrs), 0.4% (>18yrs) and 11.0% (>60yrs). SwinAge achieves a mean absolute error (MAE) of 2.94 years on the same test set, outperforming three zero-shot vision language models on all benchmarks, and improving the state-of-the-art on 5 out of 7 public benchmark datasets. We further report per-gender errors and distill lessons for national identity programs.
Read the full abstract

All authors Sharib Athar, Arka Koner, Chetan Naik, Barada P. Sabut, Tanusree Deb Barma, Anoop M. Namboodiri, Anil K. Jain

Computation and Language

Better Together: Complementary Query Rewriting Under a Strong RAG Baseline

A popular way to improve Retrieval-Augmented Generation (RAG) is to rewrite the user's question into several variants and search with all of them. We test whether this actually helps once the underlying search is already strong. Under one fixed, competitive pipeline (BGE dense retrieval, cross-encoder reranking, and MMR diversification), we compare four query-rewriting strategies (S1-S4) against two strong LLM baselines (HyDE, Query2Doc) on three datasets (HotpotQA, AmbigNQ, and the 512K-document EnterpriseRAG-Bench) over three seeds with paired-bootstrap significance tests. Our headline result is that rewriting alone is at best competitive with a strong baseline, but combining methods yields outsized gains because different strategies fail on different questions. A post-hoc union of four methods (S1+S3+S4+HyDE) improves HIT@10 over the baseline by +12.5 points on enterprise data (51.70 vs 39.22), and a five-method union reaches 52.98 (+13.8). Budget-matched controls capture only ~40% of this gain, confirming that complementarity, not retrieval budget, is the primary driver. On HotpotQA the union adds +1.6 to +1.8 points (p<0.001), saturating the all-method oracle; on AmbigNQ the same fusion hurts (-2.4 below the best solo, p<0.001), and we analyze when and why. Because rewriting is expensive, we evaluate in simulation a confidence-gated router that runs rewriting only when the baseline's own top-1 score is low. It captures about half of the enterprise full-merge gain (+4.3 HIT@10) while paying rewriting cost on <40% of queries, and automatically declines to rewrite on AmbigNQ. A downstream answer-quality evaluation confirms the router improves F1 by +1.92 (p<0.01) at roughly 40% of the expansion cost. In short: treat query rewriting as a complementary coverage source, applied through cost-aware routing, not as a standalone replacement for a strong baseline.
Read the full abstract

All authors Sara Shanian, Xiaoqin Yi, Pavlo Ruban, Kurt MacDonald

Computer Vision

Unsupervised Transfer Clustering for Mitigating Cold Start in Active Prompt Learning

Vision-Language Models (VLMs) are able to achieve impressive zero-shot classification performance by aligning visual and textual representations, but each new task still demands handcrafted prompts. Active Prompt Learning (APL) combines Active Learning (AL) and Prompt Learning (PL) into a single framework, allowing for the usage of the VLM prior knowledge for iteratively querying the most informative images to be labeled. However, the cold-start problem is still relevant for APL methods, where the performance of the initial query can be worse than random sampling. While recent state-of-the-art APL methods mitigate with balanced sampling and multimodal features, they rely on rigid, distance-based clustering to group these features. This simplistic approach can struggle to capture the complex, high-dimensional semantic distributions inherent to VLMs, leading to suboptimal query representativeness. Unsupervised transfer can be applied to these features as a possible alternative, since it is capable of inferring the underlying human labeling of a task without any form of supervision. This way, samples can be grouped in semantically coherent clusters. This paper proposes Unsupervised Transfer Clustering with Selective Querying (UTC+SQ), a framework that enhances a recent APL approach by leveraging state-of-the-art unsupervised transfer model. These models generate high-fidelity pseudo-labels that establish semantically meaningful clusters, allowing for the selection of more relevant samples. Experimental evaluations demonstrate that shifting from distance-based to projection-based clustering improves the representativeness of the queried subset, achieving accuracy gains in 6 of the 8 datasets tested.
Read the full abstract