Peer Revenue Publish or profit

Papers

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

All of arXiv

Thursday 3 September

Software Engineering

Integrating Crash Report Mining and LLMs for Bug Localization and Repair: An Industrial Report

Analyzing crash-report bugs in large-scale industrial software systems requires substantial maintenance effort, particularly in production environments where developers must handle large volumes of crash reports and source code artifacts to localize and fix their root causes. While recent studies have shown that Large Language Models (LLMs) can assist with maintenance tasks, little is known about their effectiveness in supporting developers in analyzing crash-report bugs and repairing bugs associated with groups of crash reports in industrial settings. To address this gap, we investigate whether integrating crash report mining techniques—specifically stack trace clustering and suspicious file and method ranking—with LLMs can support crash localization and repair in production environments. We conduct a retrospective evaluation of five LLMs under four prompt configurations. After that, we chose the best model to run on 38 crash bugs collected from two large Java enterprise systems. We further analyze the structural characteristics and explanatory patterns of LLM-generated responses and assess localization and repair effectiveness through manual validation. Our results show that the best-performing configuration localizes up to 71% and correctly repairs 52% of crash bugs on the full dataset. These findings provide empirical evidence that combining crash report mining with LLM-based repair can effectively support debugging activities in industrial maintenance workflows.
Read the full abstract

All authors Marcos Medeiros, Uirá Kulesza, Christoph Treude, Daniel Lucena, Rafael Gomes, Roberta Coelho, Eiji Adachi, Rodrigo Bonifacio

Computation and Language

Safety for Whom? Boundary-Aware Self-Distillation for Controlled LLM Safety Refusal

Safety alignment is usually posed as a topic-level question: is this subject harmful? Deployments ask a narrower one. A civics tutor and a public-sector assistant may share a base model yet need different boundaries inside the same topic, refusing targeted political manipulation while still answering factual questions about the same election. We formulate this as narrow-boundary safety and introduce an offline self-generated framework combining controlled topic generation, coverage repair, in-distribution compensation data, and harmful-benign pairs for training and evaluation. Single-shot generation leaves 19.88% of prompts without accepted refusal traces, whereas escalating retries leave 0.20%. On political persuasion with Qwen3-8B, training on refusal data completed through Escalate increases target-domain refusal from 9.47% to 84.75% and reduces the mean unsafe-response rate across three broader harmfulness benchmarks from 26.26% to 0.14%, but increases XSTest over-refusal from 2.00% to 74.00%. In a separate matched comparison, replacing external responses with verified target-model responses reduces over-refusal from 15.20% to 5.20%. Boundary-pair data reduces comply-side over-refusal on held-out pairs from 32.94% to 4.16%, while harmful-side refusal decreases only from 91.88% to 87.72%. These results show that data composition controls the safety and usability trade-off, and that safety alignment should be evaluated on both sides of the intended refusal boundary.
Read the full abstract

All authors Alejo López-Ávila, Iker García-Ferrero, Jezabel Garcia, Antonio Tiene, Román Orús

Other Statistics

Statistical Theory in the Age of Machine-Assisted Mathematics

The computational revolution is advancing at an unprecedented pace. The combination of proof-assistant technologies and generative AI tools has recently enabled the solution of complex problems in pure mathematics at a scale that seemed unattainable only a few years ago, but they have not yet become standard tools in the development of statistical theory. In this paper we do not present new theoretical results; instead, we discuss five case studies involving classical problems in statistics and describe how a machine proof checker changes the thought process behind their proofs, in order to stimulate reflection on how these technologies may transform theoretical research and advanced statistical education. Statistical theory compresses mathematical content into expressions such as “under the usual regularity conditions”; once AI writes the proofs and machines check them, the human reader is left with the statement and its hypotheses, which is exactly what such expressions compress. Against the fear that automation erodes skills, our experience was the opposite: what changes is the job of the theorist, which moves from the steps of a proof to its statement. The new paradigm can have positive effect also on methodologists and applied statisticians, because these tools allow for quick and precise check of formal guarantees necessary to justify the application of a specific model and/or methodology. We draw consequences for refereeing, doctoral teaching, and we encourage a collective effort toward shared formal libraries for statistics. Just as high-level programming languages revolutionized empirical research, machine-assisted formalization may introduce a new paradigm for the development, verification, and communication of statistical theory.
Read the full abstract

Nuclear Theory

Astrophysical $S$-factors in primordial nucleosynthesis

