Peer Revenue Equity in science

Papers

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

All of arXiv

Friday 28 August

Quantum Physics

Quantum Fourier transform for the symmetric group

Quantum Fourier transforms (QFT) for general groups were recognized to be fundamental already early in the field. A canonical example of non-abelian QFT for the symmetric group was outlined by Beals (1997). Later, a more detailed analysis of this algorithm was carried out by Kawano and Sekigawa (2016). In this paper, we revisit that construction. After a careful analysis, we revise their gate complexity to $\widetilde{\mathcal{O}}(n^{3.5})$ and circuit depth to $\widetilde{\mathcal{O}}(n^3)$. Moreover, we observe that their construction is not optimal in the choice of transversal elements, so we propose simpler realization of the symmetric group QFT.
Read the full abstract

Computer Vision

SignRR: Retrieve and Refine Real Motion for Sign Language Production

Sign language production (SLP) aims to generate continuous signing motion from spoken language, often through gloss-to-pose generation. Prior work mainly follows two paradigms. Generative models synthesize motion from a learned prior or from noise, without reference to an observed signing instance, making rare hand configurations and signer-specific articulation difficult to preserve. Retrieval-based methods reuse real, well-articulated motion segments, but concatenating segments from different signers and co-articulation contexts can introduce rhythm and style inconsistencies across the full sequence, not only at segment boundaries. These limitations suggest a complementary solution: use retrieval to provide realistic articulation, and use learned refinement to impose the global coherence that retrieval alone lacks. We therefore propose retrieve-and-refine, a paradigm that starts from real retrieved motion and refines it into a globally coherent signing sequence rather than generating motion from scratch. Our framework, SignRR, initializes motion from a dictionary of real sign segments and refines the full sequence with a part-aware Residual VQ-VAE, where residual quantization preserves fine hand articulation and temporal length differences are handled in the latent space. Experiments on PHOENIX14T and CSL-Daily show that SignRR achieves state-of-the-art back-translation performance while maintaining competitive pose quality.
Read the full abstract

All authors Fidel Omar Tito Cruz, Angie Sanchez Marquina, Summy Farfan, Gissella Bejarano

Computer Vision

GeBDA: Building Damage Assessment as Text-Based Sequence Prediction

Conventionally, Building Damage Assessment (BDA) is tackled either with dedicated network architectures or by fine-tuning geospatial image foundation models. In this work, we ask whether a general-purpose Vision-Language Model (VLM) can localize buildings and grade their damage through autoregressive sequence generation alone. We cast BDA as predicting a variable-length set of bounding boxes, each specified by its coordinates and a damage label. Our preliminary implementation, based on the open Gemma model, achieves promising damage mapping results from only bi-temporal satellite images and a suitable text prompt.
Read the full abstract

All authors Olivier Dietrich, Krishna Sapkota, Konrad Schindler, Genady Beryozkin

Data Structures and Algorithms

On two proofs of $d^2$ mixing of weighted Dikin walks

We study the mixing time of weighted Dikin walks for sampling from exponential distributions on polytopes and truncated positive-semidefinite (PSD) cones. Our first result gives a general total-variation mixing bound under strong self-concordance, $\bar{\nu}$-symmetry, and mixed-trace regularity on the local metric. The key idea is to control the Metropolis–Hastings acceptance probability on a high-probability region rather than at every point. Applying this framework to the Lee–Sidford, Lewis-weight, and John metrics yields an $\widetilde O(d^2)$ mixing bound for sampling from polytopes, while applying it to a hybrid barrier yields an $\widetilde O(d^4)$ mixing bound for sampling from truncated PSD cones. Our second result establishes stronger $\chi^2$-divergence guarantees and pointwise acceptance control using a new fourth-order bootstrap condition. For a suitably scaled Lee–Sidford metric, this yields an $\widetilde O(d^2)$ mixing bound in $\chi^2$-divergence, improving on the previous $\widetilde O(d^{9/4})$ bound.
Read the full abstract

Superconductivity

A Three-Fluid Model of Dissipation at Surfaces in Superconducting Radiofrequency Cavities

