Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Monday 14 September

Computational Physics

Outram Park Part II: Agentic Verification, Validation and Documentation as a Human Review Gate for Nuclear Data and Neutronics Software

NJOY21 is part of a modernisation effort for NJOY2016, but mostly consists of C++ wrappers. Agentic coding represents a unique opporunity for NJOY modernisation in Rust, but agents require human expert supervision, which may be in short supply. Moreover, expert human review is the bottleneck in agentic software development as human resources are limited in this context. This work describes a methodology for how a human manager of AI agents can reasonably translate and refactor scientific software with limited domain expertise using principles borrowed from nuclear quality assurance documents. Moreover, it presents a methodology for when to allocate limited human resources for reviewing the agentically generated code. This methodology centres on agentic V&V and documentation, and it is demonstrated via construction of Monte Carlo web demos for the Rust fork of NJOY an Outram Monte Carlo (OutramMC), Rust ports of NJOY2016 and OpenMC, in Outram Park. In this work, an integrated pipeline for the Rust port of NJOY and OutramMC was demonstrated in web demos, and code to code verification and validation was performed with ICSBEP benchmarks for Godiva, HST009 and LCT008. ACE files produced with Outram Park's NJOY port were identical for more than 30 ACE files. These web demos also served as part of agentic documentation, which prepared the codebase for human review.
Read the full abstract

Optimization and Control

Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities

We analyze a stochastic algorithm with Halpern-type anchoring for constrained convex-concave problems and monotone variational inequalities. This single-loop and single-call algorithm uses one unbiased sample of the gradient operator at every iteration, to be applicable to monotone games with noisy feedback. With $t$ denoting the iteration counter, we prove an anytime last-iterate convergence rate of $O(t^{-1/4})$ for both the gradient-mapping norm and restricted gap, bypassing the $O(t^{-1/5})$ constrained-anytime bottleneck in the literature. Specializing then to multi-point oracles, we use variance reduction to achieve the $O(t^{-1/2})$ rate with an anytime single-loop algorithm using $2$ samples per iteration. Our results allow constrained problems with a potentially unbounded feasible set; as well as a structured class of stochastic oracles whose variance need not be uniformly bounded.
Read the full abstract

Signal Processing

Thinking in Tokens, Talking in Bits: A Practical Interface for Token Communication

Advanced artificial intelligence models think in tokens; contemporary communication systems carry bits. The direct way to bridge this gap is to transmit tokens, but that makes a model-specific representation part of the air interface, coupling the endpoints through a shared tokenizer, codebook, and often a neural transceiver. We take a different route: keep bits in the payload and let tokens control how those bits are generated and protected. The resulting token-bit interface transition aligns task-side tokens with source- and channel-coding units, translates token relevance into codec controls, and preserves the induced priority order across the coding chain. We instantiate it for image classification, where a vision transformer scores the task relevance of each image region from its attention maps: those scores steer block-wise JPEG rate allocation, then group the compressed bits for protection at different polar-code rates. The payload remains an explicit, reconstructable bitstream recovered by a correspondingly configured decoder. Over-the-air experiments on a software-defined radio testbed show improved accuracy–latency tradeoffs over separate source-channel coding, performance competitive with far more memory-intensive neural joint source-channel coding, and graceful degradation under channel mismatch. Token communication, then, need not transmit tokens explicitly; what it needs is an interface through which tokens determine how bits are communicated.
Read the full abstract

All authors Chanho Park, Bumsu Park, Soonhee Kwon, Sangrim Lee, Namyoon Lee

Machine Learning

BioDCASE: Active Learning for Bioacoustics

Ecological monitoring increasingly relies on machine learning models, whose performance depends on the quality and quantity of labelled data. However, obtaining these labels is costly, particularly in passive acoustic monitoring, where vast amounts of data are collected but only a small proportion can feasibly be annotated. Active learning addresses this bottleneck by prioritizing which samples should be labelled. However, progress is difficult to measure, because published methods are evaluated under different models, budgets, evaluation metrics and datasets. To address this challenge, we present the 2026 Active Learning for Bioacoustics BioDCASE challenge: a systematic evaluation of sampling methods designed to identify effective AL strategies. Participant methods were evaluated across four subsets composed of terrestrial and marine data. Across ten proposed sampling methods from seven teams, the top-ranked method achieved an area under the learning curve 26.4 % higher than random sampling at the same annotation budget, averaged over four data subsets. Significant variation in performance was observed across subsets, with the top-performing submission achieving a 67.1 % gain for the HSN subset over random sampling and a gain of 8 % for the ATBFL subset. Top-ranking submissions combined multiple acquisition signals, and diversity-based selection outperformed pure uncertainty sampling. Furthermore, there is evidence that transitioning from diversity-based to uncertainty-based selection and explicitly reducing redundancy within acquisition batches improve model training. There is also initial evidence that larger acquisition batch sizes may be increasingly beneficial later in the labelling process.
Read the full abstract

All authors Ben McEwen, Rupa Kurinchi-Vendhan, Shiqi Zhang, Lukas Rauch, Marek Herde, Sara Beery

Machine Learning (Statistics)

Conformal Individual Treatment Effect Estimation under Networked Interference

Conformal counterfactual prediction constructs prediction sets with finite-sample coverage guarantees for counterfactual outcomes and individual treatment effects under the no-interference assumption. In this work, we relax this assumption by allowing each unit's potential outcomes to depend on other units' treatments and covariates. In this setting, propensity-score reweighting does not restore weighted exchangeability, and existing methods may fail to achieve valid coverage. To address this issue, we develop interference-adjusted weighted conformal prediction that accounts for interference by constructing an observable upper bound on the ideal and unobserved conformal $p$-value under the target intervention. The resulting prediction sets provide finite-sample marginal coverage guarantees for counterfactual outcomes and individual treatment effects in both transductive and inductive settings. We also derive a sharper construction when intervention-induced changes in nonconformity scores are bounded. Numerical experiments show that our methods preserve nominal coverage, whereas existing methods may not.
Read the full abstract

Algebraic Topology

Generating hypotheses along the motivic deformation

At every prime $p$, we disprove the algebraic generating hypothesis for compact objects in Hovey's stable category of $BP_*BP$-comodules and its local analog at every positive height, answering questions of Barthel and Heard. In both settings, for every $r,n\geq1$, we construct a ghost whose first $n$ composition powers are all nonzero and have exact additive order $p^r$. The same construction applies to the stable category of $E_*E$-comodules for even $p$-local Landweber exact theories $E$ that are not rational. Through the motivic deformation of Gheorghe–Wang–Xu, these examples give $C\tau$-linear counterexamples to the cellular $\mathbb{C}$-motivic generating hypothesis, with the same order and composition properties. We also construct nonzero non-$C\tau$-linear ghosts between $C\tau$-modules and a nonzero ghost on a motivic spectrum with noncontractible Betti realization.
Read the full abstract

