Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Monday 14 September

Number Theory

Number fields as curves over $\mathbf{F}_1$

We study function fields in one variable over the field with one element $\mathbf{F}_1$. It is proved that the Galois extensions of $\mathbf{Q}$ are isomorphic to the curves over $\mathbf{F}_1$ being understood as the Deitmar schemes. Specifically, one gets explicit formulas linking the genus and the number of cusps of an algebraic curve over the extension $\mathbf{F}_{1^m}$ of order $m\ge 1$ of the field $\mathbf{F}_1$ and the $m$-th roots of unity of the corresponding number field. It follows that elliptic curves with one cusp over $\mathbf{F}_1$ are either the cyclotomic fields or the maximal abelian unramified extensions of the quadratic number fields. Our proof depends on representaion of the Drinfeld modules by the bounded linear operators on a Hilbert space and the crossed product structure of the Cuntz-Krieger algebras.
Read the full abstract

Discrete Mathematics

Ramsey Obstructions to Disambiguation

A partial matrix has entries in $\{0,1,\star\}$, and a disambiguation replaces each $\star$ by $0$ or $1$. We construct partial matrices whose fully specified submatrices satisfy strong restrictions, yet every disambiguation contains every binary matrix of a prescribed size. Our first result answers a question of Alon, Hanneke, Holzman and Moran on the disambiguation of linear classifiers with margin. For $0<\varepsilon<\pi/2$, let $M_\varepsilon^d$ be the partial matrix indexed by points of the unit sphere $\mathbb S^d$, with entry $0$ for pairs at spherical distance at most $\varepsilon$, $1$ for pairs at distance at least $\pi-\varepsilon$, and $\star$ otherwise. Although these matrices have VC-dimension bounded independently of $d$, we prove that every disambiguation contains every binary $k\times k$ matrix once $d$ is sufficiently large. This also yields a partial concept class of Littlestone dimension $1$ with no disambiguation of finite VC-dimension. We also construct, for every $k$, a finite partial matrix whose fully specified $2\times2$ submatrices are all constant, while every disambiguation contains every binary $k\times k$ matrix. A symmetric analogue holds for partial graphs: for every $k$, there exists a partial graph of VC-dimension at most $1$ whose fully specified induced subgraphs are all cliques or stable sets, yet every disambiguation contains every $k$-vertex graph as an induced subgraph. A disambiguation can be viewed as a $2$-coloring of the unspecified entries, making Ramsey theory a natural framework for forcing prescribed patterns. Our proofs draw on two recent Ramsey theorems: the geometric argument uses Pálvölgyi's Dense Block theorem, while the combinatorial constructions rely on the girth Ramsey theorem of Reiher and Rödl, a suitable strengthening of the induced Ramsey theorem.
Read the full abstract

Hardware Architecture

EBL: Efficient Broad Learning for Distributed Adaptive Harmonic Analysis

Renewable energy systems and electrified transport have found widespread adoption in recent years. The integration of these non-linear loads, dominated by electric vehicle (EV) charging, however, has introduced severe harmonic distortion into the power grid, impacting the efficiency and lifetime of substation equipment and switchgear in the distribution network. Rapid and high-precision harmonic analysis has hence become a prerequisite for effective harmonic control at the source of injection. This paper proposes an Efficient Broad Learning (EBL) framework for distributed adaptive harmonic estimation. As a quantised FPGA acceleration framework for BLS-style harmonic estimation, it offers high-accuracy estimation with half-cycle input, reconfigurable flexibility enabled by the FPGA implementation, and ultra-low latency, achieving 17.4 $\times$ faster predictions than the nearest reported FPGA method. For harmonic prediction across multi-scenario charging and discharging nodes, the online transfer learning based on a closed-form solution rather than backpropagation in EBL demonstrates rapid adaptability. By exploiting bespoke quantisation and sparsity, the approach consumes 5.9% of the LUTs on the Zynq Ultrascale+ ZU7EV FPGA, using $\approx$ 82% of the LUTs required by the state-of-the-art FPGA-accelerated estimator.
Read the full abstract

All authors Changhong Li, Georgios Floros, Biswajit Basu, Shreejith Shanker

Combinatorics

Independent domination in central graphs

Let $G$ be a graph with vertex set $V(G)$. A set $I\subseteq V(G)$ is an independent dominating set of $G$ if no two vertices in $I$ are adjacent and every vertex in $V(G)\setminus I$ is adjacent to at least one vertex in $I$. The independent domination number of $G$ is the minimum cardinality among all independent dominating sets of $G$. The aim of this article is to obtain tight bounds and closed formulas for the independent domination number of central graphs. The results are expressed in terms of parameters of the original graph from which the central graph is constructed.
Read the full abstract

All authors Abel Cabrera-Martínez, José Luis López-Carmona, Ismael Rios-Villamar, Alejandro Serrano-Díaz

