Peer Revenue Equity in science

Papers

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

All of arXiv

Friday 28 August

Machine Learning

Correlation-Guided Flow Matching with Annealed Masking for Spatial Transcriptomics Generation

Spatial transcriptomics (ST) provides spatially resolved gene expression profiling but remains expensive, motivating the prediction of ST from histology images. Generative models have emerged as a mainstream paradigm for ST prediction due to their ability to model the conditional distribution of gene expression and capture its inherent stochasticity. However, these methods typically treat genes as independent prediction targets and overlook the intrinsic gene-gene interactions in biological systems, which limits their ability to preserve biologically meaningful co-expression patterns. We argue that gene-gene interactions, which reflect shared pathways and regulatory mechanisms, are essential for generating numerically accurate and biologically coherent ST profiles. In this paper, we propose CorrFlow, a correlation-guided flow matching framework for histology-to-ST prediction that explicitly models gene-gene dependencies through two complementary mechanisms. First, we introduce an annealed masked flow matching strategy, where subsets of genes are progressively masked following a timestep-dependent annealing schedule, encouraging the model to infer masked genes conditioned on the remaining genes and promoting joint conditional modeling beyond per-gene marginal estimation. Second, we devise a gene graph-regularized optimization scheme that integrates prior knowledge from the STRING database and data-driven co-expression estimated by WGCNA to construct a gene affinity graph, which enforces both local consistency and global smoothness in the predicted expression. Extensive experiments across 12 datasets show that CorrFlow achieves the best average PCC and HPCC among evaluated methods, leading to more biologically coherent ST predictions.
Read the full abstract

All authors Yupei Zhang, Hao Chen, Li Pan, Chao Li, Xiaohan Xing

Instrumentation and Detectors

Design of a Lamb-Shift Polarimeter for $^3$He Ions and Atoms

In high energy physics experiments $^3$He$^{2+}$ nucleons are suitable to test the internal structure of neutrons, which makes them the perfect substitute. Moreover, it is one of the atomic species for which high polarization values are achievable through the use of optical pumping methods. Therefore, nuclear polarized sources for $^3$He$^{2+}$ ions are currently under development. Consequently, detector systems validating their nuclear polarization value need to be established. Such a detector system, based on the Lamb-shift polarimeter, is introduced in this work. Its advantage is that it can operate at low energies in the range of 10 to 100 keV, which makes pre-acceleration unnecessary. In addition, a fast evaluation of the nuclear polarization within seconds leads to shorter disruptions for beam times. Another option of this Lamb-shift polarimeter might be that it can serve as a valuable tool for further investigation of the bound tritium decay into $^3$He atoms, similar to the hydrogen spin filter for the bound beta decay of the free neutron.
Read the full abstract

All authors N. Faatz, R. Engels, C. Kannis, S. J. Pütz, J. Steinhage

Machine Learning

Adaptive Physics-Informed Neural Networks for the Blasius Boundary-Layer Problem

Physics-informed neural networks (PINNs) provide a mesh-free approach for solving differential equations, but their performance can depend strongly on loss weighting, collocation placement, and optimization strategy. This study develops an adaptive PINN framework for the Blasius boundary-layer equation using gradient-norm-based adaptive loss weighting, nonuniform and residual-based collocation, and sequential Adam–L-BFGS optimization. In the representative run using the architecture $[1,100,100,1]$, the model predicts $f''(0)=0.3320762918$, compared with the high-accuracy benchmark $0.332057336215$, giving an absolute error of $1.896\times10^{-5}$. The final weighted loss is $6.789\times10^{-8}$, and the predicted stream-function, velocity, and shear profiles agree closely with an independent numerical boundary-value solution. A separate full-training architecture study shows that the two-hidden-layer model achieves the smallest wall-shear error among the four tested architectures, $1.629\times10^{-6}$, whereas the deepest network attains the smallest weighted objective but a substantially larger wall-shear error. Compared with the previously reported PINN value $f''(0)=0.33165$, the representative run reduces the wall-shear error by approximately a factor of $21.5$. The results show that the combined adaptive training framework can achieve high accuracy for the Blasius problem and that weighted loss alone is insufficient for identifying the most physically accurate PINN. Because the adaptive components are applied jointly, their individual contributions cannot be isolated from the present results and would require a controlled ablation study for separate assessment.
Read the full abstract

Machine Learning

DPTM-DT: Dual-Pretrained Transformer Multitask Representation Learning for Drug-Target Prediction

Drug-target relation prediction supports candidate screening, drug repositioning, and mechanism analysis. Existing models often use incomplete drug or protein representations, model cross-modal interactions shallowly, or train affinity regression and interaction classification separately, although these tasks describe closely related views of the same drug-target pair. This paper presents DPTM-DT, a dual-pretrained Transformer framework for multitask drug-target prediction. DPTM-DT combines GROVER molecular graph embeddings, ESM protein language-model embeddings, and CTD physicochemical descriptors, then exchanges drug-target information through bidirectional cross-modal attention. A shared pair representation is used for continuous affinity regression, high-affinity binary classification, and six-level affinity classification. Experiments on Davis and KIBA cover random 80/20 and DeepDTA-style standard splits. On the random 80/20 split, DPTM-DT achieves MSE/CI values of 0.193/0.917 on Davis and 0.120/0.918 on KIBA. It also reports binary AUPR/MCC values of 0.727/0.654 and 0.798/0.689, and six-class Macro-F1/Top-2 values of 0.800/0.932 and 0.815/0.962 on Davis and KIBA, respectively. Across the reported regression, binary classification, and multiclass classification settings, DPTM-DT achieves the best overall performance among the compared methods. Results under the standard split show the same relative trend. Ablations indicate that dual target representation, gated fusion, and cross-modal attention each contribute to the final performance. Code and supplementary materials are available at: anonymous.4open.science/r/DPCM-DT-74E0.
Read the full abstract