High Energy Physics (Phenomenology)

Follow-up comments to searches for QCD instantons via forward proton tagging

In this short text, only the main facts are reminded from the full-fledged study~\cite{Tasevsky:2022sch} and a few experimental considerations are added, reflecting developments since the publication of Ref.~\cite{Tasevsky:2022sch} in 2023.

High Energy Physics (Experiment)

Observation of $\Xi_{b}^{0} \to \Xi^{0} J/\psi$ and evidence for $\Xi_{b}^{0} \to \Xi^{0} \psi(2S)$ decays

The first search for the beauty baryon decays $\Xi_{b}^{0} \to \Xi^{0} J/\psi$ and $\Xi_{b}^{0} \to \Xi^{0} \psi(2S)$ is presented using the proton-proton collision dataset collected by the LHCb experiment between 2016 and 2018, corresponding to an integrated luminosity of $5.4\,\mathrm{fb}^{-1}$. The first observation of the decay $\Xi_{b}^{0} \to \Xi^{0} J/\psi$ is reported and evidence of the decay $\Xi_{b}^{0} \to \Xi^{0} \psi(2S)$ is presented. The $\Xi^{0}$ hyperon is fully reconstructed for the first time at an LHC experiment, which is achieved using the $\Xi^{0} \to \Lambda \pi^{0}$ decay. The ratio of the branching fractions is measured as $\frac{\cal{B}(\Xi_{b}^{0} \to \Xi^{0} \psi(2S))}{\cal{B}(\Xi_{b}^{0} \to \Xi^{0} J/\psi)} = 0.59 \pm 0.19 \text{(stat)} \pm 0.04 \text{(syst)}$.
Read the full abstract