Experiments on superconducting cavities have found that under large RF fields the quality factor can improve with increasing field amplitude, a so-called “anti-Q slope.” We numerically solve the Bogoliubov-de Gennes equations at a superconducting surface in a parallel magnetic field, finding at large fields there are surface quasiparticle states with energies below the bulk superconducting gap that emerge and disappear as the field cycles. Modifying the standard two-fluid model, we introduce a “three”-fluid model where we partition the normal fluid to consider continuum and surface quasiparticle states separately. We compute dissipation in a semi-classical theory of conductivity, where we provide physical estimates of elastic scattering times of Bogoliubov quasiparticles with point-like impurities having potential strengths informed from complementary ab initio calculations of impurities in bulk niobium. We show, in this simple yet effective framework, how the relative scattering rates of surface and continuum quasiparticle states can play a role in producing an anti-Q slope while demonstrating how this model naturally includes a mechanism for turning the anti-Q slope on and off.
Read the full abstract

All authors Matthias Liepe Michelle M. Kelley, Sean Deyo, Nathan Sitaraman, Danilo B. Liarte, Tomás Arias, James P. Sethna, Thomas Oseroff

Machine Learning (Statistics)

Learning between the peaks: sharp asymptotics for kernel ridge regression under power-law anisotropy

We study kernel ridge regression under anisotropic Gaussian data, where the input covariance decays as a power law with exponent $\alpha\geq 0$ for polynomial inner-product kernels. We derive asymptotically sharp expressions for the kernel spectrum and the generalization error in the polynomial high-dimensional regime $n=\Theta(d^\kappa)$, revealing how anisotropy reshapes the learning curves. For weak anisotropy ($0<\alpha<1$), the problem remains effectively high-dimensional and retains some features of the isotropic case, while departing from it in others: the variance still peaks at integer sample complexities $\kappa\in\mathbb{N}$, but these peaks are progressively damped as $\alpha$ grows; meanwhile, for targets strongly aligned with the data's principal directions, the bias drops at fractional sample complexities, decoupling the bias transitions from the interpolation peaks. For strong anisotropy ($\alpha > 1$), the effective dimension of the problem is constant, and the variance stops depending on sample size altogether, plateauing under ridgeless interpolation or vanishing at an explicit rate under fixed ridge penalty. The bias undergoes a sharp transition governed by the target's decay rate: below a threshold, learning is abrupt rather than gradual; above it, the bias decays as a power law that recovers the classical source and capacity rates. We finally specialize these results to single-index targets, showing how the alignment of the index with the data's principal directions determines the effect of anisotropy on learning. Together, our results clarify how the input geometry shapes the kernel features and fundamentally impacts its generalization properties.
Read the full abstract

Quantum Physics

Exact quantification of nonlocal magic

Magic, or nonstabilizerness, is the resource that lifts Clifford circuits to universal quantum computation and has become a standard diagnostic of many-body states. For a state shared between two parties, however, a basic question has remained open: how much of the magic resides in the correlations between the parties rather than in their local bases? Isolating this nonlocal magic requires minimizing over all local bases, an optimization that has so far resisted exact solution. Here we solve it for the stabilizer fidelity: the nonlocal magic of every pure multiqubit state is the distance of its entanglement spectrum from the closest spectrum of Bell pairs. The same quantity governs an apparently unrelated task: a family of states universally embezzles entanglement under local operations and classical communication if and only if its nonlocal magic diverges. The deciding property is not the amount of entanglement but the way the entanglement spectrum spreads its weight across factor-of-two windows of rank, so that critical chains and random-singlet states, with identical logarithmic entanglement scaling, carry unbounded and vanishing nonlocal magic, respectively. Nonlocal magic thereby becomes an operationally meaningful property of quantum correlations, directly accessible to tensor-network simulations and, through entanglement spectroscopy, to experiments.
Read the full abstract

Metric Geometry

The Sunada method on Metric Measure Spaces

