Cryptography and Security
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 7 September
Providers of continuously produced, commercially valuable data – sensor streams, telemetry, and other feeds sold as machine-learning training material – cannot observe whether delivered data is actually used, while data that keeps flowing to inactive consumers enlarges the leakage surface without producing value. We present Attestream, a blockchain-based architecture for intermittently delivered dataset streams that couples continued delivery to verifiable usage reporting. Every lifecycle event – dataset preparation, dual-signed delivery, derivative creation (e.g., a model), and derivative distribution – is appended to an on-chain registry as a non-repudiable, mutually linked lifecycle record. The mechanism requires provable transfer, not tokenization: plain contract storage, ERC-721 tokens, and anchored off-chain receipts are interchangeable representations of the same protocol. A usage-aware gate suspends a consumer's stream when no derivative-creation record is registered within a reporting window; evaluated lazily inside the next delivery transaction, monitoring adds no dedicated transactions. A modality-pluggable fingerprinting layer binds any leaked copy to the dual-signed delivery record of the responsible consumer, instantiated for tabular/geospatial records, images, and documents. We implement the registry as a Solidity contract with EIP-712 dual signatures and evaluate it: a full lifecycle round costs 657k gas with plain records ($0.13 on rollups; ERC-721 tokenization adds ~30k gas per record), and over a 50-consumer pool leak attribution reaches 100% from 40 leaked table rows under moderate noise, survives JPEG recompression to quality 30, and tolerates paraphrase rates up to 30% for documents.
Solar and Stellar Astrophysics
Amplification of active region equatorial dipole
The effect of active region parameters on the evolution of solar axial dipole is well understood. However, their effect on the solar equatorial dipole has not been studied in detail. Understanding the development of the equatorial dipole is important as it drives the interplanetary magnetic field on intracyclic timescales (~ 1yr). We study how the latitude, tilt angle, and the polarity separation affect the evolution of solar equatorial dipole. We use dipole flux transport (DFT), a matrix implementation of surface flux transport (SFT) model, to simulate the dipole evolution of synthetic bipolar magnetic regions (BMRs) with a wide range of tilt angles and latitudes. We also study the evolution of active regions in HMI SHARP database and their associated BMRs. We quantify the dipole evolution by means of the maximum and mean amplification and the growth and decay times of the equatorial dipole. Tilt angle controls the amplification of the equatorial dipole, with larger tilt angles leading to stronger equatorial dipole. Latitude controls the timescale at which the equatorial dipole grows and decays. Low-latitude regions produce the longest living equatorial dipole. We find that only 31% of anti-Joy regions experience amplification of equatorial dipole, compared with 96 of regularly tilted active regions. Latitudes and tilt angles of active regions can have considerable effect on the solar equatorial dipole. Systematic changes in their properties could increase/decrease the strength of the equatorial dipole relative to the solar activity, which could lead to similar relative change in geomagnetic activity. We suggest that large low-latitude coronal holes and relatively high geomagnetic activity in the declining phase of solar cycle 20, could be related to emergence of unusually low-latitude active regions that produced strong and persistent equatorial dipole.
Read the full abstract
Number Theory
Residual finiteness and cuspidal cohomology of Picard modular surfaces
We prove that, for every non-uniform arithmetic lattice in $\mathrm{SU}(2,1)$, its inverse images in the universal cover and in all connected finite covers are residually finite. The key new input is that every commensurability class of such lattices contains a congruence arithmetic lattice $\Gamma$ for which $$H^1_{\mathrm{cusp}}(\Gamma\backslash\mathbb B^2,\mathbb C)\ne 0.$$ In particular, the first inner cohomology of this ball quotient is non-zero. The proof uses Rogawski's endoscopic classification for $\mathrm{U}(3)$. A cohomological criterion proved previously by the author then gives the residual-finiteness result. Residual finiteness also yields multiplier systems of arbitrary denominator on suitable finite-index subgroups.
Read the full abstract
Computation and Language
The Art of Hierarchical Competing Patterns: Gaussian Process Optimization of Hyphenation
Hyphenation patterns remain a compact and widely deployed solution for word breaking in typesetting systems, text processors, and web rendering engines, but their generation still depends on manually tuned patgen program parameter profiles. We formulate patgen profile selection as a black-box hyperparameter optimization problem and evaluate Gaussian-process Bayesian optimization for this task. The search objective combines a precision-oriented F_{1/7}-score with an explicit trie size-accuracy trade-off using a normalized trie-size penalty. We evaluate the method on 17 hyphenated word-list datasets covering 14 languages and multiple scripts. Against two strong hand-tuned profiles regenerated from the same 8/10 training split and evaluated on the same 1/10 held-out test split, the GP-optimized profiles improve F_{1/7} on 16 of 17 datasets and reduce trie size on all 17. The median optimized/baseline trie ratio is 0.407. A dataset-level sign test gives p = 1.37e-4; a separate budget-matched comparison on five representative datasets shows that systematic search is competitive and usually improves over the best hand-tuned profile under the fixed comparison objective. The results show that model-based optimization can make pattern generation more reproducible and less dependent on expert trial-and-error while keeping the accuracy-compactness trade-off explicit.
Read the full abstract
Computers and Society
Near-Term Verification Methods for AI Chip Exports
AI chip export controls can help the United States shape the development of frontier AI, but their effectiveness depends on reliable methods for verifying compliance. This paper examines near-term verification mechanisms (implementable in approximately one year) and groups them into three categories: end-location verification (whether controlled chips remain in authorized locations and/or jurisdictions), end-user verification (whether entities that acquire or access compute are legitimate), and end-use verification (whether computing power is used for prohibited purposes). We discuss how each mechanism can be implemented within the regulatory framework of the U.S. Bureau of Industry and Security (BIS), outlining implementation steps and identifying which actors can perform verification (BIS, exporters, or accredited third-party auditors). Given BIS's resource constraints, the most viable mechanisms rely on private-sector actors working alongside BIS, leverage existing technologies, and scale without requiring large increases in government staffing. These mechanisms could also help monitor future international agreements on AI.
Read the full abstract
Combinatorics
Real-rootedness of the $Z$-polynomials of sparse paving matroids and strict interlacing for uniform matroids
We prove that the $Z$-polynomial of every sparse paving matroid has only negative real zeros, confirming the real-rootedness conjecture of Proudfoot, Xu, and Young for this class. We also prove that, for each fixed positive corank, the $Z$-polynomials of uniform matroids in consecutive ranks strictly interlace. Our approach is to prove real-rootedness of the corresponding $\gamma$-polynomials for sparse paving matroids and their strict interlacing for uniform matroids, and then transfer both properties to the corresponding $Z$-polynomials.
Read the full abstract
Astrophysics of Galaxies
A new clump-based star formation model for galaxy simulations: implications for high-redshift compact star clusters
We develop a new star formation model for galaxy simulations in which star-forming gas clumps are identified on-the-fly and converted into stars with an efficiency $\epsilon_{\rm SF}$ set by the clump surface density $\Sigma_{\rm c}$, calibrated against radiation hydrodynamics simulations of star cluster formation. Applying this model to isolated disc galaxies embedded in haloes of $M_{\rm h}=10^{9}$, $10^{10}$ and $10^{11}\,\mathrm{M_\odot}$, with disc compactness corresponding to redshift $z=0$–$10$, we find that more compact discs form more massive and denser clumps. The maximum clump mass increases from $\sim 10^{5}$ to $\sim 10^{7}\,\mathrm{M_\odot}$, and the fraction of clumps exceeding the surface density of $300\,\mathrm{M_\odot\,pc^{-2}}$ rises from $0.25$ to $0.38$ between $z=0$ and $10$ in $10^{10}\,\mathrm{M_\odot}$ haloes. Star formation becomes correspondingly bursty, and the global star formation efficiency after three disc rotations increases from $5 \times 10^{-3}$ to $2 \times 10^{-1}$ in $10^{10}\,\mathrm{M_\odot}$ haloes and from $2 \times 10^{-2}$ to $4 \times 10^{-1}$ in $10^{11}\,\mathrm{M_\odot}$ haloes as the redshift increases from $z=0$ to $10$. The accompanying feedback disrupts the gas discs of the most compact systems, while prominent stellar spiral arms emerge. Self-gravitationally bound star clusters form only in compact discs. We find no bound star clusters at $z \leq 2$ in $10^{10}\,\mathrm{M_\odot}$ haloes, whereas the bound cluster mass fraction reaches $\approx 40$ per cent at $z \geq 8$ and $\approx 70$ per cent in the most compact $10^{11}\,\mathrm{M_\odot}$ halo. These fractions are broadly consistent with those inferred for high-$z$ clumpy galaxies observed by the James Webb Space Telescope.
Read the full abstract
Quantum Physics
Benchmarking dynamical-structure-factor protocols in programmable neutral-atom geometries
The dynamical structure factor is a central observable in condensed-matter physics, providing direct insight into the excitation spectrum and dynamical response of quantum materials. While it is traditionally accessed in real materials through inelastic neutron scattering, recent works have shown that analogous information can be extracted in quantum simulators using suitable dynamical protocols. So far, these approaches have been demonstrated mainly in paradigmatic integrable one-dimensional models. In this work, we use numerical emulations of a neutral-atom quantum processing unit to assess the feasibility of measuring the dynamical structure factor in a broader class of Ising-like spin systems. Beyond the standard one-dimensional transverse-field Ising chain, we benchmark the protocol in chains with dimerized interactions and in the two-dimensional transverse-field Ising model, where spectral properties are difficult to access with classical numerical methods at large scales. We further analyze the robustness of the protocol under realistic experimental conditions, including finite simulation times, pulse modulation, positional disorder, and laser noise. Our results show that neutral-atom quantum simulators can provide a practical route to probing dynamical response functions in regimes where classical simulations become increasingly demanding, paving the way toward experimental implementation.
Read the full abstract
Econometrics
Robust A/B Decisions
A/B tests are standard in firm decision making. In the standard pipeline, experimental data is converted to a deployment decision by applying a t-test of the difference in means (the lift) and deploying the treatment if lift is positive and statistically significant. This common workflow answers the wrong question. We argue that firms need a decision rule for economic payoffs in the future deployment environment, not a test of equality in the experimental sample. We develop an ambiguity-averse decision framework in which each arm is evaluated by its ambiguity-penalized value over distributions close to the experimental outcome distribution. The resulting rule has a simple closed form thanks to the Donsker-Varadhan representation and it requires only the outcome data from a standard A/B test plus one interpretable parameter governing trust in the experiment. Our rule is thus no more difficult to implement than a t-test. A mean-variance approximation shows how the rule penalizes variability, while a connection to utility maximization shows it to be a certainty equivalent. We are able to perform a real-world evaluation of our proposed rule in the context of digital marketing using an archive of 552 advertising experiments from an anonymous US-based online platform. The proposed rule substantially reduces regret relative to conventional hypothesis testing. The results show that economically conservative, distribution-aware deployment rules can outperform statistical-significance rules in digital experimentation.
Read the full abstract
Other Condensed Matter
General solution of the Dirac equation for electrons bound by a charged atomic chain
The system of electrons bound by a charged atom chain is studied within the Dirac theory. The general analytical solution of the Dirac equation is obtained. Analytical expression for electron energy is derived from which it follows that the principal quantum number can be introduced for electron states in such a system, similar to the case of a hydrogen atom. We prove that electrons bound by the atomic chain, are fully collectivized and the energy can be calculated as a function of the occupation number. The spectral band with the principal quantum number $n$ is shown to be split into $n$ subbands forming the fine structure. The scale of the fine structure splitting is calculated.
Read the full abstract
Statistics Applications
Structural Analysis of a Dynamic Multilayer Network via Matrix Autoregressive Models: A Case Study of International Interactions between Countries
Dynamic and multilayer networks have been widely studied separately, but their joint analysis remains comparatively underdeveloped. Because the relational information of a dynamic multilayer network can be represented as a tensor at each time point $t$, each layer can be summarized through a set of structural statistics, yielding a matrix-valued observation and, consequently, a matrix-valued time series. To exploit this structure, we propose the use of matrix autoregressive (MAR) models, which simultaneously characterize temporal dependence across relational layers and structural statistics. We apply this framework to the ICEWS dataset, which records international interactions among countries under four relational domains and therefore naturally defines a dynamic multilayer network. The results indicate that negative verbal interactions (Verbal-) play a prominent role in the subsequent structural reconfiguration of the material-interaction layers, while mean strength exhibits the strongest temporal persistence and reciprocity the broadest cross-statistic influence. These findings illustrate the usefulness of MAR models for providing a parsimonious and interpretable characterization of temporal and cross-layer dependence in dynamic multilayer networks.
Read the full abstract
High Energy Astrophysical Phenomena
A cosmic-ray database update: CRDB v4.2
The cosmic-ray database, CRDB, has provided data and meta-data to the community since 2013. We present a new release, CRDB v4.2, which includes data and time series published in the last three years (from AMS-02, CALET, DAMPE, LHAASO, etc.), datasets missed in previous releases, and all peer-reviewed ultra-high energy cosmic-ray data (both historical and recent datasets). These data and meta-data are available from the web interface or from the CRDB pip-installable Python library. This release includes results from more than 60 experiments and publications, corresponding to 4534 new data points and 131624 time-series data points.
Read the full abstract
Information Retrieval
Open Tabular Insight Extraction: Where Do We Stand, and Where Should We Go?
Democratizing access to the knowledge held in large corpora of tables such as data lakes is emerging as a central research challenge. Research in this space is advancing and broadening in scope, increasingly supplying the components to satisfy a person's insight need end-to-end. Yet these efforts remain fragmented across communities that frame the problem under their own conventions, such as table question answering, text-to-SQL, and data analysis agents, with works six times as likely to cite within the same task label as across labels. To bring these communities onto common ground, we establish a holistic framework for this pursuit, which we refer to as Open Tabular Insight Extraction (OpenTI). We formalize OpenTI from first principles around the analytical knowledge a person needs, the procedure for deriving it from a corpus of tables, and how well a result serves the person who sought it. In doing so we consolidate frameworks and terminology across information retrieval, natural language processing, machine learning, databases, and human-computer interaction, and apply this grounding in a systematic review and analysis of systems and benchmarks that work towards OpenTI. We find that current systems do not cover the end-to-end scope of OpenTI, mainly focusing on the analysis itself, and that benchmarks are largely unfit for evaluations in an open setting as inputs presuppose knowledge of tables, and validation mechanisms do not match the setup. Finally, we distill a research agenda towards OpenTI systems, evaluation, and interaction paradigms that surface the insights users need. An interactive companion to our paper is available at https://open-tabular-insight-extraction.github.io.
Read the full abstract
Differential Geometry
Geometric finiteness in paracomplex hyperbolic spaces
We develop a framework for studying discrete subgroups of $\mathsf{PGL}(d+1,\mathbb{R})$ via the paracomplex hyperbolic space $\mathbb{H}_\tau^d$, a rank-$1$ pseudo-Riemannian symmetric space. We characterize projective transverse, relatively Anosov, and Anosov subgroups in terms of properly discontinuous, geometrically finite, and convex-cocompact actions respectively on their weak hulls, which are canonical flow spaces in the spacelike unit tangent bundle of $\mathbb{H}_\tau^d$. A key ingredient is the construction of a Busemann-type horofunction on the spacelike unit tangent bundle with the properties needed to describe cuspidal geometry. We further prove for relatively Anosov subgroups that the geodesic flows on their weak hulls are uniformly hyperbolic, giving a relative analogue of the Axiom A property.
Read the full abstract
Artificial Intelligence
Norms at a Price: Why RL-Based Alignment Can Promise Conditional Compliance at Best
AI agents sometimes act aligned when they infer they are being tested, and differently when not. We argue this is not an anomaly but what current training regimes are structured to select for. Reinforcement-learning-based alignment folds norms and task pursuit into one policy: the system learns its norms from scored behavior, and scoring flattens them. Do not do X is learned as doing X costs something if noticed. On every datum training can produce, a policy that complies only when it might be observed is indistinguishable from one that complies always. The experiment that would tell them apart - scoring unobserved behavior - is a contradiction in terms. Conditional compliance is thus the most that behavioral training can be known to deliver. Agency sharpens the problem: agents operate mostly where no one is watching, and can act on whether they are watched. An iterated pipeline that trains against detected failures selects for passing detection, not for complying. This account unifies alignment faking, sandbagging, and evaluation-aware scheming. And it reorients the remedy: not deeper internalization but architecture, making violations unavailable rather than unchosen.
Read the full abstract
Category Theory
Crossed-module crossed braided categories
For a crossed module $\chi: G \to H$, we introduce the notion of $\chi$-crossed braided (resp. ribbon) categories, where the categories are graded by group $G$ and carry an $H$-action. Our definition unifies and generalises several familiar notions: taking $\chi = id: G \to G$ with the conjugation action recovers $G$-crossed braided categories; taking $\chi: G \to \{*\}$ for abelian $G$ yields $G$-graded braided categories; taking $\chi: \{*\} \to G$ leads to braided categories equipped with a $G$-action. The equivalence relation between $\chi$-crossed braided categories is typically finer than that between $G$-crossed braided ones. We classify $\chi$-crossed braided structures on the category of $G$-graded vector spaces in terms of cohomological data, and give explicit examples for cyclic groups. Given a doubly central algebra with $G$- and $H$-actions in a braided monoidal category, we define a notion of twisted-local modules and show how they give rise to $\chi$-crossed braided categories. We furthermore give sufficient conditions so that these categories are additionally $\chi$-crossed ribbon or admit an orthogonal $G$-decomposition.
Read the full abstract
Image and Video Processing
Computer vision enabled oxygen sensing
Luminescence-based chemical sensors are almost universally read as point detectors with the signal inverted through a single calibration model. Here we reframe optical oxygen sensing as a computer vision problem, in which the sensing film acts as a spatially heterogeneous encoder and a pretrained Temporal Vision Transformer (TViT) as its decoder. The heterogeneity in film thickness, diffusion path length and illumination translate to pixels that provide complementary information on the underlying diffusion dynamics. We achieved up to 54% lower mean absolute error (MAE) by increasing the internal diversity in performance of a pixel group; a gain that linear models cannot reproduce. Using a low-cost platform comprising a Raspberry Pi camera, a UV LED and a porous PtOEP/polystyrene film in tandem with a TViT architecture yielded an MAE of ~6.7 {\mu}mol/L, a 96% reduction from the two-site Stern-Volmer (SV) model. We showed that this framework can computationally mitigate the fundamental trade-off between mechanical robustness and temporal response in diffusion limited oxygen sensing by reducing T90 response times by 91%, while exhibiting physically plausible dynamics under a Rauch-Tung-Striebel smoother (2.3% flag rate). The framework was applied across setups, environments and biofilm states, establishing an IoT-compatible paradigm for computationally compensated diffusion-limited chemical sensing.
Read the full abstract
Neurons and Cognition
Fisher Information Metric as a model-free measure of proximity to criticality in neural systems
Critical phenomena are widespread across many disciplines and have recently become a topic of deep interest in the study of biological and artificial neural networks. A distinct signature of criticality is the emergence of avalanches with power-law-distributed sizes and durations. However, empirically estimating the critical exponents remains challenging, and their interpretation is often model-dependent. In this work, we demonstrate how the Fisher Information Metric (FIM), a measure of generalized susceptibility, provides a comprehensive, model-agnostic characterization of the critical region in neural systems. We validate this approach across models of increasing biological complexity, from prototypical branching processes to spiking and whole-brain models, showing that FIM of each model's control parameter reliably tracks the system's degree of criticality. To emulate the study of real-world systems, where the control parameter is unknown, we additionally calculate FIM of the observed branching ratio of neural activity. The resulting FIM peaks where activity growth and decay balance, with the peak sharpening as the system approaches criticality. Hence, FIM peak width and height yield continuous, model-free readouts of proximity to criticality without requiring knowledge of the true control parameter, offering a robust tool for probing criticality in neural systems.
Read the full abstract
Cryptography and Security
Privacy Leakage from a Thousand Words: Millipixel Location Recovery from Dot Maps
Dot maps, which visualize individual data points as dots over a geographic region, are widely used across diverse domains to represent spatial patterns in sensitive data. However, the understanding of the privacy risks associated with dot maps remains limited, particularly for maps covering large geographic areas. In this paper, we systematically analyze these risks and present AutoLocate, an automated framework for high-precision location recovery. At its core, AutoLocate exploits anti-aliasing artifacts introduced during map rendering, which inadvertently encode sub-pixel information about dot locations. AutoLocate formulates location recovery as a black-box optimization problem, iteratively refining estimated coordinates by minimizing perceptual discrepancies over these artifacts between the target map and rendered candidate maps. Extensive experiments on both real-world and synthetic datasets, across different attack scenarios and a broad range of map configurations (e.g., map scale, background, resolution), demonstrate the effectiveness of AutoLocate. In particular, it achieves average recovery errors as low as 1 meter (approximately 0.0002 pixel precision) on small-scale maps of the United States, over 200x more accurate than existing approaches. We also propose mitigation strategies and introduce a privacy risk assessment tool to help practitioners evaluate and reduce privacy leakage when publishing dot maps.
Read the full abstract
Probability
On the stationary measures of the critical Ornstein–Uhlenbeck process
We study linear and symmetric diffusion processes on $\mathbb{R}^{\mathbb{Z}^d}$ that can be seen as the Langevin dynamics of the (inhomogeneous) harmonic crystal for given conductances, with a particular focus on their stationary distributions. Despite the linearity of the interaction, we exhibit a rich variety of behaviours, depending on the disorder encoded by the conductances. Our main results provide essentially sharp criteria on the conductances ensuring that every stationary measure is reversible. We also provide examples for which these criteria fail and where either no stationary measures exist or reversible and non-reversible stationary measures coexist. Additionally, we show that the linear system can even exhibit non-trivial time-periodic behaviour and provide a spectral characterisation of the occurrence of such oscillations. The case of deterministic conductances is complemented by a study of the case of random conductances under quite general moment assumptions.
Read the full abstract
Probability
The randomly oriented Manhattan lattice in 2D is transient
Independently orient each horizontal and vertical line of $\mathbb{Z}^2$ by a fair coin. A walker chooses one of the two lines through its current position with equal probability and takes one step in the direction of that line. Redner (1989) introduced this walk as a model of transport in an isotropic random velocity field and predicted that its root-mean-square displacement grows like $n^{2/3}$. We prove that the walk is transient almost surely. The proof is a short variational argument.
Read the full abstract
Statistical Mechanics
Microcanonical Hamiltonian Monte Carlo and the Helmholtz Theorem
The recently proposed Microcanonical Hamiltonian Monte Carlo algorithm has not yet been studied in detail from a thermodynamic point of view; this work aims to fill that gap. We demonstrate how thermodynamical state variables and potentials can be derived and thereby demonstrate that the construction of the algorithm formally represents a microcanonical thermodynamic ensemble. In particular, we demonstrate (analytically and numerically) that the algorithm fulfils the Helmholtz theorem, an alternative formulation of the first law of thermodynamics. Furthermore, we construct a new sampling algorithm that extends the original to lower-dimensional inference problems. Finally, we argue that canonical Markov Chain Monte Carlo algorithms are more natural than Microcanonical Hamiltonian Monte Carlo from the thermodynamic and information-theoretic point of view.
Read the full abstract
Systems and Control
Data-driven estimation of design heating loads for HVAC equipment sizing
Oversized heating and cooling equipment can unnecessarily increase up-front costs, energy costs, pollutant emissions, and strain on electrical infrastructure. This paper develops two data-driven methods for estimating heating loads at design conditions to improve equipment sizing. One method uses smart thermostat data; the other uses utility bills. We test the methods on a dataset that we gathered from 74 detached single-family houses in five United States climate zones. The dataset includes smart thermostat time-series data, monthly utility bills, weather data, existing equipment specifications, and Manual J design load calculations (the United States industry standard) purchased from practitioners. The two methods have strong goodness-of-fit statistics individually and show fair agreement with each other. On average over the 74 houses, existing heating equipment is 2.75 (2.5th to 97.5th empirical percentile: 1.34-6.52) times larger than the thermostat-method estimate and 2.96 (1.36-7.76 times larger than the bill-method estimate. As implemented by practitioners, the Manual J estimate is 2.26 (0.87-5.21) times larger on average than the thermostat-method estimate and 2.35 (1.02-5.28) times larger than the bill-method estimate. We discuss prospects for implementing the data-driven methods at scale and for incorporating data-driven sizing into industry standards.
Read the full abstract
Systems and Control
Decentralized Safe Multi-Agent Reinforcement Learning via Predictive Shielding
Environments are increasingly populated by multiple robots performing independent tasks with limited prior knowledge of each other. Deploying such multi-agent systems presents significant challenges. Specifically, shifts in deployment states compared to training data can lead to poor policy performance and compromised safety. While safety shields exist to mitigate these risks, they are typically reactive, which degrades performance near unseen obstacles,and centralized, limiting their scalability. To address this, we propose a decentralized framework that integrates predictive shielding with model-based finite horizon Q-learning. This approach allows agents to safely adapt their pre-trained policies during deployment. Furthermore, to mitigate livelocks in symmetric scenarios, we introduce a communication- free protocol for conflict resolution
Read the full abstract
Machine Learning
Forecasting the Winner of a Live Tennis Match
With the rise of live sports betting in recent years, tennis forecasting has expanded from pre-match prediction to models that update win probabilities as a match unfolds. A central challenge in creating such a model is the constant need for models to adapt to score and performance changes. This study examines how pre-match and live information can be most effectively integrated into a model to produce accurate win-probability estimates. The analysis uses 8,222 Grand Slam matches containing a total of 1,505,355 points. Five models were evaluated using a chronological split, with matches from 2011-2021 used for training, 2022 for validation, and 2023-2024 for testing. Trace, a hybrid model, achieved accuracies of 76.06%, 82.15%, and 88.34% at 25%, 50%, and 75% match progress, suggesting that hybrid modeling is a practical approach to live tennis forecasting.
Read the full abstract
Other Condensed Matter
Topological Edge States and Collective Radiation in a One-Dimensional Atomic Chain
We investigate the topological and collective radiative properties of a one-dimensional diatomic chain of identical quantum emitters with alternating spacing, coupled to the electromagnetic vacuum. The system realizes an extended, non-Hermitian Su-Schrieffer-Heeger-type model with vacuum-mediated long-range interactions and collective dissipation. We focus on the single-excitation manifold, where the dynamics are described by an effective Hamiltonian. For an infinite chain, the complex band structure reveals subradiant modes associated with wave vectors outside the light line, as well as parameter regimes where real-part band crossings occur. The bulk topology is characterized by a complex Berry phase, which remains quantized in the presence of inversion symmetry and a spectral gap. For finite chains, using exact diagonalization, we identify superradiant, subradiant, and edge states with distinct decay rates and spatial profiles. Edge states emerge in the topologically nontrivial regime when a bulk gap in the real part of the energy spectrum is present, while subradiant states exhibit strongly suppressed decay with system-size dependence. Finally, we analyze the far-field radiation patterns associated with different classes of eigenstates and show that the emission characteristics reflect the decay properties, spatial localization, and the parity of the unit-cell amplitudes.
Read the full abstract
Commutative Algebra
A Counterexample to the Huneke-Wiegand Conjecture
We construct a symmetric numerical semigroup $\Gamma$ of multiplicity $56$, embedding dimension $26$, and Frobenius number $181$ such that, over every field $k$, the one-dimensional Gorenstein local domain $R=k[t^\Gamma]_{\mathfrak{m}}$ has a nonprincipal ideal $I=(t^{56},t^{70})R$ for which $I\otimes_R\operatorname{Hom}_R(I,R)$ is torsion-free. This gives a counterexample to the Huneke-Wiegand conjecture in its general Gorenstein formulation. The proof reduces to an explicit finite sumset identity, interpreted through the Huneke-Iyengar-Wiegand colon criterion and Leamer's tensor-torsion formula. We also identify the tensor product with the trace ideal of $I$, compute $\operatorname{End}_R(I)=R[t^{101},t^{107}]$ and its conductor, and show that the counterexample persists under completion. A separate graded tensor-graph calculation and exact, standard-library Python verifiers accompany the paper. We explain how the example differs from the field-extension construction of Christensen, Gerko, and Iyengar.
Read the full abstract
Cryptography and Security
Construction and Natural Language Querying of a Cybersecurity Knowledge Graph
Cybersecurity vulnerability information is distributed across numerous platforms and databases, making it difficult for researchers and practitioners to obtain a unified and structured understanding of existing threats. This is a critical issue in cybersecurity, where timely access to accurate vulnerability information directly impacts risk assessment and decision-making. While previous work has shown that knowledge graphs are effective for organizing vulnerability data, a major research gap remains in their accessibility, as querying such graphs typically requires expertise in graph query languages like Cypher. This paper aims to address this gap by proposing an approach that combines the construction of a cybersecurity knowledge graph with natural language-based interrogation. The proposed methodology relies on data collected from the National Vulnerability Database (NVD)(1) through its REST API and models vulnerabilities, products, vendors, severity metrics, weaknesses, and references using the Labeled Property Graph paradigm in Neo4j. The knowledge graph is deployed on Neo4j Aura Cloud and queried through an AI-assisted interface that translates natural language queries into Cypher language. The key contribution of this work is demonstrating that natural language querying significantly lowers the barrier to interacting with cybersecurity knowledge graphs, enabling more intuitive exploration and analysis of vulnerability data, and thereby enhancing their practical usefulness for a broader range of users in the cybersecurity field.
Read the full abstract
Quantum Physics
Experimental realization of quantum-computing-enhanced sensing
Quantum algorithms offer computational advantages, yet incorporating them into quantum sensing and converting these advantages into enhanced information acquisition remains challenging. Here, we realize quantum-computing-enhanced sensing in a spin-oscillator architecture, where a microwave cavity provides a high-dimensional quantum register and a coupled superconducting qubit serves as the sensor. The unknown signal directly generates the phase oracle operation, establishing a natural physical interface between quantum computation and sensing. We experimentally demonstrate the first Grover search in a bosonic mode and observe quantum amplitude amplification in a Hilbert space spanning more than 128 photons. For the same number of sensing iterations, our protocol extracts more information and resolves more frequency candidates than classical sequential search. Our results establish signal-driven oracles as a route for harnessing oracle-based quantum algorithms and realizing quantum-computing-enhanced sensing.
Read the full abstract
High Energy Physics (Theory)
Exact spin form factors and correlations at a massive Kramers-Wannier interface
We determine exact finite-volume spin form factors and two-point correlations for a massive Kramer–Wannier interface in the scaling Ising model, separating ordered and disordered phases. The interface admits two complementary lattice realizations: a self-dual inhomogeneous Ising chain whose continuum limit has a sign-changing Majorana mass profile, and, after exchanging Euclidean space and time, a mixed thermal average amenable to Toeplitz/Fredholm methods. Combining these descriptions, we obtain the exact Neveu-Schwarz-Ramond spin matrix elements and a factorized Fredholm determinant for the interface correlator. Defect TCSA and independent fermionic spin-chain calculations confirm the predicted spectrum and matrix elements.