Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Thursday 10 September

Machine Learning

Prevalence Determines Precision:Silent Contamination in Detector-Defined Datasets

Many ML datasets are constructed by running a detector, heuristic, or model over candidate pools; accepted items become labels. Dataset precision is then governed by true-positive prevalence in each pool via Bayes, not solely by detector quality. Using one instrument and period, we hold a detector-defined event dataset plus an independent official index labeling every detected item as real or phantom. One detector, three pools yield phantom rates 81.7%, 9.0%, and 0.0%. Transferring precision from the two high-rate pools to the low-rate pool predicts 0.955 versus measured 0.183, a +422% error; the Bayes expression predicts all three within 3.3%. The detected response curve is an exact convex combination of a true-event and a phantom component (residual 1.1e-16), with phantoms outnumbering true events 473 to 308, so contamination is a second signal with detector-inherited shape, not additive noise. Contamination direction depends on the estimator: on identical windows one statistic is diluted and another inflated because its denominator is also contaminated. A common normalization turns the estimator into a mean of ratios whose expectation need not exist; on the same 335 events it returns 0.40 where the well-defined estimator returns 0.10.
Read the full abstract

High Energy Physics (Theory)

The Casimir effect in Gribov-Zwanziger theory

We consider Yang-Mills theory with two infinite parallel plates, separated by a distance \(L\), that are perfect magnetic conductors (PMC) or perfect electric conductors (PEC). Recently, it was shown that the Gribov copy problem persists in such a setting. We then study the Gribov-Zwanziger (GZ) action in the presence of those boundaries using functional integral methods. Lagrange multiplier fields allow one to lift the boundary conditions into the action, after which the boundary modifications to the gluon propagator can straightforwardly be determined. In the PEC case, we provide evidence that, even when translation invariance is (partially) broken, the usual horizon term in the GZ action still restricts the functional integral to the Gribov region. We compute the Casimir energy for GZ with PMC or PEC plates, both directly from the functional integral and from the energy-momentum tensor, obtaining consistent results. We compare our analytical results with recent lattice data, in both 4D and 3D. A priori, one might expect that the boundary-modified gluon propagator introduces new \(L\)-dependencies into the GZ gap equation. This would make the Gribov mass \(\gamma\) dynamically dependent on \(L\), implying an interesting interplay with the Casimir energy. However, we show that no such dynamical \(L\)-dependence occurs within the current approximation.
Read the full abstract

All authors David Dudal, Philipe De Fabritiis, Sebbe Stouten, David Vercauteren

Audio and Speech Processing

Investigating catastrophic forgetting in sound event classification

This work investigates a number of approaches to prevent catastrophic forgetting in class incremental learning scenarios for sound event classification tasks. We analyze the problem using architectural and regularization approaches, using FSD50K and AudioSet datasets. We design incremental stages and solutions that selectively protect the kernels of the network from weight updates to prevent catastrophic forgetting, and a dynamic head solution that expands itself each time a new task is learned. The findings show that catastrophic forgetting mainly happens in deeper layers, in particular in the classifier head. For the studied in-domain sound classification problem, the solution that seems to alleviate catastrophic forgetting and is the most efficient is a full freezing of the feature extractor with a fine-tuning of the dynamic head classifier, showing little to no forgetting and great training stability, and a good balance between memory-stability and learning plasticity.
Read the full abstract

Artificial Intelligence

Calibration-Aware Uncertainty Cascades for Efficient Heterogeneous Model Collaboration

Heterogeneous model collaboration seeks to exploit the complementary strengths of different models to balance predictive performance and inference cost. Existing approaches typically rely either on trained routers, which tie routing decisions to a fixed task and model pool, or on raw-confidence cascades, whose thresholds lack consistent reliability semantics across heterogeneous models. Consequently, these approaches adapt poorly to changing model pools and deployment budgets. We propose Calibration-Aware Uncertainty Cascades (CAUC), a simple post-hoc framework that independently calibrates each model's confidence and selects deployment policies using validation data. The resulting calibrated confidence scores establish a common reliability scale for accepting an early prediction, invoking a stronger model, or selectively combining model outputs. This unified decision criterion decouples deployment policies from any particular model pool or operating budget. We further show theoretically that calibration gives confidence thresholds an explicit selective-risk interpretation, whereas uncalibrated scores offer no comparable reliability guarantee. Extensive experiments demonstrate that, across six language benchmarks, CAUC achieves an average relative accuracy improvement of 1.9% over strong-model-only inference while avoiding approximately 47% of strong-model calls. On image classification benchmarks, it maintains or improves predictive performance while reducing measured GFLOPs by up to 57%.
Read the full abstract

