Peer Revenue Equity in science

Papers

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

All of arXiv

Thursday 27 August

Computer Vision

R2M-Bench: Evaluating Revisit Memory via Relative Consistency in Interactive Video World Models

High similarity between first-visit and return frames does not necessarily show that a video world model remembered the scene; the intervening rollout may simply have changed very little. This ambiguity makes absolute revisit scores sensitive to rendering stability, repetitive content, and failed motion. We introduce R2M-Bench (Relative Revisit Memory Benchmark), a benchmark of observable revisit-selective consistency. For every detected return, R2M-Bench compares the revisit pair with two controls from the same rollout: a gap-matched non-revisit pair that measures generic temporal stability and a short-range pair that estimates short-horizon consistency. These comparisons produce MemoryGain (MG), the revisit advantage over the temporal baseline, and the Normalized Memory Ratio (NMR), which normalizes this advantage by the short-to-baseline dynamic range. R2M-Bench combines 100 reference scenes with three leave-and-return trajectories to form 300 instances and evaluates appearance fidelity, scene and object identity, local geometry, and persistent state. Across seven action-conditioned video world models, Overall NMR correlates with human consistency judgments at Spearman's $\rho=0.547$ (95% CI $[0.45,0.63]$). Its within-model correlation magnitude with generated motion is $0.072$, compared with $0.207$ for raw revisit similarity, indicating that relative calibration substantially reduces the slow-motion shortcut. DreamX-World-Memo achieves the highest Overall NMR among the evaluated video models. Together, these results support same-rollout relative calibration as a practical way to distinguish revisit-specific consistency from generic temporal stability.
Read the full abstract

All authors Qiwen Gu, Bingjie Gao, Rui Chen, Geng Li, Jifan Li, Qishuai Wen, Li Niu, Jing Tang, Xiangxiang Chu, Junqiao Zhao

Analysis of PDEs

Concavity and other properties of the entropy on manifolds

In this paper, we establish systematic estimates for the entropy and its density on Riemannian manifolds, focusing on the more challenging cases where the Ricci curvature changes sign or the boundary is nonconvex. For example, the refined second law of thermodynamics states that the entropy in a compact domain in $\mathbb R^n$ is increasing in time, furthermore, it is concave if the domain is convex. The concavity property is equivalent to the property that the Fisher information is decreasing, which also holds for convex domains in a Riemannian manifold with nonnegative Ricci curvature (cf. \cite{NiLei}). In view of the wide application of entropy in mathematics, information theory, physics, etc., there is certain desire in the community to extend the property to broader settings, especially to the case with nonconvex boundary (see e.g. \cite[p. 3]{CFM}), even in the Euclidean case. Here, we prove that the refined second law still holds if the domain is not too far from convex and the negative part of the Ricci curvature is not too large, in an explicit, nonperturbative sense, thus realizing some of the expectations. The proof is based on a new, sharp second order log Poincaré inequality that does not require explicit curvature conditions of the manifold. If the negative part of the Ricci curvature is too large, a counterexample to the concavity is given. Some other related estimates for the entropy density (Hamilton type estimates) are also proven.
Read the full abstract

Spectral Theory

Arbitrarily Fast Quantum Dispersion in Long-Range Crystals

We construct the first examples of one-dimensional long-range crystals exhibiting arbitrarily fast polynomial dispersive bounds. The Floquet functions of our Hamiltonians are highly oscillatory Weierstrass functions, whose rough autosimilar structure drives the fast dispersion. The proof develops a new Fourier decay theory for $C^\alpha$ images of the Lebesgue measure, based on a Dolgopyat-inspired transfer operator method, and yields a van der Corput lemma for Weierstrass functions. As a consequence, the local time of classical Weierstrass functions of sufficiently large lacunarity exists and is $C^k$, answering a question raised by Geman and Horowitz in 1980.
Read the full abstract

Systems and Control

Why Three Phases? A Historical and Engineering Reassessment of Phase Order in AC Power Transmission

