Peer Revenue Publish or profit

Papers

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

All of arXiv

Monday 7 September

Analysis of PDEs

Strong maximum principle for nonlocal diffusion in measure spaces: new characterization and population dynamics applications

We study the existence of nontrivial solutions to nonlocal semilinear diffusion equations of the form \[ a_0(x)u(x)-\int_\Omega k(x,y)\big(u(y)-u(x)\big)\,d\mu(y)=F(x,u), \quad u\geq 0, \] on a general measure space $(\Omega,M,\mu)$, where the kernel $k$ is nonnegative and symmetric. In this framework, a major challenge is establishing the strict positivity of solutions. To this end, we provide a novel complete characterization of the strong maximum principle in terms of a connectivity structure induced by the kernel, which leads to a decomposition of the domain into independent components. We also develop the method of sub- and supersolutions in this setting, obtaining existence, uniqueness, and nonexistence results, as well as a regularity result that ensures the continuity of solutions under suitable assumptions. The main interest of working within an abstract measure space lies in its rich applicability, as it unifies and extends a wide variety of frameworks, including discrete, continuous, and hybrid models, or systems interacting across different dimensions. Finally, numerical experiments are presented to illustrate the potential of our theoretical results.
Read the full abstract

High Energy Physics (Phenomenology)

Chiral Doubling, Renormalization Group Fixed Points, and Dense Matter Equations of State

We review a top-down fixed-point-extrapolation paradigm as a unified effective field theory framework for hadronic spectroscopy, dense baryonic matter, and compact star physics. By formulating our effective Lagrangian directly at renormalization group (RG) fixed points and introducing minimal symmetry breaking, we extrapolate the theory back to physical environments. In the vacuum, this framework naturally reproduces the heavy-light meson parity-doubling spectrum via light vector meson loops. In dense matter, the interplay between the chiral-invariant nucleon mass m0 and walking vector couplings reconciles gravitational-wave constraints with $2M_\odot$ massive neutron stars. Generalization to a quark-hadron hybrid approach further illuminates sequential deconfinement, core stability, and baryon number fluctuations, demonstrating how underlying RG fixed points dictate hadronic dynamics from vacuum to neutron star interiors.
Read the full abstract

High Energy Physics (Phenomenology)

Hadronic heavy neutral lepton decays to the limit

Heavy Neutral Leptons are a class of hypothetical particle, motivated by simultaneously solving multiple of the standing issues of the Standard Model. In this work we investigate the decay structure of this type of particle in the hadronic picture for multi-body final states. We propose to link the resulting hadronic description to a partonic description in a seamless transition based on the hadron system's invariant mass. Beyond the impact on the total HNL lifetime, we will show that the multi-hadron channels emerging in this description can constitute interesting experimental signatures.
Read the full abstract

Computer Vision

CHILD: Human-in-the-Loop OOD Detection for Safe Clinical Deployment

Out-of-distribution (OOD) detection is critical for safe deployment of medical AI systems. Recently, test-time adaptation (TTA) has emerged as a new paradigm for OOD detection, automatically adjusting detector behavior during deployment. However, such automatic adaptation mechanisms may raise safety concerns in safety-critical clinical environments. While physician oversight can mitigate these risks, it is resource-intensive and must be judiciously allocated. To reconcile safety with efficiency, we propose CHILD, a training-free framework designed to enhance streaming OOD detection via sparse human feedback. Operating under strict budget constraints, CHILD employs an adaptive risk-aware sample selection mechanism to pinpoint only the most decision-uncertain samples for review. Crucially, it maximizes the utility of this sparse feedback through a retrieval-based score calibration module, which refines model predictions using a compact feature cache without any parameter updates. Extensive experiments on four medical benchmarks demonstrate that CHILD turns limited supervision into significant reliability gains: with a sparse feedback budget of only 5%, it reduces the average FPR95 from 72.63% to 60.26% and improves AUROC from 75.53% to 81.85%, consistently outperforming state-of-the-art baselines. Our code is publicly available at https://github.com/figec/CHILD.
Read the full abstract

All authors Jinlun Ye, Kaiyue Lu, Runhe Lai, Xinhua Lu, Jia-Xin Zhuang, Ruixuan Wang

Numerical Analysis

Structure-Preserving Data-Driven Identification of Port-Hamiltonian Differential-Algebraic Systems

