Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Wednesday 9 September

Quantum Physics

Optimal Low-Rank Quantum State Tomography with Bounded-Sample Joint Measurements

We determine the optimal sample complexity of low-rank quantum state tomography when each measurement may act jointly on at most $t$ samples. For sufficiently small $\varepsilon$, estimating an unknown state on $\mathbb{C}^d$ of rank at most $r$ to trace norm error $\varepsilon$ with constant success probability requires, and is achievable with, $$\Theta\left(\frac{dr}{\varepsilon^2}\mathop{\mathrm{max}}\left\{1,\frac{r}{\sqrt{t}}\right\}\right)$$ samples. The lower bound allows the protocol to choose each joint measurement adaptively using all previous classical outcomes; the matching upper bound is nonadaptive. Thus joint measurements on at most $t$ samples improve the complexity of algorithms making single-sample measurements by at most a factor $\sqrt{t}$. Further, measuring order $r^2$ samples jointly is necessary and sufficient to attain the unrestricted collective rate. For the lower bound, we vary the support of a state with fixed uniform spectrum and bound the Fisher information trace of every joint measurement on $t$ samples. The adaptive Fisher chain rule and the van Trees inequality then give the trace norm lower bound. For the upper bound, we construct and analyze a nonadaptive tomography protocol based on a Gaussian joint measurement. An explicit second moment identity and a conditional Gaussian law outside the state's support give a rank-dependent error analysis, yielding the matching rate.
Read the full abstract

Combinatorics

Unimodality shenanigans in Ehrhart theory

We construct counterexamples to a four-decade-old conjecture attributed to Stanley concerning the unimodality of $h^*$-polynomials of IDP polytopes. As additional applications of our main constructions, we also disprove a conjecture by Brenti on the log-concavity of $h^*$-polynomials of Gorenstein IDP polytopes, and a conjecture by Ferroni and Higashitani concerning the log-concavity of the Ehrhart series of IDP polytopes. We also answer their question about the existence of very ample polytopes with non-log-concave interior Ehrhart series. Our class of examples arises by taking Cayley sums of rectangular prisms, and hence they possess regular unimodular flag triangulations by a result of Haase, Paffenholz, Piechnik and Santos. Remarkably, for the unimodality conjecture we can even find smooth counterexamples.
Read the full abstract

Exactly Solvable and Integrable Systems

Rogue-like waves from collision of mKdV solitons

Interactions of two solitary waves having an up and a down orientation in the modified Korteweg-de Vries equation are shown to produce rogue-like waves. For waves that asymptotically vanish, the maximum ratio between the net peak-to-trough height of the interaction profile and the height of the tallest incoming wave is 2.41 when the waves have approximately equal speeds, and this ratio decreases to 2 when the speed ratio is 2.25. For waves that approach a non-zero constant at infinity, the same ratio is always greater than 2.41 and reaches a maximum of 2.65 when the speed ratio of the waves is 6.32.
Read the full abstract

Mesoscale and Nanoscale Physics

Hydrodynamic magnetotransport in a GaAs Corbino geometry

We report the observation of positive magnetoresistance in high-mobility GaAs Corbino devices. Over a broad intermediate-temperature range, the resistance exhibits a quadratic dependence on perpendicular magnetic field. We analyze the data within hydrodynamic theories of magnetotransport in the Corbino geometry, which describe the crossover between the diffusive and viscous regimes, including finite-slip boundary conditions appropriate for current-penetrable contacts. The extracted relaxation rates are consistent with an approximately $T^2$ temperature dependence of the electron-electron scattering contribution. The extracted viscous relaxation parameters are consistent with those obtained from Hall-bar measurements. Comparison with theory indicates that the observed magnetoresistance is predominantly governed by the bulk hydrodynamic response, while finite slip modifies the Stokes–Ohm crossover quantitatively and the field-dependent boundary voltage provides a separate correction. These results show that Corbino magnetotransport can serve as a complementary bulk-sensitive probe of viscous electron flow.
Read the full abstract

All authors A. D. Levin, A. S. Jaroshevich, Z. D. Kvon, V. A. Chitta, M. S. Aksenov, D. V. Dmitriev, A. K. Bakarov, G. M. Gusev

Quantum Physics

Phase transitions in first-detection statistics of monitored long-range quantum walks

