Peer Revenue Publish or profit

Papers

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

All of arXiv

Monday 7 September

High Energy Physics (Theory)

Spherical DAHA as an algebra of framed BPS states

Line operators of 4d $\mathcal{N}=2$ theories of class $\mathcal{S}$ of type $A_{N-1}$ in a half Omega background provide a physical model for $SL_N$ skein algebras. In this paper we extend this correspondence to $GL_N$ skein algebras and prove that the $GL_2$ skein algebra of the punctured torus is isomorphic to the $GL_2$ spherical double affine Hecke algebra ${{\mathbf{S}\ddot{\mathbf{H}}}}^{q,t}_2$. The construction is based on $\mathfrak{q}$-nonabelianization for the $SU(2)$ $\mathcal{N}=2^*$ gauge theory, which realizes the skein algebra as a quantum torus algebra associated with the Seiberg-Witten curve. Different regions of the Coulomb branch yield distinct presentations of ${{\mathbf{S}\ddot{\mathbf{H}}}}^{q,t}_2$. These range from the Macdonald $q$-difference module in Fenchel-Nielsen (weak coupling) charts to cluster-type realizations in Fock-Goncharov (strong coupling) charts. Transitions between these descriptions are governed by the vanilla BPS spectrum of the $\mathcal{N}=2^*$ theory via framed wall-crossing, which provides a unified physical framework for several representations of spherical DAHA.
Read the full abstract

Artificial Intelligence

PRIMUS: Identity, Governance, and Verification for Multi-Agent Federations

Multi-agent federations need governance that answers three questions under adversarial conditions: who participated (identity), did they conform (enforcement), and who decides (authority). A separate question is whether the verification machinery that polices a federation's outputs can also steer a generate-and-test loop toward better answers. Part I. PRIMA introduced prime-power agent identity and a consensus token whose factorization indexes participation, but assumed honest agents. We present PRIMUS, which couples prime-power identity with BLS aggregate signatures (PIAC), derives a safe-kill threshold that reduces false-positive agent termination from 80% to 0.00% under 10% channel noise, gives the closed-form economic boundary where singleton governance outperforms Byzantine quorum ($\gamma^* \approx 9f$, verified flat across n = 50 to 10,000), and specifies VRF succession with lease and fencing that makes safety unconditional under partial synchrony. Five problems are identified as provably unfixable within the model and stated as scope boundaries. Part II. A verifier is not a solver. We ask whether PRIMA's binary artifact-fidelity verdict can be converted into a graded fitness signal, and measure the conversion on binary covering codes. Calibration against injected fault burden is strong ($\rho$ = 0.676 deterministic, 0.819 full); against real LLM-generated candidates the same scores fall to 0.158 and 0.406, roughly a quarter of the calibration value (the same-designer confound, measured). As a pre-filter it beats a random-score control convincingly and a binary gate narrowly. Under 400 iterations of explicit optimization it was not gamed, but only because the objective saturated after one honest answer. A cross-family judge preserves the burden-ordering signal while destroying individual judgments. No covering-code record resulted. Measured program cost: USD 164.78.
Read the full abstract

Optimization and Control

Mean-field quadratic BSDEs and related mean-field portfolio games of controls

We study a new class of mean-field quadratic backward stochastic differential equations (qBSDEs) arising from mean-field portfolio games with exponential utility. Typical examples of such games include a mean-field portfolio game with price impact, and a finite-contract pricing model with market clearing conditions. Generators of these mean-field qBSDEs contain quadratic terms $\mathbb{E}[Z]^{\top} Z$ and $|\mathbb{E}[Z]|^2$, instead of the classical pathwise $Z^\top Z$ term. We prove local well-posedness under $L^q$-integrability assumptions on terminals and their Malliavin derivatives, and global well-posedness under an extra exponential integrability condition on the Malliavin derivatives. Then we show the existence and uniqueness of global equilibria of the above two mean-field games via our qBSDE theory.
Read the full abstract

High Energy Physics (Experiment)

Solid-state nuclear magnetic resonance search for axion-like dark matter with broadband SQUID magnetometry