In this paper, we provide a general Sunada–Pesce–Sutton-type method that produces pairs of isospectral metric measure spaces. This construction relies on a representation theoretic assumption, and we give examples of spaces satisfying this condition, such as RCD spaces. As an application, we construct a pair of simply connected isospectral, non-isometric RCD non-Alexandrov spaces and a pair of Alexandrov non-orbifold spaces.
Read the full abstract

Computation and Language

A Formal Limitation on Learning Human Language From Textual Corpora

Can a listener recover what a speaker means from the form of an utterance alone? We answer this question information-theoretically, and for a listener given by any featurizer of text, including the hidden states of contemporary large language models. Modeling language use as a joint distribution over meanings, contexts, and utterances, we derive upper bounds on the probability that a decoder recovers a speaker's intended meaning from a representation of the utterance. The bounds are governed by the uncertainty that form leaves about meaning, which splits into an irreducible part and a part that only (extralinguistic) context, but never the utterance alone, can resolve. Because these quantities are intrinsic to language, no representation, however much text or supervision produced it, can surpass them. The bounds apply, moreover, to meaning spaces that are discrete or continuous. We provide empirical evidence in support of the theory through experiments on artificial languages, Mandarin zero-pronoun resolution, and color reference.
Read the full abstract

Exactly Solvable and Integrable Systems

An Extended 2+1-Dimensional Gardner Equation: On Moving Boundary Problems Solvable via Ermakov-Painlevé II Symmetry Reduction

A class of moving boundary problems of Stefan-type for an extension of the 2+1- dimensional Gardner equation is shown to be amenable to exact solution by application of a Ermakov- Painlevé II symmetry reduction.

Statistics Theory

A ridgeline correspondence criterion: the number of modes of a Gaussian mixture is finite

We prove that every finite multivariate Gaussian mixture density has only finitely many modes. Our approach combines an algebraic formulation of the ridgeline theory of Ray and Lindsay (2005) with a transcendence-degree argument based on Ax's functional-transcendence theorem to bound the cardinality of the set of critical points. Our techniques extend recent work by Wang (2026), who used Ax's theorem together with real-analytic curve selection to prove finiteness of the critical set of homoscedastic Gaussian mixtures. We introduce the ridgeline correspondence and use it to obtain a finiteness result that applies to arbitrary heteroscedastic Gaussian mixtures. Our framework also establishes finiteness of the number of modes for additional classes of polynomial-exponential mixtures and generalized Gaussian mixtures.
Read the full abstract

Machine Learning

Blog: Survey of Optimizers

Neural-network optimization in 2025-2026 is no longer well described as a succession of new Adam variants. The design space has expanded from coordinates to matrices and layers, from fixed training horizons to policies over time, and from mathematical update rules to state representations that must survive sharding and low-precision computation. This survey organizes recent optimizers and training optimization methods along four largely independent axes: temporal estimation, update geometry, horizon management, and representation and systems. It connects the spectral normalization of Muon, the historical matrix statistics of Shampoo and SOAP, adaptive and hybrid matrix methods, memory-efficient optimizers, schedule-free training, small-batch corrections, and quantized optimizer states. The central empirical conclusion is deliberately non-triumphal: matrix-aware methods represent a genuine advance, but there is no context-independent replacement for AdamW. Rankings change with model scale, data-to-parameter ratio, batch size, schedule, parameter partition, tuning budget, and whether the target metric is tokens, FLOPs, wall-clock time, or memory. The practical consequence is a compositional view of optimizer design and a stricter protocol for evaluating optimizer claims.
Read the full abstract

Information Theory

A Complete Characterization of Tensorizable $f$-divergences

Csiszar's formulation of the $f$-divergence introduced a vast family of functionals for quantifying dissimilarity between probability distributions. However, many applications in statistics and information theory rely only on a few $f$-divergences, such as the Kullback-Leibler divergence, the $\chi^2$-divergence, and the squared Hellinger distance. These divergences are especially useful because they admit simple compositional formulas under product measures, a property sometimes referred to as tensorization. In this work, we refine a formalism of tensorization previously introduced in the literature. Then, we show that any possible tensorization formula has a multi-affine form characterized by a single parameter, and identify all tensorizable $f$-divergences under our adopted notion of tensorization.
Read the full abstract

Information Retrieval