All authors Yilin Zhang, Han Jiang, Cai Xu, Ying Liu, Wei Zhao

Robotics

FARM: Reading Failure Signals from the Internal Predictive States of a Frozen Robotic World Model

Reliable robot deployment requires online failure monitoring, yet existing monitors mainly derive risk from proxy signals or train dedicated monitoring components. We ask whether the internal predictive states of a frozen pretrained robotic world model already contain directly decodable failure information. Failure-Aware Readout from World Models (FARM) trains only a 33,985-parameter supervised readout over frozen VLA-JEPA predictive states, producing step-wise failure scores and causal trajectory risk. Five-fold out-of-fold evaluation across seven source tasks reaches 85.68/88.59 pooled AUROC/AUPRC, and FARM gives the best Seen performance among 15 matched baselines on the 10-task benchmark. Across four real-robot populations on PIPER X, SO-101, and Franka, fixed-readout transfer and readout-only adaptation test deployment shifts without updating the predictive backbone. FARM also discriminates failures from partial causal histories and adds 0.2256 ms mean CUDA latency once the frozen state is available. These results support frozen predictive world-model states as reusable features for causal, transferable, and low-overhead execution monitoring.
Read the full abstract

All authors Haoran Pei, Mingrui Luo, Senbao Wang, Haoran Lv, Jie Guo, Sheng Zhong, Ruixi Ci

Analysis of PDEs

Sharp lower bounds for the volumes of nodal and positivity sets of harmonic functions

Let $B=B(p, 1)\subset\mathbb{R}^n$ be a unit ball and $n\ge 3$. We prove that there are positive constants $c$ and $C$, depending only on $n$, such that every non-zero real-valued harmonic function $u: 4B\to \mathbb{R}$ with $u(p)=0$ satisfies $$ \mathcal{H}^{n-1}\bigl(\{u=0\}\cap 2B\bigr)\ge C\mathcal{N}, $$ and $$ \mathcal{H}^n\bigl(\{u>0\}\cap {\frac 12}B\bigr) \ge c\bigl(\log(1+\mathcal{N})\bigr)^{1-n}, $$ where $\mathcal{N}$ is the doubling index defined by $$\mathcal{N}=\log_2\frac{\sup_{B}|u|}{\sup_{\frac{1}{2}B}|u|}.$$ The first estimate confirms a folklore conjecture on the nodal volume of harmonic functions, and its linear dependence on $\mathcal{N}$ is optimal. The second estimate extends the planar result of Nazarov, Polterovich, and Sodin to higher dimensions, and the logarithmic order is optimal. As a further consequence of the ideas developed in the proof, we obtain an alternative proof of Nadirashvili's conjecture that does not rely on the multiscale analysis.
Read the full abstract

Numerical Analysis

PH2T-splines, Part I: A Reasonable Mesh Assumption

This paper is the first in a three-part series on the construction of polynomial splines with the highest order of smoothness over hierarchical T-meshes, referred to as $\PHtwoT$-splines. For splines of bi-degree $(d,d)$, we study suitable refinement conditions for the subsequent basis construction, which requires dimensional stability of the underlying spline space. We present two groups of examples, considering unrestricted hierarchical refinement and refinement without vanishable T $l$-edges, respectively. The first setting permits new edges without additional degrees of freedom. In the second group, every refinement level excludes vanishable T $l$-edges and increases the dimension. Nevertheless, the dimension is unstable in both groups. We then introduce template translations to describe each refined region as a union of translates of a fixed template in the cell-index grid. Together with the known stability result under $(d-1)\times(d-1)$ template refinement, these examples justify this condition as a reasonable mesh assumption for the subsequent $\PHtwoT$-spline construction.
Read the full abstract

Cryptography and Security

Chypothermia: Clock Freezing for Static Side-channel Attacks