Biomolecules

Exploring Optimal Parameters for Ligand-Based Virtual Screening in Early Drug Discovery

Ligand-based virtual screening depends on choices that are often treated as implementation details, including the similarity threshold, fingerprint setting and atom-invariant scheme. We examined how these choices altered the composition of ranked searches against the Enamine library for four aminergic reference ligands: atomoxetine, bupropion, mirtazapine and venlafaxine. Candidate sets were evaluated by compound-weighted scaffold novelty, normalized Shannon scaffold diversity and three computational estimates of synthetic accessibility. We first identified ligand-specific operating points along cumulative Tanimoto-ranked searches. We then compared five extended-connectivity fingerprint settings at matched retrieval depths and compared ECFP4 with the feature-class analogue FCSFP4. Finally, 240 records, corresponding to 229 unique structures, were scored independently by three chemists who were blinded to the computational scores. No single Tanimoto cutoff described all four searches. ECFP8 provided the most stable pooled setting, although venlafaxine favored ECFP2. ECFP4 was the stronger primary fingerprint in pooled comparisons, whereas FCSFP4 contributed nonredundant chemical space. Agreement among individual chemists was moderate, and the mean rating was more reliable than a single rating. SCScore showed the highest association with the blinded consensus, but performance varied by ligand. These results support a staged screening design in which a pooled default is followed by ligand-specific calibration and expert review.
Read the full abstract

All authors Temitope Sobodu, Victor Chibuzor Johnson, Ryan Kern, Peter Oni

Statistical Mechanics

Hidden kinetic correlations control collective phases of entropy-conditioned histories

Visible dynamics and mean dissipation need not determine the collective phases of rare histories. We construct local Markov models with identical ordinary visible path distributions, stationary states, mean entropy production, mean jump activity and driving affinities, yet different phases when histories are weighted by their full entropy production. Visible configurations modulate hidden driven cycles, whose exact elimination turns kinetic correlations into interactions. A positive spectral reduction separates hidden relaxation from collective modes. Periodic binary models retain opposite phases with entropy variances matched at every observation time. For conserved particles, a pair matches the first two joint cumulants of entropy and hidden activity at every observation time, yet selects segregation or a fluctuating state with suppressed long-wavelength density noise. Bound-state transport and fermionic evolution determine their contrasting dynamics. At a clean Ising critical midpoint, the entropy source couples quadratically to the thermal perturbation, making the fourth cumulant the first to detect the critical susceptibility. Its rate per site grows logarithmically, with an exact cutoff set by system size and observation time. For two quenched disorder ensembles, exact sample-response formulas and numerical evidence support a finite fourth-cumulant density despite very slow relaxation; a weak-disorder continuum response admits a controlled Borel sum. A common positive hidden eigenvector characterizes autonomous selected dynamics. When this condition fails, a finite network develops visible memory while preserving its ordinary visible process and mean diagnostics. These results identify kinetic information missed by aggregate thermodynamic observations.
Read the full abstract

Systems and Control

Electromagnetic Micro-Guidewire Control in Large Workspaces

Electromagnetic navigation requires sufficient actuation at clinically relevant distances due to limited magnetic volumes and coil currents. We combine real-time pose feedback with constrained convex optimization, dynamic feedback, and repetitive control to achieve energy-efficient micro-guidewire steering inside realistic anatomical models. Experiments with a clinically oriented, three-coil electromagnetic navigation system and a 0.6 mm-diameter tip magnet demonstrate angular tracking with root-mean-square errors below 0.25 degrees at distances up to 55 cm from the coil cover. Nullspace current redistribution maintains accurate tracking under active 45 A coil-current constraints. Compared with conventional field alignment, we demonstrate that pose-dependent torque-based allocation substantially reduces current demand, with the efficiency benefit retained at a pose-feedback rate of 15 Hz. These results demonstrate how real-time state information and optimization can extend electromagnetic guidewire control toward clinically relevant working distances.
Read the full abstract

All authors Jasan Zughaibi, Elia Jaggy, Valentin Gantenbein, Denis von Arx, Cristiano Sartini, Jonas Kühne, Oliver Brinkmann, Pascal Ernst, Salvador Pané, Quentin Boehler, Michael Muehlebach, Bradley J. Nelson

Systems and Control

Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities

Operator splitting methods are a fundamental class of algorithms for solving structured monotone inclusion problems arising in optimization, control, and game theory. We consider the case, common in stochastic regimes, where the forward evaluation of one of the constituent operators is either unavailable in closed form or computationally expensive to evaluate, and is therefore approximated using a finite number of noisy oracle samples. We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms. Unlike previous works, our analysis directly controls the residual error via martingale inequalities instead of relying on algorithmic stability arguments for a tailored surrogate loss, yielding the first a priori certificates whose statistical excess provably vanishes with the sample size. We further show that, under linear convergence of the Davis-Yin splitting algorithm, the dependence of our bounds on the iteration count improves from linear growth to exponential decay. We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns.
Read the full abstract

