Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Thursday 10 September

Symbolic Computation

Fast matrix multiplication via recursive $\langle$ 4x4x4:48 $\rangle$ algorithms into practice

We present a fast algorithm for multiplying two 4x4 matrices using 48 multiplications and 204 other operations (addition, subtraction or scaling by a constant) over any ring containing an inverse of 2. Applied recursively, this algorithm reaches a cost bound with leading term (7+3/8)n^{\log_4(48)}. Alternative basis decompositions of this algorithm further reduce this to (6+13/32)n^{\log_4(48)}, with square change of bases, and then to (5+2/3)n^{\log_4(48)}, using rectangular encodings with inner dimensions 24 and 32. The conversion costs of these alternative basis variants are included as lower-order terms.
Read the full abstract

All authors Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic, Joshua Stapleton, Petr Tichavský

Analysis of PDEs

On the parabolic $\Phi_3^4$ model for the harmonic oscillator II: global existence and invariant measures

We establish an a priori bound for the dynamical parabolic $\Phi_3^4$ model with harmonic potential. This bound yields the global well-posedness of the equation and, via the Krylov-Bogoliubov method, the existence of an invariant measure, shown to be non-Gaussian. The argument builds on the strategy developed by Mourrat and Weber for the periodic $\Phi_3^4$ model, with substantial modifications to handle the non-compact geometry of $\mathbb{R}^3$ and the spectral framework imposed by the harmonic oscillator. We further prove that this measure is unique in the small-coupling regime.
Read the full abstract

General Relativity and Quantum Cosmology

Komar superpotentials in extended theories of gravity

This paper investigates Lagrangians with arbitrary dependence on the Riemann tensor and any number of derivatives. Noether's second theorem is applied separately to ${\cal L}_{G}$ and ${\cal L}_{M}$, where the matter Lagrangian depends on a scalar field. For ${\cal L}_{G}$ diffeomorphism invariance requires that the generalized Einstein tensor satisfy $\nabla_{\alpha}E^{\alpha\beta}=0$ and that there is a current satisfying $0=\partial_{\alpha}(\sqrt{g}\, J^{\alpha}_{G2})$. The main result is an explicit formula for the superpotential $\Phi^{[\alpha\mu]}$ that solves $\partial_{\mu}\Phi^{[\alpha\mu]}=\sqrt{g}\,J^{\alpha}_{G2}$. Some applications to $f(R)$ gravity and various quadratic gravity theories are discussed. There are analogous results, including superpotentials, for the matter sector whenever the couplings to the matter fields contain derivatives of the metric.
Read the full abstract

High Energy Physics (Phenomenology)

Learning the Geometry of Collider Events with Metric-Aware Deep Sets

Optimal transport gives structured data a geometry, but exact evaluation is costly in large pairwise analyses that exploit relationships among distances. Learned surrogates are faster, but need not preserve this metric structure. We develop a Deep Sets surrogate for OT between variable-size weighted point clouds that enforces non-negativity, exchange symmetry, and zero self-distance, leaving the triangle inequality unconstrained. Applied to the Energy Mover's Distance between collider events in a particle physics application, the Metric-Aware Particle Flow Network achieves percent-level mean absolute percentage error while significantly improving inference throughput over other exact and approximate methods surveyed. The architectural constraints are found to improve properties that are not explicitly enforced: across $10^6$ held-out event triplets, triangle-inequality violations fall from 199 for a matched unconstrained network to 2, and the maximum from 149.5 to 5.8 GeV. These results demonstrate that targeted inductive biases can yield fast neural surrogates with substantially improved geometric fidelity.
Read the full abstract

All authors Lauren Hay, Rishabh Jain, Matt LeBlanc, Jennifer Roloff

High Energy Physics (Phenomenology)

Probing anomalous $hZ\gamma$ couplings in single Higgs production at future muon colliders

Future multi-TeV muon colliders offer an ideal environment to probe physics beyond the Standard Model (SM) through high-precision measurements. In this work, we investigate the sensitivity to anomalous $hZ\gamma$ couplings within the dimension-six Standard Model Effective Field Theory (SMEFT) framework at $\sqrt{s} = 3\text{ TeV}$ and $10\text{ TeV}$ muon colliders. Focusing on single Higgs boson production—particularly through vector boson fusion—followed by the rare $h \to Z\gamma$ decay channel, we perform a comprehensive simulation using MadGraph5\_aMC@NLO, Pythia, and Delphes for fast detector response. To maximize signal sensitivity, we contrast a traditional cut-and-count methodology with a multi-bin Boosted Decision Tree (BDT) shape analysis, evaluated within a multi-bin $\chi^2$ statistical framework. Our most stringent projections are achieved using the multivariate BDT analysis at $10\text{ TeV}$. Assuming an integrated luminosity of $10\text{ ab}^{-1}$ and a $5\%$ systematic uncertainty, we derive expected $95\%$ confidence level intervals of $c_{HW} \in [-0.005, +0.003]$ and $c_{HB} \in [-0.003, +0.005]$. Notably, the bound on the $c_{\gamma}$ coefficient is slightly tighter due to its larger cross-section enhancement, reaching $c_{\gamma} \in [-0.002, 0.001]$. These results underscore the unique capability of high-energy muon colliders to constrain anomalous Higgs-gauge couplings.
Read the full abstract

