Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Wednesday 9 September

Functional Analysis

Noncommutative sharp Hausdorff-Young inequality

We prove the sharp Hausdorff–Young inequality on quantum euclidean spaces. Our result implies the sharp Hausdorff–Young constants for the Weyl transform. The key ingredients are a sharp Hessian comparison inequality and a novel flow related to the mixed- norm of noncommutative Gabor transform; the Hessian comparison leads to the monotonicity of the flow. We also apply the same flow technique to prove the sharp Hausdorff–Young inequalities on Heisenberg groups and the affine group.
Read the full abstract

Number Theory

Integer group determinants for abelian groups of order 24

We determine the integer group determinant sets for $C_{24}$, $C_2\times C_{12}$ and $C_2^2\times C_6$, the three abelian groups of order $24$. Character factorization expresses each determinant as a product of cyclotomic norms, whose components must satisfy integral compatibility conditions. The classifications are constructive and reduce each nonzero signed integer to valuation conditions at $2$ and $3$ and a finite test on its remaining prime factors. The tests use conductor quotients and norm-preserving global units. Each prime contribution has a uniform bound independent of its multiplicity, and successful tests yield integer coefficients realizing the prescribed determinant. The critical cyclic strata share one compatibility group. For $C_2^2\times C_6$, a normalized rational–Eisenstein pair settles the odd values and most even strata; target stabilizers reduce the remaining tests. We also prove that the odd determinant set of $C_2^2\times C_6$ is properly contained in that of $C_2\times C_{12}$, exhibit an infinite family in the difference, and determine the signed powers of two in all three sets. Exact arithmetic certificates and coefficient constructors accompany the proofs.
Read the full abstract

Solar and Stellar Astrophysics

Wave Emission and Absorption in a Near-Sun Proton-Cyclotron Wave Storm

Quantification of energy transport and dissipation in weakly collisional heliospheric plasmas that are far from local thermodynamic equilibrium is an outstanding scientific problem. A central challenge is determining how non-Maxwellian velocity-space structure affects damping and emission of coherent ion-scale waves, especially compared to simplified analytical models for background plasma velocity distributions. In this work, we study the damping and emission of parallel-propagating proton cyclotron waves for two models of proton velocity distributions measured by the SPAN-I instrument on board Parker Solar Probe during an extended storm of waves with left-hand polarization in the solar wind at a heliocentric distance of 30.1 solar radii. Using the measured velocity distribution rather than a two-component bi-Maxwellian model predicts instabilities consistent with the observed coherent waves. For intervals in which both models predict net damping, the observed VDF model yields weaker damping in 90% of cases, with a reduction in the integrated heating rate of 0.44 relative to the bi-Maxwellian model. These results suggest that simplified analytical velocity distribution models may overestimate cyclotron damping and underestimate wave emission in the near-Sun solar wind.
Read the full abstract

All authors Kristopher G Klein, Daniel Verscharen, Mihailo Martinovic, Niranjana, Ali Rahmati, Roberto Livi, Davin Larson, Michael Stevens

Computers and Society

Emergency Department Revisit Quality Review Screening: Exploring Human Decision-Making and Artificial Intelligence Support

Background: Emergency Department (ED) return visits are commonly reviewed for quality assurance, but are often limited (e.g., to revisits within 48-72 hours) to increase actionable finding yield while minimizing chart review burden. Those limitations may lead to missed quality improvement opportunities. Methods: We conducted an exploratory, retrospective study of randomly selected ED visits to a multihospital health system having an ED revisit within 1-14 days to the same health system. Given only each visit's primary diagnosis, raters (2-3 clinicians and GPT-4 large language model [LLM]) assessed characteristics of the diagnosis pairs, including the "target": whether a pair warranted further assessment. Informed by rater response analyses, an algorithm leveraging an LLM-populated knowledge graph ("KGA") was created to automatically screen for potentially concerning pairs, then preliminarily assessed. Results: 99 diagnosis pairs were included. GPT-4 responses poorly correlated to clinician raters, rating nearly all (94%) pairs as warranting follow-up (4.4-13.3 times more than clinicians). However, prompt engineering was minimal. Among clinician raters, revisit medical gravity was consistently significantly associated with the target, while a differential diagnosis/complication composite was significantly associated on unadjusted, but not adjusted (though less powered) analysis. The KGA achieved 83-100% positive predictive value for at least one clinician rater determining further assessment was warranted based on the diagnosis pair. Conclusion: These results can inform next steps for improving screening with LLMs like ChatGPT. Further research is warranted to validate this preliminary work's finding that the KGA may enable enhancing the scope and yield of screening without substantially increasing reviewer workload.
Read the full abstract

