Peer Revenue Equity in science

Papers

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

All of arXiv

Sunday 30 August

Solar and Stellar Astrophysics

Intermediate-mass runaway and hypervelocity star candidates in DESI DR1

Runaway stars ejected from the Galactic disc span a range of velocities, with two extreme regimes of particular interest. Hyper-runaway stars reach velocities approaching the local Galactic escape speed while remaining gravitationally bound to the Galaxy, while hypervelocity stars (HVS) have speeds which exceed the escape speed, leaving them formally unbound. Studying both populations places stringent constraints on star cluster formation, supernova explosions in massive binaries, and the shape of the stellar halo. Here we present a spectroscopic search for such extreme-velocity stars using data from the first data release of the Dark Energy Spectroscopic Instrument (DESI DR1). Because these objects are typically located at distances beyond the range where gaia parallaxes are reliable, we derive stellar parameters through a combined analysis of spectroscopy and spectral energy distributions (SEDs). These parameters are then compared with stellar evolutionary tracks to infer distances, which are subsequently used to compute the kinematics of the candidates. We identify a sub-sample of eight stars that appear unbound to the Galaxy, likely of extragalactic origin. These stars exhibit projected rotational velocities exceeding $50$ km s$^{-1}$, consistent with a main-sequence nature. An additional eleven stars are identified as potential HVS candidates under the assumption that they are main-sequence stars. This interpretation is not supported by their rotational velocities, making their unbound status less secure. Finally, $26$ stars show evidence of being main-sequence runaway stars ejected from the Galactic disc. The fastest object in the sample is a metal-poor HVS candidate with a Galactocentric velocity upper-limit of $934 \pm 110$ km s$^{-1}$. The star with the largest measured radial velocity of $513$ km s$^{-1}$ is most likely a slowly pulsating B-type runaway star.
Read the full abstract

All authors Aakash Bhat, Matti Dorsch, Ulrich Heber, Stephan Geier, Harry Dawson

Numerical Analysis

An Immersed Interface Method for Parabolic Interface Problems with Nonlinear Jump Conditions

We develop an immersed interface finite difference method for a one-dimensional nonlinear parabolic interface problem with jump condition \[ [u]_\alpha=\lambda u^+u^-. \] The method combines a Crank–Nicolson immersed interface discretization with an \(s\)-parameter reduction of the nonlinear interface condition, thereby reducing the nonlinear coupling to a scalar quadratic equation. We also discuss two different viewpoints for combining Newton iteration with immersed interface discretization, namely the IIM–Newton and Newton–IIM formulations. Numerical experiments are presented to illustrate the behavior and accuracy of the method.
Read the full abstract

Number Theory

Lower Bounds for Moments of $L$-functions

In this article, we introduce a refinement of the method of Heap and Soundararajan to obtain lower bounds for the $2k$-th moment of a broad class of $L$-functions for all real $k\ge 0$. In particular, our method circumvents the need to estimate the twisted moments of $L$-functions.
Read the full abstract

Statistical Mechanics

Chemical potentials from structure factors: II. Charged multi-component mixtures

The chemical potentials of charged multi-component mixtures are central to electrolyte thermodynamics, but remain difficult to compute from atomistic simulations. The S0 method enables computing chemical potentials of mixtures from equilibrium molecular dynamics simulations. Here we extend the S0 method to charged mixtures by combining the composition-space framework developed in Part I: Neutral Multi-component Mixtures with a Coulombic treatment of the small-wavenumber limits of static structure factors. This approach separates thermodynamically relevant neutral composition fluctuations from forbidden macroscopic charge fluctuations, and further accounts for charge-neutrality constraints. We use the method to compute the chemical potentials of multiple-halide aqueous salt solutions, elucidating the ion-specific thermodynamic effects. We also calculate the mixing free energies of molten salt mixtures, demonstrating the importance of correctly describing long-wavelength electrostatic correlations.
Read the full abstract

All authors Xiaoyu Wang, Roya Savoj, Musahid Ahmed, Bingqing Cheng

Probability

Multihomogeneous Measures and Stochastic Polar Representations

