Peer Revenue Equity in science

Papers

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

All of arXiv

Saturday 29 August

Earth and Planetary Astrophysics

A semi-analytical surrogate model for giant planet evolution: bypassing ordinary differential equation solvers with localised thermodynamics, softplus asymptotes, and B-spline photometry

Context. Evolutionary models translate the observable luminosity, temperature, and colours of giant planets and brown dwarfs into mass and age. Generating their cooling tracks normally requires integrating the internal energy over time with an ordinary differential equation (ODE) solver coupled to pre-computed atmospheric grids, which becomes numerically stiff at sharp transitions such as cloud condensation and the onset of electron degeneracy, and is fragile inside Bayesian retrievals. Aims. We aim to generate continuous cooling tracks and photometric light curves directly from discrete atmospheric grids, without an ODE solver. Methods. We mapped the grids into a logarithmic thermodynamic space and extracted localised surrogate models with Gaussian-weighted regressions at fixed planetary parameters. We fitted the entropy and cooling rate against the internal temperature using bounded piecewise softplus functions to capture structural and cooling-rate transitions; the radius was fitted on the same temperature axis; and band photometry was represented with fixed-knot cubic B-splines. The age followed from numerical integration of these analytic functions, and uncertainties were propagated from the residual scatter of each fit. Results. The surrogate, CoolTrack, reproduces the transition into electron degeneracy and the L-to-T spectral-type transition in the colour-magnitude diagram, converges on Solar System benchmarks, and evaluates a full evolutionary track in milliseconds on a standard desktop CPU. Conclusions. By removing the forward-modelling bottleneck, CoolTrack is suitable for direct use in Bayesian retrieval pipelines, where the age, mass, and formation entropy of a planet can be inferred jointly with its atmospheric properties.
Read the full abstract

All authors Christian Wilkinson, Jonas Wehrung-Montpezat, Benjamin Charnay, Mathilde Mâlin, Lukas Delaye, Anne-Marie Lagrange, Vito Squicciarini, Johan Mazoyer, Stéphane Mazevet, Baptiste Perrier

Machine Learning

One Capability or Many? Structural and Predictive Tests of Benchmark Validity Disagree About Economic Benchmarks for Frontier AI

Frontier-model leaderboards now rank systems on economic benchmarks, and those rankings inform what organisations buy and what regulators scrutinise. Whether such benchmarks measure a capability distinct from general test-taking is a question of construct validity that a structural test and a predictive test can answer in opposite ways. We show that they do on a hash-pinned snapshot of a frontier leaderboard with 421 model configurations across twelve benchmarks, four of them economic, of which 103 configurations carry all three sparsely scored economic benchmarks and 96 carry all twelve; four hypotheses and their thresholds were fixed before analysis, and every deviation from the plan is reported. The first factor of a three-factor extraction carries 74.5% of common variance and tracks release date (R^2 = 0.505), and date adjustment lowers its share by 14.9 points. Under the dimensionality rule fixed in advance the economic benchmarks form no factor of their own. A leave-one-benchmark-out test with factors re-estimated inside every fold nevertheless finds that a multi-factor representation predicts held-out economic scores better than a single general index (pooled Delta-MSE 0.037, 95% bootstrap interval [0.019, 0.055]) under the linear learners that fit best, an advantage that reverses for tree learners. Under the linear learners the same representation also predicts the eight other benchmarks better, so the battery carries predictive structure that one index misses and the economic benchmarks share it without forming a distinct factor. Construct validity should therefore be assessed by predictive tests alongside structural ones. We give a two-test protocol for benchmark builders and release the pinned data, the analysis plan and the code.
Read the full abstract

2608.29420 · 29 Aug · 26 pages, 11 figures. v2 reframes the paper around the disagreement between structural and predictive tests. Analysis plan: https://doi.org/10.17605/OSF.IO/VD34J (retrospective deposit). Code and data: https://github.com/louisyzhu/frontier-ai-economic-validity. Library: https://doi.org/10.5281/zenodo.22705351

Machine Learning

Scalable Clinical Data Infrastructure and Comparative ML Evaluation for Hospitalisation Risk Prediction in Elderly Patients with Multiple Long-Term Conditions using CPRD

Deep learning architectures are increasingly proposed for patient trajectory modeling in electronic health records (EHRs), yet their advantage over simpler, more interpretable models is rarely subjected to rigorous empirical scrutiny in real-world clinical settings. We present a comprehensive patient timeline pipeline applied to elderly patients in CPRD Aurum, incorporating 260 clinical conditions classified via a three-tier automated framework including specialised detection logic for 17 complex conditions. Using this infrastructure, we benchmark Temporal Graph Convolutional Neural Networks (TG-CNN) against Logistic Regression with LASSO regularisation and Random Forests for predicting 12-month all-cause emergency hospitalisation risk, motivated by (but not filtered to) the elevated risk of adverse drug reactions. Under cross-validation, TG-CNN achieves a marginally higher mean AUC-ROC than LASSO (0.712 vs. 0.705), whereas on the held-out test set LASSO achieves the highest discrimination of three models (AUC-ROC 0.733, versus 0.710 for Random Forest and 0.702 for TG-CNN). We show, that discrimination alone is an incomplete criterion for clinical deployment: after Platt calibration, LASSO is the only model with an acceptable calibration slope (0.817), while Random Forest (0.759) and, TG-CNN (0.391) remain substantially miscalibrated. We argue that LASSO, not the highest-discriminating model, is the model best suited to direct clinical deployment. We present lessons for the machine learning and healthcare community regarding data infrastructure, model selection, and value of calibration and interpretability in high-stakes decision support.
Read the full abstract

