Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Thursday 10 September

Computational Geometry

Some results on Archdeacon's conjecture for rotation systems

A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.
Read the full abstract

Classical Analysis and ODEs

Liouville regular Jordan curves

We investigate Liouville regular Jordan curves, which were introduced in our previous paper as "Jordan curves that admit continuous Legendrian lifts". We prove that a Jordan curve satisfying certain variation conditions in a neighborhood of each point is Liouville regular. We also prove that the boundary of a Jordan domain is Liouville regular if the images of the radial tails under a conformal mapping have uniformly vanishing length. Together with our previous result, these criteria show that each such Jordan curve admits an inscribed rectangle in every prescribed similarity class.
Read the full abstract

Differential Geometry

Non-trivial ABC-Massey products on complex parallelisable solvmanifolds

Triple Aeppli–Bott–Chern–Massey products, shortly, triple ABC-Massey products are higher-order operations on the Bott–Chern and Aeppli cohomologies of a compact complex manifold, and their non-vanishing is an invariant of its pluripotential homotopy type. We prove that every non-Abelian complex unimodular solvable Lie algebra admits a non-vanishing triple ABC–Massey product, and we deduce that so does every compact complex parallelisable solvmanifold.
Read the full abstract

Cryptography and Security

From Intent to Execution Grant: An Execution-Boundary Conformance Profile for High-Risk AI Actions

AI agents increasingly propose actions with external consequences, including financial transfers, infrastructure changes, software deployments, disclosures, and physical actuation. Authorization engines, policy languages, runtime monitors, provenance mechanisms, and agent guardrails provide important foundations, but do not necessarily define a common semantic contract for the final transition from a particular candidate action to execution authority. We specify EBL-Core, an execution-boundary conformance profile for deciding whether one canonical, fully materialized AI-generated candidate may receive action-scoped execution authority under explicit conditions. It binds a structured intent object, Root and Operational Policies, evidence obligations, typed evidence, context, time, and a verifiable Decision Derivation through an Execution Release Contract (ERC). An ERC is not an authority-bearing token; a verified ALLOW ERC may support a separate Execution Grant governed by Redemption-time validation. EBL-Core specifies action binding, policy non-weakening, evidence handling, deterministic adjudication, derivation verification, and grant lifecycle behavior. An accompanying reference artifact provides schemas, adjudication, separate verification and Semantic Replay, and a linearizable in-memory grant store. In the retained run, 34 static vectors and 15 lifecycle checks matched expected outcomes. Across 100 trials, 32 concurrent Redemption attempts yielded exactly one successful Redemption and protected test effect per trial; 100 Revoke-Redeem races ended in valid terminal outcomes. These bounded results demonstrate executability of the specified subset, not human-intent correctness, evidence truth, complete mediation, production readiness, mechanized correctness, or deployment-level security.
Read the full abstract

All authors Mengting Wu, Lin Wang, Yong Zhang, Jiang Deng

Quantum Physics

Dissipative Quantum Battery from Many-Body Scars

We propose an autonomous quantum-battery protocol based on dissipatively selected quantum many-body scars. Using an embedding-type spin chain with an exact scar tower and a generalized interacting $J_1$–$J_2$ chain, we show that engineered local bond dissipation can drive the system from a passive state into a high-energy scar-supported manifold with large extractable work. The resulting charged states exhibit single-copy ergotropy close to the entropy-matched thermodynamic work bound while retaining the coherent structure associated with the scar ladder. Because the ideal scar manifold also supports nondecaying peripheral modes, we introduce weak local dephasing to obtain a stable charging protocol and find a broad regime in which the charging time is reduced without substantially degrading the stored work. Finally, an explicit scar-breaking perturbation produces a correlated loss of scar support and extractable work, demonstrating that the favorable battery performance is tied to the nonthermal scar structure rather than merely to the preparation of a generic excited state. Our results establish dissipatively stabilized many-body scars as a promising resource for autonomous and robust quantum energy storage.
Read the full abstract

All authors Jinglin Liu, Yiming Liu, Mingdi Xu, Lei Pan

Instrumentation and Methods for Astrophysics

Towards First Light for MICADO: Validation of the PSF-R service with real data