QUEST: A Query and Extraction System for Topics in Asylum Law Application Decisions

Legal decisions on asylum applications consist of long, complex, and heterogeneous documents, covering narrative applicant interviews, original decisions, and additional supporting materials. If an application is rejected, a critical question in processing an appeal is whether the credibility of the information in the original application was a factor that determined the original decision. In this paper, we present the QUEST system (Query and Extraction System for Topics) to extract and identify factors relating to credibility assessments in two datasets of Danish asylum application appeals. QUEST frames this problem as an information retrieval task, combining synthetic query generation, topic extraction, and relevance assessment to identify information related to credibility indicators in appeals board application materials. In addition to standard retrieval evaluation metrics, we propose a new type of domain-specific assessments distinct from the traditional relevance to evaluate the performance of the tested systems with respect to credibility factors. In this way, we obtain insights about how well automatic methods can return answers for different types of indicators appearing in asylum appeals. Our results indicate that there is an increased challenge when estimating performance using credibility-based relevance assessments, thus pointing to the difficulty of the task.
Read the full abstract

All authors Maria Vlachou, Anna Murphy Høgenhaug, Mohammad N. S. Jahromi, Galadrielle Humblot-Renaux, Thomas Gammeltoft-Hansen, Thomas B. Moeslund, Desmond Elliott

Soft Condensed Matter

Machine learned designs of functional colloidal foldamers

A protein's function follows from the structure it adopts, and in some cases which structure that is depends on the pathway taken. In programmable matter the target is fixed before assembly, and whatever else forms is treated as error. Here we show that pathways themselves form a design space. Using reinforcement learning, we fold model DNA-coated droplet chains into rigid two-dimensional geometries, uncovering two classes of pathways: downhill, in which bonds are only added, and detour, in which bonds are broken and remade before the target is reached: for some the only route that exists. Coarse-graining pathways by interactions gives experimentally realizable protocols. Some produce one geometry, others several: structures sharing a detour route can be cycled between, while those that coexist assemble into superstructures inaccessible to a uniform product. Function emerges from the pathways rather than being designed. Designing the process instead of the components could give colloidal materials that reconfigure on demand.
Read the full abstract

Artificial Intelligence

Four conditions for composing plugin-based agents without a host agents

Large language model agents now run long-horizon, multi-tool, autonomous sessions, and the infrastructure must keep the current assembly of capabilities, the progress of execution, and the basis for recovery after a fault. A single-process host holds this information in its own running state, so its death takes the session record and the assembly with it. This paper gives four conditions under which a plugin-based agent needs no host process, one each on state placement, record carriers, recovery coordination, and provider resolution. The store, writer, and delivery disciplines keep the conditions in force, and each carries formal support from the spatiotemporal-composability calculus and from the proofs in the supplementary materials. An agent that meets them can be constructed with its assembly on a bus of peer processes and its record in an append-only carrier owned by no process, and removing any one part makes the assembly need a host again. The conditions themselves are the contribution, and every implementation that meets them inherits the same advantages. Such an agent keeps its session through the death of any process, wastes no calls after a fault, loses no records, recovers locally, changes its capability set while it runs, and carries its undo semantics across processes. This paper builds one SDK of the conditions, Logos, and measures whether it fulfills their promise against the single-process reference and a configuration over MCP under one fault in each of 200 tasks, realized in 197. The reference lost all 197 faulted sessions, the MCP configuration kept its sessions but issued 1,212 wasted calls, and the SDK kept every session, wasted no call, lost no record, and fulfilled the promise of the conditions in every faulted task, with task performance preserved. The conditions give builders a tested route from single-process hosts to peer processes.
Read the full abstract

All authors Hanzhang Jia, Liheng Zeng, Hao Cheng, Yi Gao, Bo Ma, Guolong Xu

Machine Learning

Advancing Interaction-Sensitive Feature Selection: Novel Relief-Based Algorithms, Expanded Comparisons, and Recommendations for Biomedical Data Mining

