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

Distributed Computing

Agentic Autoscaling through Worker-Pool Orchestration for LLM-driven Text Classification in Cloud Computing Environments

The growing adoption of large language model (LLM)-based systems for large-scale text processing has created a critical need for dynamic autoscaling to manage high-latency, bursty, and computationally intensive workloads. This paper proposes an agentic autoscaling framework through worker-pool orchestration for LLM-driven text classification. The framework integrates a priority task queue, a dynamic pool of agent workers, a real-time metrics collector, and an application-layer autoscaler. Its classifier-agnostic design supports both zero-shot and fine-tuned language models without modifying the autoscaling logic. The framework is evaluated using Autoscaling+BART and Autoscaling+DeBERTa against static allocation and standalone RoBERTa and DistilBERT baselines. On the AG News dataset, Autoscaling+BART achieves 84.5% accuracy, while Autoscaling+DeBERTa improves it to 90.5%. On the SMS Spam Collection dataset, Autoscaling+DeBERTa achieves 99.5% accuracy, whereas Autoscaling+BART attains 84.5% accuracy with lower execution time. Overall, the proposed framework consistently outperforms the baseline approaches in resource efficiency while maintaining high classification performance, demonstrating that elastic worker-pool orchestration provides an effective and cost-efficient solution for scalable LLM-driven text classification in cloud environments.
Read the full abstract

High Energy Physics (Phenomenology)

Dalitz decays of vector heavy quarkonia into $\chi_{QJ}(1P)$ in the Bethe-Salpeter approach

We systematically investigate the Dalitz decays of vector heavy quarkonia into $\chi_{QJ}(1P)\ell^+\ell^-$ ($Q=c,b$; $J=0,1,2$; $\ell=e,\mu$) within the instantaneous Bethe–Salpeter framework. The study covers $\psi(2S)$, $\psi(1D)$, $\Upsilon(2S)$, and the so-far unobserved $\Upsilon(1D)$ states. For $\psi(2S)$ electron channels, our predictions are in excellent agreement with BESIII data. We further provide the first relativistic predictions for $\psi(1D)$ decays, with branching ratios for several electron channels reaching the $10^{-5}$ level, which is accessible at current BESIII statistics. For bottomonium, $\Upsilon(2S)\to\chi_{bJ}e^+e^-$ decays yield branching fractions of $\mathcal{O}(10^{-4})$, suggesting potential observability at Belle~II. Muonic channels are also discussed, with kinematic constraints carefully addressed. Our results establish a coherent theoretical basis for future experimental searches for heavy quarkonium Dalitz decays.
Read the full abstract

All authors Xin-Wen Wang, Wen-Yuan Ke, Su-Yan Pei, Tianhong Wang, Qiang Li, Guo-Li Wang

Computation and Language

Forty Shades of Blue: Quality-Diversity Alignment via Mode-Conditioned Reinforcement Learning

A notable byproduct of LLM alignment training is mode collapse: the progressive loss of output diversity that narrows a model's expressivity at inference time. This degradation is especially limiting for applications requiring open-ended exploration and pluralistic perspectives, such as scientific ideation and creative writing. We present MoDA (Mode-conditioned Diversity Alignment), an online post-training RL algorithm that jointly optimizes generation quality and diversity, inspired by the coordination perspective in multi-agent reinforcement learning (MARL). MoDA trains a single shared LLM policy conditioned on abstract numbered roles, where each role acts as an agent competing to produce outputs distinct from the others. This formulation encourages mode-conditioned agents to explore complementary regions of the high-quality output space without requiring hand-crafted personas or architectural modifications. MoDA employs a prompt-adaptive quality gating mechanism that calibrates a reference quality threshold and grants diversity rewards only to responses that meet the threshold, preventing reward-hacking behaviors that compromise response quality. To study quality-diversity tradeoffs, we evaluate MoDA on a comprehensive suite of benchmarks spanning seven general capability tasks and four domain-specific diversity tasks in scientific ideation and creative writing. MoDA improves SBERT diversity by 265% on the Infinite-Chat held-out prompts, while increasing average general capability pass@1 by 10.3% over the Qwen3-8B baseline. Compared with the strongest DivPO baseline, MoDA improves SBERT diversity from 0.274 to 0.482 (+75.9%) and E-Vendi from 2.86 to 4.4 (+53.8%), while improving average general capability pass@1 by 7.0%. Overall, MoDA provides a drop-in alternative to standard post-training methods that preserves and expands the model's expressive output space while improving quality.
Read the full abstract

All authors Jiayi Yuan, Hangoo Kang, James Jihao Liu, Yejin Choi, Vikram Iyer, Liwei Jiang, Natasha Jaques

Algebraic Geometry

Level structures on tropical abelian varieties