MICADO, one of the ELT first-light instruments, will rely on point-spread-function reconstruction (PSF-R) to meet scientific requirements, especially for SCAO observations of targets that lack bright reference stars nearby. PSF-R will be performed in post-processing using only AO telemetry, recorded simultaneously with the science data. For SCAO observations, both on- and off-axis PSFs will be delivered. We present the current status and results from an ESO TTR campaign begun in 2023, targeting a sparse three-star asterism under varying conditions with the ERIS instrument at VLT. Reconstructed PSFs reach ~10% accuracy in Strehl ratio and FWHM at separations up to half the size of the isoplanatic patch. The current results suggest the telemetry-driven approach can reproduce not only the core PSF structure but also the extended wings, which are essential for reliable photometry and morphological analysis of bright extended sources. The obtained results also corroborate the key role of wind as a limiting factor of the method, reducing the amount of recovered information on specific directions.
Read the full abstract

All authors Matteo Simioni, Luca Cortese, Roland Wagner, Carmelo Arcidiacono, Andrea Grazian, Marco Gullieuszik, Elena Masciadri, Elisa Portaluri, Benedetta Vulcani, Anita Zanella, Richard Davies, Johanna Hartke, Roberto Piazzesi, Stefan Raffetseder, Piero Vaccari

Instrumentation and Methods for Astrophysics

The MICADO first light imager for the ELT: the PSF Reconstruction Software

The MICADO instrument for the ESO ELT will provide Adaptive Optics (AO) diffraction-limited NIR imaging and spectroscopy. A critical component of MICADO is the Point Spread Function Reconstruction (PSF-R) Software, which is designed to perform a blind reconstruction of the PSF for all observations using AO telemetry data only, both with the Single Conjugate (SCAO) and Multi-Conjugate Adaptive Optics (MCAO) modes of MICADO. The SCAO PSF-R Pipeline is currently being completed, and validation with ERIS at VLT and SOUL+LUCI at LBT has demonstrated high accuracy, of percent-level on-axis and 5-20% off-axis. Initial scientific simulations confirm that the PSF-R software meets the necessary precision for high-quality analysis, securing its role for MICADO's first light and future ELT operations.
Read the full abstract

All authors Andrea Grazian, Fernando Pedichini, Matteo Simioni, Jani Achren, Carmelo Arcidiacono, Luca Cortese, Ric Davies, Marco Gullieuszik, Johanna Hartke, Hanindyo Kuncarayakti, Roberto Piazzesi, Elisa Portaluri, Stefan Raffetseder, Piero Vaccari, Benedetta Vulcani, Roland Wagner, Anita Zanella

Machine Learning (Statistics)

CHOIR: heterogeneity-aware conformal prediction for crash injury severity across driver safety strata

Transportation agencies increasingly predict crash-injury severity with statistical and machine-learning models, but these models do not state how often their output contains the recorded injury level or for which groups of drivers it fails, a gap that matters most for motorcyclists and unrestrained drivers. This study develops and evaluates a certification layer that gives any fitted severity model a finite-sample, distribution-free coverage guarantee within prespecified safety strata. The layer, CHOIR (Conformal Heterogeneity-aware Ordinal Inference with Risk control), combines groupwise and weighted conformal prediction with conformal risk control to return contiguous KABCO intervals, and adds a declared sensitivity analysis for medically assessed injury and bounds on fatal omission. It is evaluated on 4.04 million Texas crashes from 2017-2023, one sampled driver per crash, with seven base models from the ordered logit to a tabular foundation model, and on held-out counties and later years. Under one pooled threshold every model reaches 0.90 coverage overall but covers motorcyclists or unrestrained drivers at 0.868 or lower, and class-balanced gradient boosting covers unrestrained drivers at only 0.374. Calibration within four safety strata places all 28 model-by-stratum estimates between 0.898 and 0.907, at the cost of sets spanning 3.6 to 4.6 of five categories for these groups, and the certified ordered logit is within 0.03 categories of the narrowest model. Injury-model coverage should therefore be certified within safety groups rather than on average, calibration rather than model complexity determines validity, and a statewide threshold should not be applied to small rural counties without local calibration data.
Read the full abstract

Strongly Correlated Electrons

Robust Spin-1 Haldane Topology under Itinerant Doping