As a precursor to high-dimensional biomedical data modeling, reliable feature selection can reduce computational expense, improve modeling performance, and yield simpler, more interpretable models. However, most filter-based feature selection methods struggle to detect feature interactions, while wrapper or embedded feature selection methods are computationally expensive. Relief-based algorithms (RBAs) are filter methods that are sensitive to feature interactions while mitigating these other limitations. This study (1) refactors, optimizes, and expands the scikit-rebate Python package with existing and newly proposed RBA variants and (2) conducts rigorous RBA benchmark comparisons across diverse genomic simulations. We expand scikit-rebate to include SWRF*, mu-Relief, and 5 novel RBA variants implementing alternative strategies for neighbor selection and feature scoring. All RBAs were evaluated to compare predictive feature ranking and runtime across simulated genomic datasets varying in sample size, number of features, heritability, and underlying association type (e.g. main effects and interactions). All RBAs, except mu-Relief, were proficient in detecting 2-way interactions in noisy data. RBAs utilizing 'far' scoring were best at detecting 2-way interactions - with MultiSWRFDB* top-performing - but were far less sensitive to main effects. SWRF, MultiSWRF, MultiSURF, and MultiSWRFDB yielded top performance across main effect and 2-way interaction datasets with MultiSWRFDB performing best when also considering 3-way interactions. Refactoring of scikit-rebate resulted in 10 to 35-fold reductions in RBA runtimes. The newly introduced RBAs were among the strongest performing, and by robustly retaining both main effects and 2-way epistatic interactions, these algorithms preserve predictive signals for downstream modeling.
Read the full abstract

All authors Kia Kazemi-Nia, Harsh Bandhey, Philip J. Freda, Ryan J. Urbanowicz

Combinatorics

The Erdős-Hajnal Property for the six-vertex Graph with Edge Set $\{ab,bc,cd,de,af,bf,df\}$

We prove that the six-vertex graph with edge set $\{ab,bc,cd,de,af,bf,df\}$ has the Erdős-Hajnal property. The proof adapts the iterative-sparsification method of Nguyen, Scott, and Seymour within the comb-based framework of Huang, Ju, and Zhou.

Earth and Planetary Astrophysics

ExoMOD II. A Statistical Model of Transit Timing Variations in Kepler Multi-Planet Systems

In Paper I (Nesvorný et al. 2026), we forward modeled transit observations of the Kepler telescope to characterize the orbital properties of close-in planetary systems. The new population model, ExoMOD, was calibrated on Kepler's DR25 data. Here we use ExoMOD to statistically predict Transit Timing Variations (TTVs) from gravitationally interacting planets in the close-in systems, and compare these predictions with TTVs actually detected in the Kepler data. We find that planet-planet interactions are not expected to produce significant short-period TTVs, $P_{\rm TTV}/P_{\rm orb}<10$, where $P_{\rm TTV}$ and $P_{\rm orb}$ are the TTV and orbital periods, often enough to explain the short-period TTV signals inferred from the Kepler data. Most measured short-period signals must therefore have a different origin. The statistics of long-period TTVs – likely arising from the gravitational interaction between planets – indicates that single transiting planets have TTV-inducing companions nearly as often as doubles, thus ruling out multiplicity distributions with a prevalence of intrinsic singles. The fraction of planets with measured long-period TTVs increases to $\simeq 15$-18% for observed multiplicities $m \geq 3$, suggesting a change in the orbital architecture. High-multiplicity planetary systems have low gap complexities and probably retained a memory of their formation conditions. Ultimately, our work aims at developing a more informative feedback between observations and planet formation theories.
Read the full abstract

All authors David Nesvorny, Daniel A. Yahalomi, David Kipping, Cristian Beauge, Sarah C. Millholland

Computer Vision

Video Generative Models as Geometry Learner

