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

Sunday 13 September

Cosmology and Nongalactic Astrophysics

Bayesian Inference of the Tip of the Red Giant Branch: I. One-Dimensional Analysis

The tip of the red giant branch (TRGB) is a relative distance measure that can be used, as part of a cosmic distance ladder, to infer the Hubble constant. We present a Bayesian framework for TRGB inference that incorporates selection effects and propagates per-star flux uncertainties, modelling the observed catalogue as a realisation of an inhomogeneous Poisson point process which includes the RGB and contamination from the asymptotic giant branch (AGB). We derive expressions for the predicted TRGB uncertainty in terms of the photometric noise, stellar density fainter than the tip, and the ratio of the AGB to AGB+RGB number densities, $r$. We validate these results using synthetic data from a simplified luminosity function. Applying the full model to synthetic catalogues, we find that the dependence on $r$ is the strongest of the three, and that reliable inference requires $r\lesssim0.5$; otherwise, the posterior can be multimodal, and the TRGB cannot reliably be identified. We then fit data from 11 Hubble Space Telescope fields of the calibrator galaxy NGC 4258. We find intrinsic field-to-field scatter of $\tau=0.067^{+0.023}_{-0.017}$ mag (beyond the measurement noise), and a galaxy-level, extinction-corrected TRGB magnitude of $25.324 \pm 0.026$ in the F814W filter. Combining this with the maser distance modulus to NGC 4258 of $29.397 \pm 0.032$ mag, we determine the absolute magnitude of the TRGB to be $M_{\mathrm{F814W}}^{\mathrm{TRGB}} = -4.073 \pm 0.026$ (tip) $\pm 0.032$ (dist), consistent with, but brighter than, other recent analyses of the same data.
Read the full abstract

Artificial Intelligence

A note on goal-based hierarchical RL

The agent-centric general value function (ACGVF) construction of \citet{tasse2026goal} lets the agent make two decisions that are normally imposed by the environment or agent designer: which goal to pursue and when to declare a goal as finished (in addition to choosing the action). This is a very general framework that subsumes almost all prior work on reinforcement learning, control and planning, as well as more general formalisms proposed in the cognitive sciences. However, it assumes the environment is fully observed, i.e., that the observation is a sufficient statistic. In \citet{murphy2025rl}, a general agent design was proposed where the policy is based on an internal belief state $z_t$ and an internal goal; however, the goals were assumed to be externally provided. In this note, we unify and extend these two approaches using the formalism of hierarchical hidden Markov models (HHMM) \citep{murphy2001hhmm}.
Read the full abstract

Nuclear Experiment

Photon-induced $J/\psi$ as a linearly polarized probe of collision geometry in relativistic heavy-ion collisions

In relativistic heavy-ion collisions, the linear polarization of quasi-real photons can correlate the spin orientation of photon-induced vector mesons with the collision geometry. To explore this sensitivity, we present the first measurement of the decay angular distribution of photon-induced $J/\psi$ with respect to the event plane in heavy-ion collisions with hadronic overlap. The analysis uses Ru+Ru and Zr+Zr collisions at a nucleon–nucleon center-of-mass energy of $\sqrt{s_{\mathrm{NN}}}=200$ GeV recorded by STAR. After correcting for the finite event-plane resolution and subtracting the residual hadronic contribution, we extract a negative second-order modulation, $A_2^{\rm phot} = -0.39 \pm 0.11~(\mathrm{stat.}) \pm 0.04~(\mathrm{sys.})$, for $|y^{ee}|<0.8$, $p_{\mathrm T}^{ee}<0.2~\mathrm{GeV}/c$, and 30–80% centrality. This modulation provides evidence that the $J/\psi$ polarization is correlated with the event plane, as expected for linearly polarized photons. The observed modulation establishes polarized $J/\psi$ photoproduction as a direct probe of the transverse orientation of the initial collision geometry.
Read the full abstract

High Energy Physics (Theory)

Attraction and repulsion along extremal Einstein–two-Maxwell–dilaton branches

We study extremal mass branches in four-dimensional Einstein gravity coupled to one dilaton and two Maxwell fields with opposite-sign dilaton couplings. For generic couplings the extremal mass is governed by a nonlinear first-order equation with no known closed-form solution. We prove that this equation has a unique positive $C^2$ solution on the full real charge-ratio line and that the solution is real analytic, so positivity on the entire positive charge cone selects a unique global mass branch. Along this branch, any two nonproportional positive charge vectors attract for $ab>-1$, have vanishing leading force at $ab=-1$, and repel for $ab<-1$. The same transition fixes the transverse convexity of the extremal mass surface and the sign of the mass difference under arbitrary finite positive-charge partitions. The sign theorem extends to higher dimensions through the known dimensional rescaling. A radial reconstruction then shows that every point of the mass branch defines an asymptotically flat exterior with a finite-area inner endpoint, while smooth or analytic horizon extension is a separate condition that restricts the couplings and scalar flow.
Read the full abstract