We study itinerant hole doping of the spin-$1$ Haldane symmetry-protected topological (SPT) phase in two $t$–$J$ chains coupled by ferromagnetic (FM) Hund exchange. Density-matrix renormalization group calculations show that string order, a finite spin gap, and the Haldane entanglement structure coexist over a broad doping range. Combined with entanglement-entropy scaling consistent with a single gapless charge mode, these results support a metallic doped Haldane SPT with a $C1S0$ low-energy description. At low doping, short-range charge correlations reduce the density of spin-$1/2$ defect rungs, whereas at larger doping their positions become nearly uncorrelated while their spins are collectively incorporated into the correlated spin sector. The doped Haldane SPT terminates in a fully spin-polarized FM phase, which forms a reentrant pocket at high doping in the global phase diagram. Dilute-limit analyses trace the two FM boundaries to spin–charge factorization at weak Hund coupling and to rung-triplet binding with reduced pair mobility at strong Hund coupling. Our results show how mobile carriers reorganize the Haldane spin structure while preserving its characteristic signatures.
Read the full abstract

Hardware Architecture

CHERI-D Reincarnate: efficient multicore CHERI temporal memory safety through allocation reincarnation (draft version)

We propose CHERI-D Reincarnate (Reinc), an architectural extension to CHERI for scalable and efficient temporal memory safety. Prior work CHERI-D has a finite-width generation ID stored at a fixed location, requiring an object to be quarantined when its ID is exhausted. Reinc further provides use-after-free mitigation while permitting immediate freed memory reuse for objects through allocation reincarnation: rather than quarantining an allocation slot upon ID exhaustion, Reinc dynamically assigns a new ID to that slot when its current ID is exhausted. Exhausted IDs are quarantined and later reclaimed, while the underlying memory remains available for immediate reuse. By quarantining IDs rather than memory, Reinc enables continuous reuse of memory in the common case, substantially reducing both memory-sweep frequency and quarantine memory overhead. Reinc further introduces coherent ID caching while retaining a fully decentralized ID organization. Temporal metadata remains colocated with the memory it protects, preserving locality while avoiding centralized metadata structures. To support multicore execution, Reinc connects physical coherence events to the virtually addressed ObjID buffer using lightweight reverse-map and filter-based mechanisms. We implement Reinc as a hardware-software co-design spanning CHERI-Toooba (superscalar FPGA softcore), QEMU, LLVM/Clang and CheriBSD. Across our evaluated workloads, Reinc substantially reduces memory-sweep frequency and memory quarantine while incurring low performance and hardware overhead.
Read the full abstract

Combinatorics

Preservation of log-concavity under Hadamard products

For a nonzero real polynomial $p$, let $\W(p)$ denote the numerator of its ordinary generating function. We prove that if the coefficients of both $\W(p)$ and $\W(q)$ are nonnegative and log-concave with no internal zeros, then so are the coefficients of $\W(pq)$. This provides an affirmative answer to a question of Brändén, Ferroni, and Jochemko. As applications, we derive corresponding results for finite products and for Cartesian products of lattice polytopes, answering a question of Ferroni and Higashitani.
Read the full abstract

Rings and Algebras

Quasilinear multiplication in the Cayley-Dickson tower

Direct evaluation of the defining product of the Cayley-Dickson algebra $A_n$ of rank $N:=2^n$ over a unital commutative ring $R$ in which $2$ is invertible requires a quadratic number of arithmetic operations. This paper gives a uniform bilinear algorithm for multiplication in this algebra costing $O(N \log N)$ arithmetic operations in $R$ and $O(N)$ auxiliary storage when the doubling parameters of $A_n$ are units whose square roots lie in a fixed commutative coefficient algebra $S$ finitely generated as an $R$-module and admitting an $R$-linear map $\pi\colon S \to R$ with $\pi(1) = 1$. In particular, over $\mathbb{R}$ and every finite field $\mathbb{F}_{q}$ of odd characteristic, a quadratic field extension contains a square root of every possible doubling parameter, so the algorithm applies to every Cayley-Dickson tower over these fields, and the tensor rank of multiplication in $A_n$ over them is at most $(9n-21)2^n+28$ when $n\ge2$. When the top doubling parameter is a non-square, as in the standard real tower, the bound is $(9n-15)2^{n-1}+10$. To the author's knowledge, the algorithm presented in this paper is the first uniform subquadratic algorithm for multiplication in $A_n$. When $R=\mathbb{R}$ with every doubling parameter equal to $-1$, the real quasilinear schedule uses fewer total arithmetic operations than both direct multiplication and a uniform algorithm of Cariow-Cariowa for $n\ge4$. An implementation for the standard real tower is available in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface. In single-core benchmarks against direct multiplication and the uniform Cariow-Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was over $17$ times faster than direct multiplication at $N=1024$.
Read the full abstract