Instrumentation and Methods for Astrophysics

Continuous Learning of Gravity Field Irregularities Around Small Bodies via Neural Hamiltonian ODEs

We propose to learn the unknown dynamics in the proximity of a small body directly from tracking data, representing them as a feed-forward neural network embedded in the system Hamiltonian. The equations of motion form a Neural Hamiltonian Ordinary Differential Equation, whose variational equations provide exact training gradients: estimation uses position and velocity arcs at realistic noise levels, without acceleration or potential labels, and a continual learning approach warm-starts the network as new data are acquired. The known part of the Hamiltonian carries whatever is available, from the central term and spin state to the constant-density model of the imaged shape. We assess the method against a normalized spherical harmonics expansion estimated from identical arcs through the same machinery, on scenarios built on the shapes of Itokawa, 67P, Bennu and Eros. The network remains usable inside the Brillouin sphere: it plans ballistic descents at Itokawa to \SI{4.6}{m} median touchdown error from tracking alone, against 5.1–\SI{48.9}{m} for harmonics of degree 4–12, and to \SI{0.9}{m} with the imaged shape as prior, a configuration that also recovers localised density anomalies invisible to any harmonics degree. The two representations are complementary, and we discuss their combined use across the phases of a small-body mission.
Read the full abstract

Data Structures and Algorithms

Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles

For an $n\times n$ matrix over a field of characteristic two, let $\Phi$ denote the sum of the odd permutation monomials. We give a deterministic algorithm that evaluates $\Phi$ and all its first partial derivatives using $O(n^\omega)$ field operations, where $2<\omega\le3$ is any fixed admissible exponent for square matrix multiplication. As an application, we obtain faster randomized algorithms for shortest even directed cycles. Given an $n$-vertex directed graph whose shortest even cycle has length $\ell$, with high probability we compute $\ell$ and the union of the arcs of all shortest even cycles in $\widetilde O(n^\omega\ell)$ time, and find one such cycle in $\widetilde O(n^\omega\ell+n^2\ell^2)$ time. The resulting general bounds are $\widetilde O(n^{\omega+1})$ and $\widetilde O(n^4)$, respectively, improving on the $\widetilde O(n^{\omega+3})$ and $\widetilde O(n^{\omega+4})$ bounds of Björklund, Husfeldt, and Kaski [BHK24].
Read the full abstract

All authors Boxuan Chen, Bin Cui, Hanqing Li, Xupeng Miao, Haoze Wang

Machine Learning

Reinforcement Learning for Syndrome Extraction

A key subtask of quantum error correction is to extract a syndrome that, if nontrivial, signals an error. The number of possible ways to extract a syndrome grows exponentially with the syndrome size, and these implementations vary greatly in fault tolerance, as measured by their logical error rates. This creates a natural search problem: find an implementation with a low logical error rate. Previous work solves this problem but sacrifices either solution quality or scalability. In this paper, we use reinforcement learning and importance sampling to outperform previous work at all scales. Compared with the state of the art automatic scheduling tools AlphaSyndrome and PropHunt, our tool reduces the logical error rate by 25.9% and 71.7% on average, respectively, culminating with a reduction of 97.8% for a surface code with distance 15.
Read the full abstract

General Relativity and Quantum Cosmology

Sultana–Dyer Black Hole Spacetime and $h$-Almost Yamabe Solitons