All authors LHCb collaboration: R. Aaij, M. Abdelfatah, 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, S. Akar, K. Akiba, H. Al Saleh, P. Albicocco, J. Albrecht, R. Aleksiejunas, F. Alessio, P. Alvarez Cartelle, S. Amato, J.L. Amey, Y. Amhis, Z. Amos, L. An, L. Anderlini, P. Andreola, M. Andreotti, S. Andres Estrada, A. Anelli, D. Ao, C. Arata, F. Archilli, Z. Areg, M. Argenton, S. Arguedas Cuendis, L. Arnone, 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, M. Bai, Z.B. Bai, 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, W. Barker, R.J. Barlow, M. Barnyakov, S. Baron, S. Barsuk, W. Barter, J. Bartz, S. Bashir, B. Batsukh, P.B. Battista, A. Bavarchee, A. Bay, A. Beck, M. Becker, F. Bedeschi, I.B. Bediaga, N.A. Behling, S. Belin, A. Bellavista, I. Belyaev, G. Bencivenni, E. Ben-Haim, J.L.M. Berkey, R. Bernet, A. Bertolin, L. Bertsch, F. Betti, J. Bex, O. Bezshyyko, S. Bhattacharya, 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, J.A. Boelhauve, O. Boente Garcia, T. Boettcher, A. Bohare, C. Bolognani, R.B. Bonacci, 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, C. Breitfeld, J. Brodzicka, J. Brown, E. Buchanan, M. Burgos Marcos, C. Burr, E. Butera, C. Buti, J.S. Butter, J. Buytaert, W. Byczynski, S. Cadeddu, H. Cai, Y. Cai, Y. Cai, A. Caillet, R. Calabrese, L. Calefice, M. Calvi, M. Calvo Gomez, P. Camargo Magalhaes, J.I. Cambon Bouzas, P. Campana, A. Campomagnani, A.C. Campos, 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, R. Caspary, G. Casse, M. Cattaneo, G. Cavallero, V. Cavallini, S. Celani, I. Celestino, S. Cesare, A.J. Chadwick, M. Charles, Ph. Charpentier, E. Chatzianagnostou, R. Cheaib, M. Chefdeville, C. Chen, J. Chen, S. Chen, Z. Chen, A. Chen Hu, M. Cherif, S. Chernyshenko, X. Chiotopoulos, G. Chizhik, V. Chobanova, A. Christakakis, M. Chrzaszcz, Y. Chu, V. Chulikov, P. Ciambrone, X. Cid Vidal, P. Cifra, P.E.L. Clarke, M. Clemencic, H.V. Cliff, J. Closier, C. Cocha Toapaxi, V. Coco, A. Codovini, C. Codovini, 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, A. Corallo, G. Cordova, C. Coronel, I. Corredoira, A. Correia, G. Corti, G.C. Costantino, C. Cotirlan, J. Cottee Meldrum, B. Couturier, D.C. Craik, N. Crepet, M. Cruz Torres, M. Cubero Campos, E. Curras Rivera, R. Currie, C.L. Da Silva, X. Dai, J. Dalseno, C. D'Ambrosio, G. Darze, A. Davidson, 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, F. De Gregorio, E. De Lucia, J.M. De Miranda, L. De Paula, A. De Robertis, E. De Santis, M. De Serio, P. De Simone, F. De Vellis, J.A. de Vries, F. Debernardis, D. Decamp, S. Dekkers, L. Del Buono, B. Delaney, B. Demaire-Lepape, J. Deng, O. Deschamps, F. Dettori, B. Dey, P. Di Nezza, S. Ding, Y. Ding, L. Dittmann, J.F. Diverchy, A.D. Docheva, A. Doheny, C. Dong, F. Dordei, J. Dorta Moreno, A.C. dos Reis, J. Dos Santos Oliveira, A.D. Dowling, L. Dreyfus, W. Duan, P. Duda, L. Dufour, V. Duk, P. Durante, M.M. Duras, J.M. Durham, K. Duwe, A. Dziurda, S. Easo, E. Eckstein, U. Egede, S. Eisenhardt, E. Ejopu, L. Eklund, M. Elashri, D. Elizondo Blanco, J. Ellbracht, S. Ely, A. Ene, 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, B. Fernandez Rodino, J. Fernandez-John, A.D. Fernez, F. Ferrari, F. Ferreira Rodrigues, R.A. Fini, R. Fiorenza, M. Fiorini, M. Firlej, D.S. Fitzgerald, C. Fitzpatrick, T. Fiutowski, F. Fleuret, A. Fomin, M. Fontana, M. Fontes Vaz, 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, Y. 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, J. George, 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, A. Golutvin, S. Gomez Fernandez, A.G. Gomez Mongui, W. Gomulka, F. Goncalves Abrantes, I. Gonçales Vaz, M. Goncerz, G. Gong, S. Gong, J.A. Gooding, C. Gotti, E. Govorkova, J.P. Grabowski, L.A. Granado Cardoso, R. Grande Quartieri, E. Graugés, E. Graverini, L. Grazette, G. Graziani, A.T. Grecu, N.A. Grieser, L. Grillo, C. Gu, M. Guarise, L. Guerry, A.-K. Guseinov, Y. Guz, T. Gys, K. Habermann, T. Hadavizadeh, C. Hadjivasiliou, G. Haefeli, C. Haen, S. Haken, G. Hallett, P.M. Hamilton, Q. Han, S. Han, X. Han, S. Hansmann-Menzemer, N. Harnew, T.J. Harris, L. Hartman, 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, A. Henrot, 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, D. Hutchcroft, M. Idzik, P. Ilten, A. Iohner, S. Jacevicius, H. Jage, S.J. Jaimes Elles, S. Jakobsen, T. Jakoubek, E. Jans, A. Jawahery, C. Jayaweera, A. Jelavic, 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, A. Kauniskangas, J.W. Kautz, M.K. Kazanecki, F. Keizer, M. Kenzie, T. Ketel, B. Khanji, S. Kholodenko, V. Kholoimov, G. Khreich, F. Kiraz, T. Kirn, V.S. Kirsebom, 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, I. Kostiuk, O. Kot, S. Kotriakhova, E. Kowalczyk, O. Kravcov, M. Kreps, W. Krupa, W. Krzemien, O. Kshyvanskyi, S. Kubis, M. Kucharczyk, A. Kupsc, A. Kurzina, V. Kushnir, B. Kutsenko, J. Kvapil, I. Kyryllin, D. Lacarrere, P. Laguarta Gonzalez, A. Lai, A. Lampis, D. Lancierini, C. Landesa Gomez, G. Lanfranchi, C. Langenbruch, T. Latham, F. Lazzari, C. Lazzeroni, R. Le Gac, H. Lee, R. Lefèvre, 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, L. Li, P. Li, P.-R. Li, Q. Li, T. Li, T. Li, W. Li, Y. Li, Y. Li, Y. Li, Z. Li, Z. Lian, Q. Liang, X. Liang, Z. Liang, S. Libralon, A. Lightbody, J. Lin, S. Lin, T. Lin, R. Lindner, H. Linton, V. Lisovskyi, R. Litvinov, D. Liu, F.L. Liu, G. Liu, K. Liu, S. Liu, W. Liu, X. 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, Q. Lu, C. Lucarelli, D. Lucchesi, M. Lucio Martinez, Y. Luo, A. Lupato, M. Lupberger, E. Luppi, K. Lynch, J. Lyu, S. Lyu, X.-R. Lyu, H. Ma, S. Maccolini, F. Machefert, F. Maciuc, B. Mack, I. Mackay, L.M. Mackey, L.R. Madhan Mohan, M.J. Madurai, D. Magdalinski, J.J. Malczewski, S. Malde, L. Malentacca, G. Manca, C. Mancuso, R. Manera Escalero, A. Mangalasseri, F.M. Manganella, R. Mangrulkar, D. Manuzzi, S. Mao, D. Marangotto, J.F. Marchand, R. Marchevski, U. Marconi, L. Mareso, E. Mariani, S. Mariani, C. Marin Benito, J. Marks, A.M. Marshall, L. Martel, G. Martelli, G. Martellotti, L. Martinazzoli, M. Martinelli, C. Martinez, A. Martinez Armas, D. Martinez Gomez, D. Martinez Santos, F. Martinez Vidal, A. Martorell i Granollers, A. Massafferri, R. Matev, A. Mathad, C. Matteuzzi, K.R. Mattioli, L. Matzner, A. Mauri, E. Maurice, J. Mauricio, P. Mayencourt, J. Mazorra de Cos, M. Mazurek, D. Mazzanti Tarancon, M. McCann, N.T. McHugh, A. McNab, R. McNulty, B. Meadows, S.E.R. Medaer, D. Melnychuk, D. Mendoza Granada, P. Menendez Valdes Perez, F.M. Meng, M. Merk, A. Merli, L. Meyer Garcia, D. Miao, H. Miao, S. Mico, M. Mikhasenko, D.A. Milanes, A. Minotti, E. Minucci, 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, N. Muangkod, E. Muhammad, F. Muheim, M. Mulder, K. Müller, F. Muñoz-Rojas, V. Mytrochenko, P. Naik, T. Nakada, R. Nandakumar, G. Napoletano, I. Nasteva, M. Needham, N. Neri, S. Neubert, N. Neufeld, J. Nicolini, D. Nicotra, E.M. Niel, L. Nisi, Q. Niu, B.K. Njoki, P. Nogarolli, P. Nogga, J. Nombela Royo, C. Normand, A. Novo Cal, J. Novoa Fernandez, G. Nowak, H.N. Nur, A. Oblakowska-Mucha, T. Oeser, 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, L. Palombini, M. Palutan, C. Pan, X. Pan, S. Panebianco, S. Paniskaki, 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, H. Pereira Da Costa, M. Pereira Martinez, A. Pereiro Castro, C. Perez, A. Perez Casas, P. Perret, A. Perrevoort, A. Perro, M.J. Peters, A. Petkovic, K. Petridis, A. Petrolini, S. Pezzulo, J.P. Pfaller, H. Pham, L. Pica, E. Picatoste Olloqui, M. Piccini, L. Piccolo, B. 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, I. Polyakov, E. Polycarpo, S. Ponce, D. Popov, K. Popp, 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, B. Rachwal, R. Racz, J.H. Rademacker, M. Rama, M. Ramírez García, V. Ramos De Oliveira, M. Ramos Pernas, G. Ramsey, M.S. Rangel, 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. Rogovskiy, D.L. Rolf, P. Roloff, A. Romano, V. Romanovskiy, A. Romero Vidal, G. Romolini, F. Ronchetti, T. Rong, W. Rose, M. Rotondo, M.S. Rudolph, G. Ruggiero, M. Ruiz Diaz, J. Ruiz Vidal, J. Ruz Armendariz, J.J. Saavedra-Arias, J.J. Saborido Silva, D. Sahoo, N. Sahoo, B. Saitta, M. Salomoni, I. Sanderswood, R. Santacesaria, C. Santamarina Rios, M. Santimaria, L. Santoro, E. Santovetti, A. Saputi, A. Sarnatskiy, G. Sarpis, M. Sarpis, C. Satriano, A. Satta, M. Saur, 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, H. Schumacher, M.H. Schune, G. Schwering, B. Sciascia, A. Sciuccati, G. Scriven, I. Segal, S. Sellam, M. Senghi Soares, A. Sergi, N. Serra, L. Sestini, B. Sevilla Sanjuan, Y. Shang, D.M. Shangase, R.S. Sharma, L. Shchutska, T. Shears, S. Shelton, J. Shen, Z. Shen, S. Sheng, B. Shi, J. Shi, Q. Shi, W.S. Shi, E. Shmanin, R. Silva Coutinho, G. Simi, S. Simone, M. Singha, I. Siral, N. Skidmore, T. Skwarnicki, M.W. Slater, E. Smith, M. Smith, L. Soares Lavra, M.D. Sokoloff, F.J.P. Soler, A. Solomin, K. Solovieva, N.S. Sommerfeld, R. Song, Y. Song, Y. Song, Y.S. Song, F.L. Souza De Almeida, G. Souza De Castro, 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, O. Steinkamp, F. Suljik, J. Sun, L. Sun, M. Sun, D. Sundfeld, P. Svihra, V. Svintozelskyi, J. Swallow, K. Swientek, F. Swystun, A. Szabelski, T. Szumlak, Y. Tan, Y. Tang, Y.T. Tang, M.D. Tat, J.A. Teijeiro Jimenez, F. Terzuoli, F. Teubert, E. Thomas, D.J.D. Thompson, A.R. Thomson-Strong, R. Thornton, H. Tilquin, V. Tisserand, S. T'Jampens, M. Tobin, T.T. Todorov, L. Tomassetti, G. Tonani, X. Tong, T. Tork, L. Torlai, L. Toscano, D.Y. Tou, G. Tuci, N. Tuning, L.H. Uecker, A. Ukleja, A. Upadhyay, B. Urbach, A. Usachov, U. Uwer, V. Vagnoni, A. Vaitkevicius, A. Valassi, 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, P. Varrella, 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, K. Vos, C. Vrahas, J. Wagner, J. Walsh, N. Walter, E.J. Walton, G. Wan, A. Wang, B. Wang, C. Wang, C. Wang, C. Wang, G. Wang, H. Wang, J. Wang, J. Wang, J. Wang, J. Wang, M. Wang, N.W. Wang, X. Wang, X. Wang, X. Wang, X.W. Wang, Y. 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, A.S. White, 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, T. Wu, X. Wu, Y. Wu, Z. Wu, K. Wyllie, S. Xian, Z. Xiang, Y. Xie, T.X. Xing, A. Xu, L. Xu, M. Xu, R. Xu, Z. Xu, Z. Xu, Z. Xu, Z. Xu, S. Yadav, K. Yang, X. Yang, Y. Yang, Y. Yang, Z. Yang, Z. Yang, H. Yeung, H. Yin, X. Yin, C.Y. Yu, J. Yu, K. Yu, X. Yuan, Y Yuan, S. Zalambani, J.A. Zamora Saa, F. Zangari, M. Zavertyaev, M. Zdybal, F. Zenesini, C. Zeng, M. Zeng, S.H Zeng, C. Zhang, C. Zhang, D. Zhang, J. Zhang, L. Zhang, Q.Z. Zhang, R. Zhang, S. Zhang, S.L. Zhang, Y. Zhang, Z. Zhang, J. Zhao, M. Zhao, Y. Zhao, A. Zhelezov, S.Z. Zheng, X.Z. Zheng, Y. Zheng, T. Zhou, X. Zhou, V. Zhovkovska, L.Z. Zhu, X. Zhu, X. Zhu, Y. Zhu, V. Zhukov, J. Zhuo, T. Zies, D. Zuliani, X. Zuo