Let \(q\in\mathbb N\), let \(G=(0,\infty)^q\), and let $ S:G\times E\longrightarrow E, (r,x)\longmapsto S_rx $ be a jointly measurable left action on an arbitrary measurable space \((E,\mathcal E)\). For \(\alpha=(\alpha_1,\ldots,\alpha_q)\in(0,\infty)^q\) set $ \chi_\alpha(r)=\prod_{i=1}^q r_i^{\alpha_i}. $ We study nonzero \(\sigma\)-finite measures \(\nu\) satisfying $ \nu(S_rA)=\chi_\alpha(r)^{-1}\nu(A), r\in G, A\in\mathcal E.$ Motivated by the scalar case \(q=1\) studied in [1] we derive equivalent conditions for the existence of an \(E\)-valued random element \(Z\) such that $ \nu(A) = \mathbb{E}\{\int_G\mathbb I_A(S_rZ)\prod_{i=1}^q \alpha_i r_i^{-\alpha_i-1}dr_i\}, A\in\mathcal E. $ We also characterise when two random elements generate the same homogeneous measure, using multihomogeneous moments and, after fixing an admissible product gauge, weighted transverse measures. When the corresponding weighted transverse measure is finite, tilting and gauge normalisation produce a canonical representer, unique in law on the prescribed gauge shell. Finally, we characterise stationarity under an action commuting with \(S\) and construct positive semidefinite tail-overlap kernels directly from \(\nu\).
Read the full abstract

Hardware Architecture

High-Performance Low-Power Adiabatic Systolic Array Design in Advanced FinFET Nodes

Adiabatic logic has traditionally been recognized as a low-power solution but constrained to low clock speeds to preserve adiabatic behavior. For advanced FinFET nodes, however, clock frequencies have plateaued due to power/thermal concerns (dark silicon) even as the intrinsic device speeds have continued to scale. This convergence opens an opportunity for adiabatic logic to maintain adiabatic behavior even at GHz clocks. We demonstrate an adiabatic logic (AL) design methodology through a MAC systolic array implemented in commercial 16 nm FinFET technology with a resonant 4-phase power clock (PCK) generator, including digital-to-AL and AL-to-digital interfaces. Simulations show that the AL MAC systolic array at 1 GHz achieves power reductions of up to 42% and 36% at the core and system levels, respectively, compared to digital counterparts. Scaling to more advanced nodes should provide even better power/performance metrics.
Read the full abstract

All authors Jun Yin, Liangtao Dai, Yimin Gao, Mircea R. Stan

Operator Algebras

Property (SP) and Inclusions of C*-algebras

As a generalization of Gabe and Neagu's inclusions of real rank zero, we introduce a notion of Property (SP) for inclusions of C*-algebras. We begin the systematic study of SP-inclusions, establishing a topological description in the commutative setting and permanence under many constructions. We also extend known results about the permanence of Property (SP) for C*-algebras under classical symmetries to the setting of quantum symmetries; we show that Property (SP) for (simple, separable) C*-algebras is preserved under irreducible C*-discrete inclusions. Finally, we resolve (in the negative) a question raised by Gabe and Neagu about inclusions coming from Furstenburg boundaries. Namely, we show the existence of a countable, discrete, non-amenable group $G$ such that $C_r^*(G) \subseteq C(\partial_F G) \rtimes_r G$ is not an SP-inclusion (and therefore not an inclusion of real rank zero).
Read the full abstract

Artificial Intelligence

Game-Agnostic Value Functions through Automatic JSON Feature Extraction

JSON Bag-of-Tokens (JSON-Bag) is a recently proposed method to generically represent game trajectories by tokenizing their JSON descriptions. We introduce JSON-Bag VF, a game-agnostic approach to training value functions for game-playing agents using JSON-Bag prototypes. We show that this approach can be enhanced with Random Forest-based feature selection and a method to select game-stage-specific features. We evaluate JSON-Bag VF with One-step-look-ahead (JSON-Bag OSLA) on six tabletop games over different combinations of prototype-tokenization and feature selections. JSON-Bag OSLA outperforms baseline OSLA agents in most games. Our analysis also shows that feature selection significantly improves JSON-Bag VF and that feature selection is the most important factor in JSON-Bag VF performance, over prototype-tokenization.
Read the full abstract

Robotics

MiBOT: A head-worn robot that modulates cardiovascular responses through human-like soft massage