We present a data-driven approach to identifying linear index-1 differential-algebraic pH systems (pH-DAEs) based on input-output measurements. In comparison to the identification of port-Hamiltonian (pH) systems, the algebraic constraint and the index condition pose additional challenges. First, we establish a structure-preserving formulation of the considered pH-DAE class and derive an implicit midpoint discretization that preserves the algebraic constraints and discrete dissipation inequality. We formulate the identification problem as a regularized least-squares minimization problem subject to the pH-DAE dynamics. Exploiting the index-1 structure, we reduce the constrained problem to an unconstrained optimization problem over the system parameters while preserving the port-Hamiltonian structure. Next, we derive an adjoint-based formulation to efficiently evaluate the gradient of the resulting reduced cost functional. This enables us to use gradient-based optimization methods for parameter estimation. Under suitable assumptions on the admissible parameter set, the existence of a minimizer is established. Numerical experiments demonstrate that the proposed approach can identify surrogate pH-DAE systems that accurately reproduce the input-output behavior of reference systems. Further investigations show the approach's potential for identifying reduced-order surrogate models. Cross-validation with independent input signals confirms the predictive capability of the identified models.
Read the full abstract

All authors Tom Zwerschke, Matthias Ehrhardt, Michael Günther, Claudia Totzeck

Statistical Methodology

Bayesian nonparametric inference for modal missing species and features

Species and feature sampling problems arise naturally whenever each observed unit is associated with one or more labels from a countable alphabet, and inference focuses on the unobserved portion of the distribution over such an alphabet. Within this framework, recent contributions have shifted attention from inference on the total probability mass over unseen labels to distribution-free confidence intervals for the largest unobserved label probability (i.e., the modal missing probability), thereby providing more refined information on whether the missing mass is concentrated on a few high-prevalence unseen labels or distributed across many negligible ones. Besides lacking a unified framework for species and features, these approaches employ a worst-case perspective that causes substantial information loss and produces overly-conservative intervals. We address these limitations through a unified model-based framework for inference on modal missing probabilities in both species and feature settings, which leverages a flexible Bayesian nonparametric formulation to localize uncertainty around models compatible with the observed data. This leads to sharper closed-form credible intervals that effectively exploit prior information and observed data, while preserving the theoretical frequentist properties and robustness of distribution-free intervals. Simulation studies confirm these improvements, while an organized crime application illustrates how our contribution has the potential to reshape law-enforcement decision-making in investigations.
Read the full abstract

All authors Alessandro Colombi, Mario Beraha, Daniele Durante, Stefano Favaro

Computation and Language

SIFTING: A Novel LLM-Based Framework for Structured and Transparent Information Extraction from Clinical Free-Text Reports, with Application to Tumor Staging in Lung Cancer

Background: Large language models (LLMs) show promise for extracting information from clinical free-text documents, but their outputs are often unstructured and lack traceability, complicating validation and adoption in clinical workflows. In this work we introduce SIFTING, an LLM-based framework designed to address these shortcomings. Methods: SIFTING combines the language comprehension capabilities of LLMs with segment-level processing and structured prompts with strict output control, linking findings to the source text to enable both accurate and transparent information extraction. To demonstrate its capabilities, we applied the framework to the task of extracting tumor T-stage information from 130 lung cancer radiology reports (SIFTING-T-stage). A compact 4-bit quantized version of the open-source LLM Llama-3.3-70B (35 GB) was used in a fully self-hosted setup, providing full control over data and model. Performance was evaluated against a reference standard created by four clinical experts and compared with a range of LLMs as used in a conventional single-prompt approach, using bootstrap resampling to estimate confidence intervals. Results: SIFTING-T-stage achieved an accuracy of 90% (95% CI: 84-95) against the reference standard. We found its performance to be comparable to even the largest state-of-the-art LLMs with reasoning capabilities and to be interchangeable with clinical experts (p < 0.001), while at the same time offering full traceability through source text references. Conclusion: SIFTING enables accurate, structured, and traceable information extraction from clinical free-text documents. It ensures data control, reproducibility, and verifiable outputs that can support clinical validation and workflow integration.
Read the full abstract

All authors Mirco Hess, Gerben van Veenendaal, Joris Wakkie, Yiwen Soo, Malcolm H. Lawson, John D. Maclay, Arjun Nair, Neal Navani

Statistics Theory

Tensor network representations of discrete maximum entropy distributions via mean polytopes

We present tensor network representations for discrete maximum entropy distributions under expectation constraints. To this end, we introduce Computation-Activation Networks (CompActNets), a tensor network architecture that subsumes exponential families. By leveraging the geometry of the convex polytope of realizable expectation vectors, we represent any maximum entropy distribution in the same architecture. We exploit the fact that proper faces of this polytope correspond to the boundary closure of exponential families, which restricts the distribution's support. We then derive explicit representations for the support within the CompActNet architecture. The proposed framework suggests tensor network ranks as complexity measures for faces. Finally, a case study on Boolean statistics links the geometry of 0/1-polytopes directly to propositional formulas.
Read the full abstract