Symbolic Computation

Generic Characteristic-Zero Equivalence Between Derivative Bézout Inversion and Multipoint Evaluation

Let $a_1,\ldots,a_m$ be distinct elements of a field $K$, and let $Z(X)=\prod_{i=1}^m (X-a_i)$. We study the arithmetic complexity of computing the unique normalized Bezout pair $s,t$ satisfying $sZ+tZ'=1$, with $\deg t<m$ and $\deg s<m-1$. The classical product-tree approach requires $O(M_K(m)\log m)$ field operations, where $M_K(m)$ denotes the cost of multiplying degree-$<m$ polynomials over $K$. Thus, even when $M_K(m)=O(m\log m)$, the resulting bound is $O(m\log^2 m)$ rather than $O(m\log m)$. Over an infinite field of characteristic zero, we prove that, in the generic rational straight-line-program model, computing all coefficients of the canonical Bezout pair is equivalent, up to an additive $O(M_K(m))$ cost, to arbitrary-node multipoint polynomial evaluation and to interpolation. The main ingredient is an explicit differential reconstruction that recovers $Z$ from $(s,t)$ in $O(M_K(m))$ arithmetic operations on a nonempty Zariski-open subset. Combining this reconstruction with automatic differentiation and transposition yields the complexity equivalence. We further transfer Strassen's lower bound for the elementary symmetric functions to the Bezout problem, obtaining an $\Omega(m\log m)$ nonscalar lower bound. Hence an $O(m\log m)$ algorithm, if it exists in this model, would be asymptotically optimal. The reconstruction is genuinely characteristic-dependent: in characteristic $p$, all squarefree polynomials $X^p+cX+d$, with fixed $c\ne 0$, have the same normalized Bezout pair $(0,c^{-1})$. Therefore the all-field, all-input $O(m\log m)$ problem remains open; generically in characteristic zero, however, it is reduced to the corresponding arbitrary-node multipoint evaluation and interpolation problem.
Read the full abstract

Emerging Technologies

QC-CCG: Quantum-Classical Algorithm for Two-stage Adaptive Robust Optimization

Quantum optimization provides a promising approach for solving large-scale combinatorial problems through quadratic unconstrained binary optimization (QUBO) formulations. However, integrating QUBO-based solvers into structured optimization frameworks while preserving solution guarantees remains a fundamental challenge. This paper develops a hybrid quantum-classical column-and-constraint generation (QCCG) framework for solving two-stage adaptive robust optimization problems with binary first-stage decisions and linear recourse under polyhedral uncertainty. The proposed approach reformulates the restricted master problem as a QUBO and solves it approximately using a quantum optimizer, while retaining a classical adversarial subproblem to compute worst-case recourse and certify solution quality. We construct a constraint-preserving QUBO encoding for inequality-constrained master problems using slack variables and penalty terms, enabling general mixed-integer structures to be mapped to quantum-compatible representations. To address inexactness arising from discretization, penalty modeling, and quantum optimization, we introduce a bound-adjustment mechanism that yields valid lower and upper bounds and provides a certified stopping criterion. We show that the proposed framework generalizes classical column-and-constraint generation and retains its convergence properties when the master problem is solved exactly. Numerical experiments on two-stage robust location-transportation problems demonstrate that the proposed hybrid approach achieves solution quality comparable to classical methods while reducing the computational burden associated with solving mixed-integer master problems, highlighting the potential of hybrid quantum-classical optimization for scalable decision-making under uncertainty.
Read the full abstract

Software Engineering

Evaluating Enterprise Analytics Agents: An End-to-End, Trace-Backed Methodology

Enterprise analytics agents are not only text-to-SQL systems. They interpret business intent and choose metric definitions. They select data sources, execute tools, inspect results, and produce natural-language answers. Those answers may influence operational, financial, or executive decisions. Grading final answers hides where these agents fail. A plausible answer can use the wrong source of truth. It can skip a required decomposition, claim causality without support, or change its table interpretation across repeated runs. We present an end-to-end evaluation methodology for analytics agents. The methodology grades agent behavior across three families: semantic understanding, execution quality, and reliability. Grading uses question banks with human-written golden answers, repeated runs, and runtime traces. Each run first passes a run-validity check, then receives tiered, abstention-aware scores that feed a decision framework rather than a release gate. We instantiate the methodology on a controlled internal analytics agent at a large online marketplace. The case study uses 50 analytics questions, two anonymous model configurations, and three randomized repetitions per configuration, yielding 300 traces. The higher-capability configuration reduced early refusal from 73% to 0% and increased real-data answers from 21% to 73%. However, it also exhausted the tool-round budget on 16% of runs. It overran the schema-exploration budget on 77% of traces. It changed its table interpretation on 41 of 50 questions. On finance questions with structured golden answers, source table use and escalation improved, but canonical decomposition remained weak in both configurations. These results show why trust in analytics agents requires end-to-end, trace-backed evaluation rather than SQL correctness or final answer quality alone.
Read the full abstract

