Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Monday 31 August

Artificial Intelligence

Automated Testing of LLM-Based Post Hoc Explainers Using Model Checking as an Oracle

Large language models (LLMs) are used as post hoc explainers of sequential decision-making policies, producing natural-language explanations of why an action was chosen. However, LLMs often generate plausible but incorrect statements, and no existing approach systematically tests whether such explanations are faithful to the underlying environment. Two classic software testing challenges stand in the way: there is no oracle for the correctness of an explanation, and the test inputs, natural language queries about a policy's behavior, lack the structure needed for systematic test case generation. We address both. Probabilistic model checking provides the test oracle, computing exact reference results against which LLM answers are graded automatically. A taxonomy of post hoc query categories structures the input space around the environment-level facts from which policy explanations are composed; test cases generated from it are prioritized by question-specific diagnostic difficulty scores. Across seven MDP environments, the testing separates three open-weight LLMs: a reasoning model passes 85% of test cases, a mid-size model 70%, and a 1B model falls below the random baseline, while prioritization surfaces significantly harder cases than random selection. Our results indicate how trustworthy LLM-generated explanations are in model-free settings, where the same LLMs are used but no oracle exists to verify them.
Read the full abstract

Logic in Computer Science

Unary Functions, Automorphisms, and Unlabeled First-Order Model Counting

Every fixed first-order sentence $\varphi$ determines an enumerative sequence $n\mapsto \mathrm{FOMC}(\varphi,n)$, counting its models on the labeled domain $[n]$. We study the complexity of these sequences when logical specifications may use genuine unary function symbols and hence nested terms such as $x,f(x),f^2(x),\ldots$. We prove that, for every fixed sentence $\varphi\in \mathrm{C}^1_{=}[f]$ with one unary function and an arbitrary finite relational vocabulary, $\mathrm{FOMC}(\varphi,n)$ is computable in time polynomial in $n$. By contrast, either a second variable or a second unary function yields hardness: there is a fixed sentence in $\mathrm{FO}^2_{=}[f]$ whose model-counting function is $\#\mathrm{P}_1$-complete, and there is a fixed constant-free universal sentence in $\mathrm{FO}^1_{=}[f,g]$, using only unary predicates besides $f$ and $g$, with the same property. We also relate labeled and unlabeled enumeration exactly. For every relational sentence $\varphi$, we construct an extension $\varphi_{\mathrm{aut}}$ in which a unary function records an automorphism and $\mathrm{FOMC}(\varphi_{\mathrm{aut}},n)=n! \cdot \mathrm{UFOMC}(\varphi,n)$, where $\mathrm{UFOMC}(\varphi,n)$ counts the $n$-element models of $\varphi$ up to isomorphism. This gives a one-query exact reduction from unlabeled to labeled model counting at the same domain size. If $\varphi$ belongs to $\mathrm{FO}^k_{=}$, respectively $\mathrm{C}^k$, and its relational vocabulary has maximum arity $r$, eliminating the auxiliary function yields a single-query reduction to labeled model counting in $\mathrm{FO}^{\max\{k,r+1\}}_{=}$, respectively $\mathrm{C}^{\max\{k,r+1\}}$.
Read the full abstract

Probability

A Finite-Entropy Criterion for the Entropic Conditional Central Limit Theorem

We prove a finite-entropy criterion for the entropic conditional central limit theorem. Let $(\xi_i,\eta_i)_{i\geq 1}$ be independent copies of a pair $(\xi,\eta)$, and set $W_n=n^{-1/2}\sum_{i=1}^n \xi_i$ and $\boldsymbol{\eta}_n=(\eta_1,\ldots,\eta_n)$. Under the assumptions that $\mathbb{E}\operatorname{Var}(\xi\mid\eta)<\infty$ and that the conditional law of $\xi$ given $\eta$ is absolutely continuous almost surely, we show that $\mathbb{E}h(W_n\mid\boldsymbol{\eta}_n)$ converges to the Gaussian entropy $\frac12\log(2\pi e\sigma^2)$, where $\sigma^2=\mathbb{E}\operatorname{Var}(\xi\mid\eta)$, if and only if $\mathbb{E}h(W_{n_0}\mid\boldsymbol{\eta}_{n_0})>-\infty$ for some $n_0$. The main technical ingredient is a continuity theorem for Fisher information under Gaussian smoothing, which allows us to replace the finite expected conditional Fisher-information assumption by a necessary and sufficient finite-entropy condition.
Read the full abstract

All authors Tong Ye, Liu-Quan Yao, Shuai Yuan, Guanghui Wang

Analysis of PDEs

Compactly Supported Solutions near a Nehari Critical Value