All authors Asra Aslam, Volodymyr Chapman, Maurice M. O'Connell, Aseel S. Abuzour, Michael Abaho, Danushka Bollegala, Gary Leeming, Eduard Shantsila, Andrew Clegg, Lauren E. Walker, Iain Edward Buchan, Samuel D. Relton

Data Structures and Algorithms

Scheduling to Maximize Weighted Throughput with an Active-Time Budget

We study the active-time scheduling problem with weighted throughput maximization. In this setting, a set of $n$ jobs $J$ arrive at integer release times, each with an integer processing time and integer deadline. Jobs may be preempted at integer time slot boundaries. A schedule assigns jobs to time slots, with at most $m$ jobs assigned to the same time slot. A slot is called active if at least one job is scheduled in it. Instead of scheduling all jobs to minimize the number of active time slots, we consider the more general variant of weighted throughput with an active-time budget $K$, where each job $j\in J$ has a weight $w_j$. The objective is to maximize the total weight of completed jobs using at most $K$ active time slots. This means that partially scheduled jobs do not count towards the objective. The classical active-time minimization problem is recovered by asking whether all jobs can be completed within a given active-time budget. We give hardness, approximation, and exact algorithmic results. For general intervals with unbounded parallelism, we prove NP-hardness, rule out an FPTAS unless $\mathrm{P}=\mathrm{NP}$, and give a pseudo-polynomial time $\Omega(1/\log K)$-approximation. For proper intervals, we prove a canonical structural lemma and obtain an exact $(nK)^{O(m)}$-time algorithm. For laminar intervals, we give an exact $f(K,m)\cdot n^{O(1)}$-time algorithm.
Read the full abstract

Analysis of PDEs

Global solutions to the Boussinesq equations and the planetary geostrophic approximation

We investigate the three dimensional Boussinesq equations in the planetary geostrophic scale, where the buoyancy/gravity driven flow is near geostrophic balance in the large horizontal spatial scale. By establishing the uniform (with respect to the characteristic number) estimates, we are able to obtain the global weak solutions and the unique global strong solutions to the Boussinesq equations without restriction on the initial data. Furthermore, sending the characteristic number to zero with the established compactness rigorously justifies the planetary geostrophic approximation of the Boussinesq equations. We employ the novel buoyancy flow-free flow decomposition to overcome the singularity caused by the buoyancy/gravity.
Read the full abstract

Probability

Algorithmic threshold for high-dimensional projection pursuit I: general theory

We study a null model of high-dimensional projection pursuit: we are given $M$ points sampled i.i.d. from a standard gaussian in $N$ dimensions, where $M,N\to\infty$ with $M/N\to\alpha\in(0,\infty)$. Our goal is to characterize the possible empirical distributions of these points' projections along a data-dependent direction $x$, which ranges over either the sphere $S_N=\sqrt{N}\mathbb{S}^{N-1}$ or cube $\Sigma_N=\{-1,+1\}^N$. We consider this problem in an algorithmic setting, where $x$ must be the output of an algorithm with dimension-free Lipschitz dependence on the input; this class of algorithms includes general gradient-based methods such as Langevin dynamics and approximate message passing (AMP). Our main result exactly characterizes the set of empirical distributions attainable by this class in terms of a one-dimensional stochastic control problem. As a consequence of our main result, we obtain exact algorithmic thresholds for optimizing the Hamiltonian of a spherical or Ising perceptron model with general bounded continuous activation. For the spherical problem, independent work of Montanari and Zhou (2024) characterized the empirical distributions attainable by a related two-stage AMP algorithm, also in terms of stochastic control. Our proof of hardness builds on the branching overlap gap property introduced in earlier work by the first two authors. Our main innovation is to develop stochastic control theory within the branching OGP framework, significantly expanding the settings in which it locates an exact algorithmic threshold. Notably, our methods apply even though the non-algorithmic problem of characterizing all feasible projections remains a major outstanding challenge. For the matching algorithmic result, we construct a new incremental AMP algorithm that acts on a Brownian-bridge revelation of the gaussian disorder and simulates the same family of controlled SDEs.
Read the full abstract

Human-Computer Interaction

EITWatch: Smartwatch-Integrated Planar Electrical Impedance Tomography for Hand Gesture Recognition

