Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Thursday 3 September

Computation and Language

Less Is Moral: A CHARMing Framework for Moral Foundations Detection in Endorsement Behaviour

Moral language plays a central role in shaping online endorsement and the diffusion of information, yet existing moral foundation detection systems often suffer from poor cross-domain generalization, weak rationale grounding, and reliance on costly prompting-based large language models (LLMs). We introduce CHARM, a MAC- and Hate-speech-Aware Rationalealigned Moral foundation detection framework built on a lightweight fine-tuned LLM, which integrates complementary moral grounding, rationale alignment, and polarity-aware hate speech signals to support more robust and faithful moral prediction. Unlike prior dictionary-, fine-tune-, or prompt-based detectors, which decouple computation from psychological theory, CHARM is built so that each component – MAC cross-attention, rationale alignment, and hate-speech modulation – operationalizes a distinct psychological construct. Using a 30% subsample of the MFTC, MFRC, and News training pools together with the richer supervision in MFTCXplain, CHARM improves AUC by up to 15.3% in-domain, surpasses the supervised baselines on every out-of-domain dataset in both AUC and F1, and offers a scalable, low-cost alternative to prompting-based LLM detectors. We further apply CHARM to large-scale COVID-19 discourse on Twitter and show that moral value alignment is strongly associated with online endorsement behavior. By making moral framing measurable at scale, CHARM offers a practical tool for studying the spread of morally charged misinformation. Code and additional materials: https://github.com/HuixiangF/CHARM/.
Read the full abstract

General Relativity and Quantum Cosmology

Introducing SINFONIA: Symplectic, slimplectic and Magnusian (Neural) Flows for Orbital Numerical Integration and Acceleration

Long-duration gravitational-wave modelling must resolve fast orbital motion together with slow dissipative evolution while preventing small numerical errors from accumulating into secular phase drift. Here we ask whether the finite-time evolution map itself can be learned as an explicit, differentiable, structure-preserving object and then repeatedly composed through a complete inspiral. We construct three neural-flow architectures: a symplectic and slimplectic flow on Galley's doubled phase space, [SINFONIA-J0]; a Taylor-anchored flow, [SINFONIA-J1]; and a Magnusian flow that learns the finite-time dissipative correction in the interaction picture, [SINFONIA-J2]. Applied to a 2.5PN neutron-star inspiral, all three expose the same controlling mechanism: long-time accuracy is governed not by pointwise map error alone, but by its signed projection onto a single secular channel fixed by energy–angular-momentum balance. Encoding this structure allows the learned maps to remain accurate through $10^{2}$–$10^{5}$ window compositions to coalescence at timesteps of a full orbital period and beyond, reaching chained phase errors orders of magnitude below a benchmark slimplectic integrator at lower cost. The same secular structure can also be exploited for physics inference: when the channel is left unconstrained, the accumulated phase retains enough information to recover an un-modelled dynamical-friction-like force, both parametrically and as a learned function of separation. Network-off controls isolate the contribution of learning from the analytic structure already built into each map. These results establish a proof of concept for structure-preserving learned evolution maps as tools for fast long-duration integration and physics inference in gravitational-wave source modelling.
Read the full abstract

Biological Physics

Internal geometries regulate the symmetry of defect configurations in cell populations confined to domains with a negative Euler characteristic

Nematic order of confined cell populations plays an important role in determining cell alignment and stable configurations of topological defects, which are related to various biomechanical phenomena. Topological charges (or winding numbers) of topological defects strictly depend on the Euler characteristic of the confining domain, which has typically been non-negative in studies focused on domains without internal obstacles. However, biological tissues often surround two or more internal obstacles or holes, which inherently generate defects with negative charges. To understand the mechanical interaction between cellular tissue and obstacles, it is necessary to elucidate the geometrical effects of obstacles on cell alignment and defects with negative charges. Here, we investigate how cell populations achieve stable defect configurations of two -1/2 defects in a triply connected domain. First, we present experimental observations of C2C12 myoblasts confined by two circular obstacles of varying diameter, demonstrating that two $-1/2$ defects are the most frequent configuration when the obstacles are sufficiently large. Second, to theoretically validate these experimental observations, we perform systematic stability analyses of defect configurations using an explicit expression of cell alignment and numerical minimization of the Frank elastic energy. Our numerical calculations reveal that the most stable configuration shifts continuously from a horizontal, through off-axis, to a vertical configuration as the obstacle size increases. In addition, the experimentally observed defect positions agreed with these theoretical predictions to within 60 $\mu$m. These findings suggest that obstacle sizes control the symmetry of cell alignment, providing insights into how geometric and topological constraints can generate complex force patterns during morphogenesis or organ movements.
Read the full abstract

All authors Mina Kamao, Hiroyuki Miyoshi, Takaaki Nara, Hiroki Miyazako

Combinatorics

Taylor Positivity of Ehrhart Polynomials

