Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Tuesday 1 September

Quantum Gases

Non-Additivity of Microwave-Shielded Interactions between Dipolar Molecules

Theoretical models of the effective interactions between microwave-shielded polar molecules typically rely on the assumption of pairwise additivity. In this work, we test the validity of this pairwise approximation by evaluating the exact many-body potential energy for configurations of three and four molecules. We demonstrate that this approximation fails for molecule configurations in the plane of the circularly polarized microwave field. In these planar geometries, many-body effects significantly increase the depth of the attractive potential well and shift the position of the repulsive barrier. Although out-of-plane interactions in three-dimensional arrangements weaken this non-additivity, the effective interactions between microwave-shielded dipoles are not a simple sum of pair interactions. In particular, their attractive well, crucial for self-bound clusters, can only be described by the full many-body potential energy.
Read the full abstract

Cryptography and Security

Bonded Recourse for Smart-Contract Settlement of Compensable Agent Side Effects

Autonomous agent runtimes execute tool actions that mutate databases, repositories, and cloud services across organizational boundaries. Authorization and local compensation cover pre-action admission and in-runtime rollback, but neither settles the residual harm left after a permitted action fails. We design Recourse, a smart-contract settlement protocol for compensable agent side effects that binds each admitted action to scope, recovery, evidence, payout, and collateral. Recourse separates ex ante eligibility from ex post objective settleability: typed receipts make objective residual claims computable under an optimistic-oracle challenge pattern, while subjective or incomplete claims route to ERC-792 arbitration or exclusion. We implement the contract suite, deploy it on Base Sepolia, build adapters against Postgres, Git, and cloud-compatible local sandboxes, and evaluate the system on a deterministic harness, sandbox traces, adversarial sweeps, and property-based fuzzing. Against authorization-only and local-compensation baselines, bonded coverage cuts uncompensated harm. The on-chain tier supplies neutral custody, public challenge, non-cooperative payout, and portable history under cross-organizational trust assumptions.
Read the full abstract

Robotics

One Demonstration, Many Objects: Generalizing Manipulation via Local Contact Geometry

Dexterous manipulation with multi-fingered robot hands promises human-level dexterity, but collecting large-scale dexterous robot hand data remains difficult. Learning from human demonstrations has emerged as a scalable alternative to robot teleoperation, providing strong priors on object interaction and contact strategies. Recent sim-to-real RL methods incorporate such priors, but often (i) omit rewards that explicitly incentivize precise contact, yielding weak real-world performance, and/or (ii) generalize poorly to unseen object instances. We propose DemoMimic (Dexterous Motion Mimic), a policy that manipulates objects by focusing on their geometry local to the contact points. Its contact-centric rewards encourage precise contact and improve sim-to-real consistency, yielding a single real-world policy that transfers across objects of varying shape, scale, mass, and friction wherever local contact structure is preserved. Real-world ablations show that DemoMimic achieves 71% success across 16 objects, four tasks, and two robot-hand embodiments, with the smallest sim-to-real drop compared to baselines.
Read the full abstract

All authors Satvik Sharma, Samrat Sahoo, Huang Huang, Fei-Fei Li, Jiajun Wu, Dorsa Sadigh, Jeannette Bohg

Statistical Computation

nethist: An R package for Nonparametric Graphon Estimation via Network Histograms

Understanding the generative mechanism of real-world networks is crucial for analyzing connection patterns and making inference from network data. Graphons are widely used to model such mechanisms. Network histogram methods are nonparametric approaches based on blockmodel approximations that provide an intuitive view of network connection structures. However, there is a lack of software packages that construct network histograms. We introduce the R package nethist, which implements network histogram-type graphon estimators within a unified interface. This package is applicable to both single-layer and multilayer networks, and includes graphical summaries for examining both local and global network structures. By providing comprehensive network analysis tools, nethist facilitates understanding of complex systems of interrelated vertices.
Read the full abstract

Computation and Language

Sparse Readout Prism: Explaining Logit-Lens Scores in Features Instead of Tokens