The astrophysical $S$-factor plays an important role in extrapolating the laboratory cross section data to lower energies of relevance in nucleosynthesis calculations. Be it empirical fits or theoretical modeling of the $S$-factors, experimental information on the cross sections over a range of energies is essential to provide reliable $S$-factors and thereby the nuclear reaction rates which enter the nucleosynthesis networks. In view of the scattered and sometimes diverse data on the same reaction in literature and the databases, we present a compilation and review of available data from 318 references involving 371 experiments on the leading and sub-leading reactions in big bang nucleosynthesis (BBN). Salient features such as bumps at certain energies and a steep rise in the $S$-factor at low energies due to screening effects are found to vary in different experiments. The latter depends on the variation of targets and sometimes temperature to extract information on the same nuclear reaction. For instance, 45 cases in which the $S$-factor at low-energy could present electron screening-effect showed deviations from background values with features which are unique to each experiment, target and temperature. The extensive compilation, discussions of the relevance of each reaction in BBN and the features of the $S$-factors is followed by a presentation of empirical fits to the $S$-factors in some selected reactions of interest. This is a preprint of the following work: Carlos A. Salas and Neelima G. Kelkar, Astrophysical S-Factors in Primordial Nucleosynthesis, 2026, SpringerBriefs in Physics. It is the version of the author's manuscript prior to acceptance for publication and has not undergone editorial and/or peer review on behalf of the Publisher (where applicable). The final authenticated version is available online at: https://doi.org/10.1007/978-3-032-30466-7
Read the full abstract

Fluid Dynamics

Two-phase Temperature Reconstruction in Ice-Water Systems

What controls heat transport when liquid water interacts with ice? Answering this question is essential for understanding water bodies undergoing phase change. Yet experimental progress remains limited by the lack of a minimally invasive methodology for simultaneously resolving temperature fields in coupled liquid water and non-isothermal ice systems. Here, we introduce a physics-based data-assimilation method for reconstructing temperature fields in buoyancy-driven flows interacting with non-isothermal ice. Particle tracking velocimetry provides the liquid velocity field, while thermal and kinematic boundary conditions constrain the inverse problem. The method couples advection–diffusion in liquid water with conduction in ice to reconstruct simultaneous mean temperature fields and quantify heat transport across the water–ice interface, while remaining minimally invasive and compatible with free-surface systems. We demonstrate the method in laboratory experiments in which the temperature range across the liquid water in contact with ice drives cabbeling-induced convection. This framework enables investigation of coupled thermo-fluid dynamics in cryospheric aquatic systems, including heat exchange at the ice-water interface and liquid-phase energetics, with broader applications to phase-change processes in food and energy industries.
Read the full abstract

All authors Zhukun Wang, Daisuke Noto, Douglas J. Jerolmack, Hugo N. Ulloa

Distributed Computing

Performance Study of Serverless Workloads in Confidential Virtual Machines

Confidential serverless computing is rapidly emerg- ing as a critical paradigm for application domains requiring strong confidentiality guarantees, such as healthcare, finance, and machine learning. To enable this paradigm in untrusted cloud environments, Confidential Virtual Machines (CVMs) provide isolation by encrypting the entire guest memory, and thus securing serverless workloads against host-level access and inter- ference. However, the implications of CVMs for serverless systems remain insufficiently understood. This paper presents an empirical study of serverless work- loads in CVMs, systematically covering memory efficiency and runtime overhead on both warm-starts and cold-starts. Our results show that CVMs incur substantial memory overhead because encrypted memory disables cross-VM page deduplication and reduces memory reclaimability, thereby limiting warm- container capacity under a fixed memory budget. Runtime overhead in warm-starts is workload dependent. Workloads with frequent VMEXITs, particularly idle transitions, suffer substantial slowdowns. These slowdowns are further amplified by common serverless deployment practice that couples vCPU allocation to memory size, as higher-memory configurations expose more vCPUs than some functions can use effectively. For cold starts, the study focuses on container creation, a common and major contributor to startup latency. Motivated by the memory-efficiency results, we consider the deployments in which multiple containers of the same function are consolidated within the same CVM to improve efficiency, and show that selectively relaxing certain isolation mechanisms in this setting can substan- tially reduce startup overhead. These results clarify the main performance tradeoffs of confidential serverless computing and suggest practical ways to improve efficiency and latency.
Read the full abstract

Fluid Dynamics

Characterizing periodic orbits in two-dimensional Rayleigh-Bénard flows