We introduce level structures on tropical abelian varieties and give a modular interpretation of $A_g[m]^{\mathrm{trop}}$, the tropicalization of the moduli space $\mathcal{A}_g[m]$ of principally polarized abelian varieties with level $m$ structure. We study the case of abelian surfaces in greater depth. The link of $A_2[m]^{\mathrm{trop}}$ is an explicit simplicial complex whose vertices are the primitive vectors of $(\mathbb{Z}/m\mathbb{Z})^4$ up to sign. As a topological space, this link is homotopic to a wedge sum of closed orientable surfaces and circles; we compute the number of each of these and the genera of the surfaces. We deduce the weight zero compactly supported rational cohomology of $\mathcal{A}_2[m]$, completing a calculation of Oda-Schwermer from 1990.
Read the full abstract

All authors Eran Assaf, Madeline Brandt, Juliette Bruce, Melody Chan, Raluca Vlad

Distributed Computing

Stability-Aware Proactive Autoscaling Using a Double Deep Q-Network in Cloud Computing Environments

Dynamic workloads and latency-sensitive applications require efficient autoscaling in cloud computing environments. However, most existing approaches rely on reactive mechanisms based on static thresholds, resulting in delayed responses and scaling oscillations under workload uncertainty. To address these limitations, we propose a double deep Q-Network-based proactive autoscaling approach (DDQN-Proactive) along with Resource Removal Strategy (RRS). The proposed (DDQN+RRS) enhances decision-making by decoupling action selection from value evaluation, enabling more stable and adaptive scaling. Experimental results demonstrate that the proposed method outperforms both reactive and existing proactive approaches. Specifically, DDQN+RRS achieves a lower Service Level Agreement (SLA) violation rate (11.81%), higher CPU utilization (52.23%), improved scaling stability, fewer scaling events (2,488), and reduced pod restarts (1,246). Furthermore, the approach ensures smoother autoscaling behavior by significantly reducing oscillations over time (0-60 s). While reactive methods exhibit substantial fluctuations in pod allocation, Reactive reduces these variations, and DDQN+RRS achieves the most stable and smooth scaling, particularly during the 15-30 s, 40-45 s, and 55-60 s intervals.
Read the full abstract

Number Theory

A proof of Sylvester's conjecture

We prove Sylvester's conjecture, originating in his 1879 study of ternary cubic equations, that every prime $p\equiv4,7,8\pmod9$ is a sum of two rational cubes. Elkies announced a proof for the classes $4$ and $7$ in 1994, and Yin recently supplied a complete proof. For the remaining class $p\equiv8\pmod9$, we prove that the elliptic curve $E_p:y^2=x^3+p^2/4$ has analytic rank one, as predicted by the Birch and Swinnerton-Dyer conjecture, and so $p$ is a sum of two rational cubes. The proof begins by adapting the auxiliary Rankin–Selberg construction from the authors' work on the rank one converse for CM elliptic curves. The Rankin–Selberg $L$-function factors as the $L$-function of $E_p$ times a complementary $L$-function. Chan's $3$-isogeny descent and the rank zero converse show that the complementary central $L$-value is non-zero, and so it suffices to prove that a cubic component of the associated Heegner point is non-torsion. A basic difficulty is that the unweighted Hecke trace of the underlying CM orbit vanishes. Our decisive idea is to take $\lambda$-division before taking the trace, where $\lambda=1-\omega$ and $\omega$ is a primitive cube root of unity. We prove that the resulting division boundary is non-zero by analysing Frobenius at $p$. The Galois action on the CM orbit and ramification theory then transfer this non-vanishing to the cubic component.
Read the full abstract

Analysis of PDEs

An explicit solution of the five-expert prediction PDE and the exact optimality set of COMB

In this paper, we derive an explicit solution of the stationary prediction with expert advice PDE for five experts. The formula is given in three regions. In the first two regions, it is the four-expert solution plus a single integral with an elementary positive density. In the third region, it is a finite sum of hyperbolic products whose coefficients are determined by one scalar quadrature. Our formula establishes that the rank ordered adversary $(1,0,1,0,0)$ achieves the Hamiltonian maximum in the PDE everywhere in the ordered sector, while the COMB strategy $(1,0,1,0,1)$ is optimal only on a lower dimensional subset of the sector (where $x_1=x_2$ and $x_3=x_4$). The verification of the Hamiltonian inequalities is a tedious task, part of which is completed with a computer assisted proof. The verification reduces to 21 scalar inequalities, which we prove using 147 exact rational Bernstein polynomial certificates. The exact certificates and their independent arithmetic checks are included in a supplement to this paper, and a Lean 4 formalization machine-checks the verification and both main theorems, apart from the viscosity characterization.
Read the full abstract

Optics

Gaussian-splatting ptychography via explicit and interpretable primitives