A language model's prediction of its next token develops across layers, and lens methods track this process by decoding intermediate hidden states into tokens. But a lens reading reflects both the hidden state and the readout (the unembedding matrix) used to decode it. Many lenses are fit on a corpus, and we show that two lenses differing only in their fitting corpus can report different tokens for the same hidden states. We call this dependence corpus conditionality. To examine readout structure independently of the fitting corpus, we introduce Sparse Readout Prism (SRP), which decomposes the readout using only its weights and expresses any token logit or logit difference as a sum of contributions from sparse readout features. This reveals readout features as a new unit of analysis for lens readings, exposing structure that token identities can obscure and enabling comparisons across tokens, contexts, layers, and lenses. Replacing the original readout with SRP's sparse approximation reconstructs 8.9-17.3 percentage points more of the tested logit differences than the strongest of six baselines built on geometric relations among readout rows. Ablating features shifts logit differences in proportion to their SRP contributions. Although token readings vary with the fitting corpus, the dominant readout feature remains stable. Because SRP uses no corpus in its construction, it provides a control independent of the fitting corpus for lens analyses.
Read the full abstract

All authors Matteo He, William F. Shen, Xinchi Qiu, Nicholas D. Lane

Superconductivity

Interaction effects on Andreev states from an electromagnetic environment

Here we present a detailed theoretical investigation of the environment-induced interaction correction to the ground states and addition energies in a short superconducting junction. We derive general formulas for these corrections linking them to the frequency-dependent admittance of the junction and the environment impedance. We specify two environmental models: that of an external impedance and the Mattis-Bardeen model. In both cases we assume $G_Q Z \ll 1$, where $G_Q$ is the conductance quantum and $Z$ the typical environmental resistance. While an expectation is that the typical scale of the relative correction is of the order $G_Q Z$, we have found that in many cases the dimensionless scale $L G_Q \Delta$ provides a better estimation, where $\Delta$ is the superconducting energy gap and $L$ an external inductance. We discuss the logarithmic renormalizations of the energies by low- and high-frequency phase fluctuations and single out a non-superconducting contribution related to the renormalization of transmission eigenvalues. We investigate in detail the peculiarities of the corrections at: i. small phases, where the interaction causes a current jump, ii. Andreev bound state energies close to the gap edge, iii. Andreev bound state energies close to Fermi level. In all these cases the correction may become comparable with the unperturbed energy, even for $G_Q Z \ll 1$, and we briefly sketch non-perturbative models relevant for the situations.
Read the full abstract

Mathematical Physics

On the Convergence of Metadynamics with Gaussian Hills

Metadynamics is a class of enhanced-sampling methods that is widely used in molecular modeling. Here, we consider metadynamics with a one-dimensional collective variable and explore the limitations of using Gaussian hills in light of existing convergence results. We reduce the corresponding evolution problem to a replicator-type differential equation and analyze its long-time behavior. For a periodic collective variable, we prove the convergence of metadynamics. However, the situation is fundamentally different when the collective variable is defined on a finite interval. In this case, the stationary solution only exists in the weak sense as a finite atomic measure. The solution to the differential equation weakly converges to it. Consequently, metadynamics is ineffective due to the absence of a clear quasi-stationary state. A quasi-stationary, transient solution can only be captured in the "INTERVAL" framework if the free energy outside the finite interval remains nearly constant across sufficiently large regions compared to $\sigma$.
Read the full abstract

Machine Learning

OR-Transformer: Scaling Real-Time Decision-Making to 1,000 Items

Modern supply chain operations can require coordinating replenishment across thousands of heterogeneous items under correlated stochastic demand, heterogeneous lead times, and shared fixed ordering costs, yielding observation spaces exceeding $10^4$ dimensions. At this scale, rolling-horizon stochastic mixed-integer linear programs (MILPs) become prohibitively slow, while standard reinforcement learning (RL) methods face increasingly challenging credit assignment in high-dimensional action spaces. We introduce OR-Transformer, a deep reinforcement learning framework for joint replenishment under stochastic demand, with an item-permutation-equivariant Transformer architecture and pathwise-gradient training through the inventory dynamics. Across problem sizes up to 1,024 inventory items, OR-Transformer increasingly outperforms learning-based and rolling-horizon MILP baselines as scale grows. It also reduces online decision-making time by over 4 million times relative to MILP solvers, enabling real-time, large-scale deep RL in supply chain operations.
Read the full abstract

All authors Shuze Daniel Liu, David Simchi-Levi, Claire Chen, Chutong Gao, Shangtong Zhang

Algebraic Geometry

Essential Dimension and Faithful Rank of Finite p-Gerbes

