Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Wednesday 2 September

Machine Learning

Equation Recast for Canonical Operator Learning Across Parametric PDEs

Learning solution operators across broad parameter ranges can require substantial coverage of both input functions and physical parameters, particularly for purely data-driven parametric models. In addition, the resulting models may fail silently outside the training distribution. We introduce equation recast, which reformulates parametric operator learning as the learning of a single canonical operator. Parameter-induced operator variations are derived analytically from the governing equation and absorbed into effective sources, enabling zero-shot prediction across new parameter regimes. Across multi-parameter, nonlinear, and singular PDE settings, equation recast supports extrapolation, integrates sparse heterogeneous datasets in a shared canonical representation, and uses loss of convergence as an internal warning signal for failure of the recast iteration. In high-fidelity tokamak simulations for nuclear fusion, the framework unifies electron-temperature data across four device geometries through canonical-domain mapping within one jointly trained operator. Equation recast provides a route toward reusable neural PDE solvers combining equation-guided transfer, data efficiency, and monitorable inference.
Read the full abstract

All authors Qiyun Cheng, Valentin Duruisseaux, Cesar F. Clauser, Md Hossain Sahadath, Huihua Yang, Shaowu Pan, Nathaniel Ferraro, Anima Anandkumar, Wei Ji, Cristina Rea

Artificial Intelligence

Structure and Implementation of New Practical English Textbooks Driven by Artificial Intelligence

Artificial intelligence is changing the form of applied English materials from fixed paper sequences to adaptive learning systems that can diagnose learners, recommend tasks, and provide formative feedback. This paper studies the structure and application of a new practical English textbook driven by artificial intelligence. A five-layer architecture is proposed: knowledge mapping, learner profiling, task generation, feedback orchestration, and teacher-side governance. A prototype was tested on 186 non-English-major undergraduates for eight weeks of teaching. Compared with a static digital textbook, the proposed system increased the unit completion accuracy from 72.4% to 84.9%, raised the average score for speaking tasks by 10.8 points, and reduced the teacher's correction time by 31.6%. Therefore, an AI-driven textbook can maintain the stability of the curriculum while providing personalised learning paths, rich practice materials and traceable classroom data.
Read the full abstract

All authors Ya Wang, Lei Zhang, Xueguang Yang, Bo Chen

Algebraic Topology

Homology Nilpotency in Rational Homotopy Theory: Cell Attachments, Retractive Towers, Divergence, and Stabilization

Homology nilpotency of a simply connected minimal Sullivan algebra $M$ is the least integer $n$ for which $(M^+)^{n+1}$ is contained in an acyclic differential ideal. We develop lower- and upper-bound criteria, including methods for rational cell attachments, and construct an explicit finite-type minimal Sullivan algebra $M$ satisfying $nil_h(M)=3<Hnil(M)=4$. Complete strictly coordinated retractive towers identify the obstruction: they characterize homotopical nil-length while exposing the additional quotient defect measured by homology nilpotency. We then show that this rigid defect disappears after stabilization by degreewise finite wedges of simply connected rational spheres: $$ Hnil_s(X)=cat_o(X) $$ for every simply connected rational space $X$ of finite type.
Read the full abstract

Materials Science

IDMate: Finite-temperature error bounds for window-resolved self-consistent-field screening

We formulate a finite-temperature residual test in IDMate that bounds window-resolved electronic errors without a spectral-gap assumption. For a fixed Hamiltonian and exact electron number, strong convexity of the matrix Fermi entropy bounds the density-matrix distance and free-energy error within a selected window. The bound remains finite at spectral crossings and extends to weighted k points with a shared chemical potential. We also derive a distance correction for particle-number mismatch. Across $3{,}586$ stress trials in $70$ seeded perturbation ladders, $1{,}942$ proposals satisfy the screen with no observed violation of the $0.05$ window-distance criterion plus its numerical allowance. This criterion differs from the uncorrected exact-trace bound, which six of ten historical in-loop candidates exceed at the numerical-error scale. An accept-or-recover loop replaces ten reference-map evaluations while meeting terminal comparison criteria in three configurations that include oracle-subspace controls. Additional candidates built only from preceding-iteration orbitals yield two acceptances and one abstention. The silicon candidate has a window distance of $1.891\times10^{-13}$ but a normalized real-space density error of $3.754\%$. Analytic examples separate errors from complement occupations and interblock coupling. Window-level accuracy therefore does not imply full-state accuracy; the screen tests compressed proposal quality, independently of nonlinear SCF convergence or net acceleration.
Read the full abstract

All authors Peng Kang, Da Wan, Shulin Bai, Zhen Li, Yu Liu, Lei Zheng, Li-Dong Zhao, Huibin Xu

Data Structures and Algorithms

SparseStack Is an Optimal Oblivious Subspace Embedding

We prove that fully independent SparseStack achieves the oblivious subspace embedding parameters conjectured by Nelson and Nguyen (FOCS 2013): $m=O((d+\log(1/\delta))/\varepsilon^2)$ rows and $s=O(\log(d/\delta)/\varepsilon)$ nonzero entries per column for distortion $\varepsilon$ and failure probability $\delta$ on any fixed $d$-dimensional subspace, with explicit constants. The proof turns random-matrix concentration into a problem in finite-dimensional linear algebra. A coupling first reduces the moment estimates to a model with independent finite-valued entries. We represent these variables by multiplication operators, so their matrix moments become exact matrix elements of a deterministic operator on a finite tensor product. The central estimate bounds the contribution of $\ell\ge1$ occupied sites sharing the external factor $\mathbb{R}^d$ by $d+\ell-1$ rather than $d\ell$, yielding additive dependence on the dimension and the moment order. This approach controls both spectral edges without Gaussian comparison. The main theorem has been formally verified in Lean 4.
Read the full abstract

Data Structures and Algorithms

Learning Fourier-Sparse Signals and Multiband Signals

A classical problem in continuous sparse Fourier transforms, which dates back to Prony's work in 1795, is to learn a $k$-Fourier-sparse signal $x(t):=\sum_{j=1}^k \alpha_j e^{2 \pi \mathbf{i} f_j t}$ with arbitrary $k$ frequencies $f_1,\ldots,f_k \in \mathbb{R}$. We consider this learning problem within a fixed time window $t \in [-1,1]$ in the presence of bounded $L_2$ adversarial noise. Because the frequencies $f_1,\ldots,f_k$ can be arbitrarily close, accurately recovering individual frequencies is information-theoretically impossible even under exponentially small noise from Moitra (STOC 2015). This work therefore examines two fundamental questions: If an algorithm uses $\tilde{O}(k)$ frequencies to approximate $f_1,\ldots,f_k$ of $x$, what is the optimal covering error? And how can we efficiently learn the continuous signal $x(t)$ as a whole over the time window? Our main result is an algorithm running in time $\tilde{O}(k)$ that outputs a list $L$ of $\tilde{O}(k)$ frequencies with covering error $O(k)$ — meaning that for most frequencies $f_j$ of $x$, $L$ guarantees $\min_{\tilde{f} \in L} |f_j-\tilde{f}| = O(k)$ — and an reconstruction $\tilde{x}(t) \approx x(t)$ over $[-1,1]$. When constrained to outputting $\tilde{O}(k)$ frequencies, this $O(k)$ covering error is nearly optimal: Chen and Price (ICALP 2019) demonstrated two indistinguishable $k$-Fourier-sparse signals separated by distance $\tilde{\Omega}(k^2)$ in the frequency domain, which implies an amortized lower bound of $\tilde{\Omega}(k)$ per frequency. Furthermore, our sample and time complexities are nearly optimal, dramatically improving upon the previous best algorithm by Song, Sun, Weinstein, and Zhang (FOCS 2023), which required $\tilde{O}(k^4)$ samples and $\tilde{O}(k^{4\omega})$ running time.
Read the full abstract