Massage therapy is helpful for the rehabilitation of various diseases, such as headaches caused by migraines and stress. Existing robotic systems have focused on massage therapy on the torso and limbs, but performing massage motions through suitable actuation on a person's head has been a challenge. In this paper, we present MiBOT, a head-worn massage robot that actuates two soft tactors to produce touch motions mimicking human massage. A key design principle behind MiBOT is its silent actuation, which we achieve through pneumatic artificial muscles in conjunction with a controller loop to respond to contact pressure. We evaluated the effectiveness of MiBOT in a controlled study and assessed subjects' blood pressure and heart rate levels while applying MiBOT. We found that our mechanical system generated positive and conclusive quantitative outcomes that are similar to the human-administered massage, decreasing participants' mean systolic and diastolic blood pressure by 2.8 mmHg and 1.7 mmHg, respectively, as well as calming their heart rate by 8-10% on average.
Read the full abstract

All authors Alice Mylaeus, Stephanie Vogt, Berken Utku Demirel, Marcel Gort, Mirko Meboldt, Manuel Meier, Christian Holz

Machine Learning

When 3D Gaussian Splatting Recovers Real Surfaces

When does 3D Gaussian Splatting (3DGS) recover the true scene surface rather than just overfitting view-dependent appearance? We answer this by developing a mathematical framework based on a first-hit rendering abstraction that cleanly isolates geometry from appearance. We prove that geometric misalignment forcefully converts spatial textures into high-frequency angular signals via parallax. This establishes a strict identifiability window: if angular capacity is bounded, surface-consistent solutions are mathematically preferred; if unrestricted, the same images can be perfectly explained by an incorrect, opaque billboard geometry. Experiments on synthetic stress tests confirm this prediction, showing billboard failures emerge precisely at high angular capacities. Conversely, in the real-world datasets we evaluate under standard capture protocols, reconstructions remain surface-consistent even at high SH degrees, which is consistent with the prediction that rich spatial texture can push billboard solutions outside the tested angular-capacity range.
Read the full abstract

Information Retrieval

The Language of the Question Selects the Market: Query Language and Exit IP as Separable Factors in Commercial Recommendations from a Generative Search Interface

When a generative search interface answers a commercial question, which market's products it names is decided before the model reasons about the products. We report a controlled probe of 234 runs against the logged-out ChatGPT web interface and the OpenAI API, collected on 29 and 30 August 2026 across four exit countries and six query languages, with six identical runs per cell. Three results. First, the top recommendation is unstable: it changed across six identical runs on four of six prompts, and that rate was identical in the browser interface and in the API with web search both enabled and disabled, so instability is a property of the system and not of the surface. Second, query language, and not location, decides whether local suppliers appear at all. Where the query language matched the country, a global brand won 1 of 24 runs; asked in English on the same connections, local brands took 0 of 6 runs in Estonia and Turkiye. Third, language and location are separable and act on different things: holding the query language fixed and moving only the exit IP moves the market whose brands are named while the answer stays in the query language. We show this on two unrelated pairs, Turkish asked from Berlin and Russian asked from Tallinn, and in both the answer names the resident country's suppliers. A minority language occupies a middle tier: Russian asked from Estonia names an Estonian supplier in 4 of 6 runs and a global one in all six, where Estonian names a local supplier in every run and English names none. A negative control in a second category, coded with the same instrument, shows no language effect at all, and disconfirms our own expectation: that category does have domestic suppliers and none was named in any language, which points the explanation at whether a category is nationally regulated rather than at whether it is nationally supplied.
Read the full abstract

Artificial Intelligence

Mitigating Over-Optimization in PRM-Guided Search in Mathematical Reasoning by Optimizing the Guide

Process reward models (PRMs) provide dense step-level guidance for search-based reasoning, enabling inference-time compute to be allocated toward promising partial solutions. However, recent evidence suggests that PRM-guided search can over-optimize imperfect process rewards, pruning viable trajectories while expanding spurious ones. In this work, we theoretically show that directly leveraging PRM score is vulnerable to verifier noise through an extreme-value effect: non-viable prefixes become more likely to receive spuriously high scores as reasoning depth increase. Therefore, we formulate the PRM-guided search as a robust optimization problem over plausible reward perturbations, termed maximin PRM-guided search, leading to a training-free robust process supervision method that preserves promising alternatives when step-level scores are noisy. Maximin PRM-guided search mitigates this failure mode by reducing sensitivity to over-optimized PRM outliers. Without fine-tuning or online adaptation, maximin search consistently improves the PRM-guided search by 17-35% on average, outperforming outcome- and step-level baselines in 14 out of 16 settings. Our source code is available at https://github.com/tjoo512/maximin-search.
Read the full abstract