Quantum Physics

qdmag: A Python package for simulating nonequilibrium magnetization of molecules using quantum master equations

We present qdmag, a computational utility for calculating the magnetization of magnetic molecules in a time-varying external magnetic field by solving a generalized Lindblad quantum master equation with spin-phonon coupling treated as a dissipation term. The package relies on the spin Hamiltonian formalism, which includes both the magnetic exchange interactions and the zero-field splitting (ZFS) interaction. Different types of magnetic exchange interaction and ZFS terms up to 12th order, which are written in terms of the extended Stevens operators, are supported. qdmag enables long-time evolution of magnetization for up to a few milliseconds, which is achieved through a staircase approximation of the magnetic field as a function of time. For high-dimensional spin Hamiltonians, a lower-dimensional effective Hamiltonian is constructed to make the calculations computationally feasible. Three case studies of one-spin, two-spin, and three-spin systems are presented to demonstrate the usage of qdmag. Our work offers a computational tool to bridge the gap between theoretical development and numerical calculations of spin dynamics in the presence of spin-phonon coupling.
Read the full abstract

All authors Shuanglong Liu, Xiao Chen, Andrew Cupo, James N. Fry, Hai-Ping Cheng

Chaotic Dynamics

Requirement-Induced Predictive Geometry for Finite-Resource Prediction in Dynamical Systems

In nonlinear prediction, two state representations with the same local uncertainty volume can have radically different predictive value. We consider differentiable finite-time dynamics together with a quadratic terminal requirement that specifies which terminal state differences matter. Pulling this requirement back through the tangent map defines a requirement-induced predictive geometry on the present tangent space. This geometry is fixed by the dynamics and the requirement; under the fixed local uncertainty-volume constraint used here, the capacity parameter fixes only the scale of the representation that realizes it. We show that the unique optimal covariance has the inverse predictive shape and, equivalently, that optimality is characterized by isotropization of propagated uncertainty in the terminal requirement geometry. The gain over a baseline-isotropic representation is the arithmetic-to-geometric mean ratio of the predictive spectrum, making it a coordinate-invariant measure of predictive anisotropy. In Euclidean coordinates this yields a general finite-time spectral law, and for two-dimensional area-preserving dynamics an exact identity between predictive gain and the condition number of the optimal geometry. Stronger directional stretching therefore increases potential predictive gain only together with the anisotropy required to realize it; bounding that anisotropy imposes a finite gain ceiling. Standard-map and double-pendulum calculations demonstrate these relations in nonlinear Hamiltonian systems. The framework provides a basis for adaptive sensing, state estimation, and model-predictive computation in which representation geometry is matched to predicted task consequences.
Read the full abstract

Machine Learning

Federated stochastic bilevel optimization with fully first-order gradients

Federated stochastic bilevel optimization has been actively studied in recent years due to its widespread applications in machine learning. However, most existing federated stochastic bilevel optimization algorithms require the computation of second-order Hessian and Jacobian matrices, which leads to longer running times in practice. To address these challenges, we propose a novel federated stochastic variance-reduced bilevel gradient descent algorithm that relies solely on first-order oracles. Specifically, our approach does not require the computation of second-order Hessian and Jacobian matrices, significantly reducing running time. Furthermore, we introduce a novel learning rate mechanism, i.e., a constant single-timescale learning rate, to coordinate the update of different variables. We also present a new strategy to establish the convergence rate of our algorithm. Finally, the extensive experimental results confirm the efficacy of our proposed algorithm.
Read the full abstract

All authors Yihan Zhang, Rohit Dhaipule, Chiu C Tan, Haibin Ling, Hongchang Gao

Number Theory

A formula for the rank over $\mathbb{Q}(t)$ of the elliptic curve $y^2=x^3+At^6+Bt^3+C$

In this paper, we give an explicit formula for the rank and generators (up to finite index) over $\mathbb{Q}(t)$ of all non-trivial elliptic curves of the form $y^2=x^3+At^6+Bt^3+C$, which is a larger class of elliptic surfaces than the one in Kloosterman's paper (2026) and Desjardins and Naskrecki's paper (2024), namely $y^2=x^3+At^6+C$. Our proof provides a new method to find this formula using generators of the geometric Mordell-Weil group while this geometric Mordell-Weil group (which is a $\mathbb{Z}[\omega]$-module) no longer decomposes into rank-one submodules by the methods in Kloosterman's paper (2026) and Desjardins and Naskrecki's paper (2024). Moreover, our proof uses only a few elements in the Galois group of the coordinates of the generators and only light computations by hand.
Read the full abstract

