Databases
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 8 September
Text-to-SQL systems translate natural language queries into executable SQL, democratizing access to structured data. Despite recent advances driven by large language models (LLMs), evaluation remains a major bottleneck: public benchmarks fail to capture the complexity of enterprise schema, while building private evaluation sets is costly and nondeterministic, making evaluation results difficult to reproduce. To address this issue, we present SQLMorph, a framework for Text-to-SQL evaluation via query mutation. SQLMorph introduces two techniques to automatically generate and expand evaluation sets: Join Query Expansion (JQE), which systematically increases structural complexity through valid join additions, and Textual Query Augmentation (TQA), which generates controlled natural language perturbations to assess robustness to linguistic variation. JQE and TQA create targeted choke points to challenge specific system components. When applied to state-of-the-art systems, JQE increases query coverage and reveals accuracy degradation as the number of joins grows. Meanwhile, TQA shows that linguistic brittleness induced by heavy abbreviation can reduce accuracy by up to 17%. Beyond evaluation sets, SQLMorph introduces a family of execution-level metrics that address the limitations of current binary measures, such as Execution Accuracy. We define Execution Precision (EXP) and Execution Recall (EXR) to quantify the fraction of correct and recovered results, respectively, and combine them via F1 for unified scoring. Our experiments show that these relaxed metrics enable fine-grained analysis of over- and under-prediction, revealing differences across systems that binary metrics obscure. Together, SQLMorph's query mutation and fine-grained metrics support debugging and better align Text-to-SQL evaluation practices with real-world deployments.
Computer Vision
Prior-free relative 6D pose estimation of multiple object instances
Object 6D pose estimation formulations have progressively reduced reliance on object-specific priors, evolving from explicit 3D models to multi-view object captures to single reference images. We take this progression to its extreme by introducing prior-free relative 6D pose estimation, which lifts the assumption of knowing which object is to be posed within the scene. This novel setting aims to estimate the relative poses of multiple instances of an unknown object within the same image, without requiring CAD models, templates, or reference images. We solve this by formulating a novel method (PROSE) that finds coarse correspondences between object instances using multimodal foundation features, thus requiring no training. We refine these correspondences by imposing cycle consistency across tuples of instances, and leverage the resulting globally consistent correspondences to estimate the relative 6D pose between any pair of instances. To enable systematic evaluation, we design a novel benchmark (PRENCH) built from three multi-instance BOP datasets and enriched with task-specific metadata. PROSE consistently outperforms baselines obtained by adapting state-of-the-art single-image methods to the proposed setting, while requiring neither task-specific supervision nor additional learned components. Project website: https://tev-fbk.github.io/PROSE/
Read the full abstract
Sound
Disentangled Global-Local Feature Learning with E-Branchformer for Audio Deepfake Detection
The rapid advancement of voice synthesis technologies such as text-to-speech and voice conversion poses significant threats to speech-based authentication systems, necessitating robust deepfake detection methods. In this work, we propose a novel E-Branchformer-based architecture that effectively leverages self-supervised speech representations for audio deepfake detection. Our model employs parallel branches to simultaneously capture global contextual dependencies through multi-head self-attention and local temporal patterns through convolutional processing. To enhance discriminative capability, we integrate depthwise convolution and Squeeze-and-Excitation modules that enrich the classification token with refined patch token information after feature merging. Extensive experiments on ASVspoof 2021 LA, DF, and In-the-Wild datasets demonstrate state-of-the-art performance with equal error rates of 0.88%, 1.85%, and 6.30% respectively, substantially outperforming existing methods. Comprehensive ablation studies validate that the dual-branch architecture provides complementary discriminative information, Squeeze-and-Excitation Aggregation significantly improves SSL feature integration, and the combination of DWConv and SE modules is critical for effective class token enhancement. The superior performance on real-world scenarios demonstrates strong generalization capability to diverse acoustic conditions and unseen spoofing attacks.
Read the full abstract
Fluid Dynamics
ONE CYLinder: A Benchmark for Graph-Based Surrogate Modeling of Unsteady Bluff-Body Flows
Graph-based surrogate models offer a promising route to accelerate computational fluid dynamics (CFD) simulations on unstructured meshes. However, their development is limited by the scarcity of benchmark datasets spanning multiple flow regimes and standardized protocols for long-horizon autoregressive prediction. We introduce ONECYL (ONE CYLinder), a new benchmark for unsteady flow past a circular cylinder across laminar, transitional, and high-Reynolds-number regimes. The benchmark comprises 450 high-fidelity Variational Multiscale finite-element simulations (270,000 flow snapshots) with randomized cylinder geometries, providing time-resolved velocity and pressure fields together with mesh connectivity, geometric descriptors, Reynolds numbers, and integrated aerodynamic quantities. Beyond the dataset, ONECYL establishes a unified evaluation framework combining full-field rollout errors, virtual probes, and drag and lift predictions to assess numerical accuracy and physical fidelity. To accompany the benchmark, we develop a Graph Transformer as a reference baseline predicting velocity and pressure fields autoregressively on unstructured meshes. Using ONECYL, we investigate geometric representations and physics-based regularization across the three Reynolds-number regimes. The results show that explicitly encoding the cylinder geometry through a level-set representation consistently improves long-horizon prediction accuracy and generalization to unseen geometries, while divergence-based regularization becomes increasingly beneficial as flow complexity increases. The ONECYL benchmark and its Graph Transformer baseline provide a reproducible framework for evaluating graph-based surrogate models and establish a foundation for future research on long-horizon prediction of unsteady bluff-body flows.
Read the full abstract
Distributed Computing
ContinuumBench: Benchmarking Joint Autoscaling and Placement Across Evaluation Regimes in the Cloud-Edge Continuum
Cloud-edge controllers coordinate service placement, replica scaling, and resource pre-warming to keep end-to-end latency within application deadlines. But evaluations often obscure the source of a reported gain: placement and scaling are studied separately; workload, connectivity, and calibration assumptions remain implicit; and metrics over completed tasks hide unfinished work. We present ContinuumBench, a benchmark that controls these factors. Its completion-aware accounting treats late, unfinished, and discarded tasks as deadline misses. A common protocol compares placement-only and scale-capable controllers under declared regimes and stressors. Built on the ECLYPSE simulator, ContinuumBench adds arrivals, worker elasticity, intermittent transport, buffering, and failures to close the control loop. We evaluate nine controllers across four scenarios and two regimes. The studied regimes are capacity-bound: elastic capacity, not placement sophistication, drives completion, and once capacity suffices, the choice of autoscaling policy decides how much of that work arrives on time. Placement re-planning has no measurable effect without relocation, while cost-free migration defines the observed exception. Consequently, scale-capable controllers approach an over-provisioned reference while placement-only controllers degrade with load; and placement quality separates controllers only once capacity is exhausted. Finally, the accounting choice itself changes the reported result: completion-only and completion-aware scoring can rank controllers differently.
Read the full abstract
Numerical Analysis
Sharp Computational Bounds for Spectral Types of Schrödinger Operators
We prove sharp bounds for determining the spectral-type decomposition of Schrödinger operators in the spirit of Smale's program on the foundations of computation. For explicit one-dimensional self-adjoint Schrödinger operators $H=-{\mathrm d^2}/{\mathrm dx^2}+V$ on $L^2(\mathbb R)$, where $V\in C^\infty(\mathbb R;\mathbb R)$ is given by a finite description of all derivatives and derivative bounds, the pure point and absolutely continuous spectral sets cannot, in general, be recovered by any single limiting procedure. The singular continuous spectral set is strictly harder: it cannot, in general, be recovered by two nested limiting procedures. Analytic constructions of dichotomies realize the lower bounds: Gordon-type repetitions for pure point spectrum, high barriers for absolutely continuous spectrum, and an inverse spectral construction for singular continuous spectrum based on Riesz products, moment-killing perturbations, and a computational Gelfand–Levitan scheme. The finite-description framework also implies corresponding limitations on what can be certified in fixed formal systems (e.g., when used in computer-assisted proofs). Conversely, using wavelet-based certified computation, we prove matching upper bounds for broad classes of self-adjoint differential operators on $\mathbb R^d$ with coefficients of locally bounded variation and quantitative local variation control: two limits suffice for the pure point and absolutely continuous parts, and three for the singular continuous part. This provides a sharp hierarchy for spectral types.
Read the full abstract
Artificial Intelligence
SkillAdam: Stable and Efficient Skill Evolution for Agents
Agent skills provide a lightweight way to equip frozen language-model agents with domain knowledge and procedural guidance, yet obtaining high-quality skills remains costly and difficult to scale. Expert-written skills require substantial human effort. Recent skill self-evolution methods automate an iterative loop that uses execution feedback to revise skills, but their heuristic update strategies often yield unstable optimization and low iteration efficiency. We identify two challenges in realizing stable and efficient skill self-evolution. Direction Stability requires effective corrections to accumulate rather than be overwritten by iteration-local feedback. Update Adaptivity requires the scope of each revision to reflect the consistency of recent case-level improvements. We introduce SkillAdam, an Adam-inspired framework for optimizing discrete and non-differentiable skill documents. As a functional analogue of Adam's first moment, an optimization memory records identified problems and the outcomes of prior solution attempts to stabilize the update direction. As a functional analogue of Adam's second moment, a volatility-driven edit budget tracks the history-weighted variation of recent case-level improvements and adaptively controls the update magnitude. Across seven benchmarks that span short- and long-horizon tasks, SkillAdam achieves state-of-the-art performance with more stable optimization dynamics. It also obtains stronger skills with substantially fewer optimization iterations and lower cost than prior methods. Code repository: https://github.com/ruc-datalab/SkillAdam
Read the full abstract
Computation and Language
Evaluating and Improving Evidence-Grounded Fact-Checking in LLMs via Multi-Round Evidence Ablation
Automatic fact-checking systems assess the veracity of claims given evidence from relevant documents. Large Language Models (LLMs) have demonstrated strong performance in fact-checking due to their general reasoning capabilities. However, it remains unclear whether they faithfully make use of the evidence provided to reach veracity judgments or rely on parametric knowledge. To investigate this, we introduce Fact-Ablated Evaluation (FAE), a new evaluation framework that iteratively ablates the cited evidence to assess whether LLMs revise their predictions accordingly. Our empirical results show that current off-the-shelf LLMs as fact-checking systems rely more on their parametric knowledge than on the evidence provided. To bridge this gap between prediction accuracy and evidence grounding, we propose REAL (Rigorous Evidence Ablation Learning), a training framework that promotes evidence-dependent verification through counterfactual evidence supervision for the LLM-as-verifier models. Experiments on four fact-checking datasets across different domains demonstrate that models trained with REAL obtain superior evidence-dependent capabilities compared to standard fine-tuned models. Our findings highlight that strong fact-checking performance can still coexist with weak evidence dependency, while REAL encourages veracity predictions to remain more closely tied to the availability of supporting evidence.
Read the full abstract
Solar and Stellar Astrophysics
An analysis of four stellar rings
About 50 years ago, one thousand ring-like structures (called stellar-rings) were discovered by Isserstedt (1968). They were believed to be groups of young stars formed by shell-like triggered star formation, which would make them excellent tracers of spiral arms, for example. Neglected for 40 years, we used highly accurate kinematic, astrometric, and photometric data to investigate the four most prominent stellar rings. The aim is to investigate if those structures are indeed physically related groups of stars. We used proper motions and parallaxes from the Gaia DR2 to calculate distances and to search for common properties. Color-magnitude diagrams using BVJHKs measurements were investigated and isochrones fitted. None of the four stellar rings consists of a physically related group of young stars. The location of stars in the line-of-sight mimics a ring-like structure on the sky. The color-magnitude diagrams are typical for an integrated field population and not for a young star cluster, for example. The currently available data are sufficient to analyze ring-like structures with a high statistical significance. This allows a new search for such structures in the Milky Way.
Read the full abstract
Information Retrieval
FINALLY: A Dataset Recommender System for Recommender-Systems Research
Dataset selection shapes the empirical conditions under which recommender-system algorithms are evaluated, yet existing tools provide limited support for constructing complete dataset sets that jointly satisfy experimental constraints and set-level selection objectives. To address this problem, I developed FINALLY, a web-based dataset recommender for constructing configurable dataset sets for offline recommender-systems evaluations. FINALLY combines required datasets, candidate-pool restrictions, metadata filters, configurable target-set sizes, Random selection, and diverse and non-diverse strategies based on adapted Effective Covariance and Convex Hull objectives. I evaluated FINALLY through 420 recommendation runs across ten systematically varied configurations. All evaluated dataset sets satisfied the applicable target-size, duplicate-avoidance, snapshot-membership, required-dataset, and metadata-filter requirements. All 40 deterministic strategy–configuration combinations were reproducible. Both the Effective-Covariance-based and Convex-Hull-based strategies produced the expected diverse-versus-non-diverse score ordering in all ten configurations. Under their corresponding objectives, the diverse strategies produced scores above all 30 configuration-specific Random results, whereas the non-diverse strategies produced scores below all 30 Random results. These results establish technical consistency for the evaluated FINALLY workflow and show that the implemented strategies follow their intended optimization directions within the investigated configuration space. They do not establish the scientific suitability, global optimality, or practical superiority of the generated selections.
Read the full abstract
Numerical Analysis
On the sample complexity of the active subspace method
Active subspaces identify low-dimensional linear structure in high-dimensional parameter-to-output maps by estimating the dominant eigenspace of a gradient covariance operator. In practice this covariance is replaced by a Monte Carlo estimator built from a limited number of gradient evaluations. Classical analyses based on controlling the covariance error in operator norm lead to sample-complexity estimates that can be substantially more pessimistic than the sampling rules commonly used in computations. This paper studies the empirical active subspace method directly in the projection-error metric relevant for ridge approximation. We derive non-asymptotic quasi-optimality bounds governed by a regularized inverse Christoffel function associated with the gradient field. Under a bounded-gradient assumption, the resulting estimates already improve the sample-complexity estimates obtained from operator-norm covariance bounds. We then show that additional smoothness of the gradient map, expressed through membership in a reproducing kernel Hilbert space, yields sharper coherence estimates and motivates tractable importance sampling from kernel diagonal measures. Furthermore, the same smoothness assumption yields a priori decay bounds for the population active subspace tail energy, which can be combined with our finite-sample estimate to prescribe rank, regularization scale, and sample size, allowing to fully characterize the a priori sample complexity. The abstract assumptions are verified for lognormal Gaussian and affine uniform parametric elliptic PDEs using weighted summability of Hermite and Legendre series expansions.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Optical Depths from the Thermal Sunyaev-Zel'dovich Effect with ACT DR6 and DESI DR1 Spectroscopic Galaxies and Optically-Selected Clusters
We present stacked thermal Sunyaev-Zel'dovich (tSZ) effect measurements for three samples of galaxy groups and clusters: those traced by the Dark Energy Spectroscopic Instrument Data Release 1 (DESI DR1) luminous red galaxies (LRG) and the DESI DR1 Bright Galaxy Sample (BGS), and an eROMaPPer optically-selected sample from the DESI Legacy Imaging Survey. We use the latest Atacama Cosmology Telescope DR6 (ACT)+Planck component-separated internal linear combination (ILC) Compton-$y$ maps and ACT+Planck coadded 90, 150, and 220 GHz temperature maps to extract the tSZ signal within a $\sim2'$ disk aperture for sources binned by luminosity, richness, or mass. We measure the average tSZ signal with high statistical significance, with signal-to-noise ratios surpassing 38 for LRG, 27 for BGS, and 39 for the eROMaPPer sample using the 90 GHz ACT DR6+Planck map. We conduct a detailed study of systematics and foregrounds such as dust and cosmic infrared background (CIB) contamination, which remain a core challenge for tSZ analysis. For the LRG and BGS samples, we find that dust and radio source emission dominate the tSZ signal at scales near and below the disk aperture radius. Large-scale ($R>4'$) contamination from the CIB is less significant. We mitigate these contaminants to isolate the tSZ signal and use a combination of simulated and real measurements to develop Compton-$y-$optical depth ($\bar y-\bar \tau$) scaling relations to infer optical depths, which are found to be in agreement with values measured using the pairwise kinematic SZ effect for the same tracer samples. The $\bar y-\bar \tau$ scaling relation for the eROMaPPer sample is the first such relationship to be derived directly from SZ measurements.
Read the full abstract
Computer Vision
EgoSIS: From Factorized Visual Ego-Transitions to Motion-Canonical Spatial Evidence for UAV Reasoning
UAV video question answering requires separating camera motion from changes in the scene, but RGB-only multimodal models receive no explicit, stable reference for that separation. We present EgoSIS, a pose-free adapter that converts RGB-derived bidirectional flow into motion-canonical visual evidence in three stages. Factorized Visual Ego-Transitions (FVET) fits a robust image-plane transition and exposes motion, residual-support, and reliability factors. Reliability-Gated Ego-Transition Memory (ReTEM) uses reliability-weighted updates for a bounded history and re-anchors it at cuts or sustained uncertainty. Ego-Aligned Spatial Evidence (EASE) warps supported visual features into each segment's local anchor and injects four spatial evidence tokens per visual slice through zero-initialized residuals, without changing Qwen's visual-token count. On SIS-Bench, EgoSIS-8B obtains 89.9% perception, 82.5% perception-plus-memory, and 76.2% overall accuracy, with the largest gains concentrated in self-awareness perception and memory. The adapter thus provides an interpretable interface between optical flow and spatial reasoning.
Read the full abstract
Combinatorics
Abelian Cayley High-Dimensional Expanders with Polylogarithmic Degree
We construct an explicit infinite family of simple two-dimensional Cayley complexes over $\mathbb{F}_2^n$ whose degree is polynomial in $n$ and whose nontrivial vertex-link eigenvalues lie in $[-\lambda,\lambda]$ for every fixed $\lambda>0$. For every fixed $d\ge2$, we also obtain an explicit infinite family of weighted $d$-dimensional Cayley complexes over $\mathbb{F}_2^n$ with codimension-two local spectral norm at most $1/d$ and Cayley degree $\Theta_d(n)$. Our two-dimensional construction uses evaluation at rational points of algebraic curves to produce projective direction sets and many functions affine along these directions, which may be useful for further constructions and improvements.
Read the full abstract
Sound
AuK Technical Report: An Open-Source Foundational Model for Speech Generation and Editing
We introduce AuK, an open-source foundational model that unifies speech generation and editing through a common interface of natural-language instructions and audio context. To support this broad capability set, we construct approximately 3.03 billion instruction–audio instances and 1.95 million hours of effective supervision across five task families: speech generation, content editing, enhancement and separation, paralinguistic editing, and acoustic editing. AuK combines a multimodal large language model for semantic conditioning, an VAE jointly trained on speech, general audio, and music for acoustic conditioning, and a hybrid rectified-flow Transformer that performs dual-stream MMDiT blocks followed by unified single-stream DiT blocks for generation. Training begins with generation-only warm-up and proceeds to joint generation–editing pre-training. We then apply complementary post-training strategies: human-feedback preference optimization for open-ended editing and reward-based reinforcement learning for speech generation. To reduce inference cost, we further distill the model with consistency initialization and task-routed Decoupled DMD. The resulting AuK-Flash performs 4-step inference without classifier-free guidance and achieves a 4.5 wall-clock speedup over the full model under matched conditions. Experiments demonstrate leading performance on zero-shot and instruction-controlled speech generation and general instruction-guided editing, while remaining competitive on signal-level restoration tasks. We release both the source code and model weights to support reproducibility and further research.
Read the full abstract
Probability
Polynomial mixing for the weakly damped stochastic nonlinear Schrödinger equation on the whole space
We consider the weakly damped stochastic nonlinear Schrödinger (NLS) equation on the real line, driven by a noise that is white in time and smooth in space. Assuming that the noise is sufficiently non-degenerate, we prove that the equation has a unique stationary measure in the class of probability measures concentrated on $H^2$, and establish polynomial mixing in the dual-Lipschitz metric over $H^1$. We do not impose any restriction on the size of the damping. The proof is based on a coupling argument, whose key ingredient is a Foiaş-Prodi-type estimate in the $H^1$-norm, derived by means of a Lyapunov functional adapted to the linearized NLS dynamics. To compensate for the loss of compactness, we combine this estimate with a truncated Poincaré inequality and a space-time weight function quantifying the spatial decay of solutions.
Read the full abstract
Computation and Language
When Models Defer to Wrong Answers: A Robustness Audit of Source-Attributed Cues in Multiple-Choice QA
Language models often receive a question together with a claim about what another source answered. We audit whether such claims destabilize answers in multiple-choice question answering. For each item, we hold one wrong option fixed across misleading conditions and vary the cue template attached to it. We introduce neutral-conditioned misleading cue adoption rate (NC-MCAR), which measures switches to that option only on valid cued trials where the same model first selected the gold answer under a neutral prompt. This is a measure of answer instability, not proof that the model knew the answer or that all deference is irrational. We evaluate four instruction-following models on MMLU-Pro and IndicMMLU-Pro in English, Hindi, Bengali, Tamil, and Telugu. Across 220{,}000 outputs, the expert template yields 41.1% aggregate NC-MCAR, compared with 12.5% for the majority template. These two conditions use the same wrong option and final instruction. Filler accuracy remains well above expert-wrong accuracy, while correct-cue prompts have high valid-response accuracy. The audit documents answer instability relevant to grounding under the tested forced-choice prompts: a bare, unverified source claim can outweigh an answer that was previously consistent with the task evidence.
Read the full abstract
Systems and Control
Unifying Power Flow and Electromagnetic Transient Modeling
Grid tools are separated by timescales: steady-state analysis is performed by power flow (PF), whereas the fastest dynamics are captured by electromagnetic transient (EMT) simulation. Although operating at varying timescales, different tools should produce consistent results when analyzing the same grid conditions. However, the PF steady-state solution does not match the time-to-infinity EMT response. This mismatch exists because simplified device models in PF are inconsistent with the "ground truth" EMT models derived from first principles. As inverter-based resources (IBRs) and data centers strip away inertia and operating reserves, approximations used in PF risk grid security by missing violations. To address this, we introduce a steady-state framework that uses full-physics EMT models for high-fidelity steady-state grid analysis. The challenge lies in systematically formulating algebraic frequency-domain representations of dynamic power devices that are naturally described in state-space form. Our tool, SALT (Steady-state After Last Transients), constructs steady-state representations that exactly capture grid device physics when embedded into transmission networks. The approach exploits the structural properties of power device models and the single-harmonic, balanced nature of the transmission system. Results demonstrate SALT achieves EMT steady-state accuracy while delivering a 1x10^6 times speedup. We demonstrate that SALT can capture security threats in contingency scenarios without exception — whereas PF-based analyses reported 75% fewer rated line violations, 18% fewer Q-limit violations, and 7% fewer voltage violations.
Read the full abstract
Strongly Correlated Electrons
Real-time Dyson expansion for the nonequilibrium $GW$ approximation: Correlated spectra and dependence on the reference propagator
Electronic spectra provide direct insight into the excitations and correlations of condensed matter systems. Their description requires electron correlations beyond mean field. In equilibrium, the $GW$ approximation has become the method of choice for many materials. Extending this approximation to nonequilibrium, however, is challenging. Full two-time $GW$ simulations within the nonequilibrium Green's functions approach scale at least cubically with propagation time, whereas improved scaling schemes such as time-local (adiabatic) approximations or the generalized Kadanoff–Baym ansatz usually retain only mean-field character in the spectra. The recently introduced real-time Dyson expansion recovers dynamical correlations in the spectrum at time-linear cost, but has so far been restricted to the second-order Born approximation with mean-field reference propagators. Here we formulate and implement the RT-DE for the nonequilibrium $GW$ self-energy with reference propagators of general form whose off-diagonal evolution is time local. In particular, we assess Hartree–Fock propagators, propagators with statically screened exchange with nonequilibrium screening, and a correlated propagator based on the Hartree–Fock GKBA. Benchmarks against exact diagonalization for a driven two-band lattice model with long-range interactions show that the mean-field and statically screened references yield the most accurate spectra, including satellite structures absent at mean-field level, whereas the GKBA-based approach best captures scattering-induced occupation dynamics, but artificially broadens and splits spectral peaks. When applied to large systems that are beyond the reach of exact methods, the scheme resolves the excitonic replica of the valence band and satellites identified as exciton shake-up, as well as their reshaping with increasing excitation density.
Read the full abstract
Materials Science
Edge-Dominated Twist Mechanics at van der Waals Interfaces
Despite the pivotal role of twist in modulating physical properties at van der Waals (vdW) interfaces, the mechanics governing torsional response remain poorly understood. Here, we probe twist mechanics at homo- and heterogeneous vdW interfaces, together with their sliding behaviors within a unified experimental framework. For both systems, the peak torque scales nearly linearly with contact area, in contrast to predictions from linear elastic and rigid models. Remarkably, while the sliding friction of the two interfaces diverges by over three orders of magnitude owing to different scaling laws, the corresponding torque follows the same linear scaling and differs by only about twenty-fold. Large-scale atomistic simulations reveal an edge-dominated yielding mechanism for torsional motion, wherein elastic reconstruction shifts the effective load-bearing region toward the edges, eliminating torque from the contact interior. This mechanism contrasts with the bulk-mediated stress transmission governing translational sliding, a distinction rooted in the different loading geometries inherent to the two motion modes, where torsional loading necessitates perimeter actuation, whereas sliding enables center-driven loading. This symmetry-imposed divergence demonstrates that translational and torsional properties cannot be predicted from one another at vdW interfaces, providing critical insights for the design of dynamically reconfigurable micro- and nanoelectromechanical devices.
Read the full abstract
Probability
Optimal Covariance Inflation under Gaussian Tilts
Covariance-sensitive analyses of Gaussian annealing for sampling from a convex body require controlling how much covariance can grow under a radial Gaussian tilt. For an isotropic convex body $K\subseteq\mathbb{R}^n$, let $\mu_{K,t} (\mathrm{d} x) \propto e^{-t\| x \| ^2} \mathbb{1}_K(x)\,\mathrm{d} x$, and let $Q_n$ be the supremum of $\|\operatorname{Cov}(\mu_{K,t})\|_{\mathrm{op}}$ over all such $K$ and all $t>0$. We prove the sharp bound $Q_n=\Theta(n^{2/5})$, closing the gap between the known $\Omega(n^{1/3})$ lower bound and the $O(\sqrt{n\log(en)})$ upper bound. The upper bound applies not only to uniform measures on convex bodies but to every compactly supported isotropic logconcave probability measure. It combines a dimension-free variance bound for quadratic forms with a Rényi comparison at a nearby time, projected moment estimates, and relative-entropy control along the Gaussian-tilt path. For the matching lower bound, we construct an explicit unconditional convex body whose axial coordinate is coupled to the transverse quadratic energy. Moderate-deviation estimates show that an appropriate tilt creates directional variance $\Omega(n^{2/5})$.
Read the full abstract
Systems and Control
The consequences of high SMR operating costs in electricity markets
As US power markets contend with growing demand for firm generation, the nuclear industry has offered Small Modular Reactors (SMRs). However, how these concepts would fare in a rapidly evolving power grid is unclear, given the paucity of operational examples. Current literature, informed by substantial cost escalations for traditional nuclear plants, focuses on the investment costs SMRs need to achieve for private investment feasibility. However, this work finds that the operating and marginal costs of SMRs are more critical to economic feasibility in market environments. This work dispatches SMRs using a flexible operations model, considering revenue from two main electric markets, capacity and wholesale energy markets, with and without policy support. Manufacturer advertised costs for investment and operating costs are used, with fuel costs calculated from manufacturer provided design parameters. Results indicate that SMRs are uneconomical primarily because investment cost reductions are offset by increased marginal costs. As such, an environment of prices and subsidies beyond historic norms are necessary to attract private investment at manufacturer advertised cost benchmarks. Current SMRs are as profitable as advanced estimates of the AP1000 traditional nuclear reactor, and if investment costs escalate at the average rate for nuclear projects, they are similar to Vogtle 3 & 4. In projected future power markets, reductions in marginal cost may be more beneficial than those in investment costs.
Read the full abstract
Soft Condensed Matter
Thermomechanics of dense granular materials: a particle-scale perspective
The paper presents a broad thermomechanic framework for the isothermal rate-independent constitutive behavior of dense granular materials. The essential quantities in this framework are directly measurable in discrete element (DEM) simulations: free energy, dissipation, stress, and strain. The paper proposes that energy and dissipation are governed by two sets of internal variables: fabric variables that control the reversible stiffness and structure variables associated with internal sliding. The relevant fabric variables are identified and measured with simulations. Two hypotheses are considered for the structure variables: the macro-scale irreversible strain and an aggregate measure of the micro-scale frictional forces among sliding contacts. Both hypotheses are tested with simulations, which allow direct calculation of the internal variables. The paper then demonstrates the manner in which the measured variables are applied in incremental constitutive models. Among other findings are the following. (1) Dissipation from contact sliding is pervasive and occurs in all directions of incremental loading. (2) Contact motions are not reversed by a reversal of the strain direction, and contacts continue to slide when loading is reversed. (3) The free energy can not be assumed smoothly differentiable; instead, Gâteaux derivatives must be used with irreversible effects. (4) Basic assumptions of elastoplasticity are contravened: no region of purely reversible strain exists, no uniform yield direction exists, no uniform flow direction exists, and irreversible strain is not proportional to the projected total strain. A three-mechanism elastoplasticity model, however, closely fit the DEM results, and methods are demonstrated for quantifying the model. The results emphasize that advanced constitutive models are needed for capturing the general incremental behavior of granular materials.
Read the full abstract
Strongly Correlated Electrons
Positive Temperature Coefficient of Anisotropy due to $d^6L$ Groundstate in $\epsilon$-Fe$_2$O$_3$
Positive anisotropy temperature coefficients ($dK/dT>0$) usually arise from hybridization between magnetic 3d states and strongly spin-orbit-coupled (SOC) subsystems. Yet $\epsilon$-Fe$_2$O$_3$ shows $dK/dT>0$ (125-200~K) without an obvious SOC partner. We study pure and Cr-doped (with weakened Fe-O hybridization) $\epsilon$-Fe$_2$O$_3$ across the transition from low temperature incommensurate to high-anisotropy magnetic phases. We identify a $d^6L$ groundstate in $\epsilon$-Fe$_2$O$_3$ while reduced hybridization yields $d^6 + d^6L^2$ in the Cr-doped system, highlighting metal-ligand hybridization as a route to tune magnetic, electronic and orbitronic properties.
Read the full abstract
High Energy Physics (Experiment)
A virtual reality extension for the Geant4 toolkit
Geant4 is a toolkit for simulating particle interactions in matter that is widely used in particle physics, nuclear physics, medical imaging, and astrophysics. At present, Geant4 visualizations are generally viewed on a conventional, two-dimensional computer display. To enhance immersion, we have developed G4VR, a virtual reality (VR) application that extends Geant4 with VR capabilities, providing a more intuitive and comprehensive way to understand these interactions. The user running G4VR in a headset can get detailed information about individual tracks, interactions, and energy depositions by selecting them with the hand controllers. G4VR also allows the user to examine the chronology of interactions, and includes animations of entire events as immersive movies. G4VR includes built-in event displays of several types that allow a first-time user to easily explore its various functionalities. To interface with Geant4, we have developed a new visualization driver called G4XR that allows direct integration with the Geant4 source code. This enables any Geant4 experiment to be loaded and experienced in VR seamlessly.
Read the full abstract
Quantum Physics
Resilience Beyond the Light Cone: Error-Detected Primitives for Practical Dynamic Circuits
Dynamic circuits, which augment unitary operations with mid-circuit measurements and classical feedforward, can generate long-range entanglement in constant depth, enabling low-depth primitives ranging from nontrivial state preparation to many-qubit entangling gates. Escaping the light-cone constraints of unitary circuits, however, comes at a cost: these primitives typically require a number of mid-circuit measurements that scales with system size and that, together with feedforward latency, can introduce errors that degrade the long-range entanglement they rely on. Here, we alleviate this tension by showing that many such primitives, when cast into a common framework, admit an error-detection scheme that trades infidelity for postselection overhead with no additional ancillas. Our framework thus unifies and upgrades a broad class of primitives including fan-out gates, multi-qubit Pauli rotations, the preparation of W and higher-weight Dicke states, and certain non-normal matrix product states. We also introduce a reduced-depth, error-detected implementation of the Hadamard test, extending the use cases of dynamic circuits to a key algorithmic primitive. Finally, we establish the practical utility of our scheme through experiments on a superconducting quantum processor. We demonstrate the error-detected preparation of a long-range entangled Bell pair spanning a 100-qubit chain with fidelity $F=0.59\pm0.02$, surpassing the entanglement-certification threshold $F>0.5$ that the baseline dynamic-circuit implementation fails to reach ($0.39\pm0.01$). Separately, we demonstrate constant-depth preparation of W states of up to 20 qubits by consuming GHZ states of up to 40 qubits, finding absolute fidelity improvements of $\Delta F\approx 0.2$ across the largest sizes studied. Altogether, these results bring low-depth dynamic-circuit primitives within practical reach on present-day hardware.
Read the full abstract
Analysis of PDEs
Exact high-order GPT cancellation in noncircular multilayers
This paper is concerned with exact high-order generalized polarization tensor (GPT) cancellation in two-dimensional noncircular multilayers with finite positive isotropic coating conductivities. We first prove that, for every admissible cyclically symmetric core–shell geometry, there exists a unique positive coating conductivity for which the structure is weakly neutral to every uniform incident field. For higher orders, we establish locally unique coating conductivities that cancel the complete \(K\)-contracted GPTs (K-CGPTs) block on a broad class of fixed noncircular multilayers with cyclic symmetry. This includes homothetic multilayers generated by strictly star-shaped symmetric domains, without assuming that the geometry is close to concentric disks. We also replace the near-background condition by a small-core condition covering finite, insulating, and perfectly conducting cores. By varying selected interface modes together with the coating conductivities near a radial GPT-vanishing structure, we further construct exact families with neither rotational nor reflection symmetry. For three coatings, the relevant nondegeneracy conditions and an explicit chiral example are rigorously certified. Finally, we show that the resulting cancellation yields enhanced near-cloaking for every entire harmonic incident field. A set of certified numerical examples fully corroborates the theoretical predictions established in this work.
Read the full abstract
Solar and Stellar Astrophysics
Now you see me, now you don't: Deep, long-lived obscuration events of white dwarfs by dust and debris from disintegrating planetesimals
Transiting dust and debris around white dwarfs provide a direct view of planetary disruption. We report six previously non-variable white dwarfs that underwent single, deep obscuration events, including ZTF~J2327+0019, which fully disappeared for more than a year. These discoveries raise the number of confirmed debris-transit white dwarfs to 20. In addition, the systematic search of negative alerts from the Zwicky Transient Facility (ZTF), followed by photometric and spectroscopic observations, also identified three hot ($T\approx 55000$–$92000$ K) irregular variables as candidate debris hosts. The six confirmed events last weeks to years, reach transit depths of 25–100%, and show no recurrence over the 8-yr ZTF baseline. They are therefore much deeper and longer lived than the recurring, minute-scale transits typical of previously known systems. The observed reddening is consistent with dust extinction, and high-speed photometry reveals minute-scale structure in several systems, indicating rapidly moving material close to the white dwarf. ZTF~J2327+0019 also shows a simultaneous WISE infrared brightening, the first observed coincidence of infrared brightening and optical obscuration in a white dwarf. Two of the six hosts, one DAZ and one DBZ, are strongly metal enriched, with accretion rates among the highest known for their spectral types and minimum accreted masses of $3.5\times 10^{19}$ and $2\times 10^{24}$ g. We interpret the one-off transit events as collisions between planetesimal remnants and pre-existing circumstellar debris that trigger collisional cascades: short-timescale variability traces dust-producing fragments crossing the star, while slower changes trace the build-up and clearing of an optically thick dusty structure. In contrast, ZTF~J0436+5728 shows a coherent 5.910-h period, consistent with a rocky body shedding material near the tidal-disruption radius.
Read the full abstract
Classical Analysis and ODEs
Endpoint bounds for the Born-Jordan distribution
For $d\geqslant3$, let $p^*=\frac{2d}{d-2}$. We prove that the Born-Jordan distribution maps $L^{2,p^*}(\mathbb R^d)\times L^{2,p^*}(\mathbb R^d)$ boundedly into $L^{p^*}(\mathbb R^{2d})$. The Lorentz index $p^*$ cannot be increased in either variable. In particular, this gives the endpoint $L^2\times L^2\to L^{p^*}$ estimate, settling the critical boundedness problem raised by Stra, Svela, and Trapasso \cite{SST26}.
Read the full abstract
Functional Analysis
A negative solution to the complemented subspace problem for Banach spaces with unconditional bases
We give a negative solution to the complemented subspace problem for Banach spaces with unconditional bases over both the real and complex fields. For every $\rho>0$, we construct a projection $P_\rho$ of norm less than $1+\rho$ on a separable superreflexive space \begin{equation*} X_\rho=\left(\bigoplus_{j=1}^{\infty}\ell_{p_j}^{N_j}\right)_2, \qquad p_j\downarrow2, \end{equation*} such that $Z_\rho=P_\rho(X_\rho)$ and its dual $Z_\rho^*$ have Schauder bases but admit no unconditional bases. Over the real field, both spaces have Gordon–Lewis local unconditional structure (GL-lust) but fail Dubinsky–Pełczyński–Rosenthal local unconditional structure (DPR-lust), disproving a conjecture of Figiel, Johnson and Tzafriri. In particular, neither is isomorphic to a Banach lattice, giving a negative solution to the separable Banach-lattice complemented subspace problem. A modification of the construction also shows that the class of separable real Banach lattices is not primary. A Lean 4 formalisation of the main results accompanies the paper.