Fluid Dynamics

Surface gravity wave-mean flow interaction with comparable spatial scales. Part I: reduced wave equations

We consider deep-water surface gravity waves propagating above a background flow whose spatial scale is comparable to the wavelength, focusing on the regime where the flow is slow compared to the group velocity of the waves. We introduce an "equivalent solvability condition" method to construct reduced equations, demanding that, upon multiple-timescale expansion, the reduced equations share the same leading-order solution and first solvability condition as the original system. This approach turns the full 3D problem into a 2D reduced equation for the wave field. We derive such reduced equations for broad-band waves above a depth-invariant background flow, and for narrow-band waves above a fully 3D background flow. In the latter case the reduced equation takes the form of a Schrodinger equation involving the near-surface vorticity of the background flow only, with the impact of the near-surface horizontal flow divergence shown to be subdominant. Beyond the reduction in spatial dimensionality, the latter reduced equation describes the evolution of the wave field over the slow advective timescale of the background flow, thereby eliminating the computational burden of time-resolving the fast wave period. We illustrate the capabilities of the reduced equations through an analytical solution for the weak scattering of a wave packet by a patch of organized flow, followed by numerical solutions for stronger scattering of a wave packet by a patch of disorganized flow.
Read the full abstract

Probability

Short-maturity skew stickiness ratio under local volatility

We prove that the skew stickiness ratio converges to two at short maturity under local volatility models. This appears to be the first rigorous proof of this limit for a general time-dependent local volatility function. As a by-product, we strengthen the one-half rule of the implied volatility skew by removing uniform ellipticity and global bounds on spatial derivatives of order at least two. The proof uses a first-order Watanabe expansion.
Read the full abstract

Optics

Heterogeneously Integrated Efficient and Widely Tunable Lasers at 795 nm for Rubidium-Based Quantum Technologies

Scaling quantum processors and optical atomic clocks fundamentally requires orders-of-magnitude reductions in the size, weight, power, and cost of optical control systems. Photonic integration of lasers is critical to fulfill these requirements. At the near-infrared wavelengths required for atomic clocks and quantum computing through manipulation of rubidium atoms, laser integration is hindered by difficulty in light coupling and poor heat dissipation. Here, we introduce a wafer-scalable method utilizing micro-transfer printing to integrate GaAs-based amplifiers in etched recesses, directly butt-coupled to silicon nitride waveguides. We demonstrate extended-cavity single-mode lasers using this integration approach. Our compact microgear laser achieves a narrow 3 kHz fundamental linewidth at an on-chip output power of >22 mW – a record for a single-mode heterogeneously integrated laser in the 780-800 nm band – with a wall-plug efficiency of 9.4%, showcasing the high-power and efficiency potential of this integration approach. Additionally, we demonstrate a widely tunable laser leveraging Vernier filters to achieve lasing with 9 nm coarse tuning, a quasi-continuous fine-tuning range exceeding 140 GHz, and a mode-hop-free tuning range of 45 GHz. Our scalable integrated laser toolkit shows great promise for replacing macroscopic external-cavity diode lasers in next-generation quantum technologies and optical atomic clocks.
Read the full abstract

All authors Max Kiewiet, Stijn Cuyvers, Tom Reep, Konstantinos Akritidis, Gaudhaman Jeevanandam, Manuel Reza, Roelof Jansen, Pol Van Dorpe, Günther Roelkens, Kasper Van Gasse, Bart Kuyken

Numerical Analysis

Convergence of finite element approximations for the one-dimensional stochastic Burgers equation with additive trace-class noise