Solar and Stellar Astrophysics

Using Gravity as an Age Indicator for Young Stars

The age of a young star is difficult to measure and yet is a fundamental property that is essential for understanding stellar evolution. Accurate age indicators across the early phases of low-mass stars are scarce and often rely on properties of the circumstellar environment. We investigate stellar surface gravity as a practical age estimator from the class I to the class III phases of low-mass stars. Gravity increases monotonically as young stars descend their Hayashi tracks. Gravity is a physical property of the central star and is independent of the circumstellar environment or evolutionary models. Also, gravity can be measured for individual objects. We performed two tests for the reliability of gravity as an age indicator: (1) the relative ages of the components of young binary stars and (2) the relative ages of a young moving group. We show that young binary stars have consistent gravities, as expected, if they are coeval. Similarly, we find similar gravities among the TW Hya group and derive a median age of 12.8 +/- 1.2 Myr. In both cases, differences in gravities may reflect real differences in the ages. We show that there is no correlation between veiling emission and gravity, showing that circumstellar disk emission does not affect our ability to infer ages from measurements of photospheric stellar gravity.
Read the full abstract

Machine Learning

Multi-Label Proportion Learning for Sea-Ice Type Prediction

Sea-ice type prediction is important for climate monitoring, maritime navigation, and decision-making in polar regions. The main source of label data for this task is the ice chart, produced manually by ice analysts who interpret satellite imagery to delineate ice zones into polygons. Although ice charts are valuable, their production is labor-intensive and expensive, motivating recent efforts to automate the process using deep learning. However, deep learning models require patch-level (or pixel-level) label data for training, while ice charts provide only polygon-level annotations. As a workaround, supervised approaches often create approximate patch-level labels from polygon-level ice chart labels by assigning each sample the dominant ice type of its parent polygon. This approach enables supervised training but creates an ill-posed learning problem with intrinsically approximate solution. In this paper, we redefine sea-ice type prediction as a weakly supervised multi-label proportion learning problem to be able to directly use the polygon-level ice chart labels and avoid unnecessary label approximation for improved prediction accuracy. To address this problem, we propose a two-module framework where first Multiple Instance Learning (MIL) is used for water–ice classification, and then a multi-label proportion learning (MLPL) is introduced for ice-type composition prediction. We further extend this framework with a multimodal model that integrates SAR imagery with AMSR2 brightness temperatures and ERA5 reanalysis data through modality-guided auxiliary regularization. Evaluated on the AI4Arctic dataset, the SAR-only model reduces MAE by 14.5% and more than doubles mean ice-class F1 over the best supervised baseline. The multimodal model further reduces MAE by 21.5% and raises mean F1 by 41.2% over the SAR-only model, and by 52.7% over the supervised multimodal baseline.
Read the full abstract

All authors Samira Alkaee Taleghan, Younghyun Koo, Andrew P. Barrett, Farnoush Banaei-Kashani

Robotics

Auto-HSI: Personalized human control of a robot swarm on demand by using LLMs for online automatic code generation

This paper presents Auto-HSI, a method for generating personalized human-swarm interaction (HSI) interfaces on demand. The objective is to enable untrained operators to use natural language descriptions and gesture demonstrations to explain how they want the robots to collectively behave in response to their gestures. Based on these inputs, the code should automatically be generated for personalized state machines that will control the robots as desired, in response to the desired gesture inputs. In the developed Auto-HSI prototype, the generated code produces a personalized interface for centralized control using one- and two-handed gestures, enabling a user to teleoperate the robots' motion, formation shape, and shape deformation. We test the gesture tracking and code generation components of Auto-HSI against performance benchmarks. We then test the full Auto-HSI prototype in “live” operation experiments, in which real human operators centrally control 50 simulated robots in a physics-based simulator, under nominal and noisy conditions. In these experiments, robots are teleoperated to: score a goal, traverse a maze that requires shape deformation, and score two simultaneous goals by splitting into two groups. We also demonstrate a real human operator making live updates to their personalized Auto-HSI interface during operation (in simulation). Finally, we demonstrate live operation of real robots.
Read the full abstract

All authors Alessandro Nazzari, Nathan Cerisara, Dorian Tonnis, Raina Zakir, Lorenzo Labarile, Weixu Zhu, Marco Dorigo, Mary Katherine Heinrich

Group Theory

Matroids and isomorphism problems for Bestvina-Brady groups

We propose a factorization of the graph isomorphism problem for Bestvina-Brady groups (BBGs) through matroid theory. In particular, we show that finitely presented BBGs depend on their defining graphs only through their cycle matroids. On the other hand, we construct graphs of arbitrarily high connectivity such that they have non-isomorphic cycle matroids but their BBGs are isomorphic. To do so, we prove that if a graph admits a tree clique-spanner, then the Dicks-Leary presentation of its BBG can be explicitly simplified to a right-angled Artin group presentation. In particular, we show that BBGs defined by dually chordal graphs are right-angled Artin groups.
Read the full abstract