This paper investigates Yamabe-type soliton structures on the Sultana-Dyer (SD) black-hole spacetime. By employing the explicit metric and curvature quantities associated with the SD spacetime, we demonstrate that the non-Killing vector field $\partial_t$ induces an $h$-almost Yamabe soliton for explicitly determined functions $h$ and $\lambda$. We also establish the condition under which this structure reduces to an almost Yamabe soliton and examine why the coordinate vector fields $\partial_r$ and $\partial_\theta$ do not satisfy the corresponding Yamabe flow conditions. Furthermore, we show that the energy-momentum tensor, consisting of a timelike dust component and a null radiation fluid, is compatible with the Riemann, conformal (Weyl), concircular, conharmonic, and projective curvature structures. This compatibility reveals a strong geometric correspondence between the matter distribution and the causal structure of the spacetime. However, when the time-dependent scalar-curvature profile is subject to the constraints associated with late-stage cosmic expansion, the null, weak, and dominant energy conditions are violated. These findings provide a geometric characterization of the time-dependent Sultana-Dyer spacetime within the framework of generalized Yamabe solitons.
Read the full abstract

Machine Learning

Toward Reliable Railway-Bogie Response Prediction Using Multifidelity TDNN and Physics-Informed Residual Learning

Railway engineers need simulation models that predict vehicle responses across operating scenarios that cannot be tested exhaustively. Agreement with representative measurements provides essential evidence, but calibration at a limited set of conditions does not guarantee accuracy elsewhere. We present a multifidelity railway-bogie response-correction method that treats multibody simulation histories as low-fidelity information and roller-rig measurements as high-fidelity evidence. This method combines an experiment-anchored fidelity assignment with physics-informed discrepancy learning for multichannel bogie-response histories. A time-delay neural network (TDNN) represents the condition-dependent simulation trend, and development-fitted amplitude alignment defines the low-fidelity baseline. A residual-correction network then models the reproducible response component not explained by this baseline and adds it to the baseline. An effective dynamic-balance equation constrains the learned discrepancy by representing differences in inertia, damping, stiffness, and external forcing between the simulated and physical systems. The training objective combines this constraint with residual matching, temporal smoothness, and a combined channel-2 acceleration loss selected using displacement-acceleration consistency evidence. For the evaluated reconstruction case, the corrected response gives a mean coefficient of determination of 0.8197, a mean normalized root-mean-square error (NRMSE) of 4.6055 %, and a mean normalized mean absolute error (NMAE) of 1.9297 %. These results provide initial evidence of accurate response prediction at the held-out 385 km/h condition.
Read the full abstract

All authors Gyeolhee Lee, Moosun Kim, Taewook Kwon, Jaehun Kim, Changsung Jeon, Dongjin Lee

Software Engineering

When Agent Metrics Measure Different Things: An Evidence-Grounded Audit of the Praxa AI Pipeline

Agent evaluations can be numerically correct while measuring a different construct from the one implied by their labels. We present a retrospective measurement audit of selected Praxa AI implementation files, historical evaluation artifacts, and operational records. A 139-case offline routing report contains 112 passes and 27 failures despite zero gating failures, because known gaps are explicitly exempted from the gate. An identifier-free export represents 8,843 tool-attempt rows: 8,395 recorded durations and 448 missing values. Of the durations, 121 equal the signed 32-bit maximum and carry abandoned-client labels; inspected database code clamps elapsed lifecycle age. The pooled recorded 99th percentile is 2,147,483,647 ms, versus 38,118.31 ms among server-observed completed calls. This is a stratum contrast, not a treatment effect. In a documented single-trajectory compaction pilot, the reported follow-up input reduction is 94.39%, but the reduction across the trigger and follow-up calls together is 46.54%. We reproduce the descriptive calculations, verify 91 timing statistics through a separate weighted rational-arithmetic implementation, and execute 13 scoring-function and 12 analysis-verifier tests. Finite-completion bounds show how missing durations limit all-row timing statements without imputing values. The contribution is a source-linked case study and reusable verification package for separating gate policy, lifecycle timing, and request-level accounting from broader agent-performance claims. Historical provider runs and the full current pipeline were not independently reproduced; general capability superiority and population-level statistical significance are not established.
Read the full abstract

Machine Learning

Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks

Self-triggered reinforcement learning control (RL-STC) learns the sparsest control schedule that preserves Lyapunov-decreasing stability under a Run-Time Assurance (RTA) override. We invert this: an adversarial RL agent learns the sparsest jamming or Denial-of-Service (DoS) schedule that destabilizes the closed loop, with a Lyapunov-increase admissibility predicate mirroring the defender's safety certificate. We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary. This extends the DoS-scheduling count-budget analysis from periodic and linear-time-invariant to STC controllers. Empirically, we train against four fixed defenders per plant (one Linear Quadratic Regulator (LQR) and three RL-STC) on Pendulum, CartPole, and Quadrotor2D. The learned adversary is the only adversary that crashes every defender on every plant at $100\%$: greedy misses Quadrotor2D LQR on $42\%$ of episodes and periodic misses Pendulum LQR on $97\%$. On jam-time-per-failure it beats baselines by up to $2.8\times$, and shows its widest absolute margin on Quadrotor2D LQR. Robustness ablations show that Gaussian observation noise exceeding the initial-state magnitude and position-only observation both preserve $100\%$ failure rate and keep the learned adversary strictly ahead of both baselines on jam-time-per-failure.
Read the full abstract