Artificial Intelligence

Spec2Twin-Chain: Orchestrating Bi-Level Optimization with LLMs for Blockchain Digital Twin Construction

Building a blockchain digital twin largely requires translating domain knowledge and specific system descriptions into a simulator architecture, calibrating its parameters against behavioral evidence, and validating the constructed twin. These steps are commonly performed through application-specific modeling efforts that can be difficult to reuse across systems and downstream decision problems. We consider automating this process through Spec2Twin-Chain, a framework that formulates blockchain digital-twin construction as a bi-level optimization problem. At the upper level, a large language model proposes and revises structurally admissible architectures using system specifications, behavioral evidence, and feedback from evaluated designs. At the lower level, a simulation-based optimizer calibrates the architecture-conditioned parameters under explicit objectives and guardrail constraints. The two levels iterate. The evaluated candidates at lower levels are retained in a global archive and used to guide subsequent proposals at upper levels. We conduct controlled experiments involving twin calibration, feedback-driven recovery, stress analysis, downstream policy optimization, and policy updating. The results demonstrate that the framework can construct behaviorally accurate twins, improve initial designs through iterative feedback, and reuse calibrated twins to support downstream decisions.
Read the full abstract

All authors Haoting Zhang, Haoxian Chen, Jiayuan Sheng, Donglin Zhan, Zeyu Zheng, David D. Yao, Wenpin Tang

General Relativity and Quantum Cosmology

Periodic orbits around a magnetically charged black hole in $f(R,T)$ gravity coupled with Euler-Heisenberg electrodynamics

We systematically investigate the zoom-whirl periodic orbits of a small compact object orbiting a magnetically charged black hole in $f(R, T)$ gravity coupled with Euler-Heisenberg nonlinear electrodynamics. We evaluate the impact of the magnetic charge $Q_m$ and the Euler-Heisenberg parameter $a$ on the characteristics of the innermost stable circular orbit (ISCO) and the marginally bound orbit (MBO). Particularly, we focus on the precession parameter q and systematically examine how the magnetic charge and other parameters affect the trajectories of periodic orbits. Using the numerical kludge method, we generate gravitational waveforms for these periodic orbits. The results presented in our work demonstrate that the magnetic charge can significantly modify not only the precession parameter but also the orbital trajectories of the periodic orbits. Moreover, changing the magnetic charge $Q_m$ could cause a significant phase shift in the gravitational waveforms, while other parameters exert a relatively weaker influence on the gravitational waves.
Read the full abstract

Classical Analysis and ODEs

Counterexamples for generalizations of the non-elliptic Schrödinger maximal operator

For $P=X_1^2+\cdots + X_n^2$, let $T_t^Pf(x)$ denote the solution to the linear Schrödinger equation at time $t$. In 1980, Carleson asked for the minimal regularity of an initial data function $f\in H^s(\mathbb{R}^n)$ that guarantees pointwise convergence of $T_t^Pf(x)$ to $f(x)$ as $t\rightarrow 0$. This was resolved by Bourgain, who constructed counterexamples for the Schrödinger maximal operator to show that $s\geq n/(2(n+1))$ is necessary, and Du and Zhang, who proved that $s> n/(2(n+1))$ is sufficient. Rogers, Vargas, and Vega studied the analogous question for the non-elliptic Schrödinger maximal operator, where $P = X_1^2-X_2^2 \pm X_3^2\pm \cdots \pm X_n^2$, and proved that, for all $n\geq 2$, $s\geq 1/2$ is necessary and $s>1/2$ is sufficient. In this paper, we construct counterexamples for generalizations of the non-elliptic case and prove a necessary condition of $s\geq 1/2$ for an infinite class of polynomial symbols $P$.
Read the full abstract

Artificial Intelligence

