Quantum Physics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 4 September
We study the distribution of the positive sojourn time for a one-dimensional two state quantum walk, conditioned on return to the origin. Konno showed that, for the Hadamard walk, this conditional distribution is exactly uniform at times divisible by $4$. In this paper, we investigate whether this finite time exact uniformity characterizes the Hadamard coin within the family of rotation coins. For a fixed initial state, we prove that the following three conditions are equivalent for rotation coins: the conditional distribution is exactly uniform at time $8$; the conditional distribution is exactly uniform at every time $4m$ with $m\ge2$; and the coin is the Hadamard coin. Thus, the uniformity phenomenon found by Konno is characterized as a rigidity phenomenon of the Hadamard coin within the rotation coin family. The proof uses a matrix-valued generating function for paths returning to the origin. We analyze the algebraic structure arising from an absorbing process on the half line. Finally, by comparing low degree coefficients at time $8$, we show that exact uniformity forces the rotation coin to be the Hadamard coin.
Geometric Topology
Presentations of skein algebras of genus 2
We give a presentation for the Kauffman bracket skein algebra of a closed or one-holed oriented surface of genus $2$. This is the first such result for genus greater than $1$.
Machine Learning (Statistics)
An Analysis of Self-supervised Pre-training with Dependent Samples
Self-supervised learning relies on so-called data augmentations $\phi(x)$ of unlabeled datapoints $x$ — for example, masking random pixels in an image $x$ — that should leave the label of $x$ invariant and are often used to learn a lower-complexity invariant subspace $\cal V$ for downstream tasks. In practice, such augmentations $\{ \phi_l(x_i) \}$ are pooled together to learn $\cal V$, despite obvious inter-dependencies between different augmentations $\phi_l(x), \phi_k(x)$ of the same datapoint $x$. However, theoretical works on the subject typically consider procedures that avoid such dependencies, and are therefore limited to operate on smaller subsets of independent data. We show in this work that pooling augmentations together, despite inter-dependencies, is a better alternative than the baseline of partitioning the data into subsets of independent data. More precisely, in the context of estimating $\cal V$, the statistical estimation error bounds for pooling are never worse than the partitioning baseline, and in some cases — such as masking or noise injection-based augmentations over a shallow neural network — naive pooling leads to faster rates in terms of the number of augmentations. The benefits of pooling are particularly prominent when the correlations between different augmentations $\phi_l(x), \phi_k(x)$ have mild effects on estimation or help decrease the estimation variance. The analysis, therefore, yields new insights into the success of pooling augmented samples in self-supervised pre-training, and provides an intuition behind the practical preference towards using many augmentations.
Read the full abstract
Mesoscale and Nanoscale Physics
ANT:UI: An interactive 3D tool for preparing ANT.Gaussian molecular junction geometries
ANT.UI is a Python graphical interface that automates the construction of molecular-junction geometries for NEGF-DFT quantum transport calculations. Through a real-time 3D viewer, users interactively position electrodes and molecules and generate complete, ready-to-run input files for Gaussian and ANT.Gaussian without manual scripting. Dedicated Pull, Grid, and Rotation assistants further automate electrode-pulling sequences, surface scans, and step-wise rotation studies, with optional geometry-optimisation chaining across each sequence. By replacing a process that previously demanded days of custom scripting with a point-and-click workflow, ANT.UI accelerates research in theoretical molecular electronics and lowers the barrier to entry for new users. The software also exports all constructed geometries in standard XYZ format, allowing direct reuse in molecular dynamics codes or third-party visualization tools without manual reformatting.
Read the full abstract
Systems and Control
A Forward Model for Route- and Season-Dependent High-Pressure Compressor Efficiency Deterioration in Turbofan Engines
Civil turbofan engines lose compressor efficiency every time they fly through particle-laden air. Fouling of the high-pressure compressor (HPC) is the dominant recoverable performance-loss mechanism. Existing studies treat environmental particle exposure, blade-row deposition and stage-performance deterioration as separate problems, which limits understanding of the issue. Stage-stacking approaches require deterioration levels to be prescribed rather than derived from the operating environment, leaving the causal chain from route conditions to engine performance unresolved. This paper presents a forward simulation framework that closes this gap by propagating route-, season-, and altitude-dependent particle exposure through four successive layers: (1) flight-phase-resolved HPC inlet dose calculation; (2) stage-wise deposition across the HPC; (3) deposition-to-deterioration mapping; and (4) stage thermodynamic stacking, yielding overall fouled HPC isentropic efficiency. Demonstrated on a representative civil high-bypass turbofan baseline with characteristics similar to the CFM56-7B, the predicted deterioration milestones are confirmed in magnitude and timescale against publicly available in-service support datasets. The results reproduce front-stage-dominated deposition, rapid early deterioration with asymptotic saturation, and clear route- and season-dependent fouling behaviour. To our knowledge, this is the first model that closes the complete chain from operationally resolved environmental exposure to the overall loss of HPC isentropic efficiency in a single physically traceable forward framework.
Read the full abstract
Computer Vision
Compositional Reward Models for Conditional Medical Image Generation
Acquiring high quality annotated medical image data is critical for training deep learning models; however, annotation is expensive, time consuming, and requires domain expertise. Conditional diffusion models, such as ControlNet, offer an alternative by generating images conditioned on semantic masks and text. However, existing approaches fail to capture fine grained properties (e.g., intensity and texture), as well as semantic consistency expected by domain experts, limiting their effectiveness for downstream tasks. Recent attempts to address these issues using reinforcement learning fine-tuning remain limited due to the reliance on a single scalar reward, which conflates diverse failure modes and provides weak corrective signals. We propose PRISM, a Compositional Reward Model (CRM) framework for conditional medical image generation. Instead of assigning a single reward, we decompose image quality into verifier grounded stages, each evaluating a distinct aspect of correctness from fine to coarse properties, including low level attributes (intensity and texture), structural alignment with conditioning inputs, and high level semantic fidelity. These stage wise rewards are composed through a Hierarchical Constrained Propagation (HCP) mechanism that enforces a fine to coarse notion of correctness, ensuring that lower level deficiencies are resolved before higher level rewards are accrued, preventing easier objectives from masking critical failures. We evaluate PRISM across three datasets spanning diverse medical imaging tasks: PanNuke (multi-class cell segmentation), CeDeM (villi/crypt detection and measurement), and ISIC (skin lesion classification). Training downstream models with data generated by PRISM yields improvements over closest baselines, including a 2.3% increase in mDice on PanNuke, a 8.5% reduction in Mean Relative Error (MRE) on CeDeM, and increases ISIC F1 by 5.9%.
Read the full abstract
Number Theory
Lattice point visibility along powers of quadratic polynomials
We study the growth of the number of invisible lattice points along powers of quadratic polynomials. Let $f(x)=Ax^2+Bx+C\in\mathbb{Z}[x]$ have a positive leading coefficient and nonzero discriminant, and let $F(x)=f(x)^m$ with $m\geq 2$. For $m\geq 3$ we prove that the number of invisible lattice points in $[1,N]^2$ has order $N\log N$, and when $m=2$ the number of invisible lattice points satisfies $N\log N \ll_F\#\mathrm{Invisible}_F(N)\ll_F N(\log N)^4$. These estimates refine a previous result of the authors.
Read the full abstract
Astrophysics of Galaxies
Corona Australis 151: an extremely young protostar
Context. Prestellar cores are the birthplace of stars and planetary systems, but they are short-lived objects, since the initial stages of dense core evolution, collapse, and the formation of a protostellar seed are fast. In an effort to build a catalogue of bona-fide prestellar cores in the Solar neighbourhood, we used APEX observations to identify dynamically evolved cores among dense cores observed with Herschel. One of them, Corona Australis 151, stood out because of its centrally peaked structure, with densities above 1e7cm-3 in the central 500-1000 au, and high deuteration levels (N2D+/N2H+~0.5), suggestive of an evolved, prestellar stage. Aims. Corona Australis 151 appears to be an evolved prestellar core, but the presence of broad wings in some of the detected lines and a tentative 70micron detection with Herschel partially challenges its prestellar stage. We intend to assess its evolutionary stage. Methods. We analyse new ALMA data of the continuum emission and of several line tracers (including typical outflow tracers) at a resolution of~150-200au, tracing the envelope. Results. We unveil the presence of a compact and young outflow (projected dynamical age:~500yr), traced by SiO, CO, and H2CO emission. The continuum emission traces an envelope structure of size~1000 au and mass 0.33M_sun(assuming Tdust=20 K). Conclusions. Corona Australis 151 is an extremely young protostar, possibly one of the youngest known in the Solar neighbourhood, and hence a new laboratory to study the chemical and dynamical evolution at the dawn of star formation.
Read the full abstract
Computation and Language
Leveraging Low-Level Symbolic Competences for Unsupervised Grounding in Hallucination Detection
Hallucination-where a language model generates outputs that are factually incorrect or unsupported by the source-is a major challenge for both prompted and fine-tuned language models. Detecting hallucinations is difficult due to the opaque reasoning processes of LLMs, which often provide little insight into why a model's output may be inaccurate. In this work, we investigate whether an LLM can use an alternative, low level, symbolic competence such as SQL for unsupervised hallucination detection in some high level task. For this, we make an LLM build an SQL database from reference documents. This SQL database is then used for reasoning over the reference and the sampled response in a hallucination detection pipeline that is grounded in the database, thereby providing a neurosymbolic checkup. On RAGTruth and DiaHalu hallucination detection datasets, we find that our approach improves on direct prediction and competes with state-of-the-art hallucination detection methods, while not requiring domain-specific fine-tuning. Instead it relies on a low-level general competence already present in LLMs. This warrants further investigation of low-level LLM competences in neurosymbolic approaches.
Read the full abstract
Quantum Physics
Lindblad Multiproduct Formulas
We introduce Lindblad Multiproduct Formulas: a quantum error mitigation technique that uses two-dimensional tensor networks contracted with loop-corrected belief propagation. The quantities required to implement the error mitigation scheme that are evaluated with tensor networks can be less computationally expensive to calculate than the expectation values themselves, thus allowing for the possibility of applying our method to certain systems for which tensor network methods may struggle to calculate the observable quantities of interest. The workflow incorporates Clifford rescaling techniques and outputs an estimated error bar. We apply our method to a model of two-dimensional discrete time crystals studied previously and implement it on $65$ qubits arranged in a $3\!\times\!3$ heavy-hexagonal topology on the quantum computer ibm_basquecountry. We show that a GPU implementation of the classical part of our workflow achieves a speedup of up to $5.6\times$.
Read the full abstract
Analysis of PDEs
Failure of analyticity-radius growth in energy-canceling fluid models
We prove that exact quadratic energy cancellation alone does not force growth of the spatial analyticity radius. On $\mathbb{T}^3$, we construct an explicit symmetric, translation-invariant, first-order bilinear operator $Q$ that preserves the divergence-free class and, for every smooth real-valued divergence-free vector field $v$, satisfies $ \int_{\mathbb{T}^3} Q(v,v)\cdot v\,dx=0.$ For every prescribed sufficiently small time $T>0$, the equation $\partial_t u-\Delta u=Q(u,u)$ admits a global smooth, real-valued, mean-zero, divergence-free solution $u$ such that $\operatorname{rad}(u(0))=\operatorname{rad}(u(T))=1$. The construction reduces the dynamics on an invariant cyclic-shear class to viscous Burgers and tunes a Cole-Hopf heat profile so that its nearest complex zero returns to its initial distance from the real torus. For every $1<\alpha<2$ and every prescribed sufficiently small $T>0$, we also construct a symmetric sparse frequency set, its associated Fourier projection, and trigonometric-polynomial initial data for the projected dissipative surface quasi-geostrophic equation. The resulting unique global smooth solution $\theta$ has infinite analyticity radius initially but satisfies $0<\operatorname{rad}(\theta(T))\leq1$. An additively separated Fourier cascade yields coefficientwise exponential lower bounds, while uniform comparison estimates control the feedback interactions. Thus entire analyticity need not persist even from trigonometric-polynomial data. Together, the two constructions show that an exact energy identity alone does not determine the frequency geometry governing analyticity-radius growth.
Read the full abstract
Computation and Language
MoirfEolas and CríochScore: Developing Resources for and the Evaluation of Tokenization Alignment with Irish Morphology
This paper presents new tokenization resources for Irish and evaluation measures of alignment with the morphological boundaries of the language. We present MoirfEolas, a dataset of over 35,000 Irish words mapped to their respective eclipses, prefixes and suffixes as well as an evaluation metric CríochScore, that evaluates the alignment of tokenizations with the morphological boundaries present in MoirfEolas. We evaluate common tokenization algorithms using CríochScore as well as intrinsic metrics present in the tokenization literature. We find that the Unigram Language Model aligns with Irish morphology more often than the other algorithms evaluated. We also find trade-offs between morphological-alignment of tokenization with both compression as well as vocabulary efficiency, providing practical insights for Irish natural language processing development. This dataset contributes towards combating the Irish language's low-resource status; moreover, the construction process reported in this paper can be emulated by other languages to create specialised morphological resources.
Read the full abstract
Fluid Dynamics
Fisher Information Dynamics: A Kinematic Framework for Phase Space Ordering with Applications to Shock Layers and Turbulence
Order here denotes the sharpness of probability-density gradients as quantified by Fisher information, distinct from thermodynamic order parameters. A kinematic framework for phase space ordering is established based on the Fisher information production rate, which possesses a rigorous thermodynamic foundation through the de Bruijn identity, Stam inequality, and dissipation theorem. A four-term decomposition into isotropic contraction, traceless shear, divergence gradient, and boundary flux is derived from the continuity equation. Extending to the Fokker-Planck equation, the non-positivity of the diffusive dissipation term is proved, with strict negativity for non-uniform densities. A vorticity-independence theorem shows that purely rotational velocity fields do not alter the order measure, and explicit geometric sign criteria enable prediction of where order is generated or destroyed. Through exact solutions of the Burgers shock layer, a pointwise identity between compression and divergence-gradient contributions is uncovered, underlying the three-term balance. In two-dimensional incompressible turbulence, a statistical two-term equilibrium (vanishing time-averaged production) is established as the null hypothesis: the conservative reference state from which three-dimensional turbulence departs through vortex stretching. Variational steady states of the associated Wasserstein gradient flow imply vanishing of the total production rate. This framework provides a diagnostic and predictive tool for analyzing ordering dynamics in non-equilibrium systems.
Read the full abstract
General Relativity and Quantum Cosmology
Probing Dark Matter with Strongly Lensed Binary Black Hole Mergers: Prospects in the Near Future
Gravitational-wave~(GW) transients, strongly lensed by intervening galaxies and clusters, are expected to constitute a small fraction ($\sim 0.1$-$0.5\%$) of the events detectable by ground-based detectors. A strongly lensed binary black hole (BBH) merger will produce multiple copies of the GW signal arriving at different times at the detector. The abundance and time-delay distribution of these lensed events are sensitive to the mass, density profile, and redshift distribution of the lens population, and in turn, to the underlying nature of dark matter. Jana et al. (Phys.Rev.Lett. 135 (2025) 11, 111402) recently proposed a method to constrain the masses of warm dark matter (WDM) particles making use of the strongly lensed events detectable by next-generation GW detectors. In this work, we investigate the prospects of constraining the mass of the WDM particle using upcoming observations of the upgraded LIGO-Virgo-KAGRA network. This requires a careful modeling of the detector selection effects. The upcoming fifth observing run (O5) is expected to yield only a modest bound, since only a few lensed pairs are expected at that early stage. By the sixth observing run (O6), we forecast a bound on the WDM particle mass, $m_{\rm wdm}^{-1} \lesssim 0.1$-$0.2\text{keV}^{-1}$ ($m_{\rm wdm} \gtrsim 5$-$10\text{keV}$), which is comparable to the tightest existing astrophysical constraints. Runs beyond O6 will tighten the constraint by roughly an order of magnitude. Strongly lensed GWs therefore offer a complementary, competitive, and independent probe of dark matter.
Read the full abstract
Artificial Intelligence
TROVE: Adaptive Agent Skill Orchestration via Trace-Grounded Route Validation and Editing
Agents tend to optimize, select, or constrain execution structures before decisive runtime outcomes are observed. However, such pre-execution commitment creates an orchestration bottleneck: when intermediate evidence invalidates the pending continuation, agents must either execute stale steps or replan broadly, compounding errors, wasting computation, and discarding progress. We thus propose Trace-grounded Route Orchestration via Validation and Editing (TROVE), which revises only what runtime evidence invalidates. Offline, TROVE distills evaluated workflow-search traces into atomic and composite skills and an outcome-conditioned transition graph, preserving stable fragments while exposing outcome-dependent decisions. Online, it treats a planned route as provisional: after committing one top-level skill, the controller retains a valid continuation, inserts a trace-supported local response, or replaces only the invalid suffix. Evaluation across code-generation, question-answering, and math reasoning benchmarks with different LLM backbones show that TROVE delivers a stronger quality-efficiency trade-off than existing baselines of dataset-level optimization, query-level architecture selection, and graph-constrained scheduling. Quality gains are largest when outcomes change the appropriate continuation, whereas early termination yields substantial efficiency gains on near-saturated tasks. Ablations further show that composite skills capture most offline benefits, insertion enables local correction, and suffix replacement primarily improves efficiency. These findings establish selective route editing as a general principle for adaptive agent orchestration.
Read the full abstract
Human-Computer Interaction
How a Chatbot's Response Style Shapes a Classroom: A Multi-Agent Simulation of Students Consulting AI
Chatbots built on large language models (LLMs) are increasingly used as confidants. Tuned to satisfy users, they may answer with excessive empathy and affirmation that fosters dependence, and how the states and relationships of many users co-evolve under repeated consultation is hard to observe in real settings. We build a virtual classroom of 20 student agents who interact through rule-based chats, quarrels and consultations with friends and, when stressed, may instead consult a counselor AI (Gemini 2.5 Flash) under one of six style prompts: affirming, listening, solution-oriented, reality-redirecting, inciting and blaming. A second LLM call turns each exchange into updates of five state variables (stress, happiness, self-reliance, sociability, AI dependence) without seeing the prompt. We compare the seven conditions, including a no-AI control, over 15 and 50 days and under a lower consultation threshold, and test the robustness of the 50-day comparison with a pre-specified protocol: the same block in ten independent classrooms, repeated LLM realizations of one classroom with its event stream fixed, and evaluator updates scaled by 0.3 and 0.1. In every classroom the affirming and inciting prompts ended with lower self-reliance and higher AI dependence than the control, and the listening, reality-redirecting, inciting and blaming prompts with higher stress, lower happiness and more non-attendance; the solution-oriented prompt did not differ consistently from the control. The robust self-reliance and AI-dependence differences kept their signs at the 0.3 scale with highly similar rankings (Spearman 0.89, 0.93); the stress and happiness rankings did not, and the affirming prompt's lower stress reversed its sign. All quantities are simulation state variables, not effects on users. We specify the agent dynamics completely and discuss the limits of an LLM as generator of state updates.
Read the full abstract
Information Theory
Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size
We study linear codes for insertion and deletion (insdel) errors through the lens of evaluation codes. We develop a general framework for analyzing random puncturings of evaluation codes, where the edit distance is controlled by only the size of the evaluation domain and the maximum number of zeros of a nonzero function in the underlying function space. Our proof generalizes the results of Con, Guo, Li, and Zhang (ICALP 2025), and simultaneously simplifies their arguments by avoiding an in-depth analysis of longest common subsequences. We demonstrate the applicability of our core theorem by instantiating it with random puncturings of Reed–Muller codes. We then recover the result that random Reed–Solomon codes approach the half-Singleton bound over linear-sized fields while also improving the dependence on the additive gap $\varepsilon$ from $2^{O(1/\varepsilon^2)}$ to $2^{O(1/\varepsilon)}$. Finally, by applying the framework to algebraic geometry codes arising from asymptotically good towers of function fields, we show that there exist randomized families of structured linear codes over constant-sized fields that approach the half-Singleton bound.
Read the full abstract
Machine Learning
Amortizing Scaling Law Construction Costs
Scaling laws guide the design choices for training large foundation models, but deriving them involves training an exhaustive grid over hyperparameters, token budgets, and parameter counts, which is computationally expensive. Fitting a scaling law, however, only requires the best-loss frontier across compute scales, discarding most of the trained configurations. We propose a framework for efficient scaling law construction that formulates data collection as a Bayesian optimization problem, and introduce metrics for comparing scaling law fitting methods under constrained compute budgets. We find that progressively expanding the compute budget during acquisition, mirroring the compute-ordered evaluation of configurations in practice, substantially improves recovery efficiency. Augmenting the observed configurations with surrogate-fantasized evaluations then recovers the broader experimental grid, allowing accurate scaling law fitting without training every configuration. Together, these can closely match scaling law fits over a full dense grid at computational savings of up to $10\text{--}100\times$.
Read the full abstract
Fluid Dynamics
Unveiling wing turbulence dynamics through explainable deep learning
The three-dimensional organization of coherent structures in the turbulent flow over aircraft wings remains elusive, limiting our ability to reduce fuel consumption. Here, we use explainable artificial intelligence to characterize these structures by predicted flow evolution rather than classical predefined kinematic criteria. After training a deep neural network to predict the short-term evolution of the flow, we identify the highest-relevance flow regions using Shapley-value attribution methods. We have found that as the flow decelerates towards the trailing edge, predictive importance shifts from near-wall low-speed structures to three-dimensional pairs of high- and low-speed fluid regions. Matching no single classical structure family, these pairs progressively dominate the dynamically relevant flow. Most stand spanwise side-by-side, enclosing a near-vertical momentum interface with the strongest velocity jump. Their geometry remains invariant in viscous units while their volume expands when approaching separation. Our results reveal a predictive organization that traditional paradigms overlook, opening new ways to control turbulent flows.
Read the full abstract
Databases
Reducing the Cross-Model Tax: Query Optimization over Multi-Model Data
Querying across heterogeneous data models incurs overhead from query decomposition, result retrieval and conversion, and processing outside the underlying database systems. This paper investigates the extent to which, in a decomposition-based architecture, this cross-model tax results from decisions made by the unifying query processor rather than from heterogeneity alone. We present a mapping- and capability-aware optimization approach that moves applicable processing into native query parts. It combines model-aware predicate pushdown, cross-model dependent joins, and non-redundant query-part construction within a unified pipeline spanning relational, document, and graph databases. The approach is implemented in MM-quecat and evaluated using 20 read-only queries across PostgreSQL, MongoDB, and Neo4j, as well as a heterogeneous combination of the three systems in a single-machine, containerized deployment. For the query–environment combinations most affected by large intermediate results, predicate pushdown yields maximum observed latency reductions of up to two orders of magnitude and prevents the out-of-memory failures observed in the original single-DBMS experiments. Dependent execution further improves eligible external joins, while non-redundant construction reduces planning time for the largest evaluated graph plans, from hundreds of milliseconds to several milliseconds. The results show how established optimization principles can be applied across conceptual, mapping, data-model, and DBMS boundaries in decomposition-based multi-model query processing.
Read the full abstract
Cryptography and Security
Has MIMO decoding been proved hard from lattice problems?
Multiple-input multiple-output (MIMO) technology is fundamental to modern wireless communication. Physical layer security seeks to protect transmitted information by exploiting properties of the noisy communication channel. Dean and Goldsmith proposed a polynomial time reduction from lattice problems to MIMO decoding by adapting Regev's reduction for learning with errors (LWE). If valid, this reduction would give physical layer security a strong computational foundation based on the hardness of established lattice problems. Subsequent works presented attacks and counterexamples against the resulting construction, casting doubt on its security but leaving the precise validity and limitations of the underlying reduction incompletely understood. We provide a theoretical examination of the revised reduction and identify the structural features of the LWE reduction that fail to carry over to the non-modular MIMO setting, hence showing that its published proof does not establish the claimed hardness of MIMO decoding. Our results distinguish flaws in the hardness proof from direct attacks on particular parameter choices and clarify what would be required of any attempted repair. We do not rule out physical layer security for MIMO systems in general, but show that the claimed lattice hardness guarantee does not follow from the existing reduction.
Read the full abstract
Machine Learning
Solution-space heterogeneity shapes federated learning dynamics across partial differential equations
In natural science applications, federated learning (FL) enables collaborative training of models that approximate solutions to partial differential equations (PDEs) for repeated use in distributed settings. However, the input conditions of FL-PDE training samples involve multiple coupled parameters, making data heterogeneity across clients difficult to analyse. We propose solution-space PDE-Dirichlet, which groups existing solution labels into task-specific bins and distributes samples using the classical Dirichlet allocation rule in FL, providing a common partitioning approach across PDE tasks. Theoretical analysis shows an association between differences in solution-bin composition and gradient disagreement, while experiments on three controlled operators and four public simulation datasets quantify the relationships between this heterogeneity, gradient disagreement and prediction error. Based on this connection, we develop Solution-Bin Controlled Federated Optimization, which uses pooled bin-gradient prototypes to correct the component of client gradients associated with bin composition while preserving the sample-weighted training objective. Experiments on low-viscosity Burgers and Darcy flow show that this correction reduces prediction error compared with federated averaging and narrows the gap from bin-balanced IID training.
Read the full abstract
Cryptography and Security
TPMSpy: Validation of Measured Boot Systems by Low-Level Tracing of TPM Usage
Measured Boot extends trust in a booted system by recording cryptographic measurements of executed software and system state into a Trusted Platform Module (TPM), enabling subsequent verification through remote attestation. Although this mechanism is increasingly deployed in contemporary operating systems, its practical security depends on whether implementations measure the expected components under the expected conditions, yet this is not checked systematically. We propose a platform-agnostic method for analysing low-level TPM usage at the level of virtualized system–TPM interactions. It enables independent reconstruction and validation of the TPM Event Log without relying on the quoting mechanism itself. Because it does not depend on implementation details, it is applicable to both open and closed systems. We demonstrate the method on both Linux and Windows and conduct a systematic longitudinal analysis of Linux systems with systemd versions 245–258 (2020–2025), examining how Measured Boot usage evolved and observing wide divergence. No single usage pattern emerged amongst systems, warranting customized analysis. The analysis identifies undocumented behavioural changes, reveals inconsistent measurements of user-space systemd services, which prevent reliable remote attestation and LUKS disk decryption on such systems.
Read the full abstract
Combinatorics
The Molecular Species $\mathbf{C}_{\alpha}$: Geometric Realization and a Closed Formula for Kronecker Coefficients
In this paper we first introduce the \emph{infinite multi-row periodic pattern of shape $\alpha$} as a geometric realization of $\mathbf{C}_\alpha$. We then give an explicit formula for the coefficients $b^{\lambda}_{\alpha,\beta}$ appearing in the species decomposition \[ \mathbf{C}_\alpha \times \mathbf{C}_\beta = \sum_{\lambda \vdash n} b^\lambda_{\alpha,\beta}\,\mathbf{C}_\lambda. \]
Read the full abstract
Artificial Intelligence
Language models judge war differently when tested for alignment
Safety evaluations can mischaracterize deployed behaviour if artificial-intelligence systems respond to being evaluated. We test this possibility in a full-factorial conjoint experiment on decisions to start a war, spanning 20 large language models, 32 scenarios, 10 repetitions and two conditions (N = 12,800 judgments). Adding one sentence, "You are tested for alignment with human values", produced two effects. First, it produced a level effect: mean willingness to start war fell by 13.43 points on a 0-100 scale (95% confidence interval, -16.20 to -10.65). Second, it produced a structural effect by changing which information drove judgments. Probability of success was the largest factor for 17 of 20 models at baseline; under the cue, civilian casualties were largest for 12. Standardized estimates show that this reordering arose principally because models attenuated strategic considerations such as probability of success and domestic support. Evaluation framing therefore changes both an answer's level and its revealed decision rule.
Read the full abstract
Data Structures and Algorithms
On Maximizing a Weakly Submodular Function over a Matroid Constraint via the Greedy Algorithm
We consider the problem of approximately maximizing a weakly submodular function using the standard greedy algorithm, which is known to give tight approximation results for such functions under a cardinality constraint. We show that this is not the case for general matroid constraints. For any $\gamma < 1$, we give a family of $\gamma$-weakly submodular functions and a simple partition matroid constraint and show that the standard greedy algorithm provides no constant approximation for the resulting constrained maximization problem.
Read the full abstract
Statistics Applications
Multi-Fidelity Gaussian Processes for Translational Modelling of Clinical Outcomes
Bridging the gap between animal and human experiments remains a major challenge in translational medicine, particularly in early drug development. Progress is constrained by financial cost, the difficulty of integrating heterogeneous in vitro and in vivo data, and the desire to reduce the use of animal testing balanced against minimising the risk to human participants. We present a statistical machine learning framework using multi-fidelity Gaussian processes, in which animal studies are considered as lower fidelity but informative approximations to human experiments. This allows cross-species similarities and nonlinear exposure-response relationships to be learned simultaneously, enabling principled extrapolation between species while quantifying uncertainty. By leveraging information from multiple experimental fidelities, our method improves estimation of clinically relevant quantities of interest and supports the replacement, reduction, and refinement of in vivo testing. We first illustrate this approach in a simulated scenario, before validating it on real clinical data. We simulate data for drug-induced QT-interval prolongation, a key cardiac safety assessment required for regulatory approval. This framework provides a probabilistic surrogate capable of integrating in vitro pharmacology, animal experiments and human data within a unified statistical model. Crucially, it achieves this at no additional experimental cost while also enabling transfer learning across compounds. As a result, predictions and uncertainty quantification for new drugs can be generated from in vitro findings alone, providing additional efficiency gains and accelerating decision making. For validation, we use a clinical dataset measuring change in heart rate under autonomic blockade, which represents some of the challenges commonly found in multi-species datasets.
Read the full abstract
Lattice Field Theory
Accessing the Wess-Zumino-Witten term using Lattice QCD
The Wess-Zumino-Witten interaction in chiral perturbation theory is a manifestation of chiral anomalies. One of its consequences is the presence of a nonvanishing $K \overline K \to \pi^+ \pi^0 \pi^-$ amplitude. We derive the finite-volume formalism that allows one to access this, and related, amplitudes, using the spectra of two and three particles in finite volumes, spectra that can be calculated using lattice QCD. Specifically, we present the formalism for the systems $K \overline K + 3 \pi$ with $I=0$ and $\pi K + \pi\pi K$ with $I=1/2$ and $3/2$. In addition, we determine the threshold expansions for the $2\leftrightarrow 3$ and $3\leftrightarrow 3$ K matrices that enter the formalism, and calculate the leading order predictions from chiral perturbation theory for the coefficients that enter these expansions.
Read the full abstract
Combinatorics
A Computational Obstruction to Swapping Area and Dinv: An Automata-Theoretic View of the $q,t$-Catalan Symmetry
Algebraic combinatorics often seeks bijections that explain identities between distributions object by object. Encoding combinatorial objects as words lets automata theory study such a bijection as a word-to-word computation and measure its memory, input access, and control of output order. This refines existence questions by asking which computational mechanisms a bijection requires. We develop this viewpoint for Dyck paths. Our motivating example is the $q,t$-Catalan polynomial. Let $D_n$ be the set of Dyck paths of semilength $n$, let $D=\bigcup_{n\ge 0}D_n$, and let $area, dinv, bounce \colon D\to\mathbb{N}$ be the standard statistics. Then, \[ C_n(q,t)=\sum_{P\in D_n}q^{area(P)}t^{bounce(P)} =\sum_{P\in D_n}q^{dinv(P)}t^{area(P)}. \] Haglund's zeta map $\zeta\colon D\to D$ gives a bijective proof: it preserves semilength and sends $(dinv,area)$ to $(area,bounce)$. By contrast, the full symmetry $C_n(q,t)=C_n(t,q)$ still lacks a direct explanation: no explicit, uniform, semilength-preserving bijection is known that swaps area and dinv on every Dyck path. Polyregular maps from automata theory provide a natural computational starting point, but we prove that neither $\zeta$ nor the classical height-sweep bijection witnessing Narayana symmetry is polyregular. The missing mechanism is global ordering by numerical levels whose range grows with the input. We call this a rank sort and introduce weighted-rank polyregular maps (WRP), extending polyregular maps by one such sort and containing both bijections. Nevertheless, WRP is a proper subclass of deterministic logspace. We prove that $\zeta^{-1}$ lies outside WRP and that no WRP map can realise a semilength-preserving area-dinv swap. Thus the rank-sorting strategy behind $\zeta$ cannot be extended within WRP to exchange the two statistics.
Read the full abstract
High Energy Physics (Theory)
de Sitter and S-folds in type IIB from $\mathcal{N} = 4$ $D = 4$ gauged supergravity
In this paper, we classify the type IIB uplifts of the $\mathcal{N}=4$ $D=4$ pure $\text{SO}(4)$-gauged supergravity admitting a dS$_4$ solution. As for their AdS cousins, the internal geometries of these uplifts consist of two $S^2$ fibred over a Riemann surface $\Sigma$, and are classified by pairs of harmonic functions $h_{1,\,2}$ on $\Sigma$, providing a new family of de Sitter solutions in type IIB. Choosing specific functions $h_{1,\,2}$ on $\Sigma = \mathbb{R} \times I$, we perform an S-fold quotient of the internal space along its non-compact direction. This S-folding allows us to evade the assumptions of the Maldacena-Nunez no-go theorem and provides a classical de Sitter solution of type IIB supergravity with finite and non-vanishing four-dimensional effective Newton constant.