Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Thursday 10 September

Classical Analysis and ODEs

Martingale Transforms and Compensated Bellman Estimates for Dunkl Riesz Transforms

We develop a martingale-transform framework for Dunkl harmonic analysis and apply it to prove $L^p$ estimates for the Dunkl Riesz transforms using the martingale decomposition of the Dunkl process. A fundamental difference from the classical Brownian setting is that the martingale representing the Dunkl Riesz transform of a function is not, in general, differentially subordinated to the Poisson martingale of the function itself. Our main argument bypasses this obstruction by applying Burkholder's Bellman function directly. The possible positive defect of the continuous Itô drift is compensated by the negative contribution produced by the reflection jumps. This yields $L^p$ estimates for single Dunkl Riesz transforms for $1<p<\infty$, and vector-valued estimates for $p\geq2$ with a spectral dependence on the root system. For $G$-invariant functions, differential subordination can be recovered and the resulting estimates are independent of the root system.
Read the full abstract

Artificial Intelligence

When Successful Knowledge Graph Edits Displace Correct Answers: Rank-Level Locality beyond Parameter Support

Editing a knowledge graph embedding (KGE) model to promote a desired answer can displace correct answers from the returned list. Locality tests based only on facts that reuse the edited parameter can miss this ranking effect. We introduce a common rank-displacement audit at three scopes: facts supported by the edited parameter, other correct answers to the target query, and correct answers across queries with the same relation. We also derive dimensional and geometric conditions for an update to improve the target while exactly preserving selected scores. On FB15k-237 with DistMult and ComplEx, direct promotion always moves the target into the top ten, but does so without damage in only 23.0–23.2% of edits. Strict preservation causes no measured damage, yet succeeds in only 1.3–1.4%. Support-regularized entity editing gives the highest joint success, 36.3–37.7%, while rank-truncated preservation reaches 32.8–34.7% and reduces the mean number of displaced answers from about 14 to 1.2. Experiments across dimensions, scorers, ranking conventions, and a learned editor show that locality depends on both the protected scope and the editing mechanism. KGE editing should therefore report correction success together with the incidence and severity of rank displacement.
Read the full abstract

All authors Yi-Cheng Lai, Jerry Wang, Hsin-Ling Hsu, Li-Chu Chi, Ya-Wen Teng, Hen-Hsen Huang

Artificial Intelligence

DU-NO: A Parameter-Efficient Double U-Shaped Neural Operator for Phase-Resolving Wave Modeling

Phase-resolving wave models such as FUNWAVE-TVD are the accuracy standard for nearshore dynamics, resolving the shoaling, refraction, and breaking of individual waves, but their cost rules them out for the ensembles, uncertainty quantification, and real-time warning that operational forecasting demands. Neural operators promise solver-level accuracy at a fraction of that cost, yet on wave-dominated fields the accurate ones are large: hybrid spectral-convolutional operators such as U-FNO (the strongest baseline in our study after DU-NO) buy their fidelity with tens of millions of parameters. We introduce DU-NO (Double U-shaped Neural Operator), a multiscale U-shaped spectral operator that attaches lightweight convolutional U-Net branches only at its two shallowest encoder and decoder levels. The placement follows a sampling argument: high-wavenumber content exists only on fine grids, so the local, full-band pathways go where that content lives, while the coarse, band-limited levels stay purely spectral. A depth-decaying mode schedule holds the model to 3.64M parameters, an order of magnitude below U-FNO. On our publicly released FUNWAVE-TVD benchmark, DU-NO attains the best autoregressive rollout error of six identically trained architectures, improving on U-FNO by 14.9% with 10.8x fewer parameters, and a frequency-band analysis shows the gain holds across all bands, including the high-wavenumber band where truncated-spectral operators collapse. Parameter-matched controls confirm the gain is architectural: rescaled to the same 3.6M budget, the best baseline still trails DU-NO by 28.6%. The advantage carries beyond nearshore waves: DU-NO matches the strongest baselines on 2D Navier-Stokes and wins clearly on PDEBench shallow-water rollouts. Code, trained models, and evaluation artifacts are available at https://anonymous.4open.science/r/duno-code-5A7B/.
Read the full abstract

All authors Enrique Hernandez Noguera, Md Meftahul Ferdaus, Nathan Cooper, Elias Ioup, Mahdi Abdelguerfi

Optimization and Control

Global and Unconditional $R$-Linear Convergence of Rank-Compressed Weighted LMSD Sweeps for Strictly Convex Quadratics