Three-phase alternating current is so deeply embedded in modern electric-power infrastructure that its phase order is often treated as self-evident. Historically, however, 1-phase and true 2-phase systems were commercially important, while commercial 6-phase transmission was later demonstrated. This paper reassesses why 3 phases became the dominant architecture for bulk AC transmission. A general balanced \(m\)-phase formulation is used to show that constant aggregate instantaneous power is not unique to 3 phases: an ideal balanced 2-phase system also cancels the double-frequency power term and can generate a constant-magnitude rotating field. Consequently, the historical displacement of 2 phases cannot be explained by power smoothness alone. The comparison is instead organized around conductor architecture, insulation stress, machine and transformer utilization, conversion requirements, right-of-way utilization, and technological path dependence. A historical, commercial 6-phase demonstration showed that high-phase-order transmission was technically feasible and could improve corridor utilization. The paper then asks: if PE conversion and protection make phase count less costly, could \(m>3\) offer intrinsic advantages? Six such advantages are identified: modular decomposition into interleaved 3-phase groups, redundant control degrees of freedom, structured modal/fault analysis, increased corridor power density under field constraints, potentially higher natural loading and loadability, and enhanced harmonic/field cancellation. A companion derivation shows that phase count alone does not intrinsically reduce \(I^2R\) loss at fixed total conductor material and phase voltage. As a conditional conclusion, 3 phases are an unusually favorable historical optimum for electromechanical grids, but not a mathematically universal optimum for a future converter-dominated grid.
Read the full abstract

Differential Geometry

Sharp partial regularity of Hamiltonian stationary and special Lagrangian graphs

We prove a sharp partial regularity result for Hamiltonian stationary Lagrangian Lipschitz submanifolds in arbitrary smooth almost Kähler manifolds: every weak solution of the corresponding equation is smooth away from a relatively closed singular set of Hausdorff dimension at most $n-5$. We show that the estimate is optimal by constructing a nonzero two-homogeneous viscosity solution \[ U\in C^{1,1}(\mathbb{R}^5)\setminus C^2(\mathbb{R}^5) \] of the phase-zero special Lagrangian equation, whose level sets on $\mathbb{S}^4$ are the leaves of Cartan's isoparametric foliation. Its gradient graph is a non-flat calibrated cone, real analytic away from the vertex. This also gives the first $C^{1,1}$ but non-$C^2$ solution of the special Lagrangian equation, and shows that the same dimensional estimate is sharp in the case of special Lagrangian graphs.
Read the full abstract

Number Theory

On Piatetski-Shapiro primes from almost primes

Denote by $\mathcal{P}_r$ an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this manuscript, it is established that, for any fixed $0.98353<\gamma<1$, there exist infinitely many primes of the form $p=[n^{1/\gamma}]$, where $n$ is an almost-prime $\mathcal{P}_7$. This result constitutes an improvement upon the previous result of Baker, Banks, Guo and Yeager [1], who showed that there exist infinitely many primes $p$ such that $p=[n^{1/\gamma}]$ with $n\in\mathcal{P}_8$ for $\gamma$ near to one.
Read the full abstract

All authors Yuhua Zhao, Jinjiang Li, Linji Long, Min Zhang

Quantum Gases

The heavy Fermi polaron I: the Lithium-Cesium experiment

We present details of an experimental platform for studying Fermi polarons in a quantum-gas mixture. The system consists of about a thousand bosonic $^{133}$Cs impurities immersed in a deeply degenerate Fermi gas ($T/T_F \sim 0.2$) of approximately $2\times 10^5$ $^6$Li atoms in a single hyperfine state, with interspecies interactions tunable via a Feshbach resonance. Using optical Raman spectroscopy without relative momentum transfer, we perform injection spectroscopy and thereby create the Fermi polaron. Owing to the large mass imbalance between the two species, the setup provides access to previously unexplored regimes of Fermi polarons.
Read the full abstract

All authors Michael Rautenberg, Tobias Krom, Eleonora Lippi, Lauriane Chomaz, Matthias Weidemüller

Dynamical Systems

A blueprint for the formalization of norm-variation of multiple ergodic averages for commuting transformations

This blueprint serves as a companion to a forthcoming, shorter traditional mathematical paper. The purpose of this blueprint is two-fold: first, it has served as the foundation for a formalization in Lean 4 of these results. This formalization has been completed largely automatically, making essential use of current frontier large language models. Second, it will serve as a resource to readers of the main paper who are interested in further technical details of the proofs. The main result concerns norm-variation estimates for multiple ergodic averages associated with $n\ge 2$ commuting measure preserving transformations, providing a quantitative strengthening of Tao's norm-convergence theorem and answering an open question of Avigad and Rute. At the core of the analysis lies an explicit real-variable estimate for twisted multilinear averages that is closely related to certain singular Brascamp–Lieb inequalities.
Read the full abstract