Let $P$ be a $d$-dimensional lattice polytope with Ehrhart polynomial $L_P(t)$. Motivated by the study of Ehrhart positivity and magic positivity, we investigate the Taylor coefficients $\mathsf{A}_j(P;k)$ in the shifted expansion $L_P(t)=\sum_{j=0}^{d}\mathsf{A}_j(P;k)(t-k)^j$ about a real center $k$. In this paper, we obtain the following four main results. (i) We give exact formulas for these coefficients in terms of the ordinary Ehrhart coefficients, the $h^*$-vector, elementary symmetric functions, and Stirling numbers. (ii) We denote by $\tau(P)$ and $\tau^+(P)$ the smallest nonnegative integral centers at which all Taylor coefficients are nonnegative and positive, respectively. If $s$ is the degree of the $h^*$-polynomial, then $0\leq\tau(P)\leq\tau^+(P)\leq\min\{\max\{0,s-1\},\lfloor\frac{d-1}{2}\rfloor\}$. As an application, we slightly improve an upper bound due to Beck, De Loera, Develin, Pfeifle, and Stanley. That is, every real root of $L_P(t)$ lies in $[-d,\lfloor\frac{d-1}{2}\rfloor)$. (iii) Let $\rho(P)$ be the smallest nonnegative real center such that the Taylor coefficients are nonnegative. If $\lambda_{\mathbb{R}}(f)$ denotes the largest real zero of $f(t)$, with value $-\infty$ when no such zero exists, then $\rho(P)=\max\{0,\max_{0\leq j<d}\lambda_{\mathbb{R}}\!(L_P^{(j)})\}$. (iv) We establish structural properties of the Taylor coefficients $\mathsf{A}_j(P;k)$, including derivative interlacing, palindromic reflection symmetries, and Laguerre and Newton inequalities. As a final note, these results provide a systematic partial answer to an open problem listed on the website of the American Institute of Mathematics.
Read the full abstract

Statistics Theory

Geometric Ergodicity of Affine Invariant Ensemble Langevin and its Discrete Time Variants

Affine-invariant ensemble samplers are widely used in Bayesian applications. However, their quantitative convergence theory, in particular geometric ergodicity, remains a basic open question. We study the affine invariant ensemble Langevin dynamics, an interacting particle system that uses the empirical covariance of the whole ensemble as a preconditioner. While effective in practice, theoretical understanding of this method is not available beyond plain qualitative convergence in total variation, with a central difficulty being that the empirical covariance can become degenerate. For potentials with bounded Hessian that are strongly convex outside a ball, we prove geometric ergodicity using a novel Lyapunov function that combines the inverse covariance with a coercive exponential energy. We then show that directly applying the Euler–Maruyama scheme can diverge with positive probability, even for a one-dimensional Gaussian target. This motivates a covariance-trace regularization in continuous time. We prove geometric ergodicity of the regularized diffusion and, for sufficiently small step size, of its unadjusted Euler–Maruyama discretization. We also show that the invariant distributions of the discretization converge weakly to the product target distribution as the step size tends to zero. Lastly, we provide an explicit discretization that is both affine-invariant and geometrically ergodic, based on an adaptive step size clamping.
Read the full abstract

Signal Processing

Generalized Hankel/Toeplitz matrix for array signal processing

In this paper, we introduce generalized Hankel/Toeplitz matrices (GHM/GTM) and the associated generalized Vandermonde decomposition for nonuniform array signal processing and multi-dimensional super-resolution. The proposed framework was discovered from the study of resolution limit theory and extends the classical Hankel/Toeplitz structure by allowing substantially more flexible sampling geometries while preserving the underlying low-rank Vandermonde factorization. Through devising an optimal algorithm based on this GHM framework, we derive the state-of-the-art upper bound estimate for the computational resolution limit (CRL) of source-number detection in general $d$-dimensional super-resolution problems. For segmented sampling sets, whose geometry is closely related to sparse and distributed arrays, we establish deterministic lower bounds for the minimum singular values of the associated generalized Vandermonde matrices and derive corresponding stability and number-detection guarantees for multi-clump source configurations. To address the computational bottleneck of conventional multi-level Hankel constructions in high dimensions, we further introduce randomized GHM constructions whose matrix dimensions scale with the effective degrees of freedom rather than with the full tensor-product grid, together with deterministic recovery guarantees conditional on the realized Vandermonde factors. We also extend the framework to source localization by developing GHM-based MUSIC algorithms for nonuniform measurements, with stability characterized through the conditioning of the generalized Vandermonde factors. Numerical experiments on synthetic data demonstrate that the proposed GHM-based methods achieve competitive resolution and recovery accuracy while substantially reducing matrix size and computational cost, especially in high-dimensional settings.
Read the full abstract

Machine Learning

DE-Venus: A Data-Efficient RLVR Framework for Large Language Models