In a quantum walk, the first-detection return probability (FDRP) characterizes salient features, determining whether the quantum walk is transient or recurrent. We study the FDRP of quantum walks on a chain where the initial site is stroboscopically monitored by a detector and the walker performs long-range hopping between sites. We assume that the hopping strength decays with the distance $d$ as $d^{-\alpha}$ and $\alpha\geq 0$ and show that the power-law exponent $\alpha$ critically determines the behavior of the FDRP. The value $\alpha=1$ separates recurrent ($\alpha<1$) from transient ($\alpha>1$) quantum walks through a continuous phase transition in the total detection probability. For $\alpha<1$, strong long-range hopping induces localization, resulting in unit total detection probability. Instead, for $\alpha>1$ the long-range walk is transient and the return probability decays algebraically as a function of time as $t^{-\beta}$. The associated decay exponent $\beta$ features nonanalytic points as a function of $\alpha$. Such singularities are not exclusively determined by the low-energy spectrum, but are caused by the interference between infrared and ultraviolet energy modes induced by projective measurements, signalling the emergence of critical behavior intrinsic to the non-unitary dynamics. These dynamics are solely controlled by tuning the long-range exponent $\alpha$ and can thus be experimentally probed in atomic and molecular systems.
Read the full abstract

All authors Sayan Roy, Shamik Gupta, Giovanna Morigi, Gabriele Perfetto

Distributed Computing

Avatar: Toward Autonomous End-to-End Orchestration of Scientific Workflows using LLMs

Scientific workflow management (WMSs) systems automate execution, yet orchestrate using fixed, hand-tuned rules. LLM agents promise more autonomous orchestration, but it remains unclear where to introduce agentic reasoning, how to bound its risk, and when it actually helps. We present Avatar, an actor-based architecture comprising an orchestrator, an executor, and a provenance monitor. Each actor's decision policy is pluggable (rule-based or LLM-backed) via a single adapter-validated action catalog, so conventional and agentic control run on the same core across different WMSs. We present an implementation using the Academy framework and evaluate Avatar across three workloads. We observe that Avatar's rule mode reproduces native execution, with a single unchanged core running all three. Moreover, LLM-backed Avatar reports a reduction of compute wastage by $55\%$ and cuts GPU-busy time by $40\%$. Overall, we envision Avatar as a step toward workflow systems that reason about their own orchestration rather than follow pre-fixed rules.
Read the full abstract

All authors Suman Raj, Hai Duc Nguyen, Haochen Pan, Ryan Chard, Kyle Chard, Ian Foster

Quantum Physics

Information Causality Characterizes the Set of Quantum Correlations in the Simplest Bell Scenario

Information causality (IC) was introduced as a physical principle constraining correlations in non-signaling theories. Whether it can recover the exact quantum correlation boundary, beyond Uffink's inequality, has remained an open question. Here, we combine its generalized formulation for correlated inputs with a new communication protocol to derive quantum Bell inequalities that exactly characterize the quantum correlations in the simplest bipartite Bell scenario, with two binary measurements. In particular, we derive the Tsirelson-Landau-Masanes criterion directly from IC. Thus, the generalized IC implies macroscopic locality, while we also present macroscopically local correlations that violate the generalized IC. This establishes that generalized IC is a strictly stronger principle in this scenario. Together with our earlier result that generalized IC implies a nontrivial communication complexity principle, these findings strengthen the role of information causality in explaining the limits of quantum nonlocality and provide a systematic route to deriving tighter bounds on the set of quantum correlations in more general Bell scenarios.
Read the full abstract

Earth and Planetary Astrophysics

A Candidate Innermost Fifth Planet In the HR 8799 System Revealed By JWST NIRISS Aperture Masking Interferometry

We detect a candidate fifth planet in the HR 8799 system, directly imaged with the JWST/NIRISS Aperture Masking Interferometer (AMI). The detected source lies just above a $3\sigma$ contrast curve at a contrast of $\sim2\times10^{-4}$ in the F380M filter at a projected separation of $\sim150$ mas, corresponding to a few-to-several Jupiter mass planet at an orbital radius of $\sim 7$au. The separation of the candidate is compatible with absolute proper-motion constraints from Gaia and Hipparcos assuming it is bound, while its orbital position lies near a stable orbital solution of a fifth planet in a 3:1 mean motion resonance with planet e. This detection was made possible by a new JWST/NIRISS AMI data pipeline that reaches the photon noise limited potential of AMI by accounting for the optical and electronic systematics that limited sensitivity in prior analyses. Confirmation of this candidate would make HR 8799 the first directly imaged five-planet system and provide insight into the orbital dynamics and the dynamical evolution of planetary systems with widely-separated gas giants.
Read the full abstract