All authors Floris van Doorn, Polona Durcik, Joris Roos, Lenka Slavíková, Christoph Thiele

Statistical Methodology

Evidence, Calibration, and Stability: A Triadic Framework for Hypothesis Testing Under Model Uncertainty

Statistical tests are often asked to do too much. A single reported result is expected to describe what the observed data say, reassure readers about repeated-sampling behavior, and remain convincing when the working model is perturbed. Those tasks are connected, but they are not equivalent. Fisherian inductive inference and Neyman-Pearson decision theory clarify the first two; robust testing, sensitivity analysis, fragility measures, multiverse analysis, and distributional-stability methods speak to the third. I propose Evidence-Calibration-Stability (ECS) as a framework for keeping these roles separate while reporting them together. Evidence is post-data. Calibration belongs to the design or procedure. Stability is the post-data distance from the benchmark analysis to a conclusion-reversing perturbation within a declared model neighborhood. Full ECS support is conjunctive: a strong coordinate cannot rescue a failed one. For finite-dimensional affine perturbations, I derive an exact ellipsoidal stability radius. For smooth nonlinear margins, a uniform quadratic-remainder condition yields a certified lower bound over a declared neighborhood, showing when the affine formula is only a surrogate. I also establish coordinate invariance and a matrix extension for multiple claims, and distinguish confirmatory calibration from descriptive calibration profiles when prespecification is unavailable. Simulations for the one-sample t test and Student's historical sleep data show that the three coordinates can lead to different interpretations. ECS is a formal synthesis, not a claim that evidence, power, or robustness is itself new.
Read the full abstract

High Energy Physics (Phenomenology)

Chiral soliton lattice in inhomogeneous magnetic fields

It has been known that in sufficiently strong uniform magnetic fields, the ground state of quantum chromodynamics (QCD) supports a spatially modulated condensate of neutral pions, dubbed chiral soliton lattice (CSL). In this paper, we investigate whether a similar ordered ground state might exist when the external magnetic field is nonuniform, as appropriate for potential phenomenological applications, including heavy-ion collisions and neutron stars. To that end, we use the low-energy effective field theory of QCD, restricted to the neutral pions as the sole low-energy degrees of freedom in strong magnetic fields. In the limit of vanishing pion mass, we achieve a complete characterization of magnetic fields supporting a CSL-like ground state. Moreover, for a simple but infinite family of magnetic fields, we find the corresponding CSL state analytically. Going away from the massless limit requires full numerical minimization of the energy functional. Here we provide some sample numerical results, focusing on the qualitative differences as compared to the situations with a uniform magnetic field or a vanishing pion mass. The main conclusion remains unchanged: while bending the magnetic field typically reduces the energy gain due to the neutral pion condensation, a CSL-type ground state is still possible. As a byproduct of our work, we map the location of the CSL phase in the phase diagram of QCD in a uniform magnetic field and finite volume.
Read the full abstract

Number Theory

On Consecutive Non-primitive Elements over Finite Fields

In this article, we establish a bound on $\theta_q$ that guarantees the existence of a pair of consecutive non-primitive elements in $\mathbb{F}_q$, with the exceptions $q=4$ and $q=8$. We first derive a sufficient condition for the existence of such a pair using character sums and then obtain the stated bound by considering several cases according to the least prime divisor of $q-1$.
Read the full abstract

Algebraic Geometry

Numerical Godeaux Surfaces with many disjoint $(-2)$-curves and Applications

In this paper, over the field of complex numbers, we prove that a numerical Godeaux surface contains at most six pairwise disjoint $(-2)$-curves, and that this bound is sharp. As an application, we refine the classification of involutions on smooth minimal surfaces of general type with $p_g=0$ and $K^2=7$: the divisorial fixed part $R$ satisfies $R^2=-1$, the involution acts trivially on $H^*(S,\mathbb{Q})$, and, if the minimal resolution of the quotient is of general type, it is a numerical Campedelli surface containing five pairwise disjoint $(-2)$-curves. Another application concerns commuting involutions on smooth minimal surfaces of general type with $p_g=0$ and $K^2=8$.
Read the full abstract

Symplectic Geometry

Non-decomposable Lagrangian endoconcordances and Khovanov homology