Reinforcement learning with verifiable rewards (RLVR) improves large language model reasoning, but its practical scaling is constrained by expensive on-policy rollouts and the cost of obtaining reliable targets at scale. Existing methods address sample selection, incomplete supervision, or noisy labels separately, often entangling supervision logic with distributed training and hindering controlled comparison and reuse. We present DE-Venus, a unified framework for data-efficient RLVR that treats supervision as evolving state across data preparation and policy optimization. It organizes this lifecycle into three modules: Active Data Selection allocates training and annotation budgets; Weak Supervision Construction derives learning signals from unlabeled examples; and Training-Time Supervision Refinement filters or corrects unreliable supervision. DE-Venus supports seven representative methods and a data-selection pipeline by expressing method-specific decisions as offline dataset transitions or online transformations of targets, rewards, batches, and advantages while preserving verl's distributed execution contracts. Across public benchmarks and three business scenarios, separate configurations preserve or improve model quality with only 10% of labels or as little as 13% of relevant data; selected business configurations also reduce observed convergence steps by 63%–75%. DE-Venus thus reduces annotation and training costs without sacrificing scalable RL execution.
Read the full abstract

All authors Shenzhi Yang, Guangcheng Zhu, Kai Tang, Zhengqing Zang, Xing Zheng, Haobo Wang, Yingfan Ma, Bowen Song, Bo Han, Bo An, Lei Feng, Weiqiang Wang, Junbo Zhao, Gang Chen

Quantum Physics

Variable-Cliff Nielsen Geometry and an Exponent -4/3 Lower Bound for the Infinite-Cliff Diameter

Let $D=2^n$ and $M=3n+9\binom n2$. We study the right-invariant one-step-cliff metric $d_Q$ on $\operatorname{PU}(D)$, with unit penalty on Pauli weights one and two and penalty $Q$ on all higher weights. If $M/Q_D\to0$ and $MQ_D^{3/4}/D^2\to0$, then, for every fixed $0<x<\pi/\sqrt3$, \[ \mu_D\bigl(B_{Q_D}([I],x\sqrt{Q_D})\bigr)\le e^{-c_xD^2}. \] Here $\mu_D$ is normalized Haar measure. Thus the Haar-typical distance from the identity and the diameter are both asymptotic to $(\pi/\sqrt3)\sqrt{Q_D}$ throughout the window $M\ll Q_D\ll D^{8/3}M^{-4/3}$. Choosing $Q_D=\kappa D^{8/3}M^{-4/3}$ with sufficiently small fixed $\kappa>0$ yields a Haar-typical lower bound of order $D^{4/3}M^{-2/3}$ for the corresponding infinite-cliff Carnot–Carathéodory distance, outside an $e^{-\Omega(D^2)}$ exceptional set. The infinite-cliff diameter therefore has exponential lower rate at least $4/3$, disproving Brown's exponent-one conjecture. The same estimate gives a fixed-error no-ancilla two-qubit circuit lower bound of the same order.
Read the full abstract

Computation and Language

How Perturbations Propagate: A Multi-Level Analysis of Robustness in Large Language Models

Language models encounter typos, corrupted text, altered words, and disrupted token order, yet robustness is usually evaluated only through output behavior. We study how six naturalistic and synthetic input perturbations propagate through decoder-only language models at three levels: output behavior, hidden-state geometry, and attention-head function. We evaluate behavioral effects across four GPT-2 and two Qwen2.5 checkpoints, analyze layerwise geometry using centered kernel alignment and intrinsic dimension, and examine attention-head responses in GPT-2. Perturbation types produce distinguishable metric profiles that are not fully captured by output measures and are only partly consistent across the tested checkpoints. Copying scores show the strongest pooled associations with activation-patching recovery under token substitution and shuffling, although these associations do not isolate copying-specific effects. Gradient-guided HotFlip perturbations also cause stronger behavioral and representational disruption than rate-matched random token substitutions in GPT-2; their behavioral effects are consistent across all six tested checkpoints. Our results show that robustness claims based on a single behavioral or representational metric can be misleading, and motivate multi-level evaluation of how perturbations alter language-model computation.
Read the full abstract

All authors Dun Li Chan, Emily Liu, Niyathi Allu, Christian Hoang

Computation and Language

Decoupling Turn-Taking from Semantics: A Decoupled Data Approach for Finite-State-Machine-Based Full-Duplex Dialogue