We study non-negative solutions of the indefinite sublinear Dirichlet problem $$ \left \{\ \begin{array}{ll} -\Delta u=\lambda u+m(x)|u|^{\alpha -1}u&\quad\hbox{ in $\Omega$},\\ u=0&\quad \hbox{ on $\partial \Omega$}, \end{array} \right . $$ where $\Omega \subset \mathbb{R}^{N}$ is a smooth bounded domain, $0<\alpha <1$, $m\in L^{\infty }(\Omega )$ is a sign-changing or non-positive weight, and $\lambda \in \mathbb{R}$.
Read the full abstract

Algebraic Geometry

Kempe factorizations for rational curves on $\operatorname{SO}_4(\mathbb{R})$

We study constructive Kempe factorizations for rational curves on $\operatorname{SO}_4(\mathbb{R})$. Motivated by motion-polynomial factorization and rational matrix curves on real classical groups, we prove that every rational curve of degree $2d$ with $d\ge1$ first factors into $d$ quadratic rational curves and then into a product of at most $2d$ planar rotation curves, where each planar rotation curve fixes a two-dimensional plane pointwise. The construction proceeds by extracting left and right isoclinic polynomial parts via Cayley's factorization, factoring the corresponding quaternion polynomials, and pairing linear factors with equal norm polynomials. The resulting algorithms are explicit and are illustrated by examples.
Read the full abstract

Number Theory

Relative Langlands duality of the Bump-Friedberg-Ginzburg $\mathrm{GSO}_6$-integral

We provide a new instance of singular relative Langlands duality, underlying a Rankin-Selberg integral on $\mathrm{GSO}_6$ due to Bump-Friedberg-Ginzburg. We conclude that this integral represents an essentially self-dual object in the relative Langlands program, and we demonstrate that the Langlands dual automorphic integral computes a finite sum of $L$-functions, reflecting stacky structure on the spectral side.
Read the full abstract

Classical Analysis and ODEs

A Counterexample to Belinsky's Conjecture on Cesàro Means at Lebesgue Points

In 1997, Belinsky conjectured that, for convex subsequences, the logarithmic growth condition of Carleson, Trigub, and Zagorodniĭ is necessary and sufficient for the arithmetic means of subsequential Fourier partial sums to converge at every Lebesgue point of every integrable function. We disprove the sufficiency part of this conjecture. More precisely, we construct a strictly convex increasing sequence $(a_m)$ satisfying $a_m\leq 7m^8$ and a function $f\in L^1(\mathbb T)$ for which $0$ is a Lebesgue point, $f(0)=0$, and the means $m^{-1}\sum_{k=1}^m S_{a_k}f(0)$ are unbounded.
Read the full abstract

Systems and Control

Exposing the Invisible: Detecting Stealthy Parameter-Based Cyber-Attacks on Inverter Synchronization Loops

The increasing integration of Internet-of-Things (IoT) technologies for monitoring and control of inverter-based resources (IBRs) has expanded the attack surface, enabling stealthy manipulation of controller parameters through vulnerable supervisory control interfaces. Phase-locked loops (PLLs) emerge as prime targets, as they interact with all control loops and critically influence the dynamic response of grid-following (GFL) converters. This paper analyzes the underlying threat model to elucidate the mechanisms enabling such stealthy behavior and conducts a thorough stability and transient response analysis to characterize how PLL tampering can degrade system performance without necessarily destabilizing the system. The results reveal critical interactions among frequency estimation, control, and synchronization that can significantly reduce stability margins. To counter the stealthy nature of these attacks, a modified PLL is proposed that exposes gain variations through shifts in its equilibrium points while preserving conventional PLL performance. Experimental results validate the effectiveness of the proposed approach in detecting PLL cyber-attacks.
Read the full abstract

Nuclear Theory

NS-UNO: Neutron Star EoS Inference from an Unconstrained Number of Observations

Future multimessenger observations of neutron stars (NS) are expected to substantially increase both the number and precision of astrophysical constraints on the equation of state (EoS) of dense matter. This motivates inference frameworks capable of accommodating a variable, non fixed number of observations while preserving the posterior information associated with each measurement. In this work, we introduce NS-UNO, a Neural Posterior Estimation framework for NS EoS inference designed to accommodate an Unconstrained Number of Observations (UNO). NS-UNO combines a hierarchical DeepSets model with a conditional normalising flow, enabling a single trained model to perform inference from mass-radius observation sets of varying size, with each observation represented by a set of posterior samples. We demonstrate accurate and well calibrated posterior reconstructions using a model trained jointly on piecewise polytropic and non-parametric Gaussian process EoS ensembles. The reconstruction improves as observations probe a broader range of NS masses, while remaining robust to variations in the number and precision of the observations. The model also generalises to EoSs outside the families used during training. Finally, we qualitatively demonstrate the framework on current multimessenger constraints from NICER and GW170817. NS-UNO provides a flexible and scalable approach to NS EoS inference, naturally suited to the increasingly diverse observational datasets expected from next generation multimessenger astronomy.
Read the full abstract

All authors Valéria Carvalho, Márcio Ferreira, Michał Bejger, Constança Providência

Software Engineering

Practical Implementation Report on Introducing Spec-Driven Development Using AI Agents in Software Development PBL

In recent years, autonomous AI agents such as GitHub Copilot and Claude Code have been rapidly gaining popularity. This study reports on the practical implementation of Spec-Driven Development, a software development methodology premised on AI agents, within a Software Development Project-Based Learning (SDPBL) course for third-year undergraduate students. We defined a workflow consisting of four phases, namely investigation, planning, implementation, and review. We also established an environment tailored for the SDPBL course where AI agents generate documentation and code during each phase. We analyzed the results from three perspectives, namely students' subjective AI usage, implementation throughput, and code comprehension. The analysis reveals that AI usage patterns varied across development phases and teams. Moreover, while AI agent utilization increased implementation throughput, it also tended to encourage students to proceed with development without fully understanding the code. This study demonstrates that regular verification of code comprehension by instructors and appropriate feedback are essential for maintaining educational effectiveness when introducing SDD into SDPBL.
Read the full abstract

All authors Hidetake Tanaka, Hiroshi Igaki, Kazumasa Shimari, Kiyoshi Honda, Naoki Fukuyasu

Optimization and Control

Last two pieces of the puzzle for unsolvability of a system of two quadratic (in)equalities

Given two quadratic functions \( f(x) = x^T Ax + 2a^T x + a_0 \) and \( g(x) = x^T Bx + 2b^T x + b_0 ,\) each associated with either the strict inequality ($<0$); non-strict inequality ($\leq 0$); or the equality ($=0$), it is a fundamental question to ask whether or not the joint system has a solution. For homogeneous quadratic systems ($a=b=0,~a_0=b_0=0$), starting from Finsler's lemma in 1936 until Yuan's alternative lemma in 1990, all combinations of the unsolvability for $\{x\in \mathbb{R} ^n\mid x^T Ax \mathbin{\star } 0\}\cap \{x\in \mathbb{R} ^n\mid x^T Bx \mathbin{\#} 0\}\subset \{0\}$, where $\star $ and $\#$ can be any of $\{<,\leq ,=\}$, have been shown to possess either a positive definite or a positive semi-definite matrix pencil of $A$ and $B.$ Extensions to nonhomogeneous quadratic systems $\{x\in \mathbb{R} ^n\mid f(x) \mathbin{\star } 0\}\cap \{x\in \mathbb{R} ^n\mid g(x) \mathbin{\#} 0\}=\emptyset $ have been done for several cases already. Two challenging cases remain open: the nonhomogeneous Calabi Theorem which determines when $\{f(x)=0\}\cap \{g(x)=0\}=\emptyset $; and the nonhomogeneous (strict) Finsler lemma to determine whether $\{f(x)\leq 0\}\cap \{g(x)=0\}=\emptyset .$ The paper provides the answers to both, in theorems and algorithms.
Read the full abstract

Differential Geometry

A Bernstein type theorem for a two dimensional translating soliton in ${\mathbb R}^4$ with finite total curvature

In this paper, we prove that any two dimensional complete translating soliton in ${\mathbb R}^4$ with finite total curvature is a plane. It is in fact a consequence of our main result.
Read the full abstract

All authors Xiaoli Han, Jiayu Li, Jun Sun, Jie Zhou

Statistics Applications

Long-Memory Estimation and Fractionally Integrated Modeling of White Maize Prices in Togo

Agricultural commodity prices often exhibit strong temporal persistence, which may limit the performance of conventional time series models. This study investigates long memory in logarithmic monthly white maize prices from six major markets in Togo between January 2001 and June 2022. Long memory is examined using the Geweke–Porter–Hudak, Local Whittle, Exact Local Whittle, and wavelet log-regression estimators. SARIMA, ARFIMA, and SARFIMA models are subsequently compared using the Bayesian Information Criterion and residual diagnostics. Long-range dependence is found across all markets. Fractionally integrated models provide the best fit for most markets, although SARIMA remains preferable for some. The results demonstrate that evidence of long memory does not necessarily imply that a fractionally integrated model provides the best empirical fit, emphasizing the importance of data-driven model selection.
Read the full abstract

Machine Learning

Collapsibility of Performance Metrics in Clinical Predictive AI

Background: Population level assessments of predictive artificial intelligence (AI) can conceal performance disparities across subgroups. Fairness evaluations commonly rely on performance analyses across subgroups. However, some performance metrics are non-collapsible, meaning that the overall population performance value does not equal the weighted average of subgroup specific values. Objective: To examine the collapsibility properties of commonly reported performance metrics in predictive AI, with a focus on the area under the receiver operating characteristic curve (AUC, also known as c-statistic). Methods: We investigate the collapsibility of 15 performance metrics, either by expressing each metric as a linear combination of its stratum specific values or, where non-collapsible, by providing a counterexample inspired by Simpson's paradox as a formal disproof. Results: Five performance metrics (AUC, calibration intercept, calibration slope, expected calibration error, and Nagelkerke R^2) are shown to be non-collapsible, and ten (O:E ratio, logloss, Brier score, accuracy, F1-score, true positive rate, true negative rate, positive predictive value, negative predictive value, and net benefit) are shown to be collapsible. The AUC is shown to be non-collapsible because it decomposes into within- and cross-group AUC terms when subpopulations coexist, such that its overall value may fall outside the range of subgroup specific AUCs. Conclusions: Non-collapsibility of performance metrics has important consequences for reporting, model appraisal, and fairness evaluation. It can generate spurious differences between subgroup and overall performance, which may mislead fairness evaluations. Explicitly acknowledging and reporting the collapsibility properties of performance metrics improves both the interpretability and transparency of fairness assessments.
Read the full abstract

All authors João Matos, Ben Van Calster, Richard D. Riley, Paula Dhiman, Gary S. Collins

Artificial Intelligence

TuringLLM: Efficiently Scaling Foundation Models Toward Physical AI

We present Turing-20B-A2B, a 20B-parameter Mixture-of-Experts language model that activates approximately 2B parameters per token, designed for long-context and latency-sensitive physical AI applications. The model adopts Quantile Routing in a dynamic top-k configuration, enabling token-adaptive expert allocation while maintaining balanced expert utilization and a controlled average compute budget. During deployment, we further apply capacity-constrained routing to prompt prefill for more regular and efficient expert execution, while retaining dropless routing during pretraining. Turing-20B-A2B also employs a hybrid attention architecture that combines Lightning Attention with a small number of full-attention layers for efficient long-context modeling. The model is pretrained with a progressive three-stage curriculum and extended to a native context length of 128K through continued pretraining, with further inference-time extension to 512K using YaRN. Despite its compact active-parameter budget, Turing-20B-A2B achieves, at the base-model stage, overall general capability exceeding Qwen3-8B Base and approaching Qwen3.5-9B Base, while maintaining strong long-context performance and favorable prefill-latency scaling. These results demonstrate an effective balance among model capability, long-context scalability, and practical inference efficiency.
Read the full abstract

All authors Yuheng Zhang, Yizhao Wang, Da Zhu, Hua Zhou, Yue He, Jiahui Hu, Shaman Tang, Hanlin Chen, Yuhua Wei, Anhua Liu, Shuang Su, Rui Xin, MingYuan Wang, MingHao Li, HaoJie Yang, Siqi Liu, Jianlei Zheng, WeiChao Huang, Qiman Wu, Hang Zhang, HongGou Yang, Xianming Liu

Soft Condensed Matter

A closed-form theory of charge-regulated electrostatic interactions between anisotropically charged spheres

Proteins and many other colloids carry ionizable surface groups that are both spatially inhomogeneous (patchy) and pH-responsive (charge-regulating). In the description of the electrostatic interactions between such particles, these two aspects are often treated separately, especially from a theoretical perspective. We present a unified, closed-form theory that unites charge regulation and patchiness within the linearized Poisson–Boltzmann approximation. For spherical particles with anisotropic distributions of titratable sites, we derive both the leading-order mean-field interaction energy as well as the Kirkwood–Shumaker fluctuation interaction. The theory exposes a qualitatively new effect between two electroneutral anisotropic particles: proximity-induced charge regulation generates a net monopole, and splits orientational branches that are {mirror-symmetric} in any linear fixed-charge model. The accompanying correction to the interaction energy has no fixed sign—it weakens like-charge repulsion but can deepen an existing attraction or create one where fixed charge predicts none. We benchmark three components of the theory against published results, as no existing simulation probes their combination, which would capture the central prediction of the theory. Lastly, we apply the theory to two proteins—lysozyme and $\alpha$-chymotrypsinogen A—and show that it not only reproduces the general trends of the measured second virial coefficients but also predicts how charge regulation expands the range of pH and screening strength where the protein–protein interaction is attractive.
Read the full abstract

Computational Physics

OpenMUSTANC (MUltiple Scattering Theory At Nanoplasmonic Cavities): A MATLAB toolbox for the simulation of Plasmonic Sphere Aggregates

Mesoscopic physical models, including the Hydrodynamic Drude Model (HDM), the Generalized Nonlocal Optical Response (GNOR) Model, and the Surface Response Model (SRM), have been proposed to investigate nonlocal effects in nanometric structures. The combination of classical electromagnetism with these mesoscopic material models calls for new computational electromagnetic (CEM) algorithms, or update of conventional ones, in what is termed computational mesoscopic electromagnetics (CMEM). In this work, we present a MATLAB toolbox for the simulation of multiple spherical interfaces with arbitrary relative positions, with the incorporation of the aforementioned mesoscopic models. The method exploits vector spherical wave functions to properly express electric and magnetic fields, an S matrix formulation for the efficient treatment of incident and scattered fields at spherical interfaces, and a translation matrix to deal with propagating waves with different expansion centers. Excitation sources can be chosen among arbitrarily polarized plane waves, dipoles and electron beams. For the post-processing part, the calculation of cross sections and far/near-field mapping; fluorescence enhancement, Purcell factor and quantum yield; and cathodoluminescence and electron energy-loss probability is implemented. The toolbox is built in a modular manner, and each part (routine) has its own important functionality. This paper provides a full explanation of the proposed highly efficient and general toolbox, and a detailed guideline for researchers in the nanoplasmonics community.
Read the full abstract

All authors Xin Zheng, Christos Mystilidis, Christos Tserkezis, Guy A. E. Vandenbosch, Xuezhi Zheng

Machine Learning

Q-Strata: Hierarchical Bit Allocation for Mixed-Precision Quantization of Mixture-of-Experts LLMs

Mixed-precision quantization (MPQ) assigns a different bitwidth to each linear layer of a large language model (LLM) to minimize the quantization-induced quality loss under a fixed budget, but Mixture-of-Experts (MoE) models contain these layers in every expert of every MoE block, so the allocation space grows far larger than in a dense model. Existing methods either allocate within each block under a uniform per-block budget, or allocate across blocks through an additive proxy, and neither directly optimizes a model-level objective over the choices that couple the blocks. We propose Q-Strata, a bi-level allocator that ranks within-block assignments with a cheap proxy and allocates across blocks with a model-level objective evaluated on the assembled quantized model. Its inner stage caches a Pareto frontier of candidates per block over finely spaced budgets, leaving the outer stage to set one budget per block instead of a bitwidth for every linear layer. With the search reduced to one budget per block, the outer stage optimizes this model-level objective directly, capturing the inter-block coupling that additive proxies miss. On Mixtral-8x7B-Instruct, Qwen1.5-MoE-A2.7B, and DeepSeek-V2-Lite, Q-Strata consistently achieves lower WikiText2 perplexity than uniform-bitwidth GPTQ and the state-of-the-art MoE MPQ methods MxMoE and GEMQ in the low-bit regime. The code is available at https://github.com/snu-mllab/Q-Strata/tree/main.
Read the full abstract

Computer Vision

Modality Disentangled Learning for Incomplete Multimodal Emotion Recognition: A Primitive Memory Distillation Perspective

Multimodal Emotion Recognition (MER) systems often suffer from missing modalities in real-world scenarios. Existing methods usually generate, align, or distill missing modalities as a whole, overlooking the heterogeneous nature of the information carried by each modality. Such holistic treatment mixes inferable shared semantics with uncertain modality-specific details, yielding unstable representations and degrading robustness. To address this issue, we propose the Primitive Memory Distillation (PriMD) framework. Unlike existing methods, PriMD takes an intra-modal perspective and focuses on how different types of information within a modality differ in recoverability. PriMD first disentangles cross-modal shared semantics from modality-specific representations, and then discretizes the latter into learnable semantic primitives to construct modality-specific memory banks. When modalities are missing, PriMD is a teacher-student framework that the student model uses the shared semantics of available modalities as queries to dynamically retrieve primitives. It compensates for missing modality-specific information within a constrained memory space and aligns with the teacher model. Extensive experiments on IEMOCAP, CMU-MOSI, and CMU-MOSEI demonstrate that PriMD achieves state-of-the-art performance and consistently stronger robustness across a wide range of missing-modality settings, while mitigating the instability caused by holistic feature inference. Our code and project website are available at https://www.jiaqizhang-sengoku.com/Code/PriMD and https://www.jiaqizhang-sengoku.com/PriMD/ , respectively.
Read the full abstract

All authors Jiaqi Zhang, Zheng Pang, Mengting Li, Yiqi Wang, Guangyuan Dong, Chao Xue, Yusen Wu, Zihao Li, Huy Phan, Sicheng Zhao, Björn W. Schuller, Jiachen Luo

High Energy Astrophysical Phenomena

Cascades from ultra-high-energy neutrinos

Neutrinos produced at the highest energies can interact with cosmic neutrino and radiation backgrounds during their propagation to Earth. The many available $\nu\nu$, $\nu\bar{\nu}$, and $\nu\gamma$ channels can lead to their absorption or energy redistribution, whilst the leptonic and hadronic final states may feed secondary fluxes of neutrinos, protons, and electromagnetic particles through the decay or hadronisation of the heavy leptons, bosons, and quarks produced. We present a framework to characterise these propagation effects in detail, \texttt{$\nu$propa}, an extension of the CRPropa Monte Carlo code that interfaces with event generators and to dedicated computations of the relevant cross sections. It also treats flavour oscillations in vacuum. Using this code, we investigate sources at high redshifts ($z = 10$), and find a strong absorption of the prompt flux beyond~$\sim 10^{21} \; \text{eV}$, although the copious secondary neutrinos partially compensate this depletion, also contributing to the spectrum at lower energies. The framework is designed to study scenarios of cosmological neutrino production beyond~EeV energies such as superheavy dark matter, cosmic strings, and primordial black holes, and to yield reliable predictions for the forthcoming neutrino observatories.
Read the full abstract

All authors Gaetano Di Marco, Rhorry Gauld, Rafael Alves Batista, Alfonso García-Soto, Miguel Á. Sánchez-Conde

Machine Learning (Statistics)

Informative Label Missingness in Multiclass Classification Information Geometry and Excess Risk

Informative label missingness can change the usual efficiency ordering between completely and partially labelled classifiers because the pattern of missing labels may itself carry information about the classification model. We develop a general likelihood-based theory for this phenomenon in parametric multiclass classification. An efficient-information decomposition separates information lost through unavailable class memberships from information contributed by the missing-label mechanism. We then derive a quadratic expansion of plug-in excess risk over the active pairwise faces of the multiclass Bayes boundary, showing that classification efficiency depends on how information gains and losses align with directions that perturb the decision boundary. This yields a classification-weighted generalized-eigenvalue criterion under which informative partial classification may have smaller asymptotic classification risk without globally dominating complete classification in Fisher information. Near missing completely at random, with the marginal missing-label proportion fixed, redistribution of missing labels changes lost class-label information at first order, whereas efficient information from the missingness pattern appears only at second order. Three-class quadratic discriminant calculations, finite-sample experiments, and a semi-synthetic multiclass application illustrate the resulting regime-dependent behaviour.
Read the full abstract

High Energy Physics (Phenomenology)

Charmonium production in p+A collisions at SPS and FAIR energies

We employ the Parton-Hadron-String Dynamics (PHSD) transport approach to investigate the influence of baryon-rich matter on charmonium production and dissociation. The Remler formalism is implemented to dynamically model charmonium formation from charm-anticharm pairs. As a validation step, the formalism is first benchmarked against experimental data from elementary pp collisions and then extended to pA systems to extract the effective nuclear absorption cross section of charmonium. This extracted cross section can subsequently be applied in heavy-ion collisions to quantify medium-induced effects. Our results demonstrate that the Remler formalism provides a quantitatively consistent description of charmonium production in pp and pA collisions at SPS energies. The approach is then extrapolated to GSI/FAIR energies, where predictions for charmonium yields and survival probabilities are presented. These findings highlight the relevance of the Remler formalism as a dynamical framework for studying heavy-quark bound-state formation in baryon-rich matter and offer theoretical guidance for future experimental programs at SPS, FAIR and NICA aimed at mapping the QCD phase structure.
Read the full abstract

All authors Taesoo Song, Jiaxing Zhao, Joerg Aichelin, Elena Bratkovskaya

Sound

SPHERE: Automatic Music Upmixing via Audio Language Model Post-Training with Spatial Heuristic Rewards

In this paper, we study the task of automatic music upmixing, wherein a system predicts spatial mixing parameters from a multi-stem recording. Different from existing methods that rely on task-specific music encoders, we approach this task via audio language model (ALM) post-training, leveraging rich representations from existing ALMs, which encode both music semantics and mixing knowledge. Specifically, we propose a post-training recipe that first employs rejection sampling SFT, followed by reinforcement learning (RL) with verifiable rewards (RLVR) via GRPO. We propose Sphere (Spatial Heuristic Rewards), a deterministic reward suite inspired by music mixing conventions, to guide our post-training. It consists of 6 perceptually-motivated sub-rewards and encourages the output mix to be centered, balanced and spacious. More broadly, our results suggest that expert domain knowledge can be encoded as verifiable rewards and distilled into language models, without task-specific architectures.
Read the full abstract

All authors Zixun Guo, Calvin Murdock, Sanjeel Parekh, W Owen Brimijoin, Simon Dixon, Joshua Reiss, Ishwarya Ananthabhotla

Mathematical Finance

A note on markets with semi-static trading strategies

We consider a discrete-time financial market model where, in addition to finitely many dynamically traded assets, there are also (possibly infinitely many) static options to choose from. We introduce the concept of small cones of random variables and present a sufficient condition for the attainable positions in the market to be closed in probability. A fundamental theorem of asset pricing is shown in the present context. Utility maximization will also be considered. We will provide economically meaningful examples of infinite dimensional small cones to demonstrate the pertinence of our approach.
Read the full abstract

Solar and Stellar Astrophysics

Interferometric Survey of Stellar Parameters: Towards homogeneous FGK stars parameters and surface-brightness color relation in the context of PLATO space mission

The estimation of stellar angular diameters can be performed from the surface brightness - color relation (SBCR) and photometry. The SBCR have been considered by the PLATO space mission as an independent empirical alternative for estimating stellar radii of FGK stars. In this context, we have implemented an homogeneous approach not only for calibrating the SBCR for FGK-IV/V stars but, also for determining their fundamental parameters in order to place the stars reliably on the HR diagram and to study their impact on the SBCR. We have performed interferometric observations of 18 quiescent FGK-IV/V stars in the Gaia color range of $3.088 \leq G \leq 5.498$. For the first time, we used 3 different interferometers operating in the $R$, $H$ , and $K$ bands to measure polychromatic limb-darkened angular diameters (LDAD). In parallel, by using public domain spectra we have estimated the stellar parameters ($T_{eff}$, $log g$ and Z) by using the open python tool iSpec. We achieved an average accuracy of 2.3% for the LDAD based on polychromatic observations. However, we have observed that our SBCR does not follow the calibration of the relation between surface brightness and color in Gaia found in the literature. Furthermore, we found that $log g$ and $Z$ have no impact on the SBC relation; given the characteristics of our sample of quiescent stars, it constitutes an ideal set of targets for conducting a new SBCR calibration within the framework of the PLATO space mission. In this context, we reported a SBCR calibration with $\sigma_{RMS} = $ 0.012, 0.009, 0.009 in the $G, G_{BP}$ and $G_{RP}$ Gaia bands, respectively. This article is part of a series of papers reporting the first results obtained using a polychromatic approach to measure LDAD, employing a fully homogeneous methodology for both determining the fundamental parameters of stars and measuring the LDAD, $\theta_{LD}$.
Read the full abstract

All authors Romina V. Ibañez Bustos, Denis Mourard, Nicolas Nardetto, Jeremy Jones, Nayeem Ebrahimkutty, Juraj Jonák, Hugo Nowacki, Mathieu Vrard, Philippe Berio, Julien Dejonghe, Roxanne Ligi, Frédéric Morand, David Salabert, Orlagh Creevey, Armando Domiciano de Souza, Manon Bailleul, Karine Perraut, Markus Wittkowski, John D. Monnier, Stefan Kraus, Narsireddy Anugu, Mayra Gutierrez, Noura Ibrahim

Artificial Intelligence

AdaPath: Query-Adaptive Path-Finding via Path-Bank for Multi-Hop Implicit Biomedical KGQA

Path-finding over knowledge graphs has become an effective way to ground LLM reasoning on multi-hop questions. However, biomedical QA introduces two distinct challenges that general-domain methods are not designed for: (i) queries do not expose intermediate reasoning and can be answered through multiple valid pathways, and (ii) biomedical knowledge graphs are densely connected, so path-finding methods easily take wrong turns. To address these challenges, we propose AdaPath, a path-finding framework that retrieves query-adaptive meta-paths from Path-Bank, which captures both query semantics and biomedical knowledge graph structure. AdaPath provides the missing cues in biomedical queries while effectively pruning dense knowledge graph neighborhoods during multi-hop reasoning. We further release BioStrat-QA, a biomedical KGQA benchmark that stratifies multi-hop queries by how much intermediate reasoning they expose. Across biomedical KGQA benchmarks, AdaPath consistently outperforms baselines, sustaining meaningful path-finding even when multi-hop queries expose less surface information. The source code is available at https://github.com/Jun-Hyeong-Kim/AdaPath.
Read the full abstract

All authors Jun Hyeong Kim, Dongki Kim, Yinhua Piao, Sung Ju Hwang

Combinatorics

Second Order Zarankiewicz Number

We introduce the second order Zarankiewicz number $z_2(m,n)$ for irreducible doubly simple biquadratic forms with $|E_1|=z(m,n)$, together with the intermediate recursive-line and signed parameters $z_{RL}(m,n)$ and $z_{SL}(m,n)$. They satisfy the unconditional hierarchy \[ \operatorname{BSR}(m,n) \ge z_2(m,n) \ge z_{SL}(m,n) \ge z_{RL}(m,n) \ge z_{wL}(m,n) \ge z(m,n), \] where $z_{RL}$ is defined by the strengthened recursive rectangle criterion $(RW3^+)$ together with the conditions $(S)$ and $C_4$-freeness of $G_1$, and $z_{SL}$ is defined by the signed criterion $(RW3^\pm)$. We show that $(RW3^+)$ is sound and strictly weaker than the literal weak cross-cell test $(W3)$ on the weak-admissible class, and that $(RW3^\pm)$ is likewise sound. At the smallest four-column cases we obtain \[ z_2(5,4)=z_{SL}(5,4)=z_{RL}(5,4)=13>12=z_{wL}(5,4), \] and \[ z_2(6,4)=z_{SL}(6,4)=z_{RL}(6,4)=16>14=z_{wL}(6,4). \] In three columns this yields \[ z_2(m,3)=z_{RL}(m,3)=2m \qquad \text{for all } m\ge 3, \] with strict separation from $z_{wL}(m,3)$ for every $m\ge10$, and exact gap $\lfloor(m-3)/3\rfloor$ for $m\ge16$. Further finite computations give $z_{RL}(5,5)=17$, $z_{RL}(7,4)=19$, and $z_{RL}(7,7)\ge32>28=z_{wL}(7,7)$. Along $N=2p$ with $p$ an odd prime, we obtain the cubic asymptotic separation \[ z_2\!\left(\binom{N}{2},N\right)-z_{wL}\!\left(\binom{N}{2},N\right)\ge \left(\frac{1}{16}-o(1)\right)N^3. \] For the exceptional incidence case $p=3$ we prove $z_{SL}(15,6)=z_2(15,6)=60$. Concurrent work of Chen and Chen, using the recursive-line definition introduced here, incorporates the finite recursive-line values of this manuscript and establishes further exact four-column values together with an eventual formula for all $m\ge15$. The conjectural equality $z_2=z_{RL}$ is supported by the exact two-column, three-column, four-column, and odd-prime incidence families.
Read the full abstract

Functional Analysis

Strong law of large numbers for generalized operator means II

In this paper we continue the investigation of generalizations of the strong law of large numbers to operator means which has been initiated in the earlier paper "Strong law of large numbers for generalized operator means", Adv. Math. 457 (2024), 109933 of the authors. In particular, we clarify an inaccuracy in the statement and proof of the strong law for means associated with uniformly exponentially contracting flows in Thompson metric spaces. We then significantly improve the variant of this strong law given in the mentioned paper for operator means by relaxing the restrictive required moment condition to $L\log^+(L)$ by proving almost sure convergence of implicit stochastic approximations for monotone operators under this condition.
Read the full abstract

Information Retrieval

Preference Shapes Relevance: Cross-component Hierarchical Semantic Alignment for Personalized Generative Retrieval

Generative Retrieval (GR) has emerged as a promising paradigm by mapping queries directly to Semantic IDs (SIDs) with powerful representation capabilities for candidate items. However, existing SIDs derived solely from item content create a semantic gap, failing to align dynamic query intents with static item representations. Furthermore, current generative paradigms rarely model user behavior sequences and are always bottlenecked by the high inference latency of beam-search autoregressive decoding. To address these challenges, we propose $\textbf{C}$ross-component $\textbf{H}$ierarchical semantic $\textbf{A}$lignment for $\textbf{P}$ersonalized generative retrieval ($\textbf{CHAP}$), a novel personalized GR framework from a hierarchical perspective. First, we design a Hierarchical Semantic Alignment module to align query's latent space with item's quantization path and synchronize multi-granular semantics. Second, we construct a personalized GR framework that models user behavior by synergizing discrete SIDs for structural guidance and continuous representations for fine-grained semantic refinement. Notably, we introduce a Residual Cascading Generation mechanism to restrict the costly multi-step Transformer Decoder to a single-pass inference, boosting inference throughput while mitigating information loss. Extensive experiments on three public datasets, one proprietary industrial dataset, and online A/B tests demonstrate CHAP's superiority, validating the effectiveness and practical value of our approach. The code is publicly available at https://github.com/zzzgm/CHAP.
Read the full abstract

All authors Gaoming Zhang, Angqing Jiang, Jianchun Song, Kena Qi, Dayao Chen, Wei Lin, Defu Lian

Materials Science

Heterogeneous ferroelectricity and conductivity of oxidized BaTiO$_3$ crystals: the role of nanoscale phase segregation in the surface region

We investigate the effect of thermal oxidation on BaTiO$_3$ single crystals. Our results reveal that, even at moderate temperatures of up to 1000 {\deg}C, complex segregation mechanisms occur involving the movement of Ba-rich compounds to the upper surface, where they form inhomogeneously distributed BaO nanocrystals. As a result, deeper regions of the surface layer become depleted in Ba and become TiO$_2$-rich. A sandwich-like structure evolves in the surface layer, exhibiting a measurable electromotive force and self-polarization. This, in turn, screens the polarization and diminishes the global ferroelectric response. The conductivity is also strongly influenced by the irreversible segregation effects in the surface region. An as-received crystal can be transformed into a metallic state, while oxidation induces semiconducting properties and prevents a return to the metallic state upon subsequent reduction. Nanoscale analysis demonstrates that the conductivity is channeled to filaments forming along dislocations, whose local chemical composition changes upon reduction and oxidation even at moderate temperatures due to preferential Ba and O pipe diffusion thus determining the electric behavior of the whole sample.
Read the full abstract

All authors Christian Rodenbücher, Gustav Bihlmayer, Susan Trolier-McKinstry, Jacek Szade, Franciszek Krok, Kristof Szot