In this note, we construct non-decomposable Lagrangian endoconcordances of Legendrian knots. We prove that for any positive integer k, there exist a (stabilised) Legendrian knot and a Lagrangian fillable Legendrian knot in the standard contact 3-sphere, each admitting at least k pairwise Hamiltonian non-isotopic relative boundary, non-decomposable Lagrangian endoconcordances. The obstruction to decomposability that we rely on is based on Khovanov homology.
Read the full abstract

Applied Physics

Hyperuniformity as a unifying organizational principle across diatom architectures

Diatom frustules have long fascinated scientists for the extraordinary beauty, diversity, and functionality of their intricate silica architectures. Yet, the spatial organization of these structures has so far been primarily described in terms of morphology, symmetry, and crystallographic order, leaving common statistical properties across distinct diatom architectures largely unexplored. By analyzing diatom frustules through the lens of hyperuniformity for the first time, we reveal a striking commonality across their remarkable diversity: all analyzed genera exhibit signatures of suppressed long-wavelength density fluctuations. Specifically, we find that these architectures range from strongly ordered Class I to disordered Class III hyperuniform systems. We show that local order, spatial correlations, and long-range fluctuation suppression can vary partially independently, giving rise to a continuous spectrum of multiscale architectures. Our multiscale approach reveals that hyperuniformity can be reliably characterized in finite biological structures, beyond what conventional asymptotic diagnostics can resolve. Together, these results prove that hyperuniformity provides a unifying statistical framework for describing diatom diversity beyond conventional classifications of structural order.
Read the full abstract

All authors Eric Ballestero, Chiara Gazzola, Raj Kumar Pal, Vicent Romero-Garc{\i}a, Marco Miniaci

Materials Science

Grain Boundary Phase Transitions Enable Diffusionless Climb of Disconnections

Dislocation-grain boundary (GB) interactions govern the mechanical response of polycrystalline materials by controlling dislocation absorption, transmission, and interfacial plasticity. While disconnection climb is conventionally understood to require the absorption or emission of point defects supplied through long range bulk diffusion, GBs possess intrinsic configurational degrees of freedom associated with their atomic structure, or microstate, that may provide an alternative mechanism. Here, using bicrystallography and molecular dynamics simulations, we investigate the interaction of shear dislocation loops with the [1 1 0](-5 5 14) symmetric tilt grain boundary in Al. We show that dislocation absorption generates a mobile extrinsic disconnection with a nonzero climb component that propagates conservatively along the interface without long-range bulk point-defect transport. Its motion is accompanied by a localized GB phase transformation mediated by cooperative atomic rearrangements within the GB core, producing successive metastable GB microstates. These findings establish a direct coupling between lattice dislocations and GB phase evolution and reveal a conservative mechanism for disconnection climb fundamentally distinct from conventional vacancy-mediated climb.
Read the full abstract

Machine Learning (Statistics)

A Finite-Sample Analysis of Quantile Temporal-Difference Learning

Quantile temporal-difference learning (QTD) is an effective method for learning return distributions through quantile approximation, yet its finite-time behavior remains poorly understood. Its update is nonlinear and nonsmooth, and the stability needed for a sharp convergence rate holds only near the target. We establish a global high-probability last-iterate guarantee for synchronous tabular QTD under general positive, nonincreasing step-size sequences and arbitrary initialization in the natural parameter range. For polynomially decaying step sizes with exponent $a\in(0,1)$, the last iterate converges to the target at rate $T^{-a/2}$ in the infinity norm, up to logarithmic and lower-order terms. A suitably tuned harmonic schedule recovers the $T^{-1/2}$ statistical rate up to logarithmic factors. For the $m$-quantile representation, its $\infty$-Wasserstein error scales as $\sqrt{m/T}$ up to logarithmic factors, matching the leading polynomial dependence on the quantile resolution and sample size of the corresponding model-based estimator. The proof uses a two-stage global-to-local argument. From arbitrary initialization, Bellman contraction and CDF monotonicity first bring the iterate close to the target, after which, a novel variance–drift matching argument sharpens the control of accumulated noise and local contraction reduces the remaining errors, yielding the sharp rate. Simulations verify the predicted polynomial decay and assess the finite-time entrance bound.
Read the full abstract

All authors Zijie Cheng, Xiang Li, Yang Peng, Zhihua Zhang

Optimization and Control