The Neural Finite State Machine (NFSM) framework offers a pragmatic path to full-duplex dialogue by serializing turn-taking control and response generation onto a single causal tape under the standard next-token prediction objective, thereby preserving semantic prowess at a low fine-tuning cost. However, its reliance on synthetic text data fundamentally limits turn-taking naturalness, as Large Language Models (LLMs) cannot faithfully simulate the fine-grained acoustic temporal dynamics of real human dialogues. In this work, we propose a decoupled data approach that learns turn-taking from real Human-Human (HH) spoken dialogues while shaping semantic behavior through configurable Human-Agent (HA) text dialogues. To operationalize this approach, we introduce a rule-based event-guided data transformation method that serializes HH spoken dialogues into FSM tapes by classifying turn-taking events and applying deterministic mapping rules, enabling scalable supervision without LLM-generated annotations. We further propose a Source-Aware Calibrated (SAC) Loss that jointly calibrates the long-tailed distribution of state transition tokens and channels each data source toward the capability it best supervises. Experiments show that our approach substantially improves turn-taking proficiency while recovering the foundation LLM's semantic capability. Our code and model are available at https://github.com/Liyht/def-fsm.
Read the full abstract

Sound

Beyond .WAV: Design and Software Verification of VocalCap, a Traceable Browser-Based Audio Capture System for Vocal Biomarker Research

Remote voice studies often retain a final audio file with limited evidence about how it was captured, transferred, processed, and accepted. This paper presents VocalCap, an institution-controlled, browser-based system for self-guided capture of voice and related acoustic signals by participants without technical training. A versioned protocol drives the workflow. Each accepted recording retains a browser-native object, a client-lossless Float32 WAV derived from the same MediaStream, and a server-canonical mono PCM16 WAV, linked to evidence of capture execution, technical quality, byte-level integrity, recovery, and transformation provenance. IndexedDB preserves accepted browser artifacts until server confirmation, while session completion requires successful verification of every task and artifact. Software tests challenged the acquisition contracts with malformed or altered objects, exact-zero interruptions, channel-topology variants, and interrupted or repeated operations. A post hoc technical audit of 39 consented pilot recordings found 25 sample-identical stereo files and 14 files with signal confined to the left channel. Topology-aware active-channel selection limited the canonical root-mean-square level difference to less than 0.001 dB in all 14 affected files; equal-weight stereo averaging would have introduced approximately 6.02 dB of attenuation. Production end-to-end verification completed two five-task profiles in Chromium and WebKit, yielding 10 accepted recordings and 30 retained artifacts that passed server-side integrity and format checks. The results verify VocalCap's software behavior under the tested browser-engine conditions. Device-level acoustic agreement, target-population usability, clinical validity, and biomarker performance remain subjects for separate studies.
Read the full abstract

Systems and Control

On the Degree of Safety: Beyond Safe or Unsafe with Control Barrier Functions

A valid control barrier function (CBF) certifies if its represented safe set can be rendered forward invariant, and the sign of its value indicates whether a state is safe or not, but it does not quantify a degree of safety beyond the binary indication. In this paper, we show that among valid CBFs representing the same safe set, interior values and gradients can be changed arbitrarily, so neither quantity determines a degree of safety that is independent of how the set is represented. We also show that whether a candidate CBF-based inequality constraint is feasible does not by itself quantify a degree of safety. In particular, infeasibility can occur either because the safe set is not controlled invariant or because the candidate CBF representation fails. This motivates our distinction between intrinsic and representational infeasibility. Finally, we introduce the invariance authority demand (IAD), a representation-independent degree of safety that quantifies the control authority required for maintaining safety and can be used to guide actuator redesign or safe set repair.
Read the full abstract

Distributed Computing

Iapetus: Content-Aware Hierarchical Scheduling for Collaborative ViT Inference in LEO Satellite Networks

Collaborative inference pools distributed resources to run compute-intensive Vision Transformers (ViTs) in satellite edge computing. Model partitioning enables such collaboration by assigning consecutive layer groups to different nodes, but the large volume of intermediate activation data incurs substantial transfer overhead that can erase its benefit. Token compression reduces downstream computation and activation transfer, but its quality impact depends on input content, model depth, and earlier pruning decisions, while layer offloading must adapt to time-varying contact and battery conditions. We present \sys, a content-aware hierarchical scheduler that screens constellation-wide options to retain a bounded candidate set, then refines each candidate into a complete token compression and layer offloading trajectory using quality prediction and joint planning. A unified objective balances per-task latency, energy, and quality loss against accumulated workload and battery pressures. We implement \sys on an NVIDIA Jetson AGX Orin hardware-in-the-loop testbed and use its validated execution model for constellation-scale trace replay across multiple ViT workloads and constellation settings. At \(5\)~tasks/s, \sys accomplishes 91.6% of released tasks, 26.1 percentage points above MARATD3, the strongest baseline, while reducing mean latency and battery draw by 53.0% and 70.8%, respectively, and meeting quality targets.
Read the full abstract

All authors Yan Chen, Yunxiang Zhang, Guanjun Jiang, Haiquan Wang

Quantum Physics

Efficient Estimation of Reduced QAOA Expressibility on Acyclic Graphs