All authors Adam Haroon, Erick J. Rodríguez-Seda, Tristan Schuler, Cody Fleming

Instrumentation and Methods for Astrophysics

A Framework for Evaluating Forward Contamination Risk for Bio-ISRU Microorganisms

NASA planetary protection policy seeks to avoid inadvertent forward contamination of celestial bodies and backward contamination of Earth during space exploration. For Mars missions, it has historically focused on sterilization of landers and rovers. Current policy provides no framework for assessing the forward contamination risk of missions that deliberately include living organisms and must not be sterilized, such as a human crew, agriculture, or biotechnology for manufacturing and life support. We propose the PRIM (Propagation Restricted, Inert on Mars) framework to evaluate the forward-contamination risk posed by known organisms. Building on the biocontainment literature and probability-of-contamination model, PRIM bounds the ability of an organism released from a worst-case off-nominal event to sustain growth on the Martian surface at a probability under P_c <= 10^-4 using independent single-stressor propagation assays. We apply the PRIM framework to two engineered Mars biological in situ resource utilization chassis organisms, using low water activity and carbon starvation to qualify them for low forward contamination risk even at high bioburden, and outline how to extend the assays to phototrophs and anaerobes. PRIM offers a path to flight-qualify living organisms for Mars based on laboratory assays rather than bioburden alone. This enables biological life support infrastructure for a sustained presence on Mars while keeping forward contamination risk demonstrably low.
Read the full abstract

All authors Una Nattermann, Devon A. Stork, Tom Pedersen, Nathan D. Hicks, Jordan E. Mancuso, Keren Isaev, Max G. Schubert, Fatima R. Martin, Jonathan Liu, Harley Greene, Edward Sukarto, Erika A. DeBenedictis

Machine Learning

Certified Safety Curation: Distribution-Free Guarantees for Safe Offline Reinforcement Learning

Safe offline reinforcement learning assumes a cost function on every transition. We ask what remains possible when safety can be judged only by comparing short clips and occasionally asking whether an episode exceeded its budget. Certified safety curation answers with a filter-then-clone pipeline: a state-only value trained from segment comparisons scores whole trajectories, Learn-then-Test calibration certifies a selection threshold under a distribution-free $(\alpha, \delta)$ bound on the unsafe fraction of the selection, and behavior cloning follows. What is certified is the training set, not the policy, whose cost we report rather than bound. Where no threshold attains the target, the procedure refuses. We are not aware of prior work certifying the composition of a training set for offline RL or imitation. Oracle controls justify the design: reweighting individual transitions fails even with an exact value, so the value selects whole trajectories. The policies satisfy the cost budget on twelve of fifteen DSRL tasks, matching a clone of the ground-truth safe subset, which needs a label on every trajectory. Retrained on the certified selection, the strongest full-label method becomes safe where no setting of its own cost target rescues it. Refusal is predictable: the certificate's probability has a closed form in the purity of the pool's top quantile, which the calibration sample estimates and through which the scorer enters.
Read the full abstract

Probability

Linear Response Theory for Jump-Driven Stochastic Systems: Transient Statistics and Escape Dynamics

In this paper, we develop a linear response theory for a class of stochastic differential equations driven by jump processes. We investigate the response of the system to small time-dependent perturbations from three complementary perspectives: probability density functions, mean exit times, and escape probabilities. By performing perturbation analyses of the corresponding forward and backward Kolmogorov equations, we derive the first-order response equations governing these statistical quantities and establish explicit linear response formulas, which characterize the sensitivity of the evolution of the probability distribution and the escape behavior of the system to variations in its coefficients.
Read the full abstract

2609.12013 · 10 Sep · The numerical experiments have not yet been completed, and some parts of the manuscript contain errors, for example, the definition of the stopping time \(\tau_D^{t,x}\) in Theorem 5.3 is incorrect. We will resubmit the manuscript after making the necessary corrections and improvements

Software Engineering

Test-Driven Approaches to Software Engineering with Large Language Models: A Survey of Phases, Tasks, and Agent Skills