When MILP Beats QP: Piecewise-Linear Reformulations of Sequentially Coupled Bilinear Programs

The presence of bilinear terms in mathematical modeling generally yields nonconvex quadratic programs (QPs) that remain computationally challenging to solve to global optimality. While continuous piecewise linear (CPWL) approximations can reformulate these nonlinearities into mixed-integer linear programs (MILPs), the geometric construction of the domain partition heavily dictates the resulting solver efficiency. In this paper, we present efficient MILP formulations for approximating bilinear terms and rigorously evaluate their computational merits against direct QP solvers. First, we introduce CPWL approximations with arbitrary high degrees of accuracy that explicitly account for and exploit the inherent symmetries of the unit bilinear function. Second, we analytically establish the exact maximum and average approximation errors of the CPWL approximations. Third, we construct and compare three distinct MILP formulations (a “Triangle”, a “Square”, and a difference-of-convex “DC” formulation) of the CPWL functions. Fourth, we formalize a highly relevant class of optimization models, Sequentially Coupled Bilinear Programs (SCBP), where variables represent system states and state changes. Finally, through extensive numerical experiments, we demonstrate that our compact “Square” MILP formulation achieves superior computational performance on SCBP instances with long sequence horizons, allowing mature open-source MILP solvers to effectively outperform QP solvers.
Read the full abstract

All authors Quentin Ploussard, Maris Usis, Oluwabunmi Iwakin, Matija Pavičević

Artificial Intelligence

Verify Smarter, Evolve Further: Efficient Harness Evolution through Behavior-Aware Verification

Agent harnesses shape how language-model agents use instructions, tools, and runtime components, but adapting these harnesses requires costly verification. Existing propose-and-verify methods typically score every candidate on a fixed task set, wasting rollouts on unrelated behaviors and allowing aggregate scores to obscure specific regressions. We introduce HarnessLens, a budget-aware framework for automated harness evolution. HarnessLens jointly explores the task space and user-configurable components, derives candidate modifications from execution trajectories, and selectively verifies each candidate on behavior-relevant tasks using an attributable-evidence gate. Across three agent harnesses and four benchmarks, HarnessLens improves average held-out performance by 7.6-13.6% while consuming substantially less evaluation budget than competing baselines. These results demonstrate that behavior-aware verification with explicit attribution enables more reliable and sample-efficient harness evolution under constrained interaction budgets. Our code is available at https://github.com/jhxu5214/HarnessLens.
Read the full abstract

All authors Jinghan Xu, Yikai Zhang, Aili Chen, Weiyuan Li, Jiaqing Liang, Deqing Yang

Statistics Theory

Conformal Prediction Through the Lens of Hypothesis Testing: Universality, Impossibility, and Optimality

The connections between conformal prediction and permutation tests are already widely-known in the literature. Some authors motivate conformal prediction by saying that it computes a permutation p-value for the hypothesis $H_0 : Y_{n+1} = y$, and then inverts this to form a prediction set for $Y_{n+1}$ (i.e., accepts all values $y$ into the prediction set for which the p-value is large). In this paper, we examine an alternative view, which is less well-known: we again cast conformal prediction via the inversion of a permutation test, but for the null of exchangeability of the joint distribution of the $n+1$ samples. This change in perspective, while simple, adheres more closely to traditional formalization in hypothesis testing, which offers several benefits. First, we use the duality between conformal sets and testing to show that foundational universality and impossibility results in the conformal prediction literature can be reproduced directly using classical hypothesis testing theory (due to Neyman, Lehmann, Scheffé, Kraft, Le Cam, and others). Furthermore, we show that an optimality result for conformal prediction can be derived using standard Neyman-Pearson theory: for any joint distribution of the covariates and response $X,Y$, and any sample size, the optimal method for prediction sets—delivering the most efficient set among all methods with valid coverage for exchangeable distributions—is a conformal predictor whose score is the inverse conditional density of $Y|X$.
Read the full abstract

Computation and Language

Difference-in-Differences on a Censored Rating Scale Can Manufacture an Effect: Evidence from a Pre-Registered LLM-Judge Audit