Wrist Electrical Impedance Tomography (EIT) senses hand gestures from muscle- and tendon-driven impedance changes, but prior wrist-EIT systems require electrode coverage beyond the watch-back contact patch and separate analog front ends. We present EITWatch, the first wrist-EIT system built around smartwatch case-back geometry, asking whether this contact patch alone can support gesture recognition: eight planar electrodes in a 31 mm ring acquire 35 impedance measurements at 48 Hz. Because a planar array cannot encircle the wrist, EITWatch uses multi-depth scanning to sample multiple source-sink distances and current paths; it beat matched adjacent injection by 15.1/10.4 percentage points (macro/micro) across all 12 participants. In a prompted study, within-session leave-one-round-out accuracy reached 91.4%/92.5% (window/trial) for six macro-gestures, and 90.1%/91.5% (window/segment) for five micro-gestures plus relax; window-level cross-session and leave-one-user-out transfer reached 73.2%/70.4% and 63.1%/55.3% (macro/micro).
Read the full abstract

Information Theory

Secrecy Outage Analysis over Correlated Composite Generalized-Gamma Fading Channels

This paper investigates physical-layer security (PLS) over correlated composite generalized-Gamma (GG)/GG fading channels, where both shadowing and small-scale fading follow GG distributions. Using Mellin transforms and Fox-H functions, closed-form expressions are derived for the single-link probability density function (PDF), joint distribution, survival function, and zero-rate secrecy outage probability (SOP)/probability of non-zero secrecy capacity (PNZSC). The general-rate SOP is expressed as an exact double series with one residual onedimensional integral per term. The model includes the Nakagamim/GG and Nakagami-m/Gamma channels as special cases. Numerical results validate the analysis and demonstrate the impact of the fading parameters on secrecy performance.
Read the full abstract

Materials Science

PINN-Phase: Physics-informed neural integration for accurate, generalizable and scalable multiphase-field evolution

The value of polycrystal phase-field simulations for materials exploration depends on whether individual grains, not only aggregate statistics, evolve correctly in time. We introduce PINN-Phase, a neural time integrator that advances the multiphase field autonomously and enforces phase bounds and unit sum at every step. It learns from physical targets evaluated on its own predicted states, without reference trajectories in training. A hybrid realization meets all predefined criteria with fixed weights on seven of eight prospective unseen two-dimensional microstructures and both stress cases. It also keeps the exact survivor set in five of six unseen 128^3 microstructures over 24,000 steps. A separately trained phase-local realization with 2,160 parameters, trained at 48^3 with eight grains, runs with unchanged weights on microstructures with up to 5,000 grains. With 1,000 and 5,000 grains it reproduces 4,540 of 4,543 reference grain extinctions by identity within their timing tolerance; the other three straddle the evaluation horizon. Typical per-grain volume errors stay nearly constant from 150 to 5,000 grains, while a few large grains later exceed the volume criterion. Time-rescaling controls show that statistics compared at matched coarsening states cannot detect a 3% clock error. In a virtual isothermal hold, that error ends the hold prematurely in all 34 decisions, whereas PINN-Phase stays within 0.3% of the reference time to target. These results hold within the tested microstructure families.
Read the full abstract

All authors Seifallah Elfetni, Sascha Thinius, Peter H. Seeberger, Theodore Tyrikos-Ergas

High Energy Physics (Experiment)

Evidence for the dead-cone effect in bottom quark initiated jets produced in proton-proton collisions at $\sqrt{s}$ = 13 TeV

The suppression of collinear gluon emissions from a massive quark, or the “dead-cone effect,” is the primary manifestation of quark mass effects in parton showers. A proton-proton collision data set recorded by the CMS experiment at $\sqrt{s}$ = 13 TeV with an integrated luminosity of 59.8 fb$^{-1}$ is analyzed. A differential measurement is presented of the emission density of bottom quark jets, studied as a function of the angular separation between iteratively declustered subjets. The measurement is performed in bottom quark initiated jets with transverse momenta between 40 and 200 GeV originating from top quark pair production. Compared to data, a parton shower Monte Carlo model that includes the dead-cone effect is favored, while a model without the dead-cone effect is disfavored with a significance of 4.3 standard deviations.
Read the full abstract

Machine Learning

Where Induction Runs Out: Description-Length Difficulty and the Memorisation Gap in Integer-Sequence Benchmarks

Integer sequences from the On-Line Encyclopedia of Integer Sequences (OEIS) are increasingly used to benchmark mathematical reasoning in language models. We ask what such benchmarks actually measure, using an exactly computable reference learner: two-part minimum description length (MDL) over the class of P-recursive (holonomic) recurrences, evaluated on every prefix of a sequence as terms arrive. Three findings follow. First, MDL difficulty is a parameter count. The discovery point nd, the first prefix length at which a symbolic hypothesis beats verbatim storage, is predicted almost exactly by a combinatorial identifiability bound on the selected operator's order and degree. It is invariant to term magnitude: scaling Fibonacci over twelve orders of magnitude leaves nd unchanged, because a hypothesis must encode its own initial conditions and the magnitude cancels. Second, at scale the learner exhibits a regime our curated corpus could not produce even once: across 20,000 OEIS sequences, 89.98% of those that fit a recurrence on some prefix fit none at full length. We call this the wilderness – induction acquires a theory, loses it, and never recovers. Third, evaluating three language models on sequences stratified by these MDL regimes refuted our pre-registered hypothesis: models do not confabulate where MDL reports no theory, but hedge appropriately. Confident errors are inverted, concentrating on the easy stratum, where apparent competence tracks recognition of the sequence rather than induction of its rule. OEIS-derived benchmarks therefore substantially measure memorisation, and MDL supplies a cheap, contamination-free difficulty signal they currently lack. Code and data are released.
Read the full abstract