We report the results of an experimental search for ultralight axion-like dark matter in the mass ranges 19.5–20.5 and 21.5–22 neV. The Cosmic Axion Spin Precession Experiment-electric probes the axion-nuclear electric dipole moment coupling. We perform solid-state nuclear magnetic resonance on $^{207}$Pb spin ensembles which reside in a polarized ferroelectric crystal. The background axion-like dark matter field induces an oscillating torque on the $^{207}$Pb spins via the electric dipole moment coupling $g_{d}$. The experiment is calibrated with pulsed magnetic resonance measurements covering two frequency bands (4.6–5.0 and 5.2–5.3 MHz) that correspond to the axion Compton frequencies associated with the identified axion mass ranges. By sweeping the leading magnetic field applied to the sample, we are able to detect the $^{207}$Pb nuclear magnetic resonance in these frequency ranges using a superconducting quantum interference device, inductively coupled to the sample with a broadband circuit. We establish the upper bounds $|g_{d}| < 4\times 10^{-4}$ GeV$^{-2}$ with 95% confidence in these frequency bands. Our results demonstrate the detection and small-tip angle calibration of low-field $^{207}$Pb nuclear magnetic resonance, allowing for sensitivity to axion-like dark matter in the nanoelectron-volt axion mass range.
Read the full abstract

All authors Andrew J. Winter, János Ádám, Deniz Aybas, Dmitry Budker, Derek F. Jackson Kimball, Surjeet Rajendran, Arne Wickenbrock, Alexander O. Sushkov

Hardware Architecture

A 28nm 27,648-Spin Multichip Digital Ising Accelerator with Pegasus Connectivity

We report a 28 nm four-chip Ising accelerator with 27,648 spins, degree-15 Pegasus connectivity, and 10b coefficients. Boundary-state streaming overlaps interchip transfers with spin updates, achieving 98.03% simulated weak-scaling efficiency. At 140 MHz, the four-chip system delivers 30.24G peak updates/s at 1.2 pJ/update including I/O power, with 11.5$\times$ the throughput and approximately one-quarter the logic-plus-SRAM area per spin of a prior 28 nm multichip design. We demonstrate MaxCut, spin glass, frustrated loops, factorization, and 3SAT.
Read the full abstract

All authors Tong Wu, Atharva Raut, Ian Khor, Ziyad Alswaidan, Ting-Yu Lee, Hongchang Kuang, Navid Anjum Aadit, Anand Raju, Dhruv Chinmay, Siddharth Das, Ken Mai, Kerem Camsari, Tathagata Srimani

Physics and Society

Latent geometry organizes higher-order interactions

Higher-order structures offer a natural representation of complex systems that involve interactions between groups of different sizes. A widespread feature of their higher-order structure is nestedness, whereby interactions involving smaller groups are contained within larger ones. Yet, why interactions of different orders organise into nested structures remains largely unexplained. Here, we introduce an analytically tractable geometric model of higher-order networks in which a single latent geometric space couples interactions across orders, leading to the spontaneous emergence of nestedness. We show analytically and numerically that nestedness undergoes a transition between a nested geometric regime, where it remains finite in the thermodynamic limit, and a regime where it vanishes with system size. In this regime, we uncover a weakly geometric range characterized by an anomalously slow finite-size decay, allowing substantial nestedness to persist in finite systems even when its asymptotic value vanishes. Finally, with a single geometric coupling parameter, the model reproduces the nestedness profiles observed in real-world hypergraphs across different domains. Our results reveal latent geometry as a simple organising principle underlying the nested organisation of higher-order interactions.
Read the full abstract

All authors Berné L. Nortier, Jasper van der Kolk, Robert Jankowski, Simon Dobson, M. Ángeles Serrano, Federico Battiston, Marián Boguñá

Robotics

Conditional Timed Partial Orders: An Expressive and Interpretable Framework for Robot Task Specification and Planning