LLM-judge audits assess bias by comparing ratings across matched conditions. Difference-in-differences designs take the rating difference between two candidate responses to each item and compare it across a manipulated attribute. Building on prior work on nonlinear difference-in-differences, we show in closed form that when ratings are bounded, a severity shift common to both responses produces an observed interaction whenever the scale bounds attenuate it unequally. We then report a pre-registered audit of 990 calls to a frozen pedagogy judge. The registered primary analysis did not detect an effect of a stated novice or advanced profile on the judge's preference for a high-scaffolding over a low-scaffolding response. The only nominally significant secondary interaction was on the productive-struggle sub-score ($+0.378$ points, $p = 0.002$). A post-hoc construction in which the profile shifts both responses' latent ratings equally reproduced 79 to 85% of this interaction using the observed severity shift and the scale floor alone. The observed interaction therefore does not identify differential preference on the latent scale.
Read the full abstract

All authors Shuyi Fan, Boyuan Deng, Mengyu Xu, Xinhong Xie, Chenyang Li, Hongyang Zhang

High Energy Physics (Theory)

Wess-Zumino gauge for analytic prepotentials of off-shell $\mathcal{N}=2$ supergravity: bosonic sector

We present a comprehensive study of the Wess-Zumino gauge for the analytic prepotentials of the off-shell $\mathcal{N}=2$ Weyl and $\mathcal{N}=2$ Einstein supergravities (the version with a non-linear tensor compensator). The field redefinitions, the full transformation laws, and the gauge superparameters that preserve the Wess-Zumino gauge are derived. As a concrete application of the obtained results, we examine the component structure of the free hypermultiplet action coupled to $\mathcal{N}=2$ supergravity. In this work, we restrict our analysis strictly to the bosonic sector.
Read the full abstract

Probability

Local Laws and Edge Universality for Noncentral Sample Covariance Matrices

We consider the real noncentral sample covariance matrices $\mathcal{W}=YY^\top$ with $Y=A+\Sigma^{1/2}X$. Here $A\in\mathbb{R}^{M\times N}$ is deterministic, $\Sigma\in \mathbb{R}^{M\times M}$ is a deterministic positive definite population covariance matrix and $X\in\mathbb{R}^{M\times N}$ has independent centered entries with variance $N^{-1}$. We prove local laws near regular right edges down to optimal spectral scales without requiring the commutativity of $AA^\top$ and $\Sigma$. As a consequence, we obtain optimal eigenvalue rigidity at the rightmost regular edge and delocalization of the corresponding left and right singular vectors. We also show that, with high probability, there are no eigenvalues in the adjacent spectral gap beyond the optimal $N^{-2/3}$ edge scale, up to an arbitrarily small $N^\varepsilon$ loss. Finally, we establish edge universality at the rightmost regular edge: after centering and scaling, the largest eigenvalue converges to the Tracy–Widom distribution. The main technical ingredient is a stability analysis of the matrix Dyson equation (MDE) associated with the linearization of $Y$, whose self-energy operator does not satisfy the flatness condition of the general MDE theory. Exploiting the special block structure, we reduce the stability analysis exactly to a two-dimensional operator. This reduction yields regularity of the spectral density and square-root behavior at regular right edges, together with sharp stability bounds near such edges.
Read the full abstract

High Energy Physics (Experiment)

Accelerating Optical Photon Simulation in DUNE with Opticks

Optical photon simulation is among the most computationally demanding tasks in complex and large detector geometries. In the Deep Underground Neutrino Experiment (DUNE), the scale of the far-detector modules makes photon-by-photon transport with GEANT4 prohibitively expensive on CPUs. We present the first implementation and performance evaluation of GPU-accelerated optical photon simulation at the 10~kt scale, based on Opticks and applied to the DUNE far-detector horizontal-drift (FD-HD) geometry. On the full FD-HD geometry, Opticks propagates the same photons as GEANT4 with a speedup of $313 \pm 3$ over single-threaded and $83 \pm 1$ over four-thread GEANT4, and is validated against the reference GEANT4 simulation across all metrics considered. We further integrate Opticks into the LArSoft-based DUNE software stack. Photons simulated on the GPU with GEANT4-equivalent physics retain full Monte Carlo fidelity at a computational cost that makes high-statistics optical studies and the generation of labeled datasets for machine learning feasible at the kiloton scale.
Read the full abstract

All authors Ilker Parmaksiz, Aaron Higuera, Laura Paulucci, Viktor Pec, Estanislao Forino

Metric Geometry

The Spherical Hadwiger Theorem