Recent generative approaches to geometry estimation adapt pretrained image diffusion models and treat the task as image-conditioned generation. Leveraging off-the-shelf image diffusion models, they either (i) train task-specific geometry models (for depth and surface normal estimation) independently, losing the opportunity of exploring the intrinsic correlation of these geometric targets, or (ii) jointly fine-tune modified image diffusion backbones (e.g., altered self-attention), which typically demands substantial labeled data. To overcome these limitations in a principled fashion, we repurpose pretrained video generative models as a unified and data-efficient framework for geometry estimation, formulated innovatively as a next-frames prediction task. Our method, GeoNeXt, inherits naturally structured knowledge and richer priors from the video model, while further adapting them for joint modeling of images and geometry targets (image <-> geometry), enabling more data efficient and effective learning of geometry. Extensive experiments validate our method for zero-shot monocular depth and surface normal estimation across diverse datasets, outperforming both previous task-specific and unified generative competitors while using substantially less training data. Notably, our method rivals discriminative state-of-the-art approaches trained on over 100x more data and even standouts on several benchmarks.
Read the full abstract

All authors Haosen Yang, Jifei Song, Zhensong Zhang, Xiatian Zhu, Jiankang Deng

Earth and Planetary Astrophysics

ExoMOD I. A Forward Model for the Orbital Architecture of Kepler Multi-Planet Systems

Transit observations only detect planets with favorable, near edge-on orientation of orbits as seen by a distant observer, which leaves much freedom for various interpretations in terms of the underlying planetary system architecture. Here we forward model transit observations of the Kepler telescope to characterize the orbital properties of close-in planetary systems. We make sensible choices about the underlying distributions of planet radii, masses and orbital periods, parameterize the orbital excitation with the Angular Momentum Deficit (AMD), and adopt an accurate method to account for transit detection. The fits to Kepler's DR25 data are executed with MultiNest. We find that the orbital period distributions of Kepler singles and multis are statistically different from each other – possibly a consequence of Kepler's observational baseline. The observed gap complexity distribution is reproduced when planets in high multiplicity systems ($m \geq 5$) are assigned ideally correlated period ratios. The high-multiplicity systems probably retained a memory of their formation conditions. The gap complexity metric also helps to constrain the AMD distribution. We find that systems with positive radius monotonicities typically harbor smaller planets, as expected if the radius monotonicity is influenced by non-detections. A FGK dwarf in the Kepler field should host $\simeq 2.4 \pm 0.2$ planets on average with radii $0.5 < R_{\rm pl}/R_\oplus < 7$ and orbital periods $3<P_{\rm orb}<300$ d. For a detected planetary system, there is roughly a 50% chance that Kepler transit observations missed at least one inner or intermediate-period planet.
Read the full abstract

All authors David Nesvorny, Daniel A. Yahalomi, David Kipping, Cristian Beauge

Machine Learning

DARTS: Decoder-Aware Representation Tuning via Surgery for Model Merging

Model merging combines multiple task-specific fine-tuned LLMs into a single multi-task model without additional training. However, merged models are known to suffer from representation bias: systematic drift between the merged model's hidden states and those of each individual source model. Prior work (Yang et al., 2024a) study and mitigate this bias for encoder-based vision models using a lightweight correction module trained with L1 loss. However, such bias is not studied for decoder models due to their autoregressive nature. We analyze the problem of representation bias in decoder models, and show two challenges absent in encoders: (1) the causal attention mask causes bias to accumulate across token positions, requiring position-dependent correction; and (2) not all token positions are equally important, i.e., high-entropy (decision-critical) positions matter far more than low-entropy ones. To address these challenges, we propose Decoder-Aware Representation Tuning via Surgery (DARTS). DARTS employs a novel entropy-weighted L1 loss to upweight correction at high-entropy positions where errors most affect generation quality, and a per-position additive bias that captures position-dependent error without overparameterization. We perform extensive evaluation on three domains: code generation (HumanEval), mathematical reasoning (GSM8K), and instruction following (AlpacaEval) on Llama-2-7B models, and show DARTS achieves significant improvement over the standard surgery approach while adding negligible parameters ($0.1\%$ of total parameters).
Read the full abstract

Materials Science

Switchable chiral antiferromagnetism through nonlinear magnetic susceptibility