Timed Partial Orders (TPOs), originally proposed for workflows, provide an interpretable framework for robot task specification with planning algorithms based on mixed-integer linear programming (MILP). However, TPOs are limited in expressivity, capturing only partial-order events with simple timing constraints. In this paper, we introduce Conditional TPOs (cTPOs), which extend TPOs with richer relative-timing constraints and conditional event activations based on environmental conditions. We show that planning for cTPOs also reduces to an MILP problem; however, the added expressivity results in significantly larger MILPs that can become computationally intractable. To address this challenge, we propose a decomposition algorithm that partitions a cTPO into smaller sub-TPOs, yielding a sequence of smaller MILP problems. We prove that this decomposition is complete and preserves plan optimality while improving the interpretability of complex tasks. Experimental results demonstrate the effectiveness of cTPOs as a task specification framework and the efficiency of our decomposition approach, achieving up to four orders of magnitude speedup over the monolithic MILP.
Read the full abstract

Classical Physics

Conformal Symmetry and Planck's Thermal Radiation in Classical Physics

Thermal radiation is discussed for a classical scalar field. Dilation and acceleration appear in conformal symmetry, and so are treated in connection with zero-point radiation and equilibrium thermal radiation. Classical zero-point radiation is completely invariant under dilation in a inertial frame. However, in a Rindler frame, zero-point radiation takes a different form which is related to Planck's thermal spectrum with temperature T related to acceleration. Traditionally, zero-point radiation is said to take a thermal (Unruh) form in a Rindler frame. However, the classical viewpoint indicates that zero-point radiation in a Rindler frame requires a divergent frequency spectrum and so is not thermal radiation. The Unruh form suggests an additional classical thermal spectrum satisfying the Stefan-Boltzmann relation.
Read the full abstract

High Energy Physics (Experiment)

Real-time lepton identification at LHCb in Run 3 using Lipschitz neural networks

The LHCb physics program in Run 3 relies critically on the efficient real-time selection of events containing muons and electrons, which are key signatures in a wide range of heavy-flavor and exotic decay processes. The LHCb Run 3 detector now operates with a fully software-based trigger that processes the complete detector readout at the LHC bunch-crossing rate, with the first trigger stage executed on GPUs. In this environment, particle-identification algorithms must achieve high efficiency and background rejection while satisfying stringent constraints on throughput and memory footprint. We present algorithms for muon and electron identification in the LHCb Run 3 GPU trigger based on Lipschitz-constrained neural networks. Separate networks are developed for muons and electrons and are trained using simulated events. Their performance is evaluated relative to the previous baseline algorithms, demonstrating improved discrimination across a wide range of kinematic regions while remaining compatible with the requirements of real-time GPU execution.
Read the full abstract

All authors Adrian Casais Vidal, Kate A. Richardson, Maarten Van Veghel, Marco Santimaria, Marianna Fontana, Mike Williams

General Finance

Measuring DeFi Risk

Decentralized finance (DeFi) lending has grown from nonexistent in 2017 to nearly 40 billion US Dollars in deposited funds in May 2022. Using cryptocurrency as collateral, the platforms match speculative margin trading with yield-seeking depositors lending coins pegged to the dollar (stable coins). Depositors receive claims guaranteed by a basket of collateral, akin to new stable coins. We develop a framework requiring only knowledge of aggregate deposits and borrowings to measure overall system risks to lenders and borrowers. Using evidence from major protocols, the measures identify an increase in system fragility beyond prudent levels around mid 2021, with a potential loss of peg for extreme variations in coin prices. Overall, the model offers an easily implementable aggregate risk metric capturing the perspectives of synthetic investors and offers early warning signals as the industry is moving from deposits guaranteed by collateral to fiat money.
Read the full abstract

Artificial Intelligence

Quantization Amplifies Determinism, Not Bias: Scale-Dependent Behavioral Effects of Serving-Time Weight Compression