Numerical Analysis

Localized maximum-norm error estimates for the Hellan-Herrmann-Johnson method

We derive localized maximum-norm bounds for bending moments computed by the Hellan-Herrmann-Johnson method for the clamped Kirchhoff plate problem. The main difficulty is to localize the discrete stress without leaving the HHJ space or violating its kernel constraint. Using symmetric-curl potentials, we construct a kernel-preserving localization and connect local Green stresses with a global discrete Green stress. This argument separates the local interpolation error from a weaker global pollution term. Under explicit regularity assumptions on the auxiliary problems, the resulting estimates give optimal pointwise convergence for bending-moment values and elementwise first derivatives. No logarithmic loss occurs for positive polynomial degrees, whereas the lowest-order value estimate retains a logarithmic factor. Under additional reflection symmetry, symmetric recovery improves bending-moment values for even polynomial degrees and first derivatives for odd degrees. The proved gains are one third and one half of an order, respectively. Numerical experiments confirm this parity dependence and exhibit gains close to one full order, exceeding those established theoretically.
Read the full abstract

Optimization and Control

Exponential Turnpike in Optimal Boundary Control of Multi-Dimensional First-Order Hyperbolic Systems

We establish an exponential turnpike property for optimal boundary control of multi-dimensional first-order linear hyperbolic systems in which both the control and observation operators are unbounded and the cost functions may be nonquadratic. The main assumptions are internal and boundary dissipation conditions. These conditions ensure that the associated input-to-state and input-to-output maps are bounded, with operator norms independent of the time horizon T. This uniform boundedness is essential to the proof, which combines weighted energy estimates for the forward and adjoint equations, input-output duality, and strong convexity. Finally, we apply the result to the linearized two-dimensional Saint-Venant equations with sluice-gate control and illustrate the turnpike behavior numerically.
Read the full abstract

Quantum Physics

Simulating Quantum Physics Experiments One Event at a Time

This text explores the fundamental divide between empirical laboratory data and continuous theoretical physics models, framing the "quantum measurement paradox" as an ontological error, specifically E.T. Jaynes' “mind projection fallacy” where abstract mathematical tools like wavefunctions are mistaken for physical reality. While quantum theory successfully predicts ensemble averages, it remains inherently silent on individual, event-by-event detection statistics. To resolve these conceptual mysteries without resorting to ad-hoc explanations like wavefunction collapse, the text introduces Event-By-Event Simulation (EBES). As a modular, discrete-event simulation framework utilizing causally-driven Deterministic Learning Machines (DLMs), EBES bypasses continuous time and pre-specified probability distributions. Instead, it generates discrete data from the bottom up in a strictly localized, cause-and-effect manner. Ultimately, EBES provides a computationally efficient methodology that mirrors actual laboratory observations, modeling phenomena that lie entirely beyond the reach of standard quantum theory.
Read the full abstract

Soft Condensed Matter

Glassiness and dynamic arrest in magnetic and non-magnetic colloids

We investigate and compare a range of indicators for glassiness in monodisperse magnetic and non-magnetic soft-sphere fluids at low temperatures with a view to exploring the effect of the magnetic moment. We perform extensive molecular dynamics simulations using the Stockmayer model for magnetic fluids and a pure Lennard-Jones interaction for the non-magnetic case. Our investigations involve quenching experiments, in which both systems are rapidly cooled deep below their freezing temperatures. Although the Lennard-Jones fluid forms compact aggregates, the inclusion of dipolar interactions promotes the development of branched and open morphologies. After characterizing the static properties of the frozen structures, we focus on their dynamics. A key observable is the self-part of the van Hove function, which measures the probability that a particle is displaced by a distance $\Delta$ over time $t$. In both fluids, this function exhibits non-Gaussian behavior — thereby providing a signature of dynamic heterogeneity and glassiness. This behavior stems from a separation of time scales between two distinct processes: mobile particles that escape their environments and immobile particles that vibrate within cages. In particular, we find a heavier tail in the van Hove function for the Stockmayer fluid, which is a consequence of the strongly correlated motion in chain-like structures found there. These findings shed light on core relaxation mechanisms in magnetic fluids, advancing our understanding of magnetically responsive colloidal systems.
Read the full abstract