We study limited memory steepest descent (LMSD) with exact algebraic rank compression for strictly convex quadratic optimization. At each cycle, the method restricts the gradient history to its column space and applies the reciprocals of all Ritz values of the compressed projection in the next sweep. If the block-start gradient has at most $p$ active distinct eigenvalues, the delayed sweep terminates finitely. For nonterminating trajectories, a determinant and Cauchy–Binet formula for the complete-sweep polynomial yields global convergence without a full-rank history or a run-wise normalized-conditioning bound. Consecutive sweep endpoints define a continuous positively homogeneous map on a closed cone of compatible states. Compactness then gives an $R$-linear endpoint estimate, uniform over compatible initial states, with constants depending only on $H$ and $p$; the estimate extends to inner gradients, iterate errors, and objective gaps. Every fixed positive spectral weight $W=\omega(H)$ is linearly conjugate to the standard method. The weighted methods therefore share its decay factor, while the Euclidean-norm prefactor is increased by at most $\sqrt{\kappa_2(W)}$. This includes harmonic-Ritz LMSD, fixed power weights, and the delayed BB1 and BB2 recurrences.
Read the full abstract

Machine Learning

Score-based Outlier Generation via Controlling the Radon-Nikodym Derivative

Outliers are important for stress-testing algorithms and understanding system behaviour under rare conditions. Despite being commonly described as low-likelihood events, existing generative approaches rarely control likelihood explicitly. In this work, we introduce a measure-theoretic notion of outliers based on the distribution of log-likelihood values, which is guaranteed to assign higher probability mass to low-likelihood events with a specifiable magnitude. Building on this formulation, we derive how likelihood reweighting modifies the diffusion score and use this relation to motivate a controlled modification of the reverse-time dynamics. In particular, likelihood reweighting implies a scaling of the score function with a control term derived from the Radon-Nikodym derivative of the likelihood distributions. Correspondingly, the updated score function can be obtained with no retraining of the diffusion model. We exploit the Ornstein-Uhlenbeck semigroup underlying diffusion models to motivate an exponentially interpolated controller which approximates the true control. Experiments demonstrate controlled generation of low-likelihood samples while remaining consistent with the data geometry.
Read the full abstract

All authors Amartya Mukherjee, Tristan Milne, Kry Yik-Chau Lui, Stephanie Hazlewood, Jun Liu

Mathematical Physics

Division Algebras, Triality, and Exceptional Magic

We describe in explicit detail the rich relationship between division algebras, split composition algebras, triality, Clifford algebras, spinors, triality Lie algebras, generalized reflections, exceptional magic square Lie algebras, triality eigenspaces, 3-symmetric spaces, Vinberg theta algebras, and Exceptional Unification in particle physics.
Read the full abstract

Computation and Language

The Cost of Compression: A Rate-Distortion Limit on Factual Hallucination

Factual hallucination in closed-book question answering is often treated as a coverage problem: a model fails because the relevant fact is absent from its internal memory. This view misses a second source of error. Even when a fact has been observed, finite memory may force it to be stored only approximately. We study this effect through a simple coverage–compression model of factual recall. We consider an unstructured question-answering task with $N$ possible queries and $K$ possible answers. A learner observes $M$ training facts, compresses them into at most $B$ bits, and answers uniformly drawn test queries without retrieval. For a uniformly random ground-truth mapping, we prove $\mathcal{E} \geq \frac{M}{N}\delta^\star\!\left(\frac{B}{M}\right) + \left(1-\frac{M}{N}\right)\left(1-\frac{1}{K}\right)$, where $\delta^\star(r)$ is the inverse rate-distortion function of a uniform $K$-ary source under zero-one loss. The two terms separate compression distortion on observed facts from missing coverage on unobserved facts. The bound gives a compact way to reason about selective memory, forced compression, structure, retrieval, abstention, and long-context organization. We study the predicted signatures with theory-implied simulations and controlled fact-injection probes in modern language models that vary fact load and effective trainable memory. The result is not a complete theory of hallucination, but an information-theoretic account of a separable failure mode: lossy recall of observed facts under finite memory.
Read the full abstract

Algebraic Geometry

Poincaré duality for pro-étale $\mathbf{Q}_p$-local systems