Classically equivalent formulations of an optimization problem need not lead to equivalent quantum algorithms. For MaxCut, fixing the value of a single vertex removes a simple global symmetry without changing the underlying optimization problem, yet it can substantially alter the quantum dynamics generated by the Quantum Approximate Optimization Algorithm (QAOA). These dynamics are captured by the circuit's dynamical Lie algebra (DLA), whose direct construction can become exponentially expensive. Here we show that, for symmetry-reduced QAOA on trees, substantial information about the reduced DLA can instead be obtained efficiently from the graph alone. We introduce a polynomial classical algorithm that recursively distinguishes vertices using shortest path structure and degree parity. When all vertices are resolved individually, the method determines the complete reduced DLA and, under the corresponding graph conditions, certifies maximal expressibility of the reduced QAOA ansatz. Even when full resolution is not achieved, the algorithm identifies embedded subalgebras, provides rigorous lower bounds on DLA dimension, and certifies controllable subsystems. Our theoretical and experimental results show how classical graph structure can be used to diagnose and potentially guide the quantum dynamics of variational algorithms before running them on quantum hardware.
Read the full abstract

All authors Bao Bach, Boris Tsvelikhovskiy, Jose Falla, Ilya Safro

Complex Variables

A Hopf Lemma for Holomorphic Maps into Hyperquadrics

More than twenty years ago, Baouendi and the first author proved that a holomorphic map between hyperquadrics of the same signature is either totally degenerate or has a nonvanishing normal derivative for its normal component. This established a CR analogue of the classical Hopf lemma in arbitrary codimension, in the absence of pseudoconvexity. They further conjectured that the same Hopf-type property holds for holomorphic maps between Levi-nondegenerate hypersurfaces of the same signature. In this paper, we provide a counterexample to this conjecture in full generality. We also prove the conjecture when the target hypersurface is a hyperquadric of any codimension, arguably the most important case for applications.
Read the full abstract

Distributed Computing

Lantern: Finding Committable Transactions via Back-Propagation on DAGs

Existing concurrency control protocols either introduce nondeterminism, resulting in a serial execution-replay dependency between primary and replica nodes, or rely on impractical prior knowledge of transaction read-write sets. In this paper, we present Lantern, a deterministic concurrency control protocol tailored for high-performance transaction processing systems operating without prior knowledge. The key insight of Lantern is that all zero-out-degree transaction vertices in the local dependency graph can be safely committed in ascending order using an overwrite-permissive strategy. We further introduce a novel Back-Propagation mechanism that iteratively propagates dependency states from sink to source vertices to identify additional committable transactions. We also propose Conflict-Free Batch Selection (CFBS) for read-modify-write intensive scenarios. We integrate Lantern into the open-source blockchain platform ChainMaker. Extensive evaluations on YCSB and SmallBank benchmarks demonstrate that Lantern achieves up to a 4.2x throughput speedup over Aria and improves the throughput of ChainMaker's execution layer by at least 2.2x.
Read the full abstract

All authors Denglong Li, Gerui Wang, Tian Guan, Mingchao Wan

Quantum Physics

Quantum Vacuum Nonlinearities in Laser Interferometers

We propose all-optical tests of photon-photon interactions in the matter vacuum using standing-wave laser interferometers, which do not require external magnetic fields and use conventional laser sources. We show that the interferometric detection of photon-photon scattering predicted by quantum electrodynamics is within reach of laboratory-scale experiments with a sensitivity that improves nonlinearly with the circulating power within the cavity. We outline how such an experiment could be adapted to probe properties of quantum fields beyond the Standard Model of particle physics.
Read the full abstract

Information Retrieval

SelfDR: Self-Distillation from Reasoning for LLM-Based Recommendation

Large Language Models (LLMs) have recently emerged as powerful backbones for recommendation. To better elicit their capabilities, reasoning has been widely incorporated to help LLMs interpret rich textual signals and improve recommendation accuracy. However, explicitly generating intermediate reasoning traces often incurs substantial computational costs, which limits practical deployment in real-world recommender systems. To address this challenge, we propose SelfDR, a Self-Distillation from Reasoning framework for LLM-based Recommendation. SelfDR distills an LLM's own reasoning-enhanced predictions to produce recommendations directly, improving recommendation effectiveness while maintaining inference efficiency. All components in the framework are built on the same base LLM, without relying on any external models. Specifically, the teacher recommender is constructed by training a reasoner with downstream performance as the reward, enabling it to generate targeted rationales that are later incorporated into the teacher's input. A student recommender for direct recommendation, with the same underlying model, then learns from the teacher through self-distillation with a dynamic weighting strategy. Extensive experiments on three public datasets validate the effectiveness, rationality, and efficiency of SelfDR. Codes are available at https://github.com/JiangDeccc/SelfDistillation.
Read the full abstract

All authors Chumeng Jiang, Jiayin Wang, Xinjie Lin, Zhiqiang Guo, Hengliang Luo, Min Zhang

High Energy Physics (Phenomenology)

Statistical Symmetry Breaking and Emergent Colored Noise in a Stochastic Scalar-Doublet Field Theory