Human-Computer Interaction

From Momentary Emotion Inference to Sustained Emotion Support: Evaluating a Companion Agent in a Longitudinal Study

Sustained emotional support is a long-horizon interaction task closely tied to human well-being. Recent research demonstrates generative agents' capacity for momentary emotional support, yet how these capabilities sustain support over time remains unclear. To examine this challenge, we deployed PAIR, a theory-based emotion-regulation companion, with 19 participants for 14 days. Across 1,093 sessions, we paired emotion estimates with self-reports before and after guidance and analyzed logs and interviews. Estimates corresponded more closely to self-reported valence and dominance than arousal. Guided conversations were followed by higher valence and state-dependent arousal changes. Participants felt understood through contextual exploration and emotional acknowledgment, acting on guidance suited to their needs and constraints. Perceived helpfulness of guided conversation significantly increased over time. Our findings link memory updates and retained corrections to cross-session personalization, informing future emotional support tools that adapt to evolving needs, learn from prior outcomes, and preserve user control over memory.
Read the full abstract

All authors Kexin Quan, Zijian Ding, Jiaye Yong, Qinshi Zhang, Dong Wang, Jessie Chin

Materials Science

Domain-wall energy governs coercivity in ordered and disordered additively manufactured Fe–49Co–2V

Additively manufactured soft-magnetic Fe–Co is consistently harder than wrought material of the same composition, and controlling that excess is the central obstacle to printing electrical machines from these alloys. The literature attributes it to B2 chemical ordering, untested because the anisotropy of the ordered state had not been measured for this alloy and because printed material had never been compared with wrought material at matched grain size. In this study we supply both. Calibrating on wrought Fe–49Co–2V at a known order parameter fixes the ordered-state domain-wall energy and caps every pinning channel independent of grain size. Ordering then falls orders of magnitude short of the measured excess, and a tenfold change in antiphase-domain size leaves coercivity unchanged. What ordering controls is the wall energy, and that effect is small and bounded. The excess is retained defect content, which moves process optimization from post-build annealing to in-build defect control.
Read the full abstract

High Energy Physics (Phenomenology)

Top-quark pair production sensitivity to heavy new physics at the FCC-ee

We study the sensitivity of top-quark pair production at the FCC-ee to heavy new physics, parametrised in the Standard Model effective field theory, using discriminants based on matrix elements. The analysis includes detector reconstruction effects, obtained with a fast simulation of the IDEA detector concept, and jet flavour tagging. We consider dimension-six operators that modify the electroweak couplings of the top quark or generate four-fermion interactions, at leading order and in diagrams with two resonant top quarks. The full six-body kinematic information is employed to maximise the discrimination power against the Standard Model. Two bins per dimension in the space of 12 discriminants, one per operator considered, provide a simple and robust methodology to set nearly optimal multidimensional constraints. Bounds on the new physics scale can reach values up to 30 TeV in a single-operator fit and up to 5 TeV in a global multi-operator fit. A combination with High-Luminosity LHC prospects on top-quark operators shows complementary sensitivities which help lift approximate degeneracies.
Read the full abstract

All authors Jacopo De Piccoli, Gauthier Durieux, Sergio Sánchez Cruz, Michele Selvaggi

Machine Learning

Channel-Informed Neural Network for Physical Layer Key Generation

Physical-layer key generation (PKG) enables wireless devices to establish shared keys from reciprocal channel observations without directly exchanging the key. This capability is attractive for edge networks, where distributed and resource-constrained devices may require lightweight key establishment with limited access to centralized infrastructure. We introduce a channel-informed neural network for PKG that derives binary key features directly from received IQ measurements while explicitly grounding the learned representation in the underlying multipath channel. The proposed multi-task recurrent neural network jointly learns reciprocity-preserving binary features and an auxiliary channel estimate using a training objective that combines deep metric learning with channel-informed supervision. Structured channel sounding enables channel estimation from over-the-air measurements, while Sionna-RT ray tracing is used to augment training with additional propagation conditions. We evaluate the framework using indoor and outdoor software-defined-radio measurements collected on the POWDER radio testbed. Across all evaluated scenarios, the proposed model produces lower bit disagreement for reciprocal Alice-Bob observations than for Eve-related observations. Ray-traced data augmentation substantially improves key diversity, increasing the unique-key rate to 0.94, 0.99, and 0.99 across the indoor and two outdoor scenarios, respectively. Successfully reconciled channel-informed keys pass the selected NIST randomness tests prior to SHA-3 privacy amplification. The results demonstrate the potential of channel-informed representation learning for decentralized wireless key establishment while highlighting an important tradeoff between key diversity and reconciliation reliability.
Read the full abstract