Ptychography overcomes the limits of lenses by co-designing optics and computation. Yet prevailing implementations reconstruct on a pixel grid, where weakly-constrained modes drift and recovery demands redundant data. Here we introduce Gaussian-splatting ptychography, representing object and probe as Gaussian primitives. Relocation concentrates primitives where structure is dense, and overlapping primitives couple neighbouring pixels to suppress mode drift. The scheme unexpectedly restores the low-frequency phase that conventional approaches lose, enabling uniform phase transfer across spatial frequencies. The probe is represented and updated in its pupil plane from a random start. In Fourier ptychography, the pupil-plane model recovers severe aberrations where pixel-grid solvers fail. In conventional optical, X-ray and electron ptychography, the pupil-plane primitives also recover the real-space probes with no model of beam-forming optics. The representation cuts memory up to 14-fold and recovers specimens from fewer acquisitions. At electron wavelengths, it resolves atomic structure at tens of electrons per square angstrom.
Read the full abstract

All authors Qianhao Zhao, Zhixuan Hong, David Brady, Changhuei Yang, Andrew Maiden, Zhongtian Zheng, Ruihai Wang, Daniel Gage, Mary Lipton, Christopher Anderton, Arunima Bhattacharjee, Guoan Zheng

Dynamical Systems

Joining rigidity for rational maps

We initiate a joining rigidity theory for rational maps on the Riemann sphere $\mathbb P^1=\mathbb P^1(\mathbb C)$. Let $f_1,f_2\colon\mathbb P^1\to\mathbb P^1$ be rational maps of degree at least $2$, and $\mu_1,\mu_2$ their respective measures of maximal entropy, whose supports are the Julia sets $J(f_1)$ and $J(f_2)$. We study ergodic joinings of the systems $(J(f_1),f_1,\mu_1)$ and $(J(f_2),f_2,\mu_2)$, namely ergodic probability measures on $J(f_1)\times J(f_2)$ which are invariant under $f_1\times f_2$ and whose marginals are $\mu_1$ and $\mu_2$. Our main theorem shows that a positive-mass local holomorphic relation forces algebraic rigidity. More precisely, if the joining charges the graph of a local biholomorphism, then that local relation globalizes to an invariant algebraic curve and yields either a finite cycle of rational graph or transpose-graph relations, or a genuinely multi-valued invariant algebraic correspondence. If no local biholomorphic graph has positive joining measure, then the joining generates a compact non-discrete family of local holomorphic relations. The proof introduces normalized inverse branch transfer maps and studies their cluster limits. Starting from a local biholomorphic graph of positive joining measure, recurrence and contraction of inverse branches produce recurrent local intertwining relations. These are promoted to an algebraic relation by a local-to-global rigidity argument in the non-Lattès case and by affine uniformization in the Lattès case. In the absence of any positive-mass local biholomorphic graph, the cluster family must be infinite, and its non-discrete closure gives the second alternative.
Read the full abstract

Databases

Chronos: Efficient Bolt-on Branching Across Data Stores for Stateful Agentic Applications

Data-centric applications increasingly use speculative execution to explore multiple candidate paths where each path modifies state distributed across heterogeneous data stores. This trend is intensified by the rise of tool-calling agents. Hence, applications need data systems that can create branches quickly, isolate state-modifying paths, and merge changes consistently across stores without imposing substantial query overhead. Existing systems provide only partial support, forcing applications to coordinate branches and merges manually, which increases overhead and risks inconsistent cross-store state. To solve this problem, we introduce Chronos, a bolt-on system that provides branching capability across heterogeneous data stores. We make two contributions. First, Chronos introduces a compact interval-based versioning technique that enables efficient branching and data sharing through simple query rewrite. Second, Chronos introduces a bolt-on architecture that separates branch management from data path within each store. Combined with interval-based versioning, this separation provides atomic cross-store visibility for merges and enables Chronos to support diverse data stores without modifying their engines. We implement Chronos for PostgreSQL, SQLite, DuckDB, Qdrant, and a DBMS-backed filesystem. We evaluate it using cross-store agent workflows, MCTS-style exploration, and per-store benchmarks. Chronos runs MCTS-style exploration up to 16.7x faster than existing approaches while maintaining practical query performance across the underlying stores. Under concurrent cross-store workflows, Chronos prevents partially visible merges while substantially outperforming serialized execution.
Read the full abstract

All authors Xinjing Zhou, Jason Mohoney, Samuel Madden, Michael Stonebraker, Lei Cao

Cryptography and Security

Toward an Empirical Probabilistic Risk Manifestation Model of Organizational Cybersecurity in SMEs