All authors Jonathan A. Handler, Marlene I. Robles-Granda, Jacob E. Mefford, Jeremy S. McGarvey, Gregory S. Podolej, Colleen J. Klein, Matthew D. Dalstrom, William F. Bond

Algebraic Geometry

Pierce-Birkhoff conjecture is false

We provide a counterexample to the Pierce-Birkhoff conjecture: a continuous function that is piecewise quadratic on a finite collection of semialgebraic sets that partition $\mathbb{R}^n$ but that cannot be expressed as a finite lattice combination of polynomials. The counterexample was found with the assistance of our multi-agent, multi-model setup that chains together GPT 5.6, GPT 6, Claude Opus 5, and Claude Fable 5.1.
Read the full abstract

Signal Processing

Robust Continuous Human Activity Recognition Using Deep Learning and Distributed Radar Sensors

Continuous human activity recognition (HAR) with distributed radar sensor networks is challenging because Doppler signatures depend strongly on aspect angle, the informativeness of individual radar views varies with motion direction, and activity transitions in uninterrupted sequences are often ambiguous. This paper proposes a ConvNeXt-MHSA-BiGRU framework for frame-wise continuous HAR from Doppler-time spectrograms acquired by five spatially distributed radar nodes. A shared ConvNeXt-inspired encoder extracts time-frequency representations from each radar stream, while radar-wise multi-head self attention (MHSA) models inter-node dependencies and adaptively fuses complementary views. RadarDropout and SpecAugment-style time-frequency masking regularize the network against unreliable radar views and local spectrogram perturbations, whereas stacked bidirectional gated recurrent units (BiGRUs) exploit temporal context for frame-wise classification across activity transitions. The framework is evaluated on nine activities performed by 14 participants using leave-one-person-out (L1PO) subject-independent testing with fivefold cross-validation. It achieves a mean L1PO test accuracy of 87.56% across the 14 held-out subjects and improves recognition performance over the published CNN-RNN baseline. The results demonstrate that combining modern spectrogram encoding, adaptive radar view fusion, and bidirectional temporal modeling provides an effective framework for continuous and distributed radar-based HAR.
Read the full abstract

Space Physics

Cascade models of anisotropic turbulence in magnetized plasma of solar wind

The solar wind plasma is modeled as a collection of discrete domains, each possessing local rotational symmetry about its domain-mean magnetic field. Based on this partial symmetry, we construct cascade models governed by the nonlinear and Alfvénic time scales. We introduce a stochastic renewal process with a bimodal waiting-time distribution determined by these two time scales. This process yields a two-branch renormalization solution for the total energy: a statistically robust branch with an Iroshnikov-Kraichnan-like $k^{-3/2}$ spectrum and a statistically marginal branch with a Kolmogorov-like $k^{-5/3}$ spectrum. Whenever energy-flux fluctuations become supercritical, the system selects the faster of the two available cascade rates, thereby preventing flux accumulation. During solar wind expansion, the system undergoes a dynamical first-order phase transition from the slow $k^{-3/2}$ cascade to the fast $k^{-5/3}$ cascade, with switchbacks accelerating the transition. The mixing of subcritical and supercritical domains in raw spacecraft measurements produces an apparent decoupling of the velocity and magnetic-field spectral indices. Incorporating a magnetic helicity cascade slaved to the energy cascade, we show that the large-scale spectra decouple into $k^{-3/4}$ magnetic and $k^{-3/2}$ kinetic spectra. For switchbacks inside the upper solar corona, the corresponding large-scale spectra instead decouple into $k^{-2/3}$ magnetic and $k^{-5/3}$ kinetic spectra. Data from Voyager, Ulysses, Helios, Wind, and PSP confirm the spectral signatures across heliospheric regions spanning heliocentric distances from 0.056 to 140 AU.
Read the full abstract

Analysis of PDEs

The Schrödinger equation with fluctuating nonlinearity in the energy space