Computational Physics

Digital Twin of an Argon-Hydrogen Plasma Reactor

The principal proof of concept revolves around an argon-hydrogen plasma reactor that melts, reduces, atomizes and quenches critical raw material in one step, with premium spherical powder as the deliverable output and control of the composition chemistry. Each usage of the reactor is monitored through thermocouples and pressure sensors, which provide a daily data source of the real-world experiments. The reactor is modeled through COMSOL Multiphysics, which represents the core solver used to provide multiphysics simulations. The usage of COMSOL is complemented with Artificial Intelligence (AI) models, to enable seamless data assimilation and optimization. This paper presents the COMSOL twin of the reaction chamber and converging-diverging nozzle, together with a custom phase-change particle-tracing layer validated on Ti-6Al-4V (Ti64). Moreover, we highlight how the synergy between COMSOL simulations and AI-based digital surrogates can be leveraged to build self-consistent optimization loops geared toward (i) fully autonomous live control of the reactor and (ii) optimization of the process.
Read the full abstract

All authors B. Artola, A. Bonfanti, M. Holmström, Q. M. Wargnier

Systems and Control

TREDD: Robust Trend-Based Reference Evaluation for Interpretable Degradation Detection

Technical systems are increasingly monitored using sensor and operational data to detect degradation and performance deterioration at an early stage. However, observed trends in measurement data do not necessarily correspond to physical aging, since noise, outliers, unstable initial regions, or changing operating conditions may produce similar patterns. This paper proposes Trend-based Reference Evaluation for Degradation Detection (TREDD), an interpretable method for detecting degradation as a persistent, trend-based deviation from an early reference state. TREDD combines rolling-window smoothing, baseline estimation, a direction-dependent degradation index, long-term trend extraction, and persistent drift detection. In addition, the method separates computational drift detection from the interpretation of drift as plausible physical aging by incorporating data-quality assessment, context checking, and robust auxiliary analysis. The approach is evaluated on the NASA Lithium-Ion Battery Aging Dataset using discharge-cycle capacity as the degradation-relevant condition variable. The representative case study illustrates that TREDD can identify clear degradation trajectories while assigning reduced confidence to weak, gradual, or atypical trends. The method therefore supports transparent and confidence-based degradation interpretation rather than purely predictive battery health estimation.
Read the full abstract

Machine Learning

Bandits with Probing: Optimal Coverage and the Role of Feedback