In this paper, we present a cross-layer empirical study of organizational cybersecurity risk in Small and medium-sized enterprises (SMEs), analyzing 281 validated security findings from 22 real-world SME cybersecurity assessments conducted over two years through a pro bono university cybersecurity clinic. We first identify recurring organizational security functions through iterative thematic coding, then estimate an empirical Risk Manifestation Model linking these functions to exposure conditions, attack mechanisms, and cybersecurity outcomes, and use probability propagation to identify dominant risk pathways. The model characterizes empirical associations observed in this sample rather than causal or predictive relationships. Our analysis identifies eight organizational security functions associated with two exposure conditions, five attack mechanisms, and six outcome categories. Across most functions, the dominant pathway follows asset exposure to credential compromise to unauthorized access, whereas infrastructure and network security primarily propagates through network exposure; these pathways remain stable under leave-one-organization-out analysis. Finally, we evaluate whether SME cybersecurity assessments can be simplified while preserving meaningful security coverage. Retaining six functions reduces assessment burden by 24% while preserving 97% of critical findings and 92% of risk-pathway coverage, a security-oriented reduction, while retaining five functions reduces burden by 45% while preserving 89% of critical findings and 85% of risk-pathway coverage, a more efficiency-oriented alternative.
Read the full abstract

All authors FNU Nurjahan, Aidan Eiler, Mst Eshita Khatun, Lamine Noureddine, Aisha Ali-Gombe

Analysis of PDEs

Gradient Growth for Vlasov-Poisson in background charge distributed by Desingularized Dirac Delta

We prove the superlinear gradient growth for the one dimensional Vlasov-Poisson equation on the torus. We show them by first constructing the stationary solution which has a hyperbolic flow (locally). Then we perturb the solution and use the $L^\infty$ stability of the characteristic velocity field to show the superlinear growth. This proof was inspired by the work of Denisov.
Read the full abstract

Human-Computer Interaction

PeerPen: AI-Assisted Writing for Online Mental Health Peer Support

Online mental health communities thrive on peer support, yet those who volunteer to help often lack formal training and may struggle to articulate supportive responses. AI co-writing could lower this barrier; however, peer support derives much of its value from being perceived as personal, raising questions around authorship, ownership, and trust. We built PeerPen, a writing assistance tool embedded within a Reddit-like interface, supporting two main features: draft generation and revision of user-written responses. Through semi-structured interviews with 15 participants, we find that PeerPen reduced the burden of composing responses and increased confidence in offering support. Participants wanted AI to assist their writing without taking over authorship and anticipated tensions around authenticity and trust. Such assistance could make authorship uncertain even for responses written without it, weakening trust across the community. We contribute design implications for AI writing assistance that scaffolds supportive communication, preserves authorship, and accounts for community-level trust.
Read the full abstract

All authors Jiwon Kim, Sherry Gong, Maya Ajit, Soorya Ram Shimgekar, Yunhao Yuan, Dong Whi Yoo, Eshwar Chandrasekharan, Koustuv Saha

Information Retrieval

Route Me If You Can: A Benchmark for Query Reformulation Selection

LLM-based query reformulation can improve retrieval, but no single reformulation strategy is consistently optimal across queries, domains, retrievers, or model backbones. This creates an inference-time decision problem: “Given an original query and a pool of candidate reformulations, which one should be issued to the retriever?”. Existing studies are hard to compare because they use different reformulator pools, retrievers, relevance signals, training labels, and evaluation metrics. We introduce QueryRoute, a benchmark that freezes the expensive artifacts needed to study this decision reproducibly: original queries, generated variants, ranked lists under multiple retrievers, retrieval scores, and per-query oracle labels. The benchmark contains 3,757 queries, 11 candidate systems, five reformulator backbones, and three retrievers across TREC DL, BEIR, and BRIGHT, yielding 619,905 retrieval outcomes. We benchmark supervised classification, routing, QPP, and LLM-as-judge selectors. Results show substantial oracle headroom over fixed reformulators, but current selectors recover only part of it; selector rankings change across retrievers, and similar mean effectiveness can hide different query-level behavior. The released artifacts and evaluation harness allow future selectors to be compared without regenerating variants, rerunning retrieval, or rebuilding judge pipelines. Code and data are available at https://github.com/haisonle001/QueryRoute
Read the full abstract

All authors Hai Son Le, Negar Arabzadeh, Amin Bigdeli, Radin Hamidi Rad, Sajad Ebrahimi, Charles L. A. Clarke, Ebrahim Bagheri

Analysis of PDEs

Global front solutions converging to an asymptotic traveling wave in a time-fractional Amari model

We study front propagation in a time-fractional Amari neural field equation with a Caputo derivative and a Heaviside firing-rate function. For a class of nonnegative even connectivity kernels and strictly decreasing $C^1$ front-like initial data, we reduce the Cauchy problem to a nonlinear Volterra equation for the threshold location. We prove the existence and uniqueness of a global front solution, determine the short-time behavior of its threshold location, and identify its asymptotic speed. We also construct the associated asymptotic traveling-wave profile and establish uniqueness of the speed and profile, up to translation, in the nonzero-speed case. Using a rigidity argument, we prove the asymptotic linearity of the local increments of the threshold location and obtain uniform convergence to the profile in the threshold-centered frame. Finally, we characterize the kernel-dependent tail asymptotics of the wave profile.
Read the full abstract