Weight quantization largely determines the economics of serving open-weight LLMs. Its costs are usually assessed with capability benchmarks, on which 4-bit quantization of mid-sized models is often considered "nearly free." We examine a different question: when several answers are valid, does quantization change what a model chooses to say? We serve three checkpoints (Qwen3-8B/14B/32B) at three weight precisions (W4A16 AWQ, W8A16 FP8-Marlin, and bf16), holding the hardware, software, and sampling configuration constant, and collect approximately 71,000 completions paired by prompt and seed across two custom, leak-checked prompt batteries. We pre-specified the analyses in three waves in version control. At 8B, int4 reduces output diversity: the probability that two samples for the same scenario recommend the same brand increases by 5.1 percentage points (prompt-paired sign-flip test, Holm p = .023; reproduced at +4.4pp on a full regeneration of the arm), and lexical diversity falls substantially (TTR -0.011, standardized effect -0.51; robust to a length-controlled measure). At 14B and 32B, no content-concentration measure reaches significance; instead, stylistic drift emerges (em-dash rate +0.46/1k words at 14B and +0.61/1k at 32B, both Holm p <= .0024). Pre-specified tests of stereotype direction are null at every scale: outputs concentrate on the modal answer for each prompt rather than on stereotypical answers. Mechanistically, the token-level distribution becomes flatter (decision-token entropy +0.091 bits, p = .015) while the semantic distribution, measured directly from first-token log probabilities, becomes more concentrated (collision +2.6pp, p = .023): individual tokens become less predictable even as meanings become more repetitive. At 8B, the smallest size tested, AWQ-int4 serving measurably narrows the range of suggestions; audits should assess concentration as well as bias.
Read the full abstract

Systems and Control

Sound Compilation of Weighted Event Signal Temporal Logic to Timeless Geometric Control

Cyber-Physical Systems (CPS) controllers synthesized from standard temporal logics rely on rigid global clocks, rendering them vulnerable to asynchronous timing anomalies like clock snaps, jitter, and network delays. To overcome these vulnerabilities, we introduce a fundamentally timeless geometric control paradigm alongside a novel specification language: Weighted Event-Based Signal Temporal Logic (weSTL+). This new weSTL+ logic combines the event triggered nature of Event-STL with weighted user preferences of weighted-STL making it suitable for specification of practical autonomous CPS. Using a two-pass compiler, our framework translates weSTL+ formulae directly into C^1-differentiable time-invariant geometric surrogate constraints via finite-time level-set inversion. By mapping temporal windows directly into physical time independent geometric boundaries, this approach entirely eliminates explicit runtime clock monitoring. Our autonomous robotics case study demonstrates that the proposed geometric architecture guarantees enforcement of safety and liveness under severe macroscopic timing discontinuities, succeeding where traditional time-indexed controllers fail.
Read the full abstract

Statistical Mechanics

Tensor network investigation of the monomer-dimer model on the honeycomb lattice

The monomer-dimer model is one of the most well-known unsolved lattice models. In this paper we study the monomer-dimer model on the honeycomb lattice using the tensor network method, in the case that the dimer and monomer activities are 1. The monomer-dimer configurations are exactly mapped into the ground states of the antiferromagnetic Ising model on the Kagomé lattice in the critical field $H_{\rm{ex}}=4J$, and the tensor network is constructed based on the local ground states of each Ising triangle. The VUMPS approach is employed to contract the tensor network, providing a high-precision result of the monomer-dimer problem. We also revisit the edge coloring problem on the honeycomb lattice and discuss its relationship to the monomer-dimer model. Finally we formulate the monomer-dimer problem in the language of the sixteen-vertex model, and discuss the non-integrability of the general monomer-dimer model and the integrability of the pure dimer model.
Read the full abstract

Theoretical Economics

Disclosure under Noisy Information Processing

Capital markets process disclosures with noise. Adding this single friction overturns the standard characterization of costly voluntary disclosure. Firms may unravel to full disclosure despite strictly positive disclosure costs and, when unravelling fails, the model generically admits two equilibria rather than one. In the lower-threshold equilibrium, disclosure becomes more frequent as the cost rises and as reports become more accurate, falls with fundamental volatility when it is below the processing noise, but approaches full disclosure again when volatility grows large. These results help explain the mixed empirical evidence on the proprietary cost hypothesis and generate conditional predictions that distinguish high and low disclosure regimes. The model also explains why ESG ratings can be noisy, costly, and widely purchased, while still influencing market prices.
Read the full abstract

Machine Learning