All authors Anuj Kumar Singh, Lambert Münster, Martin Weigel, Varsha Banerjee

Geometric Topology

From veering triangulations to convergence actions and back again

Suppose that $M$ is a finite-volume cusped hyperbolic three-manifold, equipped with a veering triangulation $\mathcal{V}$. We prove that the action of the fundamental group of $M$ on the veering two-sphere is a geometrically finite convergence action. Applying a result of Yaman, we deduce that the veering two-sphere is equivariantly homeomorphic to the boundary of hyperbolic space. As an application, we obtain Cannon-Thurston maps associated to veering triangulations. If $\mathcal{V}$ is layered we recover the classical Cannon-Thurston map. If it is not we obtain Cannon-Thurston maps that do not come from surface subgroups. These are the first such examples in the cusped case. Finally, we implement an algorithm to draw approximations of these Cannon-Thurston maps. This improves upon previous approximations obtained by Thurston and others.
Read the full abstract

Populations and Evolution

Evolution of Fast and Slow Life Histories in Resource-Constrained Populations with Mass-Mortality Events

We study the evolution of the speed of life history in populations competing for a single growth-limiting resource subject to demographic stochasticity and mass mortality events. We focus on a quasi-neutral regime in which competing types have equal resource-use efficiency but differ in life-history speed. In the large-carrying-capacity scaling limit, we reduce the model to a one-dimensional jump-diffusion supported on the manifold of ecological equilibria. The drift and diffusion components capture the joint effects of demographic stochasticity and density regulation, while the jump component is driven by the catastrophic mortality events. Using this limiting process, we derive a first-order approximation for the fixation probability of an invading type that differs slightly in life history speed from the resident population. Calculations show that small demographic events tend to favor slower life histories, whereas catastrophic mortality events create transient periods of resource abundance that benefit faster types. The interaction of these two evolutionary forces allows for the existence of a nontrivial evolutionarily attractive life-history speed, which is an increasing function of the frequency and intensity of the catastrophic mortality events. These results provide a rigorous mathematical framework for some classical r/K-selection arguments, and furthermore demonstrate how mass mortality events can maintain selection for faster life histories even in resource-constrained populations.
Read the full abstract

Computer Vision

Direct Conditional Transition Sampling for Diffusion Inverse Problems

Training-free diffusion inverse solvers typically choose between local measurement guidance and costly clean-space posterior updates. Independent posterior refresh can improve global correction by sampling a clean conditional and re-noising it, but its practical realization requires probability-flow ODE integration and clean-space Markov chain Monte Carlo (MCMC). We propose Direct Conditional Transition Sampling (DCTS), a direct stochastic-flow approximation to the same ideal refresh target. Rather than explicitly drawing a clean sample, DCTS estimates the measurement-conditioned clean mean along a short inner path and transports Gaussian source noise directly to the next noisy state. A denoiser-compatible sufficient statistic and a covariance-scaled operator update enable this conditional-mean estimation. Experiments on four inverse problems demonstrate that DCTS achieves competitive reconstruction quality with up to $16.8\times$ speedups over competing methods.
Read the full abstract

Machine Learning

Diagnosing Temporal Misalignment in Multichannel Time-Series Classification with Minimum Description Length

Multichannel time-series classification commonly assumes synchronized sensor streams, although latency, clock drift, and preprocessing can introduce relative delays during data collection or after deployment. Existing synchronization solutions are often hardware-specific and difficult to apply retrospectively. Consequently, synchronization problems may remain undetected while classification performance is suboptimal. We introduce a classifier- and label-free diagnostic based on minimum description length (MDL). Our method applies candidate temporal shifts to sensor groups and measures how efficiently one group can be encoded through a representation of the remaining channels. An increased codelength indicates that the shift destroys shared temporal structure, whereas the minimum identifies the alignment most strongly supported by the data. Unlike learned synchronization methods, the diagnostic requires neither retraining nor a trusted aligned reference and can therefore test both training and deployment data for misalignments. Experiments on two controlled synthetic tasks and nine real-world datasets show that the metric exposes alignment structure and can recover accuracy under induced deployment drift. A whole-dataset audit further identifies stable nonzero MDL optima in established benchmarks including FordChallenge, Opportunity, PAMAP2, and UCIActivity, revealing potential systematic offsets that conventional model evaluation does not expose. Our method thus provides a general-purpose tool for detecting, understanding, and correcting temporal misalignment throughout the time-series learning pipeline. Our code is available under https://github.com/sbuschjaeger/mdl-temporal-misalignment.
Read the full abstract