We study nonlinear Schrödinger equations with nonlinear Stratonovich noise \begin{equation*} \mathrm{d} u\,=\, i\bigl[ \Delta u \,+\, \lambda|u|^{p-1}u\bigr] \, \mathrm{d} t \,+\,i|u|^{(q-1)/2}u\circ \mathrm{d} {W}, \end{equation*} in their energy space $H^1(\mathbb R^d;\mathbb C)$. By combining the stochastic Strichartz estimates derived in [Potential Anal. 41 (2014), pp.\ 269–315] with the approach from [Ann.\ Inst.\ H.\ Poincaré Phys.\ Théor.\ 46 (1987), pp.\ 113–129] we obtain local well-posedness for all energy-subcritical nonlinearities $p,q\in [1, 1+4/(d-2)_+)$ together with a corresponding blow-up alternative. For a linear multiplicative noise $q=1$, a real-valued noise $W$ and a defocusing nonlinearity $\lambda\le 0$, we check this blow-up condition using a bound on the energy, resulting in the global well-posedness of the equation. If both nonlinearities are mass-subcritical, i.e., $p,q\in [1, 1+4/d)$, we provide an improved blow-up criterion involving the $L^2(\mathbb R^d;\mathbb C)$-norm. Using the conservation of mass for real-valued $W$, we obtain global well-posedness also in this case. Compared to previous results on stochastic nonlinear Schrödinger equations, we thereby improve the range of exponents $p$ and $q$ and the spatial regularity assumption on the noise.
Read the full abstract

Cryptography and Security

TrajMark: Ownership Attribution and Segment-Level Tamper Localization for Coding-Agent Trajectories

Watermarking the final patch produced by a coding agent provides provenance evidence for the submitted artifact, but does not authenticate the visible process that produced it. Behavioral watermarking methods primarily provide a global detection or identifier-recovery signal, so a locally edited trajectory may retain sufficient ownership evidence without revealing which protected region has become inconsistent. To address this limitation, we propose TrajMark, a training-free, symmetric-key, visible-only trajectory watermarking framework that separates robust ownership attribution from fragile local integrity verification. Our framework consists of two complementary layers: a sparse owner layer that encodes a six-bit deployment identifier by rewriting a keyed subset of naturally occurring READ actions into masked linear equations, and a localization layer that inserts linked Q12 ordinary, group, and terminal seals to commit to protected critical-action segments. This separation allows ownership evidence to accumulate robustly across trajectories, while local modifications perturb nearby keyed commitments and expose the affected protocol region. We further provide a design-level analysis of owner recoverability, integrity collision probability, structural overhead, and localization behavior. Across three coding-agent frameworks and three LLMs, TrajMark recovers the exact owner in all evaluated clean full-watermark batches. Under exhaustive eligible single-site attacks it detects 95.5%-100% of edits, and under random single-action corruption it localizes 95.8% of modified sites to an accepted protocol region rather than to the individual action. Owner marking adds no trajectory actions; the integrity layer adds explicit read-only seals, and matched Pass@1 is 26.9% versus 26.3% for unwatermarked runs.
Read the full abstract

All authors Bokang Zeng, Zheng Gao, Xiaoyu Li, Xiaoyan Feng, Jiaojiao Jiang

Dynamical Systems

A Categorical Approach to Nilspace Theory

Originating in ergodic structure theory, nilspace theory is concerned with the study of cubical spaces. A first key result in this theory, the weak structure theorem, is the representation of a concrete fibrant compact cubespace as a tower of its canonical truncations, exhibiting each step over the previous one as a principal bundle by a compact abelian group. We present a categorical proof of the weak structure theorem by systematically interpreting the relevant concepts in an appropriate context.
Read the full abstract

Systems and Control

Low-Altitude Platform Stations for Dense Urban Connectivity

This paper evaluates the downlink performance of 5G non-terrestrial networks (NTNs) realized via low-altitude platform station (LAPS)-mounted base stations, and compares it against conventional 5G terrestrial network (TN) in a realistic dense urban scenario. Using a 3GPP-compliant multi-cell hexagonal layout with 19 sites and 57 sectors, we model LAPS altitudes ranging from 100 to 1000 m and evaluate the average effective signal-to-interference-plus-noise ratio and user throughput via system-level simulations. Results show that LAPS-based NTN deployments can significantly outperform terrestrial 5G in per-user throughput, provided the LAPS altitude is properly chosen to balance increased line-of-sight probability against inter-beam interference.
Read the full abstract

All authors German Svistunov, Azim Akhtarshenas, Matteo Bernabè, David López-Pérez

Artificial Intelligence

Fortunate Recall: Ontology-Driven Memory Lifecycle Management for Persistent Coherence in LLMs