The Accuracy Paradox: Empirical Diagnostic of Default Decision Thresholds in Multi-Label Enzyme Commission Prediction [With Code]

Automated prediction of Enzyme Commission (EC) numbers plays a central role in functional annotation and computational drug discovery. However, standard multi-label machine learning pipelines frequently rely on default decision thresholds (t=0.50), assuming balanced prior distributions across target heads. In this study, we present a systematic empirical diagnostic of uncalibrated fixed decision boundaries operating under severe class imbalance across N = 14,096 annotated compounds categorized into six primary EC classes (EC1-EC6). Our results highlight a pronounced Accuracy Paradox: while the multi-label system achieves a deceivingly high mean accuracy of 77.16%, the macro F1-score (0.3976) and macro recall (0.3872) reveal severe predictive breakdown. Majority target classes suffer from hyper-sensitivity and over-prediction, whereas minority classes exhibit sharp recall decay, culminating in a total decision boundary collapse for EC6 (Recall = 0.00%) despite underlying discriminative power (ROC-AUC = 0.5857). Feature correlation analysis further reveals high linear redundancy among topological indices relative to fingerprint density metrics. Ultimately, this diagnostic study demonstrates that standard point predictions mask critical errors in bioinformatics workflows. We establish target-specific threshold optimization and post-hoc conformal calibration as essential, open-source post-processing safeguards for reliable applied machine learning and deep learning architectures.
Read the full abstract

2609.07897 · 7 Sep · 11 pages, 4 figures,Enzyme Commission prediction, multi-label classification, class imbalance, threshold optimization, conformal calibration, accuracy paradox, bio-data, applied machine learning, bioinformatics. imbalanced bio-data, model diagnostic, performance metrics, open-source pipeline

Combinatorics

Modularity in planted partition model

We obtain tight bounds on the modularity of PPM graphs in the case of equally sized parts. Moreover, we provide a general method that can help in obtaining bounds for various other models.

Analysis of PDEs

Rotating vortex patches: rigidity, bifurcation, and unified structures

This monograph presents a systematic account of several classical and recent developments in the theory of rotating vortex patches, or V-states, for the two-dimensional Euler equations and related active scalar models. Its purpose is both expository and structural: we revisit some of the foundational results of the subject, provide detailed proofs and alternative formulations, and present more recent results within a common analytical framework. We begin with Euler vortex patches and the contour dynamics formulation of rigidly rotating solutions. We then develop two complementary approaches to the V-state equation, based on Cauchy integrals and conformal mappings, and discuss their connections with potential theory and Faber polynomials. These tools are used to revisit classical examples, including Rankine vortices and Kirchhoff ellipses, as well as rigidity and classification results. A substantial part is devoted to Burbea construction of noncircular V-states via bifurcation theory. The final part develops a unified approach to rotating patches for a broad class of incompressible active scalar equations. Structural properties of the interaction kernel, in particular complete monotonicity and the resulting spectral factorization, yield a common bifurcation framework encompassing the Euler, generalized surface quasi-geostrophic, quasi-geostrophic shallow-water, and related models.
Read the full abstract

Quantum Physics

A Novel Steganography Scheme Using Quantum Hilbert Transform

The main goal of steganography is to transmit hidden messages in legitimate-looking communication messages. Phase-domain information hiding, however, has not been fully explored for quantum systems. This work introduces a finite-dimensional Quantum Hilbert Transform (QHT) as a unitary phase operator based on the Quantum Fourier Transform. Using this construction, we develop a QHT-based quantum steganography scheme that embeds classical bits as weak signed phase perturbations of quantum cover states. Bob recovers the hidden message through binary state discrimination, block aggregation, and classical error-correcting decoding.
Read the full abstract

Artificial Intelligence

Explainable Temporal Attention-based Defect Detection For Fillet Joints in Real-Time Gas Metal Arc Welding Based on Multi-modal Data