All authors Sebastian Buschjäger, Michael Frichert, Daniel Kuhse, Jian-Jia Chen

Quantum Physics

When is global evolutionary search useful for variational quantum algorithms? A landscape-first study

Variational quantum algorithms recast state preparation as classical nonconvex optimization, but it is often unclear when multistart local search suffices and when population-based global search justifies its evaluation cost. Using a landscape-first design, controlled QAOA experiments identify two mechanisms making local search unreliable: parameter reuse across circuit layers and competition between 2-local and 3-local cost terms. Increasing QAOA depth alone does not replicate this effect. We test these mechanisms across eight unseen spin glasses, fresh $N=10$ and $N=12$ instances, and standard MaxCut, transverse-field Ising, and Heisenberg models. On all eight unseen spin glasses, adaptive differential evolution (DE) achieves lower median error than both multistart BFGS and multistart Powell on the two difficult constructions, whereas the independent-depth control does not. The parameter-reuse effect transfers to MaxCut at both sizes, while standard VQE models remain favorable to local search. A pre-benchmark landscape score combining random-start local outcomes and 1D parameter slices is fixed from confirmation data before evaluating new optimizers. It predicts whether adaptive DE outperforms multistart BFGS by over one spectral-range percentage point on 50 new quantum objectives with 80–86% condition-level accuracy. The clearest indicator of global-search utility is that local search frequently traps in inferior basins, rather than circuit depth or curvature anisotropy. The findings motivate whether quantum circuit complexity can be traded for harder classical optimization when robust global search is available.
Read the full abstract

Cryptography and Security

SENTINEL: A Multi-Pathway Architecture for Detecting Living-Off-the-Land APT Attacks on Windows Command Lines

Living-Off-the-Land (LOTL) is the dominant evasion technique of Advanced Persistent Threat (APT) actors, exploiting legitimate Windows utilities to conduct malicious operations without deploying custom malware and enabling state-sponsored campaigns to maintain persistent access within military and critical defense infrastructure for extended periods. Existing detection methods fail against obfuscated commands and multi-stage attack sequences, as demonstrated by the Volt Typhoon APT campaign, which maintained undetected access to U.S. critical infrastructure for over 18 months using exclusively signed Windows utilities. We present SENTINEL, a multi-pathway architecture integrating BERT-based semantic encoding, character-level CNN for obfuscation invariance, inter-command attention for multi-stage pattern recognition, and autoencoder-based anomaly scoring. Evaluated on a balanced Volt Typhoon benchmark derived from Microsoft and CISA threat intelligence advisories, SENTINEL achieves 92.0% accuracy on documented state-sponsored attack commands and 91.2% on obfuscated variants, compared to 74.0% and 72.0% for standalone BERT. Per-class analysis reveals that models achieving over 98% overall validation accuracy on imbalanced data exhibit only 44-58% malicious recall on balanced adversarial sets. Character-level processing contributes 5.6 percentage points of obfuscation invariance, and the 8.0 percentage point gap over augmentation-only baselines confirms structural architectural value beyond data-driven robustness alone.
Read the full abstract

All authors Ahad Bin Islam Shoeb, Kamrul Hasan, Jamal Uddin Tanvin, Liang Hong, Imtiaz Ahmed, Md Arif Billah, Al Amin

Artificial Intelligence

AI Deployment Accountability Engineering: A Vision for Accountable AI in Safety-Critical Socio-Technical Systems

Artificial intelligence systems are rapidly becoming critical components in healthcare, finance, public services, and other safety-critical domains. Yet the engineering practices used to evaluate these systems remain predominantly model-centric, emphasizing properties such as accuracy, robustness, fairness, and interpretability before deployment. These properties are necessary but insufficient once an AI system operates within an ever changing socio-technical environment characterized by distribution shifts, institutional constraints, human feedback loops, privacy requirements, and interactions among multiple AI agents. This vision paper introduces AI Deployment Accountability Engineering (ADAE), a proposed AI engineering subdiscipline concerned with establishing measurable, continuous, and actionable accountability for deployed AI systems. ADAE treats accountability as a deployment-layer property rather than solely as a property of an individual model. It seeks to determine whether an AI-enabled system continues to operate within acceptable risk limits, identify the contexts in which failures emerge, attribute failures across interacting technical and human components, translate technical failures into downstream consequences, and support timely intervention. We articulate a research agenda built around four interconnected pillars: structured discovery of context-dependent failure modes, privacy-preserving accountability measurement, system-level risk analysis for agentic AI, and translation of technical failures into operational, and institutional risks. The broader goal is to establish foundational principles, mathematical tools, and system architectures for accountable AI deployment across safety-critical applications.
Read the full abstract