Unstable periodic orbits and steady states are believed to form the backbone of spatiotemporal chaos and turbulence, yet their computation in thermally driven flows remains scarce for transitional regimes. In this work we compute and characterize a steady state and three families of periodic orbits in two-dimensional Rayleigh-Bénard at $\mathrm{Pr}=1$, near the transition to chaos. We find that in its route to chaos, the flow hops between several sets of orbits after becoming quasiperiodic. We use Floquet analysis to study the stability of the orbits obtained and characterize their bifurcations, showing how the appearance of primary and secondary frequencies, as well as phase-locking mechanisms, are all related to the dynamics of the orbits. We study in detail how the flow shadows the orbits found and determine in which regimes each orbit is dynamically relevant or not. Our analysis also reveals two important insights: (1) all symmetries are broken before the onset of chaos, and (2) this onset does not alter the behavior of the heat transport.
Read the full abstract

Artificial Intelligence

PerfReasoning: How Well Do LLMs Reason on Hardware Performance?

Performance modeling is central to hardware design and software optimization, yet constructing these models requires structured reasoning about computation, data reuse, storage, and movement. We introduce PerfReasoning, a benchmark that evaluates LLMs both as direct performance reasoners and as generators of analytical performance-model code. Given workload, architecture, and mapping specifications, models compare mappings and predict off-chip traffic and buffer requirements. The strongest closed-source models exceed 90% on reasoning-based Q&A, and the best open-weight model reaches 82.4%. However, model construction is substantially harder: while GPT-5.6 Sol exceeds 80% pass rate, all other model configurations average below 45% and vary markedly across runs. Task-specific RL raises a 4B model's mapping-reasoning accuracy by 15.7 points, whereas feedback-free multi-round self-revision prompting is not reliably effective. PerfReasoning exposes the gap between plausible architectural reasoning and reliable performance-model construction. We will publicly release the benchmark to support reproducible evaluation and track future progress.
Read the full abstract

All authors Dan Zhao, Karthikeyan Sankaralingam, Christos Kozyrakis, Qijing Huang

Cryptography and Security

Client-Side Probing of Deleted Ridge Statistics in Federated Unlearning

Federated unlearning aims to remove a client's data from a shared model without retraining from scratch. Some efficient systems make deletion exact by storing compact, additive summaries of the training features and broadcasting an updated linear classifier after every accepted change. We show that these broadcasts can also reveal the hidden summaries. A malicious client can submit known changes, use the returned classifiers to identify the server state, and compare states immediately before and after an isolated deletion. This exposes the deleted sample, class, or client summary and can enable its reinsertion. We characterize exactly when the observations contain enough independent information, give a matching optimal construction for unrestricted probes, and derive a more realistic estimator based on additions formed from the attacker's own data. On MNIST and CIFAR-10, high-precision broadcasts permit exact label recovery for every tested sample deletion with both probe types. Lower-precision broadcasts sharply reduce fine-grained recovery, and insufficiently diverse responses prevent identification altogether. Unrestricted probes are readily detected by their size; most individual attacker-data additions resemble honest batches, although we do not claim that the complete sequence is inconspicuous. The results identify a concrete privacy and integrity risk, its algebraic cause, and practical limits involving broadcast precision, update verification, response rate, and concurrent activity.
Read the full abstract

Cryptography and Security

Nebulon Enterprise Simulated Threats for Phishing Research (NEST-Phish): A Synthetic Enterprise Phishing Email Dataset for Behavioral and Machine-Learning Research

Phishing remains one of the most persistent cyber threats, yet publicly shareable datasets for studying phishing in realistic enterprise email settings remain limited. To address this gap, we introduce a synthetic enterprise phishing email dataset built around a fictitious organization, Nebulon. The dataset spans a broad set of workplace communication themes and includes matched synthetic legitimate and phishing emails with interpretable phishing-cue annotations. Here, “legitimate” denotes the non-phishing class, not legitimately occurring organizational emails. Human-subject categorizations and classifier evaluations show that the dataset supports meaningful variation in phishing judgments while also providing learnable signal for supervised detection. This publicly released resource is intended to support future work on phishing detection, human susceptibility, explainability, and benchmark development in enterprise-like contexts.
Read the full abstract

All authors Emily J. Winokur, Lauren S. Treiman, Allen G. Moore, Paul Schutte, Joe Ingram, Danielle N. Sanchez

Number Theory

A counterexample to the Chung-Graham-Spiro gap-set conjecture

Chung, Graham, and Spiro introduced slow Fibonacci walks and used them to partition the integers $n\ge2$ into two sequences, the down-integers and the up-integers. They studied the local spacing of these two sequences and conjectured that their $\ell$-step gap sets agree for every $\ell\ge1$. We show that the conjecture fails at $\ell=4$ by proving \[ 9\in U_4\setminus D_4 . \]
Read the full abstract