Computation and Language

CircuitLens: Reasoning Circuits as Data Selection Signals for Reinforcement Learning with Verifiable Rewards

Reinforcement learning with verifiable rewards (RLVR) is sensitive to which problems a model trains on, yet existing selection criteria–difficulty filtering, hand-curation, reward-trajectory scoring–assess data value as an intrinsic property of problems, independent of the model that will learn from them. We introduce Circuit Reasoning Score (CRS), a selection signal derived from 46 reasoning-sensitive attention heads identified via contrastive ablation, computed in a single forward pass on the frozen base model without reward labels or rollouts. CRS runs against the intuitive hypothesis that stronger reasoning-circuit engagement produces better training data: on Qwen2.5-Math-7B, the lowest-engagement decile improves over random selection on three medium-difficulty benchmarks (GSM8K +2.0 pp, OlympiadBench +1.6 pp, Minerva +2.9 pp), while the highest-engagement decile gains less and is indistinguishable from the middle decile. The advantage has boundary conditions: on a domain-curated pool no selection method separates from the others; at 1.5B scale the useful direction differs; and the lowest-reward training condition produces the strongest downstream generalization. Within the Qwen2.5-Math settings tested, RLVR data selection appears regime-dependent rather than reducible to a static ranking of problem quality.
Read the full abstract

All authors Zhuofan Chen, Ziqian Jiao, Yikai Cui, Zhixin Cai, Jun Bai, Wenge Rong

Algebraic Geometry

Resolutions of linear $p$-cyclic quotient singularities

Let $k$ be an algebraically closed field of positive characteristic $p$, and let $C_p$ act linearly on a finite-dimensional $k$-vector space $V$, with indecomposable Jordan summands $V_{d_i}$ of dimension $d_i$. We study projective (crepant) resolutions of $V/C_p$ by constructing a model using the invariant weighted blowup. For $V=V_2^{\oplus n}$, our model is smooth and is the normalization of a blowup of $V/C_p$. It has a unique exceptional divisor of discrepancy $n-p$, such that our model is a crepant resolution when $n=p$. In almost all other cases when the quotient is canonical but not terminal, the invariant weighted blowup model does not produce crepant resolutions, but gives the unique nontrivial projective crepant birational model of the quotient. Consequently, up to trivial summands, we classify the $p$-cyclic linear quotients admitting a projective crepant resolution.
Read the full abstract

Information Theory

Cyclic Codes of Length 7_p^s over F_p^m + uF_p^m : Characterization, Duals, and Applications to Quantum and LCD Codes

Let $R_2 = \mathbb{F}_{p^m} + u\mathbb{F}_{p^m}$ ($u^2 = 0$), where $p$ is an odd prime and $m, s \in \mathbb{N}$. For $p \equiv 3, 5 \pmod 7$ with $\gcd(m, 6) = 1$, the cyclotomic polynomial $\Phi_7(x)$ is irreducible over $\mathbb{F}_{p^m}$. This yields a direct sum decomposition $C = C_1 \oplus C_2$ for any cyclic code $C$ of length $7p^s$ over $R_2$, where $C_1$ has length $p^s$ and $C_2$ is a $7$-cyclotomic code of length $6p^s$. We classify $7$-cyclotomic codes into four disjoint generator-based types and calculate exact cardinalities using residue and torsion subcodes. Furthermore, explicit generators for the Euclidean dual codes $C^\perp$ are determined. As operational applications of these classified codes, we construct new families of quantum stabilizer codes via the CSS framework and establish parameter criteria for linear codes with complementary duals (LCD codes).
Read the full abstract

Computer Vision

Deep Learning for Biopsy-Free Subtyping of Basal Cell Carcinoma from Dermatoscopic Images

Basal Cell Carcinoma (BCC) is the most common type of skin cancer, accounting for nearly 80% of skin cancer di- agnoses. Its optimal clinical management is guided by the distinct histopathologic subtype, with aggressive variants requiring more drastic measures. In current clinical practice, subtyping relies on skin biopsies, a procedure both costly and invasive. In this paper, we conduct a preliminary investigation into using deep learning for BCC subtyping, solely from a single dermatoscopic image of the lesion. Given the limited data at our disposal, we employ pre-trained vision transformers (ViTs), a state-of-the-art family of models highly effective for challenging downstream tasks with limited labeled data. Through repeated stratified k-fold cross-validation, we demonstrate that ViTs can achieve superior performance (AUC 0.784 on a dataset of 1271 dermatoscopic images of various BCC subtypes) over standard CNN-based baselines as well as previously-reported human reader perfor- mance, on the task of differentiating aggressive BCCs from other subtype families. These initial findings highlight the potential of combining deep learning and dermatoscopy to provide a biopsy- free alternative for BCC subtyping, thus aiding in improving treatment planning and patient outcomes.
Read the full abstract