Static side-channel attacks, which exploit halted-clock conditions to extract sensitive information, pose an increasing threat to chip security. To counter these attacks, various defenses have been proposed that monitor for abnormal clock behavior and trigger the clearing of sensitive data when clock anomalies are detected. In this work, we demonstrate that exposing a chip to cryogenic temperatures interferes with on-chip mixed-signal components, responsible for signal sensing and generation. Based on this observation, we develop Chypothermia, an attack that, without any electrical tampering with the system, disables the target clock sensor, the clock generation circuit, and the voltage sensors, while preserving the secret data. While effective at halting the clock, cooling is a slow process and, on its own, is often insufficient against systems equipped with temperature sensors designed to detect thermal anomalies. To bypass these protections, we combine Chypothermia with Chypnosis (Mitard et al., IEEE SP 2026) and show that, even within a moderately low-temperature operating range, this combination can halt the clock while evading detection. We implement Chypothermia on multiple FPGA/SoC platforms and demonstrate successful disabling of both soft-IP and hard-IP sensor implementations. Finally, we apply Chypothermia to the alert handler of the OpenTitan root of trust, which incorporates a state-of-the-art clock sensor, and show that the attack evades detection and prevents key zeroization. Finally, we introduce and implement an FPGA-compatible self-heating sensor as a countermeasure and demonstrate its robustness against Chypothermia.
Read the full abstract

All authors Fatemeh Khojasteh Dana, Mehmet Ali Cetin, Xinrui Wang, Andrew Butler, Yuval Yarom, Shahin Tajik

Materials Science

Vacancy Order and Physical Properties of a Ternary Compound Fe0.68Pd0.80Te with an {\alpha}-Fe1+xTe-Type Structure

We report the identification and characterization of a new compound Fe0.68Pd0.80Te with an {\alpha}-Fe1+xTe prototype structure. Different from the Fe-square net and minor occupancy of interstitial Fe-sites in Fe1+xTe, Fe0.68Pd0.80Te is featured by a Pdsquare net and near 68% occupancy of the corresponding interstitial Fe-sites. Furthermore, noncontact atomic force microscopy and X-ray diffraction provide evidence for the existence of a 3*3*3 Pd-vacancy order in this layered material. A spin-glass ground state below Tg 40 K is identified via magnetic characterization. Electrical transport measurements show that Fe0.68Pd0.80Te is a semiconductor with a very small band gap below 10 meV. It has weak negative magnetoresistance and holelike charge carriers below room temperature. Our results demonstrate its potentials for further exploring various quantum phenomena.
Read the full abstract

All authors Bingxian Shi, Manyu Wang, Chenglin Shang, Yanyan Geng, Yangyang Fan, Xiaoxiao Pei, Li Huang, Daye Xu, Juanjuan Liu, Jinchen Wang, Hongxia Zhang, Hongliang Wang, Lijie Hao, Rui Xu, Zhongyi Lu, Zhihai Cheng, Peng Cheng

Signal Processing

Optimizing GEDI Simulator Configuration for European Temperate Forests

Accurate estimation of aboveground biomass density is essential for quantifying forest carbon stocks. NASA's GEDI mission provides valuable canopy structure data, but its sparse sampling necessitates the use of simulators to calibrate biomass models at field inventory locations. The widely used simulator of Hancock et al. (2019) emulates GEDI waveforms from airborne LiDAR point clouds, yet it has never been validated over European temperate forests. Here, we compare approximately 8,100 pairs of observed and simulated GEDI relative height (RH) profiles across French forests using the national airborne LiDAR program as input. We separate two sources of error: waveform modeling differences, assessed by referencing both simulated and real RH metrics to a common ALS-derived ground elevation, and ground detection bias, evaluated by comparing each GEDI L2A processing algorithm against the ALS reference. Under the baseline configuration, the mean absolute bias across the full RH profile reaches 0.67 m in leaf-on and 1.20 m in leaf-off conditions. Switching to intensity-based return weighting and selecting the a3 L2A algorithm reduces these biases to 0.43 m and 0.42 m respectively. The a3 algorithm also achieves near-unbiased ground detection (+0.04 m versus -0.82 m for the default), directly reducing a previously overlooked source of error. We also show that leaf-off acquisitions and low-sensitivity shots, both typically excluded from standard biomass products, are simulated as reliably as their counterparts, substantially expanding the potential calibration and inference datasets.
Read the full abstract