Machine Learning

Pathwise Individual Rationality in Federated Learning: A Mechanism-Architecture Co-Design

Participation in federated learning (FL) comes at a cost. Clients trade off privacy, communication, and compute costs for potentially greater gains in model efficacy. This paper explores this tradeoff under the aegis of individual rationality (IR) versus autarky, the basic game-theoretic requirement that the federation provide utility no worse than local training. Using the above as the design target, we examine pathwise performance of FL, as a per-round bound on cumulative surplus rather than only an asymptotic equilibrium guarantee under different degrees of client data heterogeneity. Along the learning path, clients can remain below their local-training baseline for hundreds of rounds. The natural remedy is to cap each client's per-round contribution so that this shortfall stays bounded. We prove that such a cap drives all contributions to zero, with high probability, when its tolerance is small relative to the warm-up deficit, and we observe learning collapse under it even at low heterogeneity. We then propose a design that combines a short-term participation guarantee, enforced after an announced grace window, with personalized model evaluation, while preserving the incentive properties of the underlying mechanism. We provide a theoretical basis for this approach and empirically demonstrate that, after the grace window, clients meet IR on nearly all rounds without harming overall performance under low to moderate heterogeneity; under severe heterogeneity, the design shows promising outcomes for clients compared to their local baseline at some cost in accuracy.
Read the full abstract

Computer Vision

Reverse Spatio-Temporal Disease Progression Modelling

Deep learning-based spatio-temporal disease progression models commonly overlook the incubation period of progressive diseases, limiting the use of those models in early interventions, which are vital for not easily reversible diseases such as Alzheimer's. This is because, the existing deep learning based longitudinal disease-progression models are almost always run forward: from an observed baseline they predict future decline. In many clinical settings, however, imaging begins only after pathology is suspected or already visible, the earlier, healthier patient-specific reference was never acquired. To address this, we propose to study reverse disease progression prediction: given later diseased anatomy, reconstruct the unobserved healthier anatomy that preceded it. We use a two-stage model in which a frozen 3D vector-quantised autoencoder defines a compact discrete latent space, while a Neural Ordinary Differential Equation (ODE) learns continuous-time dynamics in that space. A recurrent encoder reads late observations in reverse temporal order, initialises the latent state, and the ODE is integrated backwards across the trajectory. On a controlled Morpho-MNIST benchmark with a sinusoidal perturbation, our model successfully recovered the unseen previous states from later observations of the non-monotonic trajectory. On longitudinal brain MRIs from Alzheimer's Disease Neuroimaging Initiative, at the task to recover the previous unseen trajectory towards healthy states of the patients from observed later diseased states, our model outperforms the baselines that uses copy-nearest and mean-observed, with positive disease-reversal scores in every diagnostic stratum. We hope that our work can provide insights and tools towards discovering the incubation periods from single-shot scans, and developing early interventions of diseases based on imaging.
Read the full abstract

Robotics

Robotic Servo Tracking of Moving Targets with Dynamic Imitation Constraints

Imposing explicit trajectory constraints in robot visual servoing remains challenging. Existing tracking methods achieve fast responses by mapping visual residuals to control velocities, but they have weak constraints on the intermediate motion process, which lead to trajectory discontinuity, oscillation, or conservative behaviors. To enable constrained tracking for moving targets, this paper proposes a servo tracking method based on imitation trajectory constraints. A dynamic model describing the robot approaching a moving target is formulated and analyzed for convergence. A time-scalable deformation mechanism and a trajectory modulation incorporating shape and amplitude components are introduced to generate a series of trajectories in real time, from which tracking points are adaptively determined to form dynamic constraints. The robot velocity is then computed from target pose differentials or tracked key features to follow the constrained trajectory. Simulation and real-world experiments demonstrate that the proposed method can achieve dynamic obstacle avoidance and high-precision convergence compared with several state-of-the-art methods in complex environments.
Read the full abstract

All authors Yazhe Luo, Sipu Ruan, Yifei Li, Diansheng Chen

Materials Science

Binder chemistry sets the interfacial balance constant in CsPbBr$_3$ nanocrystal supercapacitor electrodes