We prove finiteness and Poincaré duality for pro-étale $\mathbf{Q}_p$-local systems on proper $p$-adic rigid-analytic spaces in the framework of Banach–Colmez spaces and establish their optimal cohomological vanishing bounds. As a consequence, we also obtain ordinary finiteness and duality for their arithmetic pro-étale cohomology. We deduce these results from their analogs for perfect complexes on the Fargues–Fontaine curve, which in turn reduce to Poincaré duality for perfect complexes over period rings. We give a simple proof of the latter duality via the same diagrammatic argument as in our previous work for finite coefficients. Along the way, we establish optimal $v$-descent for perfect complexes over certain period rings on affinoid perfectoid spaces.
Read the full abstract

All authors Shizhang Li, Wiesława Nizioł, Emanuel Reinecke, Bogdan Zavyalov

Statistical Mechanics

Models and Measures of Statistical Physics and Sociophysics for Fracture Mechanics and Earthquake Dynamics: An Introduction

The breaking or fracture of materials and damages or devastations due to earthquakes have caught our attention since the earliest stage of human civilization. In fact, at around 1500, Leonardo Da Vinci made the pioneering observation that, unlike elastic constants (formalized later by Hooke in 1678) of the materials, the tensile (breaking) strengths of nominally identical iron wires decrease drastically with their length, indicating the vanishing breaking strength of materials in the large size limit, suggesting the impossibility of constructing arbitrarily large structures. This was the first observation that unlike the elasticity of disordered materials, which remains defined in the thermodynamic limit (self averaging statistics), the breaking properties of the disordered materials have extreme (non self averaging) statistics. In spite of major and some precise developments in statistical physical modelling and characterizing the fracture mechanics (starting with Allan Griffith's crack nucleation theory in 1921 and the weakest link failure Fibre Bundle Model of Frederick Thomas Peirce in 1926) and of earthquake dynamics (starting with Robert Burridge and Leon Knopoff's continuum dynamical model in 1967 and later other discrete or lattice train models or fractal overlap models of stick slip earthquakes), no graduate level textbook in condensed matter physics or in statistical physics introduces the basic models and their properties. And now computer scientists and social scientists (coming with their social inequality measures applied to the avalanche statistics in precursor failures) are joining their efforts to explore the new precursory inequality measures for big avalanches or failures. This introductory review is designed to fill this gap with a view to introducing these to this wider audience and to take them to the current frontiers in these fields.
Read the full abstract

Robotics

Multi-Objective Agent-Based Model Predictive Controller for Plug-and-Play Vehicle Control

Functional integration is a growing trend in vehicle control, often involving the coordination of multiple controllers to achieve various objectives simultaneously. The need for flexibility and reliability has led to a "plug-and-play" approach in control system design, which presents challenges for traditional integrated model predictive control (MPC). Agent-based model predictive control (AMPC) has recently emerged as a distributed solution that treats controllers as agents, creating a collaborative framework among them to reach a common goal. However, this approach struggles to manage distributed conflicting objectives when agents are coupled or interdependent. To address this, we propose a novel, practical distributed control scheme called multi-objective AMPC, which adapts the alternating direction method of multipliers (ADMM) into a general control strategy that approximates global optimization while decoupling objectives. We systematically develop three formulations that maintain convergence while addressing control regularization and inequality constraints, applying them to complex vehicle control systems for the first time. The proposed method has been tested on two vehicle control scenarios with a multi-objective topology. Different formulations are compared through simulations, and the most computationally efficient one was implemented on an electric vehicle for real-world evaluations. The results demonstrate that the proposed multi-objective AMPC can converge approximately to the same global optimum as integrated MPC with greater flexibility and the potential to reduce computational costs.
Read the full abstract

All authors Jiaming Zhong, Ladan Khoshnevisan, Shucheng Huang, Mohammad Pirani, Yash Vardhan Pant, Amir Khajepour

Computation and Language

Extracting Dataset Mentions in Forced Displacement and FCV Documents: A Weakly Supervised Framework with LLM-Based Label Refinement

Development and humanitarian organizations produce and support surveys, administrative registries, and other data resources to inform research, policy, and operations, yet systematically identifying where these datasets are referenced remains difficult. Such references are dispersed across research papers, project documents, humanitarian reports, and other unstructured text, limiting both the ability to trace data use and to identify potential gaps in data availability or dissemination. We present a weakly supervised framework for adapting dataset extraction to forced displacement and Fragile, Conflict, and Violence (FCV) documents without first constructing a large manually labeled training corpus. A lightweight model trained on general research literature generates candidate dataset mentions from unlabeled domain documents, which a frontier large language model (LLM) reviews in context, validating or rejecting candidates and correcting their extraction boundaries. The resulting annotations are supplemented with targeted synthetic and contrastive examples and used to fine-tune the lightweight model for large-scale extraction. We evaluate the resulting model on an independent gold-standard benchmark of 1,706 text passages spanning research, humanitarian, and operational documents. Across the full benchmark, the model achieves 74.1% precision and 70.5% recall at the mention level; among passages containing dataset references, precision reaches 89.5%. At the passage level, the model achieves 88.2% accuracy and 88.6% specificity in distinguishing passages with dataset references from those without them. These results demonstrate a practical approach for constructing domain-specific supervision when labeled data are limited, and provide a technical foundation for larger-scale analysis of data use and potential gaps in the displacement data landscape.
Read the full abstract