Information Retrieval

Agents as Knowledge Integrator and Utilizer in Multimodal Recommendation

Online platforms increasingly rely on multimodal recommender systems to rank products, media, and other Web content. Existing methods usually inject visual and textual features into item representations or build homogeneous graphs from modality-level similarity, but the resulting signals can remain misaligned with the recommendation objective. We study this semantic gap from a knowledge-integration perspective: multimodal content should be interpreted together with user behavior before it is used to construct recommendation graphs or adjust rankings. We propose AgentMMRec, an agent-based multimodal recommendation framework with two coordinated roles. The Integrator Agent infers behavior- and multimodal-aware user preferences and item properties from training interactions and item content, then stores them in a reusable knowledge memory. The Utilizer Agent consumes this memory to refine modality-specific item-item graphs, construct behavior-aware homogeneous graphs, and rerank candidate lists under a frozen evaluation-time memory. This design differs from direct LLM feature augmentation and pure LLM reranking because the generated knowledge is first converted into graph structure and model representations before recommendation. Experiments on three Amazon multimodal recommendation datasets show that AgentMMRec consistently improves Recall and NDCG over recent multimodal baselines, remains effective under sparsity and item cold-start settings, and can transfer its constructed knowledge to existing backbones.
Read the full abstract

All authors Jinfeng Xu, Zheyu Chen, Shuo Yang, Jinze Li, Puzhen Wu, Zewei Liu, Zheng Lin, Jianheng Tang, Jing Yang, Wei Wang, Xiping Hu, Edith Ngai

Information Retrieval

Personalized Recommender Systems for Gym Workouts: A Reinforcement Learning Approach

Workout recommender systems aim to help gym users complete effective and engaging training sessions. However, recommending exercises alone is insufficient, as a practical system must also determine appropriate sets, repetitions, and training loads, while adapting to user behavior such as skipping exercises. Existing approaches typically consider only a subset of these factors, limiting their applicability in real-world settings. In this paper, we extend workout recommendation from exercise selection to full workout prescription. We propose a reinforcement learning (RL)-based framework with four environments: exercise-only and full-prescription settings, each with and without skip-based interaction. The full-prescription environments recommend exercises, sets, repetitions, and load, while the skip-enabled environments use user skipping behavior for online personalization. Experiments with synthetic users show that modeling the full prescription task leads to higher rewards and greater user engagement than exercise-only recommendation, highlighting the importance of realistic workout planning in personalized gym recommender systems.
Read the full abstract

Computer Vision

An Integrated Vision-and-Language Pretraining (VLP) and Visual Question Answering (VQA) model to Automate Nondestructive Evaluation Image Analysis

An AI-based approach called ChatNDE Figure to Caption is introduced, which aims to automate the interpretation of NDE images using deep learning and natural language processing (NLP). A Vision-and-Language Pretraining (VLP) strategy is developed to help the model learn how to connect visual features with meaningful language. Basically, we built a large NDE image dataset, trained the model using annotated examples, and then evaluated how well it performed using BLEU scores to compare its output to expert written descriptions. So, the system combines a ResNet50 model to extract important features from the images and a GPT2 language model to turn those features into natural sounding text. Even though the accuracy of the model has been low the generated caption results have been solid so far, the captions were shorter but mentioned some important features of images what human experts would say, which shows the model is learning to pick up on key details. Also, a Visual Question Answering (VQA) model is used as part of the system. VQA models are designed to take an image and a question about that image (like Is there a crack? or Where is the defect located?) and generate a useful answer. By adding this layer, the platform will not just describe what it sees, it can also respond to specific questions, making it even more interactive and helpful for inspectors in the field. This whole approach is a big step toward speeding up NDE workflows, reducing human error, and making the technology more accessible.
Read the full abstract

Superconductivity

Controlling Intertwined Electronic Orders in FeSe with Exfoliation