Previous work on lead-free tin halide perovskites showed that the binder instead sets the electrolyte concentration at which capacitance is maximised, following the relationship $100 \times [\mathrm{Li}^+]_{\mathrm{opt}} + \mathrm{PVDF}_{\mathrm{wt}\%} = \xi_{\mathrm{Int}}$ with $\xi_{\mathrm{Int}} = 25 \pm 2.5$, established by varying the loading of a single polymer. Whether $\xi_{\mathrm{Int}}$ is universal or specific to that polymer has not been tested. Here, four binders spanning fluorinated (PVDF), carboxylic (PAA), cellulosic (CMC) and sulfonic (PEDOT:PSS) chemistry are compared on $\mathrm{CsPbBr_3}$ nanocrystal electrodes at four LiTFSI concentrations in acetonitrile, with binder loading fixed at 15 wt% and all other formulation variables held constant. The relationship applies to $\mathrm{CsPbBr_3}$: PVDF at 15 wt% gives an optimum at 0.10–0.15 M and 112 F g$^{-1}$, against 126 F g$^{-1}$ reported for $\mathrm{CsSnCl_3}$ under the same conditions, extending the result to a different B-site cation, halide and crystal system. PVDF and CMC optimise at 0.10 M, giving $\xi_{\mathrm{Int}} = 25$, while PAA and PEDOT:PSS optimise at 0.15 M, giving $\xi_{\mathrm{Int}} = 30$, with maximum values of 188 F g$^{-1}$ for PAA and 146 mF cm$^{-2}$ for PEDOT:PSS. The two binders showing the shift carry ionisable acid groups at high density, indicating that $\xi_{\mathrm{Int}}$ expressed in weight percent requires a binder-specific value. In all four electrodes, $\mathrm{CsPbBr_3}$ converts to $\mathrm{PbBr_2}$ and CsBr during electrochemical characterisation, and the surface lead content of the PEDOT:PSS electrode decreases.
Read the full abstract

Computational Complexity

Explicit unbalanced 1-expanders with small degree and right size

An explicit graph is given with left size $N$, left degree $\widetilde O(\log^2 N)$, right size $(1+o(1))K$ and $1$-expansion up to~$K$, meaning that every left subset of size $K' \le K$ has at least $K'$ neighbors. Let $\C(x)$ be the minimal length of a program that prints~$x$ (i.e., the central concept in Kolmogorov complexity). The $1$-expander is used to obtain an algorithm that on input $x$ computes in time $\poly(|x|)$ a list with $\widetilde O(|x|^3)$ programs such that at least 1 program prints $x$ and has length $\C(x) + O(1)$. This improves on the $O(|x|^{6+\eps})$ upper bound in~\cite{zim:c:shortlistshortproof} and is close to the $\Omega(|x|^2)$ lower bound from~\cite[theorem 4]{bmvz:j:shortlist}. In the companion paper “Online matching games in bipartite expanders: applications to data structures," the $1$-expander is used to obtain dynamic dictionaries in which the query operation has non-adaptive memory access.
Read the full abstract

Statistical Mechanics

A New Framework for Interfacial Statistics: Exact n-Point Correlations of Gaussian Level Sets

We derive exact analytical expressions for higher-order correlations of Gaussian level-set interfaces, establishing a direct link between bulk field statistics and interface geometry. This framework enables efficient reconstruction of disordered media, detailed modeling of {Gaussian foams}—structured, double-thresholded interfaces with tunable morphology—and analysis of {memory-enhanced anisotropy} reflecting directional persistence in surface structure. These results open new possibilities for characterizing complex transport, guiding stochastic reconstructions, designing materials with desired properties, quantifying the information content of correlation functions and modelling directional processes on irregular boundaries.
Read the full abstract

Operator Algebras

Single commutators in $C^*$-algebras

Let $\mathcal A$ be a simple unital $C^*$-algebra with real rank zero, nonempty tracial state space $\mathcal T(\mathcal A)$, and strict comparison of projections. We prove that every element $T$ in $\mathcal A$ with $\tau(T)=0$ for all $\tau\in\mathcal T(\mathcal A)$ is a single commutator if one of the following conditions holds: $(1)$ $\mathcal A$ has unique trace; $(2)$ $\mathcal A$ has stable rank one. We also prove that every nonscalar element in a simple unital purely infinite $C^*$-algebra is a single commutator. Applications include UHF algebras, irrational rotation algebras, and Cuntz algebras.
Read the full abstract

Classical Analysis and ODEs

On the matrix $A_p$ conjecture