We investigate a relativistic stochastic field theory in which a complex scalar doublet is coupled to a complex white-noise source. The action preserves Lorentz and $\mathrm{U(1)}\times\mathrm{SU(2)}$ symmetries at the statistical level, whereas the corresponding Euler-Lagrange equations exhibit symmetry breaking along individual stochastic realizations. Within a gauge-field-free sector introduced to obtain analytical solutions, we show that the scalar doublet undergoes a noise-driven random walk in field space, leading to a finite, time-dependent ensemble average of its magnitude. As an illustrative application, we further investigate the coupling of the stochastic scalar field to fermions through a Yukawa interaction. The scalar-field solution naturally separates into a tail component, which contributes as an effective mass-like term, and a light-cone component, which acts as a colored-noise source that induces a spatially correlated stochastic phase in the fermion wave function. The statistical properties and correlation length of this emergent colored noise are derived analytically within the adopted approximations. The present work provides an exploratory study of statistical symmetry breaking and emergent colored-noise dynamics in a relativistic stochastic scalar-doublet field theory.
Read the full abstract

Information Retrieval

DoPR: Reusable Compressed Document Prefixes for Efficient LLM Reranking

Large language models (LLMs) are effective rerankers, but pointwise reranking repeatedly processes the same document across different queries, causing substantial redundant document-side computation. We propose DoPR, a compressed document prefix framework that decouples offline document processing from online reranking. DoPR first selects query-independent document representations and converts them into compressed document prefix states, which are precomputed offline and reused whenever the document is retrieved. During online reranking, the model scores each query-document pair by processing only the query and scoring token, with document information supplied by the stored prefix states. This design reduces online cost through both document-side compression and cross-query prefix-state reuse. Experiments on TREC DL, BEIR, and BRIGHT with Qwen3 models from $0.6$B to $8$B show that DoPR achieves up to 8.0$\times$ online document-side memory reduction and up to 8.04$\times$ latency speedup, while retaining 97.1%-99.5% of the average NDCG@10 of matched full-document rerankers.
Read the full abstract

All authors Beiya Dai, Yifan Wei, Guang Yang, Xing Shi, Xinbing Wang, Zhouhan Lin

Solar and Stellar Astrophysics

NGC 1901: A new benchmark cluster for gyrochronology in the TESS Southern continuous viewing zone

We use Gaia DR3 astrometry and TESS time-series photometry to study NGC 1901, a sparse open cluster in the TESS Southern continuous viewing zone, that has been neglected due to its proximity on the sky to the Large Magellanic Cloud. We refine its membership list and measure rotation periods for 32 high-confidence rotating stars. By applying the gyro-interp empirical model, we calculate a gyrochronal age of 830 $\pm$ 50 Myr. Because NGC 1901 possesses a sub-solar metallicity of [Fe/H]$\approx -0.11$, its excellent agreement with empirical models suggests that temperature-period relations mitigate metallicity effects for Sun-like stars. Our results place NGC 1901 in the gap between the benchmark open clusters Praesepe (670 Myr) and NGC 6811 (1 Gyr). We find that the rotation sequence exhibits significant spin-down stalling in late K dwarfs, supporting models of core–envelope recoupling. Furthermore, our findings provide constraints for the cluster's structural evolution, including its recently identified tidal tail and corona. This study establishes NGC 1901 as a new benchmark for calibrating the next generation of gyrochronal models.
Read the full abstract

All authors Mara Bernizzoni, Timothy R. Bedding, Prasad Mani, Luke G. Bouma, Courtney L. Crawford, Jason Lee Curtis, Benjamin T. Montet, Samir Nepal

Software Engineering

TIPCODER: Reinforcement Learning Boosted Test-time Instruction Proposer for Code Generation

Test-time scaling for code generation typically explores the solution space by sampling multiple programs from a fixed instruction. We study a complementary direction: instance-level instruction-space exploration. Our observation is that many coding failures stem from missing constraints, overlooked edge cases, or misleading reasoning paths induced by the original prompt. To address this, we propose TipCoder, a test-time instruction proposer that generates problem-specific auxiliary tips before code synthesis. TipCoder distills multi-turn debugging trajectories into proactive guidance and further optimizes the Proposer with reinforcement learning using a marginal-utility reward. At inference time, it generates both a base solution and a tip-guided solution, and applies a Reward Model for post-hoc selection. This exploration-selection design allows tips to expose additional candidate potential while reducing regressions from unnecessary guidance. Across the evaluated code-generation benchmarks and target Code LLMs, TipCoder provides a consistent instruction-level test-time scaling strategy, comparing favorably with stochastic sampling and generic prompt optimization baselines under a shared reward-model-based selection protocol.
Read the full abstract

All authors Minyu Chen, Sihao Wu, Ling-I Wu, Song Qin, Jingyang Li, Lei Ning, Jianxin Xue, Guoqiang Li

Machine Learning

Risk and Anomaly Identification for Distribution Network Optimal Operation Based on Reinforcement Learning and Uncertainty Quantification