Deep learning is an efficient technique to monitor the real time welding process, reducing post-welding repairs and production delays. This paper leverages the monitoring capability by proposing a multi modal temporal attention based deep learning defect detection model for internal defects that are challenging to detect, including porosity, lack of penetration and fusion, undercut, and cold lap during Gas Metal Arc Welding in fillet joints. The model is trained on collected welding images and sound data from an industrial collaborative welding robot. The results show that the attention module can improve the F1 Score to 0.99. We use explainable Artificial Intelligence to interpret the proposed models behavior and dataset distribution, determining potential important areas in image and sound spectrograms and preferred modality to detect each defect. This improves trust and reliability in Artificial Intelligence driven welding inspection.
Read the full abstract

All authors Mobina Mobaraki, Mahyar Asadi, Klaske Van Heusden, Guy A. Dumont

Quantum Physics

Few-Body Decay Dynamics in Colloidal CsPbI3 Quantum-Dot Clusters

Colloidal perovskite quantum dots combine bright emission with the ability to self- assemble into closely spaced structures, enabling radiative dynamics to be studied from isolated emitters to few-dot clusters. Here, we characterize CsPbI3 perovskite quan- tum dots from isolated emitters to self-assembled clusters containing up to ten dots. We estimate the number of emitters in each cluster using a combination of photon autocorrelation, blinking statistics, and emission brightness. Compared with isolated dots, clusters containing two or more emitters exhibit biexponential decay, with a short lifetime that decreases with emitter number and an additional long-lived component. Photon-correlation Fourier spectroscopy shows that the single-dot emission remains far from the lifetime-limited regime. Nevertheless, we observe emitter-number-dependent decay dynamics even in this low-coherence regime. Together, these measurements es- tablish self-assembled perovskite quantum-dot clusters as a platform for studying how collective optical behavior emerges between the single-emitter and ensemble limits
Read the full abstract

All authors Emma Daggett, Christian M. Lange, Nicholas Favate, Ankit Kundu, Ishita Agarwal, Arya D. Keni, Adhyyan S. Mansukhani, Christina W. Li, Libai Huang, Jonathan D. Hood

Logic in Computer Science

Automatic constraints with few subpowers and graphoid recognition

Finite automata can describe relations of unbounded arity that are exponentially larger than their descriptions. We prove that constraint satisfaction for such relations is solvable in polynomial time whenever their length slices are preserved by a common fixed edge operation on a finite domain. The algorithm computes compact representations of the complete solution relation and its projections. Its main ingredient is a polynomial-time compilation of nondeterministic finite automata into the fork witnesses and small projections required by the few-subpowers algorithm. In the Mal'tsev case, a direct proof is polynomial also when the domain and operation table are supplied as input, answering the Mal'tsev tractability question for automatic constraint satisfaction. We also characterize all invariant relations of a family of 3-edge algebras with neither Mal'tsev nor near-unanimity terms. Their normal forms combine Boolean activity constraints with affine value spaces and yield canonical quadratic-bit representations constructible from NFAs or arbitrary generators. For graphoid automata, these results give polynomial-time recognition without a graph-width restriction, effective boundary composition, and comparison of finite graph relations. The quadratic boundary bounds are optimal in the worst case. A fixed three-state example separates polynomial-time recognition from hard exact counting.
Read the full abstract

Quantum Physics

Riemannian optimization for linear optical problems

Many applications of linear optics in quantum science involve searching for some optimal configuration of a multiport interferometer. For example, to find heralded state preparations, one can optimize the interferometer to maximize the fidelity and success probability of the state preparation. In this paper, we derive a closed analytical formula for the Riemannian gradient of any differentiable function defined over the interferometer unitaries. We use this gradient in Riemannian optimization algorithms, such as gradient descent or BFGS, to find the optimal setup of the interferometer. As an interesting use case, we search for linear optical state preparations, improving some of the success probabilities reported in the literature for NOON or photon catalysis preparations. Finally, we show that our optimizer is orders of magnitude faster than other methods in the literature, opening the door for solving linear optical problems involving more modes and photons.
Read the full abstract

Applied Physics

Wave-based reading of mechanical memory in multistable mass-in-mass metamaterials