This paper investigates finite element approximations of the one-dimensional viscous stochastic Burgers equation with additive trace-class noise. For the $P_2$ finite element spatial semi-discretization, we derive strong error estimates that are optimal with respect to regularity in \(L^p([0,T] \times \Omega;H_{D}^{\alpha,q})\) for \(p,q\in[2,\infty)\) and \(\alpha\in[-1,0]\), as well as an almost regularity-optimal estimate in \(L^p(\Omega;C([0,T];L^\infty(\mathcal{O})))\). Furthermore, we derive weak error estimates for moments of both terminal $L^q$-norms and space-time $L^p(0,T;L^q(\mathcal{O}))$-norms, with weak convergence rates (nearly) twice the corresponding strong ones. For the fully discrete scheme, which combines the \(P_2\) finite element method in space with a drift-implicit Euler–Maruyama scheme in time, we establish a strong temporal convergence rate of order \(\tau^{1/2-\varepsilon}\) in a discrete analogue of \(L^p(\Omega;C([0,T];L^\infty(\mathcal{O})))\), under the condition \(\tau \leqslant h^2\). Numerical experiments are presented to illustrate the theoretical convergence rates.
Read the full abstract

Optimization and Control

Values of Absorbing Recursive Games Express All Real Algebraic Numbers

Many classes of two-player zero-sum stochastic games have the orderfield property: if all payoffs and transition probabilities lie in a subfield of $\mathbb{R}$, so does the undiscounted value. Absorbing games fail this property, and Oliu-Barton and Vigeral [Absorbing games with irrational values, Oper. Res. Lett. 51 (2023) 555–559] conjectured the precise extent of the failure: every real algebraic number $\alpha$ of degree $m\geq 1$ over $\mathbb{Q}$ is the undiscounted value of a rational $m\times m$ absorbing game. We prove this conjecture, and in fact within a special subclass of absorbing games: for every such $\alpha$, the game realizing it is strictly absorbing and recursive, i.e., every action pair is absorbing with positive probability and all non-absorbing stage payoffs are zero; when $\alpha>0$ it can moreover be taken positive recursive, with positive absorbing payoffs. As a corollary, the set of undiscounted values of rational $m\times m$ absorbing games is exactly the set of real algebraic numbers of degree at most $m$.
Read the full abstract

Computer Vision

OmniKVQuant: KV Cache Quantization for Omni-LLMs

As Omni-modal large language models (Omni-LLMs) take in audio, video and text together, their KV cache memory cost grows. KV cache quantization is the de facto approach in text-only LLMs, but its application to Omni-LLMs remains unexplored. In this paper, we analyze how TurboQuant, a representative rotation-based KV cache quantization method, behaves on multimodal caches and identify two critical issues: temporal key drift and heterogeneous value geometry. To address these, we propose OmniKVQuant, a training-free framework that (i) sets the key quantization range over each short window of the input stream; and (ii) rotates values separately per modality. On Qwen2.5-Omni and Qwen3-Omni, OmniKVQuant enables 2-bit KV caches while substantially preserving performance across seven audio-visual benchmarks. We further provide a fused Triton decode kernel that unpacks the 2-bit cache during attention, so no dense FP16 cache is ever built. Code: https://github.com/kaistmm/OmniKVQuant
Read the full abstract

All authors Suho Yoo, Hyunjong Ok, Jongmin Choi, Jihoo Jung, Joon Son Chung

Fluid Dynamics

Low inertia limit of elasto-inertial turbulence

Pipe and channel flows of viscoelastic fluids display chaotic dynamics at unusually low speeds, a phenomenon referred to as elasto-inertial turbulence, EIT. First reported in experiments a century ago, recent theoretical studies and model computations predict a variety of scenarios for the phenomenon's origin, ranging from hoop stress modes to center modes and to Tollmien-Schlichting waves. Lacking experimental confirmation, the relevant scenario in actual flows of polymer solutions remains unknown. We here determine the transition threshold of EIT in pipe experiments, covering three decades in elasticity number. Across this entire parameter range, the transition features center mode structures at onset. Eventually the instability diverges at a lower inertia (upper elasticity) limit, which is a robust signature of this center mode scenario. Finally, we report the first experimental observation of a traveling wave in viscoelastic pipe flow, and the sequences of localized structures found, are in excellent agreement with a center mode traveling wave, the "arrowhead" solution, discovered in model simulations.
Read the full abstract

All authors Shoaib Kamil, Sarath Sankar Suresh, Jose M. Lopez, Björn Hof

Machine Learning