Current LLM memory systems treat all personal facts identically, so stores grow without bound while retrieval precision degrades. The core challenge is lifecycle management: which memories should persist, which should be replaced, and at what rate, conditioned on the behavioral type of each fact. Fortunate Recall (FR) is a composable policy layer that classifies personal facts into a 10+1 behavioral ontology and applies category-specific lifecycle policies (differential temporal decay, slot-key supersession, event-time validity, and category-aware retrieval routing) as deterministic functions over LLM-extracted metadata. FR-Bank, our infrastructure-independent implementation, reaches a 76.9% pass rate on LifecycleBench, a new 516-question temporal-disambiguation benchmark, ahead of Mem0, A-MEM, Memory-R1, and MemoryOS (61% to 70.5%), and 75.2% on the full LongMemEval-S under the canonical Wu et al. judge protocol, so lifecycle policies impose no measurable cost on standard retrieval. A pre-registered ablation locates the gains: replacing the typed layer with three generic lifecycle primitives leaves correctness statistically unchanged (-1.7pp, 95% CI [-6.0, +2.7]), so the generic lifecycle metadata carries the correctness advantage, while the behavioral ontology carries calibration, halving downstream confabulation (12.0% vs 24.2%, p<0.001). End-to-end, FR-Bank cuts confabulation from Mem0's 45.1% to 22.4% over answered queries and from 32.2% to 13.0% over all queries while answering more of them correctly (31.2% vs 18.6%); the ranking replicates on the open-weight Kimi K2.5. The decomposition transfers to BEAM, an independently built benchmark: 46.8% correct vs Mem0's 32.9% over 280 questions, with the ontology's benefit concentrated in contradiction resolution and saturating near seven policy clusters. The ontology, benchmark, and code are released.
Read the full abstract

Software Engineering

Towards Scalable and Cost-Efficient Vulnerability Detection: A Study on Automatic Query Generation

Static analysis remains a cornerstone of software security, yet the effectiveness of tools such as CodeQL is often limited by the substantial manual effort required to develop high-coverage query suites. While large language models (LLMs) have emerged as a potential solution for automated code reasoning, their practical utility in generating structured, executable security queries remains underexplored. In this paper, we conduct an empirical study to evaluate the ability of LLMs to synthesize CodeQL queries using vulnerability data from the National Vulnerability Database. Through this investigation, we explore the potential of using LLMs as an automatic CodeQL query generator. Subsequently, we systematically evaluate the performance of various LLM architectures across a diverse set of real-world vulnerabilities, measuring their ability to improve detection coverage and precision. Our findings reveal that LLM-generated queries significantly enhance the baseline CodeQL queries, yielding 82% improvement in average F1-score. Furthermore, we provide a detailed cost- benefit analysis showing that while direct LLM-based scanning of entire repositories is often computationally and financially prohibitive, leveraging LLMs to synthesize CodeQL queries offers a scalable and cost-effective alternative for large-scale vulnerability detection. Our results suggest that LLMs can effectively bridge the gap between unstructured vulnerability reports and formal static analysis specifications, offering a scalable path toward comprehensive automated vulnerability detection.
Read the full abstract

All authors Ivana Clairine Irsan, Ratnadira Widyasari, Huihui Huang, Ting Zhang, Yue Liu, Ouh Eng Lieh, Shar Lwin Khin, Kang Hong Jin, David Lo

Mesoscale and Nanoscale Physics

WannierNLQG: A Julia package for nonlinear optical responses and quantum geometry from Wannier tight-binding models

Nonlinear optical responses and quantum geometry are central to modern condensed matter physics and are deeply intertwined. We introduce WannierNLQG, an extensible Julia framework for computing nonlinear optical responses and quantum geometric quantities from Wannier tight-binding models. Its gauge-consistent, degeneracy-aware architecture accommodates perturbative responses at arbitrary order and additional quantum geometric quantities. The current release evaluates ordinary, spin, and photon-drag injection and shift currents, as Brillouin-zone integrals and on k slices. For shift current, a unified interface exposes four complementary formulations: the conventional method, projector trace, generalized Wilson loop, and a finite-momentum geometric loop, with the last three explicitly accommodating degenerate subspaces. The framework also provides k-resolved Berry curvature, quantum metric, their multipoles, and additional quantum geometric and mixed momentum-spin quantities. Experimental symmetry workflows additionally support symmetry-adapted Wannier construction, symmetrization of tight-binding models and real-space operators, and reduction of spatially uniform response integrals to irreducible k-point orbits and invariant tensor components. The documentation covers formula conventions, the TaskConfig interface, and auditable output formats, with GeS and bilayer MoS2 case studies illustrating method comparison, degeneracy handling, quantum geometric analysis, and photon-drag responses. Together, these capabilities enable first-principles calculations of nonlinear response and quantum geometry in realistic multiband materials, connecting quantum geometry with quantitative materials modeling for optoelectronic, spintronic, and photovoltaic applications.
Read the full abstract

All authors Zhuocheng Lu, Zhichao Guo, Yuanyuan Xua, Jiacheng Yao, Hua Wang

Computation and Language

Can Foundation Models Moderate Online Content? Evaluating Instruction- vs. Example-Driven Policy Operationalization