Reliable operation of modern distribution networks requires timely identification of operational risks and anomalous events under pervasive uncertainty. In practice, operators must identify risks that are inherent in stochastic yet in-distribution conditions, and anomalies that correspond to out-of-distribution behaviors such as unusual load patterns, extreme weather or cyber-physical attacks. This paper addresses this joint risk and anomaly identification problem for optimal distribution network operation and proposes a deep reinforcement learning framework that is explicitly uncertainty aware. We integrate distributional and Bayesian deep reinforcement learning to realize a second- order uncertainty quantification scheme that decomposes total uncertainty into aleatoric and epistemic components, which are respectively used to characterize inherent risk and out-of- distribution anomalies. The resulting epistemic estimates drive both exploration during training and out-of-distribution detec- tion with fallback control during deployment, whereas aleatoric estimates are used to characterize intrinsic operational risk. Simulation results demonstrate the performance of our DRL agent and the effectiveness of the uncertainty quantification.
Read the full abstract

Materials Science

Grain boundary evolution in nanoparticles

Grain boundary evolution is a key dynamical process that enables structural rearrangements in nanoparticles and drives them towards low energy configurations. Grain boundaries can also enhance catalytic properties, making it important to understand the elementary processes underlying their evolution for grain boundary engineering in nanoparticles. Compared with bulk materials, nanoparticles have additional rotational and translational degrees of freedom, can accommodate structural changes through shape relaxation, and grain boundaries terminate at free surfaces. However, the atomic-scale mechanisms of GB evolution under these less constrained conditions remain comparatively less understood than in bulk materials. Here, using atomistic simulations, we focus on low energy $\Sigma3$ (coherent twin boundary) and $\Sigma11$ grain boundaries, which are among the persistent compact GB structures that emerge during nanoparticle structural evolution. We identify two fundamental atomic displacements, column shift (C) and screw shift (S), that recur during the evolution of these grain boundaries and their junctions. These displacements occur through different atomic pathways and combine in different ways to generate grain boundary migration, structural transformations, and junction evolution. In particular, the same initial and final grain boundary configurations can be connected through different atomic pathways, and a column shift can occur either as a full shift or through disconnection kinks. C and S remain identifiable even when the grain boundary character changes, for example during a $\Sigma11$ to $\Sigma3$ transformation. An understanding of these elementary GB processes can help identify strategies to control grain boundary evolution and thereby engineer GB structures in nanoparticles.
Read the full abstract

Machine Learning

Geometry-Aware Graph Construction via Adaptive Spectral Bandwidth Control

Kernelized graph methods - spectral clustering, diffusion maps, and sparse kernel -regression graphs - that use Gaussian kernels depend on the choice of Gaussian bandwidth sigma, which governs the spectral character of the local kernel operator. When sigma is too small, the kernel overestimates local complexity and treats each sample as an independent direction; when sigma is too large, the kernel collapses multiple directions together, the condition number diverges, and all geometric discrimination is lost. We propose a choice of scale to make the spectral complexity of the kernel consistent with the intrinsic complexity of the underlying manifold. We propose a per-node bandwidth criterion that operationalizes this principle by jointly matching the kernel's effective rank to the local intrinsic dimension estimated via minimum spanning tree, anchoring the search in the manifold-consistent log-log scaling regime. We evaluate SSL embeddings from six encoders on CIFAR-100, showing that adaptive bandwidth consistently improves leave-one-out (LOO) classification and label propagation (LP) accuracy over fixed-bandwidth methods and competing adaptive methods.
Read the full abstract

Algebraic Geometry

Log canonical models of a fixed variety with varying boundaries

Motivated by extending the Morrison-Kawamata cone conjecture beyond Calabi-Yau varieties and Severi-Maehara type finiteness results to targets not necessarily of general type, we fix a smooth projective variety and study the finiteness of its log canonical models as klt boundaries vary. Our main result establishes finiteness for every smooth projective minimal surface. For each $\kappa\in\{-\infty,0,1\}$, we construct a smooth projective non-minimal surface of Kodaira dimension $\kappa$ with infinitely many log canonical models, showing that the minimality assumption cannot be omitted in general. We also investigate possible extensions of this finiteness result to higher dimensions.
Read the full abstract

Computational Geometry

AnyGS2Mesh: Feed-Forward Mesh Reconstruction from 3D Gaussian Splatting with Arbitrary-Resolution Views