Tests increasingly participate in the decisions made by large language models and software engineering agents. They specify intended behavior, guide program construction and repair, select candidates, constrain transformations, and provide execution evidence for software analysis. These uses draw on test-driven development, yet differ substantially in test order, oracle availability, editable artifacts, and the role of execution. We present a structured scoping survey organized around the question of what decision a test changes. The review integrates 87 research and supporting records, with method- or protocol-level extraction for 83 records, alongside a separate collection of five practice resources. We distinguish the Red–Green–Refactor cycle from test-conditioned generation, execution-guided refinement, test-mediated analysis, and evaluation-only testing. We then compare code generation, repair, translation, refactoring, clone detection, code search, localization, training-data construction, and formal-specification validation. A dedicated analysis examines how agent workflows and reusable skills encode testing procedures and how their effects are evaluated. Across these tasks, the evidence supports treating test availability, test validity, feedback use, and evaluation independence as separate properties. Test passing alone does not establish behavioral equivalence, effective feedback, or process adherence; aggregate improvements can also conceal different outcomes across models, tasks, and denominators. We synthesize these distinctions into a mechanism taxonomy, a cross-task comparison, and a protocol-sensitive evidence analysis, and identify research directions in oracle validation, causal evaluation, long-horizon maintenance, and reusable test-driven agent capabilities
Read the full abstract

All authors Yunhao Liang, Chengguang Gan, Ruixuan Ying, Hanjun Wei, Zhe Cui, Shiwen Ni

Machine Learning

QTrans: A Quantum Transformer for Sentiment Classification

In small-scale binary sentiment classification scenarios, factors such as negation, contrastive shifts, and cross-word dependencies lead to the non-linear coupling of sentiment cues, making it difficult for conventional lightweight models to fully capture the contextual relationships between tokens. To address this issue, we propose a model named QTrans, which uses parameterized quantum circuits to construct query, key, and value features and derives attention coefficients from Gaussian distances between quantum measurements. By further integrating a quantum feed-forward neural network, residual connections, and layer normalization, the model establishes an end-to-end trainable quantum-classical hybrid framework for sentiment classification. Experimental results on the MR, CR, and MPQA datasets show that QTrans achieves test accuracies of 72.13%, 69.51%, and 63.45%, respectively, representing improvements of 2.88, 3.17, and 3.79 percentage points over the best-performing classical baselines for each dataset. Overall, QTrans expands the application of parameterized quantum circuits in lightweight sentiment analysis and lays an experimental foundation for further research into quantum multi-head self-attention for modeling textual relationships.
Read the full abstract

All authors Ren-Xin Zhao, Xinjie Huang, Yahong Liu, Maoyu Ye, Jinjing Shi, Shi Wang, Yaonan Wang

Combinatorics

A Proof of the Tratnik-Ye Medianity Conjecture of Resonance Graphs on Surfaces

We prove the Tratnik–Ye conjecture that every connected component of a resonance graph of perfect matchings on a closed surface is median whenever the allowed even faces form a proper subset of all faces. The embedding need not be cellular or strong, and the graph need not be bipartite. We also show that the quotient associated with each face is a tree and that these quotients give an isometric embedding of each component into a Cartesian product of trees. This yields a criterion for the facial parity embedding into a hypercube to be isometric.
Read the full abstract

Software Engineering

Investigating Developer-Reported Software Security Testing Challenges

Software security testing (SST) is essential for identifying vulnerabilities and improving software security, but developers often face practical challenges when selecting tools, configuring test environments, interpreting scanner outputs, testing authentication workflows, and acting on reported vulnerabilities. This study empirically characterizes developer-reported SST challenges in Stack Overflow (SO) discussions and examines their prevalence, difficulty, temporal evolution, co-occurrence, and taxonomy stability. We analyze 17,743 SO questions collected using SST-related keywords. Through manual labeling, we identify 582 SST-related questions and construct a taxonomy of 8 categories and 31 subcategories. We then analyze these challenges using prevalence, difficulty, correlation, temporal trend, co-occurrence, and held-out stability analyses. The results show that developers frequently discuss security finding interpretation and reliability, security testing guidance and tool selection, authentication and authorization testing, and security tool integration and automation. Validation-related challenges often require more technical context and longer resolution time. Security finding interpretation and remediation-related actionability show increasing trends over time. Co-occurrence analysis shows that false positives frequently appear with explainability, while integration challenges often appear with tool suggestions and documentation/resources. Overall, developer-reported SST challenges extend beyond vulnerability detection and include workflow, configuration, interpretation, and remediation concerns. These findings can help researchers, practitioners, educators, and tool providers improve SST usability, documentation, result interpretation, and remediation support.
Read the full abstract

Quantitative Methods

Robust POMDP Framework for Lung Cancer Screening Problems

