History and Overview of Mathematics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 21 September
Reverse mathematics is a branch of mathematical logic dedicated to determining the minimal set existence principles necessary and sufficient to derive ordinary mathematical theorems about concrete structures like the real line. Since the mid-1970s, reverse mathematics has developed a systematic classification of the strength of theorems in areas of mathematics ranging from real and complex analysis to infinitary combinatorics. This essay will place reverse mathematics in its historical and philosophical context, and reveal its relevance to central issues in the philosophy of mathematics, from the foundational programmes of Hilbert and Brouwer to contemporary debates about realism, determinacy, and applicability of mathematics. In doing so, it will discuss the role of computability theory in measuring the strength of set existence principles, as well as related questions about idealisation when these principles are applied in the physical sciences and in philosophy.
High Energy Physics (Phenomenology)
System-size dependence of bottomonium suppression from Pb-Pb to light-ion collisions
We test the system-size dependence of bottomonium suppression using the same open-quantum-system transport framework for Pb-Pb, O-O, and Ne-Ne collisions. The microscopic transport coefficients are retained from previous Pb-Pb analyses. Using QTraj, we solve the next-to-leading-order pNRQCD Lindblad equation in anisotropic hydrodynamic backgrounds and calculate integrated $\Upsilon$ double ratios. The QGP-induced evolution reproduces the observed sequential hierarchy and overall magnitude of the O-O suppression measured by CMS and LHCb. We quantify the sensitivity to both transport coefficients and to the termination temperature of the in-medium evolution. The Ne-Ne measurement favors somewhat stronger suppression than predicted, although the present experimental uncertainty is large. The extension from Pb-Pb to light ions supports, at least for observables less sensitive to cold nuclear matter effects, a common microscopic origin of bottomonium suppression in deconfined matter, characterized by the same temperature-dependent transport coefficients despite the large change in collision-system size.
Read the full abstract
Combinatorics
On Smooth Combinatorial Products of Simplices
We show that every lattice weak Minkowski summand of a smooth polytope combinatorially isomorphic to a product of simplices has a quadratic triangulation. This is achieved by identifying this class of polytopes with the class of Nakajima polytopes. We combine these results to give a new proof that two lattice weak Minkowski summands of the same such smooth polytope are relatively IDP. Along the way, we prove a structure theorem for simple polytopes whose 2-faces are triangles and trapezoids.
Read the full abstract
Data Structures and Algorithms
On the Offline Version of the Time-Optimal k-Server Problem
We consider the offline problem of parallel relocation of k identical mobile resources. After each request, known in advance, the resources may move simultaneously, and the duration of a step is determined by the longest individual movement. This model is equivalent to the offline version of the time-optimal k-server problem. We prove that the decision version is strongly NP-complete already on metrics of finite subsets of the Euclidean line, or equivalently, on vertex metrics of weighted paths. Thus, the computational hardness persists even under a linear arrangement of the admissible resource locations. As a positive result, we show that the problem can be solved exactly in polynomial time on metrics of undirected unweighted graphs with a universal vertex.
Read the full abstract
Machine Learning
Multi-Term Fourier Graph Neural Network with Sample Relationship Learning for Enhanced Remaining Useful Life Prediction
Predicting the remaining useful life (RUL) is essential for effective predictive maintenance. Spatio-Temporal Graph Neural Networks (ST-GNNs), which can model both temporal and spatial relationships by representing time series data as a sequence of graphs, have shown exceptional performance in RUL prediction. However, current ST-GNNs face several drawbacks. First, they require domain expertise or significant computational power to establish graph structures prior to deploying GNNs. Second, the models are restricted to capture temporal dependencies within a predefined fixed-size lookback window. This restriction ignores the common issue of varying time series lengths, leading the prediction model to miss short-term or long-term dependencies. Finally, conventional models often fail to capture the inherent relationships between samples generated from adjacent time windows, which are crucial for improving both the accuracy and robustness of predictions. To address the aforementioned issues, we introduce a novel framework called Multi-Term Fourier Graph Neural Network with Sample Relationship Learning (MTFGN-SRL). Rather than treating the sample as a sequence of graphs, we consider it as a single complete graph and utilize a Fourier Graph Neural Network (FGN) to capture the spatio-temporal information in the frequency domain. We propose a multi-term learning module that utilizes multiple lookback windows to generate samples with varying terms, which are then fed into the FGN to enhance the extraction of useful information from the data. Finally, we develop a sample relationship learning module by training a heterogeneous GNN to identify inter-sample relationships, resulting in enhanced accuracy and robustness in predictions. Evaluations on the CMAPSS dataset demonstrate MTFGN-SRL's superior performance over state-of-the-art methods in RUL prediction.
Read the full abstract
High Energy Physics (Experiment)
Discovery of an unexpectedly light and narrow beauty-strange state
As the essential building blocks of visible matter, hadrons have traditionally been classified by the quark model as mesons composed of quark-antiquark pairs and baryons built from three valence quarks. Yet, this classical picture does not account for the intricate chiral dynamics of the strong force and the emergence of exotic multi-quark hadrons. While experimental evidence for such unconventional dynamics has surfaced in the charm sector, the open-beauty system remains the long-sought frontier for testing the universality of these mechanisms. Here the observation of a new resonance in the beauty-strange sector with a global significance exceeding seven standard deviations is reported using proton-proton collision data recorded by the Large Hadron Collider beauty (LHCb) experiment at the European Organization for Nuclear Research (CERN). It exhibits a narrow natural width and a substantial mass deficit compared to the conventional quark model predictions. This result marks the first observation of a nonconventional single-beauty hadron, providing crucial insights into the chiral dynamics of the strong interaction and heavy-quark spin symmetry in the exotic domain.
Read the full abstract
Combinatorics
Characterization of tree-child networks in terms of mu vectors
We characterize tree-child phylogenetic networks in terms of their mu-representations. First, we give a structural characterization of tree-child networks by means of ordered tree-path decompositions. We then translate this decomposition into a set of purely vectorial conditions on finite subsets M in N^n. We prove that such a set M is the mu-representation of a tree-child phylogenetic network if and only if it is tree-child mu-compatible. This provides a feasibility criterion for tree-child mu-representations which can be used as a basis for reconstruction and further algorithmic applications. Note that this paper presents results arising from ongoing research on tree-child networks and that the results will be further developed and placed into proper context in subsequent versions.
Read the full abstract
Audio and Speech Processing
Qwen-Audio-3.1-Realtime: Towards Reliable Agentic Voice Interaction
Real-time voice assistants must reason over evolving requests, execute actions, and follow conversational rules. Qwen-Audio-3.1-Realtime brings these requirements together through Think, Act, and Speak and Coordinate. Think combines Core-Cocktail supervised fine-tuning with Multimodality and Multi-Teacher On-Policy Distillation (M$^{2}$-OPD) to transfer language capabilities and develop native audio skills. Act uses self-evolving executable environments and multi-granularity rollouts for Group Relative Policy Optimization (GRPO), teaching the model to use tools, interpret feedback, and complete tasks. Speak and Coordinate aligns whether, when, and how the assistant speaks or acts. We evaluate audio reasoning, multilingual understanding, tool use, conversational behavior, full-duplex interaction, and safety. Compared with Qwen-Audio-3.0-Realtime, 3.1 raises overall task success from 78.4% to 82.0% on our half-duplex speech-to-text adaptation of $\tau$-Voice. On speech-to-speech Full-Duplex-Bench v1.5, the response rate to background speech falls from 73.0% to 13.0%. We also present a separate Voice Harness prototype, using Qwen-Audio-3.0-Realtime as its foreground, that extends spoken interaction to persistent tasks through foreground–background coordination and memory.
Read the full abstract
Nuclear Theory
Quarkyonic matter suppresses neutron-star $g$ modes and reverses their mass trend
Gravity (g) modes are the only neutron-star oscillations that report on the composition of dense matter rather than on its stiffness, and work on hybrid stars has established that a first-order quark transition raises their frequency. Quarkyonic matter does the opposite. Quark-nucleon chemical equilibrium is maintained by the strong interaction, so the quarks acquire no thermodynamic freedom on an oscillation period and $c_s^2-c_e^2$ reduces to a positive-definite quadratic form in the lepton gradients alone. The nucleon momentum shell stiffens both sound speeds together instead of separating them, so the buoyancy factor collapses by a factor of 9.5 to 19 at an early transition and the core is left only weakly stratified. Solving the $l=2$ relativistic Cowling problem for ten equations of state that share one isoscalar sector, seven quarkyonic and three nucleonic controls at matched symmetry-energy slope, we found the g-mode confined to the nucleonic shell outside the core, with the horizontal flow that it lives on excluded from the core while the core is displaced almost rigidly. Its frequency falls from 158-522 Hz across the controls to $81-254$~Hz across the quarkyonic models, and by 14% at 1.4$M_\odot$ for the matched pair at $L=50\mev$; more important than the shift, it decreases with mass where the controls rise. Writing each frequency as the dynamical frequency $(GM/R^3)^{1/2}$ times a dimensionless remainder separates structure from composition. The $f$ and $p_1$ trends prove to be inherited from the mass–radius relation; the $g_1$ remainder, constant to $2-9\%$ along a nucleonic sequence, falls by a quarter to a third along a quarkyonic one and departs by a factor of two from the nucleonic $g$-mode relation at fixed compactness and $L/K_0$. These are Cowling values, lower bounds at the ten-per-cent level, and the sign of the trend survives a correction of that size.
Read the full abstract
Representation Theory
A geometric realization of socle-projective categories for posets of type $\mathbb{D}$
We introduce posets of type $\mathbb{D}$, a family of posets described by an admissible Dynkin quiver of type $D_n$ together with a compatible set of extra arrows (alien arrows), and show that their socle-projective representation category is of finite representation type. Continuing, in the same spirit, a program initiated for posets of type $\mathbb{A}$ [R. Schiffler, R-J. Serna, A geometric realization of socle-projective categories for posets of type $\mathbb{A}$, J. Pure Appl. Algebra 224 (2020), no. 12, 106436], we build on an existing geometric model for cluster-tilted algebras of type $D_n$, whose geometric combinatorics is more intricate than that of type $\mathbb{A}$. Our main result establishes a $\Bbbk$-linear categorical equivalence $\Theta$ between a full subcategory $(\mathcal C/T)_F$ of the arc category of a punctured $(n+3)$-gon, whose objects are certain $sp$-arcs, and the category of finitely generated socle-projective $\Bbbk\mathscr{P}$-modules, for $\mathscr{P}$ a poset of type $\mathbb{D}$. As a consequence, when the set of alien arrows is empty, we conclude that the cluster subalgebra generated by the $sp$-arcs coincides with the full cluster algebra.
Read the full abstract
Cryptography and Security
Attack Success Rate Is Not a Number: On Measurement Validity in Agentic AI Security Evaluation
Attack success rate (ASR) is the headline metric in nearly every published evaluation of attacks on, and defenses for, LLM agents. We argue that ASR as currently used is not a single quantity but a family of metrics parameterized by six design choices that papers seldom specify and never hold constant across the literature. We support this with two studies that require no proprietary access. First, a full-text meta-analysis of 259 agentic-security papers posted to arXiv between February 2025 and September 2026 finds that most report neither a variance estimate nor repeated runs for their headline attack metric: 58% (95% CI 44-71) in a hand-coded random sample of 50, 65.3% by automated coding of all 259. Only 30.9% disclose enough about decoding to establish whether their evaluation was even stochastic, and of the 64 papers we confirm use an LLM judge, 29.7% report any agreement check against human labels. Second, an analytical study shows that these omissions are not cosmetic: on a 100-instance benchmark, the minimum difference in ASR detectable at conventional power is 18.2 percentage points, and two defenses whose true ASRs differ by 5 points are ranked in the wrong order by a single-run evaluation roughly 21% of the time. Because several of the six axes shift ASR in a system-dependent way, the resulting incomparability is not a constant offset that cancels in comparison. We conclude that cross-paper ASR comparison is currently unsupported, and propose a ten-item reporting checklist targeted at each failure we measure. Our aim is not to dispute any individual result but to supply the shared measurement contract the field has so far done without.
Read the full abstract
Algebraic Geometry
Local Logarithmic Cartier Transform
This article is the first of three articles whose goal is to generalize the Cartier transform of Ogus and Vologodsky to the logarithmic setting. In this article, we generalize a local version, due to Shiho, of the Cartier transform to log smooth schemes. More precisely, let $k$ be a perfect field of positive characteristic and equip $\operatorname{Spec}k$ with the trivial logarithmic structure. For a log smooth morphism of logarithmic schemes $X \rightarrow S,$ where $S$ is log flat and locally of finite type over $\operatorname{Spec}k,$ we obtain, under the assumption that the exact relative Frobenius lifts over the Witt vectors of $k$ to a morphism between log smooth schemes over $S,$ a fully faithful functor from the category of quasi-coherent modules on the base change $X'=X\times_{S,F_S}S$ of $X$ by the Frobenius $F_S$ of $S,$ equipped with a quasi-nilpotent Higgs field, to the category of quasi-coherent modules on $X$ equipped with a quasi-nilpotent integrable connection. For this, we prove a log flat descent theorem for morphisms, based on previous work by Kato.
Read the full abstract
Number Theory
A density version for the sum of nine cubes of primes
Let $\mathbb{P}$ be the set of primes. Suppose that $P_{i}$, $i=1,2,\ldots,9$ are nine subsets of $\mathbb{P}$ with relative lower density $\underline{d}_{\mathbb{P}}(P_{i})=\mu_{i}$. When $\sum_{i=1}^{9} \mu_{i}^{3}>8$, we prove that every sufficiently large odd integer can be written as $n=\sum_{i=1}^{9} p_{i}^{3}$ with $p_{i} \in P_{i}$, $i=1,2,\ldots,9$.
Read the full abstract
Analysis of PDEs
Universal Spacelikeness Estimates and Liouville Rigidity for Lorentzian $\sigma_k$ Curvature Equations
We study nonnegative entire spacelike graphs in Lorentz–Minkowski space satisfying $\sigma_k(A[u])=u^p$. For $2\le k<n$ and $p\ge k$, pointwise strict spacelikeness and closed $k$-admissibility yield universal bounds for the height and Lorentz factor. Their proof combines block coercivity in the full Gårding cone, a Lorentzian cutoff, and hyperbolic-cap comparison. For $2\le k<n/2$ and $k\le p\le k(n+2)/(n-2k)$, every such solution vanishes, without symmetry, decay, finite-energy, curvature-pinching, or global Hessian assumptions. In the subcritical range we use a trace-free Newton tensor, a weighted divergence identity, and a finite descent. At the critical endpoint, the divergence identity retains an exact nonnegative defect and a positive quartic term. Direct estimates cover $2k<n\le4k+2$. For $n\ge4k+3$, we use compactness, concentration of the $k$-Hessian measure at the first crossing, a single-pole Pohozaev argument, core counting, a recursive defect estimate, and Souplet-type radius selection. A geometric corollary gives a rigidity result for complete spacelike immersions under the corresponding curvature equation.
Read the full abstract
Physics and Society
Statistical physics of language change inferred from time evolving maps
Language change may be studied by tracking linguistic variant frequencies through space and time. Observed frequencies may be viewed as realisations of a statistical field. We first set out an efficient cross validated method for inferring the empirical field — the variant frequency distribution estimated directly from data — in our case, high resolution surveys from 20th century USA. We then derive a model of the statistical field, assuming that individuals diffuse locally, periodically migrate, and copy one another based on a form of replicator dynamics involving both bias and linguistic accommodation. We infer model parameters by comparing changes in model and empirical fields. Our inferences demonstrate that spatial linguistic patterns can be rapidly destroyed by migration but that accommodation can create them, protect them, and in combination with diffusion, produce partially predictable pattern dynamics. The results provide the strongest evidence yet for surface tension driven phase ordering in human dialects. We quantify the model's forecasting ability up to a time horizon of twenty five years using the Kullback-Leibler divergence between forecasts and observations.
Read the full abstract
Number Theory
Moulds, Bimoulds, and some Lie algebras
The Lie algebra of multiple zeta values is realized as the space $\operatorname{ARI}^{\operatorname{pol}}_{\underline{al}\ast \underline{il}}$ of alternal moulds whose swap is alternil up to a constant mould, equipped with the $ari$ bracket. In this paper, we study the larger space $\operatorname{BARI}_{\underline{il},swap}^{\operatorname{pol}}$ of alternil, swap-invariant bimoulds, which is conjecturally the Lie algebra for multiple $q$-zeta values. We propose an explicit formula for a Lie bracket $uri$ on this space. Moreover, we prove that the Lie algebra $\operatorname{ARI}^{\operatorname{pol}}_{\underline{al}\ast \underline{il}}$ embeds into $\operatorname{BARI}_{\underline{il},swap}^{\operatorname{pol}}$, with the $ari$ bracket translating directly into the $uri$ bracket. Finally, we examine the associated-depth graded of $\operatorname{BARI}_{\underline{il},swap}^{\operatorname{pol}}$, extending the known depth-graded setup for $\operatorname{ARI}_{\underline{al}\ast \underline{il}}^{\operatorname{pol}}$.
Read the full abstract
Commutative Algebra
Notes on Matlis reflexive modules
Let $M$ denote a module over a local Noetherian ring $(R,\mathfrak{m})$ with residue field $\Bbbk$ and its injective hull $E_R$. Let $D_R(\cdot) = \operatorname{Hom}_R(\cdot,E_R)$ denote the Matlis duality functor. Then $M$ is called Matlis reflexive whenever the injection $M \to D_R^2(M)$ is an isomorphism. The following results are proved: (1) For an ideal of $R$ a reflexive module is quasi-complete, generalizing part of Belshoff's results (see \cite{Br}). (2) We improve Zöschinger's numerical criterion for Matlis reflexivity (see \cite{Zh2}). (3) As shown by Enochs (see \cite{Ee}) for a prime ideal and the injective hull $E_R(R/\mathfrak{p})$ it follows that $D_R(E_R(R/\mathfrak{p}))$ is the completion of a free $R_{\mathfrak{p}}$-module of rank $\tau_{\mathfrak{p}}$, the Enochs number of $\mathfrak{p}$. We characterize when $\tau_{\mathfrak{p}} = 1$, extending author's result (see \cite{Sp16}).
Read the full abstract
Machine Learning
Mitigating Sequential Reappearance in Diffusion Data-Point Unlearning
Diffusion data-point unlearning is typically evaluated immediately after each deletion, even though subsequent requests may repeatedly update the same model. We identify sequential reappearance, a failure mode in which an instance that is initially judged to be forgotten later returns to the memorized regime without reuse of the deleted data or adversarial fine-tuning. To capture this behavior, we introduce a target-level evaluation protocol that tracks whether each target is forgotten immediately, remains forgotten at the end of the sequence, or reappears during subsequent deletions. We further find that targets that later reappear exhibit sharper local denoising-loss geometry after deletion than targets that remain forgotten.
Read the full abstract
Artificial Intelligence
Ovis-Embedding: Pushing the Frontiers of Universal Omni-Modal Embeddings
In this report, we introduce Ovis-Embedding, a state-of-the-art omni-modal embedding family built on native integration of text, image, video, and audio. Instead of assembling separate modality towers, Ovis-Embedding uses a shared multimodal backbone to encode different modalities in a common representation space. Specifically, we make three key advances: (1) native omni-modal initialization: we adopt a pretrained Qwen-omni model as the embedding backbone and adapt it through contrastive training with low-rank initialization; (2) data-centric omni-modal training: we construct a broad, high-quality corpus spanning text, images, video, audio, and interleaved multimodal data. To improve data efficiency, we introduce homogeneous-source sampling to form task-consistent batches with informative in-batch negatives; and (3) embedding-specific training and inference optimization: we use focal loss to emphasize hard examples and similarity-based Embedding Distillation to transfer fine-grained similarity structure from complementary experts. At inference time, low-rank feature decomposition enables compact embeddings with flexible dimensionality and minimal performance loss. Empirical evaluations show that the Ovis-Embedding family achieves state-of-the-art performance on MMEB-v3, MMEB-v2, MVEB, MAEB, and RTEB, demonstrating its effectiveness across text, image, video, and audio modalities. These results highlight the potential of unified omni-modal training to overcome modality fragmentation and advance universal embedding models for any-to-any retrieval.
Read the full abstract
Nuclear Theory
Persistent State Method for Resonances on Classical and Quantum Computers
We introduce a new method for extracting resonance pole positions that does not require non-Hermitian extensions of a Hamiltonian. The complex resonance poles are extracted from unitary time evolution of a persistent state, a compact trial state chosen such that its survival amplitude is governed by a single exponential over an extended time window. We solve several two- and three-body systems interacting via short- and long-range forces on a lattice and show that the pole positions obtained using the persistent state method converge approximately exponentially with the linear size of the system. We also consider a gate-based quantum implementation of our method using the Rodeo algorithm and a Hamiltonian variational ansatz, and outline an extension to two-cluster scattering.
Read the full abstract
Machine Learning
Learning Neural Feedback Linearization for Data-driven Systems via Augmented Lagrangian
The paper proposes a novel data-driven framework for designing and training a feedback linearizing controller by explicitly incorporating relative degree based conditions into the learning process. This enables the conventional feedback controller components to be replaced by neural Lie derivatives, thereby facilitating a fully data-driven feedback linearization framework. Furthermore, practical closed-loop stability is established by deriving sufficient conditions under which bounded identification errors lead to bounded tracking errors. The derived theoretical results are validated through their application to an armature controlled DC motor.
Read the full abstract
Nuclear Theory
Universal $Z^{2/3}/\sqrt{Q_\alpha}$ Scaling Law in Alpha Decay from Nuclei to Neutron-Star Mergers
We establish a universal scaling law for $\alpha$-decay half-lives based on the variable $X_a = Z^a/\sqrt{Q_\alpha}$, which collapses experimental and theoretical data spanning over twenty orders of magnitude onto a single linear correlation. Global optimization over the complete set of even-even $\alpha$ emitters reveals a uniquely sharp optimum at $a \simeq 2/3$. This exponent is theoretically motivated by the leading geometric scaling of heavy nuclei and emerges quantitatively from the correlated nuclear systematics, driven by the correlated $(Z, Q_\alpha)$ manifold of the nuclear chart. Strikingly, five structurally distinct semi-empirical models and an independent microscopic WKB calculation, when independently optimized with respect to the exponent $a$, yield values clustered around $2/3$, while the corresponding $a=2/3$ correlations remain highly linear without refitting the original model parameters. This emergent scaling law implies smooth variations of decay times along the heavy $r$-process path. We demonstrate analytically that, given a roughly uniform distribution of this variable, the scaling law naturally supports a quasi-power-law radioactive heating rate ($\dot{\epsilon} \propto t^{-1.24}$), consistent with full network calculations. Furthermore, integrating these scaling predictions directly into nuclear source terms for radiative-diffusion models yields multimessenger observables that accurately reproduce the kilonova AT2017gfo associated with the gravitational-wave event GW170817, demonstrating that the $Z^{2/3}/\sqrt{Q_\alpha}$ scaling coordinate provides a robust tool for modeling the radioactive engines of neutron-star mergers.
Read the full abstract
High Energy Physics (Theory)
On Thermodynamic Universalities and Optics of B-deformed Reissner–Nordström–AdS Black Holes
Using machine learning techniques, we study the Reissner–Nordström–AdS black holes in the framework of extended space-time derivatives inspired by non-commutative geometry in string theory where the deformation parameters are related to the inverse of the NS-NS B-field. We refer to these solutions as B-deformed Reissner–Nordström–AdS black holes. Precisely, we examine the thermodynamic and the optical behaviors of such stringy deformed AdS black holes. Exploiting advanced numerical computations, we first examine the corresponding thermodynamic Van der Waals behaviors by calculating the universal ratios describing the P-V criticality and the Joule-Thomson expansion features. Applying such numerical results, we construct reliable training data for a fully connected neural network being developed to determine whether such stringy black hole configurations exhibit thermodynamic Van der Waals aspects. Concretely, we reveal that the fully connected and trained neural network accurately detects Van der Waals behaviors. Supported by the observational data reported by the Event Horizon Telescope international collaborations, we investigate the optical shadows of such B-deformed Reissner–Nordström–AdS black holes using machine learning methods. In order to provide corroborated models, we constraint the involved parameters including the stringy one B by making use of M87* and Sgr A* black hole empirical data.
Read the full abstract
Chemical Physics
Reply to Comment on "Efficient implementation of the superposition of atomic potentials initial guess for electronic structure calculations in Gaussian basis sets"
We reply to the Comment by Surjuse, Deng, Asadchev, and Valeev [arXiv:2603.16989] on our article "Efficient implementation of the superposition of atomic potentials initial guess for electronic structure calculations in Gaussian basis sets" [J. Chem. Phys. 152, 144105 (2020)]. We do not disagree with their work, but point out that they appear to have misinterpreted a statement in our original abstract: our suggestion to evaluate the matrix elements of the superposition of atomic potentials (SAP) using two-electron integral code was made on grounds of portability rather than as a recommendation against a dedicated one-electron implementation. Such an implementation is in fact already available in existing codes - in Dirac, for example, where a Gaussian SAP potential is formally indistinguishable from a Gaussian finite-nucleus model at the level of the nuclear attraction integral routine. We further note that both routes reduce to the same three-Gaussian overlap kernel through the Obara-Saika Laplace transform, and that SAP itself enjoys a rigorous theoretical justification through Theophilou's theorem on spherical densities and its extensions by Nagy.
Read the full abstract
Representation Theory
Monoidal Gröbner systems and categories of affine Brauer type
We introduce an analogue of Gröbner bases, or equivalently, Bergman's diamond lemma, for linear (super)monoidal categories. It gives a systematic way to study monoidal ideals and to prove basis theorems. The central notion is that of a monoidal Gröbner system and is based on higher linear rewriting theory. We then apply the theory to categories of affine Brauer type: linear (super)monoidal categories that have the same hom-basis as the affine Brauer category, but possibly distinct composition and tensor product. Our main result is a criterion for a category to be of affine Brauer type, reducing the question to an explicit list of local computations, which we partially implement in the computer algebra system FORM. This gives new combinatorial proofs of the basis theorems for the affine Brauer category, the nil-Brauer category and the affine VW supercategory, and yields new examples. In particular, we construct the odd nil-Brauer category, a conjectural supercategorification of the split $\imath$quantum group of rank one, and the quantized affine VW supercategory, whose non-affine part is the quantized periplectic Brauer category and which we expect to satisfy a higher quantum Schur–Weyl duality. Finally, we classify the categories of affine Brauer type admitting a sufficiently simple presentation.
Read the full abstract
High Energy Physics (Experiment)
Observation of $\eta(2600)$ and Threshold Enhancements in the $\Lambda\bar{\Lambda}$ System
Using $2712.4 \pm 14.3$ million $\psi(3686)$ events collected with the BESIII detector, the $\Lambda\bar{\Lambda}$ system produced in $\psi(3686)$ radiative decays is studied. A model-independent partial wave analysis reveals a significant threshold enhancement structure dominated by the $^1S_0$ and $^3P_0$ partial waves, corresponding to $J^{PC} = 0^{-+}$ and $0^{++}$, respectively. In addition, a new pseudoscalar resonance, designated as $\eta(2600)$, is observed in the $^1S_0$ partial wave with a mass value consistent with the previously reported $X(2600)$ state, which represents the heaviest light meson observed to date. These results enhance our understanding of baryon-antibaryon threshold dynamics and the pseudoscalar light hadron spectroscopy.
Read the full abstract
Commutative Algebra
Ideal Structures in Idealizations and Cardinalities of Annihilating Ideals
We describe the ideals of an idealization $D\ltimes M$ by triples $(I,N,\varphi)$, where $I$ is an ideal of $D$, $N$ is a submodule of $M$ with $IM\subseteq N$, and $\varphi\in\operatorname{Hom}_D(I,M/N)$. For a domain $D$ and torsion-free $M$, the nonzero proper ideals of $D\ltimes M$ with nonzero annihilator are exactly $0\ltimes N$. As an application, for $R=\mathbb R[[t]]\ltimes\mathbb R[[t]]$, the nonzero proper annihilating ideals form a countable set, while the set of all nonzero proper ideals has cardinality $2^{\aleph_0}$. This answers negatively a question of Behboodi and Rakeei.
Read the full abstract
Instrumentation and Detectors
Pulse-shape discrimination with machine learning for CZT detectors at the DA$\Phi$NE beam test facility
Cadmium zinc telluride (CZT) detectors offer versatility, operational simplicity, and room-temperature X- and gamma-ray spectroscopy, making them attractive for collider applications, yet their use under high-flux conditions remains limited. Here, we present a preliminary feature-based pulse-shape analysis employing machine learning, on data acquired with a quasi-hemispherical CZT detector at the DA$\\Phi$NE beam test facility of the National Laboratory of Frascati of INFN. A 300-MeV electron beam impinging on a lead target produced characteristic Pb X-rays together with a broad background extending up to the electron-positron annihilation region. Physically motivated temporal and morphological features were extracted from the recorded waveforms and used to distinguish nominal photon-like pulses from anomalous events. An XGBoost classifier trained and validated on 10,000 labeled waveforms achieved an accuracy of approximately 97%, with most of its classification performance reached using only a few hundred labeled examples. The trained model was applied to more than 700,000 events, substantially reducing the spectral continuum and coincidence peaks, while preserving the characteristic Pb X-ray lines up to the 511-keV annihilation peak. These preliminary results demonstrate the potential of machine-learning-assisted pulse-shape discrimination for improving CZT spectroscopy in collider environments.
Read the full abstract
Machine Learning (Statistics)
Empirical Auditing of Edge-Private Graph Generators
We empirically audit privacy leakage by testing whether outputs from edge-neighbouring inputs remain distinguishable, using statistically valid lower bounds on the privacy loss witnessed by our attacks. Our framework compares direct-edge, local-structural, and GNN-based attacks through the geometry surrounding a target edge. Experiments across two generators and two networks show that privacy leakage is both mechanism- and network-dependent, with learned representations revealing information not captured by conventional local statistics.
Read the full abstract
Cryptography and Security
Benchmarking Neural Defend ARCAS 1B: A Foundational Multimodal Deepfake Detection Model
AI-generated imagery evolves faster than benchmark-specific detector evaluations, making a single score an incomplete account of generalization. This paper evaluates Neural Defend ARCAS 1B across benchmark families without benchmark-specific parameter updates. We retain native aggregation and supplement it with record-level measures, coverage accounting, and subgroup diagnostics. Each Results subsection identifies the release and evaluation population, reports the official metric, and describes observed error patterns. A combined analysis synthesizes shared patterns while preserving the distinction between native and pooled quantities. Cross-paper comparisons are restricted to aligned evidence; differences in release, population, preprocessing, training, or benchmark exposure are context rather than rank. The findings characterize performance on evaluated records, not universal reliability, calibration, attribution, or future adaptive attacks. By keeping benchmark-native outcomes distinct from pooled summaries, the study makes test-population, class-balance, and missing-record-coverage differences visible. It supports interpretation of detector results in research, platform-safety, and forensic-review settings, foregrounding traceable protocol conditions over claims or leaderboard comparisons.