All authors Jayke S. Nguyen, Louis Desdoigts, Alexandra Z. Greenbaum, Benjamin J. S. Pope, Max Charles, Quinn M. Konopacky, Kaitlyn Hessel, Dori Blakely, Matthew De Furio, Clarissa R. Do Ó, René Doyon, Doug Johnstone, Jens Kammerer, David Lafrenière, Bruce A. Macintosh, Michael R. Meyer, Eric L. Nielsen, Anne E. Peck, William Roberson, Anand Sivaramakrishnan, Peter Tuthill, Thomas Vandal, Marie Ygouf

Robotics

DUET-DINO: Simultaneous Cross-View World Modeling for Latent Planning in Robot Manipulation

Action-conditioned latent world models predict future visual representations, enabling zero-shot goal-conditioned robot planning and control. However, their predictions for fine-grained spatial and rotational actions are unreliable for full 7-DoF end-effector control. To address this gap, we introduce DUET-DINO, a simultaneous cross-view latent world model that jointly learns action-conditioned predictions from static side- and wrist-camera observations through cross-view conditioning. By exploiting complementary global scene and gripper-centric information, DUET-DINO enables latent planning over the full 7-DoF action space. Across spatially diverse reach, orientation-intensive angled-reach, and multi-goal grasp-and-lift tasks, DUET-DINO consistently outperforms single-view and independent dual-view baselines, achieving 92% success on reach, 72.5% on angled-reach, and 60.0% on lift tasks. DUET-DINO is trained from scratch on DROID and RoboArena datasets and generalizes robustly under visual distribution shifts. We further show that while V-JEPA 2 wrist-view predictions underestimate visual dynamics induced by fine-grained actions, DINOv3 predictions better capture action-conditioned scene changes, leading to stronger downstream planning. The code and model checkpoints will be open-sourced. Project page: https://utn-air.github.io/DUET-DINO
Read the full abstract

All authors Nisarga Nilavadi, Ralf Römer, Moritz Reuss, Michael Krawez, Tobias Jülg, Angela P. Schoellig, Rudolf Lioutikov, Wolfram Burgard

Machine Learning

Quantum Feature Engineering for Credit Default Prediction: When and Why IQP Circuits Help Linear Classifiers

Credit default prediction is a tabular classification problem in which modest gains in F1 translate directly into reduced financial exposure. We ask whether Instantaneous Quantum Polynomial-time (IQP) circuits can produce features that improve a classifier over both its raw classical baseline and Kernel PCA - the strongest unsupervised classical non-linear alternative - at an equal feature budget. The dataset provides 23 financial attributes per client; for an n-qubit circuit we select n of them, encode each as a rotation angle, and read 2n expectation values back out as new features. The motivation for using a quantum circuit is computational: an n-qubit IQP circuit runs in constant depth and encodes feature correlations in a 2^n-dimensional Hilbert space, whereas classical simulation of its exact output statistics scales exponentially in n. Using the UCI Default of Credit Card Clients dataset and five-fold cross-validation, we find that appending 16 IQP features (n = 8 qubits) to a Logistic Regression model raises F1 from 0.462 to 0.517 (+0.055, p < 0.0001). Kernel PCA, the next-best method, reaches only 0.493 at the same feature count; the gap survives Benjamini-Hochberg correction across 12 tests (p = 0.00007). No other classifier - Random Forest, SVM, XGBoost, or k-NN - benefits, which points to a linear-expressivity mechanism rather than a generic improvement. We also show that how the 8 input features are chosen matters: Random Forest importance-guided selection reaches F1 = 0.523, while encoding maximally uncorrelated features drops it to 0.496, demonstrating that the circuit amplifies informative structure rather than creating it from scratch.
Read the full abstract

All authors Menachem Finkelstein, Diana Legziel Levy, Zohar Yakhini, Sarel Cohen

High Energy Physics (Phenomenology)

Can Elastic Neutrino Scattering Account for the LZ230616 Event?

Recently, the LUX-ZEPLIN (LZ) Collaboration reported an isolated nuclear-recoil event at $248\pm 23_\mathrm{stat}\pm 23_\mathrm{syst}~\mathrm{keV_{nr}}$, in a region where the expected background is very small and conventional elastic dark matter (DM)-nucleus scattering cannot readily account for such a localized feature. We investigate whether LZ230616 could instead originate from coherent elastic neutrino-nucleus scattering (CE$\nu$NS). We consider neutrino-nucleus interactions within and beyond the Standard Model, together with exotic neutrino fluxes from DM annihilation ($\chi \chi \to \nu \bar{\nu}$) or decay ($\chi \to \nu \bar{\nu}$) into neutrino pairs and from primordial black hole (PBH) evaporation. We show that kinematic considerations, the accompanying low energy recoil spectrum, and existing constraints exclude a viable interpretation of LZ230616 in terms of elastic neutrino-nucleus scattering for all scenarios considered.
Read the full abstract