All authors Jose Angel Sanchez Viloria, George Sklivanitis, Dimitris Pados, Elizabeth Serena Bentley

Computation and Language

StalePO: Anchored Token-Level Preference Optimization using Legacy Post-Edits in Machine Translation

Machine translation systems are periodically upgraded to stronger models, but the available preference signal is human post-edits of an older system's outputs, which the newer model may already surpass. Moreover, collecting fresh post-edits for every new model is prohibitively expensive. We call this the Stale Preference problem. Standard DPO can fail in this setting: it may increase the likelihood of inferior post-edits, erode the model's existing quality, and fail to provide the per-token control needed to correct localized errors. We introduce StalePO, an objective derived from three requirements this regime imposes. Likelihood movement must be downward on both responses, the policy must be anchored to its own base response, and the KL constraint must apply at the token level. These requirements are jointly necessary. In ablations, each mechanism in isolation leaves the model's performance indistinguishable from the base model, and only their combination converts stale feedback into gains. On English-to-Hindi and English-to-Turkish localization data, StalePO improves the fraction of segments passing all LLM-as-judge MQM quality checks by 14.9 and 4.6 percentage points, respectively, with gains concentrated on style and fluency. A human evaluation under the same framework confirms these gains on English-to-Hindi, raising the fraction of segments passing all seven human checks by 13.8 percentage points.
Read the full abstract

All authors Rohit Dhaipule, Sukhdeep Singh Kharbanda, Prasanth Bathala, Pradyumna Lanka, Anubhav Shrimal

Chemical Physics

Multi-Task Graph Neural Network Predictions of Auger-Electron and X-ray Photoelectron Spectroscopy

Auger-electron spectroscopy has long accompanied x-ray photoelectron spectroscopy as a second modality to resolve chemical states with overlapping core-electron binding energies. However, analyzing the Auger spectrum is challenged by its complexity and the computational expense of its simulation. Here we demonstrate that the physical connection, and thus inter-task relationship, between the generation of a core-hole and its corresponding Auger-Meitner decay enables inductive knowledge transfer through the training of a multi-task graph neural network to predict both observables from a common graph embedding. Both task losses are combined with learned weights via the uncertainty weighting procedure. Overall, the single-task and multi-task models predict calculated and experimental Auger lineshapes with good accuracy in most cases. The performance between the two task regimes is similar, with the single-task models generally having better predictions of the finer peak structures in the spectrum. The present results demonstrate that multi-task training is a promising avenue for future developments of universal x-ray spectroscopy models with learned representations that map the molecular structure to a multitude of techniques.
Read the full abstract

Artificial Intelligence

Breaking the 1.58-bit Barrier for Ternary LLMs

Ternary Large Language Models (LLM) store every weight as one of three symbols $\{-1,0,+1\}$, so the cost of a ternary model is conventionally referenced to the information-theoretic $\log_2 3 \approx 1.585$ bits per weight. The prevailing deployment format packs five ternary weights into one byte (five-trit packing), and due to the power-of-two group sizes used in practice this rounds up to $1.625$ bits per weight. This effective storage bit-width treats the three symbols $\{-1,0,+1\}$ as equiprobable. We measure the actual symbol distribution of 29 ternary LLM models and find that zeros account for up to $51.5\%$ of all weights. Motivated by this finding, we introduce BITCOS, a simple distribution-adaptive layout comprised of a dense presence bitmap plus a compacted sign vector, and costs $2 - z$ bits per weight element given a zero density $z$ in the model's weights. BITCOS stores weights more compactly than the five-trit packing in 26 of the 29 tested models, and reaches $1.485$ bits per weight on the sparsest of them. BITCOS is amenable to efficient unpacking on modern processors and GPUs, and we present optimized unpacking sequences for AVX-512, AVX2 and Intel Xe2 GPUs. Measured against production state-of-the-art ternary matrix-vector multiplication kernels, at the zero densities real-world ternary models exhibit, the realized gain with our proposed layout is up to $1.28\times$. Finally, we illustrate end-to-end LLM inference results on 5 different platforms (client and server CPUs, integrated and discrete Xe2 GPUs) where decode throughput improves by up to $1.18\times$ on CPUs and $1.27\times$ on GPUs.
Read the full abstract

Algebraic Geometry

Demailly's Inequality for Finite Sets of Points in Positive Characteristic

