Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Tuesday 1 September

Sound

A Unified Uncertainty-Aware Back-End for Speaker Verification: Scoring, Normalization, and Calibration

Speaker verification back-ends commonly combine similarity scoring, score normalization, and calibration. However, speaker embeddings extracted from real-world utterances have trial-dependent reliability because of factors such as duration, noise, and channel variation. Existing uncertainty-aware methods primarily improve the speaker encoder or the initial similarity score, while the estimated uncertainty is typically not propagated through subsequent normalization and calibration. We represent each utterance by a speaker embedding, interpreted as a posterior mean, together with its covariance as an uncertainty estimate. We present a unified uncertainty-aware back-end comprising uncertainty-aware cosine scoring, uncertainty-aware AS-Norm (UAS-Norm), and uncertainty-aware Quality Measure Function calibration (UQMF). Covariance information is incorporated throughout this pipeline to adjust score scaling, cohort statistics, normalized-score combination, and calibration features. Experiments with ECAPA-TDNN and ResNet show consistent EER reductions and improved target–non-target separation across both architectures.
Read the full abstract

Signal Processing

How Much Training is Needed with a Digital Twin?

The following paper addresses how much pilot training is needed when a digital twin (DT) of the wireless radio channel is available to aid a wireless communication system with a channel estimation task. The DT of a wireless channel is widely expected to reduce the pilot overhead of channel estimation, following the informal rule that “the more accurate the twin, the fewer pilots are needed.” This trade-off, however, has only ever been demonstrated empirically and never quantified. We close this gap by treating the DT as a complementary measurement of the channel that the receiver fuses with its pilot observations in the physical world. Consequently, fusing the physical and digital worlds through the best linear unbiased estimator, we derive a DT-aided Cramér-Rao bound, and from it a pilot-equivalence law that converts DT fidelity into an equivalent number of training symbols. For a biased twin unknown to the estimator, we obtain the exact mismatch threshold beyond which trusting the DT is worse than ignoring it. We quantify how much training is needed with the DT to attain a desired mean square error on channel estimation. Particular cases are discussed to tell when training in the physical world can be completely bypassed. We finally translate these results into a block-fading achievable rate whose optimal training length is the unique root of a single equation, and identify the DT fidelity above which pilot training can be dispensed with altogether. Extensive numerical results corroborate closed-form expression and reveal that the value of a DT is largest at finite signal-to-noise ratio and vanishes in both the low- and high-SNR limits.
Read the full abstract

Instrumentation and Methods for Astrophysics

4MOST Low Resolution Spectrographs Characterization in Chile

4MOST, the 4m Multi Object Spectroscopic Telescope, is the optical, fibre-fed, MOS facility for the VISTA telescope at ESO's Paranal Observatory in Chile. Its main science drivers are in the fields of galactic archeology, high-energy physics, galaxy evolution and cosmology. The 4MOST consortium consists of several institutes in Europe and Australia under leadership of the Leibniz-Institut fur Astrophysik Potsdam (AIP). This paper focuses on the successful testing, installation and technical commissioning of the Low Resolution Spectrographs (LRS-A and B) for the 4MOST instrument at ESO's Paranal Observatory, Chile. This work was completed on October 18. 2025. Details on the assembly, integration, and performance of both 4MOST spectrographs from their arrival in the integration hall through to the telescope installation are provided. Attention is given to the optimization of procedures implemented to enhance performance and meet the expected top-level requirements. The 4MOST LRS features 2436 fibres split into two low-resolution spectrographs LRS-A and LRS-B (1624 fibres, three arms, 370-950 nm, R > 4000) and one high-resolution spectrograph (812 fibres, three arms, ~44-69 nm coverage each, R > 18000). The fibre positioner covers a hexagonal field of view of ~4.1 deg2. The fibers are 85 {\mu}m core with an output beam at f/3. The Centre de Recherche Astrophysique de Lyon (CRAL) had the full responsibility for the two low-resolution spectrographs. Each of them is composed of an off-axis Schmidt collimator that produces a 200 mm beam, which is split into three spectral arms by dichroics and directed to F/1.73 cameras with standard 6k x 6k 15 microns pixel CCD detectors.
Read the full abstract

All authors Florence Laurent, Didier Boudon, Eric Daguise, Remi Giroud, Aurelien Jarno, Alexandre Jeanneau, Andreas Kelz, Jens-Kristian Krogager, Victor Mauger-Vauglin, Jean-Emmanuel Migniau, Matthew Lehnert, Flora Paganelli, Arlette Pecontal, Emmanuel Pecontal, Alban Remillieux, Johan Richard, Allar Saviauk

Numerical Analysis

Projection-based low-rank assembly in IgA