Cryptography and Security

Reversibility-Verified De-identification for Cloud-Local LLM Inference: A Locally Certified Dehydrate-Rehydrate Loop with Layered Assurance (DR-SL)

Cloud-local LLM inference must keep sensitive user data on-device while exploiting cloud-grade reasoning, yet existing sanitization approaches (placeholder substitution, differential-privacy perturbation, and skill distillation) lack a release decision that is simultaneously safe and utility-preserving. We propose DR-SL (Dehydrate-Rehydrate with Self-Learning loop), which formalizes de-identification completeness as two measurable conditions: de-identification sufficiency under Pufferfish semantics, and task-information preservation via QA probes. A fully local two-branch verifier iterates dehydration under a lexicographic gate with guaranteed termination, backed by a deterministic hard line, an external strong-attacker re-test, and human fallback. We prove Fano-type lower bounds, a Pufferfish witness, and a rate-privacy feasibility criterion, and state their scope plainly: the bounds certify leakage, never safety, and are near-vacuous at our operating point, so release safety rests on empirical calibration, the hard line, and human review. On a worst-case fully task-coupled benchmark the loop reduces leakage from 0.457 to 0.304 (p approx. 0) and the release chain delivers 0.000 literal leakage at egress (160 instances, two strong attackers), the system degrading to certification-and-routing exactly as the feasibility criterion predicts. On a mixed-coupling benchmark the same safe point releases 67.5% of instances automatically at zero measured leakage, Pareto-dominating placeholder and selective-LDP corners under an identical release rule. Two human studies anchor the semantic utility metric (Spearman rho = 0.839) and the annotation gold (type-level recall at least 0.987). The exploratory self-learning hypothesis was not supported and is reported as such. All theoretical bounds pass numerical verification; code, synthetic datasets, protocol, and human-study packages are public.
Read the full abstract

Machine Learning

SeqMaestro: From nucleotide sequences to biological hypotheses through interpretable machine learning

Nucleotide sequence analysis is central to problems spanning regulatory genomics, evolutionary biology, and phenotype prediction. Classical bioinformatics methods extract interpretable sequence properties such as motifs and k-mer composition, but their flexibility is limited. In contrast, modern deep learning models can learn powerful predictive representations directly from raw sequences, yet their internal representations and decision mechanisms are difficult to inspect. Interpretable machine learning methods (e.g., sparse linear models and decision trees) provide human-understandable representations of predictive relationships but are not designed to operate directly on nucleotide sequences. Here, we introduce SeqMaestro, a machine learning framework that proposes biological hypotheses from nucleotide sequences using interpretable models. Our solution is centered around a two-layer interface that connects nucleotide sequences with the broader ecosystem of interpretable machine learning. SeqMaestro uses this interface to fit diverse combinations of interpretable models, feature representations, and extraction strategies, leveraging variability across transparent models to identify robust biological signals and richer predictive relationships than feature importance alone can provide. The system also supports data transformation and cleaning, model fitting, hyperparameter tuning, reliability analysis, and synthesis of results into a contextualized written report. By providing these capabilities through a no-code workflow, SeqMaestro is designed to make interpretable sequence analysis accessible to researchers without requiring extensive programming or machine learning expertise. SeqMaestro thereby provides an accessible route from nucleotide sequences to biological hypotheses.
Read the full abstract

All authors Evgeny S. Saveliev, Krzysztof Kacprzyk, Charlotte Capitanchik, Neelanjan Mukherjee, Kate Matlin, Ryan Sheridan, Srinivas Ramachandran, Jernej Ule, David L. Bentley, Mihaela van der Schaar

Software Engineering

Toward Sustainable AI Deployment: A Carbon-Aware Decision Framework for Enterprise Supply Chain Systems

Enterprises deploying AI for supply chain decisions commonly default to the largest available language model, a procurement heuristic that neglects both empirical performance and environmental cost. We benchmark six large language models across 520 supply chain tasks, simultaneously measuring decision quality and estimated generation-related operational carbon. Drawing on the Technology-Organization-Environment (TOE) framework, we develop a Carbon-Aware AI Procurement Framework (CAAPF), a Green IS design artifact that operationalizes sustainable AI governance for enterprise procurement. Within this bounded sample, quality spans 0.497-0.723, and the models with the largest disclosed parameter totals do not achieve the highest scores. The design does not isolate size, provider, architecture, or benchmark-construction effects. A category-by-tier calibrated GreenRoute proof of concept reaches 0.733 mean out-of-sample quality at an estimated 0.402 gCO2/task. Static Haiku reaches 0.699 at 0.022 gCO2/task, while Sonnet reaches 0.723 at 0.401 gCO2/task, demonstrating that the preferred strategy depends on the organization's quality requirement. Our "benchmark first, select green" principle suggests that environmental responsibility and decision quality can be mutually reinforcing, contributing to sustainable digital infrastructure governance aligned with SDG 12 and SDG 13.
Read the full abstract