Let $p\neq\operatorname{char}(k)$. We extend the Karpenko–Merkurjev theorem from classifying stacks of finite $p$-groups to arbitrary finite gerbes whose geometric inertia groups are $p$-groups, without assuming that the gerbe is neutral or that its band is represented by a group scheme over the base field. We prove that the essential dimension at $p$ is exactly the minimum faithful rank obtained after prime-to-$p$ base change, equivalently the faithful rank over a $p$-closure. We also prove a relative form of the theorem for locally full morphisms of finite $p$-gerbes: the relative faithful rank equals the supremum of the essential $p$-dimensions of the fibers. Finally, we introduce the quotient compression dimension, defined using tame quotient singularities with prescribed fundamental gerbe. For every finite $p$-gerbe $\mathcal{G}/k$ we show that its prime local version satisfies $$ \mathrm{ed}_k(\mathcal{G};p) \leq \operatorname{qcdim}_p(\mathcal{G}) \leq \mathrm{ed}_k(\mathcal{G};p)+1. $$ Thus essential dimension at $p$ determines, up to at most one dimension, the smallest quotient singularity realizing the gerbe after prime-to-$p$ localization.
Read the full abstract

Cryptography and Security

Agent Flight Recorder: Tamper-Evident Audit Trails with On-Chain Anchoring for Long-Horizon Tool-Using Agents

Long-horizon agents execute thousands of actions, resulting in sequential failures rather than isolated errors. When a coding agent deletes a production database or a prompt injection spreads across agents, the incident raises questions of causality, authority, and non-repudiable third-party verification. The Agent Flight Recorder captures each agent action as a structured, canonically serialized event binding eight semantic fields from intent through execution to provenance. Hash chaining and Merkle batching provide tamper evidence and compact inclusion proofs. For cross-organizational disputes where no party's infrastructure qualifies as neutral ground, periodic on-chain anchoring of epoch roots lets any verifier with the disclosed payload and Merkle proof check the record independently, without pre-agreeing on a trusted intermediary. The on-chain footprint is minimal: each anchor stores a 32-byte epoch root and a back-pointer, and no event content touches the chain. We evaluate the system across five cumulative ablation configurations on synthetic agent workloads. The full system adds ~48 microseconds median per-event latency and 512 bytes per event. L2 anchoring costs $2.30 per 100K events at 100-event epochs. The full integrity stack detects edit, delete, reorder, and fork tampering at 100% with zero false positives. Structured forensic queries achieve 1.0 precision on guardrail and delegation lookups where unstructured text search yields 0.013 and 0.077 respectively.
Read the full abstract

Systems and Control

Quantum-Based k-Coverage Optimization for UAV-Aided Search and Rescue Missions

In large-scale disaster scenarios, rapid localization of missing persons is a critical challenge for search-and-rescue (SAR) operations. Unmanned aerial vehicles (UAVs) equipped with radio frequency (RF) receivers can support RF-based localization by collecting signals emitted from mobile devices at spatially distributed sensing locations. This paper addresses the resulting waypoint-selection problem: determining a minimum set of UAV waypoints that provides at least threefold coverage of every potential target location. We formulate this task as an extended k-coverage problem that independently defines the UAV-navigable and target regions, and derive an exact-penalty quadratic unconstrained binary optimization (QUBO) formulation with a sufficient penalty condition that preserves feasibility and minimum waypoint cardinality. The QUBO is mapped to an Ising-form cost Hamiltonian and evaluated using the quantum approximate optimization algorithm (QAOA) on both a noise-free simulator and IBM's 127-qubit Eagle processor. On the tested simulator instances, QAOA recovers the known minimum-cardinality solutions. Across the rectangular hardware test cases, the mean 3-coverage ratio exceeded 95%. In the campus-scale evaluation, ten hardware executions achieved 99.3% mean 3-coverage with a 90% feasible-run rate, while the shortest feasible flight path was up to 37.0% shorter than those of the deterministic grid-based baselines. Additional comparisons with classical optimization and learning-based baselines are provided, together with computational and quantum-resource analyses for larger generated instances. These results establish an exact QUBO representation for RF-based SAR waypoint selection and characterize its implementation on current gate-based quantum hardware.
Read the full abstract

All authors Halim Lee, Suhui Jeong, Na Young Kim, Jiwon Seo

Computational Engineering

Risk-Sensitive Reward Composition for Conditional GFlowNets

Generative Flow Networks (GFlowNets) for structure-based drug design condition on one rigid protein structure. A flexible target holds several distinct structural shapes, its conformations, each occupied for a fraction of the simulation time. Scoring a candidate against all of them raises an open question: how do K scores become one reward? The designer cannot choose arbitrarily. Populations carry simulation error, and biology dictates which conformations are deal-breakers, so a candidate that fails one is disqualified, not merely ranked lower. No standard rule captures this. We compose the reward from a conditional value-at-risk (CVaR), a worst-case score rule, and an ambiguity radius expressing distrust in the stated weights. Together, these define a family of targets, amortised by a single conditional GFlowNet. We answer whether such a sampler can be trained on fully enumerable synthetic worlds, where every error is exact rather than estimated. Pricing the tail rather than averaging moves 2-10 times more mass to candidates that pass every conformation. One network covers the family to within 0.37-2.7x the error of a perfect sampler. An exact-KL oracle, a copy trained on the true target, shows if a shortfall is the optimiser's or the architecture's. When good candidates are rare, exploration decides: injecting unseen states finds 0.987-1.000 of good regions, while reweighting visited finds 0.35-0.76.
Read the full abstract