All authors Alexandros Papadopoulos, Chrysa Episkopou, Ioannis Sarafis, Aimilios Lallas, Anastasios Delopoulos

Quantum Algebra

A dual theory of Zhu's theory

We establish a dual theory of Zhu's $A(\mathcal {V})$-theory, i.e., for a graded vertex operator coalgebra $V$, the coassociative coalgebra $C(V)$ are investigated, any admissible $V$-comodule gives a $C(V)$-comodule, and vice versa. We also prove that $V$ is corational, which means every admissible $V$-comodule is completely reducible, if and only if its dual vertex operator algebra $V'$ is rational.
Read the full abstract

Computer Vision

Weakly-supervised Kidney Tumor Classification from CT Scans with Multi-Instance Learning and Anatomical Filtering

Deep learning models for CT scan analysis are often limited by the scarcity of precise pixel-level annotations, which require significant radiologist effort to produce. Training on scan-level labels alone reduces annotation requirements but introduces challenges: low supervision ratios and large input volumes make models prone to overfitting and shortcut learning. In this work, we investigate two complementary methods to address these challenges: multi-instance learning (MIL) and anatomical filtering. MIL divides CT volumes into 2D slice instances, enabling efficient 2D architectures with ImageNet pretraining rather than computationally demanding 3D models. Anatomical filtering uses Compass, our self-supervised body part regression model, to crop scans to pathology-relevant subregions without requiring segmentation masks. We evaluate two MIL frameworks - Attention-based MIL (ABMIL) and FocusMIL - on kidney tumor classification across one internal dataset (TUH) and two external datasets (KiTS23 and TCGA-KiRC). Our best models achieve F1 = 0.83 on the internal test set using only scan-level labels. We further show that anatomical filtering with the Compass model is critical for the out-of-distribution generalization of embedding-based ABMIL, while instance-based FocusMIL demonstrates greater inherent robustness to distribution shift. While evaluated on kidney tumors, we consider this a proof-of-concept for a broader weakly supervised CT classification pipeline applicable to other organs and pathologies.
Read the full abstract

Differential Geometry

Localizing a Dirac operator via $J$-holomorphic curves

Let $(M,J)$ be a compact almost hermitian $4$-manifold with a smooth embedded $J$-holomorphic curve $C$ representing the canonical class. Motivated by the symplectic Bogomolov–Miyaoka–Yau conjecture, we choose a twisted spin$^{\text{c}}$ Dirac operator ${\mathcal D}$ on $M$ satisfying $$ \operatorname{ind}{\mathcal D}=3c_2(M)-c_1^2(M). $$ We then use the curve $C$ to construct a complex-linear perturbation ${\mathcal A}$ of ${\mathcal D}$ whose singular set is $Z_{\alpha}\sqcup C$, where $Z_{\alpha}=\alpha^{-1}(0)$ for a transverse section $\alpha$ of $\Lambda^{1,0}M$ nonvanishing on $C$. Applying Maridakis' index localization theorem, we express $\operatorname{ind}{\mathcal D}$ as the sum of localized contributions: $3c_2(M)$ from $Z_{\alpha}$ and $-c_1^2(M)$ from $C$.
Read the full abstract

Instrumentation and Methods for Astrophysics

One Merger, Three Bands: Multiband Detection Rates and Parameter Estimation of Stellar-mass Binary Black Hole Coalescences from Millihertz to Kilohertz

Stellar-mass binary black holes sweep through the millihertz, decihertz, and kilohertz gravitational-wave bands before merger, making them prime targets for multiband observations. We forecast their detection rates and parameter-estimation precision for networks combining the millihertz observatories LISA, Taiji, and TianQin; the decihertz concepts LGWA, AMIGO, and AMIGO-5; and the ground-based LVK and Cosmic Explorer. Using the binary-black-hole mass and redshift distributions inferred from GWTC-4, we first estimate the single-band yields and then account explicitly for detector lifetimes and relative mission start times when calculating multiband rates. For a signal-to-noise-ratio threshold of 8, the LISA–Taiji–TianQin network is expected to detect $53.6^{+19.7}_{-14.1}$ systems in the millihertz band, while the largest three-band yield is $23.5^{+8.7}_{-6.2}$ events for LISA–Taiji–TianQin combined with LGWA. The yield is maximized when the decihertz observation begins approximately $0$–$3\,{\rm yr}$ after the millihertz mission. Ground-informed subthreshold searches with a threshold of 5 increase the multiband yields by a factor of approximately $4$–$5$, reaching $125.1^{+46.1}_{-32.9}$ events for the same network. Fisher-matrix forecasts for a GW150914-like source show that decihertz observations provide the dominant improvement in most multiband parameter constraints, whereas millihertz data primarily sharpen the detector-frame chirp mass and sky localization. Combining the three bands improves the chirp-mass precision by orders of magnitude relative to ground-based observations alone and can reduce the localization area and coalescence-time uncertainty substantially. These results demonstrate that coordinated mission scheduling and targeted subthreshold searches are essential for realizing the scientific potential of stellar-mass multiband gravitational-wave astronomy.
Read the full abstract