Can LLM Agents Discover? Evaluating Creativity on ML Engineering Tasks

Recent AI systems promise autonomous scientific discovery, claiming to discover algorithms and produce research papers, yet understanding whether they exhibit creativity, the capacity to produce solutions that are both novel and useful, remains an open question. We present a framework for evaluating multi-turn LLM research agents' creativity using ML engineering tasks as a testbed, through three dimensions: P-Creativity (psychological novelty: novel relative to the agent's own prior solutions within a run), H-Creativity (historical novelty: novel relative to the corpus of human solutions), and Usefulness (task performance). Evaluating two agent frameworks, AIDE and AIRA-Dojo, on 10 Kaggle-style machine learning tasks from MLE-Bench, we develop an LLM-as-a-Judge pipeline and verify its strong correlation with human creativity judgments, providing a reliable automated metric for P-Creativity evaluation at scale. Applying this pipeline to agent trajectories, we find: (1) all agents exhibit declining P-Creativity as they transition from exploration to exploitation; (2) LLMs exhibit greater H-Creativity than medal-winning humans, yet achieve lower performance. Our findings reveal that current agents can explore novel regions of the solution space but lack the capacity to convert this novelty into improved task performance.
Read the full abstract

Machine Learning

Forget or Fine-tune? A Comparative Study of Machine Unlearning Strategies for Noisy Label Correction

Noisy labels remain a critical challenge for training deep neural networks, since memorizing incorrect labels degrades generalization. Once noisy samples are identified after training, the standard solution is to retrain the model from scratch on the cleaned dataset, which is increasingly expensive as datasets and models grow. Machine Unlearning (MU) has recently emerged as a computationally efficient alternative, but the relative effectiveness of different MU strategies for noisy-label correction remains poorly understood. In this work, we conduct a comparative empirical study of five MU methods (NegGrad, Fine-Tuning (FT), Random Labeling (RL), SalUn, and MUNBa) across symmetric, asymmetric, instance-dependent, and open-set noise on CIFAR-10, CIFAR-100, and the real-world noisy dataset Food-101N. Our central finding is that the appropriate unlearning strategy is conditioned on the noise structure. Simple FT is a strong baseline across most closed-set scenarios; RL and SalUn are the most consistently robust methods and, under instance-dependent noise, approach retraining accuracy at a fraction of the computational cost; MUNBa shows advantages mainly under extreme symmetric noise. Under open-set noise, in contrast, we show that retraining on the cleaned subset degrades accuracy relative to the noisy baseline, so approximating the retrained model is not an adequate objective in this regime. On Food-101N, all MU methods remain competitive and achieve accuracies close to retraining despite reducing runtime by an order of magnitude. These findings provide practical guidelines for selecting MU strategies for post-training noisy-label correction.
Read the full abstract

Complex Variables

Revisiting Fischer decompositions by inframonogenic functions

We explore Fischer decompositions from the perspective of inframonogenic functions in Clifford analysis, a non-commutative version of harmonic functions in Euclidean spaces. We study decomposition formulas for polynomial spaces involving inframonogenic and harmonic components, providing fresh insights into their algebraic structures and further important applications.
Read the full abstract

All authors Daniel Alfonso Santiesteban, Ricardo Abreu Blaya, Juan Bory Reyes, Baruch Schneider

Artificial Intelligence

Balance of Benchmarks: Evidence Retention and Multiplicity-Aware Model Comparison

Benchmark aggregation requires decisions about how much evidence to use and how much influence each benchmark receives. Curated suites control influence through selection, which can exclude informative observations. A broader pool can retain those observations. With equal weighting, repeated or closely related benchmarks gain influence as their number grows. We introduce Balance of Benchmarks (BoB) to retain eligible observations and control their influence separately. We fit benchmark-specific response curves to place different difficulty ranges on a shared ability scale and use description similarity to downweight benchmarks in crowded neighborhoods. We test retention and density weighting in separate interventions on WildScores, a sparse collection of 148 developer-reported benchmarks, using 14 Artificial Analysis benchmarks as a controlled reference. With the model population fixed and entire source-lineage families held out, suite expansion improves held-out prediction under BoB and equal-weight equating on both WildScores and BIG-bench. Under substantial reporting overlap, density weighting improves robustness to multiplicity. Complete re-listings yield smaller mean rank displacement under BoB (0.63 versus 1.95 for equal-weight equating), with benefits also in paraphrased re-listings and supported affine fits. The benefit can reverse if models report different benchmarks, because a single weight per column gives models that report only part of a group less than its intended share. We therefore compute each model's weights from the benchmarks it reports. This rule removes the reversal in controlled re-listings and keeps held-out prediction close to that of equal weighting. These comparisons separate evidence retention, benchmark influence, and reporting coverage and show why repeated entries need to be handled per model.
Read the full abstract