We prove the spherical Hadwiger theorem in every dimension: for $n\geq1$, every continuous $\mathrm{SO}(n+1)$-invariant valuation on all closed spherical convex sets in the unit sphere $\mathbb{S}^n$ is a unique linear combination of the spherical intrinsic volumes $V_0,\ldots,V_n$. The same classification holds on sets contained in an open hemisphere, with unique continuous invariant extension to the full domain. We first classify simple invariant valuations by an independent induction on dimension. Averaging a signed cone identity gives the spherical volume term; the remaining terms are signed coning transforms that vanish by the lower-dimensional simple classification. A second induction, together with extension to non-proper sets, gives the general classification. The cone–sphere correspondence yields, for $d\geq2$, the corresponding classification on all closed convex cones in $\mathbb{R}^d$, without normalization at the zero cone. In both settings, $\mathrm{SO}$-invariance implies $\mathrm{O}$-invariance.
Read the full abstract

Materials Science

3D Cloud Component Analysis of Atomic Structures

We present a method for decomposing atomic structures into physically meaningful components by converting discrete atomic coordinates into continuous three-dimensional density fields. Each element is represented by a Gaussian-smeared density map with values ranging from 0 to 1, computed efficiently through a bin-then-blur approach with periodic boundary conditions. The sum of all element densities, truncated at unity, defines the material region; its complement defines the vacuum. Every voxel is first assigned a chemical formula from the set of elements present above a threshold; the resulting formula map is then cleaned so that only regions with a genuine bulk interior-measured by the Euclidean distance to their own boundary-survive as components. Thin surface terminations (e.g., a Ga monolayer on GaAs) and one-to-two-voxel boundary layers between two crystals are absorbed by the neighboring stable region, so the decomposition contains exactly the bulk-like chemical-formula components and the vacuum, with no surface or interface components. For each component we determine the crystal phase with a neural prototype classifier: one phase if the trusted interior atoms vote unanimously, two phases (e.g., crystalline and amorphous Si) if they split into two confident groups, in which case the component is divided into two. Interfaces and surfaces are then derived as boundaries-material-material and material-vacuum-and every atom is labeled bulk, surface, interface, or vertex, with vertex reserved for geometric corners of a component. Inside crystalline components, inner defects are detected from coordination-number and local-density deviations. We demonstrate the approach on Si/GaAs and Si/SiO2 heterojunctions, crystalline/amorphous silicon junctions, vacancy-containing crystals, and bulk crystals.
Read the full abstract

Analysis of PDEs

The Higher-Dimensional Nitsche Conjecture: Sharp Bounds and Rigidity

Let $n\ge3$ and let $h:\A(r,1)\to\A(R,1)\subset\mathbb R^n$ be an onto homeomorphism with harmonic coordinate functions. We prove the sharp Nitsche bound \[ R\le R_{n,+}(r):=\frac{nr}{n-1+r^n}, \] and, when $h$ interchanges the two ends, the strictly stronger sharp bound \[ R\le R_{n,-}(r):=\frac{nr^{n-1}}{1+(n-1)r^n}. \] In each case, equality holds only for the corresponding radial harmonic homeomorphism, up to an orthogonal transformation. Both bounds and their equality cases extend to bounded harmonic maps in every dimension $n\ge2$. This requires nonzero degree of $h/|h|$ on interior spheres, $|h|\ge R$, and the corresponding $L^2$ limits of the modulus at the two ends. In the plane, we also prove the nonzero-winding-number conjecture of Iwaniec–Kovalev–Onninen [J. Amer. Math. Soc. 24 (2011), 345–373], without endpoint modulus conditions. We prove a sharp $L^1$ contraction theorem for vector measures associated with spherical couplings. The first marginal is uniform, while the second is unrestricted. For bounded nonnegative nondecreasing zonal kernels, the optimal constant is the degree-one multiplier. If the kernel is also strictly increasing, equality holds exactly for couplings supported on orthogonal graphs. This theorem is the main tool in the proofs of the annular bounds and their rigidity.
Read the full abstract

All authors Bin Deng, Jiahuan Li, Yilu Liu, Xi-Nan Ma

Machine Learning

QuantumBoostNet: Hybrid Classical-Quantum Cardiac View Identification