In bandits with probing, a learner selects at most $k$ of $n$ arms per round, earns the largest of their rewards, and competes with the best fixed single arm. For independent arms with i.i.d. rewards in $[0,1]$ and $2\le k<n$, the minimax regret is $\Theta\bigl(\frac{n-k}{n}\min\{T,n/k\}\bigr)$, the cost of locating an unknown good arm, and observing only the maximum suffices to attain it. In particular, two probes give $\Theta(\min\{T,n\})$ regret, which resolves two open questions of Bhaskara et al. (2023) with weaker feedback. Our policy turns the probing surplus, the excess of the maximum over each probed arm, into exploration capital, and a permanent random core yields the sharp dependence on $k$. On arbitrary fixed reward arrays, same-round contrasts between blocks of arms attain the same rate, because the surplus pays for the stability of mirror descent. Winner feedback, the maximum together with its winning label, instead incurs an additional learning cost under joint i.i.d. rewards and on fixed arrays. We characterize this cost even when values are revealed only intermittently, using policies that know neither the horizon nor the revelation rate. For three independent arms and two probes, exact maxima, Bernoulli-rounded maxima with winning labels, and winning labels alone have minimax regret $\Theta(1)$, $\Theta(\sqrt T)$, and $\Theta(T)$: rounding preserves conditional means but not the rate.
Read the full abstract

Data Structures and Algorithms

A Faster Undirected Single-Source Shortest Path Algorithm

The single-source shortest paths (SSSP) problem in graphs with non-negative edge weights is one of the most classic problems in algorithms. For decades, the best known running time in the comparison-addition model was the $O(m+n\log n)$ bound of Dijkstra's algorithm with Fibonacci heaps. Recently, Duan, Mao, Shu, and Yin (FOCS'23) gave a randomized $O(m\log^{1/2} n \log\log^{1/2} n)$-time algorithm for SSSP in weighted undirected graphs. For weighted directed graphs, Duan, Mao, Mao, Shu, and Yin (STOC'25) gave an $O(m\log^{2/3} n)$-time algorithm for SSSP. Very recently, Duan, Mao, Shu, and Yin (ICALP'26) obtained an algorithm for directed graphs whose running time matches the $O(m\log^{1/2} n \log\log^{1/2} n)$ time of the undirected case. In this paper, we present a faster algorithm for SSSP in weighted undirected graphs, giving the first improvement in running time since the FOCS'23 breakthrough of Duan, Mao, Shu, and Yin. Our algorithm runs in $O(m\log^{1/2} n \log\log^{1/4} n \log\log\log^{1/4} n)$ time, improving the previous running time by a factor of $(\frac{\log\log n}{\log\log\log n})^{1/4}$. Our main contribution is a simple and efficient tool that computes, for every vertex, its distance to the nearest vertex in a random sample; this tool may be of independent interest.
Read the full abstract

Materials Science

A cylindrical sintering method for more realistic grain boundaries in nanocrystalline thin films

Discrepancies between simulated and experimental mechanical properties in molecular dynamics simulations of nanocrystalline metals typically arise from the sample-construction method and the interatomic potential choice. We introduce a cylindrical sintering method to generate nanocrystalline aluminum thin-film samples with wider, more disordered grain boundaries than the usual Voronoi tessellation method, while maintaining deterministic control over grain size, shape, and orientation. Cylindrical sintered samples are benchmarked against hexagonal Voronoi references under identical conditions using both the classical Pascuet15 MEAM and tabGAP machine-learning potentials. Cylindrical sintered samples consistently show lower mechanical properties than hexagonal Voronoi samples due to their wider, more disordered grain boundaries - an effect independent of the choice of potential. Notably, changing the sample geometry and changing the interatomic potential produce comparable, additive, and independent shifts in predicted properties, highlighting that future molecular dynamics studies must hold both variables fixed for meaningful comparisons. Common neighbor and dislocation extraction analyses confirm that deformation is dominated by grain-boundary-mediated plasticity. Uniaxial tensile tests reveal an inverse Hall-Petch relationship for both sample types and both potentials, with mechanical properties decreasing monotonically as grain size reduces from 40.34 to 4.84 nm. The cylindrical sintering method offers a physically realistic, geometrically controlled alternative that bridges idealized Voronoi models and disordered experimental grain-boundary structures.
Read the full abstract

All authors Ankit Yadav, Lucia Bajtošová, Miroslav Cieslar, Jan Fikar

Computational Engineering

Process-Aware Thickness Analysis in CAD Models using Hybrid Geometric Methods

Thickness is a critical geometric attribute in Design for Manufacturability (DFM), yet its computational analysis in CAD environments remains largely process-agnostic. Existing approaches rely either on inscribed-sphere or ray-casting methods, each carrying limitations that make them poorly suited as universal solutions across manufacturing processes. This paper presents a process-aware thickness analysis system for parts intended for molding and milling, where the geometric method is selected and its outputs interpreted according to the DFM rules meaningful to each process. For molding, the sphere-based method detects maximum thickness violations and wall non-uniformity, and segments parts into distinct thickness zones. For milling, ray-casting identifies regions of insufficient thickness and detects thin features prone to deflection or failure. Validation on representative parts demonstrates that this hybrid approach surfaces process-specific manufacturability issues, offering designers actionable geometric feedback early in the design cycle.
Read the full abstract

Representation Theory

On $\boldsymbol{p}$-rationality in double covers of symmetric and alternating groups

We construct, for every odd prime $p$, a bijection between the $p'$-spin characters $\widetilde S_n$ and those of a Sylow normalizer which, in particular, is equivariant under the Galois action detecting $p$-rationality. An analogous result holds for $\widetilde A_n$. We also obtain a blockwise refinement for height-zero spin characters and their Brauer correspondents.
Read the full abstract

Numerical Analysis

A mathematical model for irreversible damage of the collagen scaffold in the myocardium

We propose a dissipative, irreversible damage model for anisotropic media in large deformations to address the damage process of the myocardium following a cardiac infarction. We model damage to the collagen in the cleavage planes resulting from an increased load to the passive tissue. Starting from variational principles, we derive a quasi-static differential model governing the irreversible evolution of the damage. We apply our model to two test cases. First, a rectangular passive slab geometry to which an indenter-like load is applied. Then, we couple our model with a model for the numerical simulation of left ventricular electromechanics. Our results show that a redistribution of the load within a left ventricle occurring following a cardiac infarction can produce the damage to the collagen scaffold in the infarcted area consistent with experimental results. This is indicative of the fact that passive load-dependent dissipative phenomena are implicated in post-infarction remodelling.
Read the full abstract