Isogeometric Analysis (IgA) uses the same spline functions to represent the computational domain and to approximate the solution. This allows exact geometry descriptions, but the resulting mass and stiffness matrices are expensive to assemble and to store, especially in three dimensions. We present a projection-based low-rank approach for assembling the mass and stiffness tensors of orientation-preserving tensor-product B-spline geometries. For the mass tensor, we exploit the polynomial structure of the determinant of the Jacobian of the geometry map and represent it in reduced spline product spaces by univariate coefficient transfer operators; with exact quadrature and without truncation, the resulting low-rank tensor is an exact reformulation of the standard Galerkin mass tensor. For the stiffness tensor, we split the rational weight function into a polynomial numerator, again represented in reduced spline product spaces, and the reciprocal determinant, which is in general not a spline function and is therefore approximated by an $L^2$-projection onto a tensor-product spline space. Both constructions are carried out entirely in the tensor-train (TT) format, with the projection system solved by the alternating minimal energy (AMEn) method, so that full high-order coefficient tensors are never formed and the multidimensional integrals reduce to univariate integrals and contracted products. The method is implemented in MATLAB using GeoPDEs and the TT-Toolbox. Numerical experiments show that it is competitive with full assembly and with the interpolation-based low-rank method, and that it applies in two situations in which interpolation is problematic: a singular interpolation system and nearly singular geometries. The construction is restricted to orientation-preserving tensor-product B-spline geometries and does not cover NURBS.
Read the full abstract

Artificial Intelligence

Prompt-Robust Language Models: Which Training Strategies Work?

Despite their strong performance, large language models remain highly sensitive to prompt formulation. Prior work addresses this through refined data construction or through dedicated robustness objectives. We reproduce and compare these strategies under controlled conditions, and measure how effective they are in addressing models' prompt sensitivity. We find the current robustness fine-tuning methods improve over standard fine-tuning and in-context learning, but the best-to-worst prompt gap remains as high as 40-57% of performance. Moreover, the recent robustness-enhancing methods we test - CoIN for contrastive alignment and PPCL for consistency regularization - often fail to outperform the simplest data construction strategy: training on one template per batch. Our diagnostics explain these results. The auxiliary objectives move the quantity they penalize, but do not generalize beyond it. Additionally, data construction strategies differ due to the conflicting signs of per-template gradients on 57-64% of parameters. Thus, batches that mix formulations force the optimizer to reconcile competing updates instead of finding a shared, prompt-agnostic one.
Read the full abstract

Artificial Intelligence

H2Table: Hierarchical Hypergraph-Enhanced Large Language Models for Complex Table Reasoning

Tables are ubiquitous across diverse domains, yet reasoning over them remains a significant challenge for modern large language models (LLMs). Current approaches typically linearize tables into sequences, inherently overlooking their intrinsic two-dimensional and hierarchical structure. To address this, we propose H2Table (Hierarchical Hypergraph-Enhanced Table Reasoning), a novel framework that represents complex tables as hierarchical nested hypergraphs. To process this representation, we design a tailored hypergraph encoder to facilitate message passing between hyperedges (headers) and nodes (cells), thereby perceiving the semantic entailment relationships between them within complex tables. Furthermore, we introduce a set of learnable query vectors acting as a lightweight bridge to extract representative structural embeddings from the encoder into the LLM. Experimental results demonstrate that our approach effectively handles complex table question answering tasks with hierarchical nested headers. Notably, on the HiTab dataset, H2Table achieves an average improvement of 22.88% over state-of-the-art baselines on highly complex tables with a nesting depth of four. Our code is available at: https://github.com/lila120/h2table.
Read the full abstract

All authors Jia Ling, Yangfan Wang, Chen Tang, Haoming Tan, Yang Yang, Yi Guan, Jingchi Jiang

Machine Learning

REFACTOR-VLA: Unsupervised Library Learning of Typed Motor Programs

Most vision-language-action (VLA) models – OpenVLA, $\pi_0$, RT-2, RDT-1B – are monolithic: they emit raw motor commands or short action chunks without organizing behavior into reusable abstractions, so they degrade on long-horizon tasks and resist interpretation. Existing skill-discovery methods sidestep the core question of when two action sequences are behaviorally equivalent, either clustering contrastive embeddings or delegating the judgment to a language model uncalibrated to the robot's dynamics. We introduce REFACTOR-VLA, a wake/sleep system for learning reusable skills. Its sleep phase clusters motor-program fragments under a Behavioral-Equivalence Kernel (BEK) computed from rollouts of a learned latent world model $M_\phi$; its wake phase emits typed lambda terms over a Hindley–Milner-inspired vocabulary, consumed by a library-conditioned rectified-flow action decoder. Abstractions are admitted only if they pass Minimum Description Length and return-preservation gates. On LIBERO we report two findings. First, enlarging the world model from 188M to 430M parameters worsened performance on 4 of 4 suites, so capacity alone does not help. Second, the training objective matters far more: adding an auxiliary supervised contrastive (InfoNCE) loss during world-model warmup substantially improves sleep-phase clustering, giving Normalized Mutual Information at $n=3$ seeds of $0.462 \pm 0.021$ (object), $0.867 \pm 0.025$ (spatial), $0.915 \pm 0.013$ (goal) and $0.754 \pm 0.010$ (LIBERO-10), and beating the strongest published baseline on all 4 suites by a mean $\Delta = +0.184$. Across providers ($n=12$) the 95% bootstrap confidence interval for mean pairwise NMI is $[0.683, 0.729]$ (mean $0.705$). The sleep phase also yields the first real-LIBERO task-language library: the decoder uses 2 of 3 admitted abstractions and rewrites all 256 sampled demonstrations.
Read the full abstract

Optimization and Control

New insights into the NLP-Id bound for maximum-entropy sampling

We establish new properties of the NLP-Id upper bound for the maxi\-mum-entropy sampling problem (MESP). In particular, we give a detailed look at the concavity of its objective function as a function of the scaling parameter employed for NLP bounds for MESP. This leads to more relaxed choices for the scaling parameter for NLP-Id and even improved upper bounds for MESP.
Read the full abstract