Computer Vision

Learning with Volterra Neural Networks: A System Theoretic Perspective

Higher-order interaction components are important for signal, image, and video modeling, but explicit high-order operators often suffer from rapidly increasing parameter and computational costs. This paper presents kVNN, a learnable kernelized Volterra Neural operator for compact higher-order filtering. The motivation is to use kernelization to improve the efficiency of Volterra-type neural operators while providing a structured interpretation of their higher-order components. The proposed formulation combines the order-wise structure of Volterra filtering with learnable polynomial-kernel atoms, allowing different interaction orders to be represented by separate learnable centers and coefficients. This order-decoupled representation avoids explicit high-order tensor parameterization and can be implemented as a CNN-compatible layer. Experiments on representative vision tasks show that kVNN achieves a favorable accuracy–efficiency trade-off.
Read the full abstract

Statistical Mechanics

Microscopic dynamics of contagion using active Brownian particles: universal scaling and propagation controlled by protection

Understanding how individual protection and population density influence epidemic spreading remains a central challenge in epidemiology. While classical compartmental models successfully describe the temporal evolution of epidemics, they do not explicitly account for the microscopic motion and spatial organisation of individuals. Here, we investigate contagion dynamics using an agent-based model of Active Brownian Particles (ABPs), where self-propelled agents interact through local contact and a prescribed fraction of the population is protected. By systematically varying the protected-agent fraction and the population density, we identify two distinct contagion regimes separated by a crossover protection of approximately $30\%$. Below this threshold, the maximum contagion rate follows the universal scaling $\nu_{\mathrm{max}}\propto\phi^{1/2}$, indicating that disease transmission is governed primarily by frequency of encounters. Above the threshold, universal scaling is lost and protection becomes the dominant mechanism controlling epidemic spreading, with the strongest suppression occurring in low-density populations. These results demonstrate that microscopic active-matter models provide a powerful framework for investigating epidemic dynamics beyond the assumptions of well-mixed population models and reveal how spatial organisation and individual protection jointly determine contagion dynamics.
Read the full abstract

Functional Analysis

On Sum Ranges for $3n$-convergence

The Riemann Rearrangement Theorem (RRT) tells us that commutativity of infinite series can differ from finite series. We wish to extend the notion of infinite series rearrangements to weaker forms of convergence, such as partial series convergence on every 2nd or 3rd index, called $2n$- or $3n$-convergence. In the case of $2n$-convergence, it has been shown that the sum range, along with the standard cases in the RRT, can produce a shifted additive subgroup of reals. In this paper, we show cases where the $3n$-sum range is still a subgroup and a case where the $3n$-sum range cannot be a subgroup, proving the existence of more depth for $3n$-convergence.
Read the full abstract

Machine Learning

CRISP: Cliff-awaRe Input-adaptive Sparse Prefilling with Structural-Mass-Motivated Routing

The attention prefilling phase of long-context LLM inference scales quadratically, making self-attention a severe computational bottleneck. Traditional sparse attention methods mitigate this through fixed patterns or offline profiling, but lack the flexibility to adapt to input-dependent attention structure. Recent dynamic methods address this by routing heads to sparse patterns in real-time, but rely on indirect routing proxies with overhead and budget allocation mechanisms that overlook the post-softmax mass hierarchy. We present CRISP (Cliff-awaRe Input-adaptive Sparse Prefilling), which identifies and addresses two structural challenges in this dynamic routing paradigm. First, we show that the routing decision can be read directly off the structure of the proxy attention map. We replace the Jensen-Shannon Divergence (JSD) routing with C_struct, a structural proxy that measures mass at Vertical-Slash compatible positions and reproduces JSD's routing decisions while eliminating both the pooled matmul and subsequent KL divergence overhead. Second, we formalize the post-softmax mass cliff and demonstrate theoretically that strictly cumulative coverage thresholds accumulate O(n) background noise at long contexts. CRISP navigates this via a sink-aware threshold grounded in the noise floor. Empirically, across InfiniteBench, RULER and LongBench on two model families, CRISP is the strongest sparse method overall and matches or exceeds exact dense attention on retrieval-heavy benchmarks, recovering up to +28.0 pp on retrieval tasks over baselines and achieving up to a 5.30x attention speedup at 512k tokens, driven primarily by our O(n) noise elimination during selection while preserving structural integrity.
Read the full abstract