All authors Irena Radišić, Francesco Regazzoni, Luca Dede', Alfio Quarteroni

Artificial Intelligence

Empirical Evaluation of Open-Source Large Language Models for Retrieval-Augmented Generation in ESG Domain

Environmental, Social, and Governance (ESG) reporting is critical for corporate accountability, with Large Language Models (LLMs) and Retrieval-Augmented Generation (RAG) offering strong potential to automate KPI extraction. However, open-source LLM performance in domain-specific ESG tasks remains insufficiently understood. This paper evaluates open-source LLMs in ESG contexts using a structured framework and evaluation resource based on 498 real-world ESG reports from EU-listed companies (2010-2024). We evaluate seven open-source models (2B to 30B parameters) – glm-4.7-flash, nemotron-3-nano:4b, qwen3:4b-instruct, gemma3:4b, gemma4:e4b, gemma4:e2b, and ministral-3:8b – using 100 persona-based synthetic QA pairs covering ESG information needs. System performance is assessed via RAGAS metrics, including contextual recall, precision, relevance, faithfulness, answer relevancy, and factual correctness. Results show notable performance variations across architectures. Retrieval performance is strong across models (context recall around 0.58-0.61, context precision around 0.78-0.81, context relevance 0.965-0.985). Generation diverges most on faithfulness (0.607-0.822) and least on answer relevancy (0.760-0.881): glm-4.7-flash leads in faithfulness (0.822), qwen3 in factual correctness (0.449), and ministral-3 in answer relevancy (0.881). Low overall factual correctness (0.387-0.449) highlights the need for domain-specific fine-tuning. This work provides data-driven guidance for deploying open-source models in ESG reporting.
Read the full abstract

All authors Motaz Saad, Anna Borrelli, Ivan Gentile, Kianna Kazemi, Francesco Piccialli, Antonella Longo

Computer Vision

A 25-$\mu$s/inf Event-driven Graph Neural Network Processor with Spatiotemporal Caching and Spline Convolution for Ultra-low-latency AI at the Edge

Dynamic-vision-sensor (DVS) cameras generate events on a per-pixel basis with a $\mu$s-level temporal resolution, calling for new algorithm-hardware co-design approaches compared to standard frame-based vision. While event-driven graph neural networks (EV-GNNs) emerge as a promising algorithmic solution, they raise new HW challenges by mixing dense-regular compute operations and sparse-irregular memory accesses. We present ETHEREAL, the first EV-GNN accelerator that scales to 640$\times$480 resolutions, thanks to a neighbor-parallel spline convolution engine and a 2D/3D-split memory hierarchy with a novel region-of-interest spatiotemporal caching mechanism. Measurement results demonstrate end-to-end inference with 25.6$\mu$s latency and 1.7$\mu$J energy per event on state-of-the-art workloads
Read the full abstract

All authors Adrian Kneip, Martin Lefebvre, Daniel Gehrig, Victoria Catalán Pastor, Davide Scaramuzza, Marian Verhelst, Charlotte Frenkel

Sound

Generating the Unheard: Phylogeny-Guided Latent Generation for Ancestral Sound Reconstruction

What did an ancestral bird species sound like? Existing ancestral state reconstruction methods can infer low-dimensional traits such as morphological characters at internal nodes of a phylogenetic tree, but no one has tried to produce rich perceptual signals such as audio. Some of the challenges include inferred representations that are either too low-dimensional to decode or lie in non-generative feature spaces, so no method to date can produce ancestral audio. We introduce the first framework that generates plausible ancestral vocalizations. Our pipeline encodes bird recordings into a VAE latent space, learns a low-dimensional trait projection aligned with phylogenetic distances, performs ancestral inference in this trait space, and recovers decodable latents through an anchored inverse lift before emitting novel waveforms for each ancestral node. Because the entire pipeline stays within a decodable latent space, every internal node receives a genuinely new audio output representing plausible intermediate ancestral sounds unavailable to retrieval-based alternatives. Experiments on two phylogenetically distant bird clades, 21-species Tyrannidae and 19-species Paridae, show that our method is the only approach that simultaneously achieves genuine generation, phylogenetic consistency, and naturalistic audio quality across both datasets.
Read the full abstract

All authors Tianyi Xu, Shrinaath Narasimhan, Evan Gorstein, Santiago Perea, Yunyi Shen, Claudia Solís-Lemus

Machine Learning

ProtoGuide: Prototype-Driven Guidance for Class-Conditional Graph Generation

Discrete diffusion models are a prominent family for graph generation, but standard class-conditional mechanisms embed the class signal in the denoiser during training, tying the conditioning mechanism to the trained model. Classifier guidance avoids this coupling in continuous domains by steering a frozen model with a classifier's gradient, but discrete graph diffusion samples discrete edge states, so gradients cannot propagate through the sampled graph. We introduce ProtoGuide, a post-hoc, backbone-agnostic framework that recovers an analogous mechanism. At each reverse step the denoiser's per-edge output is relaxed into a differentiable soft adjacency, embedded by a frozen Siamese graph neural network, and scored against a target-class prototype and its nearest competitor; the resulting per-edge gradient, damped by a cosine schedule, is injected back into the denoiser output. All components stay frozen, so guidance is retargeted by supplying a different prototype. On five classes of real-world networks and two architecturally different backbones, EDGE and DiGress, ProtoGuide raises macro classification accuracy from 50.7% to 73.5% and from 73.6% to 83.8%, and outperforms DiGress's built-in conditional training under our configuration. Gains are largest where the unguided models are weakest, and are not uniform across classes. Per-graph coverage remains high in most settings, while distributional effects are class-dependent. A Best-of-N selection baseline matches this accuracy given enough oversampling, but at a substantial cost in graph diversity. An independently initialized classifier, a directionality test, and a few-shot analysis support target-directed steering and robustness to very small support sets.
Read the full abstract

All authors Salvatore Romano, Marco Grassia, Pietro Liò, Giuseppe Mangioni

Analysis of PDEs

Large-Box Transition in Nonlinear Landau Damping for the Vlasov–Yukawa Equation