Analysis of PDEs

The relativistic Euler-Poisson equation as a mean-field limit

We adapt the renormalized energy method developed in \cite{duerinckx2020mean} in order to prove the monokinetic mean field limit for relativistic Newtonian dynamics. The resulting monokinetic PDE is the relativistic Euler-Poisson equation. Since the position evolves relativistically in comparison to the momentum, the kinetic part of the modulated energy has to adjusted, leading to further obstructions that are not present in the non-relativistic settings. A weak-strong stability principle for the relativistic Euler-Poisson equation is investigated, followed by a renormalization procedure leading to the mean-field limit. Our main result constitute the first mean-field limit for relativistic Coulomb flows.
Read the full abstract

Data Structures and Algorithms

Fast Stencil Computations on a Single Arbitrarily Moving Interval

A stencil computation repeatedly updates every cell of a grid from its neighbours' values at the previous timestep. Simulating T steps on N cells directly costs Theta(NT), and a line of work beginning with Ahmad et al. reduces this by composing many timesteps into one linear operator and applying it with a Fast Fourier Transform. That technique needs to know which cells will still obey the same operator when the composed step ends, and in a free-boundary problem they do not: the region governed by a given rule is determined by the solution and moves as it evolves. We study one spatial dimension, a three-point stencil with time-varying coefficients, and a computed region that is a single interval whose two endpoints move by arbitrary amounts at every step, revealed online. Let B be the horizon plus the total variation of the boundary trajectory. We give a schedule whose work is O((B+N) log T log(N+B)) and whose span is O(T log T log(N+B)), and we prove that the values it computes are exact. The best existing bound for a region that moves requires its boundary to travel at most one cell per timestep. We drop that requirement and lose nothing by it: a boundary obeying it has B <= 3T, so our bound stays near-linear on every trajectory the earlier result covers. Elsewhere, B grows only by the distance the boundary actually travels – one jump of width N costs T + 2N. The reason total variation suffices is that everything the two endpoints touch over a time window of any length lies in two intervals, one per endpoint. This cannot be relaxed: with p regions the bound degrades by a factor p, and at p = sqrt(T) there is an instance on which the work is Theta(T^{3/2}) while B + N = Theta(T). All results are machine-checked in Lean 4, apart from the classical convolution bound, which is imported as an interface.
Read the full abstract

Robotics

Real-World Reinforcement Learning with MPC Scaffolding for Dexterous Manipulation

Real-world reinforcement learning (RL) offers a promising route to dexterous manipulation policies that can adapt directly from physical interaction, but learning is hindered by inefficient early exploration and costly failures. We propose a framework that uses sampling-based model predictive control (MPC) as scaffolding for real-world dexterous RL, providing structured prior experience and task-directed guidance during learning without human demonstrations or corrective actions. A small set of MPC trajectories is first used to populate an offline replay buffer and to pretrain the actor and critic. During online learning, MPC intermittently guides data collection while an off-policy Soft Actor-Critic learner trains from both prior MPC experience and newly collected physical interaction, with control gradually transitioning to the learned policy. On continuous in-hand rotation with a 16-DoF Allegro hand, initialized from 20 MPC trajectories collected in 12 minutes on hardware, the policy reaches 100% success after 7 minutes of online RL, with about three object drops on average during training. After 20 minutes of online learning, the policy achieves more than five times the rotation speed of the MPC controller and completes 1000 consecutive rotations without a drop. Ablations show complementary benefits from MPC-based pretraining, retained MPC experience, and online MPC guidance, while additional experiments demonstrate rapid adaptation to new object geometries and successful goal-conditioned reorientation.
Read the full abstract

All authors Emek Bar{\i}ş Küçüktabak, Karankumar Patel, Zhaodong Yang, Jinda Cui, Kazuhiro Sasabuchi, Jun Takamatsu

High Energy Physics (Phenomenology)

Probing $\Upsilon({1S})$, $\eta_b$ and $h_b$ resonances in proton-lead collisions at the LHCb

We explore the production of bottomonium states in proton–lead (pPb) collisions at the Large Hadron Collider (LHC) within the frameworks of Non-Relativistic Quantum Chromodynamics (NRQCD) and modified NRQCD (MNRQCD). In this work, we present theoretical predictions for the production cross-section, the nuclear modification factor $R_{\rm pPb}$ and the forward-to-backward production ratio $R_{\rm FB}$ of $\Upsilon(1S)$ as functions of transverse momentum and rapidity in the LHCb kinematic region. The MNRQCD framework, which incorporates perturbative soft-gluon emissions from color-octet states, provides description of quarkonium production in heavy-ion collision. Furthermore, using heavy-quark spin symmetry, we estimate the production cross-sections and expected event yields of the spin-singlet bottomonium states $\eta_b$ and $h_b$ within both NRQCD and MNRQCD. The predictions show significant differences between the two approaches in the integrated cross-sections and transverse momentum distributions of these resonances. Therefore, these results could provide important benchmarks for future experimental measurements at LHCb and contribute to a deeper understanding of bottomonia production and nuclear modifications in proton–lead collisions.
Read the full abstract