All authors Ayan Chattaraj, Anirban Majumdar, Dimitrios K. Papoulias, Rahul Srivastava

Computational Geometry

iLogMap: Geodesic Polar Coordinates Parameterization with the Magnetic Laplacian

Geodesic polar coordinates (GPCs) provide an intrinsic parameterization over curved surfaces, but their accurate estimation remains challenging, particularly in the presence of anisotropic metrics, high curvature and complex topology. We introduce iLogMap, a method for computing GPCs in curved domains that recasts the angular component of the logarithmic map to a ground-state magnetic eigenproblem over the circumferential direction field of geodesic distance. Our method effortlessly extends to anisotropic metric tensors and solid volumes, enabling cylindrical and spherical parameterizations in tetrahedral meshes. Experiments on diverse shapes with varying genus confirm competitive angular accuracy and reduced metric distortion relative to heat-based methods, with improved performance on surfaces with boundary and domains with anisotropy. We demonstrate the utility of iLogMap in computational cardiology applications, where we use it to initialize spiral phases on atrial surfaces and estimate local activation patterns in ventricular models.
Read the full abstract

Cryptography and Security

Wicked Problem, Parsimonious Solution: Securing Electric Vehicle Charging Station Software

Electric vehicle charging infrastructure presents a suite of novel cyber-physical threats. Among this infrastructure, charging stations are the most vulnerable elements. The software in the charging station supply equipment is particularly vulnerable. Currently, the software is an attack surface that is largely unprotected and poorly characterized. To represent the vulnerabilities in this attack surface, we advocate for applying modern software quality assurance to characterize vulnerabilities in electric vehicle charging station software. Specifically, we advocate for the application of hierarchical software quality assurance (HSQA) to specialized electric vehicle charging station software. HSQA provides a comprehensive view of the code quality and security – from the level of individual vulnerabilities (e.g., CVEs) to high level characteristics (e.g., CIA Triad). HSQA incorporates quality and security considerations throughout the software development lifecycle. Thus, our position is that HSQA is an excellent approach for assessing electrical vehicle charging station software.
Read the full abstract

All authors Emma Sheppard, Zachary Wadhams, Dalton Arford, Clemente Izurieta, Ann Marie Reinhold

Category Theory

Noetherian forms of free non-symmetric operads

In this paper, we study certain categories of labeled finite rooted ordered trees over a fixed set of labels where each label is equipped with an arity: a fixed number of children that the vertex with the given label must have. Equivalently, these are expression trees for operations in a free non-symmetric operad. A morphism between these trees matches a pruning of one tree (a prefix) with an entire subtree of another (a suffix). We characterize such categories, up to isomorphism, in terms of suitable exactness properties. It turns out that these categories exhibit strong algebraic behavior, in the sense that every such category, when appended with a strict initial object, has a particularly nice noetherian form.
Read the full abstract

Mesoscale and Nanoscale Physics

Phonon-Bottleneck-Governed Ultrafast Hot-Carrier Super-Diffusion in Transition Metal Dichalcogenides

Two-dimensional transition metal dichalcogenides (TMDCs) are promising for low-power optoelectronics, yet their operational speed is widely considered constrained by low room-temperature mobilities and carrier transit delays. Here, by combining on-chip terahertz optoelectronic sampling with thermally evaporated Ohmic contacts, we eliminate external parasitic delays and directly capture the intrinsic interfacial photoresponse in unencapsulated TMDCs under zero bias. The devices achieve ultrafast relaxation lifetimes of 48.5 ps in MoS2/Au and 14.2 ps in MoSe2/Ag, translating to intrinsic 3-dB bandwidths of 4.4 GHz and 7.5 GHz, respectively. Spatial scanning and bias-dependent measurements show that this response is position-independent and bias-immune, ruling out conventional drift-limited transport and identifying hot-carrier super-diffusion driven by an interfacial electron temperature gradient as the operative mechanism. Furthermore, ultrafast pump-probe spectroscopy reveals that the macroscopic response time is quantitatively synchronized with the microscopic optical-to-acoustic phonon scattering lifetime governed by the intrinsic phonon bottleneck. Our findings establish phonon engineering as a viable paradigm to tailor non-equilibrium optoelectronic dynamics, offering a blueprint for zero-bias, ultrafast, self-powered devices.
Read the full abstract

All authors Yuwei Zhang, Dongyang Wan, Tao Zhou, Hao Wu, Junpeng Lu, Zhenhua Ni

Theoretical Economics

Monitoring Hierarchies in Knowledge Production

