High Energy Physics (Theory)
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 3 September
The problem of the effective excitations of a gauge theory in the nonperturbative regime remains not completely understood. Using the Refined Gribov-Zwanziger (RGZ) theory as effective model for pure gauge Yang-Mills theories, we revisit the quasiparticle (quadratic) excitations of the theory. A novel interpretation of such quasiparticles is proposed, in the case of real mass poles, taking into account the manifest ${\cal PT}-$symmetry of the RGZ Lagrangian.
Statistics Applications
Quantifying Impacts of Wildfire Smoke on Crop Yields in California
Climate change and increasingly severe wildfires pose significant threats to both people and ecosystems, yet little research has focused on the impacts of wildfires on crops. In addition to direct effects such as health risks to agricultural workers and crop damage, there is evidence that smoke may affect crop productivity and quality. This study aims to analyze the effects of wildfire smoke on crop production in Northern California. We quantified the relationship of particulate matter on grape yields using statistical regression models with a wide range of different climate and air quality predictor variables. Our analysis identifies an association between air quality deterioration due to wildfire smoke emissions and reduction in wine grape yields. For two of the three study sites, particulate matter emerged as a significant predictor variable in combination with temperature. Final models for Sonoma and Napa had R2 values of 0.79 and 0.66 respectively, suggesting a shift from climate only-controlled yields to wildfire and climate-controlled yields. This work sets the stage for the next generation of agronomic models that incorporate the growing threat of wildfire on agriculture production systems.
Read the full abstract
Accelerator Physics
HELIX: a hybrid envelope-multiparticle linac code with differentiable space-charge optimization
HELIX (Hybrid Envelope-multiparticle LInac eXplorer) is a Python hadron-linac framework developed at Fermilab for the PIP-II superconducting H- linac. It combines exact-gradient matching through a self-consistent nonlinear particle-in-cell (PIC) space-charge solve with the lattice-card workflow used for machine design. One TraceWin-format lattice drives an rms-envelope solver with 3-D linearized space charge, a multiparticle tracker with a 3-D FFT PIC solve, and linear matrix analysis over one data model, and the constraint cards that steer six classical matching algorithms also steer a differentiable seventh, which re-expresses a fixed-energy subset of the tracking-plus-PIC map as a single PyTorch graph and returns reverse-mode Jacobians exact to floating-point precision at a cost set by the number of constraints rather than of knobs. On a six-quadrupole manufactured verification problem the exact-Jacobian run reaches a tolerance-normalized residual of $3.2\times10^{-10}$, some 200 times below the finite-difference endpoint at the same forward-equivalent budget; the Jacobian cost is flat in the knob count, with the crossover between ten and twelve knobs and reverse mode 1.45 times faster at sixteen. Verification is hierarchical, from analytic envelope references through $10^{-9}$-$10^{-13}$ cross-implementation PIC parity to TraceWin benchmarks on the PIP-II low-energy, medium-energy and accelerating lines: with space charge on, the rms moments along the MEBT and half-wave-resonator line agree within 0.7%, and over the 186-m linac the energy agrees within 0.03% and transmission within the combined statistical uncertainty. HELIX also provides machine-learned field-map surrogates, Pareto exploration, error Monte Carlo with orbit correction, failure compensation, and RFQ transport, with NumPy, C++/OpenMP, CUDA and Metal backends.
Read the full abstract
Statistics Theory
Optimal Stratified Allocation for Rare-Event Onset Forecasting in Dependent Sequences
Let a finite population of n labelled examples carry a class-weighted loss, with pi*n in a rare positive class weighted by N0/N1. We study estimation of total risk from a subsample K << n under designs allocating K0 and K1 draws to the two strata. We derive the exact finite-population variance of the weighted risk estimator under class-conditional sampling without replacement and solve for the optimal allocation. The class multiplier inflates positive-stratum dispersion by the imbalance ratio, causing that ratio to cancel from the optimal allocation and making equal, rather than proportional, allocation the natural default. Simple random sampling is dominated by an explicit between-stratum term; an exact bias identity shows that cluster-representative selection has no general unbiasedness guarantee; and a Serfling bound transfers the allocation result to selection error over a finite candidate set. Under the implemented truncation, the realised allocation ratio is gamma=min(2*pi/f,1), independent of n, yielding the parameter-free efficiency prediction A(pi,f)=gamma/[pi(1-pi)(1+gamma)^2]. A separate measurability result bounds the record occupied by a labelled example, determining the required train-test separation and controlling departure from block independence under absolute regularity. We test these predictions on forecasting the onset of statistically explosive price regimes, dated ex post by the Phillips-Shi-Yu procedure, using 350 U.S. equities from 2004-2011 with under 1% positive rows and five purged forward blocks. The predicted ordering of the four designs holds, and at the 10-day horizon the five design points are ordered exactly as predicted by A (Spearman rho=1, exact p=0.0167). The predicted dependence on pi across horizons does not hold; we identify the channels lying outside the design-based argument.
Read the full abstract
General Relativity and Quantum Cosmology
Screened Scalar Hair and the Weak-Lensing Separation of Black Holes from Neutron Stars in Quadratic $f(R)$ Gravity
Quadratic $f(R)$ gravity carries a massive scalar degree of freedom, the scalaron, whose finite range $\lambda$ screens its influence on the geometry outside a compact object. We show that this screening severs the exterior of a black hole from that of a neutron star of the same mass. Correction to the Schwarzschild metric is Yukawa-suppressed, falling as $e^{-r/\lambda}$ in the coupling, and is thus invisible to any expansion in powers of that coupling; the exterior is moreover intrinsically isotropic, so that inverting the temporal potential alone, as one does for single-potential solutions, fails to solve the field equations. Applying the Gibbons & Werner method of the Gauss-Bonnet theorem to this geometry, we find the leading deflection angle to be exactly the general-relativistic, ($b$: impact parameter), scalaron contributions cancelling identically in the combination that bends light. First correction carries the unfamiliar signature $\lambda^{-1/2}b^{-3/2}e^{-b/\lambda}$, screened beyond the scalaron range and confirmed against direct quadrature to around 20% at $b=4\lambda$, improving to 7% at $b=12\lambda$. What survives is the ingredients that deliver it, namely, non-analyticity in the coupling, the intrinsically isotropic gauge, the closed-form screened correction and the pressure-weighted scalar charge, are obtained within a single, self-consistent derivation here. A static black hole carries no scalar hair, and lenses precisely as general relativity requires; a neutron star acquires a scalar charge weighted by the pressure supporting it against collapse, and does not. Weak lensing therefore closes as a discriminant of the theory, whilst the horizon, as against a material surface, remains one in principle. The observational advantage lies in the strong-field imaging of the photon sphere, and in the stellar interior, where the scalar charge is fixed by the equation of state.
Read the full abstract
Statistical Methodology
On tail-robust autocovariance matrix estimation for high-dimensional and potentially nonstationary time series
In this paper, we study the autocovariance matrix estimation and inference problems under heavy-tailedness, high-dimensionality, general nonlinear temporal dependence, and potentially nonstationarity of time series. We consider two types of tail-robust autocovariance matrix estimation methods: the element-wise Huber's $M$-estimator and a computationally more efficient element-wise truncated estimator. Both estimators are designed to achieve sharp error bounds in matrix max-norm. The nonasymptotic properties of these estimators are proved based on new variants of Bernstein-type inequalities under functional dependence for the potentially nonstationary processes which may be of independent interest. Moreover, we prove a high-dimensional Gaussian approximation result, as a limiting distribution, for our element-wise truncated autocovariance estimator. A Gaussian multiplier bootstrap result is also given to facilitate the practicality. Our theoretical results are nonasymptotic, which gives explicit error bounds in terms of the sample size, dimensionality, moments, and the strength of temporal dependence. Numerical evidence is provided to support our theoretical results. Finally, we illustrate the benefits of the proposed methodology for detecting change points in monthly macroeconomic data.
Read the full abstract
Networking
Tuning Collective Patterns to Alleviate Congestion in Shared AI Clusters
Distributed AI training involves recurring rounds of data exchange between multiple pairs of GPU nodes. Slowdown in even one flow due to congestion can cause the entire communication round to slowdown. Current approaches for evading congestion in AI clusters assume global control over the entire workload (e.g. coordinating the schedule of all jobs) or assume infrastructural support (e.g. adaptive routing in switches). They are thus ill-suited in a shared cloud setting where AI jobs belonging to one user can face external congestion from other users' jobs or background traffic beyond its own control. In this paper, we build a system, REACT, that tunes the recurring pattern of data exchange between GPU nodes (known as communication collectives) in response to congestion. REACT works at the application (communication library) layer, where it detects congestion at runtime using readily available flow stats, and tunes the collective pattern to alleviate congestion - changing the set of incident flows while retaining the semantics of information exchange (e.g. selecting which node aggregates data in an AllReduce tree). REACT requires no explicit support from the underlying network infrastructure and can be unilaterally deployed by individual users in a shared cloud setting. We prototype REACT as a shim layer over NCCL, and evaluate it on a shared academic GPU cluster - enabling REACT improves communication performance (algorithm bandwidth) by 13%-38% under network congestion. Our simulations across a range of congestion scenarios further reveal up to 75% performance improvement, highlighting the effectiveness of our approach.
Read the full abstract
Probability
Absolute moments of the binomial distribution folded at its mean
Let $X\sim Bin(N,p)$ and \(Y=|X-Np|\). We derive an exact reduction for every odd absolute moment of \(Y\), expressing it through finitely many central masses and central tail probabilities. The tail coefficients satisfy a sum rule and are divisible by \(q-p\), so that in the symmetric case the odd ladder collapses to masses alone. We then obtain the complete central-tail expansion at a bounded lattice displacement, with Bernoulli-polynomial coefficients in integer powers of the large parameter. As an application, the first two tail coefficients yield a second-order expansion for the median of the beta distribution, whose formal one-parameter degeneration reproduces the first two terms of Choi's expansion for the gamma median.
Read the full abstract
Machine Learning
REFINE: LLM Refinement over Budgeted Text-Attributed Graphs for Personalized Medical Concept Representation
Learning rich medical concept representations is essential for EHR prediction. Text-attributed knowledge graphs (TKGs) provide a natural foundation by organizing heterogeneous medical relations together with textual semantics. However, most existing encoders process concepts uniformly across patients, despite the fact that a code's meaning and predictive value depend on patient-specific clinical context and trajectory. Learning patient-personalized concept representations from TKGs introduces two key challenges: (1) deciding how much KG context to incorporate for each observed code, and (2) aligning semantic information with the patient-specific relational structure. We propose REFINE, a KG-aware budgeted LLM graph refinement framework for patient-personalized medical concept encoding. Starting from a global TKG, REFINE constructs patient-specific temporal graphs. A sequential reinforcement learning policy selects a personalized KG expansion budget for each observed code. The resulting patient graph is processed by a heterogeneous GNN to capture relation-aware structural dependencies, while a frozen LLM uses graph-aware soft prompts to semantically refine concept representations. Experiments on MIMIC-III and MIMIC-IV show that REFINE consistently improves diverse EHR backbones, outperforms strong baselines, and demonstrates robust gains across component ablation, KG selection, and data insufficiency.
Read the full abstract
Data Structures and Algorithms
An iterative rounding $2$-approximation for Feedback Vertex Set via AI-assisted proof of an extreme point property
We consider the Feedback Vertex Set problem (FVS): the input is an undirected graph $G=(V,E)$ and the goal is to find a minimum-cardinality (or a min-cost in the weighted case) subset $S \subseteq V$ of vertices such that $G-S$ has no cycles. A $2$-approximation via the local-ratio method was developed in the mid 90's by Bafna, Berman and Fujito (1995) and by Becker and Geiger (1996), and this approximation ratio is tight under UGC. The local-ratio algorithms were later interpreted as primal-dual algorithms via an LP relaxation by Chudak, Goemans, Hochbaum, and Williamson (1998). All known $2$-approximation algorithms for FVS have been via local-ratio and primal-dual methods, and in a quest to obtain a new LP rounding algorithm, it was conjectured (Fiorini 2021) that the Strong-Density polyhedron developed by Chudak, Goemans, Hochbaum, and Williamson has an extreme point property: every basic feasible solution to the LP has a variable with value at least $1/2$. We prove this conjecture. We also consider a related Strong-Edge-Density polyhedron and show the same extreme point property. The advantage of this polyhedron is that it admits a polynomial-time separation oracle and also a compact extended formulation. These results lead to polynomial-time iterative rounding $2$-approximation algorithms. The proof of the extreme point property is of independent technical interest and key ideas in the proof were suggested by AI tools.
Read the full abstract
Dynamical Systems
Generalized upper principal part of real planar polynomial vector fields
The goal of this paper is to generalize recent results about the topological classification of the dynamics of a real planar polynomial vector field near infinity. Given a polynomial vector field $X$, using Newton polyhedra one can define its generalized upper principal part $X_{\Gamma}^{U}$. By dropping some monomials of $X_{\Gamma}^{U}$, we define its minimal generalized upper principal part $X_{G}^{U}$. We prove that there exist an open and dense set $\widetilde{\mathfrak{U}}_{1}$ in the set of polynomial vector fields with Newton degenerate upper principal part satisfying the following property: if $X\in\widetilde{\mathfrak{U}}_{1}$, then $X$ and $X_{G}^{U}$ are topologically equivalent near infinity, provided that $X_{G}^{U}$ satisfies some additional non-degeneracy assumptions. Our techniques rely on toric compactification and the Normal Form Theorem.
Read the full abstract
High Energy Physics (Phenomenology)
Cosmological moduli problem ameliorated by decaying WIMPs
We investigate the cosmological moduli problem (CMP) in the context of supersymmetric models where discrete R-symmetries are used to suppress the mu term, and where mu is regenerated via Kim–Nilles superpotential operators. In such theories, a global U(1)_{PQ} emerges as an accidental, approximate symmetry which solves the strong CP problem. R-parity is also generated as accidental but approximate, where RPV operators gain a (f_a/m_P)^n suppression. When n=1, the thermally-produced LSPs may decay before BBN in the early universe, leaving axion-only dark matter of the SUSY DFSZ type. Meanwhile, the dominant cosmological constraint on light stringy moduli previously came from the modulus-induced WIMP overproduction problem. WIMP overproduction is now ameliorated by the RPV WIMP decays, but the moduli-induced BBN bound may be exacerbated by convolving long-lived modulus decay with long-lived RPV WIMP decay: long-lived particle (LLP) cascade decays. In this context, moduli as light as m_\phi ~ 130 TeV may be allowed which can reconcile naturalness with the presence of stringy moduli in the early universe.
Read the full abstract
Robotics
AquaBEV: Monocular Underwater BEV Occupancy with 3D Sonar Supervision
Autonomous underwater robots are widely used for exploration, monitoring, and inspection, where safe navigation depends on understanding the surrounding free and occupied space. Bird's eye view (BEV) occupancy provides such a representation, but predicting it from a single underwater RGB image is difficult due to limited, unreliable geometric cues from appearance alone. 3D imaging sonar offers complementary geometric measurements to supervise this task. We introduce AquaBEV, a monocular underwater occupancy model that predicts local BEV occupancy from a single RGB image, using paired 3D imaging sonar as geometric supervision during training. AquaBEV maps visual features into a calibration free polar representation and applies causal decoding along the range dimension before reconstructing the prediction in Cartesian BEV coordinates. A controlled underwater occupancy benchmark was established, adapting representative occupancy methods to the same RGB to sonar task under a unified protocol. AquaBEV achieves 31.4 Visible IoU and 38.6 Observed IoU, 4.0% and 4.3% relative improvements over the strongest transferred baseline.
Read the full abstract
Cryptography and Security
Engineered Persuasion: Evaluating Personalized Pretexts in LLM-Generated Spear Phishing
Large language models can insert workplace details into phishing pretexts at low cost, but those details may either support or undermine a message's credibility. We recruited 180 U.S. working adults to evaluate simulated, AI-generated phishing emails in a disclosed survey. The emails used four cumulative levels of information: workplace (Level 1); recipient name and job title; job responsibilities; and coworker/shared-project context (Level 4). Participants rated each message's convincingness from 0 to 100, chose one stated action (open the link, investigate, delete, or report), and explained why their highest- and lowest-rated messages stood out. Across 1,436 valid evaluations, convincingness increased by 2.40 points per personalization level in a sensitivity analysis, while the odds of expressing click intention increased by 28% per level. Among participants who did not express an intention to click, investigation remained common, reporting declined, and deletion increased. A post-hoc descriptive analysis found higher ratings and click intention for messages from a named person who referenced a supplied coworker than for messages from a department or entity. Qualitative coding showed why added detail could help or hurt: details that matched participants' roles and routines supported credibility, while incorrect, vague, or channel-inappropriate details raised suspicion. Together, the results highlight that personalization is not simply a matter of adding more details: it depends on whether the pretext fits the recipient's work context. We discuss how this distinction can inform workplace cybersecurity training.
Read the full abstract
Computation and Language
A Systematic Evaluation of Cross-Lingual Consistency Enhancement Methods in Multilingual Language Models
Multilingual language models often produce inconsistent answers to semantically equivalent questions across languages, motivating methods to improve cross-lingual consistency (CLC). However, existing methods are typically evaluated using different models, tasks, and protocols, leaving their relative strengths unclear. In this work, we present a unified evaluation of representative CLC-enhancement methods for question answering, spanning inference-time interventions and post-training approaches across three model families and three closed-form benchmarks. The results show that post-training methods are generally more reliable, with direct distribution alignment consistently improving CLC across all model-dataset combinations, while other methods are more sensitive to answer format and the breadth of language coverage. Notably, cross-domain transfer is limited unless source and target tasks share similar output formats. We further investigate whether CLC enhancement hurts models' ability to respond differently *when needed*, that is, when asked culture-dependent questions. Across two benchmarks of culturally diverse question answering, we find no systematic degradation in controlled closed-form evaluation, whereas open-ended generation reveals occasional accuracy reductions, particularly for non-English responses. Our work highlights the need to evaluate CLC enhancement for both cross-domain robustness and culturally appropriate variation, informing future work in post-training and benchmark development.
Read the full abstract
Quantum Physics
Thermal lifetime of the centralized repetition code: From quantum annealing to social dynamics
There is an extensive body of research probing the potential of adiabatic quantum computation and quantum annealing to solve hard computational problems. This research endeavor is complicated by noise afflicting hardware during the computational process. An error-correcting approach called quantum annealing correction (QAC) was suggested to mitigate this noise. The QAC approach employs a centralized version of the repetition code in which the qubits are configured in a star-graph pattern with one special qubit playing the role of the hub. In this paper, we explore the thermal physics of the centralized repetition code, using a Lindblad equation framework to analyze its lifetime when coupled to a thermal bath. We show that its centralized configuration leads to thermal stability, enabling the robust storage of a logical bit of information, despite the fact that there is only 1 ferromagnetic Ising interaction per qubit like a 1-dimensional Ising chain.
Read the full abstract
Machine Learning
Disentangling Attention in Deep Operator Learning: A Controlled Study of Data-Driven and Physics-Informed Architectures
Deep neural operators learn mappings between input functions and complete PDE solution fields, enabling forward evaluations of new problem instances orders of magnitude faster than conventional numerical solvers. Attention mechanisms have recently been introduced into neural operators, but most studies change several architectural components at once, making it difficult to identify what actually improves accuracy. This work presents a controlled and systematic study of five deep operator network (DeepONet) variants with distinct attention mechanisms, trained under both data-driven and physics-informed regimes, to isolate the effects of cross-attention, self-attention, tokenization, and attention depth. We evaluate them on a source-driven transient one-dimensional nonlinear diffusion-reaction equation, a transient one-dimensional viscous Burgers equation with variable initial conditions, and a two-dimensional Poisson heat-conduction problem with heterogeneous source fields. Per-sensor tokenization with cross-attention reduces the mean relative L_2 error of the classical DeepONet in all benchmark-training combinations by factors of 2.4-28.0, while the best attention configurations reach 3.5-32.3. Branch self-attention paired only with dot-product fusion is inconsistent, degrading the one-dimensional problems while helping the more complex two-dimensional source field; added on top of cross-attention it improves all six cases, though by less than cross-attention fusion alone. Global pre-mixing provides no consistent benefit. Increasing cross-attention depth further improves accuracy, but with diminishing returns and a substantially higher cost under physics-informed training. Overall, query-dependent cross-attention is the most reliable mechanism, whereas branch self-attention is most useful for large, spatially complex functional inputs.
Read the full abstract
Networking
Network Availability Enhancement in Low-Altitude HetNets: A Cross-Layer Design Perspective
This paper proposes a computing-communication resource interchange method to enhance network availability (NA) in low-altitude heterogeneous networks (LA-HetNets). In these networks, communication resource conflicts and imbalances, caused by extreme heterogeneity (diverse mobility, mixed delays, and hybrid transmission), and cross-regional traffic, reduce reliability and lead to unavailability. Restoring NA requires additional communication resources, yet dynamic cross-regional scheduling is limited, making locally redundant computing resources an alternative to reduce communication resource overhead. While computing resources address medium access control (MAC)-layer unreliability, physical (PHY)-layer functionalities still rely on communication resources. Thus, it remains unclear whether increasing computing resources alone can achieve target NA, especially under greater heterogeneity. We elaborate on the impact of heterogeneity on NA and show that expanding computing resources alone cannot meet target NA under high heterogeneity, as NA degrades sharply due to increased communication capability demands. To overcome this, we propose a cross-layer optimization method enabling computing-communication resource interchange to address both MAC- and PHY-layer unreliability. By reducing processing delays with computing resources while ensuring MAC-layer reliability, our method extends PHY-layer transmission delay and expands communication resources. Simulations demonstrate our approach's superiority in achieving target NA under greater heterogeneity, revealing that computing-communication resource interchange fulfills expanding communication capability demands more effectively than conventional resource overhead reduction.
Read the full abstract
Spectral Theory
Uniform Eigenfunction Observability under Mixed Reflection Monodromy
We study uniform observability for Laplace eigenfunctions with mixed boundary conditions whose reflection signs do not define a scalar character. For the DDN/NND sectors of the equilateral rhombus, the resulting $\mathbb Z_2$ monodromy is resolved by a degree-two branched arithmetic translation surface of genus two. On an explicit class of admissible open sets, every exact mixed-sector eigenfunction satisfies a local $L^2$ lower bound uniform in the eigenvalue, multiplicity, and choice within the eigenspace. The proof combines exact unfolding, semiclassical defect measures, and the Veech dichotomy to exclude concentration near the saddle/conic network and inside periodic cylinders. We also obtain a reflection-overlap observability result for the full rhombus and isolate the remaining saddle-network obstruction for arbitrary open observation sets.
Read the full abstract
Computation and Language
The Anatomy of an ASR Hallucination
ASR systems sometimes produce fluent text that is unrelated to the speech they receive. We view these hallucinations as one possible consequence of a broader grounding failure, in which the transcript is no longer adequately guided by the audio. To understand where this failure becomes possible, we study two independently trained Conformer-Large recognizers - one CTC and one RNN-T - under environmental degradation and speaker-background shift. In both models, the final encoder stage emerges as a critical boundary: bypassing the final block causes divergence on nearly every utterance, whereas bypassing middle blocks has little effect. At this same stage, the representations become more compact, text becomes readable by the trained decoder, and grapheme information becomes explicit. Importantly, the intervention produces garbled or repetitive output rather than fluent fabrication. Our result therefore identifies a mechanistic precondition for hallucination - the failure to produce adequately grounded output - not the complete origin of naturally occurring hallucinations. Together, the results reveal a consistent terminal-stage dependency for grounded recognition across two decoder families and multiple distribution shifts.
Read the full abstract
Optics
Ultrafast Control of Lifetime in High Q Anisotropic Plasmon Polaritons
Losses are a major roadblock in the technological implementation of surface plasmons at optical frequencies. The recent emergence of MoOCl2, a correlated van-der-Waals material with strongly anisotropic optical properties, offers new avenues to circumvent this limit. We report the far-field observation of high-Q surface plasmon polaritons in this material, arising from the anisotropic hybridisation of surface plasmons and dielectric modes. We then explore nonlinear pumping of intraband electrons to the conduction band in these structures, leading, contrary to intuition, to an abrupt increase in the lifetime of the polariton resonance, despite the injection of hot electrons. This counterintuitive phenomenon stems from the competition between photon and plasmon excitations in a lenticular polariton resonance, yielding a largely tuneable lifetime at ultrafast speeds.
Read the full abstract
High Energy Physics (Experiment)
Search for the rare Higgs boson decay H $\to$ Z$\gamma$ in proton-proton collisions at $\sqrt{s}$ = 13 and 13.6 TeV
A search is presented for the rare, loop-induced Higgs boson decay H $\to$ Z$\gamma$, where Z $\to$ $\ell^+\ell^-$ and $\ell$ = e or $\mu$. The search is performed using a sample of proton-proton (pp) collision data at the center-of-mass energies of 13 and 13.6 TeV, recorded by the CMS experiment at the LHC and corresponding to a total integrated luminosity of 200 fb$^{-1}$. The analysis design separately considers and optimizes sensitivity to Higgs boson production via gluon-gluon fusion, vector boson fusion, and associated-production processes. The signal is extracted from a simultaneous fit to the invariant mass distributions of the $\ell^+\ell^-\gamma$ system in the various production channels and event categories. The observed (expected) signal strength $\mu$, defined as the ratio of the measured product the of cross section and decay branching fraction value $\sigma$(pp $\to$ H)$\mathcal{B}$(H $\to$ Z$\gamma$) to the corresponding value predicted in the standard model, is found to be $\mu$ = 1.10$^{+0.52}_{-0.61}$ (1.00$^{+0.49}_{-0.46}$) for a Higgs boson mass of 125.38 GeV. The signal has an observed (expected) significance of 1.9 (2.3) standard deviations.
Read the full abstract
Optimization and Control
Multivariable Extremum Seeking for Locally Lipschitz Objectives
Classical extremum seeking (ES) is commonly interpreted as approximating gradient descent, but this interpretation is less clear for nonsmooth objectives in the continuous-time multivariable setting. We propose a minimal modification of the classical multivariable perturbation–demodulation architecture: rationally independent perturbation frequencies and matched demodulation signals. For any locally Lipschitz static objective, the Kronecker–Weyl theorem shows that, at every fixed perturbation amplitude, the long-time averaged dynamics are exactly the negative gradient of a kernel-smoothed objective. Because rationally independent frequencies render the perturbation and demodulation signals nonperiodic, we employ general averaging theory rather than periodic averaging theory. If the gradient flow of the smoothed objective is globally uniformly asymptotically stable, then the ES dynamics are practically globally uniformly asymptotically stable. We also derive a general matching condition relating the perturbation occupation density, demodulation signal, and smoothing kernel, yielding a family of alternative designs. Numerical examples include a nonsmooth objective function, which may be interpreted as the penalty function of a nonlinear program, and the Rastrigin function, for which smoothing eliminates all undesired local minima.
Read the full abstract
Statistics Applications
One-Shot Screening of Simulated Systems for Acceptability
We introduce a general-purpose framework for designing screening procedures for problems featuring a finite set of simulated systems, a.k.a. ranking-and-selection problems. The framework offers a novel perspective on screening in which decisions to retain or eliminate systems are based on confidence regions for the unknown problem instance rather than comparisons of estimated performances. Specifically, a system is retained if it has acceptable performance under some plausible configuration of response vectors contained in the confidence region. This perspective facilitates the design of procedures that guarantee to return either all acceptable systems, or each acceptable system, with high probability and accommodates many well-studied definitions of acceptability, including feasibility with respect to stochastic constraints and optimality with respect to one or more objectives. We further study a subclass of the framework that yields simple and computationally efficient screening procedures that often have lower-order time complexity than existing methods and naturally supports parallelization without loss of screening power. We demonstrate the effectiveness and efficiency of the procedures through numerical experiments.
Read the full abstract
Soft Condensed Matter
Composition-dependent nonlinear viscoelastic-viscoplastic behavior and constitutive framework for digitally mixed polymers spanning the glass transition
Multi-material PolyJet printing produces voxel-scale digital mixtures of an elastomeric photopolymer (Agilus) and a glassy photopolymer (Vero), giving a material family whose room-temperature response ranges from elastomeric to glassy; a unified description spanning the family has remained challenging. Large-deformation uniaxial compression over nearly three orders of magnitude in strain rate reveals a nonlinear, rate-dependent load-unload response that evolves continuously with composition, from recoverable elastomeric hysteresis to glassy yield with post-yield softening, hardening, and substantial residual strain. Dynamic mechanical analysis (DMA) shows that each mixture has a single glass transition temperature ($T_g$) that shifts to higher temperature with both Vero fraction and frequency, so composition acts much as temperature or loading rate does. This time-composition equivalence motivates one constitutive structure for the whole family rather than a separate property set per mixture: an equilibrium hyperelastic network with three non-equilibrium, rate-dependent branches carrying reptational, intermolecular, and glassy resistance. Its properties are anchored at the two endpoints and interpolated by smooth composition scaling laws. The model captures the compression response of all seven calibrated compositions and predicts a withheld mixture from the scaling laws alone. Resolving the predicted stress into its branches shows the load passing from the elastomeric to the glassy mechanism, and the work from elastic storage to dissipation, as Vero content and rate rise. The glass transition that DMA maps at small strain therefore governs the large-strain deformation mechanisms. The framework gives a compact, physically based description of digitally mixed polymers and a predictive basis for designing functionally graded, architected multi-material structures.
Read the full abstract
Systems and Control
Grid-Mode-Aware Model Predictive Control of Hybrid Energy Storage Systems for AI Data Center Power Smoothing
To facilitate the grid-friendly integration of highly variable AI data center loads, this paper proposes a grid-mode-aware model predictive control (G-MPC) framework for managing a hybrid energy storage system (HESS) to smooth grid-side power demand. The framework optimally coordinates a battery energy storage system (BESS) and a supercapacitor (SC) by solving a multi-step optimization problem in a receding-horizon manner. In particular, band-pass filter dynamics are directly embedded in the G-MPC formulation to extract and suppress grid-side power components associated with vulnerable grid oscillatory modes, thus mitigating load-induced grid oscillations. The resulting G-MPC optimization jointly minimizes violations of grid-side power-envelope, ramp-rate, and modal-power requirements and the degradation and power-ramping costs of the BESS and SC, while satisfying power limits, state-of-charge limits, and other operational constraints. To enable real-time implementation, a fix-and-re-optimize algorithm is developed to solve each G-MPC problem efficiently while preventing simultaneous charging and discharging. Extensive simulations demonstrate the effectiveness, flexibility, and computational efficiency of the proposed framework. The results also highlight the importance of explicitly suppressing power components associated with vulnerable grid modes, rather than merely reducing overall load variations, to effectively mitigate grid oscillations.
Read the full abstract
Materials Science
Accelerating Atom Simulations with Variable-Block Sparse Matrix Library
Modern atomistic simulations increasingly employ localized orbitals to represent quantum operators, yielding sparse block matrices whose block shapes vary with chemical species and basis choice. Conventional scalar sparse formats store the entries of each block individually, obscuring this local structure and limiting the use of efficient block algorithms. We present VBCSR, a distributed sparse matrix library that preserves variable-size atomic blocks and accelerates the core linear algebra of large-scale atomistic simulations. A unified interface automatically maps scalar, uniform-basis, and multispecies operators to compressed sparse row (CSR), block sparse row (BSR), or variable-block compressed sparse row (VBCSR). Our advanced acceleration method groups blocks of equal shape and dispatches them to optimized dense kernels. In the reported benchmarks, VBCSR outperforms the tested Python-accessible reference implementations for several block-sparse benchmarks. We further demonstrate VBCSR in an InP nanoparticle application containing more than \(10^6\) atoms.
Read the full abstract
Game Theory
A Numerical Approach to the Realizability Problems for Memoryless Nash and Epsilon Equilibria in Concurrent Multiplayer Reachability Games
The existence of equilibria, which is called the realizability problem in the formal methods community, for probabilistic undiscounted state-based systems has proven to be an incredibly challenging research setting. In this paper, we consider a restricted version of the classic realizability problem by focusing on equilibria that are both memoryless and numerically constrained. While the restriction to memoryless strategies is relatively common in the literature, numerical constraints, to the best of our knowledge, represent a new and powerful approach. First, we consider the existence of memoryless equilibria when all numbers involved must be rational numbers of a pre-defined limited size. Then, we extend this analysis to field extensions of the rational numbers created through radical algebraic generators. When the basis is provided for the latter, both realizability problems are NP-complete for both exact and epsilon Nash equilibria. Finally, we consider an unconstrained numerical setting. While the characterization of the exact Nash equilibria realizability problem as ETR-complete is one of the most celebrated results in the literature, we demonstrate that the constructions underlying this result are flawed as presented. We then mend said constructions to preserve the ETR upper bound, and note that the lower bound in the literature does not apply to the epsilon-equilibrium setting. Overall, this paper demonstrates an interesting relationship between the complexity of the realizability problem and the "complexity" of the numbers involved in the representations of strategies.
Read the full abstract
High Energy Physics (Phenomenology)
$Z$-plus-jet Production with JETHAD-DYnamis: Angular Structure, Polarization, Fixed-Order Matching
Recent NLO analyses of inclusive Higgs production indicate that high-energy resummation corrections can reach the 10% level, highlighting the growing impact of high-energy QCD dynamics on electroweak observables from LHC to FCC energies. We extend this precision program to Drell-Yan plus jet production by deriving high-energy-resummed predictions for rapidity and transverse-momentum distributions of electroweak bosons. Fixed-order NLO accuracy is consistently combined with next-to-leading energy-logarithmic resummation (NLL/NLO). We outline a JETHAD-DYnamis-POWHEG matching strategy that retains polarization and angular correlations while enabling realistic lepton-level kinematics. This setup provides the first high-energy-resummed description of rapidity-separated electroweak-boson plus jet final states. The resulting framework offers a precision-oriented description of Drell-Yan observables for present LHC measurements and the High-Luminosity LHC, where percent-level theoretical control will become increasingly important.
Read the full abstract
Game Theory
Game-Theoretic Drone Swarm Defense: A Case Study in Applied Differential Game Theory
This technical report is a study of the use of differential game (DG) theory to solve the target-assignment and midcourse guidance problems of drone swarms tasked with intercepting opposing swarms in defense of high-value assets. The game-theoretic tactics—which treat the intruder swarm as a rational agent and seek a Nash equilibrium between defenders and intruders—are compared against baseline tactics that model the defense problem as a unilateral optimization of the defenders' maneuvers. Monte Carlo simulation and Bayesian analysis show that the game-theoretic approach has a higher probability of successfully intercepting all intruders than the baseline techniques. This improvement in successful defense probability is most pronounced when the intruder swarm is capable of evasive maneuvers: relative to baseline optimization tactics, differential-game tactics increase estimated defense success from 94.6% to 96.8%, closing approximately 41% of the remaining gap to perfect defense. To add statistical credibility to this result, a paired-trial Bayesian analysis assigns a 99.9% posterior probability that differential-game tactics have a higher probability of successful asset defense than baseline tactics in this scenario.