All authors Selim Behloul, Nikola Besic, Steven Hancock, Cedric Vega, Sylvie Durrieu, Jean-Pierre Renaud, Ibrahim Fayad, Philippe Ciais

Computer Vision

Multi-Modal Controlled Coherent Motion Generation

It is natural for humans to walk and talk simultaneously. This paper tackles the challenge of replicating such natural behaviors in 3D avatar motion generation driven by concurrent multimodal inputs, such as a text description of a man walking alongside speech audio. Existing methods, constrained by the scarcity of aligned multimodal data, typically combine motions from individual modalities sequentially or through weighted sums. However, they often result in mismatched or unrealistic movements. To overcome these limitations, we propose MOCO, a novel diffusion-based framework capable of processing multiple simultaneous inputs, including speech audio, text descriptions, and trajectory data, to generate coherent and lifelike motions without requiring aligned multimodal data. Our key innovation lies in decoupling the motion generation process. During each denoising step, the diffusion model independently generates motions for each modality from the input noise and assembles the body parts according to predefined spatial rules. The resulting combined motion is then diffused and serves as the input noise for the subsequent denoising step. This iterative approach enables each modality to refine its contribution within the context of the overall motion, progressively harmonizing movements across modalities. Consequently, the generated motions become increasingly natural and fluid with each iteration, achieving coherent and synchronized behaviors. We evaluate our approach using a purpose-built multimodal benchmark. Experimental results demonstrate that MOCO outperforms existing baselines, advancing the field of multimodal motion generation for 3D avatars.
Read the full abstract

All authors Yifei Liu, Qiong Cao, Hongwei Yi, Huaiguang Jiang, Changxing Ding

Geometric Topology

Trace Coordinates and Local Fenchel–Nielsen Parameters in Real Hyperbolic 5-Space

We study representations of fundamental groups of closed orientable surfaces into \(\mathrm{SL}(2,\mathbb{H})\), whose projectivization \(\mathrm{PSL}(2,\mathbb{H})\) is the group of orientation-preserving isometries of real hyperbolic \(5\)-space, with the aim of developing a quaternionic analogue of Fenchel–Nielsen theory. We give a normal form for pairs of regular loxodromic elements with disjoint fixed point sets and show that, on an open dense generic locus, the corresponding moduli space is \(15\)-dimensional. We also associate fifteen word traces whose differentials are linearly independent on an open dense subset and hence give local real-analytic coordinates there. For a pair of pants with prescribed regular loxodromic boundary conjugacy classes, we show that the relative deformation space is locally \(6\)-dimensional. Combining this internal pants data with the three-dimensional boundary conjugacy data and the three-dimensional centralizer gluing freedom gives a local parameter decomposition for closed surface group representations. For a closed surface of genus \(g\), this yields \(30g-30\) real parameters.
Read the full abstract

Combinatorics

Rainbow connecting $2$-colorings of super-Dirac graphs

Let $G$ be a graph with minimum degree $\delta(G)\ge|V(G)|/2$. Can we color the edges of $G$ with red and blue so that every pair of non-adjacent vertices is connected by a path consisting of exactly one red edge and one blue edge? We provide an affirmative answer to this question for a class of graphs that are “close” to a complete balanced bipartite graph or the disjoint union of two cliques of the same order. Surprisingly, our methods extend to a much broader class of graphs with minimum degree slightly above $|V(G)|/2$. Furthermore, we answer an asymptotic version of this question in full, proving that every graph $G$ satisfying $\delta(G)\ge(|V(G)|-1)/2$ has a $2$-edge-coloring such that almost all pairs of vertices are connected by a rainbow path. In addition, we propose a number of related open problems.
Read the full abstract

Systems and Control

A Primal-Dual Formulation for Pricing Static Voltage Stability Services within a Unit Commitment Model