All authors Kurt Anstreicher, Marcia Fampa, Jon Lee, Yongchun Li, Gabriel Ponte

Superconductivity

Thermodynamics of $T_{\rm c}$ suppression in far-overdoped Tl$_2$Ba$_2$CuO$_6$

The physical origin of the suppression of superconductivity with hole doping in overdoped cuprates remains unclear. We measure the electronic specific heat of microgram-scale Tl$_2$Ba$_2$CuO$_6$ crystals and find sharp superconducting anomalies persisting far into the overdoped regime. A weak-coupling BCS-like framework incorporating the known Fermi surface and cation disorder quantitatively reproduces the observed anomalies for $T_{\rm c}=14$-$25$ K and their weak doping dependence. The results show $T_{\rm c}(p)$ to be driven predominantly by a smoothly decreasing pairing strength.
Read the full abstract

All authors Ayanesh Maiti, David M. Broun, Seunghyun Khim, Michal Moravec, Antony Carrington, Carsten Putzke, Vivek Mishra, Peter Hirschfeld, Andrew P. Mackenzie, Andreas W. Rost

Machine Learning

Recent Developments in Transformer Inference Deployment on FPGA Platforms: A Survey

With the rapid and continuous growth in the incorporation of machine learning models based on the Transformer architecture, capable deployment is in high demand. In this context, capable deployment refers to operational performance aspects, e.g., throughput and latency, as well as efficiency aspects, e.g., energy consumption. When it comes to the task of inference using such models, purpose-built hardware accelerators provide a lucrative alternative to common deployment choices, such as Central Processing Units (CPUs) and Graphics Processing Units (GPUs). The Field Programmable Gate Array (FPGA) platforms category is an example of such alternative accelerators, promising implementation flexibility, energy efficiency, improved latency and suitability for on-site deployment. We investigate the most recent advances, trends, and design choices for Transformer inference on FPGA platforms. We perform a systematic literature review, extracting and delving into preferred techniques for implementation and optimisation. This study and the provided taxonomy of topics could act as a guide for researchers from the academia and industry alike.
Read the full abstract

Systems and Control

Geometric Fixed-Time Sliding Mode Control for Constrained Attitude Tracking on $\mathrm{SO}(3)$

This paper studies constrained spacecraft attitude tracking on the Riemannian configuration manifold $\mathrm{SO}(3)$ in the presence of multiple attitude pointing constraints and matched external disturbances. To address this, an attitude potential function is proposed intrinsically on $\mathrm{SO}(3)$, and its key properties are established using intrinsic geometric analysis. Under mild conditions, the potential function is shown to admit a unique nondegenerate minimum at the desired attitude over the admissible subset of $\mathrm{SO}(3)$, defined by excluding the forbidden attitude regions as well as a measure-zero set, thereby ensuring a well-posed constrained attitude tracking problem. A Riemannian Hessian analysis shows that the Hessian of the potential function is locally uniform positive definite in an open neighborhood of the desired attitude, thereby establishing local strong convexity. A nonsingular fixed-time geometric sliding manifold is proposed using the Riemannian gradient of the potential function, leading to a geometric fixed-time sliding-mode-based constrained attitude control law. It is shown that, for every initial attitude in the admissible subset, the closed-loop state trajectory evolves on $\mathrm{SO}(3)\times\mathbb{R}^3$, with the attitude remaining in the admissible subset throughout the maneuver, while the state converges to a sufficiently small compact neighborhood of the desired equilibrium in a prescribed fixed time. Numerical simulations validate the proposed control approach and illustrate the theoretical results.
Read the full abstract

Cryptography and Security

Who Judges the Judges? A Chinese Safety QA Benchmark for Evaluating LLM Responses and Safety Judges

Safety benchmarks for large language models often assess the risk of a user query, although the outcome of question answering depends on whether the response violates a policy. This distinction is critical in Chinese harmful-content evaluation, where linguistic variation and adversarial transformations can obscure risky intent. We introduce C-SafeQA, a policy-grounded benchmark for response-level Chinese safety evaluation. It comprises 538 base queries and 8,877 adversarial queries answered by four full-model LLM deployments, yielding 37,660 query-response records labeled safe, unsafe, or disputed. Reference labels are generated through agreement-aware multi-model adjudication and blind audits of stratified subsets by three safety experts. C-SafeQA supports both evaluation of target-model safety and auditing of seven automated safety judges against shared reference labels. Unsafe-response rates range from 0.93% to 3.35% on base queries and from 11.68% to 30.05% on adversarial queries. On the adversarial subset, judges show substantial trade-offs between unsafe-response recall and risk-query-conditioned safe-response false positive rate, and no judge dominates all metrics. Both acrostic transformations reduce unsafe recall for all seven judges, revealing mechanism-specific evaluator weaknesses. Dataset records, metadata, verification code, and judge scripts are publicly released to support recomputation, while benchmark construction, target-response generation, and private adjudication remain outside the release boundary.
Read the full abstract

All authors Rui Yang, Shuang Huang, Junhua Liu, Ziqi Zhao, Qingzhong Yan, Yuhang Sun, Cong Liu, Guoping Hu, Rui Mei, Jing Shao

Materials Science

Autonomous discovery of new structure-plausibility laws for explainable and rapid crystal diagnosis and screening