Antiferromagnets (AFM) have attracted considerable attention in recent years because a number of nontrivial, technologically relevant properties associated with time-reversal symmetry (TRS) breaking are discovered in many materials. However, time-reversal (TR) partners of AFM states are generally challenging to be selected deterministically except in a few cases with nonzero net magnetization. Recently, it has been shown that the TR partners of the kagome spin ice ground state in HoAgGe with strictly zero net magnetization can be selected through a nonlinear magnetic susceptibility $\chi^{(1)}$. In this work, we generalize this scenario to a broad class of chiral AFM with zero net magnetization but field-switchable ground states through $\chi^{(1)}$. After a general discussion of $\chi^{(1)}$ and its symmetry constraints, we first present a first-principles formalism for calculating it including both mean-field and self-consistent corrections, and then apply the approach to the noncollinear AFM family Mn$_3X$N ($X=$ Ni, Ag, Ga, Zn, Sn) in the $\Gamma_{5g}$ phase. An intuitive picture of the origin of $\chi^{(1)}$ in similar noncollinear AFM is illustrated using 3-sublattice toy model. The model also predicts a nontrivial temperature dependence of $\chi^{(1)}$ due to competitions between the longitudinal and transverse single-spin susceptibilities. Our work shows that nonlinear susceptibility can serve as a general protocol for accessing and switching TR partners in fully compensated AFM.
Read the full abstract

Numerical Analysis

Closest Normal Matrix Found Again Using Riemannian Optimization

We propose an approach based on Riemannian optimization to compute a nearest normal matrix to a given one. The problem can be formulated as the minimization of a smooth function either on the manifold $U(n)$ of unitary matrices of size n or on the flag manifold $U (n)/U (1)^n$. The flag manifold is particularly suitable for theoretical analysis; we characterize the global maximum of the objective function and prove that, for generic inputs, its local minimizers are finitely many and isolated; in turn, this implies the original nearest normal matrix problem generically has finitely many local minimizers, all with distinct eigenvalues. We also develop a Riemannian trust-region method that improves substantially on classical algorithms and can handle considerably larger matrices, as well as a variant for computing the nearest real normal matrix. The paper is complemented by extensive numerical experiments.
Read the full abstract

High Energy Physics (Phenomenology)

The Pomeron loop as a perturbative correction to single Pomeron exchange revisited

Pomeron loops are known to arise naturally as building blocks of high energy scattering amplitudes as soon as one starts to consider corrections to single Pomeron exchange, i.e. to high energy resummation based on the Balitsky-Fadin-Kuraev-Lipatov evolution equation. While some authors argue that Pomeron loops provide only very small corrections, a 2013 study found that the complete QCD Pomeron loop provides a large correction, which can exceed the single Pomeron contribution already at LHC energies. In this paper we carefully review the derivation of the single Pomeron loop and evaluate the resulting expression numerically, making use of a representation of the triple Pomeron vertex by Korchemsky. While we do not confirm the findings of the 2013 study, we find that the Pomeron loop can provide a 24%-39% correction at lowest currently accessible values of $x$ and hard scales at the non-perturbative boundary.
Read the full abstract

Number Theory

Rational torsion on simple genus two Jacobians

We exhibit new subgroups of rational torsion points in geometrically simple Jacobians of genus-two curves over $\mathbb Q$. The largest group, which has order 96 and invariants [2,2,2,12], is realized by curves of the form $y^2 = x(x-a^2)(x-b^2)(x-c^2)(x-u^2)(x-v^2)$ where $a,b,c,u,v$ are positive integers that satisfy $a^2 + b^2 + c^2 = u^2 + v^2$ and $a^4 + b^4 + c^4 = u^4 + v^4$. We also find realizations of the groups [2,2,20], [2,2,4,4], [2,2,2,8], [2,4,8], and [6,6]. Finally, we record, to the best of our knowledge, all known subgroups that arise in genus-two Jacobians over $\mathbb Q$, in the geometrically simple case and in general.
Read the full abstract

All authors Jennifer S. Balakrishnan, Filip Najman, Ari Shnidman, Andrew V. Sutherland

Cryptography and Security

Policy-Controlled Offline-Verifiable Accountability for Cross-Organization Agent Messaging: A Preserved Evidence-Bundle Approach