In modern power systems with high penetration of Inverter-Based Resources (IBR), most converters operate in Grid-Following (GFL) mode. Some buses exhibit inherently low Short-Circuit Ratios (SCRs), a property majorly shaped by network topology. The integration of GFL-IBR onto such weak buses thus demands attention to static voltage stability. To address this issue, market mechanisms have been proposed to incentivize generators to provide voltage stability services, such as commitment of synchronous generators for reducing the equivalent impedance at low SCR buses and adaptive reactive power support from GFL-IBR. To compute shadow prices for these services, previously proposed methods such as the `restricted' and `dispatchable' approaches may fail to guarantee operating cost recovery for voltage-stability service providers. As the resulting prices are determined purely from a social surplus maximization objective, the profitability of units is entirely overlooked. This suggests that new pricing methodologies are needed to satisfy cost-recovery requirements. Therefore, this paper proposes a pricing method based on a primal-dual formulation. Case studies demonstrate that the proposed method can consistently produce revenue-adequate shadow prices, enabling all participating units to recover their costs without supplementary uplift payments.
Read the full abstract

Probability

The continuous Derrida-Retaux branching process in the Brownian CRT

The Derrida-Retaux continuous branching process, which is conjectured to be the scaling limit of the corresponding discrete model and of many other critical hierarchical renormalization models, is a process of cells evolving inhomogeneously on the time interval $[0, 1)$ via linear growth of each cell and independent splitting of cells at a specific rate. In this article, we show that the Derrida-Retaux continuous branching process is, on the one hand, encoded by a family of processes converging to a Brownian motion and on the other hand, fully obtained from the continuum Brownian tree encoded by the limiting Brownian path by time reversal and through length erasure of this tree. This direct representation explains the specific laws governing the significant quantities featuring the model (total mass, number of cells, law of large numbers) and provides a better understanding of its dynamics.
Read the full abstract

Graphics

Hologram Representation via Quadratic Phase Gaussian Splatting

We introduce Complex-Valued Quadratic Phase Gaussian (CVQPG), a novel hologram representation method that augments each 2D Gaussian primitive with a quadratic phase profile controlled by a learnable curvature parameter. Against the planar Gaussian baseline, CVQPG improves the average PSNR of holographic reconstructions by 0.19 dB (RGB) and 0.33 dB (grayscale) at equal primitive counts, and by 0.05 dB (RGB) and 0.08 dB (grayscale) at equal parameter counts, where it still leads in all visual quality metrics. Our frequency-domain analysis shows that CVQPG better preserves the mid-to-high frequency band of natural images, where the reconstruction MSE drops by up to 11% (RGB) and 22% (grayscale), indicating that modulating primitive wavefronts is an effective and lightweight enhancement.
Read the full abstract

All authors Haolong Wang, Yicheng Zhan, Kaan Akşit, Simeng Qiu

Robotics

Safety-aware Skill Adaptation for Reinforcement Learning in Dynamic Environments

Skill adaptation frameworks based on reinforcement learning often require restrictive assumptions to maintain stability, such as fixed observations or tightly controlled exploration schedules. In cluttered and dynamic environments, however, unrestricted exploration can lead to unsafe behaviour and unstable learning, particularly when task-relevant observations lie near obstacles or involve moving objects. In this work, we present Dist-GPRL, a distance-aware and safety-guided reinforcement learning framework for structured robot skill adaptation. Building upon Gaussian Process (GP)-based skill parameterisation, our framework sequentially adapts overlapping local windows of sparse trajectory via-points rather than modifying the complete skill at every policy step. Raw policy outputs are correlated through the GP covariance structure, producing temporally coherent trajectory updates while reducing the action-space and credit-assignment difficulties associated with global trajectory adaptation. Safety is incorporated through two complementary forms of guidance. A safe-subspace prior derived from the Hausdorff Approximation Planner (HAP) biases policy exploration toward feasible regions, while dynamically updated distance field clearance and gradient rewards provide local obstacle awareness. A trajectory-kinematics similarity regulariser further preserves the demonstrated velocity and acceleration characteristics during adaptation. We evaluate the framework on two dynamic object-manipulation tasks in simulation and transfer the learned policy to real-world robot execution. Experimental results demonstrate higher task success, lower collision frequency, and more stable learning than the baselines, while preserving the kinematic characteristics of the demonstrated skill.
Read the full abstract