We study peer monitoring design in knowledge production. A principal leads agents who work on different but related tasks. By working on their own tasks, agents acquire information that is useful for evaluating their peers' performance. We consider robust contracts under which effort by all agents is the unique rationalizable outcome. The optimal contract induces a hierarchy of monitoring authority: agents easier for the principal to monitor directly are assigned greater authority to evaluate other agents. Task diversity improves information value but weakens peer monitoring. This tension distorts optimal public task assignment toward the principal's core expertise. Confidential random assignment relaxes this distortion by decoupling information production from the perceived monitoring structure.
Read the full abstract

Computer Vision

Field Converter: Geometry-Initialized Temporal Residual Refinement for World-Grounded Player Pose Estimation from Soccer Broadcasts

Recovering 3D human pose from monocular sports broadcasts remains challenging when players must be localized in a shared metric world coordinate system rather than only reconstructed relative to their own body. We introduce Field Converter, a geometry-initialized temporal residual framework for world-grounded 3D player pose estimation from calibrated soccer broadcasts. Our method first uses camera and pitch geometry to initialize the player root through ray-ground intersection, then predicts a temporal residual correction from pose, image, camera, and geometric cues. On match-disjoint evaluation sequences, residual refinement reduces root error from 49cm with geometry alone to 14cm with a frame-wise MLP and 10cm with a TCN, while a Transformer achieves a comparable 11cm. The resulting world-space MPJPE reaches 13.2cm, and ablations show that residual prediction clearly outperforms direct global-root regression while temporal context matters more than the specific temporal backbone. Failure analysis further identifies airborne motion as the main limitation of the ground-based geometric initialization.
Read the full abstract

All authors Simon Khan, Laurent Gajny, Jennyfer Lecompte, Sébastien Laporte

Fluid Dynamics

Dynamic Reduced-Order Data Assimilation from Sparse Velocity Measurements

We present a novel reduced-order data assimilation framework, termed Reduced-Order Dynamical Assimilation (RODAS), for reconstructing high-resolution, time-resolved flow fields from sparse velocity measurements. The method combines low-dimensional experimental observations with a physics-based parametric reduced-order model, enabling both spatial extrapolation beyond the measurement region and temporal super-resolution. The approach first identifies the dominant dynamics from sparse measurements through Dynamic Mode Decomposition (DMD), and subsequently reconstructs the corresponding full-order flow evolution by projecting the identified dynamics onto a parametric Proper Orthogonal Decomposition (POD) manifold generated from high-fidelity numerical simulations. Unlike conventional reduced-order data assimilation methods that estimate independent snapshots or treat time as an additional parameter, RODAS reconstructs an entire dynamical trajectory in a single inference step while naturally incorporating parametric variability. We assess the proposed methodology on vortex shedding behind a circular cylinder for both Newtonian and non-Newtonian (Carreau-Yasuda) fluids. Numerical experiments demonstrate accurate reconstruction of high-resolution velocity fields from localized, low-resolution measurements, achieving sub-percent reconstruction errors with sufficiently rich reduced bases, robust performance under severe temporal undersampling, and accurate prediction of engineering quantities of interest such as the drag coefficient. These results demonstrate that RODAS provides an efficient framework for real-time, physics-informed reconstruction of unsteady flows from sparse experimental data.
Read the full abstract

All authors Mauricio Portilla, Felipe Galarce, Ernesto Castillo, Benjamin Herrmann

Data Structures and Algorithms

Testing the Binary Rank with Polynomial Query Complexity

We design an adaptive two-sided error testing algorithm for the binary rank of a $0,1$ matrix $M$ with query complexity $O(d^3\log(d+1)/\epsilon^2)$, where $d$ is the tested binary rank bound and $\epsilon$ is the distance parameter. This answers an open question posed by Parnas, Ron and Shraibman~\cite{parnas2021property}, who asked if the binary rank can be tested with query complexity polynomial in $d$ and $1/\epsilon$. Furthermore, our testing algorithm can be used to find an approximate binary decomposition of $M$ with an additional $d(n+m)$ queries. That is, under the promise that the binary rank of $M$ is at most $d$, we show how to find, with probability at least $5/6$, two $0,1$ matrices $A',B'$ such that $M' = A' \cdot B'$ is a $0,1$ matrix which differs from $M$ on at most an $O(\epsilon)$ fraction of its entries. Our results also imply a testing algorithm with polynomial query complexity for the equivalent problem of testing if the edges of a bipartite graph can be partitioned into at most $d$ bicliques.
Read the full abstract

Computer Vision

Cross-Model Agreement as a Deployment-Time Reliability Signal for Automatic Polyp Segmentation