Hardware Architecture

Enabling High-Bandwidth Flash for Generative Recommendation Serving with Write-Aware KV Cache Policy

Generative recommendation (GR) systems increasingly leverage user-level KV cache reuse to avoid recomputing long user histories. However, the growing KV cache capacity and bandwidth requirements introduce new challenges for memory system. High-Bandwidth Flash (HBF) provides a promising solution by offering substantially higher capacity than HBM while approaching HBM-class read bandwidth, enabling larger scale KV cache retention and improved serving throughput. Yet conventional Least-Recently-Used (LRU) KV cache management tightly couples KV cache writes with cache misses, generating excessive write traffic that rapidly exhausts flash endurance. In this work, we evaluate a write-aware KV cache policy based on admission-controlled LRU-K for HBF-based GR serving. By filtering low-reuse users before cache admission, LRU-K decouples KV cache writes from misses and significantly reduces unnecessary writes. We develop an analytical model to characterize GR serving performance, KV cache write traffic, and HBF lifetime, and evaluate performance across diverse memory systems and GR workloads. Our results show that HBF-based systems achieve 3.8 to 4.7 times higher throughput than HBM-only systems. Moreover, LRU-K extends HBF lifetime from about one year under conventional LRU to over six years with a moderate K=10, while maintaining comparable or even slightly improved throughput. These results highlight the importance of write aware KV cache policy for sustainable HBF-based GR serving.
Read the full abstract

All authors Danni Peng, Kai Wu, Tianyu Zuo, Pengfei Xia, Hui Zang

Artificial Intelligence

PhysMAS: Physics-Grounded Multi-Agent Synthesis of Compositional 4D Gaussians

Efficient, fully automatic, and physically plausible 4D Gaussian synthesis is an important goal for dynamic scene generation. Recent physics-based methods couple 3D Gaussians with the Material Point Method (MPM) to generate physically driven motion, but extending this paradigm to heterogeneous multi-part objects and interacting multi-object scenes remains challenging. Object-level physical assignment collapses distinct parts into a single material state, while one-shot predictions from large language models, vision-language models, or agents neither reliably bind different materials to identified parts nor verify that the resulting MPM configuration is executable. Score Distillation Sampling (SDS)-based parameter optimization, meanwhile, requires repeated per-scene score evaluations and gradient backpropagation, incurring lengthy optimization and potentially yielding suboptimal or unstable solutions. We therefore present PhysMAS, a physics-grounded multi-agent framework. From a motion prompt and four scene views, an Object-Part Scene Agent establishes persistent identities and calls a Material Reasoning Agent for part-wise profiles. It invokes solver-aware skills to bind these identities and profiles to per-particle MPM fields and execute all objects in a shared domain; the framework then screens candidate forward-simulation results. This supports heterogeneous multi-part and interacting multi-object scenes without per-scene diffusion-score backpropagation. Extensive experiments demonstrate that, compared with recent physics-based 4D Gaussian baselines that rely on SDS, PhysMAS achieves better semantic alignment and perceived physical plausibility while requiring less runtime.
Read the full abstract

All authors Jiang Qin, Chunji Lv, Yangguang Wei, Yang Gao, Ming Liu, Lizhong Ding, Ye Yuan, Yinjie Lei, Changsheng Li

Audio and Speech Processing

Direction-Preserving Active Noise Control with a Conditional Control-Filter Estimation Network