All authors A K M Nadimul Haque, Sheila Sutjipto, Marc G. Carmichael, Teresa Vidal-Calleja

Signal Processing

AoI-driven Anomaly Detection Framework for Communication Networks

Anomaly detection in communication networks remains a challenge, particularly in time-sensitive environments where stale information can affect system reliability. In this work, we propose an anomaly detection framework that leverages Age of Information (AoI) as a temporal indicator for identifying abnormal network behaviors. The AoI has been studied for network performance optimization, however, its applicability to anomaly detection remains unexplored. The proposed framework integrates a feature selection technique based on the estimated Peak Age of Information (ePAoI) with multiple machine learning models for communication networks as a complementary indicator. The evaluation results demonstrate that ePAoI-based feature selection enhances the performance of the anomaly detection framework while significantly reducing the computational complexity.
Read the full abstract

Artificial Intelligence

LLMs as Post-hoc Auditors of Physiological Plausibility in Symbolic Regression: A Clinician-Evaluated Case Study

Genetic programming and its variants, such as grammatical evolution, are widely used in symbolic regression to derive mathematical expressions from multivariate data. In addition to predictive accuracy, models are appreciated for their potential to provide interpretability, offering explicit equations that relate input variables to outcomes. However, achieving interpretability and plausibility remains challenging, as evolved models may be complex or scientifically inconsistent. In this study, we explore whether large language models (LLMs) can assist in improving the interpretability of symbolic regression models generated by evolutionary computation methods. Building on our previous work on estimating body fat percentage using grammar-based genetic programming, we investigate LLMs as post-processing tools to analyze and rank evolved expressions by interpretability and physiological plausibility. Four symbolic expressions are analyzed by three LLMs over three repeated runs, and the resulting interpretations and rankings are assessed by a panel of three clinicians. Across the three LLMs, comparative model-ranking outputs received more favorable clinician assessments than isolated term-level interpretations. However, the LLMs also produced physiologically and mathematically questionable explanations, indicating that they are better suited to comparative auditing under expert oversight than to autonomous validation.
Read the full abstract

All authors Jorge López-Varela, J. Ignacio Hidalgo, José-Manuel Muñoz, Omar Costilla-Reyes, Esther Maqueda, Jesus Moreno-Fernandez, Tomás González-Vidal, J. Manuel Velasco, Oscar Garnica

Graphics

Gaussian Light Transport

We present a novel method for computing global illumination by expressing the solution to the light transport equation as a 13D Gaussian mixture model over positions, directions, surface normals, and material properties. We show that including scene properties in the Gaussian representation drastically reduces the number of functions and speeds up evaluation. As opposed to traditional light transport methods based on Neumann series, the parameters of our model are directly estimated by minimizing the residual of the rendering equation. While both optimization and rendering require repeated evaluations of a linear combination of high-dimensional Gaussian functions, we introduce an efficient culling strategy to keep the optimization tractable and produce renderings in real time. Our representation enables to render fast, view-independent solutions to the light transport equation, achieving rendering times on the order of milliseconds, with a fraction of the memory requirements of conventional neural rendering approaches.
Read the full abstract

Differential Geometry

A Seifert Dichotomy for Z2-Harmonic One-Forms

We establish a dichotomy for Z/2-harmonic one-forms on Seifert fibered rational homology three-spheres. For an oriented base with at most three exceptional fibers, we prove nonexistence along any fixed connection-metric family when the fibers are sufficiently collapsed. With at least four exceptional fibers, existing results give existence for every Riemannian metric. We also complete the corresponding classification for nonorientable bases.
Read the full abstract

Digital Libraries

Wavering Oracles: Selective Updating and Correlated Failures in LLMs and Their Implications for Scientific Workflows