All authors Teja Venkat Kolli, Sang Su Lee, Xueying Yan, Jessie Chen, Chi Cheng, Kartik Ravisankar, Shishir Dash, Vijay Anand Raghavan

General Mathematics

A Complex Structure on $S^2\times S^4$

We show that $S^2\times S^4$ admits a complex structure. Starting from a modular family of complex two-tori associated with the $(3,4,\infty)$ triangle group and the compactification constructed in [Alpöge 2026], we replace the period lattice by its unique monodromy-invariant index-two superlattice and compactify the resulting family. In the integral Mayer–Vietoris calculation, a primitive local class whose double is the class of a cusp component and the unique nonzero torsion class contributed by the multiplicity-four fibre restrict to the same class of order two on the common boundary. We then prove that the resulting compact complex threefold is diffeomorphic to $S^2\times S^4$. The proof is discovered by the Odin Automatic AI Research Agent.
Read the full abstract

Computer Vision

A Survey on Adversarial Attacks and Defenses for Diffusion Models Across Multiple Modalities

Diffusion models have become the dominant family of generative models in the visual domain. However, their widespread public availability enables misuse at scale, motivating a rapidly growing body of research on adversarial attacks and defenses. This survey provides, to our knowledge, the first unified review of this literature across three visual modalities: image, video, and 3D. We introduce a comprehensive, task-centric taxonomy: we first divide the literature by modality; within each modality, we separate methods into attacks and defenses, and then group them by the generative task they target, presenting them chronologically within each task. Moreover, we provide an in-depth analysis of their evaluation settings, consolidating the datasets, metrics, and benchmarks used to assess them. We conclude by identifying several open challenges and outlining concrete future research directions. Project Webpage: https://github.com/ozgurkara99/awesome-adv-attack-defense-on-diffusion
Read the full abstract

All authors Ozgur Kara, Tarik Can Ozden, Furkan Horoz, Zeqian Long, Haotian Xue, Yipu Chen, Oguzhan Akcin, Yongxin Chen, James Matthew Rehg

Soft Condensed Matter

A dual network approach to connect structure and flow in random networks

Flows in random networks are known to exhibit heavy-tailed statistics, giving rise to anomalous transport in a range of biological, environmental and engineered systems. Yet, how structure determines flow remains an open question. Here we derive a dual network approach that relates flow statistics and network properties. Conditional statistics in a range of networks reveal the existence of two interlaced subnetworks with distinct hydraulic behaviors. Based on this hidden structure, we derive a universal analytical approach that predicts heavy-tailed flow statistics based on network topology and disorder distribution across a range of random networks.
Read the full abstract

All authors Marco Dentz, Philippe Gouze, Tanguy le Borgne, Alexandre Puyguiraud

General Mathematics

Optimal Practice Allocation Under Learning Saturation

A saying attributed to Bruce Lee unfavorably contrasts a martial artist who has practiced ten thousand kicks once each with another who has practiced a single kick ten thousand times. We read the saying as implicitly raising a question about how to allocate a fixed practice budget among several skills, and we show that the answer is governed by two ingredients: the shape of the learning curve that converts practice into skill, and the rule by which separate skills are aggregated into overall effectiveness. Neither ingredient alone settles the matter. Our central result reduces the multivariable allocation problem to the maximization of a single scalar efficiency function \(\eff(x)=f(x)^{p}/x\); under a simple uniqueness and divisibility condition, every optimal practice schedule is balanced, dividing the budget equally among a definite number of skills. The optimal number of skills is then determined by a transparent criterion equating the elasticity of the learning curve to the reciprocal of the aggregation parameter. Hard-saturation models, heterogeneous learning rates, a sharp specialization threshold, and a genuinely intermediate optimal repertoire all follow as consequences.
Read the full abstract

Soft Condensed Matter

Performance comparison of tethered and self-propelled models of fish locomotion using unsteady thin airfoil theory