All authors Huu Huy Nguyen, Chien Van Nguyen, Franck Dernoncourt, Ryan A. Rossi, Linh Ngo Van, Jieyang Chen, Thien Huu Nguyen

Artificial Intelligence

Looped Transformers under the Jacobian Lens: Does the Global Workspace Survive Recurrence?

Recent work identifies a mid-depth band of verbalisable, causally potent representations in a standard feedforward transformer — a functional analogue of a global workspace. Whether the same workspace functionality emerges when depth is implemented through recurrence rather than a stack of distinct layers remains unknown. Looped and depth-recurrent transformers provide a direct test of this question because they reuse the same weights across depth. We extend the Jacobian lens to iterated architectures using a virtual-unrolling adapter. We apply the full workspace suite — lens fitting, readout, and eleven causal experiment families — to Ouro-2.6B (48 layers looped 4 times, deeply supervised) and Huginn-0125 (a 4-layer core recurred 16 times, trained for latent reasoning), using Qwen3.6-27B (64 untied layers) as the standard baseline. We find that a workspace forms in the iterated part of each architecture, but that recurrence changes how it can be accessed. Ouro reconstructs workspace content in every loop, and linear transport cannot carry that content across loop boundaries; writes and ablations must therefore span every remaining loop. Huginn carries content forward across all sixteen recurrences, while reads, writes, and ablations act only within a sliding window of roughly two recurrences. Whether newly injected content can be verbalised tracks explicit per-iteration supervision; whether existing content can be steered does not.
Read the full abstract

Materials Science

Machine Learning Local Potentials for Accelerated Electron-Phonon Interactions Calculations within the Projector Augmented-Wave Framework

Electron-phonon interactions govern carrier dynamics, transport, and many optical and quantum phenomena in solids, but finite-displacement calculations within the projector augmented-wave (PAW) framework require up to 6N self-consistent supercell calculations for an N-atom system, making them costly for large, low-symmetry, and disordered materials. We introduce MLLocP, a machine learning strategy that learns the self-consistent local potential on real-space grids and supplies its displacement derivatives to the evaluation of all-electron PAW electron-phonon matrix elements. Analysis of the PAW decomposition identifies the local-potential contribution as a natural target for machine learning, while the remaining PAW quantities are retained within the established VASP/PHELEL framework. Using targeted grid-point sampling and feature-diversity selection for efficient model training, we validate MLLocP for elemental Cu, polar BAs, and chemically disordered Cu3Au. The learned potentials and their resulting displacement derivatives closely reproduce direct density functional theory calculations, yielding transport coefficients within approximately 3.5% for BAs mobility, 8% for Cu conductivity, and 11% for Cu3Au conductivity. For the 32-atom Cu3Au special quasirandom structure, using 40 sampled configurations reduces the number of self-consistent calculations by about fivefold relative to the 192 displaced structures required directly; using 20 or 10 configurations increases the acceleration to approximately 10- and 20-fold, with conductivity errors of 14.3% and 18.6%, respectively. MLLocP thus provides a scalable route to PAW electron-phonon calculations in complex materials while preserving the underlying all-electron formalism.
Read the full abstract

Optimization and Control

New strategies for some pursuit-evasion differential games with Gronwall-type constraints

This paper studies a class of non-cooperative pursuit-evasion differential games in the sequence space $l_{2}.$ The motions of the pursuer and the evader are described by certain first-order differential equations while their control functions are subject to Gronwall-type constraints which impose history-dependent bounds on their control resources. Two fundamental problems are investigated. For the pursuit problem, new strategy for the pursuer is constructed and sufficient conditions guaranteeing the completion of pursuit are established. For evasion problem, an admissible strategy of the evader ensuring avoidance of capture is obtained, and corresponding sufficient conditions for successful evasion are derived. The proposed approached extends existing results on differential games with classical geometric and integral constraints to a broader class of systems governed by Gronwall-type restrictions.
Read the full abstract

All authors Jamilu Adamu, Mehdi Salimi, Farouq Abba Wabi, Jewaidu Rilwan

Computer Vision

Automated Maize Ear Phenotyping Using 3D Reconstructions