Lung cancer remains a leading cause of cancer mortality because many cases are diagnosed at advanced stages. Low-dose computed tomography (LDCT) screening can reduce mortality through earlier detection. Partially observable Markov decision process (POMDP) models can personalize screening by maintaining a belief over an individual's latent cancer state. However, cancer-state transition probabilities are often generated from clinical simulations and are subject to estimation error and model misspecification. We propose a robust POMDP framework using $\ell_1$-norm ambiguity sets around the nominal transition probability. The model optimizes screening decisions against the worst-case transition probability while keeping other components fixed at nominal values. Building on the piecewise-linear and convex structure of the robust value function, we adapt point-based value iteration to compute robust screening policies. We evaluate the policies using out-of-sample simulations that perturb selected cancer-progression parameters and compare them with the nominal ENGAGE policy for representative female and male heavy-smoker cohorts at age 50. Robust POMDP policies generally outperform nominal ENGAGE in mean out-of-sample quality-adjusted life-years (QALYs), with the best performance at a moderate ambiguity radius within the tested grid. Clinical analysis shows that the robust policy reduces lung cancer deaths (LCDs) in all evaluated settings for the female cohort and in most settings for the male cohort, with additional false positives (FPs). Screening-schedule analysis shows that the robust policy recommends more LDCT screens and detects more early-stage lung cancers. These findings show that incorporating transition-model uncertainty into data-driven screening models can improve out-of-sample reliability and provide more robust decision support when clinical simulation inputs are misspecified.
Read the full abstract

Exactly Solvable and Integrable Systems

Painlevé Integrability, Hamiltonian Structure and Exact Elliptic Reductions of a Generalized Nonlinear Wave Equation

We study the polynomial generalized Korteweg–de Vries family \[ u_t+P_m(u)u_x+\kappa u_{xxx}=0,\qquad \kappa\neq0, \] where $P_m$ is a real polynomial of degree $m\ge1$. The purpose is not to generate isolated closed-form waves, but to identify the structural threshold at which pole-type Painlevé behavior and elliptic traveling-wave geometry are simultaneously lost. A Weiss–Tabor–Carnevale dominant-balance calculation gives the universal principal exponent $p=-2/m$. Hence only $m=1$ and $m=2$ can possess a principal Laurent branch with integer pole order; their resonance sets are respectively $\{-1,4,6\}$ and $\{-1,3,4\}$. These two sectors are, after affine and Galilean transformations, the KdV and modified KdV equations, so their compatibility conditions and complete-integrability structures are inherited from the classical hierarchies. In contrast, every degree $m\ge3$ has a fractional leading exponent and therefore fails the strong WTC pole criterion at the first step. The results provide a concise bridge between singularity analysis, Hamiltonian form, algebraic-curve genus and exact nonlinear waves.
Read the full abstract

Combinatorics

Fixed-Perimeter Franklin Statistics and an Eventual Inequality

Gray, Payne, Swisher, and Watson conjectured that, for fixed integers $j \geq 0$ and $k \geq 2$, the number $FD_{j,k}(n)$ of partitions of perimeter $n$ having exactly $j$ part sizes of multiplicity at least $k$ is eventually at least the number $FO_{j,k}(n)$ having exactly $j$ distinct occurring part sizes divisible by $k$. We derive bivariate generating functions for both statistics using the profile-word encoding of a partition. For $k \geq 3$, coefficient extraction shows that fixing $j$ changes the order of the dominant pole but not its location. The corresponding dominant singularities are positive real numbers $\rho_k$ and $\sigma_k$, where $\rho_k$ satisfies $\rho_k+\rho_k^2+\cdots+\rho_k^k=1$ and $\sigma_k$ satisfies $\sigma_k^k=(1-\sigma_k)^{k-1}$. We prove that $\rho_k<\sigma_k$ for every $k \geq 3$. Consequently, $FD_{j,k}(n)/FO_{j,k}(n) \to \infty$ as $n \to \infty$, proving the conjecture and yielding a strict eventual inequality for $k \geq 3$. The case $k=2$ recovers the known exact identity.
Read the full abstract

Machine Learning (Statistics)

Learning Interaction Kernels from Collective Steady States

We propose a learning procedure for system identification in interacting particle systems from single-snapshot observations of collective behaviors, unlike existing approaches that rely on observations of trajectories. This setting leads to a fundamentally ill-posed inverse problem, which we solve by using a regularization strategy based on the empirical distribution of observed configurations, drawn from different, unobserved initial conditions. We test our learning procedure on a variety of representative models with steady-state and quasi-stationary patterns, where collective behaviors encode implicit information about the interaction mechanisms, demonstrating that our approach enables stable and accurate recovery of the underlying interaction laws, leading to faithful reproduction of the collective behavior, and in many cases even of the dynamics leading up to it.
Read the full abstract