We study nonlinear Landau damping for the Vlasov–Yukawa equation in the large-box regime, as a periodic box of length $2\pi L$ expands to the whole space. First, for $d\ge 3$, we prove global stability and scattering in an $L$-dependent Gevrey class, with estimates uniform for $L\ge L_0$. The density obeys a two-regime upper bound: the whole-space decay rate $\langle t\rangle^{-d}$ before the critical time scale $T_{\rm disp}(L)\sim L$, and a periodic phase-mixing bound in the rescaled time $t/L$ thereafter. Second, to quantify the nonlinear resonance effect, we identify an echo-Volterra operator governing the nonlinear density memory, and provide sharp estimates for its non-collinear and collinear parts. The non-collinear time-frequency interactions remain uniformly bounded, whereas the collinear interactions do not become comparable to the background until the much later time scale $T_{\rm col}(L)\sim L^{d-1}$. Third, we investigate the stability and convergence of Sobolev initial data. For data of size $\varepsilon$, polynomial Sobolev smallness persists up to the time scale $\varepsilon^{-1} T_{\rm col}(L)$. Within the shorter time scale $T_{\rm disp}(L)\sim L$, compatible periodic solutions converge locally, as $L\to\infty$, to a global solution of the whole-space Vlasov–Yukawa equation.
Read the full abstract

High Energy Physics (Theory)

Quantum geometry of gravitons

We uncover the quantum geometric structure of graviton Wigner functions and stress-energy tensors via quantum field theory in curved spacetime, revealing the phase-space geometry of spacetime and relativistic quantum-state manifolds. We show that the polarization mode expansion of the underlying graviton field operator is fully captured by quantum geometry, as encoded in the spinor-helicity formalism, thereby establishing the geometric framework from the outset. Applying this to a weak gravitational background, we demonstrate the roles of the quantum metric and connection in describing graviton transport beyond the chiral vortical effect. We also clarify the role of the quantum metric in normalizing the perfect-fluid graviton stress tensor within this approach. This work paves the path for explorations of multistate Hilbert-space geometry in high-energy and gravitational physics. In addition, this framework naturally encompasses lower-spin excitations, allowing for a unified quantum geometric treatment of bosonic and fermionic many-body systems in condensed matter and particle physics.
Read the full abstract

Information Retrieval

ProLiVis 2.0: Literature-Centric Visualization of Protein–Protein Interaction Networks, with a Citation-Trust Model for Interaction Evidence

Protein-protein interaction databases record evidence without weighing it. In BioGRID, an interaction asserted once by a single high-throughput screen and one confirmed by twenty laboratories across a dozen assays are the same kind of row in the same file. Tools built on such databases inherit that flattening: they draw every reported interaction as an edge, and the resulting picture states that two proteins interact without stating how much anyone should believe it. We present ProLiVis 2.0, a rewrite of the literature-centric visualization system of arXiv:2111.12794. It contributes three things. First, a citation-trust model that scores each interaction from seven terms, including a term for the number of independent laboratories behind the supporting publications, obtained by clustering those publications over shared institutional affiliations; a plain count of publications cannot distinguish five confirmations from one group publishing five times. Second, a deterministic reformulation of the center layout, closed-form and $O(n \log n)$, which replaces the force-directed placement of the original and makes published figures regenerable from a session manifest. Third, an implementation that runs entirely in a web browser, with an embedded analytical database, requiring no installation and uploading no data. On BioGRID release 5.0.260 restricted to SARS-CoV-2, 24,344 of 34,540 reported interactions (70%) rest on a single publication, and raising the trust threshold to 0.2 leaves 11,320 of them. That the large majority of a curated interaction network is unreplicated is a fact no existing view of the database makes visible.
Read the full abstract

All authors Melih Sözdinler, Yalç{\i}n Doksanbir, Gökhan Akp{\i}nar, Ege Aktan

Representation Theory

Quasiparabolic Gelfand models for finite irreducible Coxeter groups and their canonical Hecke structures

Quasiparabolic sets extend parabolic coset spaces while retaining a length filtration and natural Hecke algebra deformations. Gelfand models built from induced linear characters ask when such spaces can account for every irreducible representation exactly once. We classify, up to equality of the individual induced characters, all quasiparabolic Gelfand models for finite irreducible Coxeter groups with inducing characters restricted from their ambient parabolic subgroups, including the additional models of type \(D_{4r+2}\) and \(B_3\). We derive the associated finite Gelfand-pair and commutant consequences, construct canonical Hecke structures for the additional classical models.
Read the full abstract

Artificial Intelligence

CWM: Controllable White-Box Meta-Prompting for Adaptive Retrieval-Augmented Generation and Reasoning Ability

Recently, Large Language Models (LLMs) have gained significant attention due to their strong language understanding and generation capabilities, demonstrating impressive reasoning abilities as well as effective utilization of external knowledge. Many studies have proposed methods that specialize in improving performance for individual tasks. However, ironically, only a limited number of attempts have explored general-purpose, task-agnostic methods. In this work, we present a unified framework integrating reasoning and Retrieval-Augmented Generation (RAG) tasks. We further propose Controllable White-Box Meta-Prompting (CWM), a low-cost white-box method for adaptive RAG tasks previously dominated by black-box approaches, without requiring external decision modules or multi-sampling. CWM achieves state-of-the-art performance on three adaptive RAG benchmarks across recent LLMs, including GPT-oss-20b, Qwen3-14b, and Llama3.1-8b, while also demonstrating strong generality by extending to reasoning tasks. In addition, CWM provides controllability by enabling retrieval decisions to be regulated through the manipulation of internal model signals. Our code is available at https://github.com/JeongEunhye00/CWM.
Read the full abstract

Functional Analysis

Norms of generalized derivations with values in symmetric spaces

Let $B(\mathcal H)$ be the $*$-algebra of all bounded linear operators on a Hilbert space $\mathcal H$. A classical result due to Stamplfi shows that, for any $a\in B(\mathcal H)$, the norm of the inner derivation $\delta_a=[a,\cdot]$ on $B(\mathcal H)$ is given by $\|\delta_a\|_{B(\mathcal H)\to B(\mathcal H)}=2\inf\{ \|a-c{\bf 1}\|_{B(\mathcal H)}:c\in \mathbb{C}\}$. In the present paper, we provide a formula for the norm of a generalized derivation implemented by self-adjoint operators from an ideal in $B(\mathcal H)$, which partially answers a question posed by Fialkow and Loebl in the 1980s. We also consider this question in a more general setting of a symmetrically normed (not necessarily complete or separable) space affiliated with a properly infinite semifinite von Neumann algebra.
Read the full abstract

All authors J. Huang, M. Pliev, F. Sukochev, R. Xu

Robotics

A Vision Based Framework Integrating Attention and Action Cues for Interpretable Cognitive Workload Assessment in Human-Robot Collaborative Assembly