Let $k$ be an algebraically closed field of characteristic $p>0$, $n\ge1$, and let $X\subset \mathbb P^n_k$ be a finite nonempty set of distinct points with the defining ideal $I=I(X)$. We give a proof of Demailly's inequality in positive characteristic. The argument is based on the Frobenius–Hasse derivative method used in this context by Hà and Sivakumar. The key additional observation is a strict-growth lemma for the initial degrees of symbolic powers of a finite set of affine points: $$ \alpha(J^{(t)})\ge \alpha(J^{(t-1)})+1\qquad(t\ge1). $$ In characteristic $p$, if a minimum-degree polynomial has a nonzero first ordinary derivative, this follows by differentiation; if all first ordinary derivatives vanish, perfectness gives a $p$th root and an induction on the symbolic exponent. The remainder of the proof uses the $q=p^e$ Frobenius decomposition and a maximal Hasse derivative.
Read the full abstract

Cryptography and Security

Illusion of Depth: Revealing Hidden Stereo Vision Vulnerabilities in Depth Estimation

Stereo cameras are integrated into autonomous systems such as self-driving cars, drones, and robots to offer precise depth estimation in a cost-effective manner compared to LiDAR technology. In this work, we reveal an intrinsic vulnerability in stereo cameras that stems from their pixel sampling and calibration processes, which can influence the outputs of stereo matching algorithms. Attackers can achieve fine-grained control over the estimated depth of real obstacles using simple repeating patterns, without relying on sophisticated adversarial machine learning techniques. Furthermore, deep learning-based depth estimation models exhibit a similar vulnerability. We evaluate the impact of this attack on two widely used stereo matching algorithms (BM and SGBM), three deep learning models (PSMNet, MoCha-Stereo, and UniMatch), a stereo-LiDAR fusion model (SGM-DDC), and two popular commercial stereo cameras, the ZED2 and Intel RealSense D435. For example, in the ZED2 camera, an attacker can displace obstacles up to 20~meters farther or 12~meters closer. In our real-world evaluation in a driving setting, a brief 0.5~second attack can trigger emergency braking in a popular autonomous driving framework. We further demonstrate the feasibility at driving speeds up to 40~km/h using CARLA. Finally, we confirm the ineffectiveness of state-of-the-art defenses, and we propose a novel strategy that leverages similarity scores to dynamically detect and suppress the depth discrepancies. Our work highlights vulnerabilities hidden in stereo matching and deep learning depth estimation models, addressing critical limitations in autonomous system deployments.
Read the full abstract

All authors Sri Hrushikesh Varma Bhupathiraju, Tetsu Ishizue, Nicholas U. Costagliola, Ozora Sako, Kentaro Yoshioka, Takeshi Sugawara, Sara Rampazzi

High Energy Astrophysical Phenomena

Determination of the Angular Distributions of Dynamical and Emission Parameters of GRB Relativistic Outflows

A previously-developed analytical treatment of the "Larger-Angle Emission" model for GRBs and afterglows is further developed to include the effect of a fixed magnetic field orientation. This model, has the uncanny ability to unify the prompt and delayed emissions and to account easily for the entire diversity of Swift X-ray light-curves. The LAE model is applied to seven GRBs (060526, 060614, 060714, 060729, 061007, 061121, 100902, 130427A) with well-sampled 0.3 keV/10 keV Swift/XRT and optical light-curves, displaying well-monitored four phases (GRB, Tail, Plateau, post-Plateau), to illustrate its power and limitations and to determine its five fundamental parameters. The one-and-only Core parameter Gamma_c*theta_c is determined by the GRB and afterglow temporal milestones (i.e. by the dynamical range of the Tail and Plateau), and may have an universal value around 3.0, with narrower Cores (smaller theta_c) being more relativistic (higher Gamma_c). Flat Plateaus require an Envelope angular structure close to Gamma(theta) ~ 1/theta^2. A magnetic field parallel to the direction of the relativistic flow yields more curved prompt/GRB and delayed/afterglow light-curves than a perpendicular or isotropic field, with curvature $\Delta \alpha$ defined as the difference between the flux asymptotic power-law decay indices at the beginning and end of each phase. The curvature Delta alpha_grb of the GRB light-curves arising from the uniform Core is set only by the B-field orientation, and a perpendicular or isotropic B-field is equally often found, but a parallel field is never identified for the Core. The curvature Delta alpha_ag of the afterglow light-curves from the power-law Envelope depends on B-orientation and three other parameters. The Envelope B-field orientation can be identified for only three afterglows, where a parallel B is found.
Read the full abstract

Analysis of PDEs

From qualitative smoothness to uniform estimates for fully nonlinear elliptic equations

We establish a general mechanism that turns qualitative smoothness into uniform, quantitative regularity estimates for fully nonlinear elliptic equations. The central conclusion is that, for compact classes preserved by the natural rescalings of the equation, qualitative and quantitative regularity have the same critical threshold. At second order, mere twice differentiability throughout the corresponding centered hull already forces a uniform $C^{2,\alpha}$-theory for some $\alpha>0$. A one-sided tangent version gives a new partial regularity criterion for a single operator: every point at which a solution is twice differentiable is regular, whereas the singular set has universal positive codimension. The proof combines compactness of the full renormalized class with a scale-adaptive improvement of flatness, converting information available separately at each profile into estimates uniform across the entire class. The argument requires no quantitative control of the assumed smoothness and opens a path in problems where smoothness is visible, but estimates remain out of reach.
Read the full abstract