In real-time colonoscopy, ground-truth annotations are unavailable at inference, so polyp segmentation models can fail silently. We propose Referee-Based Quality Estimation (RBQE), a reference-free framework measuring agreement between a primary segmentation model and an independently trained referee on the same image. RBQE is evaluated on a standardized 1,223-image external benchmark drawn from four public datasets, using four referee configurations chosen to separate two design axes: referee independence and architectural diversity. Using a common Agreement Dice descriptor, a same-architecture referee differing from the primary model only in random initialization already yields a useful reliability signal (ROC-AUC = 0.923), showing that independent training alone is sufficient. Cross-architecture referees improve further: SegFormer-B0 achieves the strongest performance (ROC-AUC = 0.960), significantly outperforming the same-architecture control and UNet++, and exceeding a representative Test-Time Augmentation baseline by 0.055 ROC-AUC under an identical protocol, whereas a prompt-coupled MedSAM referee underperforms despite maximal architectural diversity. Because empty-mask agreement is trivially separable, we also report a restricted evaluation excluding such cases: ROC-AUC falls to 0.876 (SegFormer-B0, 1,046 images) and 0.783 (same-architecture control, 975 images), yet RBQE's margin over both baselines widens on this identical subset. RBQE additionally increases the mean Dice of retained predictions as low-agreement cases are progressively rejected, supporting selective prediction, and requires only one additional deterministic referee forward pass at inference. Our study therefore supports cross-model agreement as a practical, interpretable reliability framework for automated polyp segmentation.
Read the full abstract

Computation and Language

IBIB: A Protocol for Measuring Enterprise AI Systems by Serving Route, Not Model Identifier

Enterprises deploy systems, not checkpoints. Usable capability depends jointly on weights, serving route, precision, output contract, and harness, yet all 18 audited benchmarks score advertised model identifiers. We treat this as measurement error and give a protocol that makes it reportable. It has three parts. A gold-blind capability-binding preflight verifies that a route can execute the evaluation contract before any task reaches it; a reliability-inclusive first-pass scoring rule keeps failure in the score while keeping unsupported capability out; and adjudication is structurally score-blind. We call the protocol IB2 and release its algorithms, classification tables, request contract, and manifest schemas. Its reference instantiation, 128 locked tasks and 987 assertions over document, spreadsheet, chart, tool and database work, stays sealed: the procedure is the artifact, not the corpus. Across eleven systems, four results. Capability availability is measurable: two complete single-route runs on identical weights later failed distinct predicates of the finalized binding gate, while a third passed that gate before a fresh run. The advertised identifier exposed neither limit. Discrimination is not uniform: four of seven suites saturate under a six-system band, with the spread almost entirely from governed database work and multi-tab joins, so we report interval-backed resolution groups, not ranks; two of the nominal five-label output's four cuts fail multiplicity adjustment. Serving-arm choice moved one declared revision and precision from 77.38 to 82.54, paired interval [0.11,10.60], though the arms differ in access mode, harness generation, and the serving tool-call parser, and harness generation is a property of our evaluator, not any endpoint. Excluding failed responses from denominators changes the point ordering, so reliability inclusion changes a conclusion, not its wording.
Read the full abstract

Game Theory

Non-Existence of PMMS Allocations and a $4/3$-PMMS Guarantee for Additive Chores

We study pairwise maximin share (PMMS) fairness for indivisible items with additive preferences. We give a polynomial-time reduction from chores to goods that preserves the existence of a PMMS allocation. Together with known nonexistence results for chores, this yields nonexistence for additive goods. In addition, we show that deciding if a given instance admits a PMMS allocation is NP-hard. We also give explicit instances whose PMMS factors are $226/227$ for goods and $1.102065$ for chores, certified by exact enumeration. Complementing these impossibility results, we prove that every additive-chore instance admits a $4/3$-PMMS allocation.
Read the full abstract

All authors Xiaohui Bei, Zehan Lin, Shengxin Liu, Rong Luan, Biaoshuai Tao

Combinatorics

The Distribution of Double Deficiencies in Pattern-Avoiding Permutations

We study the distribution of the number of double deficiencies (DD) in permutations of length n avoiding one or two patterns of length 3. Using structural decompositions of these avoidance classes–together with a lattice-path decomposition in the 321-avoiding case–we derive functional equations and convolution-type recurrences that efficiently compute the corresponding double-deficiency generating functions in all but one single-pattern case. In the 321-avoiding permutations, the resulting generating function is algebraic; we derive exact formulas for the mean and variance and prove that the distribution is close in total variation to Bin(n-2,1/4), with an explicit convergence rate. We also identify a DD-preserving symmetry that yields DD-Wilf equivalences, reducing the number of two-pattern cases that need to be considered separately. For the resulting two-pattern classes, we obtain explicit recurrences, including C-finite relations.
Read the full abstract