Mechanical metamaterials with integrated bistable elements have emerged as promising platforms for mechanical information storage, where transitions between stable states encode information as mechanical bits. While it has been shown that information can be written into such metamaterials by applying global inputs, existing readout strategies rely predominantly on visual inspection. Here, we experimentally demonstrate a mass-in-mass bistable metamaterial with state-dependent stiffness that enables both writing and reading of mechanical information using only boundary-applied dynamic excitations. We further show that such metamaterial architecture functions as both a mechanical sensor of input amplitude and a reconfigurable wave-control device. Together, these results highlight the versatility of bistable metamaterials as multifunctional platforms that integrate mechanical memory, sensing, and adaptive wave manipulation.
Read the full abstract

All authors Audrey Watkins, Giovanni Bordiga, Vincent Tournat, Katia Bertoldi

Econometrics

Median-based Splitting Rules for Causal Trees and Forests

Heavy-tailed and skewed outcomes are common in the randomized experiments and observational studies used to estimate heterogeneous treatment effects, yet the mean-squared-error criterion that guides splitting in honest causal trees is sensitive to the extreme values they generate. Building on the causal forest framework (Athey and Imbens, 2016; Wager and Athey, 2018), we introduce the Median Squared Deviation (MSD) criterion, which replaces the leafwise difference in means in the honest splitting objective with the Hodges–Lehmann location estimator while leaving honest leaf estimation and forest inference unchanged. Two further median-based rules, the Median Absolute Deviation (MAD) and the Least Median of Squares (LMS), serve as robust baselines. We evaluate the criteria in a simulation study covering precision, bias, and confidence interval coverage. MSD restricts its robustness to split selection and lowers the error of conditional average treatment effect estimates under heavy-tailed and skewed outcomes. Further, we re-visit two empirical applications: the first analyzes the electoral effects of a Mexican conditional cash transfer program on precinct-level observations, while the second application studies antiretroviral treatments in HIV-positive adults.
Read the full abstract

Combinatorics

Spectrum of Johnson graphs

In this paper we prove new bounds on the second eigenvalue of Johnson graphs. We then apply these bounds to obtain new results on the modularity of Johnson graphs and their random subgraphs, hamiltonicity of Johnson graphs and thresholds of the appearance of the hamilton cycles and giant components. Futhermore, we provide general bounds on vertex connectivity and the stability of the modularity for $(n, d, \lambda)$-graphs.
Read the full abstract

Lattice Field Theory

Gauge field digitization in the Hamiltonian limit

Quantum computers can circumvent the numerical sign problem in gauge theories at finite density or in real time. Quantum simulations of gauge theories require a finite-dimensional representation of continuous gauge fields. Replacing a continuous gauge group by a finite subgroup can substantially reduce the required quantum resources, but introduces digitization errors that must be controlled in the Hamiltonian, or continuous-time, limit. Previous studies, using the isotropic Euclidean lattices showed that the freezing transition of the discrete subgroup can make it a bad approximation for the continuous group at large Euclidean couplings. Here, we study the digitization of U(1) by its Z($N$) subgroups in 2+1 dimensions using anisotropic Euclidean lattices. We derive the trajectories of the spatial and temporal gauge couplings along which the Hamiltonian limit is approached at fixed Hamiltonian coupling. While the temporal coupling exhibits power-law scaling in the continuous U(1) theory, it grows only logarithmically for finite Z($N$). Using classical lattice simulations and exact diagonalization, we verify that these trajectories reproduce the corresponding Hamiltonian theories. We find that the freezing transition persists in the Hamiltonian limit of discrete gauge groups and that finite-$N$ theories can differ substantially from U(1) even outside the frozen regime, in contrast to the behavior on isotropic Euclidean lattices, where for small couplings, the discrete group provides a very accurate approximation of the continuous group. Our results provide a classical benchmark for quantifying the systematic errors due to gauge-field digitization in quantum simulations.
Read the full abstract

Differential Geometry

Minimal surfaces in $\mathbb{H}^2\times\mathbb{R}$ with finite total curvature and embedded ends