All authors Dongrun Cai, Xue Chen, Xiaowei Shao, Yile Wang

Strongly Correlated Electrons

Valley polarization dependence of candidate even-denominator fractional quantum Hall states in monolayer graphene

We investigate even-denominator fractional quantum Hall (EDFQH) states in monolayer graphene, focusing on the experimentally observed filling fractions $\nu = 1/2$ and $\nu = 1/4$. Owing to the approximate SU(4) symmetry arising from spin and valley degrees of freedom, graphene hosts a rich variety of multi-component fractional quantum Hall states with different polarization configurations. Using the Chern-Simons composite fermion framework for SU(4) systems, we construct candidate variational wave functions corresponding to distinct spin, valley, and mixed polarization states. The ground-state energies of these states are evaluated numerically using the Coulomb interaction in spherical geometry. By comparing energies across different polarization sectors, we identify the energetically favored configurations at $\nu = 1/2$ and $\nu = 1/4$. Our variational energy comparison suggests that the energetically favored candidate states correspond to multi-component correlated quantum Hall liquids. Within the restricted family of trial states considered here, these states differ from a simple composite-fermion Fermi-sea description. These findings provide insight into the role of valley polarization and SU(4) symmetry in stabilizing even-denominator fractional quantum Hall states in graphene.
Read the full abstract

High Energy Physics (Phenomenology)

Probing Quantum Foundations in Long-Baseline Neutrino Oscillations: Wave Packet Approach from MINOS Data to DUNE Predictions

We investigate neutrino flavor oscillations in the wave packet formalism, extending the standard planewave treatment to incorporate the finite spatial coherence of neutrino mass eigenstates.We derive the full three flavor oscillation probability with MSW matter effects, decoherence, and localization suppression governed by the wave packet width, benchmarking against MINOS disappearance data and extending to DUNE predictions under the same parameters. To quantify how sharply the oscillation data constrain the wave packet width, we compute the classical Fisher information FC as a function of neutrino energy for both MINOS and DUNE, and show that its sensitivity is concentrated precisely in the low-energy regime where the wave-packet and plane-wave predictions diverge. Beyond the oscillation probability analysis, we compute wave particle entanglement complementarity quantities within a quantum information theoretic framework and explore the complete triality description involving entanglement, predictability, and visibility as functions of neutrino energy for both experiments such as MINOS and DUNE. We show that even when the oscillation probability is numerically indistinguishable from the planewave result, the wave packet structure leaves observable imprints in these triality measures. Our results demonstrate that the wave packet approach provides a theoretically consistent and experimentally motivated framework for probing quantum foundations in long-baseline atmospheric neutrino oscillation experiments.
Read the full abstract

Geometric Topology

Quilt decompositions of surfaces and Torelli group action on the extended Hatcher complex

We give a presentation of a groupoid of transformations of quilt decompositions of a surface, which are pants decompositions of the surface with the addition of "seams". We consider colored quilt decompositions of a surface, where one side of a quilt decomposition is colored. We also give a presentation of a groupoid of transformations of colored quilt decompositions of a surface. These presentations of such groupoids are realized by constructing connected and simply-connected two-dimensional cell complexes whose 0-cell are these up-to-isotopy structures on the surface. In the latter part of this paper, we show that Torelli group (or more precisely, a torsion-free subgroup of a mapping class group of a surface) acts on these complexes freely.
Read the full abstract

High Energy Physics (Experiment)

Branching fraction measurements of $\eta$ and $\eta^\prime(958)$ anomalous decays