Controlling intertwined electronic orders in two-dimensional superconductors offers an effective route to answering fundamental questions and engineering new quantum devices. However, tuning the balance between competing orders typically requires complex chemistry, strain, or interface engineering. Here, we show that a pristine alternative is the dimensional reduction of the unconventional superconductor FeSe. Exfoliation suppresses the bulk electronic nematic response and switches the superconducting symmetry from bulk s-wave to d-wave-dominant. Transport, electron microscopy, and Raman spectroscopy establish the substantial weakening of nematic order in thin flakes. To probe superconductivity, we perform angle-dependent Andreev reflection spectroscopy on pristine crystal edges. As the junction's orientation is rotated, the spectra evolve from zero-energy bound states to coherence peaks. The injection angle, field, and temperature dependence, along with theoretical modeling, confirm that exfoliation switches the superconducting symmetry. Our results suggest a versatile superconducting platform for engineering quantum orders and provide fresh insights into the underlying pairing mechanisms.
Read the full abstract

All authors Wenyao Liu, Gabriel Natale, Kyung-Mo Kim, Birender Singh, Piyush Sakrikar, Stephen D. Funni, Leo Kondo, Augustin Davignon, Antoine de Lagrave, Kota Ishihara, Michael Geiwitz, Maia G. Vergniory, Takasada Shibauchi, Jun Sung Kim, Michał Papaj, Judy J. Cha, Kenneth S. Burch{\dag}

Differential Geometry

Partially Totally Real Submanifolds of Sasakian Manifolds

Partially totally real (PTR) submanifolds were introduced in Kähler geometry by distinguishing a totally real distribution and leaving its orthogonal complement unrestricted. In this paper we develop the corresponding framework for submanifolds of Sasakian manifolds tangent to the Reeb vector field. After separating the Reeb direction, we define the totally real and ambiguous distributions and show that anti-invariant, contact CR, hemi-slant and pointwise hemi-slant submanifolds occur as special cases of the Sasakian PTR framework. We establish the basic tangential and normal decompositions, study maximality and integrability, and derive the additional restrictions produced by the Reeb field. We then investigate the canonical morphisms \(P\) and \(F\), the geometry of the associated distributions, and PTR-submanifolds in Sasakian space forms. Explicit models are included to illustrate the principal structures and the differences from the Kähler case.
Read the full abstract

Other Condensed Matter

Dynamical backaction in nanoscale superfluid electromechanics

Nanofluidic acoustic resonators employing superfluid $^4$He can be used to study quantized vortices from collective behavior in two-dimensional superfluid turbulence down to few individual vortices created by rotation. In order to improve sensitivity to the level needed for probing individual quantized vortices, readout mechanisms employing optomechanical or optomechanics-inspired approaches seem to be promising in this regard. In this work, we develop an electromechanical system, which couples a 4$^\mathrm{th}$ sound acoustic resonance to a superconducting LC tank circuit in a sideband-resolved regime. Using this system, we demonstrate electromechanically induced transparency (EMIT), optical spring effect and optomechanical sideband damping and amplification. Furthermore, by rotating the cryostat, we demonstrate sensitivity to quantized vortices, which can become trapped and released in avalanche-like process inside the nanofluidic volume.
Read the full abstract

All authors Marek Talíř, Filip Novotný, Balázs Szalai, Nasiruddin Mondal, Emil Varga

Materials Science

Elastic properties of amorphous LiTaCl$_6$ solid-state electrolyte

Amorphous solid-state electrolytes are attractive candidates for safe, high-energy-density all-solid-state batteries, yet their mechanical properties remain poorly understood from a computational perspective. Here, we investigate the elastic behavior of the recently discovered amorphous superionic Li-ion conductor LiTaCl$_6$ using density-functional-theory (DFT)-based methods, including unrelaxed static, relaxed static, and strain fluctuations from molecular dynamics (MD) simulations in the isobaric–isothermal (NPT) ensemble with DFT-trained machine-learning force fields (MLFFs). While the unrelaxed static method predicts a Young's modulus an order of magnitude higher than the experiment, the relaxed static method—commonly applied to crystalline electrolytes—still overestimates the modulus by more than 170%. In contrast, the MD approach using MLFFs yields a Young's modulus of $2.84 \pm 0.26$ GPa, which quantitatively agrees with the experimental value of $2.91 \pm 0.32$ GPa. Using the MLFF-MD approach, we further predict bulk modulus (4.44 GPa), shear modulus (1.02 GPa), and Poisson's ratio (0.39) for amorphous LiTaCl$_6$ and conclude that elastically it behaves like a soft polymer or gel. These results demonstrate that amorphous superionic materials possess some unique elastic properties and that, among the methods examined, only the MLFF-MD approach yields quantitative agreement with experiment, highlighting the necessity of a dynamical treatment to simulate their elastic response, consistent with recent findings for crystalline superionic conductors.
Read the full abstract

Probability

Kac's Walk on Rotation Matrices Mixes in $\boldsymbol{\Theta(n^2)}$ Steps: A Proof Discovered with AI