All authors Rafael Macalaba, Aivin V. Solatorio, Patrick Michael Brock, Olivier Dupriez

Data Structures and Algorithms

A Non-constant Lower Bound for Grammar-Based Compression with Greedy

We prove a lower bound of {\Omega}(log n/ log log n) on the approximation ratio of the global grammar-based compression algorithm Greedy. To our knowledge, the previously best lower bound was a constant, and the existence of a nonconstant lower bound had remained open for more than twenty years. Our bound holds on an infinite family of words of length n, over alphabets of growing size, for every execution using left-to-right occurrence replacement and arbitrary tie-breaking. The lower bound is also formally verified in Lean 4.
Read the full abstract

Artificial Intelligence

Language Is an Insufficient Substrate for Quantitative Reasoning, and Consequential Domains Need Large Quantitative Models

The prevailing assumption in applied machine learning is that progress on consequential quantitative decisions such as pricing risk, allocating capital, triaging patients, or containing a network intrusion will follow from progress in large language models (LLMs). A language model is trained on a representation of the world that was produced by human description; description is a lossy encoding of the quantitative record, and the loss is irreversible: no downstream model, at any scale, can recover from a description what the description did not encode. We formalize this as a property of the representation on which a model is trained rather than of the model capacity, and we identify three further properties that consequential settings demand of a model and that a language substrate cannot supply by construction: reproducibility, lineage from every output back to the source records that produced. it, and calibrated uncertainty. We argue that these properties define a distinct model class, which we call the Large Quantitative Model (LQM).
Read the full abstract

Dynamical Systems

Thermodynamic Formalism Out of Equilibrium Part III: Local Limit Theorem and Statistical Properties

We study limit theorems for random dynamical systems. We recast the random dynamics via the skew-product of the two-point motion (the Varadhan trick). Using this approach we prove several statistical properties for the system, including quenched central limit theorems with rates, quenched local limit theorem, large deviations, and decay of correlations. Then, in applications we show how to verify the general conditions using spectral properties of appropriate operators. A key application is the study of effectively expanding on average random diffeomorphisms (in any dimension, which are allowed to be dissipative). In particular, this is the first instance of proving local limit theorems in such a broad setting, without imposing restrictions on the dynamics. We provide several new examples.
Read the full abstract

Robotics

RodForesight: A World Model Enhanced Diffusion Policy for Slender Rod Insertion

Slender rod insertion arises in precision manufacturing, where millimetre scale diameter and tight clearances demand accurate perception and control. Conventional peg-in-hole methods assume a rigid object whose tip pose is fixed relative to the gripper. This assumption breaks down for a high aspect ratio rod, which can bend during manipulation, making its tip motion dependent on the rod configuration, grasp, material properties, and contact. We present RodForesight, a learning framework that factorises the task into two stages: 1) coarse approaching, which uses visual servoing to map diverse initial configurations into a compact near hole hand-off region; and 2) predictive insertion, which performs fine alignment and completes the insertion. It is worth noting that the two stages can be wrapped into an end-to-end design. During insertion, a diffusion policy generates candidate action chunks, while an action conditioned world model predicts their effects on rod-hole alignment. This pre-execution evaluation enables RodForesight to select the best action chunk based on predicted tilt and radial errors before execution. Experiments investigate the performance of different stages and the end-to-end setting, where RodForesight improves the success rate from 88.9% to 96.7%, compared to baseline methods such as diffusion policy.
Read the full abstract

All authors Chuanbo Yu, Mingyu Yue, Yan Lyu, Chuhan Song, Peng Wang

Differential Geometry

A Gap Theorem for the Möbius Cross Energy Near the Hopf Link

We prove that the critical value $2\pi^2$ is isolated for the Möbius cross energy of two-component links in the round three dimensional sphere $\mathbb{S}^{3}$. Specifically, there exists $\varepsilon_0>0$ such that any non-split, regular $H^2$ pair of curves with disjoint images, having vanishing first variation and energy at most $2\pi^2+\varepsilon_0$, must lie in the Möbius-reparametrization orbit of the standard Hopf link.
Read the full abstract