Maize kernel traits such as row number, kernels per row, and kernel size vary largely for genetic reasons and are consistently associated with regions of the genome that influence yield. Manual measurement of these traits, however, cannot keep pace with the volume of maize generated in a breeding program. To address this, we developed and validated a fully automated pipeline for extracting these traits from 3D point clouds of corn ears, built on a recently developed video-to-point-cloud platform. Raw video frames are processed through COLMAP and NeRF, the ear is isolated via density-based separation, and the point cloud is distance-calibrated to physical units. The calibrated ear point cloud was Z-axis aligned via PCA and cylindrically unwrapped to a 2D image. We enhanced contrast and performed zero-fine-tuning instance segmentation using Cellpose-SAM. A triple-juxtaposed unwrap strategy was used to prevent double-counting at the seam. The pipeline achieved kernel count R^2 = 0.921 (MAPE = 10.33%) and kernel row number within +-2 rows for 95.2% of ears (MAE = 0.75 rows) on a 168-ear held-out set from the 268-ear labeled dataset. The resulting multi-trait dataset has known genotype identity for each ear, positioning it for phenotype-to-genotype association analyses.
Read the full abstract

All authors Ritwesh A. Kumar, Som Tripathi, Peja Matthews, Srikar Reddy, Talukder Zaki Jubery, Patrick Schnable, Adarsh Krishnamurthy, Baskar Ganapathysubramanian

Differential Geometry

Isospectral and not strongly isospectral spherical space forms with non-cyclic fundamental group

We construct the first examples of isospectral but not strongly isospectral spherical space forms with non-cyclic fundamental groups. We obtain infinitely many such pairs with isomorphic fundamental groups of Type I.

Statistical Methodology

Uncertainty Quantification of State Variables Trajectories in the Context of Inverse Problems: An Approach from Bayesian Inference and FDA

In this article, we address the problem of uncertainty quantification of state variables in the context of inverse problems. Inverse problems are associated with phenomena that can be represented through ordinary or partial differential equations, for which observations or data are available, but the values of the parameters that characterize the equations, the initial or boundary conditions are not known. Currently, the literature offers very few alternatives for analyze the propagation of uncertainty of state variables, which are limited to constructing pseudo-credible regions or quantifying their uncertainty at isolated points. We propose a methodology that combines tools of Bayesian inference, with Hamiltonian Monte Carlo sampling employed for efficient posterior exploration, and functional data analysis, specifically the Modified Band Depth method, to determine credible regions for the trajectories of the state variables throughout the time horizon of interest. We expose a methodology validation through a simulation study, which shows that our proposal captures a higher proportion of state variable trajectories than traditional pointwise analysis methods, our proposal generated credible regions that contained the true trajectory of the state variables 96.4% of the times, versus 80% that the regions of the pointwise method did. Furthermore, we demonstrate its application to a non-trivial model associated with a neurological phenomenon, for which the methodology effectively captures the time-dependent dynamics of the state variables.
Read the full abstract

All authors Luis Alejandro Baena-Marín, Juan Daniel Molina, Juan Camilo Bermúdez-Colorado, Nicolás Moreno

Computation and Language

Grounded, Compute-Efficient LLM Policy Agents for Energy-Poverty Equity in Physically-Constrained Peer-to-Peer Energy Markets

Energy poverty is nearly absent from NLP-for-social-good, and the little existing work is either static retrieval/QA or relies on carbon-intensive cloud LLMs, a self-defeating "computational irony" for a humanitarian setting. We present EqGrid, a closed-loop simulation in which a low-frequency, open-weight LLM policy agent sets price and carbon bounds and targeted subsidies over a community of empirically-grounded household personas, while high-frequency multi-agent RL traders clear a continuous double auction constrained by a physical distribution grid (IEEE-33-bus with Dynamic Operating Envelopes). Our contribution is threefold and directly addresses how to measure the social impact of AI: (i) grounded personas (region-matched socio-demographics) whose load curves are checked for shape and level realism against real smart-meter data; (ii) formal energy-poverty equity metrics (Energy Burden, Gini of EB, LIHC) showing the intervention reduces burden inequality without raising net grid cost; and (iii) a compute-efficiency frontier that measures how much equity performance survives compressing the policy agent from a 235B teacher down to a sub-1B model deployable on a laptop, in estimated energy/carbon per decision. A decoupled-safety design (the LLM sets bounds; a validate-and-project grid gate executes) yields zero grid-constraint violations versus 55 under direct LLM control. On energy-poverty equity, the LLM policy lowers the Gini of energy burden to 0.305 (from 0.351) and mean burden by 28% while cutting cost (outperforming a tuned rule baseline), and a 3B-active model retains 95% of the benefit at roughly 9x lower inference energy than the teacher, with even a 0.8B on-device model retaining 92% at roughly 24x lower energy. We will release code and configs.
Read the full abstract