Let $N=\binom n2=\dim\mathrm{SO}(n)$. We prove that the coordinate-plane Kac walk on $\mathrm{SO}(n)$ has total-variation mixing time of order $N$: for every fixed $0<\varepsilon<1$, \[ t_{\mathrm{mix}}^{(n)}(\varepsilon)=\Theta_\varepsilon(n^2). \] The lower bound is the dimensional singularity obstruction before $N$ steps. The upper bound removes the final logarithm from the previously known $O(n^2\log n)$ estimate. The proof combines the discrete Malliavin coupling and low-degree pseudo-mixing inputs with a new log-free analysis of the derivative shells. Its static core is a circuit-anchored, arbitrary-spectrum root/pass identity for the physical five-box prime. Keeping one normalization base per original circuit permits simultaneous scalar regluing without paying for artificial cuts. Its temporal core is an exact chronological calculus: passive singleton runs acquire a coboundary/Riesz gain, while root-interrupted components are allocated by vertex-labelled packets before absolute values are taken. The curvature split into pure-Weyl and Ricci parts is kept at its physical tensor type. All-Weyl packets retain a full $N^{-1}$ resource; mixed packets contain a typed $O(n^{-1/2})$ Ricci debit; and the final packetless Ricci cell is closed by a joint invariant-column estimate on its two root-hit circuits and an exact causal restoration of the marked root time. These estimates yield an $O(n)$ squared first-derivative shell and a summable all-order marked-shell expansion through logarithmic degree. The resulting score energy is $O(n/c^2)$ after $cN$ steps. A weighted submersion integration-by-parts argument and the Haar log-Sobolev inequality then give the uniform total-variation upper bound. No cutoff profile or cutoff window is asserted.
Read the full abstract

High Energy Physics (Theory)

Bound States in Perturbative Quantum Gravity with Hydrogen-like Degeneracy

Recent results in the study of gravitational scattering amplitudes indicate that some highly-symmetric relativistic systems may exactly conserve a version of the Laplace-Runge-Lenz (LRL) vector in two-body bound states. We make a systematic study, in the context of a generic EFT of long-range interactions due to the exchange of massless mediator particles of spins 0, $\frac{1}{2}$, 1, $\frac{3}{2}$, 2, of the conditions for the conservation of a hidden LRL vector; both classically (no orbital precession) and quantum-mechanically (hydrogen-like degeneracy of bound states). The calculations require several new technical developments including the extension of relativistic post-Minkowskian potential matching to quantum corrections and the incorporation of long-range forces due to the exchange of pairs of massless fermions. We find that while classically the absence of precession is a generic property of a large class of models, including Kaluza-Klein theories, with vector and scalar exchanges, maintaining the degeneracy quantum-mechanically requires a surprising cancellation between gravitons and 6 Majorana gravitinos, hinting at a special role for $\mathcal{N}=6$ supergravity.
Read the full abstract

History and Overview of Mathematics

Explanations, Prompts, and Formalizations: Arguments for New Norms in LLM-Enabled Mathematical Research

As several mathematical conjectures have recently been settled using large language models (LLMs), the mathematical community has formulated norms and recommendations regarding the publishing of such results. These norms do not cover the disclosure of the prompts and precise software setup used to obtain those results, nor do they require that results be formalized in a manner that allows for machine verification. I argue that both of these are essential. In addition, since LLM-obtained results may be hard to understand, human authors have the responsibility to invent intuitive explanations.
Read the full abstract

Algebraic Geometry

Quasimap critical cohomology, Coulomb branches, and quantum groups

This article presents a systematic study of the critical cohomology of $\QM^{\xi}(\bbP^1, X)$, the moduli space of based quasimaps from $\bbP^1$ to a Nakajima quiver variety $X$. We develop two derived equivalent presentations of this moduli space as a global critical locus. Accordingly, we obtain two equivalent explicit realizations of the canonical DT sheaf of the moduli space. Using each critical presentation, we describe canonical actions of shifted Yangians and quantized Coulomb branches on the quasimap critical cohomologies. We produce, by geometric means, a canonical morphism from an appropriate Hall algebra to the Coulomb branch, and show that the two actions we describe are compatible via this morphism under an additional hypothesis. We conjecture the compatibility holds generally, and reduce the claim to a sheaf-theoretic statement that may be approached via Joyce conjecture.
Read the full abstract

Quantum Physics

FIREQ: FPGA Instrumentation for Readout and Qubit control

We present FIREQ (FPGA Instrumentation for Readout and Qubit control), an open-source RFSoC-based framework for the control and readout of superconducting qubits. FIREQ combines a modular AXI-compliant firmware architecture with a PYNQ-based software stack designed to support extensible hardware integration, deterministic experiment timing, and low-overhead execution of repeated calibration and characterization workflows. The firmware implements direct RF synthesis and acquisition, trigger-based sequencing, programmable pulse generation, frequency-multiplexed readout, and memory-efficient acquisition and waveform buffering. The software adopts a client-server architecture with streamed data transfer and dependency-aware configuration updates to reduce host-device and reconfiguration overhead during parameter sweeps. On an AMD Zynq UltraScale+ RFSoC ZCU216, FIREQ generates RF pulses up to 9.3 GHz with a pulse-duration resolution of 107 ps and an event-timing resolution of 1.7 ns. FPGA resource utilization is compared with representative open-source RFSoC control frameworks, showing a low BRAM footprint while retaining full-rate I/Q generation and acquisition. The RF output is characterized in terms of phase noise, noise spectral density, and inter-channel timing skew. End-to-end operation is validated on a superconducting qubit through resonator spectroscopy, Rabi, Ramsey, and relaxation measurements, yielding T1 = 6.94 us and T2* = 13.50 us. FIREQ can therefore be used both as a qubit-control platform and as an experimental environment for evaluating alternative control and readout IP architectures.
Read the full abstract