Artificial Intelligence

When Do Language Models Add Value? Relative Competence in Hybrid Event Forecasting

When a forecasting system already has a prediction from a market, crowd, or statistical model, when should it use a language model? Standalone accuracy cannot answer this question because a less accurate model may still improve the existing forecast. We study this distinction through relative competence, separating a model's replacement advantage from its complementary value. Under Brier loss (squared error between predicted probabilities and binary outcomes), we characterize when model disagreement can correct external forecast errors and derive the population gain from regime-specific affine pooling. We introduce a competence gate that estimates source weights from resolved outcomes, shrinks regime-specific estimates toward a global solution, and chronologically recalibrates the pooled forecast. Across 4,974 resolved binary questions and four language models, the best standalone model has 24.94% higher Brier loss than the calibrated external forecast, yet the gate improves that reference by 3.35% (95% CI, 1.80 to 4.90%). Model contributions vary across forecasting regimes, with larger corrections in thinner markets and forecasting crowds and smaller corrections in higher-participation settings. The gate also shows no statistically detectable performance difference from more flexible contextual aggregators. These results demonstrate that standalone superiority is not necessary for complementary predictive value and that language models should be evaluated relative to the forecasts already available.
Read the full abstract

Optimization and Control

$R$-Linear Convergence of Barzilai-Borwein Methods on Strictly Convex Quadratics via Closed-Cone Homogeneous Dynamics

We give an $R$-linear convergence proof for BB1, BB2, and fixed positive spectral-weight variants on finite-dimensional strictly convex quadratics. The delayed recurrence is written as a first-order system on the closed cone of compatible consecutive-gradient pairs. Its transition is continuous and positively homogeneous of degree one, including at finite termination. A compactness theorem shows that pointwise convergence of every cone orbit implies a uniform finite-step contraction and hence a global $R$-linear estimate. By a realization lemma, every compatible state initiates a BB1 trajectory, so Raydan's theorem yields pointwise stability on the entire cone. Finally, the transformation $g\mapsto W^{1/2}g$ conjugates every fixed positive spectral-weight rule to BB1. Consequently, BB1, BB2, and all such weighted rules have the same homogeneous growth radius.
Read the full abstract

Computer Vision

Beyond Argmax: A Mechanistic Study of Semantic Retention in Frozen Foundation-Model Composition for Generalized Few-Shot 3D Segmentation

Classical classifier-combination work distinguishes score-level fusion from hard decision-level voting. We revisit this distinction where independently pretrained, frozen foundation models are composed at inference time for generalized few-shot 3D segmentation. We ask: how much useful semantic information is lost when heterogeneous sources are collapsed to a single class before they can interact? We answer with a same-input semantic-retention intervention. Dense RegionPLC and sparse cross-view SAM3 evidence, model weights, masks, geometry, vocabularies, and fusion rules are frozen; only the number of semantic alternatives retained before interaction is varied via a matched top-k ladder. On 156 held-out ScanNet200 scenes, top-1 reaches 28.47 harmonic-mean (HM) IoU while full distribution fusion reaches 34.87 HM (+6.40, 95% CI [+5.24,+7.64]). The pattern replicates on 50 ScanNet++ scenes: 23.02 vs. 26.50 HM (+3.48, 95% CI [+1.64,+5.93]). The conclusion is robust: full-distribution HM is stable across sparse-source weights 0.3–0.7; alternative operators (max, geometric pooling) also outperform top-1; and a GroundingDINO–SAM2.1 source-replacement diagnostic shows monotonic HM increase from 14.77 to 18.75 with full retention. Calibration diagnostics reveal opposite miscalibration of the two sources, yet correcting calibration does not eliminate the retention advantage. Across datasets and source stacks, most information is recovered by retaining a compact set of plausible alternatives. The contribution is a controlled diagnosis of premature semantic collapse as a repeatable information bottleneck in heterogeneous frozen-model composition.
Read the full abstract

High Energy Physics (Phenomenology)

The devil in the transition: NLO nucleation and the particle physics behind the PTA signal