Numerical Analysis

Fortin operators for DPG advection discretizations

We construct Fortin operators for discontinuous Petrov-Galerkin (DPG) discretizations of the advection equation with a piecewise constant divergence-free advection vector $\beta$, on simplicial meshes of any spatial dimension $N$ and for any polynomial degree $k \ge 1$ of the trial space. A minimal test space is built on each element from facet and interior bubbles and later augmented. The Fortin operator is shown to be bounded, uniformly over shape-regular mesh families, in the natural $\beta$-weighted broken test graph norm built on $L_q$ for every $1 < q < \infty$, where $q$ is the exponent conjugate to the trial exponent $p$. A non-characteristic facet condition is assumed when $k \ge 2$, while the lowest-order case requires no such condition and admits characteristic facets. As applications we prove that the practical fully discrete residual minimization method is quasioptimal in the DPG energy norm for every $1 < p < \infty$, with a quasioptimality constant governed solely by the Fortin operator, that its computable residual is a globally reliable and efficient a posteriori error estimator, and that augmenting the test space and changing the test norm improves the results in the lowest-order case.
Read the full abstract

High Energy Astrophysical Phenomena

Advancing Fundamental Physics and Cosmology with high-resolution X-ray imaging

Black Holes are the key to solving many unanswered questions in fundamental physics: in particular, the very extreme properties shown by supermassive black holes at the centers of galaxies make them obvious candidates for testing gravity theories in the strong-field regime. Since X-rays are generated by matter under extreme physical conditions, ultra-high resolution X-ray imaging (uXRI) will directly image the region near the event horizon of black holes in X-rays, similar to the Event Horizon Telescope in the radio band, enabling unprecedented tests of General Relativity and alternative theories of gravity near supermassive black holes. On the other hand, clusters of galaxies hold the potential of unveiling many unknowns in cosmology. uXRI will unlock this potential by probing small-scale plasma properties in the intracluster medium, providing the missing link required to establish galaxy clusters as reliable tools for high-precision cosmology. Moreover, uXRI will enable mapping of Dark Matter from galaxy cluster dynamics via proper motion measurements. Finally, uXRI will open a new field of precision X-ray astrometry, allowing for measuring pulsar parallaxes to support nanoHertz gravitational wave searches.
Read the full abstract

All authors Sara Turriziani, Herman L. Marshall, Daryl Haggard, Scott Randall, Mayura Balakrishnan, Tom Maccarone, Nicole Ford

Cryptography and Security

Reachability-Based Capability Confinement for LLM Agents under Indirect Prompt Injection

Large language model agents place outputs from external skills into their execution context, allowing attacker-controlled data to influence later privileged actions. Existing defenses mainly classify untrusted content or authorize proposed operations. They do not directly address how an agent's future authority should change once untrusted data enters its state. We present SkillGuard, a harness-level enforcement layer that treats this event as contamination and restricts future capabilities to disconnect the resulting state from deployer-defined forbidden states. Given sound skill summaries and policies, SkillGuard represents security-relevant transitions with a Skill Impact Graph, specifies admissible control over skill parameters via steerability signatures, and mediates invocations with an inline reference monitor. Following contamination, it computes weighted capability restrictions using binary, fractional, or fractional-flow strategies without auxiliary language-model inference. We evaluate SkillGuard on four AgentDojo suites with two backend LLMs, Gemini 2.5 Flash and Llama3.3-70B, against an LLM-only No Defense baseline and three defenses at different system layers: Spotlighting, CaMeL, and AttriGuard. We construct a compositional attack benchmark in which each attack combines observations individually insufficient to induce target violation and evaluate the same baselines on it. Under AgentDojo's Tool Knowledge attacks, SkillGuard eliminates attack success on three of four suites for both backends and reduces it to 4.8% and 14.3% on Slack. Against compositional attacks, it outperforms every baseline on Llama and matches the strongest baseline on Gemini at higher benign utility. Fractional-flow restriction preserves substantially more capabilities than binary restriction at the same attack success rate. Across both settings, SkillGuard adds no model calls or token overhead.
Read the full abstract