Branching fractions of $\eta$ and $\eta'(958)$ anomalous decays are measured using $pp$ collision data at a center-of-mass energy of $\sqrt{s}=13\,\text{TeV}$ collected by the LHCb experiment and corresponding to an integrated luminosity of $5.4\,\text{fb}^{-1}$. The measured values and upper limits are \begin{align*} \cal{B}(\eta\to\mu^+\mu^-) &= (5.02\pm0.14\pm0.18\pm0.26)\times10^{-6} , \\ \cal{B}(\eta'(958)\to\mu^+\mu^-) &<1.9\times10^{-7} at 90% CL , \\ \cal{B}(\eta\to\pi^+\pi^-\mu^+\mu^-) &<5.4\times10^{-7} at 90% CL, \\ \cal{B}(\eta'(958)\to\pi^+\pi^-\mu^+\mu^-) &= (2.73\pm0.14\pm0.13\pm0.14)\times10^{-5} , \end{align*} where the uncertainties are, respectively, statistical, systematic, and due to the external branching fraction of the $\phi(1020)\to\mu^+\mu^-$ decay, which is used for normalization. This marks the first experimental search for the $\eta'(958)$ decay, and the most precise measurement of the branching fraction $\cal{B}(\eta\to\mu^+\mu^-)$ to date.
Read the full abstract

All authors LHCb collaboration: R. Aaij, A.S.W. Abdelmotteleb, C. Abellan Beteta, F. Abudinén, T. Ackernley, A.A. Adefisoye, B. Adeva, M. Adinolfi, P. Adlarson, C. Agapopoulou, C.A. Aidala, Z. Ajaltouni, S. Akar, K. Akiba, P. Albicocco, J. Albrecht, R. Aleksiejunas, F. Alessio, P. Alvarez Cartelle, R. Amalric, S. Amato, J.L. Amey, Y. Amhis, L. An, L. Anderlini, M. Andersson, P. Andreola, M. Andreotti, S. Andres Estrada, A. Anelli, D. Ao, C. Arata, F. Archilli, Z. Areg, M. Argenton, S. Arguedas Cuendis, L. Arnone, A. Artamonov, M. Artuso, E. Aslanides, R. Ataíde Da Silva, M. Atzeni, B. Audurier, J.A. Authier, D. Bacher, I. Bachiller Perea, S. Bachmann, M. Bachmayer, J.J. Back, P. Baladron Rodriguez, V. Balagura, A. Balboni, W. Baldini, Z. Baldwin, L. Balzani, H. Bao, J. Baptista de Souza Leite, C. Barbero Pretel, M. Barbetti, I.R. Barbosa, R.J. Barlow, M. Barnyakov, S. Barsuk, W. Barter, J. Bartz, S. Bashir, B. Batsukh, P.B. Battista, A. Bay, A. Beck, M. Becker, F. Bedeschi, I.B. Bediaga, N.A. Behling, S. Belin, A. Bellavista, K. Belous, I. Belov, I. Belyaev, G. Benane, G. Bencivenni, E. Ben-Haim, A. Berezhnoy, R. Bernet, S. Bernet Andres, A. Bertolin, F. Betti, J. Bex, O. Bezshyyko, S. Bhattacharya, J. Bhom, M.S. Bieker, N.V. Biesuz, A. Biolchini, M. Birch, F.C.R. Bishop, A. Bitadze, A. Bizzeti, T. Blake, F. Blanc, J.E. Blank, S. Blusk, V. Bocharnikov, J.A. Boelhauve, O. Boente Garcia, T. Boettcher, A. Bohare, A. Boldyrev, C. Bolognani, R. Bolzonella, R.B. Bonacci, N. Bondar, A. Bordelius, F. Borgato, S. Borghi, M. Borsato, J.T. Borsuk, E. Bottalico, S.A. Bouchiba, M. Bovill, T.J.V. Bowcock, A. Boyer, C. Bozzi, J.D. Brandenburg, A. Brea Rodriguez, N. Breer, J. Brodzicka, J. Brown, D. Brundu, E. Buchanan, M. Burgos Marcos, A.T. Burke, C. Burr, C. Buti, J.S. Butter, J. Buytaert, W. Byczynski, S. Cadeddu, H. Cai, Y. Cai, A. Caillet, R. Calabrese, S. Calderon Ramirez, L. Calefice, M. Calvi, M. Calvo Gomez, P. Camargo Magalhaes, J.I. Cambon Bouzas, P. Campana, A.F. Campoverde Quezada, Y. Cao, S. Capelli, M. Caporale, L. Capriotti, R. Caravaca-Mora, A. Carbone, L. Carcedo Salgado, R. Cardinale, A. Cardini, P. Carniti, L. Carus, A. Casais Vidal, R. Caspary, G. Casse, M. Cattaneo, G. Cavallero, V. Cavallini, S. Celani, I. Celestino, S. Cesare, A.J. Chadwick, I. Chahrour, H. Chang, M. Charles, Ph. Charpentier, E. Chatzianagnostou, R. Cheaib, M. Chefdeville, C. Chen, J. Chen, S. Chen, Z. Chen, A. Chen Hu, M. Cherif, A. Chernov, S. Chernyshenko, X. Chiotopoulos, V. Chobanova, M. Chrzaszcz, A. Chubykin, V. Chulikov, P. Ciambrone, X. Cid Vidal, G. Ciezarek, P. Cifra, P.E.L. Clarke, M. Clemencic, H.V. Cliff, J. Closier, C. Cocha Toapaxi, V. Coco, J. Cogan, E. Cogneras, L. Cojocariu, S. Collaviti, P. Collins, T. Colombo, M. Colonna, A. Comerma-Montells, L. Congedo, J. Connaughton, A. Contu, N. Cooke, G. Cordova, C. Coronel, I. Corredoira, A. Correia, G. Corti, J. Cottee Meldrum, B. Couturier, D.C. Craik, M. Cruz Torres, E. Curras Rivera, R. Currie, C.L. Da Silva, S. Dadabaev, X. Dai, E. Dall'Occo, J. Dalseno, C. D'Ambrosio, J. Daniel, G. Darze, A. Davidson, J.E. Davies, O. De Aguiar Francisco, C. De Angelis, F. De Benedetti, J. de Boer, K. De Bruyn, S. De Capua, M. De Cian, U. De Freitas Carneiro Da Graca, E. De Lucia, J.M. De Miranda, L. De Paula, M. De Serio, P. De Simone, F. De Vellis, J.A. de Vries, F. Debernardis, D. Decamp, S. Dekkers, L. Del Buono, B. Delaney, H.-P. Dembinski, J. Deng, V. Denysenko, O. Deschamps, F. Dettori, B. Dey, P. Di Nezza, I. Diachkov, S. Didenko, S. Ding, Y. Ding, L. Dittmann, V. Dobishuk, A.D. Docheva, A. Doheny, C. Dong, A.M. Donohoe, F. Dordei, A.C. dos Reis, A.D. Dowling, L. Dreyfus, W. Duan, P. Duda, L. Dufour, V. Duk, P. Durante, M.M. Duras, J.M. Durham, O.D. Durmus, A. Dziurda, A. Dzyuba, S. Easo, E. Eckstein, U. Egede, A. Egorychev, V. Egorychev, S. Eisenhardt, E. Ejopu, L. Eklund, M. Elashri, D. Elizondo Blanco, J. Ellbracht, S. Ely, A. Ene, J. Eschle, S. Esen, T. Evans, F. Fabiano, S. Faghih, L.N. Falcao, B. Fang, R. Fantechi, L. Fantini, M. Faria, K. Farmer, F. Fassin, D. Fazzini, L. Felkowski, C. Feng, M. Feng, A. Fernandez Casani, M. Fernandez Gomez, A.D. Fernez, F. Ferrari, F. Ferreira Rodrigues, M. Ferrillo, M. Ferro-Luzzi, S. Filippov, R.A. Fini, M. Fiorini, M. Firlej, K.L. Fischer, D.S. Fitzgerald, C. Fitzpatrick, T. Fiutowski, F. Fleuret, A. Fomin, M. Fontana, L.A. Foreman, R. Forty, D. Foulds-Holt, V. Franco Lima, M. Franco Sevilla, M. Frank, E. Franzoso, G. Frau, C. Frei, D.A. Friday, J. Fu, Q. Führing, T. Fulghesu, G. Galati, M.D. Galati, A. Gallas Torreira, D. Galli, S. Gambetta, M. Gandelman, P. Gandini, B. Ganie, H. Gao, R. Gao, T.Q. Gao, Y. Gao, Y. Gao, Y. Gao, L.M. Garcia Martin, P. Garcia Moreno, J. García Pardiñas, P. Gardner, L. Garrido, C. Gaspar, A. Gavrikov, L.L. Gerken, E. Gersabeck, M. Gersabeck, T. Gershon, S. Ghizzo, Z. Ghorbanimoghaddam, F.I. Giasemis, V. Gibson, H.K. Giemza, A.L. Gilman, M. Giovannetti, A. Gioventù, L. Girardey, M.A. Giza, F.C. Glaser, V.V. Gligorov, C. Göbel, L. Golinka-Bezshyyko, E. Golobardes, D. Golubkov, A. Golutvin, S. Gomez Fernandez, W. Gomulka, F. Goncalves Abrantes, I. Gonçales Vaz, M. Goncerz, G. Gong, J.A. Gooding, I.V. Gorelov, C. Gotti, E. Govorkova, J.P. Grabowski, L.A. Granado Cardoso, E. Graugés, E. Graverini, L. Grazette, G. Graziani, A.T. Grecu, N.A. Grieser, L. Grillo, S. Gromov, C. Gu, M. Guarise, L. Guerry, A.-K. Guseinov, E. Gushchin, Y. Guz, T. Gys, K. Habermann, T. Hadavizadeh, C. Hadjivasiliou, G. Haefeli, C. Haen, S. Haken, G. Hallett, P.M. Hamilton, J. Hammerich, Q. Han, X. Han, S. Hansmann-Menzemer, L. Hao, N. Harnew, T.J. Harris, M. Hartmann, S. Hashmi, J. He, N. Heatley, A. Hedes, F. Hemmer, C. Henderson, R. Henderson, R.D.L. Henderson, A.M. Hennequin, K. Hennessy, L. Henry, J. Herd, P. Herrero Gascon, J. Heuel, A. Heyn, A. Hicheur, G. Hijano Mendizabal, J. Horswill, R. Hou, Y. Hou, D.C. Houston, N. Howarth, W. Hu, X. Hu, W. Hulsbergen, R.J. Hunter, M. Hushchyn, D. Hutchcroft, M. Idzik, D. Ilin, P. Ilten, A. Iniukhin, A. Iohner, A. Ishteev, K. Ivshin, H. Jage, S.J. Jaimes Elles, S. Jakobsen, T. Jakoubek, E. Jans, B.K. Jashal, A. Jawahery, C. Jayaweera, V. Jevtic, Z. Jia, E. Jiang, X. Jiang, Y. Jiang, Y.J. Jiang, E. Jimenez Moya, N. Jindal, M. John, A. John Rubesh Rajan, D. Johnson, C.R. Jones, S. Joshi, B. Jost, J. Juan Castella, N. Jurik, I. Juszczak, K. Kalecinska, D. Kaminaris, S. Kandybei, M. Kane, Y. Kang, C. Kar, M. Karacson, A. Kauniskangas, J.W. Kautz, M.K. Kazanecki, F. Keizer, M. Kenzie, T. Ketel, B. Khanji, A. Kharisova, S. Kholodenko, G. Khreich, T. Kirn, V.S. Kirsebom, S. Klaver, N. Kleijne, A. Kleimenova, D. Klekots, K. Klimaszewski, M.R. Kmiec, T. Knospe, R. Kolb, S. Koliiev, L. Kolk, A. Konoplyannikov, P. Kopciewicz, P. Koppenburg, A. Korchin, M. Korolev, I. Kostiuk, O. Kot, S. Kotriakhova, E. Kowalczyk, A. Kozachuk, P. Kravchenko, L. Kravchuk, O. Kravcov, M. Kreps, P. Krokovny, W. Krupa, W. Krzemien, O. Kshyvanskyi, S. Kubis, M. Kucharczyk, V. Kudryavtsev, E. Kulikova, A. Kupsc, V. Kushnir, B. Kutsenko, J. Kvapil, I. Kyryllin, D. Lacarrere, P. Laguarta Gonzalez, A. Lai, A. Lampis, D. Lancierini, C. Landesa Gomez, J.J. Lane, G. Lanfranchi, C. Langenbruch, J. Langer, T. Latham, F. Lazzari, C. Lazzeroni, R. Le Gac, H. Lee, R. Lefèvre, A. Leflat, S. Legotin, M. Lehuraux, E. Lemos Cid, O. Leroy, T. Lesiak, E.D. Lesser, B. Leverington, A. Li, C. Li, C. Li, H. Li, J. Li, K. Li, L. Li, M. Li, P. Li, P.-R. Li, Q. Li, T. Li, T. Li, Y. Li, Y. Li, Y. Li, Z. Lian, Q. Liang, X. Liang, Z. Liang, S. Libralon, A. Lightbody, C. Lin, T. Lin, R. Lindner, H. Linton, R. Litvinov, D. Liu, F.L. Liu, G. Liu, K. Liu, S. Liu, W. Liu, Y. Liu, Y. Liu, Y.L. Liu, G. Loachamin Ordonez, I. Lobo, A. Lobo Salvia, A. Loi, T. Long, F.C.L. Lopes, J.H. Lopes, A. Lopez Huertas, C. Lopez Iribarnegaray, S. López Soliño, Q. Lu, C. Lucarelli, D. Lucchesi, M. Lucio Martinez, Y. Luo, A. Lupato, E. Luppi, K. Lynch, S. Lyu, X.-R. Lyu, G.M. Ma, H. Ma, S. Maccolini, F. Machefert, F. Maciuc, B. Mack, I. Mackay, L.M. Mackey, L.R. Madhan Mohan, M.J. Madurai, D. Magdalinski, D. Maisuzenko, J.J. Malczewski, S. Malde, L. Malentacca, A. Malinin, T. Maltsev, G. Manca, G. Mancinelli, C. Mancuso, R. Manera Escalero, F.M. Manganella, D. Manuzzi, D. Marangotto, J.F. Marchand, R. Marchevski, U. Marconi, E. Mariani, S. Mariani, C. Marin Benito, J. Marks, A.M. Marshall, L. Martel, G. Martelli, G. Martellotti, L. Martinazzoli, M. Martinelli, D. Martinez Gomez, D. Martinez Santos, F. Martinez Vidal, A. Martorell i Granollers, A. Massafferri, R. Matev, A. Mathad, V. Matiunin, C. Matteuzzi, K.R. Mattioli, A. Mauri, E. Maurice, J. Mauricio, P. Mayencourt, J. Mazorra de Cos, M. Mazurek, M. McCann, N.T. McHugh, A. McNab, R. McNulty, B. Meadows, S.E.R. Medaer, G. Meier, D. Melnychuk, D. Mendoza Granada, P. Menendez Valdes Perez, F.M. Meng, M. Merk, A. Merli, L. Meyer Garcia, D. Miao, H. Miao, M. Mikhasenko, D.A. Milanes, A. Minotti, E. Minucci, T. Miralles, B. Mitreska, D.S. Mitzel, R. Mocanu, A. Modak, L. Moeser, R.D. Moise, E.F. Molina Cardenas, T. Mombächer, M. Monk, T. Monnard, S. Monteil, A. Morcillo Gomez, G. Morello, M.J. Morello, M.P. Morgenthaler, A. Moro, J. Moron, W. Morren, A.B. Morris, A.G. Morris, R. Mountain, Z. Mu, E. Muhammad, F. Muheim, M. Mulder, K. Müller, F. Muñoz-Rojas, R. Murta, V. Mytrochenko, P. Naik, T. Nakada, R. Nandakumar, T. Nanut, G. Napoletano, I. Nasteva, M. Needham, E. Nekrasova, N. Neri, S. Neubert, N. Neufeld, P. Neustroev, J. Nicolini, D. Nicotra, E.M. Niel, N. Nikitin, L. Nisi, Q. Niu, P. Nogarolli, P. Nogga, C. Normand, J. Novoa Fernandez, G. Nowak, C. Nunez, H.N. Nur, A. Oblakowska-Mucha, V. Obraztsov, T. Oeser, A. Okhotnikov, O. Okhrimenko, R. Oldeman, F. Oliva, E. Olivart Pino, M. Olocco, R.H. O'Neil, J.S. Ordonez Soto, D. Osthues, J.M. Otalora Goicochea, P. Owen, A. Oyanguren, O. Ozcelik, F. Paciolla, A. Padee, K.O. Padeken, B. Pagare, T. Pajero, A. Palano, L. Palini, M. Palutan, C. Pan, X. Pan, S. Panebianco, S. Paniskaki, G. Panshin, L. Paolucci, A. Papanestis, M. Pappagallo, L.L. Pappalardo, C. Pappenheimer, C. Parkes, D. Parmar, G. Passaleva, D. Passaro, A. Pastore, M. Patel, J. Patoc, C. Patrignani, A. Paul, C.J. Pawley, A. Pellegrino, J. Peng, X. Peng, M. Pepe Altarelli, S. Perazzini, D. Pereima, H. Pereira Da Costa, M. Pereira Martinez, A. Pereiro Castro, C. Perez, P. Perret, A. Perrevoort, A. Perro, M.J. Peters, K. Petridis, A. Petrolini, S. Pezzulo, J.P. Pfaller, H. Pham, L. Pica, M. Piccini, L. Piccolo, B. Pietrzyk, G. Pietrzyk, R.N. Pilato, D. Pinci, F. Pisani, M. Pizzichemi, V.M. Placinta, M. Plo Casasus, T. Poeschl, F. Polci, M. Poli Lener, A. Poluektov, N. Polukhina, I. Polyakov, E. Polycarpo, S. Ponce, D. Popov, K. Popp, S. Poslavskii, K. Prasanth, C. Prouve, D. Provenzano, V. Pugatch, A. Puicercus Gomez, G. Punzi, J.R. Pybus, Q. Qian, W. Qian, N. Qin, R. Quagliani, R.I. Rabadan Trejo, R. Racz, J.H. Rademacker, M. Rama, M. Ramírez García, V. Ramos De Oliveira, M. Ramos Pernas, M.S. Rangel, F. Ratnikov, G. Raven, M. Rebollo De Miguel, F. Redi, J. Reich, F. Reiss, Z. Ren, P.K. Resmi, M. Ribalda Galvez, R. Ribatti, G. Ricart, D. Riccardi, S. Ricciardi, K. Richardson, M. Richardson-Slipper, F. Riehn, K. Rinnert, P. Robbe, G. Robertson, E. Rodrigues, A. Rodriguez Alvarez, E. Rodriguez Fernandez, J.A. Rodriguez Lopez, E. Rodriguez Rodriguez, J. Roensch, A. Rogachev, A. Rogovskiy, D.L. Rolf, P. Roloff, V. Romanovskiy, A. Romero Vidal, G. Romolini, F. Ronchetti, T. Rong, M. Rotondo, S.R. Roy, M.S. Rudolph, M. Ruiz Diaz, R.A. Ruiz Fernandez, J. Ruiz Vidal, J.J. Saavedra-Arias, J.J. Saborido Silva, N. Sagidova, D. Sahoo, N. Sahoo, B. Saitta, M. Salomoni, I. Sanderswood, R. Santacesaria, C. Santamarina Rios, M. Santimaria, L. Santoro, E. Santovetti, A. Saputi, D. Saranin, A. Sarnatskiy, G. Sarpis, M. Sarpis, C. Satriano, A. Satta, M. Saur, D. Savrina, H. Sazak, F. Sborzacchi, A. Scarabotto, S. Schael, S. Scherl, M. Schiller, H. Schindler, M. Schmelling, B. Schmidt, N. Schmidt, S. Schmitt, H. Schmitz, O. Schneider, A. Schopper, N. Schulte, M.H. Schune, G. Schwering, B. Sciascia, A. Sciuccati, G. Scriven, I. Segal, S. Sellam, A. Semennikov, T. Senger, M. Senghi Soares, A. Sergi, N. Serra, L. Sestini, A. Seuthe, B. Sevilla Sanjuan, Y. Shang, D.M. Shangase, M. Shapkin, R.S. Sharma, I. Shchemerov, L. Shchutska, T. Shears, L. Shekhtman, J. Shen, Z. Shen, S. Sheng, V. Shevchenko, B. Shi, Q. Shi, W.S. Shi, Y. Shimizu, E. Shmanin, R. Shorkin, J.D. Shupperd, R. Silva Coutinho, G. Simi, S. Simone, M. Singha, N. Skidmore, T. Skwarnicki, M.W. Slater, E. Smith, K. Smith, M. Smith, L. Soares Lavra, M.D. Sokoloff, F.J.P. Soler, A. Solomin, A. Solovev, K. Solovieva, N.S. Sommerfeld, R. Song, Y. Song, Y. Song, Y.S. Song, F.L. Souza De Almeida, B. Souza De Paula, K.M. Sowa, E. Spadaro Norella, E. Spedicato, J.G. Speer, P. Spradlin, F. Stagni, M. Stahl, S. Stahl, S. Stanislaus, M. Stefaniak, E.N. Stein, O. Steinkamp, D. Strekalina, Y. Su, F. Suljik, J. Sun, J. Sun, L. Sun, D. Sundfeld, W. Sutcliffe, P. Svihra, V. Svintozelskyi, K. Swientek, F. Swystun, A. Szabelski, T. Szumlak, Y. Tan, Y. Tang, Y.T. Tang, M.D. Tat, J.A. Teijeiro Jimenez, A. Terentev, F. Terzuoli, F. Teubert, E. Thomas, D.J.D. Thompson, A.R. Thomson-Strong, H. Tilquin, V. Tisserand, S. T'Jampens, M. Tobin, T.T. Todorov, L. Tomassetti, G. Tonani, X. Tong, T. Tork, D. Torres Machado, L. Toscano, D.Y. Tou, C. Trippl, G. Tuci, N. Tuning, L.H. Uecker, A. Ukleja, D.J. Unverzagt, A. Upadhyay, B. Urbach, A. Usachov, A. Ustyuzhanin, U. Uwer, V. Vagnoni, A. Vaitkevicius, V. Valcarce Cadenas, G. Valenti, N. Valls Canudas, J. van Eldik, H. Van Hecke, E. van Herwijnen, C.B. Van Hulse, R. Van Laak, M. van Veghel, G. Vasquez, R. Vazquez Gomez, P. Vazquez Regueiro, C. Vázquez Sierra, S. Vecchi, J. Velilla Serna, J.J. Velthuis, M. Veltri, A. Venkateswaran, M. Verdoglia, M. Vesterinen, W. Vetens, D. Vico Benet, P. Vidrier Villalba, M. Vieites Diaz, X. Vilasis-Cardona, E. Vilella Figueras, A. Villa, P. Vincent, B. Vivacqua, F.C. Volle, D. vom Bruch, N. Voropaev, K. Vos, C. Vrahas, J. Wagner, J. Walsh, E.J. Walton, G. Wan, A. Wang, B. Wang, C. Wang, G. Wang, H. Wang, J. Wang, J. Wang, J. Wang, J. Wang, M. Wang, N.W. Wang, R. Wang, X. Wang, X. Wang, X.W. Wang, Y. Wang, Y. Wang, Y.H. Wang, Z. Wang, Z. Wang, J.A. Ward, M. Waterlaat, N.K. Watson, D. Websdale, Y. Wei, Z. Weida, J. Wendel, B.D.C. Westhenry, C. White, M. Whitehead, E. Whiter, A.R. Wiederhold, D. Wiedner, M.A. Wiegertjes, C. Wild, G. Wilkinson, M.K. Wilkinson, M. Williams, M.J. Williams, M.R.J. Williams, R. Williams, S. Williams, Z. Williams, F.F. Wilson, M. Winn, W. Wislicki, M. Witek, L. Witola, T. Wolf, E. Wood, G. Wormser, S.A. Wotton, H. Wu, J. Wu, X. Wu, Y. Wu, Z. Wu, K. Wyllie, S. Xian, Z. Xiang, Y. Xie, T.X. Xing, A. Xu, L. Xu, M. Xu, Z. Xu, Z. Xu, Z. Xu, S. Yadav, K. Yang, X. Yang, Y. Yang, Y. Yang, Z. Yang, V. Yeroshenko, H. Yeung, H. Yin, X. Yin, C.Y. Yu, J. Yu, X. Yuan, Y Yuan, J.A. Zamora Saa, M. Zavertyaev, M. Zdybal, F. Zenesini, C. Zeng, M. Zeng, C. Zhang, D. Zhang, J. Zhang, L. Zhang, R. Zhang, S. Zhang, S.L. Zhang, Y. Zhang, Y.Z. Zhang, Z. Zhang, Y. Zhao, A. Zhelezov, S.Z. Zheng, X.Z. Zheng, Y. Zheng, T. Zhou, X. Zhou, Y. Zhou, V. Zhovkovska, L.Z. Zhu, X. Zhu, X. Zhu, Y. Zhu, V. Zhukov, J. Zhuo, Q. Zou, D. Zuliani, G. Zunica

2609.02973 · 2 Sep · All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lhcb-glance.cern.ch/alcm/public/analysis/full-details/4077/ (LHCb public pages)

High Energy Physics (Phenomenology)

Resolving Local Structure of Distribution Functions in Collider Measurements

Collider measurements may blur narrow features in underlying distributions before fitting, since a data point samples a finite region. We show that observables linear in a selected target distribution, after externally constrained inputs are absorbed into a nonnegative finite response, have a calculable distribution-space locality set by hard dynamics and kinematics. The baseline-normalized $F_{\rm dir}(X)$ yields the local value at zero width and a controlled average otherwise, with covariance setting the leading bias. This guides the choice of processes and observables that retain unexpected fine structure. An EIC photon-radiation observable realizes the exact zero-width limit.
Read the full abstract

Cryptography and Security

Privacy Leakage in Federated Learning: Gradient-Based Client Identity Inference and Defenses for Inertial Sensing in Vehicular Edge Networks

As vehicular networks move toward 5G/6G edge intelligence, federated learning (FL) is widely promoted as a privacy-preserving way for vehicles and infrastructure to train shared models without exposing raw sensor data. Yet the updates clients transmit still leak enough information to identify who sent them, which threatens the anonymity that safety-critical V2X applications assume and adds to existing concerns over adversarial ML, model poisoning, and backdoor attacks. We study server-side client identity inference from transmitted weight deltas using inertial (IMU) measurements, evaluated on the UCI Human Activity Recognition (HAR) benchmark as an accessible proxy for the IMU streams produced onboard connected vehicles. Across five attack classifiers and five non-IID partitions, an honest-but-curious server recovers client identity with near-perfect accuracy (approximately 1.000) from undefended updates, confirming a concrete identifiability risk. We then quantify the privacy-utility trade-off of a lightweight clip-then-noise defense by sweeping Gaussian noise (sigma in {0.00, 0.05, 0.10, 0.20, 0.50, 1.00}) at fixed clipping (C=1.0), and report formal (epsilon, delta)-DP budgets through Renyi accounting. A practical region (sigma in [0.1, 0.2]) drives attack accuracy to near-random while costing under 5% relative FL accuracy. Ensemble FL supplies complementary structural privacy with a 1/K anonymity-set bound and no noise penalty. Results are supported by cryptographic (SHA-256) train/evaluation gradient disjointness, three seeds, and a count-normalized attacker-advantage metric. We position HAR explicitly as a proxy and discuss what validation on true vehicular telemetry would require.
Read the full abstract

All authors Ali Akarma, Toqeer Ali Syed, Muhammad Khan, Qurat-ul-ain Mastoi, Adeel Ahmad

High Energy Physics (Phenomenology)

Finite-duration non-slow-roll effects in inflationary production of ultralight vector dark matter

Inflationary production of ultralight vector dark matter can be amplified by a brief non-slow-roll phase, yet instantaneous mass transitions generate ultraviolet ringing and leave finite-time predictions unresolved. We replace the sharp transition with a smooth profile and derive the momentum-response kernel of the longitudinal mode. Finite duration preserves the infrared enhancement, suppresses modes that resolve the transition, and introduces a profile-dependent correction to the relic abundance. After fixing the dark matter abundance, the induced gravitational-wave signal retains an independent transverse-traceless source dependence, so abundance rescaling alone leaves residual profile information. Numerical mode evolution and radiation-era tensor integration support the finite-width treatment. Transition duration therefore links microscopic inflationary dynamics to ultralight vector abundance and its low-frequency gravitational-wave signal.
Read the full abstract

All authors Imtiaz Khan, Niamat Ullah, Chengxun Yuan, G. Mustafa, Farruh Atamurotov, Ahmadjon Abdujabbarov

Image and Video Processing

Learning from Scarce Labels: Multi-View Echocardiography for Ejection Fraction Prediction

We present, to the best of our knowledge, the first publicly available resource for predicting left ventricular ejection fraction (EF) from parasternal long-axis (PLAX) echocardiography. Because no PLAX-EF datasets previously existed, our work focuses on an innovative data generation strategy to overcome this scarcity. By leveraging a time-based correlation between clinical notes and echocardiographic videos, combined with fine-tuning view classifiers and proxy labeling, we created a labeled dataset of over 25,000 PLAX videos. This enables us to train the first reproducible PLAX EF model, achieving a mean absolute error (MAE) of 6.86%. Given that apical four-chamber (A4C) methods, the clinical standard, report MAE values of 6%-7%, our results demonstrate that EF estimation from PLAX views is both feasible and clinically relevant. This surpasses the performance of existing methods and provides a clinically relevant solution for situations where apical views may not be feasible. Going further, we demonstrate that combining PLAX and A4C predictions via simple unweighted late fusion improves both single-view baselines to a 6.37% MAE, underscoring the value of multi-view integration. To promote continued research, we release the dataset labels, trained models, and runnable demos on GitHub, Hugging Face, and Google Colab: https://github.com/Jeffrey4899/PLAX_EF_Labels_202509
Read the full abstract

Materials Science

Battery open-circuit voltage is not purely chemical

Open-circuit-voltage (OCV) curves are commonly treated as intrinsic chemical properties of electrode materials. However, this view is incomplete. In ion-insertion batteries, OCV also depends on mechanical state and microstructure. Using finite-element simulations and asymptotic analysis, we show that particle swelling and external loads promote particle–particle contact that generates compressive stresses, shifting the inserted-ion chemical potential. The OCV correction is nonlinear, follows Hertzian contact scaling, and depends on particle arrangement. Identical materials can therefore exhibit different OCV curves in different electrode microstructures. Furthermore, in full cells, electrodes are mechanically coupled through the common stack stress. Thus, cell OCV is a chemo-mechanical property of the entire battery architecture, not chemistry alone.
Read the full abstract

All authors Andrea Giudici, Christoph Pohl, Alberto Salvadori, Colin Please, Manuel Landstorfer, Jon Chapman

Cryptography and Security

Privacy-Preserving Topology-Guided Safety for LLM-Based Multi-Agent Systems via Federated Graph Learning

Topology-guided safeguards for LLM-based multi-agent systems (MAS) train a GNN over the inter-agent communication graph to localize risky agents and intervene on the topology—but they assume one operator can pool all labeled traces. Across organizations that assumption breaks: episodes contain private prompts, tool outputs, and proprietary workflows, and no silo alone sees the full attack distribution. We cast privacy-preserving MAS safeguarding as graph federated learning and instantiate FGLGuard: each operator fits an edge-featured graph attention detector on its own judge-labeled episode graphs and shares only model updates. The method couples a proximal local objective for non-IID clients, domain-balanced aggregation, over-refusal-constrained threshold calibration, corroborated upstream scoring, and a guarded rewrite for blocked answers. Federation is not optional: off-the-shelf transfer collapses under distribution shift (AUROC 0.51 to 0.70 only after in-domain retraining), so a deployable guard must adapt on each site's private traces. On Agent-SafetyBench, R-Judge, and AgentDojo, federated FGLGuard exceeds the in-domain centralized ceiling on all three benchmarks without pooling any data—where unsupervised anomaly guards and local-only training fail. One guard federated across four different-domain operators comes within 0.03 AUROC of multi-domain centralization, while any single-domain guard collapses on the others. Live FGLGuard cuts AgentDojo's ground-truth attack-success rate by 43% at near-unguarded utility, zero API cost, and negligible capability loss.
Read the full abstract

All authors Jinxi Yu, Eric Hanchen Jiang, Levina Li, Dong Liu, Zhi Zhang, Wenxiao Zhao, Yanxuan Yu, Kai-Wei Chang, Ying Nian Wu

Materials Science

Physics-Informed Neural Network Surrogate for Oxygen Vacancy Dynamics in epitaxial $\mathrm{SrTiO_3}$ on Si memristors via Dynamic Spectral Optimization

Physics-informed neural networks (PINNs) offer a promising framework for modeling semiconductor devices, yet standard architectures struggle with severe numerical stiffness and multiscale spatial discrepancies inherent to oxide heterostructures. Here, we demonstrate a cascaded PINN architecture coupled with a custom second-order Chebyshev second kind polynomial spectral optimizer (DSO V2 Hybrid) to model ion-electronic drift-diffusion transport in Pt/SrTiO$_3$/Si memristive heterostructures across a 20 nm STO film on a 380 $\mu$m Si substrate. By isolating potential, carrier density, and vacancy transport into four sequentially trained sub-neural-networks, our model circumvents condition numbers exceeding $10^{16}$ without operator splitting. The trained surrogate reproduces experimental conductive-AFM current-voltage hysteresis ($R^2 > 0.96$) while ensuring strict Poisson consistency across continuous space. Compared to conventional finite-element solvers (e.g., COMSOL), the PINN surrogate enables differentiable inverse parameter estimation and linear time inference.
Read the full abstract

Social and Information Networks

Statistical Feature Augmentation for Anomaly Detection in Dynamic Graphs

Dynamic networks are being applied in many domains, from social media to logistics systems, each with their own set of special characteristics. A model employed on this type of data must capture the duality between temporal/structural and feature-based information. Yet state-of-the-art deep learning models often struggle to learn especially short-term behavioral interaction signals, such as sender intensity or interaction inertia, directly from raw event streams. To address this gap, we propose a statistical feature augmentation method that explicitly encodes behavioral interaction statistics into the input feature space. We evaluate our proposed method on an anomaly detection task across three real-world datasets (Reddit, Wikipedia, MOOC) and seven models spanning both continuous-time and discrete-time architectures. As a baseline, we apply the same models trained on the original embeddings. Our results show, that augmentation consistently improves detection performance. Beyond performance, the enriched input enables fine-grained post-hoc analysis of behavioral importance, since each statistic occupies a dedicated input dimension. In particular, this work showcases a promising approach for merging classical network analysis with deep learning.
Read the full abstract

Cryptography and Security

When Optimization Becomes Manipulation: Defending Generative Search against Malicious Generative Engine Optimization

This paper focuses on defending generative search engines against malicious Generative Engine Optimization (GEO), which rewrites web documents to match engines' citation preferences and thereby manipulates generated answers. Recent GEO methods have advanced from hand-crafted rewriting to automated and agentic optimization, substantially increasing the visibility of target documents in generated answers. However, defending against such manipulation poses two major challenges: attack documents remain factually consistent with their originals, rendering fact verification and perplexity filtering ineffective, and the features they amplify equally characterize high-quality benign content. To address these limitations, we propose GEO Defender, a two-stage defense aligned with the attack chain that requires no fine-tuning of the target LLM. GEO Defender consists of Shield Reranker and Training-Free Shield Generation (TFSG). Specifically, Shield Reranker learns a preference-based defensive residual over a frozen base reranker, demoting GEO-rewritten documents while preserving relevance judgments, and TFSG distills defense outcomes into a natural-language experience library that guides the target LLM's source use at inference. Experiments on two state-of-the-art closed-source LLMs and three open-source LLMs across seven GEO attacks demonstrate that GEO Defender reduces the average attack success rate from 50.32% to 6.20%, retains 94.12% of benign-evidence use, preserves answer quality, and generalizes to unseen attacks from construction instances.
Read the full abstract

All authors Haozhang Li, Yangguang Shao, Xinjie Lin, Zhong Guan, Mi Zhou, Junzheng Shi

Quantitative Methods

SurfSpec: Enhancing Off-Target-Agnostic Specificity by Bounding Pocket-Ligand Geometric Mismatch

Lead optimization in structure-based drug design aims to improve target binding while avoiding unintended interactions with off-target pockets. However, existing affinity-driven methods do not explicitly control specificity, whereas current specificity-aware approaches commonly require prior knowledge of off-target structures. We address off-target-agnostic specificity-aware lead optimization by analyzing the geometric mismatch between a ligand and the target pocket. We provide a conservative specificity lower bound for geometrically separated off-targets without requiring access to off-target structures. By metricizing pocket–ligand mismatch, the triangle inequality shows that reducing target–ligand mismatch improves a conservative lower bound on mismatch to a separated off-target class, which can be translated into a specificity lower bound through an empirical geometry–affinity calibration. Motivated by this analysis, we introduce SurfSpec, an off-target-agnostic lead optimization framework that iteratively grows ligands toward under-occupied regions of the target pocket surface. SurfSpec alternates between linker generation toward selected target-surface patches, which provides geometric pseudo-labels, and refinement under a pocket-conditioned ligand prior, which restores these pseudo-labels into valid ligands. On the CrossDocked2020 test set, SurfSpec reduces geometric mismatch and outperforms evaluated off-target-agnostic lead optimization baselines in empirical specificity, while maintaining competitive target-affinity improvement.
Read the full abstract

All authors Minyeong Hwang, Yoorim Gang, Ziseok Lee, Wooyeol Lee, Young Bin Park, Jae-Mun Choi, Kyungsu Kim, Eunho Yang

Representation Theory

Monoidal Categorification and Quantization of Braid Varieties

Let \(G\) be a simple and simply connected algebraic group of simply-laced type. For each positive braid word \(\beta\), and for the complete strong duality datum attached to a \(Q\)-datum, we construct an explicit based monoidal categorification of the quantum cluster algebra of the braid variety \(X(\beta)\). We identify this algebra with both a localized quantum Grothendieck ring and a localized level-\(\geq1\) subalgebra of the bosonic extension algebra. Under these identifications, quantum cluster monomials correspond simultaneously to real simple modules and normalized global basis elements. We construct the specialization homomorphism at \(q^{1/2}=1\) and prove that it recovers \(\CC[X(\beta)]\); in particular, the resulting integral form is a flat quantum deformation. We also give intrinsic Lusztig parameters for cluster variables attached to double strings, identify the corresponding quantum grid minors, and establish generalized quantum \(T\)-systems.
Read the full abstract

Populations and Evolution

Architecture-dependent Effects of Trade-offs on Evolutionary Navigability and Epistasis

The structure of the genotype-phenotype map plays a central role in determining how populations move through fitness landscapes, yet less is known about how this structure interacts with environmental constraints and fitness trade-offs. Here, we study evolution on a tunable multilayer genotype-phenotype map in which binary genotypes are transformed through successive feed-forward layers before being evaluated by phenotype-level fitness functions. We explicitly model the phenotype to fitness transformation in order to compare an emergent trade-off fitness with a no-trade-off control. We explore different map architecture as models of more and less complex genotype-phenotype relationships by tuning the genotype length and number of layers. We find that ruggedness and navigability have a complex, architecture-dependent relationship. Landscapes with few local maxima can still have low navigability for wide and shallow maps, and navigability is high even at mean values of ruggedness for wide and deep maps. Trade-offs increase navigability in wide and shallow maps, while their effect is muted in other architectures. The effect of trade-offs on epistasis depends on evolutionary history. While trade-offs change which mutational neighborhoods are sampled by evolution, the background degree of epistatic interactions is set by map architecture. Finally, we use our framework to investigate micro-evolution of high-fitness populations and show that temporal covariance in allele-frequency changes can arise from the internal structure of a rugged genotype-phenotype map, producing signatures that resemble short-term alternating selection.
Read the full abstract

Statistical Mechanics

Constituent-Tagged Transfer Linking Cluster Dynamics to Static Scaling

Clusters that merge and split have no unique genealogy. Tracking the host size of a conserved constituent defines $q_*$ by $\langle(S_{t+\tau}/S_t)^{q_*}\rangle=1$, with $q_*\ne0$. Across coupled map networks, coagulation-fragmentation dynamics, and Vicsek systems, $q_*\simeq\alpha-2$ without fitting, where $c(s)\propto s^{-\alpha}$ on the same size window. Radius scans locate the known Vicsek interaction radius and recover an independently specified clustering scale in experimental active rods. Local scale covariance yields the relation, while a tent map counterexample shows when reducing the stationary balance at each parent size to one moment fails.
Read the full abstract

Machine Learning

The Direction of Ignorance: LLMs Encode and Temper a Unigram Prior

What does a language model predict when it has few clues?The answer lies in its unembedding geometry: a single direction of the unembedding matrix encodes the unigram distribution of the training corpus, which serves as the Bayesian prior the model falls back on when uncertain. This structure, termed the direction of ignorance, appears across all model families examined (Llama, Qwen, Gemma, and Pythia), ranging from 0.4B to 405B parameters. Projecting the final prediction state onto this direction yields a per-token prior loading factor $\lambda$, which declines steadily as the context becomes more informative. Formally, the same projection decomposes the prediction state into two orthogonal vectors interpretable as the two components of a tempered Bayesian update: a unigram prior raised to the exponent $\lambda$ and a context-driven likelihood. This geometric probabilistic connection makes $\lambda$ meaningfully comparable across model sizes and families. Larger models generally exhibit lower prior reliance, and reasoning models exhibit lower reliance than their base counterparts. Finally, we show that $\lambda$ serves as a causal, inference-time control: reducing it can promote context-driven continuations and improve Llama-3.2-3B-Instruct on GSM8K, whereas amplifying it or applying matched perturbations along random directions degrades performance.
Read the full abstract

All authors Toni J.B. Liu, Jiajun Bao, Gurbir Arora, Mitchell Ostrow, Yizhou Liu, Raphaël Sarfati, Nicolas Boullé, Christopher J. Earls

Cryptography and Security

PrivateHub: Contrastive Diffusion Model for Private Sensor-Intensive Environment Data Generation

Sensor-intensive environments enable many intelligent services by inferring user applications from heterogeneous data streams. However, not all applications should be exposed: users want some activities to stay private. This creates a tension between inferring applications for useful services and preventing unwanted inference. Existing approaches such as differential privacy and rule-based filtering protect individual streams but cannot address the privacy risk from cross-sensor inference. We introduce Privatehub, which uses contrastive learning within a diffusion model to generate synthetic multi-sensor streams that keep non-private applications detectable while concealing private ones. Privatehub has two stages: App-Conditioned Pre-training (ACP), which conditions the model on multi-sensor data with application embeddings, and App-Aware Fine-tuning (AAF), which separates private from non-private data via contrastive learning. We also define a threat model for the multi-sensor sharing setting. Experiments on three real-world multi-sensor datasets show Privatehub lowers private-application accuracy by 40 to 50% without hurting non-private performance, and stays robust when the attacker retrains on the synthetic data.
Read the full abstract

All authors Jiechao Gao, Yuandong Pan, Jie Wang, Michael Lepech, Bradford Campbell

Statistical Mechanics

Decoherence-controlled collective criticality in a two-dimensional quantum Stag Hunt

Physical decoherence can preserve the microscopic strategic neutrality (i.e. zero effective field and equal potential of the two homogeneous strategic orientations) of a quantum game while changing the thermodynamic regime of the corresponding interacting population. We demonstrate this for an Eisert–Wilkens–Lewenstein (EWL) Stag Hunt embedded as independent nearest neighbor encounters on a square lattice. For the restricted strategies $\mathsf{Q}=i\mathbb{Z}$ and $\mathsf{D}=i\mathbb{Y}$, noisy two-player payoff matrices are determined for phase damping, depolarization, and amplitude damping and mapped exactly to channel dependent Ising parameters $\mathfrak{J}(\Gamma,p)$ and $\mathfrak{H}(\Gamma,p)$. Phase damping and depolarization show the clearest contrast: they share the same microscopic neutrality branch $\mathfrak{H}=0$, while only depolarization suppresses the interaction as $(1-p)^2$. At $\beta=1$, this produces an exact depolarization-driven square-lattice critical point at $p_{*}\approx 0.233460\ldots$, whereas phase damping remains in the ordered coexistence regime along the same neutrality branch. Monte Carlo finite size scaling is consistent with two-dimensional Ising criticality and distinguishes field driven coexistence below $p_{*}$ from a smooth crossover above it. Amplitude damping additionally reveals a strong dependence on channel placement: the post-strategy neutrality branch reaches $\Gamma=0$ at $p=1/3$ and then disappears. Resource negativity further shows that microscopic two-qubit entanglement and collective interaction strength are distinct quantities. The resulting extended lattice remains an ordinary classical Ising system.
Read the full abstract

Numerical Analysis

Buckling Prediction for Nonlinear Elastic Beams with Soft Inclusions

We develop an efficient and accurate multiscale computational framework for predicting the buckling and post-buckling behaviour of elastic beams containing periodically distributed soft inclusions. The framework extends our previous multiscale, patch, computational homogenisation for linear elasticity by incorporating nonlinearity, and thus enables accurate prediction of both the buckling onset and the subsequent post-buckling response. Microscale computations are performed only within a sparse set of small subdomains (patches), while the macroscale behaviour is recovered through a proven patch-coupling algorithm. The scheme is assessed through quarter- and half-domain patch computations for beams with inclusion-to-matrix Young's modulus ratios ranging from 0.001 to 1. The results show that reducing the inclusion stiffness lowers both the critical buckling strain and the critical buckling stress, indicating an increased susceptibility to instability, while producing a milder post-buckling response with smaller transverse deflections and stress drops. Eigenvalue analysis of the Jacobian matrix accurately predicts the onset of instability and the corresponding critical strain and stress. Bifurcation diagrams of the nonlinear buckled configurations under compressive loading, and a quantitative analysis of the effect of the interpolation order on the predicted buckling and post-buckling responses, are also presented. Comparisons with full-domain simulations demonstrate that the proposed framework accurately predicts both the buckling threshold and the post-buckling behaviour while substantially reducing the computational cost. The methodology is readily extendable to heterogeneous beams, plates, shells, and other engineering structures.
Read the full abstract

Information Theory

Direct Satellite-to-Device Communications: From Cooperative Task Offloading to Non-Cooperative Access Monitoring

Direct satellite-to-device (DS2D) communication is emerging as a transformative paradigm for extending ubiquitous connectivity and edge computing capabilities to remote and underserved regions within 6G non-terrestrial networks. However, practical deployment faces dual critical challenges: i) dynamic satellite channel conditions (e.g., severe Doppler shifts, fast fading) and constrained satellite computing resources in cooperative scenarios; and ii) unauthorized satellite access introduces significant spectrum security threats in non-cooperative scenarios. To address these challenges, we propose a versatile DS2D system that supports cooperative task offloading and non-cooperative access monitoring. For cooperative DS2D communications, we integrate a channel estimation module with a dueling double deep Q-network (D3QN) to dynamically optimize task offloading strategy. For non-cooperative DS2D communications, we propose Transformer-based models to enable blind signal detection and automatic modulation classification (AMC). Simulation results show that: 1) The D3QN algorithm reduces average latency by up to 225% compared to static association policies. 2) Our signal detection model achieves an average presence detection probability of 90.5% for DS2D signals. 3) The proposed AMC algorithm achieves superior performance across different signal-to-noise ratios (SNRs), with a 9.4% accuracy gain in low-SNR regimes compared to existing methods.
Read the full abstract