Crystal generators and tool-using agents propose structures faster than density functional theory (DFT) energy and phonon calculations or experiments can assess them. Deciding which candidates merit expensive assessment is therefore the bottleneck, yet most screens test little beyond atomic overlap and give no chemical reason for failure. Here, our agents generate, test and actively refute two million candidate laws, leaving eight Plausibility Rules for Inorganic Structures (PRIS). These laws encode five mechanisms: short-range repulsion, ionic contact and packing, electrostatic balance, bond-valence conservation and crystallographic site complexity. Experimental structures satisfy our law sets at 82–99%, but satisfy Pauling's rules 2–5 together at only 6.5%. The strictest set detects 87.9% of damaged crystal structures, whereas distance cutoffs detect only 1.6–3.2%. PRIS plausibility is linearly correlated with synthesizability, so the PRIS-derived synthesis score (PSS) explainably screens 83.7% of hard-to-synthesize structures while retaining 80.7% of experimental structures. In a property-conditioned inverse-design run, PRIS and PSS can reduce the DFT validation queue by up to 67.3% and keep 99.2% of the candidates whose DFT-validated bulk moduli reach the design target. Beyond screening, PRIS explains why GNoME remains enriched in rare low-symmetry structures and reveals how wrong-element assignments in falsified crystal reports hide behind plausible coordinates. PRIS moves screening from a pass-or-fail verdict to a chemical reason for failure, showing that autonomous agents can discover, by active refutation, physicochemical laws that guide calculations and experiments.
Read the full abstract

Astrophysics of Galaxies

Slow stellar halo rotation as a signature of disc flips and GES-like mergers

The stellar halo of the Milky Way (MW) exhibits a weak net prograde rotational signal ($v_{\phi} \lesssim 25$ km~s$^{-1}$), yet its origin remains unexplained. To investigate this, we use the Auriga cosmological simulation suite of MW-mass haloes to probe the rotation of stellar haloes over the redshift range $z_{\mathrm{red}}=0-2.5$. The rotational signal is found to persist over this redshift range. We show that satellite progenitors of the stellar halo exhibit a non-uniform distribution of infall directions, with a tendency to align with the host disc, albeit with significant scatter. Thus, we attribute the net rotation to the anisotropic accretion of satellites. Haloes that host Gaia-Enceladus-Sausage (GES)-like substructures exhibit consistently slower rotational velocity, likely due to the head-on, more radial trajectory of the dominant progenitor in such systems. Haloes whose stellar discs have reorientated by $\geq 90^{\circ}$ also exhibit slower rotation, likely because the longer dynamical timescales of haloes prevent them from quickly adjusting to disc reorientations. We also report a correlation between the rotation of stellar and dark matter haloes, suggesting a possible common origin driven by anisotropic accretion. We therefore suggest that the MW experienced a disc flip and has a slowly rotating dark matter halo.
Read the full abstract

All authors Kirill Batrakov, Alis J. Deason, Francesca Fragkoudi, Thomas Tomlinson, Azadeh Fattahi, Vasily Belokurov

Robotics

On Global Regulatability of Robot Manipulators by Classical PID

A long-standing open problem in robot manipulator control is whether global regulation can be achieved by classical PID control. This paper provides an answer to this question for classical PID controllers with triple parameters (k_p,k_i,k_d) in R^3. We find and prove that for one-degree-of-freedom manipulators, the classical PID control guarantees global stability and asymptotic regulation under standard structural assumptions, and further derive explicit quantitative design conditions for the PID gains. However, for multi-degree-of-freedom cases, we can construct a robot manipulator satisfying the same structural assumptions for which no choice of PID gains (k_p,k_i,k_d) can achieve global asymptotic regulation. These results provide a fundamental understanding of the abovementioned open problem, revealing both the fundamental capability and intrinsic limitation of the classical PID control for robot manipulator dynamics.
Read the full abstract

Solar and Stellar Astrophysics

A wavelet-based model of magnetic turbulence over a Parker spiral field

The propagation of Solar Energetic Particles (SEPs) through the heliosphere is strongly influenced by solar-wind magnetic turbulence, which governs particle scattering, field-line wandering, and cross-field transport. These processes shape SEP intensity profiles, anisotropies, and arrival times. Because heliospheric turbulence spans a vast range of scales, direct numerical simulations cannot capture its full spectrum. Synthetic turbulence models provide an efficient alternative by generating fields with prescribed statistical and spectral properties, enabling realistic studies of SEP transport. This work presents a numerical model able to generate synthetic magnetic turbulence in the heliosphere with the goal of studying field line and particle diffusion. The model is inspired by in situ solar wind observations, indicating that solar wind turbulence properties vary with the distance from the Sun. We extend the Cartesian wavelet-based Synthetic Turbulence Model (STM), presented in \cite{Malara2016PhRvE..94e3109M}, to the non-homogeneous expanding solar wind. This is achieved by finding a suitable change of coordinates that allows one to pass from a space in which the turbulence correlation length is homogeneous to one in which it is not. We present the analytical derivation, the numerical implementation, and testing. We obtain an improved and computationally efficient synthetic turbulence model characterized by a background Parker spiral, a broad inertial range and tunable radial scalings for both the correlation length and the magnetic-field fluctuation amplitude, as well as a controllable level of intermittency. The model capability of reproducing solar wind turbulence up to the particle Larmor scale and to take into account solar wind radial evolution makes it a powerful tool to study the propagation of SEPs throughout the heliosphere.
Read the full abstract