General Relativity and Quantum Cosmology

A Tale of Two Calibrators: Comparing Newtonian and Photon Calibration in Advanced LIGO after the Third Observing Run

Precise calibration of LIGO's strain readout plays a vital role in our ability to extract information from gravitational-wave detections. We present a comparative analysis of two independent direct-force calibration methods: the Newtonian Calibrator (NCal) and Photon Calibrator (PCal) systems. Currently, LIGO relies solely on the PCal system as its absolute calibration reference. To facilitate comparison, a series of direct-force injections were performed using the NCal and PCal systems at the LIGO Hanford observatory just after the completion of the third observing run. We compute the ratio of the measured to expected strain amplitudes for every injection. For each injection frequency across a 30 Hz band, the ratios of NCal and PCal differ by $\sim$0.5-1%, demonstrating a small systematic difference between the two systems. This offset highlights the importance of maintaining multiple independent calibration references to validate LIGO's calibration.
Read the full abstract

All authors Dana Jones, Michael P. Ross, Ling Sun, Jeffrey S. Kissel, Dripta Bhattacharjee, Anthony Sanchez, Bram J.J. Slagmolen, Jens Gundlach

Signal Processing

Toward Security-Resilient Cell-Free Massive MIMO: A Multi-Stage Framework

This paper develops a robust security-resilient transmission framework for cell-free massive multiple-input multiple-output (CF-mMIMO) systems under active pilot spoofing attacks. As a baseline, system performance is characterized under attack-free conditions to establish the target user's pre-attack service level. Upon attack detection, the system enters an absorption phase, during which, power allocation is adaptively adjusted across a limited subset of access points (APs) using contaminated channel state information (CSI). This phase quickly compensates for performance degradation while maintaining low operational overhead. Once the secrecy spectral efficiency (SSE) recovers to a prescribed loss level, the resulting power allocation initializes the restoration phase. Here, the transmit powers of all APs are jointly optimized, and a protective partial zero-forcing (PPZF) strategy further improves secrecy. In parallel, artificial noise (AN) is incorporated under a worst-case eavesdropping scenario accounting for large-scale fading uncertainty. The resulting stage-dependent non-convex problems are formulated within a unified framework and solved using successive convex approximation (SCA). Numerical results demonstrate that the proposed scheme achieves an effective time-quality tradeoff while maintaining the highest recovered secrecy; in a representative setup, it achieves gains of up to 3.6%, 15.7%, and 56% over the respective baseline schemes, with similar improvements under eavesdropper's channel uncertainty.
Read the full abstract

All authors Junbin Yu, Tianyu Lu, Mohammadali Mohammadi, Michail Matthaiou

Numerical Analysis

Bounds-Constrained Finite Element Approximation of Time-Dependent Partial Differential Equations

Finite elements provide accurate and efficient methods for the numerical solution of partial differential equations by means of restricting variational problems to finite-dimensional approximating spaces. However, they do not, in general, guarantee enforcement of bounds constraints inherent in the original problem. We propose two approaches to enforcing bounds constraints for time-dependent problems. First, we propose general projective methods which result from a systematic modification of any abstract time-stepping scheme. Second, we present a monolithic technique for which we take a modified formulation of implicit single-stage Runge-Kutta methods and general implicit multistep methods as prototypical examples. By solving a constrained optimization problem, we are able to ensure that the bounds constraints are enforced by the approximate solution at the discrete time levels, obtaining (formally) high order methods both in space and time. Numerical examples for the linear heat and advection equations and nonlinear Allen-Cahn equation are given.
Read the full abstract

Chaotic Dynamics

Basin Geometry and Reliable Recall of Dynamical Memories in Reservoir Computing

Reliable attractor recall conventionally requires broad basins of attraction. However, in reservoir-computing based associative memory, temporal cues reliably recover dynamical memories despite basins dominated by unpredictable, riddled-like regions. We reveal that memory basins exhibit an “octopus-like” structure: a robust “head” near the attractor and thin, intertwined “tentacles” spanning state space. Initial states in tentacular regions yield near-zero uncertainty exponents, making the recalled memory effectively unpredictable at finite precision. Yet, cue-driven generalized synchronization bypasses this unpredictability, driving the system into the robust basin head. This mechanism yields a quantitative relation linking minimum cue duration, synchronization rate, and basin-head radius. Trained recurrent neural networks exhibit similar geometry, suggesting this phenomenon extends beyond reservoir computing.
Read the full abstract