The growing complexity of content moderation policies presents a critical challenge for their consistent operationalization. While foundation models possess the basic capabilities needed to confront this challenge, whether they can reliably moderate online content remains an unanswered question. In this paper, we systematically compare two competing paradigms for Vision-Language Model (VLM) guidance: an instruction-driven approach where models reason from policy precepts, and an example-driven approach where they generalize from prior precedents. We ground this investigation in ModerationBench, a new benchmark of 4,000 manually annotated, in-the-wild posts from the Bluesky platform. Our experiments reveal that foundation models can substantially outperform Bluesky's deployed moderation system, nearly tripling its $F_1$ score (0.60 vs. 0.22) on Random Posts in the benchmark, with both instruction- and example-driven paradigms achieving comparable peak effectiveness. Our findings thus chart a path toward reliable and adaptable policy operationalization at scale.
Read the full abstract

All authors Ayan Majumdar, Shounak Paul, Pushpdeep Singh, Ines Abdelaziz, Sayeh Jarollahi, Seungeon Lee, Krishna P. Gummadi, Ingmar Weber, Abhisek Dash

Statistical Methodology

Dynamic prediction intervals for survival times

Most work on survival prediction focuses on estimating survival probabilities rather than predicting individual event times. Recent conformal methods have made it possible to construct prediction intervals for survival times with right-censored outcomes, but existing approaches are restricted to settings with covariates only measured at baseline and do not address dynamic prediction with longitudinal data. We study prediction intervals for survival times in a dynamic prediction framework with longitudinal covariates. Our approach uses Penalized Regression Calibration (PRC) as a working dynamic prediction model, combining linear mixed models for the longitudinal histories with a Cox model for post-landmark survival, and then applies a conformal calibration step to obtain prediction intervals. We compare naive intervals obtained by direct inversion of the survival function estimated by PRC to our dynamic conformal method. A Monte Carlo simulation study evaluates empirical coverage and interval length across sample sizes, censoring levels, landmark times, and non-proportional hazards (NPH) scenarios. We illustrate the proposed methodology by computing dynamic prediction intervals for the time until a dementia diagnosis in the ADNI dataset. The results show that naive inversion is often unreliable, whereas the proposed dynamic conformal method yields more stable predictive performance.
Read the full abstract

Quantum Physics

Constant-depth global shadow estimation

Reliable and scalable readout strategies are essential for quantum technologies. As quantum processors grow, extracting useful information must remain feasible without measurement circuits becoming a dominant bottleneck. Randomized measurements and classical shadows provide a powerful route, but global estimation is conventionally associated with highly random ensembles that require increasing circuit depth and hence substantial experimental overhead. In this work, we show that substantially less randomness suffices when the readout is meaningfully adapted to the quantities being estimated. We introduce shallow phase shadows, based on a sparse Clifford-IQP ensemble, and prove efficient global estimation of stabilizer-state fidelities despite the ensemble not forming an approximate relative-error design. On all-to-all architectures, the protocol admits a constant-depth implementation using mid-circuit measurements and classical feedforward, or logarithmic depth without auxiliary systems. The protocol requires only controlled-phase entangling gates and offers a tunable trade-off between circuit resources and estimation accuracy, making it particularly amenable to experimentally relevant architectures with long-range connectivity. Our results show that scalable quantum readout need not reproduce generic randomness: task-adapted randomization can enable substantially shallower global characterization protocols.
Read the full abstract

All authors Qingyue Zhang, Zhou You, Dayue Qin, Xiaopeng Li, Jens Eisert, You Zhou

Trading and Market Microstructure

dexamine: A Python package for Uniswap event data on Ethereum

Decentralized exchanges record trading and liquidity provision on public blockchains, but empirical analysis requires interpreting these records and linking them to execution metadata. dexamine is a Python package that parses Uniswap v2 and v3 events on Ethereum. It converts transaction receipt logs into observations of trades and liquidity changes, with token quantities, pool state, transaction order, and gas information. The package separates data retrieval, contract metadata, protocol interpretation, and output construction. The repository provides recorded Ethereum responses and an offline reproducible example, and version 1 has been used to construct data for an empirical study of price discovery in decentralized markets.
Read the full abstract

Combinatorics

Induced Forest Minor Theorem for Graphs Without an Induced Star

