Multiagent Systems
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 2 September
Reliability claims about agentic systems implicitly locate each property somewhere: in the model, or in the machinery around it. We built a system where that location is an experimental question. The subject is a persistent simulated settlement whose authoritative append-only ledger adjudicates every attempted act against world state; accepted history is the only reality. Mind, institution and world were separated before any experiment. Holding cognition fixed, we intervened on the institution's epistemic mechanisms (evidence provenance, belief availability, physical-evidence legibility); preregistered experiments refuted our central prediction twice, in opposite directions. A registered falsifier then supplied the input the geometry had denied the belief channel, a staged veridical first-hand witness, and its marginal value, non-positive throughout the witness-free phases, turned positive: 9 of 11 seeds, zero added false attribution. Holding institutional enforcement fixed, we intervened on cognition four ways: ablating the native minds' machinery, killing and resetting them mid-task, substituting a frozen frontier-LLM panel for the entire native cognition, and corrupting beliefs with trusted false testimony. Behaviour changed dramatically: one falsehood cost each trusting run about 900 futile actions and the distrusting arm none. Five pre-declared properties did not move in any tested trajectory: accepted reality stayed singular, invalid attempts were refused with typed reasons, duties outlived their processes, no work was accepted twice, and no false completion was ever accepted (2,581 substituted-panel claims, none false). Our claim is limited to this setting: measured behavioural properties were separable from substantial changes to cognition, established by intervention. One designed world, not a population of institutions; no test of an agent optimising against the institution.
Number Theory
On lifting representations and actions on curves of the metacyclic groups $C_{p^s}\rtimes C_m$
For a prime $p$, a pair $(s,m)\in\mathbb{N}^2$ with $m$ relatively prime to $p$, a homomorphism $\chi:C_m\rightarrow\operatorname{Aut}(C_{p^s})$, and an algebraically closed field $k$ of characteristic $p$, we consider the semidirect product $G=C_{p^s}\rtimes_{\chi} C_m$, the $p$-Sylow subgroup $H\cong C_{p^s}$ of $G$, and a $k[G]$-module $V$. Let $R$ be a complete discrete valuation ring of residue field $k$ and mixed characteristic $(0,p)$ that contains a primitive $p^s$-th root of unity. If $\chi$ is injective, we present two necessary and sufficient criteria for lifting $V$ to an $R[G]$-module $\widetilde{V}$ which is a free $R$-module: (i) when no extra requirement is made on $\widetilde{V}$ and (ii) when we require $\widetilde{V}^H=\{0\}$. The criteria correct several results in the literature and we use them to prove that, if $\chi$ is injective and $G$ acts faithfully on a connected smooth projective curve $X$ over $k$, then, under mild hypotheses satisfied if $X\rightarrow X/G$ is a Harbater–Katz–Gabber cover, the $k[G]$-module $H^0(X,\Omega_X)$ has a lift $\widetilde{V}$ to $R$ with $\widetilde{V}^H=\{0\}$. Also, with $B:=R[\frac{1}{p}]$, we prove the following obstruction when $p$ is odd, $m$ is even, $\chi$ is injective, and $X/C_{p^s}\cong\mathbb{P}^1_k$: if no such lift $\widetilde{V}$ exists with the $B[H]$-module $\widetilde{V}\otimes_R B$ defined over $\mathbb{Q}$, then the action of $G$ on $X$ does not lift to $R$.
Read the full abstract
Numerical Analysis
Coupled Tensor-Tensor Completion Method with Applications in Drug Repurposing
Many biomedical challenges can be posed as tensor completion problems where the observed entries of a multidimensional array (a tensor) are used to impute the missing values. In such settings, incorporating side information about the modes of the tensor, such as gene-gene similarity, can significantly enhance the solutions of the completion problem. Most existing tensor completion methods can only incorporate side information in the form of matrices. In this study, we introduce a novel framework to incorporate side information in the form of tensors. Our new approach, called Coupled Tensor-Tensor Completion (CTTC), leverages the hidden connections among multimodal tensors to improve tensor completion performance. In addition to practical utility, CTTC has theoretical foundations in distance metric learning and group theory. We derive an alternating algorithm to solve the CTTC optimization problem and establish its convergence to a stationary point. Finally, we show that CTTC outperforms state-of-the-art tensor completion methods at predicting drug effects. Results: Compared with other tensor completion methods, including HaLRTC, CTRC, Cell, and NTDDR, CTTC demonstrates superior run-time and RSE tensor completion accuracy on two benchmark datasets, DTD and LINCS.
Read the full abstract
Computers and Society
Reducing Catastrophic Risk from AI with Systematic Monitoring and Evaluation of Rogue AI Progression
This article presents a structured framework of behavioral indicators that may signal progression toward potentially catastrophic threats from artificial intelligence systems. We adopt a pragmatic approach, inspired by established methodologies in cybersecurity and national security. By establishing clear metrics, indicators, and thresholds across multiple dimensions of AI capability and behavior, this framework enables researchers and policymakers to implement evidence-based monitoring protocols.
Read the full abstract
Algebraic Geometry
Some generalizations of Oort's conjecture
For a prime $p\geq 5$, let $\mathscr S_g$ be the moduli space over $\overline{\mathbb F}_p$ of $g$-dimensional principally polarized supersingular abelian varieties. We show that each of the following loci contains an open dense subscheme on which the principally polarized abelian varieties have automorphism group $\{\pm1\}$: (i) certain supersingular Ekedahl–Oort strata when $g$ is even, (ii) the loci in $\mathscr S_g$ with non-supersingular Ekedahl–Oort invariants of positive Coxeter type when $g\geq 3$, and (iii) the locus in $\mathscr S_g$ with $a$-number at least $2$ when $g\geq 4$. Consequently, for $g\geq 4$, the complement in $\mathscr S_g$ of the open locus where the automorphism group is $\{\pm1\}$ has codimension at least $2$. These results confirm Oort's conjecture for $p\geq 5$. We reduce them to statements about affine Deligne–Lusztig varieties for $\operatorname{GSp}_{2g}$ and prove analogues of (ii) for $\operatorname{GL}_{2g}$ and $\operatorname{GSO}_{4m}$.
Read the full abstract
Probability
Duality for a Martingale Transport Problem with Moment Constraints
We consider a weak martingale optimal transport problem related to the martingale analogue of the Benamou–Brenier formula. In contrast to the classical setting, the second marginal is not given, but specified only through a finite number of moment constraints of a particular form. For this problem, we derive a finite-dimensional dual formulation and prove the absence of a duality gap under the specified interiority condition on the constraint vector. In addition, we describe the structure of the optimal martingale coupling and its relation to Bass martingales.
Read the full abstract
Medical Physics
Improving Clinical Target Volume Segmentation Accuracy using Anatomical Priors and Active Learning for the AGITG TOPGEAR Clinical Trial
Training deep learning-based medical image segmentation models is challenging with limited curated datasets. For AGITG TOPGEAR, a gastric cancer trial, the Clinical Target Volume (CTV) is complex and defined by multiple anatomical landmarks, making upfront training data preparation difficult for an automated contour QA segmentation model. We investigate anatomical priors, derived from surrounding organ segmentations, to provide spatial context and improve TOPGEAR CTV segmentation accuracy. We also evaluate active learning, iteratively expanding the training dataset by selecting cases expected to improve performance. One hundred TOPGEAR CT scans were retrospectively analyzed. An initial set of 10 expert-contoured cases was used to train an nnU-Net model. TotalSegmentator generated a voxel-wise anatomical prior map from surrounding structures as an additional input channel. Active learning was simulated over four iterations, selecting cases by model uncertainty and segmentation performance. All models used five-fold cross-validation for an ensemble uncertainty measure. Evaluation used a hold-out testing set of 50 cases. The anatomical prior improved CTV segmentation accuracy, increasing mean Dice Similarity Coefficient (DSC) from 0.84 to 0.86. Active learning similarly improved performance to 0.86, with greatest benefit in the final round. Combining the anatomical prior with active learning achieved the highest accuracy, with a DSC of 0.87. Model uncertainty correlated with DSC, supporting its use in identifying suboptimal predictions and guiding active learning. Anatomical priors and active learning each improved CTV segmentation accuracy and generalizability, with their combination achieving the best performance, supporting integration into segmentation model development for automated contour QA in radiotherapy clinical trials.
Read the full abstract
Differential Geometry
Uniqueness of tangent flows in free boundary flow
We prove uniqueness of tangent flows for mean curvature flow with free boundary at singularities modeled on half-cylindrical self-shrinkers. More precisely, if a tangent flow is of the form $\mathbb{S}^{n-k} \times \mathbb{R}^k_+$ or $\mathbb{S}^{n-k}_+ \times \mathbb{R}^k $, then it is unique. This provides the free-boundary analogue of the uniqueness theory for cylindrical singularities.
Read the full abstract
Combinatorics
On uniquely colorable Cayley graphs
We resolve two open problems regarding uniquely colorable Cayley graphs posed by Klotz and Sander (2017). First, we construct an infinite family of uniquely 3-colorable integral circulant graphs with a clique number of 2. This provides a negative answer to Problem 3.6, which asks whether every uniquely colorable circulant graph satisfies $\chi(G) = \omega(G)$. Because verifying unique colorability inherently relies on the exact independence number, we demonstrate that traditional spectral bounds fail to tightly capture this parameter, necessitating a rigorous combinatorial proof based on exact structural isomorphisms. Second, we establish a general algebraic construction proving the existence of uniquely colorable Cayley graphs over nonabelian groups whose color classes are left cosets of strictly distinct subgroups. By utilizing right-coset partitions of non-normal subgroups, this result provides a definitive affirmative answer to Problem 2.4.
Read the full abstract
Plasma Physics
Hall-MHD in driven turbulence FLASH simulations
The origin of magnetic fields in turbulent astrophysical systems has long been a central problem in plasma astrophysics. Fluctuation dynamos are a class of field amplification mechanisms that occur in turbulent magnetohydrodynamics whereby stochastically forced motions of plasma at sufficiently high magnetic Reynolds numbers exponentially amplify magnetic energy. For steady forcing, such dynamos saturate with magnetic energies at a sizable fraction of the turbulent kinetic energy. Although fluctuation dynamo is widely studied within the framework of resistive magnetohydrodynamics (MHD) and driven-turbulence numerical simulations, this work explores the difference when the Hall term is included in the magneto-fluid's generalized Ohm's law. The inclusion is motivated in part by recent high energy-density plasma experiments studying fluctuation dynamo that are governed by an extended magnetohydrodynamics (xMHD) ansatz, which includes the Hall term. We first discuss the details of the Hall-MHD implementation in the FLASH code, the tool we use to model xMHD fluctuation dynamo. We then investigate the influence of the Hall term on the fluctuation dynamo in a three-dimensional periodic box, driven with stochastic forcing at the box scale. We compare cases with a Hall term of varying magnitude to no-Hall cases with respect to the magnetic field growth rate, saturation level, and magnetic field structure. The Hall-MHD fluctuation dynamo is found to saturate at lower magnetic energies and with fewer small-scale magnetic structures than the no-Hall cases. Both findings are consistent with the interpretation that the Hall term acts as an additional, non-linear transport term, akin to an enhanced turbulent diffusivity.
Read the full abstract
Biomolecules
An Integrative Computational Approach to Predict Viral Epitopes by Targeting the MHC-TCR Complexation
T-cell immunity acts as a major defense system against controlling viral infections in vertebrates. During viral entry, innate immune cells degrade the viral proteins (antigens) and present them on their surface via Major Histocompatibility (MHC) proteins. T-cell receptors (TCRs) recognize these antigens/peptides presented by MHC (pMHC), initiating a T-cell mediated immune response. Despite its significance, the mechanism by which pMHC-TCR binding triggers T-cell activation remains unclear. In this study, we employed an integrative computational approach combining Bioinformatics, Molecular Dynamics (MD) simulations, and Machine Learning (ML) to identify viral epitopes as potential vaccine candidates. We performed large-scale all-atom and coarse-grained MD simulations on MHC-peptide-TCR complexes embedded into dendritic and T-cells, for which experimental immunogenicity data is available. One hundred fifty such systems are simulated for 1 {\mu}s each to capture the conformational and dynamical changes that underlie T-cell activation. Our ML model (DynamiT), trained on simulation-derived structural and dynamical features extracted from 2500 time points, revealed key determinants responsible for T-cell activation with an accuracy of 73.3%. Notably, we have identified the bending of the TCR transmembrane region, major dynamic motions of the TCR{\alpha} constant region and the buried surface area at the pMHC and TCR interface as critical factors influencing immune response initiation. Our approach unravels the mechanism of T-cell mediated immune response and helps ML-guided screening of viral epitopes for vaccine development.
Read the full abstract
Computation and Language
Jina-OCR-v1: Efficient Document Parsing with Speculative Decoding and Dense Verifiable Rewards
We present Jina-OCR-v1, an end-to-end document parsing model built to serve on low-budget GPUs. It combines the compressed-vision encoder and the 3B mixture-of-experts decoder of DeepSeek-OCR, which activates about 570M parameters per token, with a FastMTP speculative decoding head that shares a single draft block recursively across K=3 prediction steps. Greedy verification makes decoding lossless. Post-training combines instruction alignment, robustness fine-tuning on difficult documents, and GRPO under dense verifiable rewards: deterministic formula, table, and structural checks that award partial credit. The training data mixes cleaned public corpora with targeted synthetic pages. At the default dynamic-resolution setting, Jina-OCR-v1 scores 91.14 on OmniDocBench v1.6 and 83.4 on olmOCR-Bench, and reaches the highest page throughput in our comparison at 2.57 pages per second. On a low-budget GPU such as the NVIDIA L4, FastMTP doubles decoding speed over greedy autoregressive decoding. The model is publicly available at https://huggingface.co/jinaai/jina-ocr-v1.
Read the full abstract
Machine Learning
Portable Causal Fairness Across Synthetic Data Generator Families
When a statistical agency or regulator releases synthetic data in place of sensitive records, it chooses the generator that produces the table, and can shape that generator so unfair pathways are absent. DECAF made this concrete on one non-private GAN: three fairness definitions become three sets of edge cuts on the generator's causal graph. Whether the mechanism belongs to DECAF, or to causal factorisation itself, was untested. We port all three definitions to nine generators from three unrelated families (marginals-based, GAN, and diffusion, each with differentially private variants), across three levels of formal privacy guarantee, over 2,520 matched-pair runs on Adult and COMPAS datasets. The mechanism transfers everywhere, and our new causal diffusion backbone yields the fairest release of any family we tested, at fidelity close to the marginals tier. Applying the cut barely moves fidelity, only costs a downstream classifier about $0.07$ to $0.15$ AUC on average, and adding privacy guarantees don't make the data less fair.
Read the full abstract
Statistical Mechanics
Accelerating stochastic processes through nonequilibrium driving: Thermodynamic constraints on the maximum speed-up
We derive a new set of bounds controlling the speed-up of the survival rate of trajectory-dependent observables induced by the application of a perturbation. Via the study of survival probabilities in two different contexts, continuous-time Markov jump processes and overdamped diffusions, we obtain different fashions of the bound on the achievable boost. These bounds, obtained by a nonlinear response theory of constrained path probabilities, are explicitly linked to thermodynamics. For arbitrary time-dependent survival rates, we find a linear bound that depends on both the perturbation strength and the entropy production rate prior to the perturbation. For rare processes characterized by a constant survival rate, the bound is exponential and is determined by the excess heat generated by the perturbation. We exemplify the inequalities on two prototypical model systems, namely, a unicyclic network and forced diffusion in a bistable potential.
Read the full abstract
Computers and Society
Open Problems in AI Risk Modeling: Insights from a Workshop on the Technical Foundations of AI Risk Modeling
We investigate the design of robust risk models to assess societal risks posed by advanced AI systems, an emerging area in AI governance. Many regulatory proposals increasingly require systemic risk assessment, but in the absence of rigorous quantitative methods, the question remains what state of the art risk modeling should look like in practice. We identify the key methodological and institutional challenges that currently limit the adoption of risk modeling. We review five research traditions that inform this problem: probabilistic risk assessment, catastrophic AI risk analysis, cybersecurity risk quantification, Bayesian causal inference, and threshold-based governance. We compare two leading proposals, scenario-based risk estimation and Bayesian network-based threshold setting. Drawing on a workshop with 22 experts and subsequent analysis, we identify a structured agenda of open questions concerning model structure, scope, evidence integration, validation, and governance. We close by outlining priorities for progress, arguing that it will depend on integrating quantitative modeling with independent evaluation, transparent and tiered disclosure, and institutions capable of maintaining and updating risk models over time.
Read the full abstract
Machine Learning
Frontier LLMs are effective batch optimizers: Assessing reasoning models in continuous and discrete settings
Frontier large language models (LLMs) have become attractive priors for optimization due to their large-scale pretraining that enables them to navigate a variety of optimization settings. However, the effectiveness of modern reasoning LLMs in batch optimization settings remains underexplored. Here we investigate the performance of the current generation of frontier LLMs as batch optimizers in both continuous and discrete settings. We find that while LLMs are competitive zero-shot batch optimizers for numerical test functions, their performance is brittle compared to classical non-LLM optimization approaches. However, LLM priors are significantly better in semantically rich settings, indicating that their batch optimization behavior is highly effective when navigating and reasoning over the discrete spaces most similar in structure to their pretraining data.
Read the full abstract
Materials Science
An Ultrathin Laterally Conductive Mesh Interphase Enables Spatially Extended Zinc Deposition for Aqueous Zinc Batteries
Zn metal anodes often suffer from nonuniform interfacial reactions during cycling, resulting in uneven deposition and dendrite growth. Existing artificial interphases can mitigate side reactions or regulate nucleation, but rarely achieve regulation of the interfacial electron/field distribution to sustain uniform deposition at the evolving Zn/electrolyte interface. Here, we develop an Au mesh interphase (AuMI), an ultrathin two-dimensional Au aerogel network that couples lateral electron redistribution with open pathways for ions. During Zn plating/stripping, the conductive AuMI distributes electron transport across the Zn surface, while its porous mesh preserves Zn$^{2+}$ access, enabling more uniform interfacial reactions. Experiments and simulations show that AuMI homogenizes the interfacial electric field and current distribution, promotes more uniform Zn plating/stripping, and limits dendrite growth. As a result, this regulated interfacial reaction mode enables AuMI Zn symmetric cells to operate stably for 3000 h at 1 mA cm$^{-2}$/1 mAh cm$^{-2}$ and for 1100 h at 10 mA cm$^{-2}$/10 mAh cm$^{-2}$, while AuMI Zn||NVO (NaV$_3$O$_8$\cdot$1.5H$_2$O) full cells retain 80.8 % capacity after over 5000 cycles at 1 A g$^{-1}$. These findings highlight the importance of combining ultrathin architecture, lateral electron transport, and open Zn2+ access in artificial interphases for stable aqueous Zn metal anodes.
Read the full abstract
Robotics
Real-Time Shape Control of Multi-Segment Soft Robotic Arms Using Koopman Operators with Global and Local Observables
Multi-segment soft robotic arms can continuously reconfigure their body shapes for safe interaction, but tip control alone is insufficient for constrained-space tasks. Therefore, shape control is a more important task for multi-segment soft arms than tip control, but remains challenging due to the high dimensionality and nonlinear dynamics of continuum deformation. In existing work, shape control accuracy is defined by the error in the global frame (global shape error). For multi-segment soft arms, using only global shape error as the control objective is insufficient, as segment coupling, gravity-induced loading, and inertial effects become more significant. This difficulty increases with the number of segments. In this paper, we present a Koopman-based model predictive control framework that combines global and local observables, enabling real-time shape control on multi-segment soft robotic arms. The framework is evaluated through numerical and physical experiments. Numerical experiments demonstrate the scalability of the proposed controller by achieving shape control on robots with up to 10 independently actuated segments. The physical experiments demonstrate that the controller is capable of (1) real-time shape control of 3- and 5-segment robotic arms with tip speeds up to 0.6 m/s, (2) robust tracking without retraining, including distal payloads up to 400~g and recovery from a 7~N lateral disturbance, and (3) the potential for future inspection applications through a confined-space demonstration. These results demonstrate that the proposed framework enables dynamic, scalable, and accurate real-time shape control on multi-segment soft robotic arms.
Read the full abstract
Systems and Control
A Reconfigurable Hybrid Convolutional-Fully Connected Neuromorphic Core for Biomedical Edge Inference
This work presents a programmable FPGA-based architecture for spiking convolutional neural network (SCNN) inference, with real-time hypoxia classification serving as a biomedical edge application. The architecture implements a hybrid spiking convolutional-fully connected (CNN-FC) topology on a programmable, quantized, layer-based neuromorphic hardware core. Early layers perform spiking convolution using receptive-field connectivity with support for multi-channel kernels and stride, while deeper layers use fully connected spiking layers for classification. A PyTorch-based hardware-software co-design flow enables deployment of trained parameters with quantization and configurability support. The design is first validated on MNIST and Fashion-MNIST, achieving hardware accuracies of up to 98% and 86%, respectively, at 16-bit precision. It is then applied to hypoxia classification using red and infrared photoplethysmography (PPG) signals acquired from a shoulder-mounted sensor, with skin tone included as an additional input channel. The resulting classifier achieves an average hardware accuracy of 88.26% across five folds at 16-bit precision while consuming 1.455 W of dynamic power, demonstrating the feasibility of low-power neuromorphic biomedical classification at the edge.
Read the full abstract
Mesoscale and Nanoscale Physics
Topological Boundary States and the Edge Chain in Semi-Infinite Two-Dimensional Insulators
We show that it is possible to compute the adiabatically protected edge and corner states of semi-infinite, two-dimensional, topological insulators by considering the first layer of lattice sites, what we call the "edge chain," independently from the bulk. We start by accepting this claim as an ansatz, then, using the Shemesh theorem, we show that the edge states one finds using our procedure are adiabatically protected, provided we restrict ourselves to adiabatic evolutions that do not break chiral symmetry. We show explicit examples of our method in a 2D extension of the SSH model, the SSH3 model, the Haldane model and the Breathing Kagome Lattice.
Read the full abstract
Signal Processing
Modulation Analysis with Higher-Order Spectra
A need to identify modulation of spectral power arises frequently in the analysis of physiological signals. Estimation of power in the relevant bands through filtering and envelope extraction has several limitations: the choice of filter may bias any resulting estimate, while additive Gaussian noise becomes non-Gaussian due to the nonlinearity of envelope computation. The present work considers how spectral decompositions of higher-order cumulants (higher-order spectra, HOS) avoid these limitations, with an emphasis on the use of the trispectrum to identify modulated oscillations. Specifically, it is shown: 1) The trispectrum may be interpreted as a measure of linear dependencies of power across frequencies by viewing it as the cross spectrum of the Wigner-Ville distribution. 2) A particular two-dimensional subdomain of the trispectrum is useful for identifying modulated carriers, recovering essential spectral properties of both the modulating and carrier signals while avoiding the cubic complexity of full trispectrum estimation. A representation of this subdomain, the modulogram, is demonstrated as a tool for identifying and distinguishing different forms of modulation. 3) As a cumulant-derived measure, the modulogram is not biased by additive Gaussian noise. 4) Modulogram phase retains information by which temporal patterns of modulation may be identified. 5) A recently described additive decomposition of HOS (HOSD) further aids identification when applied to the trispectrum. These developments are illustrated with the blind detection of beta bursts in rodent and human local field potential recordings. Finally, the relationship between the present approach and prior techniques of blind identification (BI) through moment maximization, including blind deconvolution and independent component analysis, is considered.
Read the full abstract
Number Theory
Factorization patterns and fields of definition of $\ell$-torsion points on the Jacobians of genus 3 hyperelliptic curves
Motivated by Schoof-Pila-type point-counting algorithms, we study the fields of definition and factorization patterns of Galois orbits of $\ell$-torsion points on the Jacobians of genus-3 hyperelliptic curves over finite fields. We show that the degree of the field of definition of the $\ell$-torsion points can be bounded by $O(\ell^4)$, improving the previously expected $O(\ell^6)$ bound (which reflects the size of the $\ell$-torsion subgroup, of order $\ell^6$ for a genus 3 Jacobian). Moreover, we establish a precise correspondence between the rank of the $\ell$-torsion subgroup and the Galois orbits of $\ell$-torsion divisors. Our approach relies on a detailed analysis of the Jordan decomposition of the Frobenius action on $J$ and its nilpotent part.
Read the full abstract
Optimization and Control
Gradient-Free Optimization for Matrix functions
We consider the task of optimizing smooth, possibly non-convex functions of a matrix variable given access only to directional derivatives rather than full gradients. This setting arises when fine-tuning large neural networks on consumer-grade hardware: the network's weights are matrices, memory constraints rule out backward-mode automatic differentiation, but directional derivatives remain available through forward mode. We frame gradient estimation in this setting as a structured recovery problem, in the spirit of signal processing. From this perspective we provide three contributions. First, we introduce an alternative to the standard random gradient estimator; the difference corresponds to replacing the adjoint of the sampling operator with its pseudoinverse. Second, when the gradient satisfies an approximate low-rank condition, techniques from matrix sensing yield a family of highly accurate gradient estimators that drop into any first-order method. Third, we note that while the computational cost of such estimators is high, this can be amortized by combining them with a matrix-aware optimizer such as spectral descent. Specifically, the gradient estimator computes a factorization of the gradient, allowing for the projection step of spectral descent to be done at no extra cost. We demonstrate our findings with two careful numerical experiments on synthetic functions with approximately low-rank gradients. We show that by exploiting this low-rank property one obtains much faster convergence to good approximate solutions.
Read the full abstract
Human-Computer Interaction
Signal-Driven Pervasive Game Design: The LifeSync-Games Framework as a Player Experience Integration Layer
Pervasive games extend the magic circle across spatial, temporal, and social dimensions, yet treat the player's physiological and cognitive state as a passive receptor rather than an active signal. This paper presents LifeSync-Games (LSG), a framework that (unlike proposals treating player signals as an additional dimension), operationalizes them as a Player Experience Integration Layer (PEIL) acting transversally across the three existing pervasive dimensions through verified real-world signals: physical activity, sleep quality, memory, and decision speed. The framework introduces a gamified integration artifact (the LSG portal) that mediates the real <-> virtual exchange through redeemable points, real-world missions, and structural gamification. Five HCI design principles grounded in Self-Determination Theory and Flow Theory are proposed, instantiated across six commercial video games, together with a study protocol (n = 70-80 participants, quasi-experimental design). This paper reports the design stage of LSG: rule thresholds and portal parameters are design decisions pending empirical calibration; no data collection has yet been conducted. The main contribution is a theoretically grounded framework and validation protocol positioning player-sensitive integration as the mechanism enabling pervasive games to respond to the player's actual biological and cognitive state.
Read the full abstract
Chemical Physics
Stochastic Tensor Contraction for Efficient MP2 Exchange
Second-order Moller–Plesset perturbation theory (MP2) is one of the simplest correlated wave-function methods, but its conventional $O(N^5)$ cost limits its application to large systems. Stochastic tensor contraction (STC) has recently appeared as a general technique to evaluate high-order tensor contractions in quantum chemistry. Here, we apply STC to the exchange contribution of Laplace-transformed MP2, which is the source of $O(N^5)$ scaling in the formulation. The resulting STC exchange algorithm has an $O(N^3)$ deterministic setup cost and an $O(N^2)$ stochastic cost at fixed absolute error. The estimator is unbiased and provides a way to specify the target stochastic error by estimating the number of required samples before the full calculation. We implement the algorithm using a hybrid deterministic–stochastic evaluation strategy, with grouped index sampling, to reduce the computational prefactor. Over a range of benchmark molecules containing up to $\sim 7000$ basis functions, the stochastic exchange evaluation takes as little as $1/270$ of the time of a complete DF-MP2 calculation on the same system. Within the Laplace-transformed formulation, the $O(N^4)$ scaling direct contribution is thus the only significant cost. Our results further substantiate the power of STC to serve as a general tensor-contraction engine for quantum chemistry.
Read the full abstract
Representation Theory
Positive kernels in Lie group representations and Fourier interpolation
For a given function $f$ on a discrete subspace $\Gamma$ of a noncompact Riemannian symmetric space $G/K$, we construct analytic, noncompactly supported functions $W$ on $G/K$ with $W|_{\Gamma}=f$ that, in addition, satisfy an invariant differential equation on $G/K$. The key step is to regard $W$ as an orthogonal projection onto a space of coherent states in a representation of the Lie group $G$ in a Hilbert space that admits a strictly positive definite reproducing kernel. The techniques are implemented for the heat kernel on $G/K$, and $W$ is expressed in terms of certain closed formulas for linearly independent coherent states.
Read the full abstract
Astrophysics of Galaxies
Multi-tracer exploration of molecular gas in main sequence galaxies at z~4.5
Molecular gas masses in high-z galaxies are inferred from indirect tracers, whose respective reliability remains poorly constrained. In particular, the bright [CII] 158$\mu$m line is now widely used as a molecular gas tracer at z>4, yet direct observational tests against CO remain scarce. We search for CO(4-3), CO(5-4), and [CI](1-0) lines in three of the most [CII]-luminous galaxies at z~4.5 from the ALPINE survey to assess the detectability of these lines in high-z main-sequence (MS) galaxies and to test the reliability of [CII] emission as a molecular gas tracer through the cross-comparison of molecular gas masses inferred from six tracers: CO(4-3), CO(5-4), [CI](1-0), [CII], dust continuum, and [CII]-based dynamical mass, adopting standard calibrations and conversion factors. We detect CO(4-3) and CO(5-4) lines at high significance in the near-solar metallicity galaxy DC873756, obtain a tentative CO(4-3) detection in the merging system DC818760, and detect no CO emission in the half-solar metallicity galaxy VC5110377875. [CI] remains undetected in all three galaxies. In DC873756 the molecular gas masses inferred from the six considered tracers agree within their uncertainties despite different systematics inherent to each tracer. The agreement suggests that, at least for some near-solar metallicity MS galaxies at z~4.5, the CO SLED and Milky Way CO-to-H2 conversion factor adopted for MS galaxies at cosmic noon remain applicable and that mid-J CO transitions trace a substantial fraction of the molecular gas reservoir. The CO non-detection in VC5110377875 is consistent with the reduced CO detectability expected at lower metallicities. In DC818760 we find an inconsistency between the [CII]-based molecular gas mass and masses derived from the other tracers, indicating a [CII] excess possibly reflecting enhanced emission from shocks and/or diffuse ionized gas in merger-driven conditions.
Read the full abstract
Emerging Technologies
QSVT-Based Three-Phase Unbalanced Power Flow
This letter introduces QSVT-3PF, a quantum singular value transformation (QSVT) based solver for three-phase unbalanced power flow with embedded single-phase grid-forming inverter (GFM) operation. The contributions are threefold: 1) reformulating the Newton correction as a QSVT-compatible inverse problem using a normalized block-encoded phase-domain Jacobian; 2) introducing a regularized singular-value filter to improve robustness under ill-conditioned and stressed operating conditions; and 3) validating the proposed solver on an IEEE 5-bus system and the IEEE 123-node test feeder with single-phase GFM integration. Test results show that QSVT-3PF matches the classical Newton benchmark in residual convergence, voltage profile, and final operating point, demonstrating the feasibility of QSVT-3 for large, unbalanced distribution systems.
Read the full abstract
Analysis of PDEs
Energy Decay Induced by Localized Coercivity in the 3D Navier–Stokes Equations
Energy-based analysis of the three-dimensional incompressible Navier–Stokes equations with spatially localized dissipation is developed at the level of kinetic energy and Leray–Hopf weak solutions. A localized coercivity property linking viscosity and damping to global $L^2$ control is introduced and related to observability and spectral inequalities for the associated Stokes operator. Under this condition, exponential energy decay is established without regularity or linearization assumptions, and time-dependent damping is treated within a nonautonomous framework. A finite-dimensional spectral quantity is proposed as a computable proxy for coercivity, yielding explicit decay estimates for reduced-order models.
Read the full abstract
Statistics Applications
Uncertainty quantification of fatigue initiation life for powder bed fusion metal additive manufacturing
Predicting fatigue life with quantified uncertainties is essential for the qualification of critical components produced by laser-based powder bed fusion additive manufacturing. We present a framework that propagates microstructure and defect uncertainties directly to a fatigue initiation life distribution for a specific part. In particular, microstructure and defect characterizations are obtained from electron backscatter diffraction and micro-computed tomography scan data, which in turn inform three physics-based simulations yielding the fatigue-affecting quantities: the elastic energy release rate, the surface energy along the crack path, and the fatigue indicator parameter. Accounting for the uncertainties in these quantities and the high correlations among them due to the shared underlying microstructure, we derive a closed-form probability density function for the fatigue initiation life. This provides an analytical distribution instead of conservative deterministic predictions and enables more informed decision making for the qualification and deployment of additively manufactured components. Applying the framework to 316L stainless steel parts produced by an EOS M290 laser powder bed fusion machine, we find that both grain sizes and void distributions influence the fatigue initiation life distribution. Specifically, for a fixed total void volume fraction, larger grain sizes cause a marginal reduction in fatigue initiation life, and a population of many small voids is more favorable for fatigue life than fewer, larger voids of equivalent total volume.