We quantify how the treatment of a strongly supercooled phase transition affects the particle-physics interpretation of a nanohertz gravitational-wave signal. For the classically conformal Abelian Higgs model, we calculate the nucleation rate at NLO in the dimensionally reduced theory and test the gradient expansion against explicit fluctuation determinants. A calibrated correction reproduces the determinant exponent with a mean absolute relative difference of $0.8\%$ and allows this information to be included throughout the parameter scan. We propagate the corrected rate through percolation, reheating and gravitational-wave production, and confront the resulting spectra with the NANOGrav 15-year and IPTA DR2 data. The corrected NLO calculation shifts the preferred gauge coupling by $9\%$ and $13\%$, respectively, and the input scale by $18\%$ for NANOGrav. After the determinant calibration, the largest theoretical uncertainties arise from uncertainties in the gravitational-wave spectra and the relation between $R_\star$ and $\beta/H$.
Read the full abstract

Human-Computer Interaction

MAIA: Multi-Agent Intent Articulation for Requirement Discovery in Art Commissions

In bespoke art commissions, laypeople know what they feel but lack the words to specify it: one participant wanted a laid-off truck driver depicted as "a ghost in his own machine" but left the medium, scale, and palette unsaid. We frame this as an articulation bottleneck at an under-served upstream stage: requirement discovery, which precedes any artist or image generator and forces the commissioner to constitute intent in the first place. We present MAIA (Multi-Agent Intent Articulation), a multi-agent system that scaffolds this stage through Socratic inquiry under a "Verification over Invention" rule, turning vague affect into a text-only brief of visual terms the user verifies. In a within-subjects study (N = 16), the full configuration produced a large, significant gain in Cognitive Support over a minimal baseline (r = 0.97, p_FDR = 0.003; LMM p_FDR < 0.001). Thematic analysis traces the same mechanism, and a validator gate structurally blocks unratified content. An exploratory blind review by three professional concept artists provides complementary descriptive evidence that the rewritten briefs were more complete and executable.
Read the full abstract

All authors Yu-Chao Wang, Yanhong Lu, Yingjie Victor Chen, Tim McGraw

High Energy Physics (Phenomenology)

Driver and damping of the directed-flow response in heavy-ion collisions

The initial-state geometry plays a crucial role in driving directed flow, while the dissipative response of the medium dampens it. Both of these factors influence how the directed-flow slope varies with system size. We developed a method to differentiate between these driving and damping effects on charged-hadron directed flow in O+O, Cu+Cu, Ru+Ru, Au+Au, and U+U collisions at $\sqrt{s_{\mathrm{NN}}} = 200$~GeV using an improved version of the string-melting AMPT model. We formulated three scaling observables based on the entropy density, the number of participants, and the mass number. A dimensionless ratio was constructed, revealing the threshold mass number $A \approx 35$ in central collisions from the entropy and participant scaling, indicating the onset of collective behavior. We constructed a kinetic-theory Knudsen-number ($\mathrm{Kn}$) map to analyze the contributions of the initial-state driver, which grows as $\mathrm{Kn}^{\kappa}$ with $\kappa \approx 2$, and a final-state viscous damping of the hydrodynamic response with characteristic scale $\mathrm{Kn}_0 \approx 0.27$ for the directed flow slope. This damping scale is found to be about a factor of 2.5 smaller than the $\mathrm{Kn}_0 \approx 0.7$ extracted from the elliptic flow. Furthermore, we determined the ratio of shear viscosity to entropy density, $\eta/s$, to be between 0.10 and 0.20, using an alternative method that does not rely on fitting flow harmonics.
Read the full abstract

Robotics

Uncertainty-Aware Conflict Detection Against Operator-Conditioned Weather Hazards

Strategic flight plan validation in Advanced Air Mobility (AAM) environments requires robust methods for predicting aircraft state uncertainty and detecting potential conflicts with dynamic airspace hazards. This paper presents a novel framework for uncertainty-conditioned trajectory prediction combined with polyhedra hazard representation for pre-flight conflict detection. We introduce a closed-form uncertainty estimation method that couples non-uniform rational B-spline (NURBS) curve fitting for kinematic trajectory generation with a Kalman Filter for state covariance propagation. Drawing from the Light Propagation Algorithm (LPA) paradigm, we employ a sigmoid-blended measurement noise model that captures the uncertainty reduction behavior of flight management systems approaching the required time of arrival (RTA) for waypoints. The resulting temporal uncertainty bounds are derived through a velocity-to-time variance transformation, enabling probabilistic assessment of arrival time deviations along the flight path. For hazard representation, we develop an operator-conditioned classification scheme that transforms gridded environmental data, specifically weather phenomena, into three-dimensional polyhedra volumes with intensity-based stratification. These hazard polyhedra incorporate aircraft-specific safety buffers computed from vehicle performance characteristics. Conflict detection is performed through mesh intersection algorithms operating on the spatial uncertainty tube surrounding the mean trajectory against the hazard polyhedra and temporal overlap. The framework enables the continuous strategic validation of flight plans throughout the pre-flight planning time horizon as environmental conditions evolve.
Read the full abstract