All authors Sudhansu S. Biswal, Priyabrata Dash, Sushree S. Mishra, K. Sridhar

Quantum Physics

Quantum Geometry in Hyperbolic Band Theory

Hyperbolic band theory (HBT) has recently unveiled a wealth of exotic physical phenomena in negatively curved spaces. Concurrently, the quantum metric has emerged as a fundamental tensor governing quantum geometry and topological phases. In this Letter, we bridge these two frontiers by investigating the quantum metric in HBT. Because conventional Euclidean metric extraction protocols fundamentally fail in these non-commutative geometries, we introduce holonomy shaking, a novel, experimentally viable technique utilizing periodic lattice driving to dynamically extract the metric. Using the {8,3} regular hyperbolic and kagome-like lattices as concrete examples, we demonstrate the high-fidelity dynamical extraction of the quantum metric. Our results establish a robust blueprint for probing hyperbolic quantum geometries, paving the way for the discovery of exotic topological phenomena in hyperbolic quantum matter.
Read the full abstract

All authors Ahmed Adel Mahmoud, Riccardo Sorbello, Ronny Thomale, Steven Rayan

Information Retrieval

EviQE: Evidence Selection for LLM-Based Query Expansion

LLM-based query expansion increasingly conditions reformulation on documents retrieved from the target corpus, yet most work focuses on how to generate expansions rather than which documents the model should read. We propose EviQE, which aggregates documents retrieved by multiple reformulators, selects a compact evidence set, and uses it for one grounded expansion step. This separates evidence selection from generation and treats reformulators as complementary retrieval perspectives. Across three TREC DL and five BEIR benchmarks, reformulators frequently retrieve distinct relevant documents, so pooled candidates provide higher relevant-document coverage than any individual source. The strongest gains come from relevance-based evidence selection: LLM-Score consistently outperforms direct reformulation, cold-start expansion, and single-source seeded expansion. Additional retrieval-generation rounds provide little benefit once strong conditioning evidence has been selected and can reduce effectiveness.
Read the full abstract

All authors Hai Son Le, Amin Bigdeli, Shirin Seyedsalehi, Morteza Zihayat, Ebrahim Bagheri

Graphics

MedVA: An End-to-End Neuro-Symbolic Agentic System for Medical Volume Visualization

Medical volume visualization requires selecting regions of interest (ROIs) and carefully controlling their relative visual emphasis according to a given clinical intent. Implementing these decisions in conventional workflows demands substantial clinical and visualization expertise and often involves trial-and-error optimization. Recent agentic systems have introduced natural-language interaction and autonomous visualization operations but largely rely on MLLM-based inference throughout the workflow. Although MLLMs encode broad medical knowledge and provide strong reasoning capabilities, such inference may be suboptimal for medical volume visualization, potentially leading to clinically incomplete interpretations of user requests and unreliable ROI identification and visualization optimization. In this work, we present MedVA, an end-to-end neuro-symbolic agentic system for medical volume visualization that addresses these limitations through three complementary agents. The neuro-symbolic intent formulation agent refines MLLM-based interpretations of natural-language requests through symbolic reasoning over established clinical knowledge, which provides more complete, clinically grounded ROI specifications than MLLM-only reasoning. The multi-model ROI identification agent directly identifies semantically specified ROIs in the original volume by leveraging complementary large-scale pretrained medical segmentation models. The objective-driven visualization optimization agent explicitly evaluates ROI visibility and occlusion in the original volume using a volume-based visibility objective. Extensive agent-level and system-level evaluations across diverse medical datasets and interaction scenarios support the effectiveness of the individual agents. A formative user study further indicates high usability and practical value among users with different levels of expertise.
Read the full abstract

All authors Haill An, Suhyeon Kim, Minjun Kang, Eunwoo Lee, Bin Sheng, Lei Bi, Younhyun Jung

Data Structures and Algorithms

A Strongly Subquadratic $(3+\varepsilon)$-Approximation for Weighted Edit Distance over Arbitrary Metrics