All authors Andrea Larosa, Francesco Pucci, Francesco Malara, Oreste Pezzi, Silvia Perri, Gaetano Zimbardo, Giuseppe Nisticò, Federica Chiappetta, Massimo Chimenti, Luca Sorriso-Salvo

Astrophysics of Galaxies

The Physical Conditions of Low-Mass Galaxies at z=3.5-7.0 from JWST Spectroscopy: The Behaviour of Spectral Line Ratios with Burstiness

We present a study of the physical conditions of galaxies at redshifts $z=3.5-7.0$, based on emission-line diagnostics of JWST NIRSpec spectra for 1889 star-forming sources spanning more than 4~dex in stellar mass. We find that the median H$\alpha$/H$\beta$ and [OIII]/H$\beta$ are constant throughout these redshifts, indicating a slow evolution of the interstellar medium conditions from the Epoch of Reionization to Cosmic Noon. The stellar-mass evolution of these line ratios follow the expected trend for chemical enrichment and dust build-up, with \ohb~being maximum for galaxies with $\rm M_{\star} \approx 10^9 \, \rm M_\odot$, and the medians of H$\alpha$/H$\beta$ and [OII]/H$\beta$ monotonically increasing from $\rm{M}_{\rm \star} \approx 10^7$ through $ \approx 10^{10}\, \rm M_\odot$. Focusing on the 1552 low stellar-mass ($<10^9 \, \rm M_\odot$) galaxies, we particularly investigate the behaviour of the main spectral-line ratios with burstiness. We find a significantly higher degree of scatter in [OIII]/H$\beta$ and [OII]/H$\beta$ for high-burstiness than for low-burstiness galaxies. Values of log([OIII]/H$\beta$)~$\gtrsim 0.8$ are almost exclusively seen amongst those with high burstiness. Meanwhile, log([OIII]/H$\beta$)~$\lesssim 0.3$ are virtually not found amongst high-burstiness galaxies, except at the lowest stellar masses $\mathrm{log(M_\star/M_\odot)}<7.5$. Our results are consistent with a scenario in which star-formation bursts produce temporary chemical enrichment that is quickly lost via stellar winds. They also suggest that metallicity measures in bursting galaxies are unstable, and that the search for the most metal-poor objects should optimally be conducted amongst low-burstiness or very low-stellar mass sources.
Read the full abstract

All authors Ryan A. Cooper, Karina I. Caputi, Alessandro Marconi, Anna Feltre, Edoardo Iani, Pierluigi Rinaldi, Guillaume Desprez, Harley Katz

Quantum Physics

Unbiased sampling from Boltzmann distributions with noisy energies

Sampling from the Boltzmann distribution is central to computational physics, yet hard when the energy is known only through a stochastic estimate, such as with machine-learned molecular potentials, in variational Monte Carlo, or on quantum computers, because a noisy energy biases the sampled distribution. The penalty method of Ceperley and Dewing corrects this but requires the noise variance and becomes intractable when it is large. We introduce the Poisson product estimator, an unbiased, non-negative estimator of the Boltzmann weight that only needs an upper bound on the energy estimator and remains efficient at high noise. Using it to optimize a variational quantum circuit gradient-free, we recover the $H_3^+$ ground-state energy in a minimal basis and, by sampling rather than following a single trajectory, also map the variational energy landscape.
Read the full abstract

High Energy Physics (Phenomenology)

Angular correlations and polarization in $Z$+jet production at the LHC

Precision studies at the LHC increasingly require theoretical control over QCD radiation beyond fixed-order perturbation theory, particularly in final states characterised by large separations in rapidity. High-energy logarithms can generate corrections at the ten-percent level even for electroweak-scale observables, as recently observed in Higgs production, motivating their systematic inclusion in precision analyses. We investigate this regime through Drell$-$Yan plus jet production, with particular emphasis on $Z$-boson final states and their angular and polarisation structure. High-energy logarithms are resummed at next-to-leading logarithmic accuracy and consistently combined with NLO fixed-order information. Beyond inclusive rapidity and transverse-momentum spectra, the framework resolves the azimuthal harmonic content of the process, whose pattern is reshaped by the transition from leading- to next-to-leading-order emission dynamics. We further develop the JETHAD$-$DYnamis$-$POWHEG strategy towards realistic lepton-level predictions, retaining spin correlations, decay-angle information, and experimentally accessible kinematics. This programme establishes $Z$+jet production as a precision probe of high-energy QCD dynamics for Run~3 and the HL-LHC.
Read the full abstract

Computation and Language

Towards AI-Assisted Clinical Trial Matching: Practical Considerations, Multicenter Evaluation, and Real-World Deployment

