High Energy Physics (Phenomenology)
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 2 September
We present predictions for the collinear energy-energy correlator (EEC) measured inside $Z$-tagged jets in proton-proton collisions across the confinement transition. Our framework combines transverse-momentum-dependent factorization for back-to-back $Z+$jet production with an exclusive differential EEC jet function incorporating perturbative evolution and flavor-dependent non-perturbative fragmentation. The EEC jet function is evaluated at $\mathrm{NLL}^{\prime}$ accuracy, with separate quark and gluon non-perturbative scales constrained by existing $e^+e^-$ and inclusive-jet data. We provide predictions for forward $Z+$jet production at $\sqrt{s}=8~\mathrm{TeV}$ and $13~\mathrm{TeV}$ in the jet transverse-momentum intervals $(20, 30)$, $(30, 50)$ and $(50, 100) \, \mathrm{GeV}$. The EEC distributions as functions of $z_\chi$ exhibit finite plateaus at small $z_\chi$, while the corresponding angular distributions display the characteristic turnover associated with the confinement transition. A flavor decomposition shows that this transition becomes increasingly dominated by quark-initiated jets as the jet transverse momentum increases. Forward $Z$-tagged jets therefore provide a clean probe of non-perturbative quark fragmentation and offer a direct test of whether the characteristic confinement scale extracted from $e^+e^-$ collisions remains universal in a hadronic environment.
High Energy Physics (Theory)
The trans-Planckian problem and gravitational interactions
The strong gravitational interaction of counter-propagating quantum field modes is of foundational importance to the trans-Planckian problem of black hole horizons. This article, in memory of Renaud Parentani, is primarily an exposition of Renaud's attempt, using perturbation theory, a large $N$ approximation, and spherical reduction, to capture a mechanism by which those interactions might quench the trans-Planckian near-horizon quantum field correlations. Before giving a detailed account of Renaud's calculation, the trans-Planckian problem is briefly introduced, and the paper concludes with a discussion of related issues and questions.
Read the full abstract
Functional Analysis
Variants of order semicontinuity in Banach lattices
In this article we consider various properties of a normed lattice, which are similar to semicontinuity (also known as the Fatou property), establish relations between these properties, and discuss stability of these properties under renorming. In particular, we show that a normed lattice $F$ is order continuous iff every renorming of $F$ is semicontinuous. We also prove that the weakly Fatou (we propose the term “demicontinuous”) normed lattices are precisely the ones isomorphic to regular sublattices of monotonically complete Banach lattices. In order to do so we introduce the concept of the Lorentz completion of a demicontinuous normed lattice, which is somewhat analogous to the universal completion from the vector lattice theory. Furthermore, we unify and simplify the proofs of the characterizations of monotone completeness from \cite{aw} and \cite{taylor} and provide their quantitative versions. The semicontinuity-related properties in AM-spaces have some additional features. While the classical Kakutani theorem states that AM-spaces are precisely the closed sublattices of $\Co\left(K\right)$-spaces, we show, using two different methods, that the semicontinuous AM-spaces are precisely the closed regular sublattices of $\Co\left(K\right)$-spaces. Finally, we prove that for a normed space $E$, the AM-space of positively homogeneous weak* continuous functions on $\Ba_{E^{*}}$ is semicontinuous iff it is a regular sublattice of $\Co\left(\Ba_{E^{*}},\mathrm{w}^{*}\right)$ iff $\dim E<\8$.
Read the full abstract
Machine Learning
Learnable composition for neural operators
Neural operators are fast, differentiable surrogates for physical simulation, but their accuracy often degrades when domain geometry, size, or operating conditions differ from training. Supervised adaptation can recover accuracy, but even a small target set requires costly high-fidelity simulations. We therefore ask how pretraining and transfer can be designed together to reduce this deployment cost. LatentDDM first pretrains a neural operator to predict fields on small subdomains. For a new setting, it freezes this operator and trains only a lightweight module that composes the local predictions. We evaluate our method on two complementary problems: steady Darcy flow, where long-range pressure coupling must extend across increasingly large porous domains, and unsteady incompressible flow around a pitching airfoil, where rollout errors compound as target pitching frequencies exceed the training range. Compared with the capacity-matched models that process the full domain at once, LatentDDM's error is 36-56% lower on larger Darcy domains after adaptation with 16 target simulations. It also improves 20-step field rollouts in fast-pitching airfoil flow, both zero-shot and after few-shot calibration. These results identify the co-designed local pretraining and composition-level transfer as a promising design principle for physical foundation models.
Read the full abstract
Numerical Analysis
Dimensional hyperreduction of nonlinear finite element models via empirical cubature with manifold-adaptive weights
Nonlinear-manifold reduced-order models for parametrized finite element problems can achieve substantial compression both in the number of generalized (latent) coordinates and, through sampling-and-weighting hyperreduction, in the number of sampled elements/integration points. Yet current sampling-and-weighting approaches employ weights that remain fixed over the solution manifold. We contend that this restriction leaves hyperreduction potential untapped: allowing the weights to vary continuously and nonlinearly with the latent coordinates can further decrease the number of sampled spatial entities. To exploit this possibility, we propose the Manifold-Adaptive-Weight Empirical Cubature Method (MAW-ECM). Starting from a feasible fixed-weight ECM rule, a greedy pruning strategy removes sampled entities through convex quadratic weight-redistribution problems enforcing local conditions and positivity. The method is assessed on two nonlinear benchmarks: homogenization of a metamaterial unit cell exhibiting negative incremental stiffness, and a history-dependent continuum-damage problem. In both cases, the nonlinear manifold is constructed from an initial linear compression followed by an input-informed identification of the latent coordinates as general linear combinations of the retained modal amplitudes, incorporating graph information when relevant to seek the intrinsic dimensionality of the solution manifold. We show that combining the nonlinear-manifold representation with MAW-ECM reduces the number of sampled integration points by more than two orders of magnitude relative to the corresponding standard linear reduced model. Relative to the fixed-weight manifold models alone, the adaptive weights eliminate approximately 80% of the remaining points in the homogenization benchmark and more than 97% in the damage benchmark, while essentially preserving their accuracy.
Read the full abstract
Robotics
GPU-Accelerated Astrodynamics World Models for Spacecraft Rendezvous and Proximity Operations
World models are an emerging paradigm in representation learning in which an agent jointly learns state-action dynamics and observation models from offline trajectory data, enabling multi-step planning and trajectory prediction with uncertainty estimates. They have shown strong results in robotics and game environments, but, to the best of our knowledge, have not previously been applied to the space domain. This paper introduces a world model-based approach to cooperative and non-cooperative spacecraft rendezvous and proximity operations. First, we introduce an open-source, JAX-based International Space Station (ISS) docking environment supporting parallel GPU simulation of spacecraft orbit and attitude dynamics, generating the thousands of state-action transitions that world model training requires. Second, we introduce Out-of-this-World-Model, a transformer-based world model that encodes relative kinematic states and body-fixed camera imagery into a latent state and predicts its evolution under commanded thrusts and torques using one-step flow matching. It produces a distribution over future observations, capturing stochastic dynamics and per-timestep uncertainty, and outperforms DreamerV3-style posterior-correction baselines with fewer trainable parameters and hyperparameters. Third, we apply the approach to a capsule autonomously docking with the ISS under keep-out-zone constraints, demonstrating improved sample efficiency and task performance over reinforcement learning baselines (53% versus 29% docking success across ports), better out-of-distribution generalization (on held-out ports the world model more than doubles baseline success, 40% versus 17%), and detection of anomalous objects encountered during approach with 98% classification accuracy. We open-source the simulation environment and model architecture to enable further study of this paradigm.
Read the full abstract
Systems and Control
Dynamic Operational Reserve Margin Assessment from Risk-Constrained Unit Commitment States
We propose Dynamic Reserve Margin (DRM) as a time-varying operational adequacy metric derived from risk-constrained unit commitment (RCUC) states. DRM quantifies reserve adequacy using the additional generation capacity that committed generators can provide within a 5-minute response window relative to uncertainty and contingency reserve requirements. We introduce a complementary Reserve Risk Envelope (RRE) metric to quantify operational reserve headroom in directly interpretable MW terms. A low-margin duration metric is further developed to quantify the persistence of reserve stress over an operating horizon. We use an IEEE 14-bus example to illustrate these concepts, followed by large-scale RCUC case studies under multiple operating scenarios. Results demonstrate that reserve requirements and ramp-accessible reserve capability can vary substantially across operating conditions, and that commitment decisions adapt to maintain reserve adequacy under changing system conditions. The proposed DRM and RRE metrics provide an interpretable operational characterization of reserve adequacy, reveal reserve accessibility and stress persistence that are not captured by conventional reserve margin metrics.
Read the full abstract
Quantum Physics
Distinctness threshold for pseudorandom unitaries
Pseudorandomness is increasingly recognized as a key property of ensembles in quantum information theory, statistical mechanics, and quantum many-body physics. Yet it appears in two conceptually different forms: statistical pseudorandomness, embodied by unitary designs, and computational pseudorandomness captured by pseudorandom unitaries (PRUs). The relationship between these two forms of pseudorandomness remains surprisingly poorly understood. Existing PRU constructions reveal this interplay where a statistically randomizing ingredient, a unitary design, is combined with classical cryptographic primitives to produce computational pseudorandomness. We show that statistical pseudorandomness is not necessary for computationally pseudorandom unitaries. We do this by replacing the unitary $2$-design layer in the existing constructions with ensembles that are not even state $1$-designs, yet are sufficiently distinct, a property we identify to be necessary for any PRU. This yields new non-adaptively secure PRU ensembles whose computational pseudorandomness is obtained without an underlying statistically pseudorandom quantum ensemble, such as a $2$-design. We characterize distinctness via an entangled analogue of anticoncentration and use it to show that distinctness already captures constraints on coherence and imaginarity of PRUs, while identifying broad classes of inputs for which the latter obstruction disappears, enabling real-valued PRUs even for certain (maximally) entangled states. As an application, we use lack of distinctness to constrain the conjectured pseudorandomness of the random phase-Hadamard ensemble to form a PRU.
Read the full abstract
Cryptography and Security
Differentially private federated learning with Byzantine-robust aggregation: A cross-domain framework for secure model training in banking and healthcare systems
Federated learning allows banks, hospitals, and other regulated organizations to train a shared model without moving raw records off their own servers, which is attractive wherever data protection law or competitive sensitivity rules out pooling data centrally. Two problems limit how far this promise can be trusted in practice. First, the parameter updates that clients exchange still leak information about local records through gradient inversion and membership inference attacks. Second, an honest averaging rule such as FedAvg has no defense against a subset of clients that submit corrupted or adversarial updates, so a small number of malicious or compromised participants can quietly steer the shared model off course. This paper presents a federated learning framework, DP-BR-FedAvg, that combines a Gaussian-mechanism differential privacy layer with a coordinate-wise trimmed-mean Byzantine-robust aggregation rule, evaluated on a simulated cross-institutional classification task resembling fraud and clinical-risk scoring. Across sixty communication rounds with twenty clients, a quarter of them Byzantine, plain FedAvg collapses on the minority class (F1-score 0.030) while the proposed framework recovers substantially more of the signal (F1-score 0.119) while bounding the privacy loss of any single client's contribution. A Byzantine-robust aggregator with no privacy layer performs best in raw accuracy, quantifying the cost privacy imposes on robustness. The results show that privacy and robustness mechanisms interact rather than simply add, and that system design for regulated, adversarial, cross-institutional settings needs to budget for that interaction.
Read the full abstract
Distributed Computing
Fully Fluctuating Sleepy Consensus from Minimal Assumptions
Bitcoin's proof-of-work (PoW)-based protocol is remarkable for how little it asks of its participants. Not only can miners take breaks from work whenever they please, but it is almost unique in offering a path of contrition: corrupt miners can reclaim honest status simply by resuming mining on the longest chain. The protocol only requires that honest miners hold the majority of computational power at any given time. Analogous proof-of-stake (PoS) protocols, usually formalized via the sleepy model of Pass and Shi (2017), have fallen short of matching this robustness. In fact, sleepy consensus protocols in the plain PKI model must heavily restrict fluctuations in adversarial participation over time. The recent work of Efron, Neu, and Pitassi (2025) enables fully fluctuating participation in the sleepy model by introducing the external adversary model. Their protocol, however, relies on verifiable delay functions (VDFs), a strong cryptographic primitive that somewhat resembles PoW, by assuming that the adversary cannot compute sequential work significantly faster than honest nodes. In this work, we design a sleepy consensus protocol for fully fluctuating participation with an external adversary under an honest majority, from minimal assumptions: a public key infrastructure (PKI) and a verifiable random function (VRF). In particular, we make no VDF or hardware assumptions. Our key technique is graded wakeness, a novel primitive that allows nodes to form consistent opinions on which other nodes are awake. We further extend our protocol to handle uncorruption, where corrupt nodes return to honesty. This extension requires only a mild additional assumption on the unpredictability of VRF outputs for liveness.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Reassessing Evidence for Dark-Sector Interactions with Dynamical Dark Energy and DESI DR2
Recent baryon acoustic oscillation measurements from DESI Data Release 2, when combined with CMB and supernova data, strengthen the motivation for exploring departures from $\Lambda$CDM in the late-time expansion history. Because an evolving dark-energy equation of state and an interaction within the dark sector can produce partially degenerate effects on the background expansion, their observational signatures should be assessed simultaneously. We first consider an interacting $w_0w_a$CDM model with $Q=\beta H\rho_{\rm de}$, using Planck and ACT CMB data, DESI DR2, and DES-Dovekie supernovae. Allowing the dark-energy equation of state to evolve substantially weakens the preference for a nonzero coupling, while the preference for dynamical dark energy persists. The interaction provides essentially no additional improvement in the best fit, suggesting that part of the coupling preference found in more restricted interacting models may reflect a degeneracy with dark-energy dynamics. We then examine the same interaction for three one-parameter dynamical dark-energy trajectories: thawing, mirage, and generalized emergent dark energy (GEDE). The role of the interaction depends strongly on the assumed trajectory. The thawing and GEDE models favor sizable couplings of opposite signs, whereas the mirage trajectory already closely follows the dark-energy evolution preferred by the data and provides little support for an additional interaction. These models also predict markedly different signatures in structure growth, ranging from enhanced matter clustering in the interacting thawing model to strong suppression in interacting GEDE. These contrasting growth signatures, despite substantial degeneracies at the background level, highlight late-time large-scale-structure observations as a promising avenue for distinguishing dark-energy dynamics from dark-sector interactions.
Read the full abstract
Differential Geometry
Maslov Indicies In Symplectic Geometry Revisited
Thirty years ago in “On the Maslov Index” the present authors with their late collaborator Prof. Ronnie Lee of Yale University presented an axiomatization of the Maslov index, an integer-valued invariant of continuous, piecewise smooth paths of pairs of Lagrangians. Four distinct methods of definition of such Maslov indicies were given; each satisfying the axioms. Here two more are offered and comparisons are made to the recent work of Her and Zhong defining an invariant of a path of symplectic matrices motivated by earlier work of Lidskii and Gelfand, Salomon and Zehnder.
Read the full abstract
Earth and Planetary Astrophysics
Low-energy ring particle accretion as the origin of Pan's equatorial ridge
Pan is a small Saturnian satellite embedded within the planet's A ring, characterized by a polygonal equatorial ridge whose formation mechanism remains debated. A proposed explanation is ring particle accretion, yet previous simplified models could not address the ridge's complex multi-lobed morphology without ad hoc assumptions, and the cause of its latitudinal spread remains unclear. This work studies the complex low-energy dynamics around Pan to verify whether the ring particle accretion paths are consistent with the observed ridge morphology. We model particle motion using a CR3BP with spherical harmonic perturbations. Accretion paths are analyzed via grid-search simulations of trajectories transiting the $L_1$ and $L_2$ necks, using backward propagation from Pan's surface to determine the impacting material's original orbital characteristics. Asymmetric accreting particle populations, with inner-ring particles located closer to Pan and contributing more significantly to the impact flux, produce impact distributions that correlate with the ridge structure, especially for the Saturn-facing hemisphere. The ridge latitudinal spread is recovered only when the out-of-plane position and velocity of the accreting particles are strictly limited, consistent with accretion from a thin disk such as Saturn's rings. Furthermore, analysis of the particles' impact conditions revises the previously estimated minimum accretion duration downward by an order of magnitude, to $10^4$ yr, while accreting material is shown to originate from ring particles that once populated the Encke Gap. By systematically sampling admissible low-energy trajectories near Pan, our grid-search approach resolves the complex accretion dynamics that previous simplified narrow-stream models do not capture, revealing that the ridge's main morphological features emerge naturally from the local low-energy dynamical environment.
Read the full abstract
Mesoscale and Nanoscale Physics
Flux noise without flux tunability in superconducting qubits
Flux noise is unanimously recognised as a leading dephasing mechanism for flux-tunable superconducting qubits. However, our microscopic understanding remains incomplete, and basic effects like Faraday's law of induction have only very recently come into focus. Based on a quantum geometric description of the Faraday effect, we provide an in-depth derivation of the coupling of generic magnetic sources to thin film superconducting structures, under appropriate consideration of the device geometry. We apply the resulting framework to time-varying magnetic dipoles, describing surface or substrate spins, as well as current-carrying flux lines. We show that flux noise not only affects dephasing, but also provides a fundamental limit for the qubit quality factor - notably, even when the qubit contains no loops and is thus nominally not flux-tunable. Assuming surface spins as the origin for universal flux noise, we expect that this quality factor limit might be reached in the near term. For flux lines, we formulate a minimal safety distance to conserve the qubit performance, potentially constraining the scale-up of quantum hardware. This distance is boosted in the presence of large capacitor wings typical for transmons, due to a lensing of the electromotive field which is largely independent of Meissner screening.
Read the full abstract
Genomics
Enhancer-promoter proximity predicts transcriptional competence but not transcriptional output in the Drosophila brain
How 3D genome architecture contributes to transcriptional specificity across neuronal cell types remains unclear. Here, we used multiplexed chromatin tracing to map chromatin architecture and cell identity at single-cell resolution in the adult Drosophila brain. We found that enhancer-promoter (E-P) proximity was increased in transcriptionally active compared with inactive neurons. Analysis of single traces revealed the existence of distinct proximal and distal E-P states, with active neurons enriched in the proximal state. However, this relationship broke down across active neuronal subtypes, where neither E-P proximity nor chromatin accessibility predicted transcriptional output. Thus, 3D genome organization distinguishes transcriptionally competent from inactive neuronal states without quantitatively specifying transcriptional output. Our findings support a model in which E-P proximity establishes a permissive structural state, while additional cell-type-specific regulatory mechanisms tune transcriptional output.
Read the full abstract
Chaotic Dynamics
Current-Gated Nonlinear Dynamics of a Self-Heating Memristor: an Electrothermal Extension of the Pickett Filamentary Model
Self-heating couples the electrical and thermal states of filamentary memristors. However, the widely used Pickett compact model of $TiO_2$ resistive switching is isothermal and therefore cannot capture the resulting electrothermal dynamics. We introduce the Arrhenius-Thermal Filamentary Model (ATFM), which extends Pickett's tunneling-gap kinetics by incorporating a dynamic heat balance and an Arrhenius-activated switching rate. The resulting electrothermal feedback produces a sharp current-gated transition: below a critical drive current, the tunneling gap undergoes a non-returning ratchet drift, whereas above it, exponential locking of the filament kinetics establishes a bounded, drive-locked electrothermal oscillation. Using a stroboscopic Poincaré map and the Floquet multipliers of the resulting period-$1$ orbit, we characterize this onset as a threshold-like orbit contraction rather than a classical local bifurcation. In the limit $E_a\to0$, ATFM recovers the isothermal Pickett dynamics to numerical precision, as verified against an independent reference implementation over amplitude, frequency, and activation-energy sweeps. A variance-based Sobol' analysis with bootstrap confidence intervals identifies the excitation amplitude as the dominant control parameter and the thermal resistance $R_{th}$, rather than the thermal capacitance $C_{th}$, as the leading thermal contributor. A geometry-dependent temperature constraint further reveals a non-monotonic operating window in which an intermediate active area maximizes the switching excursion. The predicted trajectories are reproduced by both a fully behavioral SPICE netlist and a Verilog-A/OSDI device implementation, making ATFM directly suitable for circuit simulation. Overall, ATFM reveals and realizes a self-heating-driven dynamical regime within the widely used Pickett filamentary framework.
Read the full abstract
High Energy Astrophysical Phenomena
Single-pulse reanalysis of the 2024 Vela glitch and new observations of PSR~J0437$-$4715 and PSR~J1644$-$4559
The Pulsar Monitoring in Argentina (PuMA) collaboration systematically monitors southern glitching pulsars, maintaining high-cadence single-pulse records of the Vela pulsar. We present a pulse-per-pulse reanalysis of the 2024 major glitch of Vela (PSR~J0835$-$4510) with the 400~MHz-bandwidth ROACH backend of the Argentine Institute of Radioastronomy, and extend our machine-learning single-pulse pipeline—Isolation Forest outlier rejection, $\beta$-Variational-AutoEncoder denoising, and Self-Organizing-Map clustering—to new observations of PSR~J1644$-$4559 and the millisecond pulsar PSR~J0437$-$4715. For Vela, the 4- and 6-cluster decompositions of the eight days bracketing the glitch reproduce, with seven times the previous bandwidth, the behavior found with the narrow-band ETTUS receivers: higher-amplitude clusters peak earlier in phase, are narrower, more skewed, and less populated. With the glitch jump and its two exponential recovery terms included in the timing solution, the mean profile is stable to 1% across all eight days (width change $-0.5\pm0.9$% from pre- to post-glitch); omitting the recovery terms would mimic a post-glitch broadening of up to 55% through a folding-frequency error at the $10^{-7}$ level. The clusters of PSR~J1644$-$4559 differ almost exclusively in amplitude, as expected for a scattering-dominated profile. For PSR~J0437$-$4715, retaining the 10% of pulses with the highest peak-dominance score doubles the signal-to-noise ratio, and a five-cluster decomposition yields narrow, phase-ordered groups a factor $3.6\pm0.4$ narrower than the average profile, suggesting a $\sim$3.5-fold improvement in cluster-based timing precision for this pulsar-timing-array target, to be confirmed in a follow-up paper.
Read the full abstract
Robotics
Seeing Less Is Not Seeing Safely: Privacy Leakage from Task-Scoped Robot Perception Exports
Domestic robots rely on rich perception to operate in private homes, but privacy risk persists even when raw sensor data remain local. Structured representations exported to downstream planners, cloud services, logs, or learning pipelines can still reveal household information through semantics, geometry, spatial structure, and task targets. We introduce Task-Functional Perception Distillation (TFPD), a task-scoped representation-export framework that keeps rich perception local and profiles downstream exports according to task utility, direct exposure, and multiple residual inference risks. Using 120 AI2-THOR scenes with scene-disjoint train/validation/test splits, frozen attacker selection, and representation-aware held-out attacks, we evaluate navigation, collision checking, and object-goal execution. Three navigation exports achieve identical success (1.000) and mean path ratio (0.898), yet representation-level linkability ranges from 0.532 to 0.970. Replacing an explicit target label with a target region reduces target-category macro-F1 from 1.000 to 0.077 while preserving success at 0.995, while geometric coarsening reduces object-category macro-F1 from 0.704 to 0.556 at a measurable collision-utility cost. A ProcTHOR replication preserves the navigation task-equivalence/privacy-inequivalence finding while changing the relative ordering of normalized and topological exports. These results show that neither field removal nor stronger abstraction induces a universal privacy ordering and motivate task-specific, multi-risk evaluation of the complete public representation.
Read the full abstract
Functional Analysis
The classes of bivariate Schur and Herglotz matrix-valued rational functions: realizations, symmetrizations, and related determinantal representations
We present a finite-dimensional realization theory for bivariate rational functions that are contractive or have nonnegative real part on the bidisc or on the bihalfplane. We show that the realization formula depends only on the underlying domain, while the distinction between the four resulting function classes is captured entirely by explicit matrix inequalities imposed on the realization matrices. These results provide finite-dimensional realizations for rational Schur–Agler and Herglotz–Agler functions, extending the previous infinite-dimensional results. We further characterize symmetric realizations by means of a Hermitian unitary symmetry of the realization data, yielding realization theorems on the symmetrized bihalfplane. Finally, we obtain determinantal representations for symmetric stable polynomials and, consequently, for stable polynomials on the symmetrized bihalfplane. For rational functions over the real field the respective representations can use matrices with real entries.
Read the full abstract
Quantum Physics
Multi-Boundary Many-Body Quantum Teleportation
Unlike standard quantum teleportation, many-body teleportation uses scrambling to transmit quantum information. In this protocol, initially localized information spreads over many degrees of freedom and is later refocused at the receiver by a simple coupling between the systems, followed by further many-body evolution. The protocol was developed from models of traversable wormholes in holography and has become a useful probe of scrambling. In particular, it can distinguish genuine scrambling from decoherence or noise when out-of-time-order correlators fail, and can reveal signatures of different scrambling mechanisms, including the distinctive behavior expected in holographic systems. Holography predicts that related protocols can transmit information between selected boundaries of multi-boundary wormhole geometries. Motivated by this setting, we study single-qubit many-body teleportation among three systems of qubits. The initial state consists of EPR pairs distributed among them, providing a simple analogue of an infinite-temperature three-boundary holographic state. We analyze the protocol with one-dimensional and all-to-all dynamics, both analytically and numerically using random circuits. We find that the third system suppresses teleportation once the spreading message reaches the region of qubits that are entangled with it. In one dimension, both the minimum coupling required for successful teleportation and the fidelity depend on the distance from the injection site to this region, a feature reminiscent of holographic causal shadows. For all-to-all dynamics, successful teleportation is instead restricted to early times and to sufficiently few qubits entangled with the third system. A third system therefore provides spatial, or subsystem, resolution of information spreading that is absent from the two-sided protocol. Our results offer a step toward many-body teleportation networks.
Read the full abstract
Computer Vision
IDSPACE: A Novel Document Generator for Reliable Evaluation of Digital Identity Verification Systems [Extended Technical Report]
As services move online, trust institutions such as banks, lenders, and governments must verify the identity of remote users. Fraud detection tools are widely available, but evaluating and fine-tuning them remains difficult because identity documents are sensitive and therefore scarce. Synthetic data generation offers a path forward, and demand is clear: our prior work in this area has been downloaded over $11{,}000$ times (aggregated from eight parts). We introduce IDSpace, extending this line of research in three directions. First, we propose model-guided Bayesian optimization, which tunes generation parameters to maximize both visual similarity and prediction consistency with target-domain models given only a few samples from a target domain. Second, we decouple user-specified metadata (demographics, fraud patterns, capture device) from automatically tuned control parameters (font styles, noise levels, image quality), allowing users to configure evaluations without low-level expertise. Third, we expand beyond template images to support scanned and mobile-captured documents. Experiments show IDSpace improves evaluation consistency by $15-45\%$ over baselines including CycleGAN, diffusion inpainting, and non-guided optimization, using only a few real samples, while improving training accuracy by up to $9\%$ and SSIM similarity with the target domain by $10\%$. We also released a new dataset consisting of $359{,}240$ high-quality synthetic documents across ten European ID types.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Beyond isolated curvature peaks: collective collapse and multiple Primordial Black Hole formation
Primordial black hole (PBH) calculations usually treat rare curvature peaks as isolated collapsing regions. Using fully nonlinear $3+1$ numerical-relativity simulations in a radiation-dominated Universe, we demonstrate that neighbouring primordial curvature perturbations need not map one-to-one onto PBHs: they may ultimately disperse, collapse collectively into a single PBH, or undergo distinct local collapses and form more than one PBH. In the family of two-component profiles studied here, the latter outcome is a pair of PBHs, identified by the coexistence of two disconnected apparent horizons on at least one time slice. We introduce a nonspherical quasi-local compaction diagnostic based on the Hawking mass and referenced to a round flat-FLRW sphere of equal area. It retains the angular structure of the curvature field and reduces to the standard Misner-Sharp compaction function in spherical symmetry. The global maximum of this diagnostic, $\mathcal K_{\rm form}$, provides an empirical indicator of whether at least one PBH forms, with a transition near $\mathcal K_{\rm form,c}\approx0.56$ and modest profile-dependent scatter. For forming bimodal profiles, we supplement the nonlinear compactness with a signed linear surface strength evaluated on the same probing spheres. The viability of the weaker local branch and the competition between the local and common-enclosing branches improve the empirical discrimination between single- and double-PBH outcomes. Our results therefore show that the maximum curvature amplitude alone does not determine the collapse outcome, which also depends on the spatial extent, characteristic scales, and geometry of the surrounding curvature environment.
Read the full abstract
Number Theory
An upper bound for an exceptional automorphism group
Let $q=p^h>7$ be odd, put $m=(q+1)/2$, and suppose that $i=(m-2)/2$ satisfies $\gcd(i,m)=\gcd(i+2,m)=1$. For the $\mathbf{F}_{q^2}$-maximal function field $\mathcal{F}_i=\mathbf{F}_{q^2}(x,y)$ defined by $y^m=x^i(x^2+1)$, Peter Beelen, Maria Montanucci, Jonathan Niemann, and Luciane Quoos showed that the geometric automorphism group contains a subgroup of order $4(q+1)$ and conjectured that its order is exactly $4(q+1)$. We prove this equality by establishing the reverse inequality.
Read the full abstract
Commutative Algebra
Power sums of critical points of gap polynomials for symmetric and pseudo-symmetric numerical semigroups
For a numerical semigroup $S$ with Frobenius number $F$ and gaps $G$, a polynomial $P\left(z\right)=\sum_{g\in G}c_{g}z^{g}$ of degree $F$ is called a gap polynomial. We show that for a symmetric numerical semigroup, the power sums of the critical points of a gap polynomial vanish for every power $g\in G$. For a pseudo-symmetric numerical semigroup, the same result holds if the term $z^{F/2}$ is omitted from $P\left( z\right) $. We give several corollaries, including that the sum of the critical values of a gap polynomial vanishes.
Read the full abstract
Quantum Physics
Resource-adaptive distributed fault tolerance with very noisy Bell pairs
Distributed architectures have been proposed as a pathway to large-scale quantum computers. Combined with the need for fault-tolerance, such architectures require distributed quantum error correction (DQEC) and distributed logical gates. An important challenge is how to realize DQEC primitives in the setting where interaction between modules is restricted to shared Bell pairs that are significantly noisier than on-chip operations. We extend the framework known as fault tolerance by construction to this setting, deriving different strategies for handling the additional noise. Through fault-improvement we recover conventional entanglement distillation, and also find more dynamical protocols that enable space-time trade-offs. We show that integrated decoding halves the required distillation code distance compared to entanglement distillation implemented using separate decoding, thus requiring significantly fewer Bell pairs. As a main focus of the work, we synthesize efficient circuits for an important primitive in distributed fault tolerance: distributed stabilizer measurements. These circuits can be adapted to resource constraints, e.g. on the Bell pair generation rate or the space available for on-chip auxiliary qubits. Noting that full local fault-tolerance is not always needed to preserve the correct scaling of logical error rates, we further optimize the circuits depending on the surrounding context. We consider in particular the surface code and the color code, both as distributed memories and in the case of lattice surgery across separate modules. Here, robustness to certain hook and readout errors reduces the number of required Bell pairs even further, compared to the context-free setting. We numerically benchmark the resulting implementations under circuit level noise with additional interconnect noise.
Read the full abstract
Computation and Language
SHELF: A Synthetic Harness for Multi-Task Bibliographic Benchmarking
Libraries and archives manage large collections with limited staff and computing budgets, yet common benchmarks do not systematically test their bibliographic work. They need to know which methods work for their tasks and what those methods require to run. SHELF, the Synthetic Harness for Evaluating LLM Fitness, addresses this gap. It is a Python system that turns labelled taxonomies, writing specifications, and a generation budget into controlled benchmark data and evaluation tasks. This first release contains 62,899 model-written documents based on Library of Congress vocabularies, with tasks for classification, clustering, retrieval, pair classification, and instruction retrieval. We compare TF, TF-IDF, BM25, popular encoders, and, on subject classification only, zero-shot decoders; each method appears only on tasks that support it. Subject classification reaches 0.8887, while genre-form classification reaches only 0.2605, and several pair and clustering tasks remain near chance. Sparse methods remain competitive on classification, while TF-IDF is the fastest measured arm in the subject timing experiment. SHELF also varies bibliographic facets independently and can generate new, verifiably unseen documents after a model's training cutoff. Comparisons with LCSHBench and Project Gutenberg show that model rankings transfer more reliably than absolute scores, but SHELF scores do not estimate accuracy on production catalogue data. We release all source code and data under permissive licenses on GitHub and Hugging Face.
Read the full abstract
Biomolecules
Advances in Machine Learning for Directed Evolution: A Five-Year Retrospective
The last five-plus years have seen many protein engineering disciplines transformed by advances in machine learning (ML), but the same cannot be said for directed evolution. Reflecting on a previously co-authored perspective, I discuss why I believe this to be the case, arguing that a disconnect between the goals of machine-learning-assisted directed evolution (MLDE) researchers–"identify an optimal protein"–and the goals of directed evolution more broadly–"identify a sufficient protein given time and resource constraints"–is a principal culprit. As an example, I highlight how nearly all current MLDE methods neglect to account for the cost of DNA synthesis, resulting in strategies that have limited practical applicability regardless of the underlying models' capabilities. I close by discussing recent works that are exceptions to this overarching trend, and emphasize that the last five years of efforts in ML-assisted protein engineering and the prescribed reframe of MLDE objectives need not be mutually exclusive.
Read the full abstract
Quantum Physics
Robust Hamiltonian engineering with subensemble control
We present a robust protocol to reshape interactions in a spin ensemble based on global control pulse sequences applied to multiple subensembles in parallel. This setting arises naturally from ensembles of solid-state defects or multi-species atomic arrays. We show that it is provably computationally hard to find pulse sequences that simultaneously engineer interactions both within and between subensembles. Despite its formal hardness, we identify a set of necessary or sufficient conditions under which one can synthesize a target Hamiltonian from the native one. Moreover, we introduce efficient numerical strategies for designing pulse sequences that engineer target Hamiltonians robust against common control imperfections. As a specific application, we discuss the robust generation of two-mode spin squeezing in dual-species atomic ensembles, which is a challenging task without subensemble control. Our results provide a practical toolbox to design novel quantum simulation and sensing experiments with minimal control overhead.
Read the full abstract
Chemical Physics
Reactive calcium carbonate precipitation from an atomic cluster expansion potential and enhanced sampling
Calcium carbonate formation from aqueous solution is central to biomineralization and to carbon sequestration through mineral carbonation. At near-neutral pH, the process is highly reactive, with proton transfer mediating the interconversion between carbonate species. Most atomistic simulations to date either treat carbonate speciation as fixed or consider proton transfer only in small clusters. Here, we combine an ab initio trained atomic cluster expansion (ACE) machine-learning potential for molecular dynamics with enhanced sampling to enable reactive simulations of the early stages of calcium carbonate precipitation at previously inaccessible length and time scales. We study proton transfer and carbonate speciation in ion pairs and triplets, as well as in the collective aggregation of many ions. Our simulations with few ions show that ion association provides a favorable pathway for proton transfer, facilitating interconversion between carbonate, bicarbonate, and carbonic acid. In many-ion systems, proton transfer occurs spontaneously alongside aggregation, and we observe significant changes in the coordination environments as species evolve during the simulations. These results show that ion aggregation and chemical reactivity can be strongly coupled during the early stages of nucleation from solution.
Read the full abstract
High Energy Physics (Theory)
Monstrous parafermionic defects and other non-invertible symmetries in chiral CFTs
The structure of non-invertible symmetries in 2D CFT is closely tied to the algebra of preserved holomorphic fields, its representation theory, and its embedding in the full chiral algebra of the CFT. Unfortunately, finding new embeddings of a chiral algebra into another is a difficult mathematical problem, and one of the major obstacles in the pursue of new and exotic categories of non-invertible symmetries. In this work, we describe a simple general technique that leads to a number of new non-trivial results in this direction: (1) For the holomorphic Monster CFT $V^\natural$, we show that for every `Fricke' non-anomalous Monster element of order $N$, there is an embedding of the parafermion algebra $\frac{su(2)_N}{u(1)}$ in $V^\natural$, we compute the characters of its commutant, and describe the topological defects preserving these subalgebras. (2) We provide an easy-to-check sufficient condition for a holomorphic VOA $V$ to be self-orbifold under a cyclic group of (invertible) symmetries, and determine the associated duality defect. (3) We find several new topological defects in CFTs arising from heterotic strings on $T^4$. (4) We prove a number of VOA embeddings and topological defects in the Leech lattice CFT, in Schellekens theories, and other CFTs of various central charges, and suggest several generalizations of our methods.