This paper provides a solution to the matrix $A_p$ conjecture. For every \(1<p<\infty\), we construct a family of \(2\times2\) matrix \(A_p\) weights $W$ with arbitrarily large characteristics for which \[\|H\|_{L^p(W)\to L^p(W)}\ge c_p[W]_{A_p}^{1+1/[p(p-1)]},\] where \(H\) is the Hilbert transform and \(c_p>0\) depends only on \(p\).
Read the full abstract

All authors Yong Jiao, Xingyan Quan, Lian Wu, Guangheng Xie

Numerical Analysis

Strong convergence rates of stochastic theta Milstein methods for index-1 stochastic differential algebraic equations under non-globally Lipschitz conditions

This paper studies the strong convergence order of structure-preserving stochastic theta Milstein methods for a class of index-$1$ stochastic differential algebraic equations (SDAEs) with time-dependent singular matrices and non-globally Lipschitz coefficients. The singular matrix is allowed to vary in time while preserving a fixed differential algebraic splitting, and the drift and diffusion coefficients may exhibit superlinear growth. By exploiting the index-$1$ algebraic-differential decomposition of the exact solution, we identify the Milstein coefficient of the reduced stochastic differential equation directly in the original SDAE variables and establish the well-posedness and constraint preserving property of the proposed method for $\theta\in[1/2,1]$. Under a coupled monotonicity condition and suitable polynomial regularity assumptions, the method is proved to preserve the algebraic constraints at all time levels and to converge with strong order one in the root mean square norm. Numerical experiments confirm the structure-preserving property and the theoretical convergence order.
Read the full abstract

All authors Caiyuan Zhu, Shiye Wan, Ziheng Chen, Lin Chen

Information Theory

Universal Estimation of the Fisher Information for Processes with Memory

The Fisher information matrix (FIM) determines the accuracy attainable in an estimation problem. For a parametric process with memory, it has a closed form only for narrow classes of models, and it cannot be computed when the model is available only as a simulator. This paper estimates the Fisher information rate of such a process, the per-observation limit of its FIM, from simulator output alone and without knowledge of the memory length. The construction uses the identity between the FIM and the local curvature of the Kullback–Leibler (KL) divergence. Directional divergence rates are estimated by context-tree weighting (CTW), and the matrix is recovered from them by least squares. We establish strong consistency in an iterated limit and a finite-sample bound, uniform over every working depth at least as large as the true memory length, which gives a mean error of order $n^{-1/3}$. The analysis also delivers a finite-sample rate for CTW-based estimation of the KL divergence rate. Experiments confirm the predicted exponents, show that the accuracy does not degrade as the working depth grows, and use the estimate to plan a sampling budget that attains a prescribed precision. The estimator stays accurate on a hidden-state source that has no finite memory length.
Read the full abstract

Differential Geometry

Boundary flexibility for curvature conditions

We prove a general boundary gluing principle for families of Riemannian metrics with pointwise curvature restrictions on manifolds with possibly non-compact boundary. This includes, as special cases, the classical gluing theorems by Perelman for metrics with positive Ricci curvature and convex singularities and by Gromov-Lawson and Bär-Hanke for metrics with positive scalar curvature and mean convex singularities. Using the language of algebraic curvature cones, our theorem implies and unifies many more previous gluing results. We also prove a boundary deformation principle that enables us to compare spaces of metrics with interior curvature restrictions and different boundary conditions. Our construction is based on the local flexibility lemma for open partial differential relations, as well as explicit 1-jet deformations of metrics along the boundary.
Read the full abstract

Differential Geometry

Global Analysis: An Introduction to Nonlinear Analysis and Its Variational Methods on Riemannian Manifolds

This monograph develops an introduction to global analysis centered on the interaction between differential geometry, functional analysis, partial differential equations, and variational methods on Riemannian manifolds. Beginning with smooth and Riemannian geometry, it develops Sobolev spaces, distributions, interpolation and fractional regularity, differential and pseudodifferential operators on vector bundles, elliptic theory, heat methods, bounded geometry, and trace theorems. It then treats Fredholm and index theory, culminating in the Atiyah–Singer index theorem, followed by geometric evolution equations and Ricci flow, infinite-dimensional geometry on Banach and Hilbert manifolds, and variational methods including the direct method, Palais–Smale theory, deformation arguments, the mountain pass theorem, and the Nehari method. Particular emphasis is placed on explicit proofs, the passage from local Euclidean estimates to intrinsic global statements, and the precise geometric hypotheses required in compact, noncompact, and boundary settings. The text is intended for advanced undergraduate and graduate students, as well as readers approaching global analysis from geometry or differential equations.
Read the full abstract

Information Retrieval