Statistical Methodology

Operator-matched spatial regression

A standard spatial regression model $Y = X^\top\beta + U$, with covariates $X$ and a Gaussian random field $U$ with Matérn covariance, decouples covariate effects from spatial dependence. In several applications this is mechanistically implausible, as covariates likely drive the dynamics generating the residual covariance, and it is statistically problematic, since the generalised least-squares estimator of $\beta$ may be biased by spatial self-confounding. We propose operator-matched spatial regression, where covariates enter both pointwise and as deterministic forcings in a stochastic partial differential equation (SPDE) that generates the random effect, partitioning the apparent effect into local and operator-mediated components. The formulation arises as the steady state of a transport–relaxation equation forced by $X$, giving the parameters physical interpretations. We show that self-confounding is resolved by construction and that maximum likelihood inference for the regression coefficients, implementable through standard covariance-based methods, is calibrated when the operator parameters are known and, under expanding-domain asymptotics, when they are jointly estimated. A computationally efficient finite element implementation is introduced and justified via bounds on the discretisation error. Applications to temperature–altitude regression and air-quality monitoring show that the method matches or outperforms alternatives and produces physically meaningful results.
Read the full abstract

Mesoscale and Nanoscale Physics

Orbital-geometric spin response: inter-band coherence versus orbital-to-spin conversion

Orbitronics seeks to convert orbital angular momentum (OAM) into spin, but its microscopic dynamics is not understood. Here I show that, at moderate spin-orbit coupling, an electrically induced spin density contains a direct term and an orbital-geometric spin response (OGSR) due to inter-band coherence of the spinless parent Hamiltonian—related to OAM but not descended from it. In massive Dirac fermions the OGSR survives as the net OAM vanishes, and generates counterflow, opposing the direct response. These results provide guidelines for optimising orbitronic systems.
Read the full abstract

Chaotic Dynamics

Mechanisms for extreme events in position-dependent mass systems

Oscillators defined on curved spaces provide a natural framework for exploring geometry-induced nonlinear dynamics. The two-dimensional Mathews-Lakshmanan oscillator and Higgs oscillator are prominent examples of geometrically induced nonlinear oscillators. The two-dimensional Higgs oscillator in flat space arises from a conformal (stereographic) projection of the harmonic oscillator on the sphere S2 onto the two-dimensional plane. Its one-dimensional counterpart, defined by a non-Euclidean geometry with curvature parameter, exhibits chaotic dynamics and extreme events (EEs) when subjected to damping and external driving forces [1]. In this work, we introduce coupling through mass interaction among multiple one-dimensional damped and forced Higgs oscillators and investigate the resulting collective nonlinear dynamics within a many-particle framework. More importantly, we establish the connection between the conformal mass m(x) and the extrema of velocity through a power-law relation, demonstrating how the conformal mass regulates the turning points leading to the emergence of extreme events (EEs). Furthermore, to provide additional insight into the underlying mechanism, we quantify the energy synchronization error among the oscillators, thereby revealing how energy synchronization evolves during the onset of EEs.
Read the full abstract

All authors Wasif Ahamed M, Chithiika Ruby V, Sathish Aravindh M, Venkatesan A, Lakshmanan M

Distributed Computing

Shards on a Shoestring: Empirical Characterization of NEAR Protocol Nightshade Sharding on Commodity Hardware

NEAR Protocol's Nightshade architecture targets one million transactions per second (TPS) through horizontal sharding of both state and computation. Published benchmarks were produced on expensive Google Cloud Platform infrastructure costing approximately \$700 per hour, leaving a significant reproducibility gap for academic research. We present the first independent empirical characterization of NEAR Nightshade sharding on commodity hardware: a Chameleon Cloud bare-metal node with 48 hyperthreaded Intel Xeon cores, 128\,GB RAM, and HDD storage at 80--100\,MB/s. We systematically sweep shard count from $N{=}1$ to $N{=}24$, measuring aggregate TPS, per-shard TPS, block time, BFT finality, memory, and disk I/O. We identify three distinct bottleneck regimes: L3 cache pressure at low $N$, witness gossip pipeline saturation at mid $N$, and coherence collapse at high $N$. A key unexpected finding is that HDD write latency acts as implicit flow control for the witness gossip pipeline. Removing it via RAM-backed tmpfs causes complete chain stall at $N{=}16$, with a 29$\times$ spike in orphan witness rate at 47\% CPU utilization. Aggregate TPS peaks at $N{=}8$ (+40\% over $N{=}1$) then reverses, with per-shard TPS collapsing 23$\times$ by $N{=}24$. Our dataset provides the first commodity-hardware calibration baseline for the companion SimPy sharding simulator.
Read the full abstract