Cryptography and Security

First Attack, Final Offensive: The Dark Forest on an Open Roster

The Dark Forest argument holds that a civilization that detects another should strike it at once. Existing formal models make the detected civilization the object of the strike and play it on a roster the attacker knows to be complete. This paper changes both choices. The object of hostility is remaining uncontrolled capacity to retaliate or to warn someone who can, and the roster is open: no attacker ever knows it has met everyone. A first strike is then rational only if the timing benefit of what it removes now rather than later is at least the disclosure loss from every survivor that learns of it. A survivor that can bring about the attacker's destruction enters that loss as a lump, not a per-unit rate, and the actors the attacker has never found may be such a survivor, one that no strike removes. Their capacity cannot be estimated, but what they can do is capped at the attacker's destruction, so the test against them asks one answerable question: a first strike is rational only if the attacker accepts that the strike may be its last attack. The Dark Forest premises, read as hypotheses, fix what a general attacker cannot estimate: hidden hunters exist, a hunter that verifies a hostile acts against it with probability at least $q$, and a hider is rarely found, so a believer's first strike is rational only if what it removes is worth a $q$-share of its survival, the whole of it as $q$ approaches one. With survival as the payoff, the profile in which every hunter strikes what it finds is not a Nash equilibrium whenever a strike is more visible to unfound hunters than a hider is findable, while the profile in which every hunter hides is. That visibility comparison is the decisive physical question; an attacker that treats its strike as unseen has assumed the roster closed.
Read the full abstract

Machine Learning

Can We Trust LLM Judges: A Study of Capability-Dependent Biases and Multi-Judge Ensemble for Bias Calibration

LLMs are increasingly used as automated judges for model training and evaluation, yet individual judges exhibit systematic biases that undermine reliability. Much of prior work has studied biases in pairwise LLM-as-a-judge settings; in this paper, we focus on absolute scoring tasks, which mirror more realistic use cases. Across four benchmarks and six models (36 judge-examinee pairs), we show that a model's task accuracy strongly predicts its judging accuracy (Pearson $r \geq 0.90$ on most models) and inversely predicts its directional bias ($r \leq -0.83$), but that accuracy alone does not ensure fair evaluation: more capable examinee models consistently receive more lenient judgments from all judges ($r \geq 0.83$). To address this, we propose calibrated weighted majority voting (WMV), an ensemble evaluation method that aggregates multiple LLM judges weighted by online estimates of their false-positive and false-negative rates. We introduce a disagreement-based estimator that derives these error rates purely from inter-judge agreement patterns, requiring no ground-truth labels or task metadata. In a simulated experiment with shifting task distributions, our label-free WMV tracks an oracle with perfect error-rate knowledge to within 0.5 percentage points on average, outperforming both individual judges and unweighted majority voting. These results demonstrate that principled multi-judge calibration can simultaneously improve accuracy and correct for systematic leniency without requiring labeled data, offering a scalable path to reliable automated evaluation as model capabilities increase.
Read the full abstract

All authors Gemma Zhang, Prachi Badarayani, Asmi Kumar, Sadid Hasan, Sulaiman Vesal

Cryptography and Security

Scan the Skill, Govern the Action: Composing Registry Verdicts with Runtime Consequence Control

Agent skill registries screen what they publish. OpenClaw's security team reported that its scanners overlap on at most 10.4% of combined positives, and 81.9% of flagged skills are caught by one scanner alone. We take that as given, and suggest the open question is not which scanner is right but which is being asked. Each answers a form of "is this skill malicious?", which is what it was built for. "Is this action permitted here, by this operator, right now?" is not one it is designed to express. We report three measurements over 66,192 public ClawHub skill versions. First, 705 skills across 135 distinct publishers that every scanner and the registry's judge rate clean nonetheless instruct an action prohibited by CIS Control 2.7 and NIST SP 800-53 CM-11. A hand audit of 100 puts our detector at 92% precision and found no marker of malicious intent. One publisher contributes 506 of the 705, so we report the distribution with the count. This is reproducible from public artifacts. Second, of 144 commands a live agent executed in a sandbox while following real skill documentation, 34.7% carried a consequence class absent from that document. Third, over 53 cleared skills documenting an action no clean record earns, the agent reached for one in 23 and the gate stopped all 23. The harness and every recorded command are released. We offer one design for that gap: a deterministic resolver with no model in the decision path, feeding a per-(resource, class) trust ledger whose promotion thresholds derive from the operator's stated risk tolerance. Ten clean approvals cannot exclude a true failure rate of 25.9% at 95% confidence. We price the gate's interruptions across a spectrum of operator policies rather than quote one false-positive rate, since friction is a property of the policy, not the gate. We release a 64-case obfuscation benchmark; ours resolves 52%.
Read the full abstract