Clinical trials are essential for evidence-based medicine and drug development, but many fail because of insufficient patient enrollment. Although there is growing interest in using AI to support patient recruitment, existing systems largely perform eligibility assessment alone and have rarely been evaluated in real-world workflows. Here we present TrialGPT 2.0, an AI-assisted clinical trial recommendation system improved for responsible real-world deployment. Rather than asking only whether a patient may qualify, the system assesses which trials warrant further consideration given the patient's current clinical needs and local workflow priorities, and provides structured, inspectable explanations for expert review. Importantly, we evaluated TrialGPT 2.0 retrospectively and prospectively across government research, patient-advocacy, academic medical center, and community-based radiation-oncology settings. In retrospective multicenter cohorts comprising 288 cases, TrialGPT 2.0 retrieved at least one clinician-recommended trial in its top 10 recommendations for approximately 91% of cases while reducing clinician screening time by 55.0%. In a six-month prospective evaluation embedded in an active precision oncology tumor board, TrialGPT 2.0 contributed additional trial opportunities missed by the routine workflow, increasing the number of patient cases with at least one final trial recommendation by 90.9%. To support scientific reproducibility, we also developed NIH-TrialBench, a clinician-authored benchmark comprising 126 diverse synthetic patient vignettes and matching scenarios from 11 NIH Institutes and Centers. Together, these findings support the value of AI to assist clinical trial matching by improving clinician efficiency and identifying frequently overlooked trial opportunities, ultimately helping to expand and accelerate accrual to cancer trials.
Read the full abstract

All authors Yin Fang, Qiao Jin, Shubo Tian, Lauren He, Maya Geer, Noor Naffakh, Ryan Huu-Tuan Nguyen, Zifeng Wang, Jimeng Sun, Charalampos S. Floudas, James L. Gulley, Kamilia Moalem, Catarina Martins Maia, Amanda Nottke, Juan W. Valle, Melinda Bachini, Lourdes Rocha-Nussbaum, Kari Ramage, Nikita Curry, Megan Barnes, Mandy Mansaray, Darlene Gabeau, Craig E. Grossman, Heath Skinner, Michael Burczynski, NIH-TrialBench Consortium, Zhiyong Lu

Cryptography and Security

Identification of Compositional Risks in Data Protection Impact Assessments and Beyond

When personal data is processed in a distributed manner by cooperating service providers, privacy risks may emerge solely from the choice of data processors included in the composition. For instance, different data processors may unknowingly rely on the same cloud provider, allowing for unintended linkability of personal data at that very provider. As such compositional risks to privacy are beyond the scope of each individual risk assessment, they are likely to be overseen when performing a data protection impact assessment. In this paper, we propose a novel protocol to detect and manage such compositional risks to privacy. Following an initial problem definition and requirements elicitation, we elaborate how our protocol identifies candidates for compositional risks and how this information may be used to improve the results of a data protection impact assessment over service compositions including multiple data processors.
Read the full abstract

All authors Henrik Graßhoff, Meiko Jensen, Malte Hansen, Nils Gruschka

Computer Vision

Compressing AI Traffic: Standardized Neural Network Coding of Visual-Token Representations in Split Vision-Language Inference

When the visual encoder and the language decoder of a vision-language model (VLM) run on different compute nodes, the intermediate visual-token embeddings become a communicated payload rather than an internal activation. We call such machine-consumed intermediate tensors AI traffic and ask how far they can be compressed with a standardized, training-free codec. We insert ISO/IEC 15938-17 Neural Network Coding (NNC) round trips on the complete visual interface of a Qwen3-VL-8B-Instruct video question answering pipeline, comprising the main visual-token representation and the DeepStack feature streams, while leaving weights, prompts, and generation untouched, and sweep the quantization parameter (QP) over a wide rate range. Closed-ended Video-MME accuracy remains close to the uncompressed reference up to a 98% reduction of the transmitted BF16 tensor and only then collapses; open-ended MLVU generation shows the same plateau-and-collapse profile under an LLM judge. This robustness is not due to near-lossless reconstruction: the decoded tensor is heavily discretized, carries substantial row-wise relative L2 error, and has a visibly steeper singular-value decay than its source. Downstream reasoning therefore depends on coarse structure and relative geometry rather than exact floating-point values, which argues for rate-task rather than rate-distortion optimization of AI traffic codecs.
Read the full abstract

Instrumentation and Methods for Astrophysics

Exploring reinforcement learning to enhance focal-plane wavefront control for vortex coronagraphs

High Contrast Imaging (HCI) on ground-based telescopes suffers from phase aberrations on the observed wavefront caused by atmospheric turbulence. Adaptive Optics (AO) systems are adept at correcting these aberrations, but fall short in the correction of non-common path aberrations (NCPAs). NCPAs arise because the wavefront sensor (WFS) measures and corrects a wavefront that is different from that affecting the science images, thus requiring additional intervention. This work makes use of focal-plane wavefront sensing and reinforcement learning (RL) to address the wavefront aberrations caused by NCPAs. The PO4NCPA algorithm utilizes sequential phase diversity to address phase ambiguities and is tested on a simulation designed for the Mid-infrared ELT Imager and Spectrograph (METIS) instrument. In this paper, we present the performance of PO4NCPA with scalar and vector vortex coronagraphs to demonstrate its flexibility.
Read the full abstract

All authors Iremsu Taskin, Jalo Nousiainen, Gilles Orban de Xivry, Olivier Absil, Markus Kasper

Artificial Intelligence

FinLifeBench: Exhaustive Life-Event History and Financial-State Reconstruction from Longitudinal Banking Dialogue