Scientific workflows increasingly use repeated queries, multiple models, and interacting agents. Reliability therefore depends on whether models preserve correct conclusions, accept valid corrections, and contribute errors that a selector can distinguish. Using SycoBench- 600 as a controlled measurement substrate, we evaluate these requirements through selective updating, defined by resistance to misleading suggestions and uptake of correct suggestions. The study covers ten models and 17,055 trajectories. Published models span 13.4 to 71.6 percentage points in selectivity. Under identical local evaluation, Qwen3-4B is selectively adaptive at 45.6 points, Gemma3-4B is destabilized at minus 14.1 points, and SmolLM3-3B follows both correct and wrong explicit suggestions, producing zero selectivity. Matched interventions identify model specific responses to doubt, authority, and explicit advice. Among seven published models, the best reaches 95.3 percent accuracy, plurality reaches 88.6 percent, and the oracle ceiling is 99.8 percent. Mean error correlation of 0.285 reduces seven models to an effective independent count of 2.58. A leave-one-stem-family-out reliability selector reaches 96.2 percent, recovering 67.7 percent of the plurality-to-oracle gap. These results establish selective updating, error diversity, and calibrated adjudication as jointly measurable design targets for multi-model scientific workflows.
Read the full abstract

Geometric Topology

Homological lifts of Arnold invariants $J^-$ and $J^+$

Viro's Euler-integral polynomial $P_C(q)$ and the Lanzat–Polyak quantized-curvature polynomial $I_q(C)$ refine Arnold's invariants $J^-$ and $J^+$ for generic immersed one-component plane curves. We construct homological lifts of both. The bigraded region homology retains the singular homology of every connected Alexander-index region; its graded Euler characteristic is $P_C(q)$. The triply graded smoothing-circle homology is generated by the oriented circles of the orientation-preserving smoothing and decategorifies to the smoothing term in $I_q(C)$. Keeping the actual region summands and the boundary regions of every smoothing circle gives a homological refinement of the oriented smoothing configuration, or Seifert state. An infinite family proves strictness: both polynomial data and the ordinary homological lifts agree, while the component-graded region homology and the branch-decomposed circle homology distinguish every pair. Further constructions recover the full $I_q(C)$ by a vertex complex, realize the local change of its curvature integral by edge homology, and give a canonical two-state homology for unoriented curves. Viro described his Euler-integral formula as an analogue of face state-sum formulas for quantum knot polynomials. Through the categorifications developed here, we obtain one concrete homological face-state-sum model realizing that analogy.
Read the full abstract

Fluid Dynamics

DiffSWE2d: a differentiable Shallow Water Equations solver for end-to-end flood and tsunami modelling

Solving inverse and optimisation problems with traditional shallow water equations (SWE) solvers can be computationally expensive, particularly when gradients with respect to model inputs or parameters must be estimated through repeated forward simulations. In this paper, we introduce DiffSWE2d, an open-source differentiable shallow water equations solver for end-to-end flood and tsunami modelling implemented in PyTorch. By leveraging automatic differentiation, DiffSWE2d represents the time-marching physics as a differentiable computational graph, enabling gradients to be propagated directly through the numerical solver. We validate the solver against two established benchmark cases and demonstrate its application to tsunami waveform inversion, showing its ability to infer model inputs through gradient-based optimisation. DiffSWE2d provides a flexible framework for integrating physics-based hydrodynamic modelling with modern optimisation and machine learning methods. The source code and reproducible examples are publicly available at: https://github.com/ZhonghouXu/DiffSWE2d
Read the full abstract

Nuclear Theory

Gogny interaction from beginnings to current challenges

In the present review, various facets of the phenomenological effective Gogny interaction, which was originally proposed in the 70's, are gathered for the first time in the same place. This involves both nuclear phenomena of interest that led to its creation and evolution as well as highly technical aspects that led the objectives to be achieved. With this in mind, a discussion structured around four key points is proposed. After a general introduction, the history and philosophy of the Gogny interaction is exposed. In particular, one highlights the way followed by D. Gogny to guide the determination of the parameters of its phenomenological interaction with results obtained from a realistic interaction using Hartree-Fock calculations and second order corrections and a G-matrix. One also shows how physical phenomena such as pairing or fission were essential to improve the initial parameterization. The evolution of the original analytical form over the years is then discussed. The second key point concern the emulator that was used for the generation of parameterizations. Its modifications, consistent with the evolution of its analytical form along the decades, are detailed. Other fitting procedures from other groups, more recent, are also evoked. The third key point is dedicated to the role of some nuclear matter properties in the fitting process and the acceptance of a parameterization. The objective of the last key point consists in highlighting some results obtained with the Gogny interaction in various domains such as nuclear structure, fission, reactions and nuclear data that have allowed to interpret many experimental data. Perpsectives are given explaining some paths that will be followed in the future concerning the functional itself as well as N-body approaches.
Read the full abstract