A Dataset and Model for Imputing Water Surface Elevation on a Large and Extremely Sparse Spatiotemporal Graph

Continuous monitoring of water surface elevation across river networks is critical for flood forecasting, water resource management, and understanding the global water cycle. Yet, the scarcity of in situ gauges across much of the globe constrains the development of reliable modeling frameworks. Satellite altimetry has the potential to alleviate this problem but its use is currently hindered by sparse temporal coverage. To this end, we introduce AmazonSWE, a dataset for training and evaluating large-scale spatiotemporal graph imputation methods that integrates processed satellite altimetry measurements from a range of sources, including the recent wide-swath SWOT sensor. The dataset covers over 19K river sections and 10 years (2016-2026) in the Amazon river basin, with in situ gauges held out for evaluation. Besides contributing a novel real-world use case with the potential for societal impact, AmazonSWE introduces significant technical challenges: with fewer than 1% of sections observed per day, the dataset is far sparser than existing imputation benchmarks, and its directed acyclic river topology is both structurally different from and larger than graphs in existing datasets. We show that prior spatiotemporal graph imputation methods are not adapted to this topology, scale and sparsity, and propose a simple bidirectional selective state space model that outperforms them by sampling connected subgraphs and flattening space and time into a single token sequence with topology-aware positional encodings. Compared to the state-of-the-art published method for SWOT-based WSE densification, which integrates statistics with physical modeling, our model reduces RMSE against in situ gauges by 18-39%, while producing predictions for every river section rather than only those with sufficient nearby satellite coverage.
Read the full abstract

All authors Ruben Cartuyvels, Karim Douch, Gabriele Bertoli, Mounia El Baz, Artemis Vrettou, Sébastien Lefèvre, Diego Fernandez Prieto

Robotics

Quasi-static analysis of passive stability in a novel underactuated multi-finger hand

Underactuated robotic hands achieve adaptive and robust grasping with a reduced number of actuators, but predicting the stable equilibrium pose of the grasped object remains a significant challenge. This paper introduces a quasi-static analytical approach to assess passive stability in underactuated multi-finger hands. A novel three-finger hand architecture integrating a differential spring-loaded slider mechanism is introduced, enabling versatile and adaptive grasping. The study focuses on how the differential mechanism influences the overall grasp behavior and analyzes the effect of object size on the stable equilibrium configurations for two canonical grasp types: cylindrical and spherical.
Read the full abstract

All authors Léonie Plancoulaine, Sylvain Guégan, Franck Plestan, Damien Chablat

Probability

Negative correlation for the random-cluster model below one on high-degree regular graphs

The random-cluster model with cluster parameter \(0<q<1\) is conjectured to exhibit negative dependence, but even pairwise negative correlation between distinct edges remains open on general finite graphs. We first establish a reduction showing that the pairwise conjecture is equivalent to its restriction to regular graph sequences of diverging degrees $(d_n)$, even for edge pairs at distance \(o(d_n/\log d_n)\). We then prove strict pairwise negative correlation for a broad class of high-degree regular graph sequences satisfying a two-scale edge-isoperimetric condition. More precisely, for every fixed \(p\in(0,1)\), all sufficiently large graphs in the sequence have strictly negative covariance between any two distinct edge indicators at distance \(o(d_n/\log d_n)\), uniformly in \(q\in[0,1)\) and in the choice of the two edges. In particular, the result includes the \(q=0\) endpoint, corresponding to Bernoulli bond percolation conditioned to be connected. The isoperimetric hypothesis is satisfied by high-degree expander families and, with probability tending to one, by uniformly random regular graphs of diverging degree; its two-scale form also allows product geometries such as hypercubes and fixed-side high-dimensional discrete tori. The proof is based on a polymer representation and cluster expansion, together with a geometric identification of the leading contribution to the two-edge correlation.
Read the full abstract

Optics

Temporal Localisation of Waves from Imaginary Line-Gap Topology