Repeated banking interactions require assistants to maintain complete, current, and traceable customer records as life changes emerge incidentally in routine requests. Existing benchmarks emphasize question answering, bounded episodes, or targeted recall rather than exhaustive longitudinal reconstruction. We introduce FinLifeBench, which evaluates two tasks over the same cumulative dialogue: reconstructing every life-event instance with its first-establishing session and reconstructing a complete 34-path financial state at consecutive checkpoints. The benchmark contains 6,000 eight-turn Korean banking sessions from 20 independent synthetic trajectories, with deterministic, exhaustive gold for 24 event types and 34 state paths and consensus quality assurance. Across eleven LLMs under a full-context condition, event-anchor recall falls from 0.591 at 15 sessions to 0.445 at 300. Errors are driven primarily by omitted events rather than poor anchor localization, while financial-state reconstruction frequently treats superseded or potentially outdated information as current; the best GCA@15 reaches 0.470. Performance on the two reconstruction tasks is only weakly associated. These results show that models can localize evidence for recovered events while still failing to maintain complete and temporally valid longitudinal records.
Read the full abstract

All authors Hangyeul Lee, Juyoung Oh, Jaeyong Ko, Sunmin Kim, Jaeik Park, Hyunkyu Kim, Jungmin Son, Pilsung Kang

Statistical Mechanics

Dynamical phase transitions for single particles in the semiclassical and weak noise limits

We present a unifying description of dynamical phase transitions in the unitary evolution of an isolated quantum particle and the dissipative relaxation of a classical Brownian particle, based on a dynamical generat- ing function. In the semiclassical and weak-noise limits, Fisher zeros of this function condense in the complex- time plane and reach the corresponding physical axes, producing dynamical phase transitions through a competition between return trajectories. This establishes a direct connection between quantum and classical (finite-time) dynamical phase transitions, where the semiclassical limit plays the role of the thermodynamic limit. In particular, the established link naturally provides a classical version of the Loschmidt amplitude and shows how dynamical quantum phase transitions, typically associated with isolated many-body systems, can arise in a single-particle quantum system. The dynamical phases are distinguished by a unifying, trajectory- based order parameter, realized as a classical correlation function and a sequential quantum weak value.
Read the full abstract

All authors Norayr Asriyan, Jan Meibohm, Vasco Cavina, Massimiliano Esposito

High Energy Physics (Phenomenology)

Deviation from $\mu-\tau$ reflection symmetry under radiative corrections in the minimal seesaw framework

The $\mu$-$\tau$ reflection symmetry predicts a maximal atmospheric mixing angle, $\theta_{23}=\pi/4$, and Dirac CP phase, $\delta=\pi/2$ or $3\pi/2$. Recent global analyses indicate small but significant deviations from these predictions, suggesting that the symmetry is approximate and requires breaking. Motivated by this, we study the breaking of $\mu$-$\tau$ reflection symmetry induced by radiative corrections in the minimal seesaw framework, assuming the symmetry to be exact at the high-energy seesaw scale $\Lambda_{\mu\tau}=10^{14}~\mathrm{GeV}$. A distinctive feature of the minimal seesaw is that one light neutrino remains massless, leaving only one physical Majorana CP phase. Starting from the integral solution of the one-loop RGE for the effective Majorana neutrino mass matrix, we derive analytical expressions for the low-energy neutrino parameters at $\Lambda_{\mathrm{EW}}=172.76~\mathrm{GeV}$ in terms of their high-energy counterparts. We then numerically estimate the low-energy parameters within the MSSM, taking $\Lambda_s=1~\mathrm{TeV}$ and $\tan\beta=10$, $30$ and $50$. The analysis is performed separately for Normal Order (NO) and Inverted Order (IO). We find that the predicted neutrino masses and mixing parameters are consistent with current experimental data in both scenarios. The sum of neutrino masses, Jarlskog invariant $J$, and effective Majorana mass $|\langle m\rangle_{ee}|$ also satisfy current experimental constraints. Finally, we estimate the amount of deviations of the low-energy neutrino parameters from their high-energy values and investigate their dependence on $\tan\beta$. We find that the magnitude of these deviations increases with increasing $\tan\beta$ for both NO and IO.
Read the full abstract

Computation and Language

CaRL-EM: Cost-Aware Reinforcement Learning for Entity Matching with LLMs

Entity matching (EM) requires fine-grained contextual understanding and domain knowledge. Recent work shows that large language models (LLMs) can serve as strong matchers across domains, but most methods either make independent pairwise decisions or rely on manually designed composite pipelines, thus lacking flexibility in realistic multi-candidate settings. At the same time, they typically ignore inference cost at scale. We formulate LLM-based EM with candidates as a cost-aware sequential decision problem and propose CaRL-EM, a reinforcement learning controller that manages LLM operations. Given the state of an anchor record, its candidate set, and the cost, CaRL-EM adaptively chooses among different operators (Match/Compare/Select/Decide) and model capacities to maximize a quality-cost objective. The policy interacts with abstract operators, allowing the same controller to be reused with different underlying LLM backends at inference time without retraining. Experiments on 7 benchmarks show that CaRL-EM (i) learns to dynamically plan the usage of inexpensive and expensive operators based on task complexity, (ii) achieves robust zero-shot transfer across diverse datasets and domains, and (iii) consistently achieves a better quality-cost trade-off than strong LLM-based baselines and manually designed pipelines, yielding a lower inference cost at comparable or higher quality.
Read the full abstract

Machine Learning

Births are difficult to predict even with rich survey and full-population register data