All authors Giuseppe La Capra, Fabio Calabrese, Giorgio D'Amico, Christian Conti, Andrea De Simone, Deborah Volpe, Angelo Nucciotti, Roldolfo Carobene, Claudio Gatti, Andrea Giachero, Fabrizio Riente

Systems and Control

Review-Period Sensitivity in Multiclass Queue Scheduling

Optimal control of queueing networks is typically studied under continuous-time control. In many service settings, however, managers can adjust decisions only at discrete and potentially infrequent review epochs. We study a multiclass queue scheduling problem in which server assignments can be changed only at the beginning of discrete review periods, and examine how performance depends on the review-period length. We analyze a family of associated fluid control problems parameterized by the review-period length and characterize the first- and second-order sensitivity of the value function. For the two-class case, we derive explicit expressions for these derivatives and characterize their signs. We find that for short review periods, the value function need not be monotone. Once the review period is sufficiently large, the value function becomes monotone nondecreasing and may exhibit a convex or linear region before eventually becoming concave. These results provide insights on when the value of more frequent control, or flexibility with respect to server assignments, is higher. We further numerically examine the robustness of these observations for the original stochastic scheduling problem and show that stochasticity smooths the nonmonotonicity at smaller scales, while the qualitative sensitivity patterns remain visible and become more pronounced as the scale of the system increases.
Read the full abstract

Computation and Language

AlgoWorlds: Benchmarking Tool Use for Global Optimization in Algorithmic Worlds

Tool-use benchmarks generally evaluate whether an agent completes a workflow using appropriate tools and valid arguments. However, feasibility alone is insufficient in real-world decision settings such as route planning and fleet dispatch. Individual choices interact through shared constraints and costs, so a feasible solution may still be substantially suboptimal. This raises a harder question: can an agent turn information gathered through tools into a globally optimal decision? We introduce AlgoWorlds, a benchmark that transforms formally specified combinatorial optimization problems into partially observed decision environments with verifiable global optima. Each environment contains a hidden instance observed only through task-specific information tools, after which the agent commits to one structured decision evaluated for feasibility and optimality. AlgoWorlds contains 240 environments covering ten combinatorial optimization families and four workload levels. Family-specific deterministic programs generate the instances, exact algorithms certify their optima and determine workload levels, and two structurally different tool interfaces present each underlying instance. We evaluate seven leading LLMs, including Claude Opus 4.8 and GPT-5.6 Sol. Achieving global optimality remains highly challenging: although leading models produce feasible decisions in most cases, the best-performing model reaches exact optimality in only 38.61% of cases. Even when agents collect sufficient information to reconstruct the hidden instance, most failures end in feasible but suboptimal decisions. The challenge therefore extends beyond information acquisition to information integration, global constraint reasoning, and decision verification. The project homepage is available at https://xzx34.github.io/AlgoWorlds/, and the code is available at https://github.com/xzx34/AlgoWorlds.
Read the full abstract

Robotics

Toward Trustworthy Robot-Assisted Sliding Palpation for Shallow Vessel Localisation with a Calibrated Digital Twin

Reliable localisation of shallow subsurface vessels is important for safe robot-assisted venous access and vessel-aware manipulation, but collecting diverse tactile data on physical hardware is costly, time-consuming, and can degrade soft vision-based tactile sensors. We present a robot-assisted sliding-palpation framework in which a calibrated digital twin generates labelled tactile sequences, reducing reliance on real-world data. The twin models sensor-vessel contact, is calibrated against real palpation trajectories using Bayesian-optimisation-based domain adaptation, and is randomised over sliding direction and contact conditions. A spatio-temporal graph neural network trained on simulated marker trajectories performs per-node vessel classification and produces a human-verifiable top-view localisation map through 2D-to-3D-to-2D geometric projection. We evaluate three datasets: Sim, Silicone, and Meat, the latter a raw-meat phantom with vessel models at nominal depths of 0 to 30 mm, using four train-to-test configurations: Sim to Sim, Sim to Silicone, Sim to Meat, and Meat to Silicone. The calibrated twin achieves a simulated-to-real marker-alignment mean absolute error of 0.50 mm at deepest contact across four canonical interactions. After reprojection onto a 1 mm top-view grid, predicted vessel pixels lie on average 1.05 to 5.49 mm from the nearest true vessel pixel across the four models, with 1.05 to 1.31 mm for all except Sim to Meat. The larger error for Sim to Meat reflects the greater domain shift and current limit of simulation transfer. These results demonstrate progress toward trustworthy tactile palpation through calibrated simulation, interpretable localisation, and transparent cross-domain evaluation. Code, model weights, and data are publicly available on GitHub and Zenodo.
Read the full abstract