All authors Wujie Xiong, Rabimba Karanjai, Yang Lu, Weidong Shi, Lei Xu

Machine Learning (Statistics)

A Deep Latent Variable Framework for Jointly Modeling Missingness, Measurement Error, and Heterogeneity

Due to the cost and practical difficulty of obtaining complete and accurate measurements for every individual, population health studies often involve incomplete and error-prone measurements, with missingness and measurement error varying across heterogeneous subpopulations. Although these problems frequently coexist and interact, they are often addressed separately in existing methods. To address these issues, we propose HTree-VAE, a deep latent-variable framework for joint imputation and denoising. The framework combines pattern-aware latent modeling with a hierarchical tree-routed encoder that enables selective parameter sharing across latent subpopulations through a novel reconvergent routing mechanism. It leverages accurate measurements from a validation subset for denoising and explicitly models observation patterns to accommodate both ignorable and nonignorable missingness. Simulation studies demonstrated substantial improvements in reconstruction accuracy over competing deep generative methods. Ablation studies further demonstrated that tree-based and reconvergent routing improved imputation accuracy. We applied HTree-VAE to data from the National Health and Nutrition Examination Survey to denoise self-reported body mass index and impute missing values. HTree-VAE outperformed competing approaches in imputation and achieved competitive performance in correcting self-reported body mass index. These findings highlight the practical value of jointly addressing missingness and measurement error.
Read the full abstract

All authors Yasin Khadem Charvadeh, Grace Y. Yi, Mithat Gönen, Pouya Faroughi

High Energy Physics (Theory)

Admissible higher-spin algebras in flat space

We study admissible higher-spin algebras in four-dimensional Minkowski space, namely algebras that admit the tower of massless higher-spin fields as a representation. Under several simplifying assumptions, we show that these can be of two types, which we refer to as collinear and half-collinear. The chiral higher-spin algebra provides an example of the latter. For the collinear ansatz considered here, direct solution of the Jacobi identity yields two families of Lie algebras. We also find an associative collinear algebra, which is commutative unless internal degrees of freedom are added.
Read the full abstract

Cryptography and Security

ActReal: System-Level Mobile Agents Challenge Mobile Automation Detection

System-level mobile agents are evolving from fixed scripts into adaptive systems that continuously observe interfaces, reason, and adjust their actions, allowing automated attacks to navigate dynamic UIs and complete complex tasks. Existing applications detect automation using touch trajectories, action timing, and the physical coupling between touch and inertial measurement unit (IMU) signals. However, a privileged system-level agent executor can control both touchscreen input and application-visible sensor delivery, enabling it to jointly generate time-aligned touch and six-axis IMU signals and evade these defenses. We present ActReal, a physical-action attack framework for system-level mobile agents. ActReal converts semantic agent actions into task-valid touch and IMU events using genuine-trajectory adaptation and physics-guided IMU generation. ActReal achieves a mean event-level attack success rate of 77.5%; even when detectors jointly observe touch and IMU, its attack success rate remains 71.1%.
Read the full abstract

All authors Mingshuo Wang, Hanqing Guo, Huining Li, Yuliang Fu, Jing Xu, Chenhan Xu

High Energy Physics (Phenomenology)

Quantum Steering Geometry at High Energy Particle Colliders

We formulate collider observables based on quantum steering ellipsoids (QSEs) for reconstructed bipartite systems of spin-$1/2$ particles. A collider spin density matrix defines a two-qubit state, while its QSE gives the geometry of conditional states accessible through local measurements. This makes the ellipsoid a direct probe of the quantum properties of fundamental particles, encoding polarization, spin correlation anisotropy, accessible-state volume, and the orientation of the dominant correlation axes. Using top-quark pair production as a benchmark process, we show how QSE observables organize the Standard Model spin state, probe entanglement, steerability, and Bell-nonlocality criteria, and use an expected precision metric to assess sensitivity to non-local correlations in the boosted central region. We show that different dimension-six operators generate distinctive QSE deformations, and provide a geometric interpretation of quantum information observables in high-energy particle physics. Quantum steering geometry therefore provides a unified framework for particle collider tomography, quantum information diagnostics, and precision searches for physics beyond the Standard Model with applications spanning the HL–LHC and future lepton, muon, flavor, and electron-ion collider programs.
Read the full abstract