Information Retrieval

MERGED: Multimodal Entity Resolution via Generated Expert Reasoning Distillation

In product entity resolution, relationship definitions constantly evolve with business needs, yet adapting to each change traditionally requires slow, costly human annotation that is often noisy and carries no reasoning. Large vision-language models (VLMs) prompted zero-shot can adapt to a new definition immediately and supply the reasoning that human labels lack, but their cost and latency are prohibitive at production scale. We present MERGED, a distillation framework that transfers not just labels but structured reasoning from large teacher VLMs into a compact 7B-parameter student, requiring no human annotation for training. Multiple teachers label each product pair and articulate the reasoning behind their decision: agreement pairs supply supervised fine-tuning, while disagreements are resolved by a meta-judge into preference pairs for Direct Preference Optimization. Evaluated against human-labeled ground truth on a multilingual e-commerce dataset, the resulting student improves PR-AUC by 13.79% over the same backbone trained on human labels and surpasses the larger Qwen2.5-32B-VL baseline by 6.32% at 6x lower cost, while also yielding tighter label-reasoning consistency (over 10% above Qwen2.5-32B-VL). Moreover, re-applying MERGED from an existing checkpoint adapts to a new relationship definition with only 10K samples, improving PR-AUC by 6.97% over zero-shot and outperforming from-scratch training. MERGED enables rapid adaptation to evolving relationship definitions, supporting a new one in days rather than months, at a cost and latency suitable for large-scale industrial deployment.
Read the full abstract

All authors You-Lin Chen, Kyoungjun Park, Bin Xu, Prithviraj Sen, Abhishek Prasad Ram Tripathi, Pedro Herrero-Vidal

Systems and Control

A Control Co-Design Framework to Optimize Sustainability with Application to Microgrid-Driven Data Centers

This work studies the optimization of physical plant characteristics and controller parameters for sustainability. Environmental sustainability is strongly correlated with the development and operation of energy systems, with data centers as the preeminent modern example. Data centers, and the grid technologies that provide their power, consume nonnegligible amounts of global energy and pose a risk to increase greenhouse gas (GHG) emissions and electronic waste. Addressing such issues requires improved plant design and control strategies, often approached through optimization-based methods. However, there are noticeable gaps regarding data center and microgrid design: (i) simultaneous optimization of plant and controller features is rarely explored, and (ii) sustainability criteria are not emphasized. This work addresses these gaps by establishing a generalized, sustainability-centric control co-design (CCD) framework for energy systems. Uniquely, the CCD framework defines and categorizes sustainability metrics into three lifecycle stages - manufacturing, operation, and disposal - supporting optimization and comparative analysis of the metrics for different design options. To exemplify its use, the CCD framework is applied to a microgrid-driven data center system, providing a family of sustainability metrics correlated to plant and controller parameters. The analysis enabled by the framework supports the determination of tradeoffs between different types of environmental sustainability metrics. The system designs identified by the proposed framework show substantial improvements to environmental sustainability categories as compared to designs identified through baseline procedures.
Read the full abstract

Chemical Physics

A Generalized Approach for Incorporating Geometry and Directionality into Coarse-Grained Machine-Learned Potentials

Machine-learned interatomic potentials have enabled highly accurate atomistic simulations, but extending these capabilities to coarse-grained systems remains challenging due to the loss of geometric and orientational information during coarse-graining. In this work, we present a generalized framework for incorporating molecular geometry and directionality into coarse-grained machine-learned potentials through two complementary approaches: anisotropic density-based descriptors (AniSOAP) and symmetry-adapted equivariant message-passing neural networks (MACE-CG). Using Gay-Berne particles and coarse-grained representations of benzene, formamide, and water, we demonstrate that explicitly retaining molecular anisotropy substantially improves the prediction of energies, forces, and torques relative to isotropic representations. AniSOAP provides an effective linear baseline when molecular shape is well approximated by ellipsoidal symmetry, while symmetry-adapted MACE-CG enables the incorporation of arbitrary molecular point-group symmetries. For water, whose orientational degrees of freedom are poorly represented by ellipsoidal descriptors alone, symmetry-adapted rigid-body features improve energy, force, and torque prediction by resolving orientational degeneracies inherent to isotropic and moment-of-inertia-based representations. These results show that information loss in coarse-grained modeling is governed not only by mapping resolution but also by the symmetry and geometric information retained in the representation, providing a systematic route toward more expressive and transferable coarse-grained machine-learned potentials.
Read the full abstract