Beyond Benchmark Scores: How Synthetic and Authentic Query Distributions Diverge in RAG Evaluation

RAG systems are routinely evaluated using synthetic question sets generated from the target document corpus. While this practice provides a useful check on overall retrieval capability, relying exclusively on synthetic benchmarks can mislead under distribution shift and overstate deployment readiness. Synthetic generation spreads questions evenly across the corpus, formulating long, detailed queries; real users put most of their traffic on a few administrative and procedural topics in short queries, while also asking about matters the generator never covers at all. We demonstrate this gap on a university faculty information system, comparing 1,851 synthetic questions generated via Gemini Notebook against 322 authentic queries collected via a student survey. The synthetic and authentic query sets differ significantly: authentic queries average 6.8 words versus 15.7 for the synthetic ones, and draw from only 53 unique sources compared to 165. Consequently, configurations that appear highly effective on synthetic benchmarks experience a substantial performance drop on authentic queries. Importantly, optimizing on synthetic queries selected a higher-latency hybrid retriever. In our setting the sparse retrieval component benefited long synthetic questions but not short authentic ones, costing up to $8\times$ the latency of the fastest configuration we tested. We propose treating synthetic and authentic query sets as complementary extremes of the query-quality spectrum: synthetic data verifies maximum retrieval capacity under idealized conditions, while authentic queries test system robustness to the imprecise, underspecified inputs of real users.
Read the full abstract

Computer Vision

A Building as a Repository: KIR, a Typed Intermediate Representation for Agent-Authored Building Information Models

Autonomous agents that author building information models need more than access to a host API. They need a representation of what they intended, what a compiler decided on their behalf, what was refused, what was observed after execution and what remains unknown. We present KIR, a typed intermediate representation in which a building is authored as a program held in a versioned repository and lowered to host applications as build targets. KIR is organised around seven ways in which a generator writing into a stateful, partially observable host goes silently wrong, and gives each a representation in data: ambiguous selectors become typed refusals with candidates; defaults keep their provenance; obligations that will not be checked are named before execution; vacuous witnesses are rejected statically; a lost transaction response becomes the state UNCONFIRMED with a verify-before-retry rule; the reverse path obeys a census invariant; and decisions are bound by digest to the state they were made against. On a pinned snapshot with 83 operation contracts and Revit as the only backend, offline experiments refuse 29 of 42 stress-test programs with diagnostic codes and no uncaught exception, name 38 of 377 witness obligations as unwitnessable, admit 31 of 100 combinations of execution, witness and acceptance states under seven stated invariants, and find no vacuous witness in 219 certificate runs; a 60-storey tower is 11,263 characters as KIR against 3,709,235 characters of emitted C#. Native Revit runs are reported from project records and kept separate from reproduced results. A controlled comparison with agents that write host code directly is specified but not yet executed; it is the principal open question.
Read the full abstract

Quantum Physics

Phase-controlled bipartite and tripartite entanglement and Bell nonlocality in a closed-loop optomechanical system

We propose a novel scheme to generate and manipulate bipartite and tripartite entanglement and Bell nonlocality in a closed-loop three-mode optomechanical system, where two optical modes are simultaneously coupled to a mechanical mode via typical optomechanical interactions and also coupled to each other through field transmission. This configuration gives rise to a phase-sensitive coupling, in which the relative phase directly controls the population distribution between two optical modes, enabling coherent redistribution of quantum correlations. By tuning this relative phase, we achieve deterministic switching of bipartite entanglement between two optical-mechanical pairs, as well as tunable genuine tripartite entanglement among three modes. Employing the displaced-parity measurement, we construct both the bipartite and tripartite Bell inequalities in phase space and observe maximal violations of approximately $2.32$ and $3$, respectively, which coincide exactly with the values achievable for ideal bipartite and tripartite Einstein-Podolsky-Rosen states. Counterintuitively, we find that the tripartite Bell nonlocality can persist even when the genuine tripartite entanglement is absent, providing deeper insight into the relationship between these two types of quantum correlations. Furthermore, we systematically analyze the effects of mechanical dissipation and thermal noise, identifying the parameter regions where Bell violation survives under realistic experimental conditions. Our results establish a comprehensive framework for generating, controlling, and verifying multipartite quantum correlations, paving the way towards phase-tunable quantum networks and noise-resilient tests of quantum foundations.
Read the full abstract

All authors Sha-Sha Zheng, Zi-Nan Wu, Di-Di Xu, Chang-Yu Li, Peng-Wei Gong, Qiongyi He, Feng-Xiao Sun