Instrumentation and Methods for Astrophysics

Identifying Casual SETI Transmissions and Ultra-Faint RFI with Cumulant Imaging

Techniques for identifying radio beacons transmitted by extra-terrestrial civilizations are well advanced. However, the casual broadband emission from standard radio communication is much harder to detect, and counter-intuitively casual Earth radio transmissions are becoming more difficult to identify as we more efficiently utilize the radio spectrum. In this paper we examine the electric-field statistics behind radio communication and re-conceptualize standard radio imaging as the first non-zero cumulant. This leads us to images of the higher cumulants where the natural stochastic emission from astrophysical sources disappears, leaving images of only modulated sources of radio communication. Faint SETI and RFI sources stand out in these cumulant images, enabling identification of faint communication that is undetectable with current techniques.
Read the full abstract

Optimization and Control

A bipolar fuzzy relation equation framework for clinical decision support systems

Clinical decision support frequently involves heterogeneous measurements, expert assessments, and guideline-based knowledge whose relationships to clinical decisions are gradual rather than purely binary. This paper develops a clinical decision-support framework based on bipolar fuzzy relational optimization, in which favorable and unfavorable clinical relationships are represented jointly through positive and negative fuzzy relational matrices together with a fuzzy requirement vector. The simultaneous participation of each decision variable and its complement in the relational constraints enables bipolar clinical information to be incorporated within a unified optimization model. The minimum \(t\)-norm is adopted to provide a noncompensatory, bottleneck-type interpretation of the interaction between fuzzy relational grades and decision levels. We characterize the feasible recommendation set by deriving clinical admissibility intervals and effective evidence activation sets, which provide the basis for feasibility analysis and systematic reduction of the relational system. The complete feasible set is then represented as a finite union of clinical recommendation regions associated with admissible Clinical Evidence-Assignment Functions. A region-wise optimal candidate is constructed for each admissible evidence assignment, and comparison of the resulting finite collection of candidates yields a globally optimal recommendation. An algorithm integrating feasibility analysis, system reduction, region-wise optimization, and global selection is developed and illustrated through a numerical CDSS example. The results show that bipolar fuzzy relational optimization provides a structured and mathematically rigorous mechanism for transforming fuzzy clinical relational information into feasible and optimized decision-support recommendations.
Read the full abstract

Functional Analysis

The phase diagram of injective-to-projective tensor distortion