Motivated by recent work on tree independence number, we study the path independence number of a graph $G$: the minimum integer $k$ such that there is a path decomposition of $G$ where each bag induces a graph with independence number at most $k$. We show that every graph excluding both an induced forest minor and an induced star has bounded path independence number. This characterises when a graph class that excludes an induced star has bounded path independence number while also partially resolving a conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel and Wiederrecht (2024). Furthermore, we show that graphs excluding both an apex-forest induced minor and an induced star have bounded tree independence number. As a consequence, for every fixed apex-forest $H$ and integer $t$, there is a polynomial-time algorithm to test whether a $K_{1,t}$-induced-subgraph-free graph contains $H$ as an induced minor. Moreover, it follows that the Maximum Weight Independent Set problem, as well as several other NP-hard problems, can be solved in polynomial-time on $K_{1,t}$-induced-subgraph-free graphs that exclude $H$ as an induced minor.
Read the full abstract

Robotics

Frequency-Conditioned Flow Matching for Vision-Language-Action Models

Robot actions are temporally correlated trajectories whose frequency components encode motion at different scales with highly non-uniform energy distributions. Yet Flow Matching–based vision-language-action (VLA) models typically generate actions in temporal coordinates, without explicitly modeling or systematically leveraging this frequency heterogeneity. We introduce FreqFM, a frequency-conditioned Flow Matching framework for VLA models. It raises action frequency from an implicit trajectory property to an explicit conditioning dimension that spans the entire generation pipeline. Concretely, in DCT frequency coordinates, FreqFM constructs a spectrum-matched source distribution, adaptively balances the objective across frequencies, and constrains per-frequency guidance residuals using the corresponding reference transport scales. FreqFM integrates into existing Flow Matching action experts without changing the VLA backbone. Across LIBERO, LIBERO-Plus, and VLA-Arena, FreqFM consistently improves performance, including a 9.3-point gain on LIBERO-Plus, and further demonstrates its effectiveness on six real-robot tasks.
Read the full abstract

All authors Haochen Niu, Shengye Dong, Hao Liu, Peiwen Lin, Wang Chuang

Networking

HybridFLow: SDN-Orchestrated Client Partitioning for Hybrid Federated Learning

Cross-silo Federated Learning (FL) enables geographically distributed institutions to collaboratively train machine learning models without sharing raw data. In wide-area deployments, however, communication delays often dominate round completion time and exacerbate the straggler effect. Hybrid FL addresses this challenge by combining synchronous and asynchronous client participation, but effective partitioning requires visibility into network conditions such as shared bottlenecks, link utilization, and path contention that individual clients cannot observe. We present HybridFLow, a closed-loop SDN-driven orchestration framework that integrates network-layer intelligence directly into hybrid FL. Leveraging the SDN controller's global topology view, HybridFLow generates calibrated per-client communication-time estimates before each training round and uses them to partition clients into synchronous and asynchronous groups while balancing round latency and update staleness. After each round, measured communication times are fed back to the controller to continuously refine future predictions. Experimental results across multiple network topologies show that HybridFLow reaches 80% target accuracy 33-40% faster than SmartFLow and reduces average round duration by 30-40 seconds, while FedAsync fails to reach the target accuracy under non-IID data distributions.
Read the full abstract

All authors Osama Abu Hamdan, Rabin Pandey, Hao Che, Engin Arslan, Md Arifuzzaman

Metric Geometry

Hyperbolic distance matrix completion

A completion theory for hyperbolic distance data is developed at the interface of matrix analysis, graph theory, and hyperbolic geometry. Krein's characterization of the metric space embeddability in Lobachevsky space leads to a natural anchoring procedure that transforms the indefinite data into a positive semidefinite kernel. In analogy with positive semidefinite and Euclidean distance matrix completion, chordality of the specification graph is shown to be the necessary and sufficient condition for local Lorentz-Gram data to admit global completion. Existence is complemented by explicit constructions. For trees, we obtain geodesic-rectification and product-distance completions; for chordal graphs, the latter extends to matrix-valued transfers along clique-trees. The resulting canonical completion is characterized by sparsity of its inverse and by a maximum-absolute-determinant principle. Its metric distortion exhibits a sharp dichotomy governed by clique separator size. Applications to exact recovery from sparse hyperbolic measurements and to hierarchical and phylogenetic data are developed.
Read the full abstract

Combinatorics

A Topological Figiel-Lindenstrauss-Milman Theorem and its Applications