All authors Piotr Blaszyk, Wen Fan, Kaizhong Deng, Daniel Elson, Dandan Zhang

Computer Vision

GATE: Reliability-Gated Gaussian Evidence Fusion for Training-Free Test-Time Adaptation of Vision-Language Models

Vision-language models such as CLIP and SigLIP provide strong zero-shot recognition, but their predictions can degrade when deployed on target data that differ from the pretraining distribution. Test-time adaptation offers a practical way to improve robustness without source data or target labels, yet existing methods often rely on either prompt-side adaptation or image-side target evidence alone. In this work, we introduce GATE, a training-free two-pass transductive test-time adaptation framework that uses the unlabeled target set while keeping the image encoder, text encoder, and prompt parameters fully frozen. Instead of representing each class with a single prototype, GATE builds two complementary Gaussian sources of evidence in the shared vision-language feature space: a text Gaussian estimated from multiple language descriptions and an image Gaussian estimated from reliable unlabeled target samples. A class-wise reliability gate controls the influence of image-derived pseudo-evidence, and a score-level generalized Product-of-Experts fusion produces a normalized residual correction to the original zero-shot logits. Across fine-grained recognition datasets, ImageNet-family distribution shifts, multiple CLIP backbones, and SigLIP-B/16, GATE achieves the best average accuracy in every benchmark/backbone group. It improves zero-shot performance by an average of 5.41 points and outperforms the strongest non-GATE baseline by 1.94 points, demonstrating the benefit of reliability-gated distributional evidence for frozen VLM adaptation.
Read the full abstract

All authors Pedram MohajerAnsari, Amir Salarpour, Run Wang, Mert D. Pesé

Quantum Physics

Quantum work extraction from partial information and with finite resources

Information can be converted into work, but in quantum mechanics information about a state is not freely available: it must be inferred statistically from measurements on a finite number of copies. We study work extraction in this finite-resource setting by introducing a partial-information and finite-resources (PIFR) quantum Maxwell's demon. Given $N$ identical copies of a state with known Hamiltonian, the demon measures $M$ copies to estimate the state and the corresponding ergotropic unitary, which is then applied to the remaining $N-M$ copies. This protocol induces a trade-off between information acquisition, reconstruction accuracy, and thermodynamic yield, making the total extracted work normalized to the ideal ergotropic benchmark the relevant figure of merit. As our central result, we derive a universal closed-form trade-off bound that places this ergotropic efficiency between a Carnot-type ceiling $1-M/N$ and a floor controlled by a reconstruction precision rooted in finite-sample quantum estimation theory; optimizing the copy allocation yields $M^*\propto N^{2/3}$ and an $N^{-1/3}$ approach to the ideal limit, set by a conservative, worst-case reconstruction precision. By considering standard quantum state tomography, we numerically verify the presence of an optimal resource distribution, which also depends on the purity of the state under consideration. Our results identify finite-copy work extraction as a genuinely task-dependent inference problem, in which estimation strategies should be judged by thermodynamic performance rather than reconstruction fidelity alone.
Read the full abstract

All authors Giacomo Guarnieri, Diego Maragnano, Giulia Gamba, Lorenzo Zoppelletto, Marco Liscidini

Solar and Stellar Astrophysics

BSN-VII: Photometric Light Curve Study of Three Cool, Large-Amplitude, Low Mass, W-Subtype Contact Binaries

We present a comprehensive photometric study of three W UMa-type contact binary systems, V1104 Her, V1284 Her, and V2822 Ori, based on a combination of ground-based observations and space-based TESS photometry. The light curves were modeled using the BSN application under a contact configuration, with parameters and their uncertainties estimated through the Markov Chain Monte Carlo (MCMC) approach. The derived solutions indicate that the target systems are in a shallow-contact configuration. The target systems are classified as W-subtype contact binaries, with the more massive component cooler than its companion. The light curve of V1284 Her shows a pronounced O'Connell effect, which is reproduced by introducing a cool starspot on the primary component. Absolute parameters were estimated using the empirical parameter relationship between orbital period and semi-major axis, yielding component masses in the range $0.48$-$0.86\,M_\odot$ and confirming the low-mass nature of the systems. Orbital period variations were investigated using eclipse timings from the literature, ground-based observations, and TESS data by examining both linear and cyclic models. Statistical model comparison indicates that the cyclic model provides a better description of the eclipse timings for V1104 Her and V1284 Her, whereas the linear model is preferred for V2822 Ori, although the difference between the two models is relatively small.
Read the full abstract

All authors Atila Poro, Raul Michel, Diana Zadkhosh, Ava Ekrami Fard, Kian Farhadi Sangdehi, Anica Lekic, Maxime Cellier, Chloé Da Graca Baptista, Paul Pointier, Fahri Alicavus, Elham Sarvari, Neslihan Alan