High Energy Physics (Phenomenology)

Inelastic Dark Matter and High-Energy Recoil Signatures in LZ

We study the inelastic dark matter (iDM) that consists of two-component dark matter particles $(\chi_1,\chi_2)$ and serves as a minimal extension beyond the commonly used one-component DM models. A distinctive feature of such iDM scattering with the target nuclei is to favorably produce signals at high nuclear recoil (NR) energy region in both exothermic and endothermic processes. In particular, for the exothermic dark matter scenario, the signal does not rely on the tail of the Boltzmann velocity distribution. As a result, the required DM-nucleus scattering cross section is significantly reduced, which in turn helps to substantially relax the stringent constraints imposed by IceCube neutrino searches. Using the inelastic DM-nucleus scattering, we naturally explain the newly reported event excess at high recoil energy with the LUX-ZEPLIN (LZ) experiment.
Read the full abstract

All authors Zi-Tong Fan, Hong-Jian He, Yu-Chen Wang, Yue Zhao

Machine Learning

Learning with Covariance Matrices: Principal Component Analysis Meets Learning with Graphs

This feature article provides an overview of the theoretical foundations for coVariance neural networks (VNNs), i.e., graph neural networks (GNNs) operating on covariance matrices as graphs. Covariance matrices are ubiquitous across domains, and hence, the deployment of GNNs often leverages graphs of pairwise statistical dependencies. Existing theoretical contributions on GNNs consider abstract graph representations and cannot accommodate the data-driven nuances associated with covariance matrices. This tutorial brings into focus various novel theoretical insights via mathematical analyses of VNNs that have broad signal processing implications, including: (i) a conceptual equivalence between VNNs and principal component analysis (PCA)-based information processing; (ii) refined stability bounds on predictive outcomes in the presence of finite sample-induced covariance matrix perturbations; and (iii) refined characterization of transferability of VNNs across multiscale datasets. The theoretical insights discussed herein provide the underlying principles and justification towards adopting VNNs over workhorse PCA-based learning pipelines, in applications where covariance matrices are useful descriptors of data structure. We also convey how impact of these foundational advances permeates to principled designs and applications of learning methods across broad domains where covariance matrices emerge. Notably, we elucidate the conceptual insights facilitated by VNNs to the specific task of characterizing brain age gap for neurodegenerative conditions using neuroimaging datasets, a timely problem in computational neuroscience. Broader impacts to other application domains are discussed as well.
Read the full abstract

All authors Saurabh Sihag, Andrea Cavallo, Elvin Isufi, Gonzalo Mateos, Alejandro Ribeiro

Computer Vision

Artificial Intelligence Literacy and Sustainable Development: An Ethical Governance and Development Goals Framework

AI literacy provides foundational competencies that support ethical, transparent, and sustainable technological development, although higher-order capabilities such as governance, critical evaluation, and strategic decision-making extend beyond basic literacy into advanced levels of AI competency. This study positions AI literacy as a governance capacity that complements and strengthens all 17 SDGs. It introduces a six-level taxonomy of artificial intelligence reasoning and ethics that extends traditional learning models by incorporating ethical judgement and strategic foresight. This taxonomy forms the foundation of an integrated framework linking education, governance, and sustainable development. A survey of 300 participants from diverse professional backgrounds within a national context which reveals strong technical awareness but limited ethical and governance readiness, highlighting critical gaps in public capacity to manage artificial intelligence responsibly. Findings show that ethical reasoning and reflective thinking are the strongest predictors of sustainable and trustworthy artificial intelligence use. The study proposed to embed literacy-based competencies into curricula, institutional policies, and governance mechanisms to accelerate equitable and responsible progress toward sustainable development goals
Read the full abstract

Algebraic Geometry

Difference Equations and Reconstruction of Local Gopakumar-Vafa Spectra for Threefold Flops