Conventional active noise control (ANC) minimizes the total disturbance at the error microphone without distinguishing desired sound from noise. Direction-preserving ANC (DP-ANC) instead aims to attenuate a noise component arriving from a direction other than the specified desired direction while preserving sound naturally arriving from that direction. Existing approaches typically either require analytical optimization to be repeated for each new observation or estimate and reproduce the desired component through a hear-through secondary-source path. To address these limitations, this paper formulates DP-ANC as a direction-conditioned cancellation-preservation optimization problem. A component-separated objective jointly penalizes residual noise energy and the control response induced by the desired component, with a scalar weighting parameter controlling the cancellation-preservation trade-off. A convolutional network conditioned on the specified desired direction through feature-wise linear modulation (FiLM) is trained using a differentiable secondary-path-aware forward model. At deployment, the network estimates the complete multichannel finite impulse response (FIR) control-filter bank directly from a mixed-reference observation and the specified desired direction in a single forward pass, while retaining the conventional feedforward ANC signal path. Over 3300 evaluation cases, the selected operating point achieves 22.8 dB mean noise reduction with a desired-signal distortion of -11.4 dB. Validation using measured in-ear-device transfer functions further demonstrates consistent performance under measured acoustic configurations.
Read the full abstract

All authors Ziyi Yang, Zhengding Luo, Boxiang Wang, Libin Zhang, Woon-Seng Gan

Plasma Physics

Dual-decomposition multi-GPU particle-in-cell method for cylindrical plasmas: Batched Fourier-mode multigrid and balanced particle slabs

Three-dimensional electrostatic particle-in-cell (PIC) simulations combine irregular particle operations with a globally coupled Poisson solve, whose preferred parallel decompositions conflict. We introduce a dual-decomposition multi-GPU method: complete azimuthal Fourier modes are owned during the field solve, whereas spatial slabs own particles. Exact full-spectrum diagonalization and batched matrix-free geometric multigrid keep collectives outside the V-cycle, after which every GPU reconstructs the full field. Peer migration, cell reordering, warp-aggregated deposition, and capacity-constrained dynamic cuts restore particle locality and balance. CPU/GPU Poisson solutions agree to relative L2 errors below 6.9e-16; all 65 physical modes on eight V100 GPUs are solved in 9.350 ms with relative errors below 8.2e-15. For an identical 512*128*400 problem containing 707,788,800 particles per species, the complete PIC loop reaches 0.149108 s per step and strong-scales from five to eight GPUs with 91.81% efficiency. A separate cross-resolution production study shows approximately threefold aggregate particle-update and Poisson-cell throughput relative to a single RTX 5090 calculation; this measures refined-problem capability rather than a hardware speedup or formal convergence order.
Read the full abstract

Applied Physics

Boundary-induced medium mapping enables air-equivalent acoustic propagation and perfect absorption in water

The extreme water-air impedance contrast (~3600) has long acted as a fundamental barrier separating airborne and underwater acoustics. Here, we overcome this barrier with flexible boundaries, which establish a direct physical mapping between disparate acoustic media, enabling a water-filled channel to emulate air-equivalent wave propagation. Through vibroacoustic coupling, the effective wave velocity is rescaled in an approximately nondispersive manner, producing slow waves with tunable attenuation. Leveraging this concept, we demonstrate broadband underwater sound absorption at a deep-subwavelength thickness approaching the causal limit. Our findings reveal that acoustic media can be reshaped via boundary dynamics rather than bulk composition, paving the way for transplanting acoustic functionalities and metamaterial design across distinct media.
Read the full abstract

All authors Mingyu Duan, Xiangjun Peng, Ying-Jing Qian, Tian Jian Lu

Statistical Mechanics

Reverse engineering of mechano-kinetic parameters from stochastic force profiles in heterogeneous ensembles of molecular motors and tracks

Heterogeneity in contractile systems of molecular motors interacting with their tracks plays a key role in numerous cellular physiological and pathological processes. However, its effects cannot be captured by theoretical models assuming identical mechano-kinetic properties for all motors. We developed a stochastic framework to describe heterogeneous ensembles of myosin motors comprising two populations with distinct mechano-kinetic properties. Assuming that motors interact with the actin filament (their track) as independent force generators, we derived the probability distribution of the isometric force and characterised the statistics of finite-size force fluctuations. The proposed framework includes an estimation procedure that simultaneously infers the mechano-kinetic parameters and the size of the motor ensemble, eliminating the need to prescribe it a priori. Validation against synthetic and experimental data shows the model accurately captures force fluctuations and provides realistic estimates of the ensemble size. Furthermore, the framework enables a quantitative assessment of ensemble heterogeneity and the inference of an unknown motor species properties. This approach provides a quantitative tool for characterising heterogeneous actin-myosin systems, such as those arising from the co-presence of different protein isoforms in cardiac and skeletal muscle, or from the partial replacement of native proteins with mutation-derived or engineered variants.
Read the full abstract

All authors Valentina Buonfiglio, Irene Pertici, Pasquale Bianco, Duccio Fanelli, Stefano Gherardini