We prove a topological generalization of the Figiel–Lindenstrauss–Milman inequality, answering a recent question of Frick, Hosseini, and Vasileuski: every nonempty strongly regular CW complex with $v$ vertices, $f$ maximal cells, and a free involution that permutes its cells has $\mathbb Z/2$-index at most $4\log v\log f$. The classical inequality for centrally symmetric polytopes is the special case of polytope boundaries. As an application, we show that every finite simplicial complex homotopy equivalent to $\mathbb RP^d$ has at least $\exp(\Omega(\sqrt d))$ vertices. The previous best lower bound was $\Omega(d^2)$. We also construct triangulations with $\exp(O(\sqrt d))$ vertices. Using the same method, we prove a low-dimensional Postnikov factorization theorem, which gives similar vertex lower bounds for several classical families, such as complex and quaternionic projective spaces, the $d$-torus, closed symplectic and aspherical manifolds, Grassmannians, classical Lie groups, and spherical space forms. Further applications include results in learning theory, convex geometry, computational topology, and topological bounds for chromatic numbers and Vietoris–Rips complexes.
Read the full abstract

All authors Florian Frick, Kaave Hosseini, Eric Myzelev, Arya Narnapatti, Aliaksei Vasileuski

Algebraic Geometry

Neutral components of automorphism groups of (semi)rigid affine varieties

We say that an affine variety $X$ is (semi)rigid if all nontrivial actions of the additive group on $X$ have the same invariant ring. Then all such actions comprise the abelian subgroup denoted $\mathrm{SAut}(X)$. We prove that $X$ is (semi)rigid precisely when the neutral component $\mathrm{Aut}^\circ(X)$ of its automorphism group is nested. In this case, the neutral component is the semidirect product of any maximal algebraic torus and $\mathrm{SAut}(X)$. The proof uses Laurent expansions of algebraic curves in $\mathrm{Aut}^\circ(X)$.
Read the full abstract

Robotics

A traffic management system for large and heterogeneous vehicles in narrow industrial environments

The coordination of Automated Guided Vehicles (AGVs) in high-density industrial environments represents a critical challenge within Logistics 4.0, as traditional traffic management methods often lead to inefficiencies caused by negotiation-based priority assignment. To overcome the resulting limitations, this paper presents an innovative AGV traffic management system based on a Lifelong Multi-Agent Path Finding (L-MAPF) algorithm operating on roadmaps generated with Non-Uniform Rational B-Splines (NURBS) curves. The approach guarantees locally optimal coordination and ensures safe operation of large and heterogeneous AGVs. Building on this concept, the proposed framework integrates a modified version of the Bounded Horizon Conflict Based Search (CBS) technique within a Rolling Horizon Conflict Resolution strategy, utilizing an extended time horizon for each agent to enable effective conflict resolution in corridors identified by a topological map. In contrast to state-of-the-art methods for AGV fleet traffic management, the proposed solution is designed for real-world, non-standardized (i.e., non-grid-like) industrial settings characterized by narrow bidirectional corridors and high-traffic density, where AGVs of various sizes and capabilities operate simultaneously. Key contributions include an anytime conflict resolution strategy with adaptive time horizon regulation, an execution layer for safe and standard-compliant interaction with real AGVs, and an advanced mechanism for deadlock detection and resolution. Experimental results obtained in realistic industrial environments demonstrate higher throughput, with improvements of up to 11% over a conventional rule-based traffic management system, a state-of-the-art industrial method, and a priority-based L-MAPF variant, while maintaining continuous operation and improved efficiency.
Read the full abstract

All authors Alessandro Bonetti, Silvia Proia, Simone Guidetti, Lorenzo Sabattini

Physics and Society

Fundamental limits to identifying node and tie memory in temporal networks: marginal artefacts and spreading dynamics

Temporal-network models place the memory seen in contact data either on nodes, through self-excitation (branching ratio n_node), or on ties, through reinforcement (kappa). The two choices reproduce the same coarse statistics but predict different epidemics. We ask whether contact data can tell them apart and find two limits. The first is attribution. When the initiator of every event is recorded, the likelihood factorises into a timing block containing n_node and a selection block containing kappa, so the two are estimated independently. When it is not, as in proximity data, a missing-information term couples them, with a size set by the entropy of the initiator posterior. The second issue is interpretation. Even where the mechanisms separate, the fitted n_node might not accurately measure memory and it may be set by the distribution of waiting times between events. Shuffling each node's inter-event order, which keeps that distribution, typically changes the estimated n_node by less than 10%; this is a bias that longer records and a flexible scale-free kernel do not remove. Whether node memory is present must therefore be decided by model-free statistics, which find only weak order memory in the proximity records, far less than the fitted n_node around 0.9 would imply. Tie reinforcement remains recoverable, although a latent initiator inflates it by 28%-45%. The two limits lead to two recommendations: record who initiates each contact, and test a fitted node memory against shuffled and model-free benchmarks before interpreting it. On a high-school record, simulating from the fitted node memory under-predicts outbreak sizes by up to a factor of 2, whereas keeping tie reinforcement alone is closer at low transmissibility but overshoots at high.
Read the full abstract