All authors Sai Huang, Wanli Ni, Ke Lv, Pengcheng Zhang, Yurui Zheng, Menghan Zhang, Zihui Gong, Zhiyong Feng

Computation and Language

LexIssue: Benchmarking Legal Issue Identification in Chinese Civil Litigation

Identifying the issues disputed between litigating parties is a crucial component of real-world litigation. However, legal issues remain comparatively underexplored in legal AI research. In this work, we study the computational modelling of legal issue identification in litigation. We introduce a legally grounded hierarchical schema that represents legal issues through both free-form issue descriptions and structured legal categories, and formulate legal issue identification as two complementary tasks: legal issue generation and legal issue classification. Based on this formulation, we construct LexIssue, a benchmark containing 430 real-world Chinese civil litigation cases and 1,303 expert-annotated disputed legal issues. We further develop an issue-centric legal knowledge base spanning 27 causes of action and 441 candidate legal issue entries to support retrieval-augmented reasoning. Experimental results across a diverse set of models show that retrieval-augmented generation using the constructed legal issue knowledge base consistently improves performance in identifying disputed legal issues and their corresponding legal attributes.
Read the full abstract

All authors Huiyuan Xie, Yuqin Huang, Zhicheng Hao, Yida Cai, Shaochun Wang, Zhenghao Liu, Yuxiao Ye