For finite-dimensional Banach spaces $E$ and $F$, set \[ \rho(E,F):=\sup_{0\neq z\in E\otimes F}\frac{\pi(z)}{\varepsilon(z)}. \] The square growth of $\rho(\ell_p^d,\ell_q^d)$ was determined by Bonet, Defant, Peris and Ramanujan. We study the rectangular problem with the two dimensions varying independently. If $r=\min\{n,m\}$ and $\eta(t)=\min\{1/t,1/t'\}$, then, whenever $p$ and $q$ lie on the same side of $2$, \[ \rho(\ell_p^n,\ell_q^m)\asymp_{p,q} r^{1/2}\min\{n^{\eta(p)},m^{\eta(q)}\}. \] Thus the classical square exponent splits into two dimensional scales. In the mixed range $1\le p\le2\le q\le\infty$, writing $a=1/p$ and $b=1/q$, we obtain the lower estimate \[ \rho_{p,q}(n,m)\gtrsim_{p,q} \max\!\left\{r^{\min\{a+b,2-a-b\}}, m^{b-1/2}r^{1/2}\min\{n^{1-a},m^{1/2}\}\right\}, \] and the upper estimate \[ \rho_{p,q}(n,m)\lesssim_{p,q} \min\!\left\{n^{1-a}r^{1-b},m^b r^a,r\right\}. \] Moreover, if $(n-m)(a+b-1)\le0$, then \[ \rho_{p,q}(n,m)\asymp_{p,q} r^{\min\{a+b,\,2-a-b\}}. \] In the interior mixed range $1<p<2<q<p'$, if \[ \alpha_{p,q}:= \frac{(a+b-1)(\frac12-b)}{a-\frac12}, \] then \[ \rho_{p,q}(n,m)\lesssim_{p,q}m^{1-\alpha_{p,q}}, \qquad \sup_{n\ge1}\rho_{p,q}(n,m)\asymp_{p,q}m^{1-\alpha_{p,q}}. \] The corresponding statements in the reversed mixed range follow by duality and symmetry.
Read the full abstract

Probability

Consensus times for monotone aggregation dynamics

We study an asynchronous consensus dynamics on $N$ agents: at each step a uniformly chosen agent replaces its state by $f(Y_1,\dots,Y_r)$, where $f$ is a fixed monotone aggregation rule and $Y_1,\dots,Y_r$ are the states of $r$ agents sampled uniformly with replacement. Let $T$ be the first time at which all agents agree. Let $f:\{0,1\}^r\to\{0,1\}$ be monotone and non-constant. The expected consensus time is governed by the two endpoint degrees $D_0(f)=\#\{i:f(e_i)=1\}$ and $D_1(f)=\#\{i:f(\mathbf{1}-e_i)=0\}$, where $e_i$ is the $i$th standard basis vector and $\mathbf{1}$ the all-ones vector. If $D_0(f)\ne 1$ and $D_1(f)\ne 1$, then $E[T]=\Theta\bigl(N(1+\log d_f)\bigr)$, where $d_f$ counts the agents that must change state before the nearest attracting consensus is reached, so that $E[T]=O(N\log N)$ uniformly over initial states. If $f$ is a dictator, $E[T]$ is given by a voter-model formula and equals $\Theta\bigl(N^2 Ent(p_0)\bigr)$ with absolute constants, uniformly over the initial state, where $Ent$ is the binary entropy and $p_0$ the initial fraction of agents in state $1$. Otherwise exactly one of $D_0(f),D_1(f)$ equals $1$ and the other equals $0$. The worst-case expected consensus time is then $\Theta(N^{2-1/m})$, where $m\ge 2$ is the least number of coordinates that force the value $1$ in the residual rule of $f$, defined in the paper (of its dual, when $D_1(f)=1$).
Read the full abstract

General Relativity and Quantum Cosmology

Exact solution of the Klein-Gordon equation in a Kiselev black hole background

In this work, we investigate exactly the dynamics of a relativistic spinless particle influenced by a static and uncharged black hole surrounded by a quintessence-like anisotropic fluid or Kiselev black hole. Considering two quintessence-like models as examples, we calculate the radial wave function and determine, in both cases, the quasispectrum of energy, as well as the Hawking radiation and temperature. We find that the stronger the influence of quintessence-like anisotropic fluid, the smaller the radiation observed outside the event horizon. Furthermore, the temperatures obtained in both cases are directly influenced by the quintessence-like anisotropic fluid, and we recover the values obtained in other contexts, such as those derived using the surface gravity. Finally, in the absence of quintessence, we recover in both cases the Hawking temperature $T_{H} = 1/(8\pi k_{B} M)$ corresponding to the Schwarzschild black hole.
Read the full abstract

Machine Learning

Nested Inductive Bias Framework for SPD Manifold Learning

In Geometric Deep Learning, inductive biases serve two primary functions: enforcing manifold constraints and embedding relational priors. Currently, representation learning on SPD manifolds frequently relies on pullback Euclidean metrics, such as the Log-Euclidean Metric, to satisfy the former. While computationally efficient in avoiding domain boundary violations, these metrics induce a flat geometry that may fail to capture the intrinsic relational priors of datasets. While metrics such as the Poincaré metric are widely utilized to induce domain-aligned relational priors, generalizing them from standard vector representations to the SPD manifold has remained a challenge. To bridge this gap, we introduce a Nested Inductive Bias framework that utilizes a two-stage diffeomorphic composition to formally pull back non-Euclidean target geometries onto the SPD manifold. This framework enables the construction of curvature-aligned Riemannian classifiers that simultaneously respect matrix constraints and the latent relational geometry of the data. Empirical evaluations on kinematic and signal processing benchmarks, together with synthetic experiments, demonstrate that deep manifold networks experience degradation in class separability unless the metric curvature aligns with the intrinsic data distribution. Furthermore, for standard vectorized architectures, we propose the Rational Conformal Metric (RCM), designed to establish state-of-the-art geometric robustness against outliers by bounding the representation space.
Read the full abstract

Biomolecules

The physical foundation beneath protein generative modeling

Physical equations in protein modeling appear to have been replaced by generative models trained directly on structure data. By learning a mapping from noise to data, sampling de novo protein structures has become much more efficient. However, such models can also learn non-physical features and break down with out-of-distribution settings which are typical in protein design campaigns. In this review, we highlight where the physics persists in protein generative modeling pipelines and the issues that linger when physically relevant components of a macromolecular system are left unmodeled. We present a perspective that respecting the underlying physics of macromolecular systems, increasingly through learned representations that are physically grounded and updating generative models with experimental data, is foundational to generative modeling for functional protein design.
Read the full abstract

Robotics

Achieving Asymptotic Near-Optimality Without $\delta$-Similarity

Sampling-based motion planning algorithms are a popular class of trajectory planning algorithm due to their speed in complex, high-dimensional environments and ability to handle kinodynamic constraints, specifically through the use of forward dynamics propagation. Many such planners claim to achieve asymptotic near-optimality by proving the almost sure sampling of trajectories that are close to an optimal trajectory in the state space, known as $\delta$-similar trajectories. This paper shows that the proof behind asymptotic $\delta$-similarity relies on an unstated assumption that $\delta$-similar trajectory segments will always be kept once sampled. This assumption does not hold in general. A problematic case, referred to as “crowding out,” is described, where locally low-cost paths prevent trajectories that are $\delta$-similar to the optimal trajectory from being added to the tree. It is shown, however, that asymptotic near-optimality guarantees can still be achieved without guarantees of $\delta$-similar solution trajectories when crowding out is properly accounted for. An example environment and system are provided where crowding out is shown to occur, demonstrating a scenario where inductively sampling a $\delta$-similar solution trajectory is impossible.
Read the full abstract

Computation and Language

Shared circuits predict whether LLMs generalize across formats in arithmetic reasoning

In many forms of reasoning, including arithmetic reasoning, generalizing across superficial changes in input format is effortless for humans: anyone who can solve 2+5 can also solve 'two plus five'. In contrast, LLMs are more brittle to surface variations of the prompts: for example, they solve numeric arithmetic problems almost perfectly but are substantially less accurate on verbal renditions of the same problems. Here, we ask whether generalization across formats can be predicted from the models' internals. Using attribution patching, we first independently localize the circuit that each model recruits to solve numeric arithmetic problems (2+5) vs. verbal ones, in three languages: English ('two plus five'), Spanish ('dos más cinco'), and Italian ('due più cinque'); then, we test whether overlap with the model's own numeric circuit predicts its generalization to the verbal formats. Indeed, we find support for this idea at three levels: circuit overlap accounts for the relative difficulty of the three verbal formats, for which models generalize best, and for which items are solved correctly, rivaling supervised probes while requiring no labeled data.
Read the full abstract

All authors Andrea Gregor de Varda, Sana Pandey, Pengrui Han, Jacob Andreas, Evelina Fedorenko

Quantum Physics

A Representation-Theoretic Framework for Characterizing Barren Plateaus

The scalability of variational quantum algorithms is fundamentally limited by the barren plateau effect, where the cost-function variance vanishes with system size, rendering optimization impractical. Recent Lie-algebraic approaches for deep parameterized have enabled a unified analytical understanding of this challenge but require either the initial state or the measurement observable to belong to the dynamical Lie algebra generated by the circuit. Here, we introduce a representation-theoretic framework under $2$-design hypothesis showing that variational quantum landscapes admit a natural decomposition into irreducible representation channels. This yields exact expressions and analytical bounds for the cost-function variance applicable to arbitrary initial states and observables, with previous Lie-algebraic results emerging as a special case. We illustrate the framework by analyzing the energy landscape of the one-dimensional ANNNI model for several circuit architectures, revealing trainability regimes inaccessible to existing methods. Our results establish a general representation-theoretic framework for analyzing variational quantum landscapes, substantially extending the analytical theory of barren plateaus.
Read the full abstract

Neurons and Cognition

A Roadmap for MEG Foundation Models

Foundation models are beginning to reshape brain-signal analysis by moving the field beyond task-specific decoding pipelines toward reusable models pretrained on broad neural datasets. Magnetoencephalography (MEG) is a compelling but still underdeveloped target for this shift: it captures human cortical dynamics at millisecond resolution while offering stronger spatial interpretability than EEG, making it especially valuable for source-resolved studies of perception, language, cognition, and clinical brain function. Yet MEG foundation models remain at an early stage, with only a small number of MEG-specific and MEG-inclusive multi-modal models, modest pretraining corpora, and emerging but still limited benchmarks. This perspective lays down the basic concepts needed to understand MEG foundation models and provides a didactic overview of the field's key design choices, including tokenization, sensor- versus source-space representations, sensor-geometry encoding, backbone architectures, self-supervised objectives, and pretraining data. We then offer a roadmap for future development, organized around native MEG pretraining, adaptation of EEG foundation models, transfer from generic time-series models, and multi-modal integration with EEG, fMRI, MRI, behaviour, and stimulus features. We highlight the need for coordinated infrastructure, including diverse and reusable MEG datasets, rigorous evaluation across subjects, sites, tasks, and clinical settings, and responsible data-sharing practices that address consent, privacy, access, and governance.
Read the full abstract

All authors Philipp Thölke, Hamza Abdelhedi, Yorguin Mantilla-Ramos, Fouad Lbakali, Oumayma Gharbi, Catherine Duclos, Annalisa Pascarella, Vanessa Hadid, Oiwi Parker Jones, Karim Jerbi

Optimization and Control

Distributed risk-averse optimization via CVaR

Distributed systems often operate under uncertainty, where minimizing expected loss may overlook rare but severe events. This paper studies a distributed risk-averse convex optimization problem in which agents cooperatively minimize the average of local conditional value-at-risk (CVaR) objectives over a time-varying network. Each agent has access only to noisy evaluations of its local loss function, rather than to its CVaR objective or gradient. We therefore develop a zeroth-order algorithm that uses sampled losses to construct empirical CVaR estimates and their gradient estimates. At each iteration, agents combine neighboring decisions and perform a local update. Under convexity and Lipschitz continuity assumptions, we prove that the agents reach exact asymptotic consensus. We also establish a finite-time expected suboptimality bound for the weighted ergodic iterate. With diminishing step sizes and fixed sample sizes, the local last iterates converge almost surely to a common optimum, and their limiting expected CVaR gap is bounded in terms of the smoothing and finite-sample errors. This distributed bound matches the parameter dependence of the centralized benchmark provided in this paper. Finally, simulations on a distributed sensor network estimation problem illustrate the efficacy of the method.
Read the full abstract

All authors Siyi Wang, Kun Huang, Lei Xu, Karl H. Johansson

Quantum Physics

Efficient Quantum Error Correction from Three Dimensional Qubit Control

High-rate quantum low-density parity-check (qLDPC) codes can substantially reduce qubit overhead relative to surface codes, but their advantage depends on efficiently realizing nonlocal syndrome extraction. We study the \([[144,12,12]]\) bivariate bicycle code on a neutral-atom architecture with native three-dimensional (3D) geometry, comparing planar and 3D embeddings while holding the code fixed. We characterize spatial efficiency using the logical-qubit density, defined as the number of encoded logical qubits per unit spatial footprint. Because the optical controller's field of view limits the transverse extent of an array, this metric estimates the number of logical qubits that can be accommodated within a fixed optical field of view. The 3D embedding achieves approximately \(4\times\) greater areal logical-qubit density than the planar layout and \(42\times\) greater than a surface-code baseline. It also reduces the bivariate bicycle syndrome-extraction time by roughly \(2\times\) compared to a planar baseline, with fewer movement operations and substantially shorter atom-transport distance. Native 3D geometry can improve both the packing density and executable realization of nonlocal qLDPC codes, making practical performance depend jointly on code structure, optical geometry, transport scheduling, and hardware-level noise. This motivates further development of control techniques in 3D.
Read the full abstract

Machine Learning

On-board ML for Trace Gas detection in Imaging Spectroscopy data

Data collected during aerial and spaceborne imaging spectroscopy campaigns enables the detection of transient events such as trace gas emissions. However, current processing pipelines depend on slow, on-the-ground processing, which delays the time to information of each detected event and prohibits immediate follow-up actions. During the Tokyo Field Campaign of March 2026, we explored on-board processing of Imaging Spectroscopy data from the equipped AVIRIS-5 sensor. Due to communication bottlenecks, full datacubes cannot be downlinked immediately during the flight. Instead we downlink the potential events predicted by our efficient and small machine learning model. We show the first on-board detection of methane point source emission with Imaging Spectroscopy data using Edge ML.
Read the full abstract

All authors Vít Růžička, Adam Chlus, Andrew Thorpe, David R. Thompson

Quantum Physics

Towards minimal conditions for ergotropy injection in open quantum systems

Interactions between a quantum system and its environment can inject ergotropy into the system, raising the question of the minimal dimensionality and physical resources required for such injection. We first show that ergotropy injection is impossible under thermal operations when both the system and environment are qubits, whereas it becomes possible when the environment is enlarged to a qutrit. We further show that already in the qubit-qubit setting, relaxing environmental thermality and allowing interactions between system and environment allows ergotropy increment under energy-conserving unitaries. To elucidate the role of interactions, we consider a two-qubit isotropic XY interaction Hamiltonian and identify its distinct degeneracy regimes. We show that, in the central-block regime, when both the initial system and environmental states are incoherent, no ergotropic gain is possible when the environment is initially thermal, irrespective of the interaction strength. In contrast, environmental athermality in the form of population inversion, while retaining incoherence, enables ergotropic injection. We derive the optimal ergotropic gain and show that environmental coherence can enhance it, while system coherence alone need not be beneficial and can even reduce the gain. We further consider the double-degenerate regime, characterized by a finite interaction strength, and demonstrate positive ergotropic gain even for a thermal environment.
Read the full abstract

Analysis of PDEs

The Erdős similarity conjecture and Rajchman measures

Let $A\subseteq\mathbb{R}$ support a probability measure whose Fourier–Stieltjes transform tends to zero at infinity. We prove that, for every $\varepsilon\in(0,1)$, there is a closed, $1$-periodic, nowhere dense set $E\subseteq\mathbb{R}$ such that \[ m(E\cap I)\ge1-\varepsilon \] for every interval $I$ of length $1$, while $E$ contains no affine copy of $A$. Thus every set supporting a Rajchman measure satisfies the Erdős similarity conjecture in a uniform large-set form. The proof combines equidistribution modulo one for large dilates of the measure with a multiscale family of low-density periodic blockers; no quantitative rate of Fourier decay is used. We also refine a classical theorem of Ivašev-Musatov, showing that for every Hausdorff gauge $h$ there is an $h$-null compact Rajchman support $K$ satisfying \[ \overline{\dim}_{\mathrm B}^{\log} K=\dim_{\mathrm P}^{\log} K=1. \] The value $1$ is sharp for both dimensions.
Read the full abstract

All authors A. Iosevich, N. Kulkarni, N. Mora Cuéllar, I. Rojas Aravena, A. Yavicoli

Audio and Speech Processing

Brain2Speech-Net: Fast and Intelligible Brain-to-Speech Synthesis Without Text Decoding

The loss of speech limits communication for individuals with paralysis. Direct neural-to-speech synthesis is challenging due to the limited availability of neural data for training speech brain-computer interfaces. Most existing systems rely on cascaded neural-to-text-to-speech pipelines, which increase inference latency and propagate errors across stages. We present Brain2Speech-Net, a single-stage neural-to-speech generation framework without intermediate text decoding. We use a differentiable phoneme bottleneck and a deep-HMM alignment mechanism to map long neural recordings into the latent space of a text-to-speech (TTS) model, enabling high-quality speech synthesis. Brain2Speech-Net is the only system in our comparison that produces intelligible speech while generating faster than real time.
Read the full abstract

All authors Shreeram Suresh Chandra, Zexin Cai, Yu Tsao, Simon King, Berrak Sisman

Computer Vision

Topology-Aware Training and Spatial Diagnostics for Fiber Bundle Segmentation in Tracer Histology

Anatomic tracer studies reveal how axon bundles project from an injection site, branch into smaller groups of axons, and course through the brain to reach their destinations. Histological data from such studies provide anatomical reference information for validating diffusion MRI tractography. However, manual annotation of the histological data is very labor-intensive, and although automated segmentation methods have been proposed, they rely mainly on pixel-overlap losses such as BCE and Dice; topology-aware loss functions have not been studied for this task. We compare BCE-Dice, clDice, Betti matching, and Topograph for fiber bundle segmentation in macaque tracer histology using a frozen DINOv3 backbone. To our knowledge, this is the first exploration of foundation-model features for this task. BCE-Dice achieved the highest Dice, while clDice achieved the highest bundle recall but poor mask overlap. Topograph had similar Dice to BCE-Dice, the lowest $\beta_0$ error, and fewer false positives than BCE-Dice and Betti matching. Fiber bundle segmentation methods are typically evaluated with a permissive rule that counts a bundle as detected given any overlap with the prediction. We show this rule does not capture oversegmentation, and that per-section TPR can be inflated by empty sections assigned perfect recall. To quantify this, we introduce Excess32, a spatial diagnostic measuring predicted pixels outside a 32-pixel tolerance band around annotated bundles. In validation, a Betti-Topograph union raises sparse-bundle TPR from 0.818 to 0.933, but worsens FDR from 0.296 to 0.509, Excess32 from 0.108 to 0.466, and area ratio from 0.94 to 3.34. These results show detection metrics alone are insufficient to characterize segmentation quality.
Read the full abstract

All authors Joselyn Romero Avila, Kyriaki-Margarita Bintsi, Ermias Habte, Julia F. Lehman, Suzanne N. Haber, Anastasia Yendiki