All authors Juan J. Mejia Alvarez, Andrew J. Wildridge, Angelo Arisi, Juan M. Duarte-Quiros, Santosh Bhandari, Jingyan Li, Giulia Negro, Andreas W. Jung

Computational Complexity

A note on the $\Sigma_2^P$-completeness of the Frobenius number

Given a finite set $A$ of natural numbers whose greatest common divisor is one, the Frobenius number $g(A)$ is the largest integer that is not a non-negative integer combination of the numbers in $A$. In a 2016 preprint, Matsubara states that given $A$ and $k$, deciding if $g(A) \geq k$ is $\Sigma_2^P$-complete. A decade has passed since without peer-reviewed publication of this result. At the same time, the community has found it difficult to verify this result. In this note, we give a write-up of the completeness proof based on Matsubara (2016).
Read the full abstract

Artificial Intelligence

Beyond Uncertainty: Multi-Solver Disagreement Rewards for Self-Evolving Reasoning Curricula

Self-evolving reasoning frameworks train a Challenger to generate questions exposing a Solver's weaknesses, creating adaptive curricula without human data. However, existing approaches use a single solver's sampling uncertainty as the Challenger's reward. This creates a fundamental bottleneck: as the solver grows confident on the Challenger's question distribution, all sampled answers converge identically, collapsing the reward to zero and starving the Challenger of learning signal. Critically, this single-model reward cannot distinguish genuinely easy questions from those that merely align with one solver's learned biases. We propose a multi-solver disagreement reward using a heterogeneous ensemble varying in model capacity and sampling temperature. A normalized Shannon entropy over the ensemble's per-question plurality answers explicitly rewards questions where solvers produce conflicting solutions—capturing difficulty as inter-model divergence rather than intra-model sampling variance. This richer gradient enables the Challenger to discover questions targeting true capability boundaries, producing a curriculum that forces downstream Solvers to develop robust reasoning strategies generalizing across problem types. Our approach is a drop-in reward function replacement requiring no framework modifications or additional data. Experiments with Qwen3-4B show that Solvers trained on disagreement-Challenger questions achieve +1.34 points average improvement on competition-math benchmarks (MATH-500, AMC, Olympiad), suggesting that multi-solver disagreement provides a complementary and scalable signal for curriculum generation in self-play reasoning systems.
Read the full abstract

Computer Vision

Input-Adaptive Gating of a Dehazing Front-End for On-Device Perception in Smoke-Obscured Environments

Two-stage vision pipelines often place an enhancement network before a task network, on the assumption that a cleaner input produces a better output. We evaluate this in a firefighter assistance pipeline, where a dehazer precedes an edge detector that renders smoke-filled rooms as structural outlines. Both were designed for a Raspberry Pi 4, at 355K and 23K parameters, and quantized to UINT8 via TensorFlow Lite. The float dehazer reaches 18.60 dB peak signal-to-noise ratio (PSNR) on held-out real smoke against 13.60 dB unprocessed and 17.08 dB for an AOD-Net trained on the same data, and the edge detector reaches an F-measure at optimal dataset scale (ODS) of 0.738, outperforming an optimized Canny's result of 0.692. Dehazing improves edge extraction under dense smoke but degrades it on clear and lightly hazed frames, where the dehazer discards more detail than the haze obscures. We therefore run the dehazer only when a dark channel haze estimate exceeds a threshold, a 10.1 ms test that lets the pipeline save 469.6 ms on the dehazing stage. Averaged over four haze levels, gating is more accurate than either fixed decision, at 0.675 mean ODS against 0.664 for always dehazing and 0.630 for never dehazing. It reduces the mean per-frame time on the Raspberry Pi from 569 ms to 321 ms, and on clear frames increases the frame rate fivefold, from 1.8 to 9 frames per second.
Read the full abstract