Numerous experimental and computational studies have been conducted in the past few decades to understand the swimming performance of fish, and to identify the optimal kinematic strategies for a swimming fish or fish-like robot. Many of these studies model the swimmer in a `tethered' condition, in which the swimmer is held fixed while it is subjected to a free stream. Its performance is then quantified using power expenditure, thrust generation, and efficiency. However, the dynamics of a tethered swimmer are different from those of a self-propelled swimmer, whose performance is best measured using its steady-state swimming speed in still fluid and its efficiency. It is an open question whether the conclusions drawn from studies of tethered swimmers can be directly applied to free swimmers. In this study, we use an unsteady panel method to systematically compare the swimming performance of a tethered fin and that of a self-propelled fin attached to a virtual drag-producing body to investigate how their performance varies over a set of prescribed kinematics. After validating the numerical model against previous experimental results, we show how the pitch amplitude, heave amplitude and the phase offset between them affect the efficiency and thrust generation in the tethered case, and how they affect the speed and efficiency in the self-propelled case. We find that the kinematic strategies that optimize the performance of a tethered swimmer do not necessarily optimize the performance of a self-propelled swimmer.
Read the full abstract

Game Theory

A 1.283 Price-of-Anarchy Bound for the Repeated Virtual First-Price Auction

We study the repeated allocation of a single indivisible resource among $n$ strategic players. Each player $i$ has a privately known value distribution $D_i$, and values are drawn independently across players and periods. The goal is to find fair and efficient mechanisms. We apply the repeated first-price auction with equal initial endowments of virtual money. We show that each player can asymptotically secure the same fair-floor guarantee $f(D_i)$ as in Csóka 2026; consequently, the mechanism is $1.283$-optimal. This provides a simpler and more robust alternative mechanism for this special case and may also help derive sharper upper bounds on the price of anarchy.
Read the full abstract

Robotics

Observability Analysis of Joint Steering and Extrinsic Calibration

This technical report studies the local weak observability of a planar bicycle-model vehicle when vehicle pose, planar LiDAR extrinsic calibration, and steering-angle bias are estimated jointly. A Lie-derivative-based nonlinear observability analysis is used to examine stationary, straight-line, constant-curvature, and combined straight-plus-arc motion. The resulting observability matrices and nullspaces describe how pose, LiDAR translation and yaw offsets, and steering bias become coupled under different motion primitives. Stationary motion and individual motion primitives retain unobservable directions, whereas the combination of straight and curved motion removes the identified degeneracies and yields full local weak observability of the seven-state system. The analysis provides a theoretical basis for selecting calibration trajectories that sufficiently excite both steering and sensor-extrinsic parameters.
Read the full abstract

Sound

Motion-Omni: End-to-End Joint Speech and Full-Body Motion for Spoken Dialogue

An avatar that holds a conversation should decide what to say and to move while saying it, yet these abilities live in separate model families: spoken dialogue models produce speech without motion, and co-speech motion models produce motion only from audio handed to them. The standard remedy is a cascade that first generates the spoken response and then runs a motion model over the finished audio, which requires a second full inference pass and precludes any joint optimisation between the two. We present Motion-Omni, an end-to-end framework in which a spoken dialogue model natively outputs explicit facial expression together with hand, upper-body and lower-body motion, generated directly from the hidden states that produce the speech. Joint training is not optional here: with the speech pathway frozen, motion remains misaligned with the audio, and co-adapting the LLM, Speech Generator and Motion Generator under both objectives is what recovers alignment while retaining spoken-dialogue ability. Supervision comes from a scalable, model-agnostic pipeline that pseudo-labels consistent-voice speech responses with a replaceable motion teacher, yielding 422,856 quality-ranked pairs (1,402 hours). We further release SwDA-500 and, to our knowledge, the first public evaluation protocol for stochastic open-ended full-body spoken dialogue, matching audio across motion systems while unifying rendering, automatic metrics, human evaluation, and latency measurement. Instantiated with a Qwen2.5-7B-Instruct backbone, Motion-Omni-Q7 matches the same-audio teacher cascade to within 2% on reference-free motion metrics while responding 5.4 x faster (RTF=0.78, faster than real time), surpasses all non-teacher cascades on beat correlation and diversity, and reaches a 2.62% word error rate, the lowest among the omni-modal systems compared.
Read the full abstract

All authors Chengqian Ma, Wei Tao, Haoyu Zhang, Yiwen Guo

Multimedia

Encore: Infinite Audio-Video Generation with Adaptive Signal Routing

Existing audio-video generation methods produce well-synchronized clips but are limited to short durations, while long-video generation methods extend duration through chunk-based iterative synthesis yet lack audio entirely. Generating long audio-video jointly is fundamentally harder than either task alone: each chunk must simultaneously maintain video temporal coherence, audio temporal coherence, and cross-modal synchronization, whose conditioning signals enter the model through different pathways. In this work, we present Encore for long-form synchronized audio-video generation. Our key insight is to factor this challenge into: (1) local continuity handled by iterative generation with explicit cross-chunk context propagation, and (2) global consistency enforced via reference audio-video signals with shifted position embedding. Building on this design, we propose Adaptive Signal Routing (ASR), which introduces learnable attention biases within self-attention and learnable residual scales on cross-attention outputs, enabling the model to adaptively modulate the influence of each conditioning signal. Trained end-to-end for joint audio-video generation, Encore also supports infinite-length audio-to-video and video-to-audio synthesis at inference by conditioning on the ground-truth modality throughout the denoising process. Experiments on our extended VerseBench for long audio-video evaluation demonstrate that Encore significantly outperforms existing methods in both generation quality and temporal coherence. Code and data for this paper are at https://github.com/shaohua-pan/Encore.
Read the full abstract

All authors Shaohua Pan, Junbao Chen, Shengyi He, Jingfeng Xue, Wen Tao, Haocheng Feng, Siming Fan, Dongwei Pan, Yi Yang, Wei He, Hang Zhou

Software Engineering

Physics-Direct FPGA Tooth-Contact Computation for Deterministic Gear Digital Twins

Gear digital twins, hardware-in-the-loop rigs, and active vibration control close a loop around the instantaneous tooth-contact state, demanding a solver that is real-time, deterministic, and embeddable – properties that loaded tooth contact analysis (LTCA), a data-dependent linear complementarity problem (LCP) costing seconds per mesh phase in fp64, structurally lacks; learned surrogates infer fast but spend one full LTCA solve per training sample and offer no guarantee beyond their training envelope. We instead compress the closed-form contact physics – contact-point localization, principal-curvature extraction, and the elliptical Hertz solution – directly into a branch-free fixed-point FPGA datapath, termed physics-direct, realized through the fully open-source openXC7 flow (no vendor tools, no floating-point IP) and validated on retired XC7K480T silicon. Four SoCs – geometry, Hertz, and two fused paths – pass bit-exact JTAG readback against a golden model. The on-chip preview tracks LCP body pressure to within -22% and loaded transmission error (LTE) peak-to-peak to -19%, preserving the exact $W^{1/3}$ law; with zero training it extrapolates in load more accurately than a trained network (18.9% versus 20.3%). Latency is a compile-time constant ($\sigma = 0$ jitter), and the DSP-bound geometry kernel saturates the fabric near 63 lanes. Physics-direct is an interpretable, deterministic alternative to neural surrogacy for embedded tooth-contact estimation.
Read the full abstract

Statistical Mechanics

Dipolar order across Bravais lattice space: classification, spin waves, and a four-attractor phase diagram

Every crystal is a Bravais lattice decorated by a basis, so the dipolar ordering of the fourteen Bravais lattices is the natural starting point for any systematic theory of dipolar magnetism in three dimensions. We determine it here in a single common framework: the interaction tensor is Ewald-summed, the classical ground state is obtained by minimising the lowest Luttinger–Tisza band over the entire Brillouin zone, and the linear spin-wave spectrum with its zero-point corrections is computed for every lattice whose order is collinear. Three results emerge that are not properties of individual lattices but of the landscape. First, two structural principles — the exact tracelessness of the dipolar tensor in three dimensions, and its identical vanishing at $\mathbf k=0$ for every cubic-symmetric lattice — explain the ordering type, the absence of first-order cubic anisotropy, and the systematics of the zero-point moment reduction. Second, exactly one lattice defeats the Luttinger–Tisza construction: for face-centred orthorhombic the optimal eigenvector is not circular, the single-$\mathbf k$ state is a spin-density wave of non-constant length, and the tabulated energy is a strict lower bound; direct supercell minimisation gives the true ground state. Third, optimising each family over its free metric parameters collapses the whole of Bravais space onto only four attractors, with body-centred tetragonal the global optimum and a single interior optimum at rhombohedral $\alpha=62.42^\circ$ lying below face-centred cubic. Three independent published benchmarks are reproduced.
Read the full abstract

Chemical Physics

Unraveling the PFAS helix: A statistical approach

The extreme persistence of per- and polyfluoroalkyl substances (PFAS) in the environment is rooted in their three-dimensional molecular conformation. The helical twist adopted by perfluoroalkyl chains due to hyperconjugation involving their recalcitrant C-F bonds governs their resistance to degradation, yet a quantitative, continuous metric for helicity has remained absent. Here we introduce a data-driven framework that quantifies backbone helicity using three statistical descriptors: void-state (binary occupancy) spatial autocorrelations, local backbone principal component analysis, and persistent homology. We further validate each statistical descriptor against geometric dihedral benchmarks and DFT-calculated Vibrational Circular Dichroism (VCD) spectra. The framework is initially established on a homologous series of perfluorocarboxylic acids (FC2 through FC16) and their hydrogenated analogues, then extended across perfluorosulfonic acids, fluorotelomer alcohols, polyfluoroalkyl hexanoic acid analogues, and longer-chain PFOA and PFOS analogues. Agreement between statistical, geometric, and spectroscopic definitions of helicity is established for PFCAs and extended to structurally distinct subfamilies, including PFOA analogues of varying fluorine content and perfluorosulfonic acids, demonstrating that the descriptors are robust to changes in headgroup chemistry and fluorine substitution pattern. The framework provides a chemistry-agnostic toolset for incorporating backbone conformation into predictive models of PFAS environmental fate and degradation reactivity.
Read the full abstract

All authors Pranoy Ray, Haden Cavalli, Gashaw Bizana, Andrew R. Castillo, Shubham Vyas, Ronald L. Siefert, Surya R. Kalidindi, Manoj Kolel-Veetil

Statistical Mechanics

Classical dipolar Heisenberg models on the Archimedean and Laves lattices

We study classical Heisenberg spins interacting through the dipole–dipole interaction on the eleven Archimedean and eight Laves planar lattices at canonical geometry, which reduce to fifteen distinct vertex sets. For each lattice we compute the Fourier-space interaction matrix $\Am(\bk)$, extract the Luttinger–Tisza ordering wave vector $\bk_{0}$, determine the classical ground state by unconstrained minimization on the commensurate magnetic cell, and evaluate the linearized spin-wave dispersion $\varepsilon_{i}(\bk)$ along the high-symmetry path of the (magnetic) Brillouin zone together with the Holstein–Primakoff moment reduction. The ground states fall into three classes: five are collinear, two are non-collinear at angles commensurate with the lattice symmetry, and eight cant at transcendental angles, which we determine to thirty digits. Across the family, failure of the Luttinger–Tisza strong condition coincides exactly with the appearance of incommensurate canting, with no exceptions in either direction. Truncating the interaction range shows that whether a lattice cants is fixed by the local coordination geometry, whereas the value of the canting angle is set by the long-range tail. The quantum corrections are governed by the magnon spectrum through the size of the magnetic basis and are uncorrelated with frustration, so that the frustration and fluctuation classifications are independent; the corner-sharing lattices host the narrowest low-energy branches. The results constitute a spectral atlas of dipolar Heisenberg systems on the full family of $1$-uniform planar tilings and their duals, and provide predictions for inelastic neutron scattering in materials whose magnetic ions occupy Archimedean or Laves lattices, and for artificial arrays of dipolar-coupled nanomagnets.
Read the full abstract

Mesoscale and Nanoscale Physics

Graphene-enabled dynamic H-J switching of dipole-dipole coupling

Environmental modification of dipole interactions has long been explored in energy transport. Here we consider the effects of a tunable graphene monolayer upon nearly H-type or J-type molecular aggregates, concentrating on the inversion of one type of coupling to the other. Modelling the graphene as being deposited on a metallic substrate, we find that as the surface conductivity of the graphene is varied, there is a corresponding change in the parameter region over which coupling inversion is predicted. This provides a route towards observing the predicted coupling inversion in a real system by dynamically changing the surface conductivity during a single run of an experiment.
Read the full abstract

Chemical Physics

Enumerating Chemical Structures, Stereoisomers, and Stereogenic Units with Analytic Combinatorics

The enumeration of chemical structures traditionally relies on graph- and group-theoretic techniques, including Pólya theory, in order to account for stereochemical symmetries. These methods require bespoke derivations and methods for each molecular family of interest, and quickly become very intricate for nontrivial classes. In this work, we demonstrate that analytic combinatorics provides a unifying, highly extensible, and relatively simple framework for enumeration problems. Using the symbolic method, we show that classical counting problems, such as the enumeration of acyclic alkanes and other hydrocarbon families, can be naturally solved via concise combinatorial specifications of the class of interest. We first demonstrate the simplicity of this approach by replicating existing results in this framework, requiring significantly less work than previously necessary, and then extend these ideas to more complex problems, counting broader classes of molecules accounting for both tetrahedral and E/Z stereoisomerism, counting the distribution of stereogenic units, and enumerating achiral and meso compounds. All results are made reproducible through CombOL, our open-source software package which automates the translation of combinatorial specifications into generating functions using the symbolic method, and performs both univariate and multivariate enumeration.
Read the full abstract

General Relativity and Quantum Cosmology

Parameter Space, Realistic Matter, and Universal Relations in Bose–Einstein Condensate Dark Stars

We study slowly rotating Bose–Einstein condensate (BEC) dark stars by solving the Tolman–Oppenheimer–Volkoff, Hartle dipole, and Postnikov–Hinderer equations together for a polytropic equation of state with a Lee–Huang–Yang correction of strength $\zeta$~\citep{Panotopoulos2026}. A continuous scan of $\zeta$ from 0 to 1.5 shows the mean-field-to-corrected transition is smooth, with no hidden structure at intermediate values. Scanning the underlying boson parameters $(m,a_s)$ more broadly, we find that a $2\,M_\odot$ maximum-mass bound and a GW170817-like tidal bound $\Lambda_{1.4}\lesssim800$ cannot be satisfied simultaneously anywhere in this equation-of-state class. The $I$-Love universal relation holds to $0.13\%$ across twelve $(m,a_s,\zeta)$ models, and the $\zeta=0$ and $\zeta=1$ sequences sit on opposite sides of the master curve by a consistent, non-random offset. Applied without modification to realistic nuclear matter (SLy, APR4), the same solver reproduces published maximum masses to within $1\%$; applied to self-bound MIT-bag quark matter it gives the expected mass–radius shape; and once extended to a two-fluid baryon-plus-dark-matter formalism, it shows that the maximum mass of a hybrid star is not a monotonic function of the central dark-matter fraction. Pooling $I$-Love sequences across nuclear, hybrid, and BEC dark-star models, we find they collapse onto a single curve to within about $5\%$, while self-bound quark stars sit far off it, departing by up to $90\%$.
Read the full abstract

Information Retrieval

The Vocabulary Gap Is an Equity Gap: Register Mismatch in Retrieval Systems for Public-Benefits Access

Retrieval-augmented question answering is increasingly used to help people navigate public-benefits eligibility, yet the documents these systems retrieve from are written in agency register while intended users often ask questions in plain, informal, or non-native English. We show that this register mismatch can turn a high-performing retrieval system into an inequitable one. We construct a controlled benchmark of 51 publicly documented federal benefit-eligibility rules and 25 information needs, each phrased in both agency register and plain user register while keeping the gold passage fixed. Across BM25, TF-IDF, and a term-graph retriever, formal-register evaluation is nearly perfect (Recall@5 96-100%), but plain-register retrieval collapses (Recall@5 36-44%). For BM25, Recall@1 falls from 84% to 16% and Recall@5 from 100% to 44%, a 56-point equity gap on identical information needs. We trace the mechanism to a measurable vocabulary gap: formal queries share 0.63 of their content terms with the gold passage, while plain queries share only 0.11, a 5.9x reduction. A deliberately simple, auditable plain-to-formal lexicon bridge recovers much of the failure, lifting plain-query BM25 Recall@5 from 44% to 80%. The contribution is not a new retriever; it is an evaluation protocol, benchmark, mechanistic diagnosis, and transparent mitigation for a high-stakes social-impact failure mode that standard retrieval evaluation hides.
Read the full abstract

General Relativity and Quantum Cosmology

A Unified Treatment of the Self-Force Problem

This paper introduces formalism, based on worldline effective field theory, which allows one to systematically calculate the gravitational self-force on a compact object immersed in an environment with non-vanishing stress energy. Using the closed time path integral we present a universal effective action that can be used to calculate the equations of motion of a compact object due to its interaction with the environment to any order in the relevant expansion parameters, the relative importance of which depends upon the choice of environment. We show that the leading order equations of motion can be universally written in terms of the retarded two-point function of the stress-energy tensor for the environment. The resulting action can be used to calculate both dissipative (dynamical friction) and conservative forces in a completely relativistic fashion. We demonstrate the utility of the result by calculating the dissipative force due to dust, an inviscid fluid, and a coherent field. Our results agree with those previously derived in the literature. We furthermore show that the famous “Coulomb Log" found by Chandrasekhar should be interpreted as a renormalization group log due to a UV divergence that renormalizes the dissipative part of the in-in action. We then prove that this log is universal in the Newtonian limit in that its value is universal, for a generic class of environments and trajectories. This log is the leading log in an RG flow in the dissipative action that has yet to be explored.
Read the full abstract

Data Analysis and Statistics

A Probability Model for Pentagonal Prism Dice Rolls

In the realm of probability theory and game design, the study of dice probabilities plays a crucial role. The featured dice are usually fair, so their probabilities can be predicted without rolling the dice. Pentagonal prismatic dice are not fair. Hence, the probabilities are more complicated. Our mathematical model is naturally derived from both the geometric properties of the dice and empirical evidence. Dice of varying sizes but with constant volume were designed. Using a 3D printer with 100 percent infill, the dice were printed and prepared. A machine that simulates dropping dice through a dice tower onto a hard surface was used to obtain about 41,000 results. From these data, a statistical model was constructed that gives probabilities of dice with varying height-to-radius ratios. The formula for the model is based on the centroid solid angle, but with two adjustment parameters due to varying energy and other requirements to transition between different resting aspects. Within the range of height-to-radius ratios tested, the data are within reasonable statistical error of the model.
Read the full abstract

Information Retrieval

Imagine Before Acting: Prospective Skill Identification for LLM Agents

Effective skill identification is crucial for LLM agents to reuse task-solving experience for complex task execution, which however remains challenging as agents must accurately identify useful skills from a large skill gallery and invoke them on demand. Existing studies have explored various strategies for skill retrieval and invocation, but largely overlook the natural discrepancy between task descriptions and skill documents. To be specific, our empirical study reveals that task descriptions mainly specify task objectives, whereas skill documents describe the required capabilities and procedural guidance for achieving the objectives. Such a so-called Task–Skill Misalignment (TSM) problem would cause desirable skills to be neglected during retrieval or remain unselected during invocation, thus hindering task execution. As a remedy, inspired by human prospective cognition, we propose SkillDreamer, a prospective skill identification framework to mitigate TSM. In brief, SkillDreamer first infers execution-required capabilities and imagines their realizations as pseudo skills, thereby translating task objectives into execution-oriented guidance for skill retrieval. As execution proceeds, SkillDreamer reevaluates the capabilities required by emerging subtasks to determine which skills should be invoked, thereby aligning skill invocation with evolving execution needs. Extensive experiments on three representative agent skill benchmarks not only verify the effectiveness of SkillDreamer in mitigating TSM, but also demonstrate its generalizability across diverse retrievers and LLM agents. The code will be released upon acceptance.
Read the full abstract

All authors Shuo Liu, Yutong Yang, Haohao Xiao, Mouxing Yang, Xi Peng

Social and Information Networks

SocialBuddy: Tailoring Search Agent for Social Scenarios

In the era of digital social interaction, searching friends' posts from massive social streams has become a fundamental user need. However, while modern agentic search frameworks have achieved remarkable success in conventional retrieval tasks, they break down when confronted with heterogeneous user queries and multi-dimensional social feeds, resulting in severe performance degradation in complex social search. To bridge this gap, we introduce SocialBuddy, the first agentic search framework tailored for social scenarios. Specifically, we construct SocialEnv, the first large-scale simulated environment for social search. Powered by an automated data and trajectory synthesis pipeline, SocialEnv includes 200K user profiles, 10 million social posts, and 50K reasoning trajectories, establishing a solid foundation for the development of social search agents. To tackle the credit assignment dilemma caused by sparse rewards in social search, we design SocialPO, a hybrid-granularity optimization framework. It macroscopically reinforces successful reasoning paths via multi-dimensional rewards, while microscopically rectifying deviated trajectories through fine-grained prefix truncation and token-level supervision. This hybrid-granularity design delivers multi-scale guidance in complex long-sequence scenarios. Finally, we construct SocialSearch Benchmark to provide a quantitative evaluation scheme for assessing the social search capabilities of SocialBuddy. Extensive experiments demonstrate that SocialBuddy-35B surpasses significantly larger frontier LLMs. Code and dataset will be released upon article acceptance.
Read the full abstract

All authors Mingxuan Li, Yirong Mao, FaZhan Zhang, Haibiao Yao, Runze Hu, Wenhui Que

Instrumentation and Methods for Astrophysics

Lynx2030 Science Analysis Group: Final Report

The Lynx2030 Science Analysis Group (SAG) was convened to reassess the scientific goals and technical drivers of the Lynx mission concept amid a rapidly evolving astrophysics landscape. Building on the original Lynx Concept Study, the SAG examined how recent discoveries, emerging facilities, and advances in instrumentation influence the scientific opportunities for a next-generation flagship X-ray observatory. Through focused working groups, the SAG investigated the scientific impact of enhanced capabilities: (i) improved angular resolution, (ii) broader bandpass coverage, (iii) an enhanced microcalorimeter, (iv) new capabilities and observing modes, and (v) larger fields of view. Across a broad range of topics, from the formation of the first black holes and the evolution of galaxies to the baryon cycle, compact objects, stellar explosions, multi-messenger astrophysics, and the dynamic high-energy Universe, the SAG finds that the scientific motivation for a Lynx-class observatory remains compelling and, in many areas, has significantly strengthened over the past decade, prominently through JWST's discovery of the "Little Red Dots", likely massive accreting black holes in infant galaxies whose nature is fundamentally an X-ray question. This report shows that modest extensions beyond the original Lynx design reference mission can unlock transformative science while preserving the observatory's core architecture. Powerful current and future facilities such as Roman, Rubin, JWST, SKA, ngVLA, LISA, and NewAthena highlight the unique role a high-angular-resolution, high-throughput X-ray observatory would play in the multi-wavelength and multi-messenger ecosystem of the 2030s and beyond. The findings of the Lynx2030 SAG confirm Lynx's central vision: an unprecedented view of the hot and energetic Universe, enabling discoveries that will define high-energy astrophysics in the coming decades.
Read the full abstract

All authors Lynx2030 Science Analysis Group: Simon R. Bandler, Laura W. Brenneman, Nico Cappelluti, Daniel Castro, Steven R. Ehlert, W. Peter Maksym, Fabio Pacucci, Scott W. Randall, Grant R. Tremblay, John ZuHone, Steven W. Allen, Antara R. Basu-Zych, Akos Bogdan, Joel N. Bregman, Tamta Burduli, Thomas Connor, Sanskriti Das, Casey DeRoo, Stephen DiKerby, Paul A. Draghis, Martin Elvis, Giuseppina Fabbiano, Ralf K. Heilmann, Jimmy A. Irwin, Amruta Jaodand, Margarita Karovska, Vinay L. Kashyap, Anthony A. Kerr, Caroline Kilbourne, Ralph Kraft, Jiangtao Li, Labani Mallick, Herman L. Marshall, Michael L. McCollough, Anna Ogorzałek, Frederik Paerels, Daniel Patnaude, Paul Plucinsky, David Pooley, Frederick S. Porter, Daniele Rogantini, Roger Romani, Helen R. Russell, Kazuhiro Sakai, Mark Schattenburg, Dan A. Schwartz, Malgorzata Sobolewska, Paolo Soffitta, Alexey Vikhlinin, Daniel R. Wilkins, Scott Wolk, Ka-Wah Wong, Irina Zhuravleva

Artificial Intelligence

EULER: Exploring Underused Links with Evidence-Checked Return for Multi-Agent Mathematical Discovery

Mathematical communities work with different objects, invariants, and tools, so transferring a problem across them is expensive and often skipped. We present EULER, a multi-agent system that takes such a transfer–a bridge–as its unit of search. Around a fixed conjecture, EULER runs direct, adjacent-domain, and distant-domain routes in competition; a bridge keeps its budget only if it supplies an operation the source representation cannot execute and its target-side evidence returns to the original statement along a checked implication. Six ordered stress tests reject invalid bridges before expensive search begins. We evaluate EULER on 120 recent conjectures. The conjectures were frozen before search and screened for contamination, and are drawn from public papers by authors who had recently published in the Journal of Combinatorial Theory, Series A, a leading journal in combinatorics. EULER produced 10 proofs and 3 refutations, plus 45 scoped partial results. Two mechanisms held up under ablation: bridge-specific stress tests cut incorrect conclusions from 9 to 3, and bridge material combined with a target-native operation yielded a positive interaction of +4.2 resolved tasks that neither factor produced alone. Domain distance did not reliably predict success; executable operation gain and valid return did.
Read the full abstract