Combinatorics

Alon's Question on Connectivity Graph-Codes: $f(d)=2^d$ for Every $d\geq 4$

For a finite graph $H$, a connectivity graph-code is a family $\mathcal C\subseteq 2^{E(H)}$ such that $A\triangle B$ is a connected spanning subgraph of $H$ whenever $A$ and $B$ are distinct members of $\mathcal C$. Let $m(H)$ denote the maximum size of such a family, and let $f(d)$ be the largest integer $q$ for which $m(H)=q$ for infinitely many pairwise nonisomorphic $d$-regular graphs $H$. Restricting codewords to the edges incident with a vertex gives $f(d)\leq 2^d$. Alon proved equality for all sufficiently large $d$ and asked whether it holds for every $d\geq 4$. We answer this question affirmatively. More precisely, for every $d\geq 4$ we construct infinitely many finite simple $d$-regular bipartite graphs carrying a linear connectivity graph-code of dimension $d$. The construction begins with a vector-labelled copy of $K_{d,d}$. For $d\geq 7$, the required labelling follows from a probabilistic count over an irreducible conjugacy class in $\mathrm{GL}_d(2)$; explicit matrices, verified by a short exact exhaustive program, cover $d=4,5,6$. Cyclic voltage lifts then produce the required infinite families.
Read the full abstract