Nuclear Theory

Development of the {\gamma} strength function with the neutron number

The M1 and E2 {\gamma} strength functions ({\gamma}sf) have been calculated for extended series of the Mo, Fe, Sn, Ge and Gd isotopes using the conventional spherical shell model (SSM) and, as a new tool, the triaxial projected shell model (TPSM). For almost all cases the strong enhancement of the M1 {\gamma}sf (low energy magnetic radiation-LEMAR) is found. In the mid-shell region, a bimodal structure of the LEMAR spike and a bump around 3 MeV, interpreted as the scissors resonance (SR), develops. The combination of LEMAR and the SR is generated by the splitting of the spherical single particle multiplets of given j caused by deformation and their fragmentation over nearby quasiparticle configurations.
Read the full abstract

All authors Stefan Frauendorf, Ronald Schwengner, Gowhar Bhat, Javid Sheikh

Software Engineering

Retrofitting Code Using LLMs to Support Exceptional Behavior

Exception Related Code (ERC), which includes throw statements, conditions (if statements) that guard those throw statements, and try/catch blocks, is an essential component of software systems, allowing developers to detect and handle exceptional states that deviate from the expected program behavior. However, manually writing ERC across large codebases is tedious. We propose a novel task: retrofitting existing code with ERC. Namely, given code (without ERC) and Exceptional Behavior Tests (EBTs) (e.g., check if method throws InvalidArgumentException if null is given as the value to the argument) we aim to automatically generate missing ERC, such that the given tests pass. We design and implement Exception Coder (EXCODER) that performs context engineering to help Large Language Models (LLMs) tackle this task. EXCODER integrates static and dynamic program analysis with LLMs by providing the extracted contextual information to the LLMs. To evaluate EXCODER, we build a benchmark constructed from GitHub Java repositories, where we systematically remove ERC in 304 methods from 75 projects. Our results demonstrate that EXCODER provides an effective, though imperfect, solution to this problem in automated code generation, offering developers the first way to implement ERC following test-driven development. When combined with Qwen 2.5 Coder 32b, EXCODER achieves pass@1, 5, and 10 rates of 85.92% (12.56 percentage points over baseline), 86.18% (12.82 p.p. over baseline), and 86.51% (13.15 p.p. over baseline), respectively, on developer-written test suites. Our manual inspection of the generated code further reveals limitations of EXCODER, pointing to directions for future work.
Read the full abstract

All authors Linghan Zhong, Jiyang Zhang, Jayanth Srinivasa, Junyi Jessy Li, Milos Gligoric

Representation Theory

Cluster Morita theorem for negative cluster categories

Fix an integer $d\leq-2$. We characterize Hom-finite algebraic triangulated categories admitting a $(-d)$-simple-minded system as stable categories $\underline{\mathrm{CM}}(B)$ of proper $(-d)$-self-injective non-positive dg algebras; equivalently, each admits a $d$-stable locally finite strictly positive dg model whose cosingular dg quotient recovers the chosen enhancement. Under a $d$-Calabi–Yau hypothesis, we give a characterization theorem for acyclic negative cluster categories in terms of the finite graded extension algebra of a simple-minded system. At chain level, Hochschild and reduced cyclic localization identify right $(d+1)$-Calabi–Yau structures on the finite-dimensional part with normalized right $d$-Calabi–Yau structures on the cosingular quotient. Finally, when the Koszul dual is proper, the Brav–Dyckerhoff evaluation morphism is a quasi-isomorphism of mixed complexes, yielding left–right Calabi–Yau symmetry.
Read the full abstract

Computation and Language

Rosetta at AlexandriaX-2026: LoRA-Adapted NileChat for Context-Aware Dialectal Arabic Dialogue Translation

This paper describes the Rosetta system for Subtask 1 (Context-Aware English-to-Dialectal Arabic Dialogue Translation) of the AlexandriaX shared task, participating in both constrained and unconstrained tracks. The approach fine-tunes a LoRA adapter on NileChat-3B using structured system/user prompts that condition generation on dialect and dialogue context. For the unconstrained track, the adapter is additionally pretrained on MADAR and PADIC. Rosetta ranked 4th in the constrained track (spBLEU 26.10) and 5th in the unconstrained track (spBLEU 25.09). The experimental results demonstrate that external pretraining helps only two of thirteen dialects while slightly hurting overall performance, suggesting negative transfer.
Read the full abstract

All authors Nada Esmaeil, Fathima Rena, Sibi Subhash, Osama Elgendy, Mina Naguib, Salma Omar, Muhammad Arif