For non-Hermitian Hamiltonians, gain, loss, and non-reciprocity produce complex eigenvalues which, in turn, facilitate different kinds of topological phases. One example is the imaginary line-gap phase, where eigenvalues cannot lie on the real line. This notion was recently shown to explain the robust temporal localisation of waves in photonic quantum walks and time-varying metamaterials. In these systems, waves localise around a time interface between topologically inequivalent mediums. At the core of this phenomenon is a $\mathcal{PT}$-symmetric two-mode model, where the non-trivial topology arises due to the $\mathbb{Z}_2$ classification of the AI symmetry class. In this work, we study two-mode models in all non-Hermitian symmetry classes. We find that robust temporal localisation generically follows as a physical consequence of imaginary line-gap topology according to a simple diagnostic: at least one of time-reversal symmetry ($\mathcal{T}^{\hspace{0.05em}2} = 1$) and particle-hole symmetry ($\mathcal{C}^2 = 1$) must be present. Our results provide a comprehensive symmetry-based guide to the observation of the topologically protected temporal localisation of waves.
Read the full abstract

All authors Carlos Camacho, Tom Sheppard, Joshua Feis, Oliver Ashfield, Alexander Szameit, Frank Schindler, Hannah M. Price

Logic in Computer Science

Medvedev Logic is Not Decidable. It is {\pi}01 -complete. Who Would Have Guessed?

This project began as an attempt to prove that Medvedev logic is decidable with the help of generative AI systems. The author (as well as the generative AI systems, or at least they claim to be since I have asked them) was surprised by its eventual conclusion. We prove that Medvedev logic ML, the intermediate logic of finite problems, is Pi-01-complete under computable many-one reductions. Consequently, ML is not recursively enumerable, a fortiori undecidable, and admits no recursively enumerable sound and complete proof calculus. The proof connects the periodic domino problem with intuitionistic formulas through a shared intermediate structure that we call a Wang-Medvedev pair. Such a pair consists of a finite partially ordered set of roles together with demands. Demands define the interaction between roles. A realization labels nonempty subsets of a finite set with these roles, respecting the order and satisfying the demands. We associate a pair with each finite Wang system and show that it has a realization iff the system tiles a finite torus. We then construct an intuitionistic formula that fails on some finite Medvedev frame iff the same pair is realizable. Realizability thus provides the link between periodic tilings and the countermodels.
Read the full abstract

Statistical Methodology

Market-Informed Networks for Modeling and Forecast Evaluation of Financial Extremes

Modeling the joint distribution of extreme values in high-dimensional financial time series is challenging because extremes are sparse and locally extreme observations are not necessarily extreme relative to their full marginal distribution. To address this, we introduce a time-dependent network Hüsler-Reiss model in which market-informed adjacency matrices determine how strongly observations contribute to the estimation. We propose binary and weighted specifications, including the Joint Extremes Adjacency Matrix (JEAM) which combines information about individual extremeness with historical patterns of joint extreme movements. In the forecasting evaluation part, covering one-minute stock returns from three sectors of the S&P 100, JEAM achieves the best out-of-sample log scores for both tail directions; improving scores by 12.5-13.6% in the lower tail and 11.4-14.9% in the upper tail. The results show that incorporating market-informed network structures in the estimation, improves forecast evaluation of extremes across time series.
Read the full abstract

Chaotic Dynamics

Linear Response Predicts Cusp-Pair Births in Networks with a Localized Cubic

Linear response is cheap to measure; the bistability boundaries it organizes are not. For a passive network with one localized cubic, the driving-point receptance $G$ fixes the period-one cusp set at fundamental-harmonic order: cusps lie on a fixed phase contour of $G$, a tangency of that contour under parameter variation creates a pair, and its curvature separates a gap opening from an isolated loop. For a two-mode absorber the linear prediction locates a benchmark birth coupling to $0.3\%$, and to $0.03\%$ once a third-harmonic correction of scale $|G(3\Omega)/G(\Omega)|$ is included.
Read the full abstract

Computer Vision

Learn the Solid, Not the File: Canonical Inputs for Neural Networks on CAD Boundary Representations

Boundary representation (B-rep) is the standard format used by modern CAD systems for parametric 3D models. It turns out, the exact same solid can be represented by different B-reps: for example, two engineers using different operations, a geometry kernel rebuilding the file, and an export setting repartitioning faces will lead to different B-reps even though the underlying solid remains the same. We show that existing B-rep encoders are not robust to variation in the B-rep with the same solid on perturbations applied to standard benchmarks, naturally occurring variations inherent to CAD software, and differences in how designers model the same part via a human dataset we created in FreeCAD. The performance of popular B-rep encoders often collapses catastrophically. We propose the canonical region graph, an input representation whose nodes, features and coordinate frame are derived from the solid itself and show theoretical invariance guarantees on repartitioning and rigid motions. It matches the strongest baseline on standard benchmarks, and is stable under every perturbation we test.
Read the full abstract