All authors Nathalie Pillet, Geoffrey Zietek, Luis Robledo, Marc Dupuis, Tomas R. Rodriguez

Optimization and Control

Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability

We study asynchronous continuation replanning in a two-population linear–quadratic mean field game with deterministic open-loop controls and heterogeneous, possibly erroneous initial information. At exogenous opportunities, one population recomputes its continuation response from the physical aggregate state reached, with the opponent's active plan frozen. The state–plan target needed to initialize replanning is recoverable from local aggregate observations if and only if a kernel-inclusion condition holds; full recovery of the hidden initial input is unnecessary. For revisions accumulating before the terminal time, spectral stability of the limiting two-response cycle yields bounded physical execution and a finite state left limit. The zero-extended continuation plans then converge strongly to the mean field equilibrium restarted from that state. A scalar counterexample shows that well-posed continuation problems and a convergent physical state can coexist with divergent remaining plans. We also construct an exact causal implementation from local aggregate observations and establish finite-population robustness on every fixed finite opportunity prefix. Revision records match with probability tending to one, and the mean-square implementation error truncated to the matching event is \(O(N_*^{-1})\), where \(N_*\) is the smaller population size.
Read the full abstract

General Relativity and Quantum Cosmology

Gravitational lensing in a spacetime with extra dimensions

This is the fourth paper of a series in which we consider the possibility to use cosmological extra dimensions to explain the accelerated expansion of the Universe and the rotation curve of spiral galaxies without introducing dark matter and dark energy. Here we study gravitational lensing in this setting; we derive an expression for time delay and present a modified likelihood for the mass reconstruction procedure which takes into account the effect of the expansion or contraction of the extra dimensions.
Read the full abstract

Optimization and Control

Control Strategies for Multi-Species Wasserstein Gradient Flows

We stabilize stationary states of coupled multi-species McKean–Vlasov equations by feedback control, extending a spectral approach based on the Wasserstein Hessian and a Riccati equation from a single density to a product of Wasserstein spaces. We give necessary and sufficient conditions for local exponential stabilization at a prescribed rate when only one species is actuated, together with the minimum number of control inputs required. For two species, the condition reduces to a rank condition on the Fourier coefficients of the cross-interaction kernel over the eigenspaces of the unactuated species' linearized dynamics. A two-community noisy Kuramoto model and a cell-sorting model illustrate the results.
Read the full abstract

Differential Geometry

Optimal geometric inequalities and fully nonlinear conformal flows

We establish sharp Sobolev-type geometric inequalities on $\mathbb{S}^n$ involving the total $\sigma_k$-curvatures $\int_{\mathbb{S}^n}\sigma_k(g)\,dv_g$. These results extend the optimal inequalities of Guan–Wang~\cite{GWDuke} from the cone $\mathcal{C}_k$ to the strictly larger cone $\mathcal{C}_{k-1}$, thereby enlarging the range of admissible conformal metrics. Our approach is variational and is implemented through a fully nonlinear conformal flow. Working in $\mathcal{C}_{k-1}$ introduces substantial analytic difficulties; in particular, one must obtain $C^2$ a priori estimates while simultaneously verifying that the flow remains parabolic. We resolve these issues via a carefully designed test function and by applying the maximum principle to the maximal eigenvalue of the Hessian matrix. As applications, we solve two open problems in dimensions 3 and 4. Finally, we give examples to show that these inequalities cannot be extended to $\mathcal{C}_{k-2}$.
Read the full abstract

Software Engineering

Deep Learning-based Bug Triage System

Effective bug triage is crucial for streamlining the software development lifecycle by accurately categorizing and assigning reported software defects. In this paper, we propose an automated bug triage system built upon the pre-trained RoBERTa-base transformer architecture. By leveraging deep contextual representations, our approach efficiently classifies incoming bug reports to optimize assignment. Experimental evaluation demonstrates that the proposed system achieves a strong bug identification accuracy of 0.90 within just five training epochs. These findings highlight the efficiency and high performance of fine-tuned transformer models for practical software engineering automation.
Read the full abstract