Computer Vision

Does Video Memory Use What It Retrieves? A Causal Audit of Memory Specificity

Video models increasingly use memory to preserve information over long sequences, with the assumption that gains come from retrieving and using the correct past content. Standard memory ablations test whether memory helps, but not whether the retrieved content is responsible. We test this directly with read-time memory substitution, which replaces the consumed memory value while leaving the rest of the computation unchanged. This separates memory benefit from memory specificity, the extent to which the gain depends on retrieved content. Across frozen video world models, identity-free controls containing no evaluation-specific content recover essentially the full benefit on Ego-Exo4D and 7-Scenes and about 70% on TUM. In the Ego-Exo4D dose response, recovery falls from 102% to 1% as these values move away from observed training-memory representations, supporting representation repair as the best-supported explanation in this setting. WorldMem shows graded dependence. A wrong memory from the same trajectory recovers 94.1% of the PSNR benefit relative to zero content, while a donor from a disjoint trajectory and biome recovers 43.7%. SAM 2 shows strong content dependence. On DAVIS, replacing the correct spatial memory with a valid wrong memory reduces mean region and boundary score from 0.926 to 0.182. At MOSEv2 reappearance, it falls from 0.459 to 0.000. These results show that memory gains can depend on generic representation support, broader context, or exact episodic content. Read-time substitution provides a direct way to distinguish them.
Read the full abstract

All authors Aditi Tiwari, Akshit Bhalla, Darshan Prasad, Heng Ji

Information Theory

Receiver-Surface Hit Patterns via Legendre Approximation for Molecular Signal Detection

Detecting whether a transmitter is actively communicating with a receiver is a fundamental problem in molecular communications. A spherical receiver may measure not only the number and arrival times of absorbed molecules, but also their absorption locations on the receiver surface. These locations contain a directional signature that is lost in count-only detection. In this letter, we develop a molecular signal detector based on a Legendre polynomial expansion of the receiver-surface hit density and extend it to a Legendre-based Viterbi sequence detector. By exploiting the surface-level directional signature of molecular arrivals, the proposed detectors provide geometry-aware, efficient, and better-performing alternatives to count-only detection.
Read the full abstract

High Energy Physics (Theory)

Ladder Operators and Fermionic Tensor Fields on Maximally Symmetric Spaces

We construct first-order ladder operators for spin-$\frac{1}{2}$ Dirac fields and transverse, $\gamma$-traceless spin-$\frac{3}{2}$ Rarita–Schwinger fields on maximally symmetric spaces using non-isometric closed conformal Killing vectors. For both spins, we find three distinct operators: two of them, $\mathcal{D}$ and $\mathcal{D}^{s}$, shift the conformal label as $\Delta \to \Delta \pm 1$, while a third operator, $\widetilde{\mathcal{D}}$, reverses the sign of the Dirac eigenvalue at fixed $\Delta$. The latter exists in arbitrary dimensions and reduces to the standard infinitesimal conformal transformation of a primary spinor when acting on massless spin-$\frac{1}{2}$ fields. On $S^N$, the ladder operators relate neighboring fermionic harmonics and generate the spinor tower from Killing-spinor seeds. In Lorentzian signature, we study their action on de Sitter mode spaces. In $dS_4$, the spin-$\frac{3}{2}$ ladders connect the zero-Dirac-mass sector with the fermionic gauge points $M=\pm i/\ell$, while $\widetilde{\mathcal{D}}$ extends to arbitrary mass the conformal-like transformation previously identified for the gauge field. We explicitly present the spin-$\frac{1}{2}$ and spin-$\frac{3}{2}$ fermionic harmonics on spheres as well as the de Sitter mode solutions. Finally, we derive the Casimir operators on $S^3$, $dS_3$, and $dS_4$ corresponding to SO(4), SO(3,1) and SO(4,1), and relate their eigenvalues for UIRs to the allowed masses in the fermionic field equations. These results provide a unified geometric framework relating conformal Killing geometry, fermionic Dirac-type spectra, and the representation theory of maximally symmetric spaces.
Read the full abstract