All authors Heinrich Jiang, Hager Yasser Mohamed, Alexander Hitt, Valeriia Lomakina, Henning Jiang, Jennifer Jang

Information Retrieval

TimelyRAG: Semantic-Temporal Hybrid Retrieval for Time-Critical Question Answering in Overlapping-Evolving Documents

Although large language models (LLMs) and retrieval-augmented generation (RAG) have advanced open-domain question answering (QA), they remain unreliable when documents evolve through amendments. Existing time-sensitive retrieval methods address only the disjoint-evolving environment, where each update is an independent snapshot. However, laws, policies, and regulations often operate in overlapping-evolving environments, where amendments override earlier clauses while preserving most content, creating strong semantic overlap across versions. We propose TimelyRAG, a retriever-agnostic framework that incorporates temporal distance into ranking to align queries with version-appropriate documents. We also introduce TimelyQABench, the first benchmark for regulation-heavy domains with overlapping-evolving challenges. Experiments show consistent gains, up to +28.6% in nDCG@10, highlighting the importance of temporal reasoning for reliable QA over evolving documents. All resources are available at https://github.com/kaist-dmlab/TimelyRAG.
Read the full abstract

All authors Youngeun Nam, Joeun Kim, Hwanjun Song, Susik Yoon, Jae-Gil Lee, Byung Suk Lee

Materials Science

Effect of Stress and Surface Roughness on Electrodeposition in All-Solid-State Batteries: A Computational Investigation

All-solid-state batteries (ASSBs) promise high energy density and enhanced safety, but their development is hindered by instability and incompatibility at solid-solid interfaces. In Li-metal ASSBs, lithium penetration occurs despite stiff ceramic electrolytes via grain boundaries, often initiated by minor Li/SE interfacial irregularities. Here we introduce a two-dimensional continuum model with electro-chemo-mechanical coupling to investigate interfacial current distribution in Li ASSBs with surface-roughened argyrodite electrolyte under stack pressures and applied current density. Our theoretical analysis and simulation studies highlight the critical role of mechanical stress in interfacial current distribution. We find that prominent stress variations around elongated surface protrusions are the key to nonuniform Li deposition, without which Li deposition becomes uniform even on a rough surface. Moreover, our parametric study elucidates that stress effects dominate the overpotential and current distribution under low interfacial current density to exchange current density ratios, otherwise the high interfacial resistance due to surface-roughness-induced interfacial area becomes dominant. With these insights, we also discuss the potential of engineering artificial interlayers to modulate interfacial current distributions, offering guidance for improving the long-term performance and reliability of ASSBs.
Read the full abstract

All authors Kaniza Islam, Ayush Morchhale, Jung-Hyun Kim, Yanzhou Ji, Noriko Katsube

General Relativity and Quantum Cosmology

How much chaos can be generated by gravitational collapse before reaching the Planck scale?

According to the Belinski-Khalatnikov-Lifshitz (BKL) conjecture the dynamics of general relativity near singularities is highly chaotic. However, since general relativity breaks down at singularities, it is generally expected that a more fundamental theory, such as quantum gravity, is needed to describe the spacetime dynamics in regions with large spacetime curvature. In the absence of a widely accepted theory of quantum gravity, it remains unclear how exactly quantum effects may modify the classical evolution. Taking a conservative point of view, in this paper we study the classical dynamics of a gravitational collapse, starting from a strong-field (though classical) scenario up to the Planck scale to quantify how much chaos is generated during the time the Einstein equations can be trusted. Specifically, we use the Shannon entropy and Kullback-Leibler divergence, as well as Fourier analysis, to find that, when the Planck scale is reached, the chaotic features of the model remain relatively underdeveloped. This suggests that, at least during the classical regime, chaos is not strong enough to erase all information about the initial state of the universe, or about a previous classical universe in the context of bouncing cosmologies. In addition, we also characterize the final invariant phase-space distribution for the chaotic Bianchi IX dynamics in general relativity, which provides a novel description of its invariant repeller.
Read the full abstract