We study weighted edit distance between two strings of total length $n$, where edit costs are induced by an arbitrary metric. For equal-length inputs, Kuszmaul (2019) gave an $O(n^\delta)$-approximation with $\widetilde{O}(n^{2-\delta})$ running time for every fixed $0 < \delta < 1$. We give the first constant-factor approximation for weighted edit distance over arbitrary metrics in strongly subquadratic running time. For every $0 < \varepsilon \le 1$, our randomized algorithm runs in $\widetilde{O}(n^{7/4}/\varepsilon^8)$ time and returns a $(3+\varepsilon)$-approximation with probability at least $1-n^{-10}$. The algorithm allows unequal input lengths and places no bound on the ratio between edit costs.
Read the full abstract

Machine Learning

AgentKV: Phase-Aware KV Eviction for Agentic LLMs

Agentic serving can consume orders of magnitude more tokens than chatbot workloads, stressing both KV-cache capacity and decode-time bandwidth. Most KV-eviction methods score cached keys against representative queries drawn from the most recent tokens, assuming future attention resembles recent attention. We show that agentic generation violates this assumption: future queries form a mixture over think, act, tool, and others phases, and principal-angle analysis shows these components occupy measurably different query subspaces, so recency representatives systematically undervalue keys that upcoming phases will need. We propose AGENTKV, which maintains a small query buffer per phase and scores cached keys against their union. We further implement AGENTKV in a persistent multi-turn serving path that carries compressed KV state across turns and compacts retained KV pages online. Across two models, six task domains, and three KV budgets each, AGENTKV improves task score by 5.5 points on average over R-KV and 5.3 over Tri-attention. Relative to upstream full-KV SGLang, AGENTKV improves output-token throughput by up to 1.80x. Code: https://github.com/LiuTaowen-Tony/agentkv.
Read the full abstract

All authors Taowen Tony Liu, Jeffrey T. H. Wong, Can Xiao, Bowen Yang, Hao Mark Chen, Yiren Zhao

Probability

Limit theorems for amnesic elephant Random walks with random increment sizes

We introduce a generalized amnesic elephant random walk in which, at each time, the direction of an underlying amnesic elephant random walk selects one of two increment distributions, while the actual increment is sampled from the corresponding independent sequence. The selected distribution does not need to determine the sign of the increment. This construction combines memory reinforcement, amnesia, and randomness in jump sizes. Assuming finite second moments, we establish central limit theorems and functional limit theorems, identifying diffusive, critical, and superdiffusive regimes determined by the memory and amnesia parameters. We further prove a Gaussian fluctuation theorem around the random superdiffusive limit, with an explicit limiting variance that captures the contributions of both the underlying amnesic walk and the random jump magnitudes. For the special case without amnesia, we also establish stable limit theorems and their functional counterparts when the increments belong to the domain of attraction of a non-Gaussian stable law, in the regime where heavy-tailed jumps dominate the memory contribution.
Read the full abstract

Machine Learning

Interpolation Is Not Invariance: Pair Count Is Not Coverage in Transformation Audits

Counting equivalent pairs is a common way to report transformation-audit coverage, but it can substantially overstate the constraints imposed by an audit: pairs generated from the same semantic object are correlated, and complete orbit graphs contain algebraically redundant edges. We therefore distinguish four complementary quantities—edge count $m$, effective contrast rank $s$, population support rank $r$, and graph spectral gap $\eta$—and characterize their roles in audit coverage and deployment reliability. Under a rank-$r$ Gaussian contrast model, a population-invariant calibrated reader exists exactly when the anchor has a component in $\ker T$. When an audit has rank $s < r$, its unobserved risk is $R^\star/U$, with $U \sim \operatorname{Beta}((r-s)/2,s/2)$; when $s \ge r$, exact calibrated interpolation is infeasible. The same distinction appears in orbit topology: a spanning tree imposes the same exact-null constraints as a complete graph, while a sharp graph Poincare inequality propagates edge-level drift to an entire orbit at a cost proportional to $1/\eta$. Cyclic audits can additionally yield zero pair-level leave-one-out error without holding out any semantic object. To address these failures, we derive exact block-Woodbury leave-one-orbit-out updates and introduce a source-disjoint deployment gate over finitely many candidate readers. The gate retains the original reader unless uncertainty bounds certify lower drift within a prescribed clean-utility budget. etc..
Read the full abstract

Optics

Proximal-Only Transmission Matrix Recovery of an Arbitrarily Deformed Graded-Index Multimode Fiber

The multimode fiber is among the thinnest imaging conduits available, carrying hundreds to thousands of spatial modes through a cross-section comparable to a human hair, but its endoscopic capabilities are currently limited by the sensitivity of the transmission matrix to the fiber's deformed state. Proximal-only recovery of the fiber's transmission matrix is an appealing approach for enabling general use multimode fiber endoscopy, and within the last decade, machine learning techniques have been applied to both single-ended and double-ended transmission matrix recovery tasks. We present a new approach to this interdisciplinary problem and show that neural networks can generalize to recover transmission matrices of an arbitrarily deformed graded-index multimode fiber from proximal measurements alone.
Read the full abstract