We study difference equations for the local Gromov-Witten theory of a contractible rational curve in a Calabi-Yau threefold from the viewpoint of reconstruction. Starting from the Bryan-Katz-Leung multiple cover decomposition, we associate to all nonzero local GV degree sectors on an exceptional ray a single central difference forcing term governed by explicit Fejér-type Laurent kernels. Our main result is an information equivalence theorem: once the exceptional ray and its lattice normalization are fixed, the full quantum forcing, its regular specialization at $\lambda=0$, and the local genus zero Gopakumar-Vafa spectrum determine one another. In particular, every local GV multiplicity is recovered from the classical forcing by an explicit Möbius inversion. In the primitive normalization relevant to a simple flopping contraction, the same classical forcing also recovers the noncommutative and commutative widths of the contraction algebra: the former is the order at $q=1$ of the exponentiated forcing and the latter is its first $q$-coefficient. For finite support we further determine the minimal Laurent polynomial denominator clearing operator on the finest common shift lattice. Its cyclotomic factorization is strictly coarser than the GV spectrum. Length two, $E_6$, $E_7$, and $E_8$ examples exhibit the resulting hierarchy of information loss: Kollár length does not determine the forcing, the cyclotomic skeleton does not determine the GV support, and even the complete local difference data do not determine the analytic type of the flop.
Read the full abstract

Functional Analysis

Nonmaximal sums of maximally monotone operators under Rockafellar's constraint qualification

We construct counterexamples to Rockafellar's sum conjecture in which two maximally monotone operators satisfy the interior-domain condition but their sum is not maximally monotone, thereby providing the complete disproof of the conjecture. We establish a general construction theorem that computes the entire monotone polar of a class of graphs and characterizes their maximal monotonicity by the nonexistence of solutions to explicit equations in the continuous dual. We also prove a pullback theorem that transfers counterexamples through bounded linear surjections. These theorems provide a systematic mechanism for generating entire families of counterexamples and lead to further structural consequences for the resulting operators. Specifically, we obtain four classes of counterexample families: weighted constructions with different curves, first operators with prescribed affine value dimensions, second operators obtained by positive rescaling and norm-continuous monotone perturbation with full domain, and counterexamples on further Banach spaces. The last class yields counterexamples on every Banach space containing a closed subspace isomorphic to $c_0$ or $\ell^1$, or admitting such a quotient. We also give explicit constructions on $c_0$ and standard $\ell^1$ that realize the construction and pullback mechanisms, respectively. We further determine the domain geometry and exact radial bounds of the constructed operators, characterize reflexivity by a fixed rank-one test in two classical classes of Banach spaces, identify maximal monotone extensions under surjective pullback, and compute exact Fitzpatrick identities. The appendices further extend these constructions to additional parameter and product families, nonlinear scalar and strictly monotone second operators, normal-cone and subdifferential partners, and examples with prescribed radial bounds, and more counterexample families.
Read the full abstract

Quantum Physics

Faster Quantum Monte Carlo Simulation by Random Compilation

Quantum Monte Carlo (QMC) algorithms are among the most powerful classical methods for simulating quantum systems, yet their accuracy is often limited by the systematic errors in the approximations used, such as Trotterization. Here we introduce randomly compiled quantum Monte Carlo (RC-QMC) as a general framework that suppresses these systematic errors by averaging over a family of approximations rather than relying on a single fixed one. This strategy is grounded in the concept of randomized compiling from quantum computing, which suppresses errors by sampling over quantum gates, at essentially no additional computational cost. Consequently, our framework achieves a computational advantage over standard QMC methods when estimating a target state to a desired level of accuracy. We illustrate this advantage on two key Monte Carlo algorithms: (1) path integral quantum Monte Carlo for estimating thermal states, and (2) the quantum trajectories method for simulating open system dynamics. In aggregate, these results represent a cross-fertilization of quantum and classical algorithms, are readily generalizable to other QMC methods, and suggest wider applications in classical simulation.
Read the full abstract

All authors John M. Martyn, Joshua Lin, Neill C. Warrington, Isaac L. Chuang, Andrew J. Daley

Metric Geometry

Box dimension prints

We study lower and upper box dimension prints for bounded subsets of \(\mathbb R^n\), defined by weighted covering numbers for independently oriented rectangular boxes with prescribed ordered side-length bounds. The limits range over all eccentricities, including unbounded aspect ratios. For every non-empty bounded set, we identify the closure of the lower print with the intersection of the half-spaces determined by its lower eccentricity profile, without any uniformity assumption. The profile equals the support function of this closure if and only if it is subadditive. A planar product example has distinct lower and upper profiles on every ray and an explicitly computable lower-print closure. We also prove that both prints are invariant under nonsingular projective transformations on compact sets avoiding the pole hyperplane. Uniform anisotropic covering estimates determine both prints, including their boundary points, for non-degenerate curves of type \((1,\ldots,n)\), their Ahlfors regular parameter subsets, and higher-dimensional spheres. Finally, local covering-count and product-measure criteria identify the lower box print with the Hausdorff dimension print, while a reciprocal-sequence example shows that this inclusion can be strict.
Read the full abstract