The introduction of human-robot collaboration (HRC) in industrial assembly operations is revolutionizing the manufacturing landscape. In this evolving environment, operators are required to seamlessly coordinate their manual tasks with real-time task information and robotic behaviors. These demands fluctuate during operation, yet conventional workload assessments depend on body-worn physiological sensors that complicate practical deployment. Here, we present a vision-based attention–action framework for continuous and interpretable workload-related assessment in HRC assembly. The framework combines RGB-D observations with robot states and calibrated task-related areas to construct a temporally confirmed representation of operator behavior. This representation identifies where task demand is concentrated and explains how it develops when attention and action diverge, the task context changes, or the operator hesitates. We evaluated the framework in a three-level collaborative gearbox assembly experiment with ten participants, using subjective ratings and synchronized physiological signals as independent references. Raw NASA-TLX ratings confirmed increasing perceived workload across conditions, with significant effects on overall workload and its mental and temporal dimensions. The vision-derived HRC-CWL output was significantly associated with ECG-derived features in seven of nine participants with complete correlation data. Synchronized interaction episodes further showed temporal correspondence between detected hesitation and physiological activity. Real-time deployment demonstrated that the framework can operate without requiring operators to wear additional sensors. These findings support HRC-CWL as an interpretable behavioral proxy for cognitive ergonomics analysis and adaptive robot assistance, rather than a direct psychophysiological measure of workload.
Read the full abstract

All authors Junyan Xiong, Naiyi Feng, Xingke Xia, Qihang Fan, Suchang Chen, Daqiang Guo

Mesoscale and Nanoscale Physics

Quasilocal transport in the integer quantised Hall effect: adiabatic separation, local Ohm's law, and Joule heating of the incompressible strips

We reassess the semiclassical route to integer quantum Hall transport around one idea: the separation of fast, quantised cyclotron motion from a slow, self-consistently screened guiding-centre landscape. Bohr–Sommerfeld quantisation of the canonical action fixes the Landau spectrum; smooth confinement turns it into Born–Oppenheimer surfaces with adiabatic parameter $\ell|\nabla V|/\hbar\omega_c$; screening supplies the self-consistent field. Transport is quasilocal, $R_H=\int\rho_Hj_y\,dx/\int j_y\,dx$ with $j_y\propto1/\rho_l$, so within the regularised local Ohm model the incompressible strips attract the current by weight and the computed Joule-power profile follows the current profile. In linear response the intrinsic electrostatic AC correction of the frozen-profile model is reactive, $\mathrm{Im}\,R_H\propto\omega$, with $\mathrm{Re}\,R_H-R_H^{\rm DC}\propto\omega^{2}$ below $10^{-9}$ up to $2$~MHz. With the current fed back into the electrostatics at $1$–$5\,\mu$A, where the Hall drop is one to five cyclotron gaps, the driven boundary condition breaks the reflection symmetry of the bar, the Hall drop concentrates in one strip (interchanged to $10^{-9}$ under current reversal), and the plateau narrows from its low-field flank while, for the GaAs parameters studied, its high-field edge stays at $\nu(0)=2$. A local transverse thermal closure inspired by Akera, evaluated as a post-process on the frozen profile with two phonon-loss laws, indicates that the narrow current-carrying strips of the low-field flank may heat by of order the lattice temperature; with the activated-heat-capacity closure the cold strip loses its stationary solution at model-dependent currents of $0.3$–$2\,\mu$A. The thermal conclusions are bounded by the loss law and by the frozen profile, and are presented as estimates.
Read the full abstract

Distributed Computing

ETCInfer: An Energy-efficient Thermal-aware Cooling-joint Scheduler for LLM Inference in AI Datacenters

Large language model (LLM) inference in AI datacenters creates a coupled control problem between GPU serving and facility cooling. Raising ambient temperature setpoints can reduce cooling energy and carbon, but also shrinks thermal headroom, induces GPU throttling, and leads to Service-Level-Objective (SLO) violations. In this paper, we study joint cooling–computing control for LLM inference: minimizing per-job GPU-plus-cooling energy while satisfying thermal safety and latency SLO constraints. We present ETCInfer, an energy-efficient, thermal-aware scheduler that selects a pre-job Computer Room Air Conditioner (CRAC) setpoint and adapts per-GPU frequency and micro-batch size during execution. ETCInfer builds compact physics-informed control models by calibrating GPU heat generation, chassis heat dissipation, CRAC power, and prefill/decode latency relations from telemetry. These models estimate hidden thermal states and time-to-throttle, enabling the scheduler to evaluate energy, temperature, and latency before applying an action. We formulate this joint setpoint–frequency–micro-batch control problem as a partially observable Markov decision process and design ETCAdapter, a learning-based controller that minimizes per-job energy under thermal safety and SLO constraints. We implement ETCInfer as a coordination layer over typical inference and cluster management stacks. Evaluation across real-trace simulation and validation experiments shows that ETCInfer reduces total job energy by up to 33.1%, thermal throttle exposure by up to 92.9%, and keeps SLO violation rates below 0.7% even at ambient temperatures up to $48^{\circ}\mathrm{C}$.
Read the full abstract

All authors Rui Lu, Rui Ge, Huanghuang Liang, Xiaobo Zhou, Dan Wang

Computer Vision

Pre-PEFT Probing: Weight Statistics and Perturbation Robustness for Layer Selection in VLM Vision Encoders

We propose a pre-fine-tuning probing method for Parameter-Efficient Fine-Tuning (PEFT) layer selection, aiming to obtain more stable and higher gains with fewer trainable parameters when adapting large vision–language models (VLMs). Unlike the common practice of applying LoRA and other adapters to all layers at once—where layer selection often relies on heuristic rules—we focus on the vision encoder and directly evaluate the "adaptability” of each Transformer layer. Specifically, we characterize each layer from two perspectives: (i) the statistical properties of its Q/K/V projection weights (e.g., norms and condition numbers); (ii) robustness under controlled parameter perturbations. We then systematically compare these indicators with the downstream performance gains brought by applying PEFT to a single layer. Across experiments covering seven benchmarks and five PEFT variants, we observe a consistent correlation: layers (or matrices) with larger weight norms and higher condition numbers are usually more robust to perturbations and are more likely to yield larger fine-tuning gains. These results show that distribution-statistics analysis and perturbation tests before fine-tuning can provide practical signals for adaptation-layer selection, thereby maintaining or improving performance while reducing trainable parameters.
Read the full abstract

All authors Qingtao Xia, Jiahua Bao, Siyao Cheng, Jie Liu