Pricing of Securities

Pricing and Hedging of Discretely Monitored Asian Options in the Volterra-Heston Model

We develop semi-closed pricing formulas and lifted-model hedging methods for discretely monitored geometric and arithmetic Asian options in the Volterra-Heston stochastic volatility model. Exploiting the affine Volterra structure, we derive a tractable transform for the joint law of the terminal log-price and the discretely monitored geometric average. This transform yields semi-closed pricing formulas for geometric Asian options, which in turn provide effective control variates for Monte Carlo valuation of arithmetic Asian options. Under the stated real-moment and affine-transform hypotheses, we also derive the Galtchouk-Kunita-Watanabe decomposition for Fourier-representable payoffs and obtain a variance-optimal hedge in terms of the Riccati-Volterra equation and the forward-variance curve. Using N-factor Markovian approximations, we obtain a finite-dimensional numerical implementation for hedging Asian options. Our numerical experiments document factor convergence for a regular non-Markovian kernel and the effect of rebalancing frequency on hedging error. In the Heston benchmark, geometric Asian controls substantially reduce the variance of arithmetic-Asian price estimates and improve the finite-sample stability of regression-based hedging relative to direct regression.
Read the full abstract

High Energy Physics (Phenomenology)

Probing Neutral Triple Gauge Couplings at e- p colliders

The Standard Model Effective Field Theory~(SMEFT) has attracted much attention as a model-independent way for probing new physical signals. In the SMEFT framework, $e^{-}p$ colliders can be used to study new interactions of gauge bosons, such as neutral Triple Gauge Couplings~(nTGCs). We study the signals and backgrounds of six different processes at the Future Circular Collider-hadron electron~(FCC-he) and propose different event selection strategies. The expected constraints on the coefficients of the dimension-8 operators for each process, as well as the combined constraints are obtained. The results show that the sensitivity of $e^{-}p$ colliders to nTGCs is similar to the current Large Hadron Collider~(LHC) experiments and is more competitive than that of Circular Electron Positron Collider~(CEPC) experiments.
Read the full abstract

All authors Xue-Jia Cheng, Chong-Xing Yue, Ji-Chong Yang, Si-Tong Liu

General Relativity and Quantum Cosmology

The (in)stability on total transmission modes with small bumps

Total transmission modes (TTMs) are a class of reflectionless solutions to black hole perturbation equations, closely related to quasinormal modes (QNMs), and can exhibit significant sensitivity to weak environmental perturbations. In this work, we investigate the spectrum (in)stability of TTMs of Tangherlini black holes by introducing a localized Pöschl-Teller bump perturbation into the effective potential, and employ a modified Chebyshev-Lobatto grid to improve the numerical accuracy of the localized perturbation. For $d=14$, $\ell=2$, and $s=2$, the purely imaginary TTM exhibits relatively strong spectrum stability, whereas the genuine complex TTMs undergo significant migrations even for small perturbations, consistent with the spectrum stability revealed by previous pseudospectrum analyses.
Read the full abstract

All authors Xi-Ning Dong, Liang-Bi Wu, Yu-Sen Zhou, Zong-Kuan Guo

Statistics Theory

Optimal rates for aggregation of affine estimators

Aggregation of estimation procedures has found important applications in econometrics, statistics, and machine learning. Classical statistical aggregation theory has mainly focused on a pure aggregation setting, where the candidate estimators are either deterministic or constructed using a held-out sample independent of that used for aggregation. When the candidate estimators and the aggregation weights are estimated from the same dataset without sample splitting, Bellec [Ann. Statist. 46 (2018), 30–59] established the optimal rate for model-selection aggregation of affine estimators. Beyond this regime, however, fundamental questions regarding the optimal aggregation rates and the construction of aggregation rules attaining these rates remain largely unresolved. In this paper, we consider the problem of aggregating a finite collection of affine estimators to learn an optimal convex combination of them. This framework encompasses a rich class of estimators widely used in statistics and machine learning, including least squares estimators, kernel ridge estimators, random feature regression estimators, and among many others. We establish the minimax rate for convex aggregation of affine estimators. In particular, we show that estimating the weights by minimizing a Mallows' $C_p$ criterion attains the optimal rate. We further study the linear aggregation regime with unrestricted weights and establish matching minimax lower and upper bounds over suitable classes of affine estimators.
Read the full abstract

Robotics

State-of-the-Art in Learning-by-Demonstration with Passive Observation for Industrial Assembly Automation