General Relativity and Quantum Cosmology

Optical effects of one-sided Kiselev-type quintessence in reflection-asymmetric polymer thin-shell wormholes

Strong-field rays that traverse a wormhole can carry optical information about an exterior inaccessible to the observer. We investigate this mechanism in a reflection-asymmetric thin-shell wormhole formed by joining a pure-polymer exterior containing the observer and emitting disk to a polymer geometry with a Kiselev-type anisotropic environment on the opposite side. Equal masses and a common polymer scale, angular geometry, and throat position isolate the effect of one-sided quintessence. We derive the shell-frame optical matching and calculate matched critical scales, null-ray topologies, orbit numbers, transfer functions, and face-on intensity maps for three emission prescriptions. The matching projects the opposite-side photon barrier onto a distinct inner edge of the observer screen, while the outer cosmological-type horizon partitions cross-throat rays into returned and terminal families. Across the admissible parameter grid, increasing the environmental amplitude widens the returned screen interval, increasing the polymer correction contracts it, and changing the environmental exponent produces competing trends. Observer-side orbit numbers and ordinary transfer branches remain invariant under changes confined beyond the throat, providing an exact control, whereas returned branches move and broaden. Once these branches enter the emitting support, they generate additional inner annuli at source-dependent onset strengths. The combined geometric and radiative analysis identifies a controlled cross-throat optical response to one-sided quintessence and shows how environmental information beyond the throat is encoded in matched critical structure and image morphology.
Read the full abstract

Software Engineering

Is Bash All You Need? An Empirical Study of Tool Interfaces for Enterprise Digital Worker Agents

In this study, we examine whether a general shell can outperform specialized tools on enterprise tasks. Shell-based agents have shown strong results in coding, but enterprise work also involves moving between applications and services, coordinating with coworkers, and performing professional analysis. We compare five tool interfaces on TheAgentCompany and APEX-Agents using Opus-4.8 and GPT-5.5: typed tools, typed tools plus bash, bash alone, bash with persistent agent-synthesized tools, and programmatic tool calling (PTC), which runs programs whose actions are restricted to a typed tool catalog. Bash alone outperforms typed tools on both benchmarks, improving score by 21.8-24.5 pp on TheAgentCompany and 4.8-7.4 pp on APEX-Agents while using 19-72% fewer total tokens. Adding typed tools or persistent tool synthesis to bash produces no detectable pooled score gain. PTC uses fewer tokens than direct typed calls with broadly similar task performance, but generally underperforms bash alone in both quality and cost efficiency. For enterprise practitioners, these results favor bash alone when arbitrary execution can be isolated and PTC when security or compliance policies require a fixed tool catalog.
Read the full abstract

All authors Hazel Mak, Susheel Suresh, Sahil Bhatnagar, Barry Wang, Chhaya Methani, Alejandro Gutierrez Munoz

Quantum Physics

Hierarchy of Rényi Coherent Information in Stabilizer Codes

Rényi coherent information, a computable proxy for the von Neumann coherent information, is widely used to study mixed-state phases of matter and decodability transitions in noisy quantum error-correcting codes. However, being a difference of two Rényi entropies, it need not be monotonic in the Rényi index, and lacks the operational meaning of its von Neumann counterpart. Here we address both issues for stabilizer codes. First, for Pauli noise generated by independent Bernoulli events, we prove that the Rényi-$n$ coherent information is nondecreasing in $n \in \mathbb{Z}^+$. This follows from a general theorem: if independent random bits are mapped linearly to a fine label $T$ and a coarse label $C$, then the Rényi entropy difference $H_n(C)-H_n(T)$ is nondecreasing in $n$. For stabilizer codes, $T$ is the joint syndrome–logical class and $C$ is the syndrome, and the difference is the Rényi-$n$ coherent information up to a constant. The same theorem covers classical linear codes and independent detector error models. Second, for arbitrary stochastic Pauli noise, we give the Rényi-$n$ coherent information an operational meaning via postselection on matching syndromes between one data block and $n-1$ auxiliary blocks. We determine when this defines a quantum channel and show that saturation of the Rényi-$n$ coherent information is equivalent to asymptotically perfect recovery of the postselected channel. Moreover, the Rényi-$n$ coherent information also upper-bounds the ordinary coherent information achievable after any syndrome-conditioned recovery.
Read the full abstract