In this paper we study the global geometry and classification of complete minimal surfaces with embedded ends and finite total curvature in the product space $\mathbb{H}^2 \times \mathbb{R}$. We describe the structure of embedded ends of such surfaces, constraining the combinatorics of their asymptotic polygons at infinity. Focusing on small total curvature values, we establish a complete classification of the possible asymptotic boundaries for embedded minimal surfaces with total curvature $-4\pi$ and $-6\pi$. In the $-4\pi$ case, we prove the surface is either a horizontal catenoid or simply-connected, with asymptotic boundary belonging to one of four explicit configurations. In the $-6\pi$ case, we show that any embedded example must be simply-connected and classify its possible ideal boundaries. We further construct, via an asymptotic Plateau problem solved by area-minimizing surfaces and successive Schwarz reflections, new 1- and 2-parameter families of (possibly non-embedded) simply-connected minimal surfaces with total curvature $-6\pi$ (and, more generally, $-2(2k-1)\pi$) whose ends are embedded and realize asymptotic configurations not previously known to occur.
Read the full abstract

Computer Vision

Are Image Generators Zero-Shot Perceivers? A Rigorous Evaluation

Recent work, such as Vision Banana, shows that lightweight instruction tuning can enable an image generator to achieve state-of-the-art performance across multiple visual perception tasks. Motivated by this perspective, we ask how far image generators can go on public visual perception benchmarks in a zero-shot setting. We introduce ProbeGen, a benchmark for zero-shot generative perception that casts monocular depth estimation, referring/reasoning segmentation, and object counting as conditional generation tasks specified through text prompts, and compares 20 models in total—including proprietary and open-weight image generators, specialist perception models, and MLLMs—across 11 published benchmarks. We observe that pretrained image generators show measurable zero-shot perceptual competence, but with a clear trade-off: specialist models remain stronger for in-distribution accuracy and efficiency, while generative models are often more robust under distribution shift and better at compositional semantic reasoning. We hope this study helps establish zero-shot generative perception as a meaningful research direction and provides a useful foundation for future work at the intersection of visual generation and understanding.
Read the full abstract

Computation and Language

Deadline-Aware Adaptive Prefill Chunking for Efficient Large Language Model Serving

Continuous batching improves large language model (LLM) serving throughput, but long prompt prefills can delay decode iterations and violate inter-token latency objectives. Chunked prefill mitigates this interference, yet its chunk size is normally fixed: small chunks protect decode latency but repeatedly pay launch overhead, while large chunks improve prefill efficiency but create latency spikes. We introduce SLOWeave, an online scheduling method that selects the largest prefill chunk predicted to finish before the earliest active decode deadline. The decision requires no workload-specific chunk-size tuning and is computed by a logarithmic-time search over a monotone iteration-cost model. We prove that, whenever a decode-only iteration is feasible and the cost predictor is accurate, SLOWeave maximizes immediate prefill progress among decisions that preserve every active request's next-token deadline. We evaluate the method in a reproducible event-driven simulator and an iteration-level GPU runtime across chat, mixed-context, long-context, and bursty workloads. Under a 25ms time-per-output-token objective, SLOWeave improves goodput over the strongest fixed-chunk baseline by 39% on mixed requests and 38% on long-context requests. Under a stricter 10ms objective, the gains rise to 3.3$\times$ and 2.4$\times$, respectively. These results isolate adaptive chunk sizing as a useful serving primitive and provide an implementation-ready controller for integration with iteration-level LLM runtimes.
Read the full abstract

All authors Siyu Song, Qi Bai, Jinbo Hao, Kai Li, Chenchen Wang, Jiayu Sun

Numerical Analysis

LoCCA: Localized Chebyshev Cross Approximation for Kernel Matrix Factorization via Nodal Perturbation Stability

We propose Local Chebyshev Cross-Approximation (LoCCA), a data-driven framework that bridges smooth polynomial interpolation with flexible matrix factorizations. LoCCA dynamically maps ideal grid nodes to their nearest physical neighbors within unstructured point sets. We support this framework with a new perturbation theory, proving that displacing Chebyshev nodes onto physical data points retains mathematical stability and accuracy without explosive error growth. Numerically, LoCCA provides strict, reliable error control even on irregular geometries where standard grid-based methods fail, achieving substantial speedups and near-optimal matrix compression.
Read the full abstract