Learning-by-Demonstration (LbD) enables intuitive robot programming by capturing expert skills, which is crucial for agility in high-mix, low- volume manufacturing. This systematic literature review analyzes passive LbD for industrial assembly processes, focusing on the perception architecture and the generalization of the perceived demonstration. We specifically investigate one-shot approaches where only a single demonstration is required. The review evaluates how systems adapt to new assemblies using this limited data. We identify a shift towards object-centric perception, allowing learned primitives to be transferred to new product variants with minimal training.
Read the full abstract

Quantum Physics

Electron beam driven collective self hybridized exciton polaritons

Self-hybridized exciton polaritons in layered semiconductors emerge from the hybridization of excitonic resonances with confined photonic modes in films and provide a versatile platform for controlling light–matter interactions at the nanoscale. Yet, the nature of exciton–photon interactions and the collective and synchronous strong coupling of multiple excitons to the same photonic mode remain largely unexplored. Here, we use complementary momentum-resolved photoluminescence and cathodoluminescence spectroscopy to compare self-hybridized exciton polaritons in Ruddlesden–Popper perovskite flakes under optical and electron-beam excitation. We find that cathodoluminescence exhibits remarkably larger polaritonic level repulsion than photoluminescence, revealing an enhanced effective coupling strength under electron-beam excitation. We attribute this enhancement to the collective coherent excitation of multiple excitons by fast electrons, which couple to the same photonic mode and increase the interaction strength according to a $g_N=g_1\sqrt{N}$ scaling, with an effective number of up to $N\approx23$ coherently coupled excitonic oscillators. By reducing the electron kinetic energy, we further uncover a crossover to a partially incoherent excitation regime in which higher-order Fabry–Pérot exciton-polariton resonances disappear, leaving only the lowest polariton branches while coherent transition radiation persists. This transition arises because low-energy electrons excite excitons over extended spatial volumes, washing out the phase coherence required to sustain collective coupling and form polaritonic resonances. Our work shows that electron beams can actively modify collective light–matter coupling in layered semiconductors and establishes cathodoluminescence as a route to access excitation regimes beyond all-optical excitation schemes.
Read the full abstract

All authors Parsa Darman, Maximilian Black, Prabhdeep Singh, Masoud Taleb, Victor DeManuel-Gonzalez, Sara Darbari, Fatemeh Chahshouri, Nahid Talebi

Biological Physics

On the variational framework employing optimal control for biochemical thermodynamics

The maximum energy dissipation principle can be successfully applied to describe a range of basic nonlinear models. The application of the general variational framework (Moroz, 2008, 2009, 2010) has been illustrated for basic linear schemes. The study presented in the paper shows how the kinetic processes at this level of the biomolecular and biophysical phenomena can be effectively described in terms of the maximum energy dissipation principle and its variational formulation. On the basis of this approach, a range of Lagrangians was proposed for basic nonlinear dissipative kinetic models. The results of this study show that the framework is in agreement with nonlinear equilibrium thermodynamics.
Read the full abstract

Machine Learning

The Oversight Gap: What LLM Safety Monitors Miss, and Why It Is Not Capability

Several properties safety monitors are asked to certify, among them cross-tenant noninterference, sandbagging and evaluation awareness, are 2-safety hyperproperties, witnessed only by two executions. The standard consequence is a binary impossibility: one trace cannot decide them. We replace the binary with a measurement. A tight bound puts the balanced accuracy of any single-trace monitor at $\tfrac12+\tfrac12\,TV(P_0,P_1)$, turning undecidability into a graded detectability frontier and defining an oversight gap: a monitor's shortfall below it. On a leak family with closed-form $TV$, nine LLM monitors are optimal at $TV=0$ but capture little signal as $TV$ grows; at $TV=1$, where a 20-line membership check scores $100\%$, they average $60.9\%$. That shortfall is mostly not capability: naming what to check closes $61\%$ of it while leaving the $TV=0$ control at chance. The same split runs through a $2{\times}2$ factorial: an imagined second run leaves monitors at chance ($50.4\%$) while the same rule on an executed second run reaches $90.0\%$, and a stored oracle without a comparison procedure yields only $68.2\%$. Information and procedure are each necessary and neither is capability. Under nondeterminism, replay tracks a closed-form $k$-replay curve only under the right projection, and a projection frontier shows the resulting dilemma is forced: narrow misses $98.6\%$ of off-channel leaks, broad flags $75.7\%$ of clean traffic, and attainable accuracy decays like $1/(qm)$ in the benign-variation rate and the channel count. Finally, two frontier LLM judges certified an earlier version of our own benchmark as sound while a sign test found a directional bias ($p=2.7\times10^{-5}$) that invalidated three of our findings. Construction validity for hyperproperty benchmarks should be proved mechanically, not audited by models.
Read the full abstract