Cross-organization agent workflows require preserved evidence that remains independently verifiable during later audit or dispute review. Such workflows may involve multiple organizations, delegated actions, policy-relevant events, and disputed accountability claims. This is difficult when live systems are unavailable, controlled by one party, or not trusted by all participants. Existing mechanisms provide useful pieces, including authenticated logging, delegation semantics, signed checkpoints, and consistency checks. What remains missing is a verifier-centered event-level bundle for checking evidence sufficiency offline under an explicit policy. We propose a preserved evidence-bundle model and a policy-controlled offline verifier for agent-to-agent workflow events. Each bundle preserves policy-required evidence, including sender authentication, authenticated log commitment, witness-backed checkpoint evidence, append-only continuity, delegation-aware authorization evidence, and, when issued and required by policy, explicit receiver-signed receipt evidence. The verifier accepts a bundle only when all mandatory and policy-required checks succeed, giving a later dispute reviewer an offline basis for assessing evidence sufficiency. It does not infer delivery or receipt from transport behavior or log inclusion alone. In a prototype evaluation, the event-type study used 300 synthetic four-event healthcare workflow cases and 1200 valid preserved bundles. The policy-profile comparison observed its largest median latency reduction relative to the fully enabled profile when checkpoint-context validation was disabled. All 17 tested cases in the original negative-evidence diagnostic suite were rejected under the fully enabled profile. Additional functional studies examined context and signed-reference binding. These results support prototype feasibility for the evaluated workloads.
Read the full abstract

Machine Learning

An Enclosed Mode Is a Gauge Choice: Topology Relative to Reach in Certified Code World Models

A code world model accepted by a sampling gate can be exactly right on everything the gate can see and arbitrarily wrong beyond it. We characterize what a certified model can know, and what its errors can cost, when the omission is an annular freeze mode enclosing an unreachable interior. The gate quotient makes the question precise: acceptance-with-certainty determines the model exactly on the reachable query set; beyond reach is gauge. On a minimal ring instrument we prove the extreme case (a wrong-topology filled-disc artifact unfalsifiable by any sampling gate and bitwise harmless at play) and measure, with LLM synthesis across three model families, how one knob (a channel of width gamma) walks the same artifact through three regimes: unfalsifiable-and-harmless, falsifiable-and-costly, and instantly falsified. Three principles organize the empirics. First, danger is topology relative to reach: a channel the planner can use collapses the blind model's exploitation (play cost 1.09 to ~0 over a knee at gamma ~ 0.1), while a hidden channel with the same first Betti number keeps it at full strength (1.12). Second, repair is parameter-bound and sensor-bound: no family recovers the region from outside evidence; from inside, models pose the right topology but cannot pin its parameters, and the posed topology tracks the guiding persistent-homology summary's wrong beta_1 (a sensor with a measured geometric resolution limit), not the truth. Third, mitigation must match the error's dimension and direction: point fences fail against the one-dimensional boundary, a dimension-matched persisted fence collapses exploitation to a two-lesson transient (0.999 to 0.058), and the dual freedom certificate collapses the invented-mode failure symmetrically (1.769 to 0.029). In n dimensions the shell makes misidentification near-certain while the danger stays fully exploitable: the two axes are independent.
Read the full abstract

High Energy Physics (Phenomenology)

Deciphering Matter Invariants via Renormalization Group Equations for Neutrino Oscillations

We utilize renormalization group equations (RGEs) for neutrino oscillations in matter to decipher the structure of exact matter invariants. By combining the RGEs with the $S^{}_3$ permutation covariance under relabeling of the neutrino mass eigenstates, we recast all five algebraically independent matter invariants in the three-flavor framework as exact first integrals. Treating the matter potential as a matter spurion and imposing the cancellation conditions for the $1/\widetilde\Delta_{ij}^{}$ poles in the RGEs, we further prove that the three-flavor framework contains only two independent monomial invariants, which can be related to the Naumov and Toshev relations. We then extend the analysis to the four-flavor framework, where we uncover a complete set of eleven algebraically independent matter invariants and prove that the rank-two electron–sterile spurion obstructs the common pole cancellation required for any nontrivial multiplicative monomial invariant.
Read the full abstract