Accurate identification of the correct view or angle in cardiac ultrasound (echocardiogram) is critical for cardiologic imaging, precise anatomical interpretation, and reducing clinical errors. Most state-of-the-art classical models perform well on standard benchmarks but give suboptimal results in specialized medical imaging due to high noise levels. To address these challenges, this work proposes the hybrid classical-quantum architecture QuantumBoostNet, which combines a classical backbone with two heads: one classical and one quantum, a parametrized 10-qubit quantum circuit. The main contribution of this work is training in two stages, with an adaptive transition between heads controlled by a mixing parameter that monitors loss dynamics. Extensive experiments show that QuantumBoostNet outperforms the implemented baselines under matched training conditions. Statistically significant gains appear on FashionMNIST ($p_t=9.91\!\times\!10^{-6}$) and MNIST ($p_t=1.29\!\times\!10^{-5}$), with a less significant improvement on the echocardiography task ($p_t=0.0711$). The model also shows robustness to noise. These findings support continued development of hybrid classical-quantum models for specialized medical imaging applications.
Read the full abstract

All authors Mihai Udrescu-Milosav, Stefan-Alexandru Jura, Mihai Udrescu, Gerhard-Paul Diller

Graphics

Comparative Evaluation of 3D Reconstruction Methods for Immersive Visualization of Laboratory Objects

In this study, we examined whether current 3D reconstruction methods can support the creation of realistic holographic representations of laboratory objects for educational use. In this regard, we compared four approaches: photogrammetry, a neural radiance field (NeRF)-based method, Gaussian splatting, and LiDAR. These methods were used to generate holographic models of common laboratory items and their fidelity was evaluated by graduate students. Participants assessed the models for shape, color, texture, and visual defects using a repeated-measures design. Across objects, the NeRF-based method produced the most consistently high-fidelity representations, particularly for transparent, reflective, or low-texture items that were difficult to capture with other approaches. Shape and color were generally reproduced more successfully than texture, suggesting that some visual properties remain more challenging to represent accurately in educational holograms. Beyond identifying the strengths and limitations of each reconstruction method, the study demonstrates a practical workflow for creating immersive learning objects that may support pre-laboratory preparation, spatial reasoning, and student engagement in AR/MR-based educational environments. These findings offer design-relevant insights for educators and researchers developing immersive digital learning experiences.
Read the full abstract

All authors Brian De La Cruz, Aaron Y. Zhao, Maitrey Gramopadhye, Sawyer J. Lazar, Xianming Tan, Daniel Szafir, David S. Lawrence

Algebraic Geometry

Nash Loci

In the study of Nash equilibria of finite-player games, one often seeks equilibria that are compatible with predetermined constraints, either determined by the players or by an external agent. We discuss the algebraic loci, called Nash loci, of games whose Nash equilibrium scheme intersects a fixed algebraic variety in a product of projective spaces. We determine their dimensions and multidegrees in multiprojective space, and their equations for two-player games and for small multiple-player games. The multilinear equations defining the Nash equilibrium scheme allow us to describe Nash loci in the language of Grassmannians and Plücker coordinates. Motivated by this fact, we relate Nash loci to multigraded associated varieties, which are subvarieties in products of Grassmannians that generalize the multigraded Cayley-Chow hypersurfaces of Osserman and Trager.
Read the full abstract

Cryptography and Security

When Context Gets Root: Privilege Escalation in LLM Harnesses

Instruction hierarchy is a model-side defense that assigns instructions different levels of privilege according to their sources. These levels constrain which content may direct model behavior. During agent execution, however, agent harnesses construct context for each model invocation. This construction can elevate low-level content to a higher instruction level and grant it greater model-facing privilege. We introduce instruction privilege escalation. In this attack, an attacker induces an agent to elevate low-level malicious content to a higher instruction level. The elevated content then causes the agent to execute instructions it would not follow at their original level. We evaluate this threat by using multi-agent mechanisms to achieve 13 attack objectives across six coding-agent harnesses. These objectives span confidentiality, integrity, availability, and remote code execution. With unrestricted action execution, the attacks achieve all 13 objectives on all six harnesses. Under automatic permission review, the attacks achieve all 13 objectives on all three harnesses that provide this mode. We further reproduce the vulnerability using harness-provided persistent goals and scheduled tasks. These results demonstrate the generality of instruction privilege escalation.
Read the full abstract

All authors Xingbang He, Yuanwei Chen, Yi Qian, Haiyang Wei, Ligeng Chen, Zenan Fu, Linzhang Wang, Hao Wu, Bing Mao