Existing 3D mesh reconstruction methods from Gaussian scene representations predominantly rely on iterative optimization, resulting in slow inference and limited scalability to high-resolution inputs. In this paper, we present AnyGS2Mesh, the first feed-forward framework for directly reconstructing 3D meshes from 3D Gaussian Splatting representations with support for arbitrary input image resolutions. Our approach incorporates a Gaussian-Guided Transformer architecture that exploits explicit 3D geometric priors for efficient mesh generation. We introduce three key components: (1) a Gaussian-Guided Spatial Reasoning Transformer represents Gaussian primitives as structured 3D tokens and jointly reasons over Gaussian and image features; (2) a Streaming and Patchwise Geometry Encoder processes native-resolution views sequentially and aggregates information across variable-length view sets; (3) a Scale-Aligned Hybrid Depth Refiner uses a PatchFusion-style encoder–decoder to fuse RGB-conditioned predicted depth with Gaussian-rendered metric depth, combining fine local structures with globally consistent metric scale. The refined depth maps are integrated through TSDF fusion, followed by Marching Cubes for deterministic mesh extraction. Extensive experiments show that AnyGS2Mesh achieves state-of-the-art reconstruction quality while significantly reducing inference time compared with optimization-based baselines, enabling near-real-time, high-quality mesh reconstruction. Our results demonstrate the potential of combining Gaussian representations and feed-forward Transformer architectures for scalable 3D geometry reconstruction. The code will be made publicly available upon acceptance.
Read the full abstract

All authors Yuxuan Song, Fan Gao, Yibo Zhao, Jiarui Wen, Youcheng Cai, Ligang Liu

Instrumentation and Detectors

Multi-Angle Beam Scanning Transmission Electron Microscopy for Diffraction-Contrast-Free Magnetic Imaging

Recent development of the differential phase contrast (DPC) scanning transmission electron microscopy (STEM) technique has significantly advanced materials science supported by high-sensitivity detectors and powerful data processing. Especially the 4D-STEM technique, employing a pixelated camera as a STEM detector, enables extensive information acquisition through post-processing of large datasets. However, magnetic or electric field imaging using DPC is often disturbed by diffraction contrasts intrinsic to the crystalline material. In this paper, we demonstrate elimination of the diffraction contrasts for magnetic field imaging by using angularly distributed multiple electron beams generated by a multi-hole aperture within the 4D-STEM framework. This multi-angle beam configuration suppresses irrelevant crystalline contrast and yields direct magnetic information with high sensitivity from the specimen. The resulting 4D-STEM datasets also enable additional analysis of sub-beam size magnetic domain structures, domain walls, and diffraction-related information.
Read the full abstract

Computer Vision

Tensor-based Brain Surface Modeling and Analysis

We present a unified computational approach to tensor-based morphometry in detecting the brain surface shape differences between two clinical groups based on magnetic resonance images. Our approach is novel in a sense that we combined surface modeling, surface data smoothing and statistical analysis in a coherent unified mathematical framework. The cerebral cortex has the topology of a 2D highly convoluted sheet. Between two different clinical groups, the local surface area and curvature of the cortex may differ. It is highly likely that such surface shape differences are not uniform over the whole cortex. By computing how such surface metrics differ, the regions of the most rapid structural differences can be localized. To increase the signal to noise ratio, diffusion smoothing based on the explicit estimation of Laplace-Beltrami operator has been developed and applied to the surface metrics. As an illustration, we demonstrate how this new tensor-based surface morphometry can be applied in localizing the cortical regions of the gray matter tissue growth and loss in the brain images longitudinally collected in the group of children.
Read the full abstract

All authors Moo K. Chung, Keith J. Worsley, Steve Robbins, Alan C. Evans

Computers and Society

Multilingual Agent System for Inclusive Wildfire Evacuation Guidance

Wildfire seasons have become 84 days longer in the current days than in the 1970s, causing enormous threats to one's financial status and short- and long-term health. During the fire, public agencies send out emergency messages to provide warnings and orders. Although 26 million people in the US have limited English proficiency, over 80% of those messages are only delivered in English, which can cause disproportionate information distribution and awareness. In order to better serve marginalized communities during emergencies, the authors developed BEACON, a service that provides comprehensive and personalized evacuation guidance, including navigation routes, personalized checklists, and a chatbot in the language that a user uses. Our current system ingests data including fire perimeter information, evacuation order status, and shelter information from Watch Duty. When a user is within a certain proximity from the fire, the system utilizes real-time GPS locations and nearby weather data from the National Oceanic and Atmospheric Administration (NOAA) to predict fire danger levels. The assessment model refreshment are dynamically scheduled based on fire progress and trends using XGBoost. If the location has a likelihood of fire danger, the system sends alerts with evacuation routes outputted from a polygon-avoidant routing pipeline. The application provides a context-aware multilingual agent that users can communicate with and is tightly connected to other features of the application. In addition, based on data that the user entered, the system dynamically generates and checks off personalized reminder items to provide an organized evacuation plan. The system's user interface dynamically changes its language settings based on the language the user most recently used in either setting or chatbot conversation for all the application elements.
Read the full abstract

All authors Shruti Kulkarni, Lynn Tong, Aditi Namboodiripad, Chelyah Miller, Helen Lin, Peeyush Patel, Bogdan Bistriceanu, Diane Myung-kyung Woodbridge