Astrophysics of Galaxies

Disentangling Stellar Mass and Environmental Effects on eROSITA AGN Activity using multi-wavelength data from GAMA, WISE, GALEX, and DESI Legacy Survey

We use a stellar-mass complete sample of $\sim 36{,}000$ galaxies from GAMA/eFEDS to test whether AGN activity depends on environment independent of stellar mass. To isolate this effect, we introduce $\delta_{\rm rank}$, a novel local overdensity metric defined within narrow stellar mass bins. Our main result is that X-ray-selected AGNs show a clear environmental trend, the AGN fraction rises from $\sim 4\%$ in low-density regions to $\sim 6\%$ in high-density regions, with a sharp transition at $\delta_{\rm rank} \sim 0.4$. This environmental dependence is absent for WISE-selected and broad-line AGN, and Eddington ratios show no variation across environments. We also found that for galaxies with $\mathrm{SFR} > 15\,M_\odot\,\mathrm{yr}^{-1}$, X-ray AGN fraction is approximately 5%, 60% and 20% in low, mid and high $\delta_{\rm rank}$ galaxies. We show that relationship between AGN fraction and SFR varies dramatically with both environment and selection method. We conclude that environment on scales of $\sim 5h^{-1}\,\mathrm{Mpc}$ regulates X-ray AGN triggering efficiency.
Read the full abstract

Information Theory

Amortized Relaxed Locally Decodable Codes

Locally decodable codes (LDCs) enable recovery of any message symbol by probing only a small number of positions in a possibly corrupted codeword. The central parameters of an LDC are its rate, locality, and error tolerance. Ideally, one would like all three parameters to be constant. However, classical lower bounds show that such codes cannot exist. A recent line of work introduced amortized locally decodable codes (aLDCs), in which the decoder is tasked with recovering an entire block of consecutive message symbols rather than a single symbol. While prior work obtained ideal aLDCs with constant rate, constant error tolerance, and constant amortized locality, those constructions relied on either shared randomness hidden from the channel or computational assumptions restricting the channel. Another well-studied relaxation is the notion of a relaxed locally decodable code (RLDC), in which the decoder may output a special failure symbol $\bot$ rather than risk decoding incorrectly. In this work, we introduce the notion of an amortized relaxed locally decodable code (aRLDC), combining amortized decoding with the relaxed decoding paradigm. Unlike prior ideal aLDC constructions, our model is fully information-theoretic and makes no assumptions about shared randomness or computational limitations of the adversarial channel. We construct the first aRLDC with constant rate, constant error tolerance, and constant amortized locality. Moreover, for any block of length $\Omega(\mathrm{polylog}(k))$, our decoder achieves amortized locality $1+\delta^{1 - o(1)}$, where $\delta$ is the error tolerance parameter. Thus, asymptotically, recovering a long block requires essentially less than two codeword probe per message symbol recovered. By contrast, without amortization no RLDC can simultaneously achieve constant rate, constant error tolerance, and constant locality.
Read the full abstract

Robotics

ManiSkillFormer: Demonstration-Free Compositional Manipulation via Geometric Contracts and Agentic Skill Graph

Adapting robotic manipulation to new objects and tasks often requires additional demonstrations or manual engineering. Reusable manipulation skills can reduce this effort, but adapting these skills to new scenes remains challenging. We present ManiSkillFormer, a framework for demonstration-free and compositional manipulation that connects perception and action through explicit geometric contracts. Building on reusable skill schemas, LLM agents generate contracts specifying the geometry primitives required by each skill, together with corresponding motion templates for semantic objects and task contexts. These contracts guide a perception module to ground task-relevant 3D geometry from observations, which is then used to instantiate reusable motion templates in a skill library. We evaluate ManiSkillFormer on a dual-arm robot across demonstration-free pick-and-place with 30 instances from 8 object categories, functional manipulation including unscrewing, pouring, pressing, and folding, and three long-horizon tasks. ManiSkillFormer achieves an average success rate of 88.97% for pick-and-place, 75.00% for functional manipulation, and completion rates of 50–80% across the long-horizon tasks, outperforming the evaluated baselines and two ablated pipelines. These results demonstrate the potential of explicit geometric contracts to support skill reuse and composition across objects and tasks without per-object policy fine-tuning or additional robot demonstrations. The project website is at https://patricia1019.github.io/ManiSkillFormer/.
Read the full abstract

All authors Peiqi Yu, Mosam Dabhi, Shangtao Li, Bowei Li, Laszlo Jeni, Changliu Liu