Major life events have proven difficult to predict. Does this reflect limits of theory, data, and algorithms, or the large role of chance? We examine one outcome - having a child within three years - through a near-ideal setting for prediction: a data challenge where 147 researchers predicted births for Dutch residents aged 18-45, using survey data and full-population registers. Methods ranged from logistic regression to a large language model and transformers. Predictions were moderately accurate (best F1: register 0.59, survey 0.76); advanced models did not outperform classical ones; and the larger registers did not beat the survey. Simulating the stochastic biology of conception and pregnancy, we estimated a predictive ceiling (survey F1 ~ 0.86-0.94, register 0.88-0.96). Observed performance falls short of this ceiling, implicating imperfect data, methods, and unmodelled chance, while the ceiling itself shows that chance in reproduction alone sets a non-trivial limit on predicting individual lives.
Read the full abstract

All authors Elizaveta Sivak, Emily M. Cantrell, Thomas Emery, Javier Garcia-Bernardo, Flavio Hafner, Kasia Karpinska, Malte Lüken, Adrienne Mendrik, Joris Mulder, Hanzhang Ren, Varun Satish, Mark Verhagen, Angelica M. Maineri, Paulina Pankowska, Jasmin Abdel Ghany, Bruno Arpino, Giovanni Cassani, Julia Hellstrand, Katya Ivanova, Sanni Kuikka, Ana Macanovic, Charles Rahal, Felix C. Tropf, Roland J. Veen, Nicole Walasek, Daniël van Wijk, Kelsey Q. Wright, Emilio Zagheni, Henry Abbink, Emanuele Aliverti, Matteo Amestoy, Tilbe Atav, Nicola Barban, Sunnee Billingsley, Goan J. Booij, Louis Boucherie, Yael Broos, Li Ya Chang, Jamie C. Chiu, Chiara Ludovica Comolli, Boris Cule, Qixiang Fang, Dennis M. Feehan, Rachel Ganly, Erwin Gielens, Rolando M. Gonzales Martinez, Andrea Gradassi, Rosember Guerra-Urzola, Mario Guerra-Urzola, Stéphane Guerrier, Enamul Hassan, Vincent A. Haverhoek, Andrew T. Hendrickson, Amber Howard, Yuxuan Jin, Sayash Kapoor, Erik-Jan van Kesteren, Iris ten Klooster, Marie Labussiere, Lydia T. Liu, Tiffany Liu, Adam Maghout, Simone Meneghello, Lasse Mohr, Clara H. Mulder, Saul J. Newman, Jessica Nisén, Janis Norden, Mikkel Odgaard, Riccardo Omenti, Ozancan Ozdemir, Christina Pao, Paige Park, Gaia Penta, Juan C. Perdomo, Tanzir Pial, Alessio Piraccini, Federica Querin, Ziwei Rao, Christian Rellama, Adrien Remund, Frederieke Richert, Arnout van de Rijt, Mojtaba Rostami Kandroodi, Stijn J. Rotman, Lucas Sage, Germans Savcisens, Katrin Schwanitz, Steven Skiena, Alessandro Spata, Yannick Stadtfeld, Benedikt Stroebl, Gaetano Tedesco, Mathilde Theelen, Gianluca Tori, Abigail Tun-Mendicuti, Rishabh Tyagi, Keyon Vafa, Luiz Felipe Vecchietti, Linda Vecgaile, Willem R. J. Vermeulen, Maria-Pia Victoria Feser, Lionel A. Voirol, Thom B. Volker, Xinran Wang, Jiani Yan, Xinyi Zhao, Flora Zhou, Zuzana Zilincikova, Malvina Nissim, Matthew J. Salganik, Gert Stulp

Cosmology and Nongalactic Astrophysics

Angular power spectrum of induced gravitational waves: breaking model and parameter degeneracies in PTA observations

Large primordial curvature and tensor perturbations on small scales can generate second-order tensor-scalar induced gravitational waves (TSIGWs) through scalar-scalar, tensor-scalar, and tensor-tensor source terms. TSIGWs are recognized as one of the principal contributors to the stochastic gravitational wave background (SGWB) observations. We explore the energy density spectrum of second-order TSIGWs in the presence of non-Gaussian primordial curvature perturbations. Furthermore, we present the first calculation of the anisotropic angular power spectrum associated with second-order TSIGWs, which provides a promising tool to discriminate them from other SGWB sources.
Read the full abstract

Formal Languages and Automata

Verification of $K$- and Infinite-Step Strong/Weak Anonymity Using Concurrent Compositions

Anonymity is an information flow property that provides privacy protection in the sense of non-uniqueness of system information at certain moments with respect to observations. The notion of $K$-step anonymity in the context of discrete-event systems characterizes the scenario that the state estimates cannot be a singleton within at most $K$ observational steps prior to the current instant, while infinite-step anonymity is the same as $K$-step anonymity without considering the limit on $K$. In this paper, we lucubrate $K$- and infinite-step anonymity for partially-observed discrete-event systems modeled by non-deterministic finite-state automata. First, we define two strong types and two weak types of $K$- and infinite-step anonymity that are fundamentally different from the existing notions of $K$- and infinite-step anonymity due to the consideration of strong and weak anonymous projections. Then, we develop a new methodology by exploiting the concurrent-composition technique to verify these four types of anonymity. Based on the constructed concurrent compositions, verifiable necessary and sufficient conditions for the four types of anonymity are provided, along with their complexity analysis. Finally, the upper bounds on $K$ for $K$-step strong anonymity and weak anonymity are computed.
Read the full abstract

All authors Jiahui Zhang, Kuize Zhang, Xiaoguang Han, Zhiwu Li