Quantum Physics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 8 September
The wave function prepared by a variational quantum eigensolver (VQE) can contain a substantial classically tractable component, yet its energy contribution is sampled on the quantum device. Representing the wave function as a combination of a classical reference and separately prepared quantum states allows the reference energy to be evaluated without quantum sampling. However, near-linear dependence among these components can amplify measurement errors and destabilize the resulting energy estimate. We introduce Classical Active-Space Hybrid Quantum Subspace Expansion (CASH-QSE), which retains a complete-active-space self-consistent field (CASSCF) reference classically and uses occupation structure to construct quantum states exactly orthogonal to the reference and to one another. The energy follows from an ordinary Hermitian eigenvalue problem without overlap measurements, while the same occupation constraints simplify the measured operators. Using full configuration interaction to guide component selection, we test CASH-QSE along H$_2$O and N$_2$ bond-stretching coordinates spanning weakly to strongly correlated regimes. The benchmarks use STO–3G for both molecules and a restricted cc-pVDZ orbital space for H$_2$O. CASH-QSE reaches chemical accuracy while limiting the largest complete measurement circuits to a few hundred all-to-all logical controlled-NOT gates. In favorable cases, it also reduces the idealized final-energy sampling cost by several orders of magnitude relative to VQE with an adaptive derivative-assembled pseudo-Trotter ansatz (ADAPT-VQE).
Probability
On overlap concentration in the Curie-Weiss Random Field model
We show that the overlaps of two independent replicas drawn from the Gibbs measure of the Curie–Weiss model with random field (CWRF) exhibit sub-Gaussian tails when the inverse temperature $ \beta < 1$ and the random field is drawn from a Gaussian distribution that makes the expected magnetization of the CWRF equal to its expected overlap in the thermodynamic limit. To show this, we prove finite-moment concentration via a rigorous Laplace approximation for a certain random rate function, and “bootstrap” it to a uniform bound for the moment-generating function of the squared overlap deviations using a sharp analysis of the associated rate function.
Read the full abstract
Quantum Physics
Saving resources through repeat-until-success positive-operator-valued-measure measurements in quantum computation
We present a quantum computation approach in which computation is guided by positive-operator-valuedmeasure (POVM) measurements following a given computation path in multisteps. In this approach, one ancillary qubit is coupled to a register of working qubits, and a POVM measurement is implemented effectively on the working qubits by applying a unitary operation on the whole system followed by a projective measurement performed on the ancillary qubit. Each step of the computation is a repeat-until-success procedure such that the desired state of the step is obtained deterministically on the working qubits via POVM measurements. The principle of deferred measurement states that measurements can always be moved from an intermediate stage of a quantum circuit to the end of the circuit without affecting the efficiency of the computation.We demonstrate that in our approach, by introducing intermediate measurements on the ancillary qubit in the computation process, both the number of qubits and unitary operations can be reduced polynomially, compared to the case where the intermediate measurements are deferred to the end of the computation. We also provide a method for implementation of the approach.
Read the full abstract
Computer Vision
Boundary Voting Network for Ambiguity-Aware Timestamp-Supervised Action Segmentation
Timestamp-supervised action segmentation aims to segment and classify actions in untrimmed videos with a random frame annotated per action. Precisely localizing action boundaries from timestamp annotations is crucial for this setting, as it enables generating framewise pseudo-labels and applying the well-explored fully-supervised training. However, prevailing methods struggle with intrinsic uncertainty in boundary localization due to less discriminative features in action-transiting regions. This imprecise boundary estimation significantly reduces the stability and reliability of the generated pseudo-labels in ambiguous action-transiting regions, consequently resulting in performance deterioration of the trained segmentation models. In our paper, we introduce the boundary voting network that mitigates feature ambiguity by hierarchically propagating video-level global prior knowledge into local action-transiting regions. By generating key action representations as votes throughout the video and targeting action-transiting regions, all votes collaboratively contribute to action-transiting feature enhancement and boundary localization refinement. Extensive experiments demonstrate the effectiveness of our method on GTEA, 50Salads, and Breakfast datasets.
Read the full abstract
General Finance
AI for AI: Optimizing Additional Infrastructure Build-out to Power Artificial Intelligence Data Centers
The twenty-first century's transformative technology, artificial intelligence, is increasingly constrained by the twentieth century's transformative technology, the electricity grid. Rapid growth in electricity demand from data centers is leading to higher electricity prices, without a compensating supply-side response. We develop a framework linking data-center load growth, available generation capacity, and market-clearing prices to understand this phenomenon. We first analyze a deterministic model to show how differing estimates of demand and supply growth rates affect prices. We then model the expansion of new data centers and their associated electricity demand, together with build-outs of new electricity supply, as stochastic processes,resulting in probabilistic distributions of supply, demand, and prices rather than a single forecast. Finally, we formulate generation expansion as a stochastic control problem in which a revenue-maximizing investor dynamically chooses the intensity of supply-side investments. The analysis highlights a central challenge of the data-center build-out: even when rapid demand growth increases the need for new generation, the uncertainties related to load forecasts, development execution risks, and value cannibalization from overbuilding capacity may weaken incentives to invest at the pace required to keep electricity prices stable.
Read the full abstract
Genomics
A Transformer-Based Delta Expression Encoder for Psilocybin Transcriptional Response: Architecture, Representations, and Biological Validation
Understanding why individuals respond differently to psilocybin requires modeling the drug's transcriptional perturbation signature at the cell-type level. I present a Transformer-based delta expression encoder that learns to classify differential gene expression status - upregulated, downregulated, or neutral - from single-nucleus RNA-sequencing data, without supervision from pathway annotations or prior biological knowledge. The model is trained on pseudobulk profiles from 623 examples spanning 18 cell types, 2 drug conditions, and 6 timepoints derived from the Liao et al. 2025 dataset, and achieves 69.4% weighted classification accuracy. Three principal findings are reported, alongside one direct test of a published hypothesis that returned a result inconsistent with that hypothesis. First, per-cell-type classification accuracy ranges from 28.3% (L2/3 IT, a primary HTR2A-expressing psilocybin target) to 99.6% (endothelial cells), consistent with known psilocybin response biology. Second, psilocybin-induced transcriptional downregulation is significantly more stereotyped across individuals than upregulation (Mann-Whitney U=18615.0, p<0.0001), a novel finding with a cortical depth gradient across excitatory subtypes. Third, attention-guided gene co-regulation analysis recovers drug-specific modules without pathway supervision. Separately, a direct test of whether baseline HTR2A expression predicts drug-response separability across cell types found a significant negative correlation (Spearman r = -0.7088, p = 0.0021), the opposite of what a simple HTR2A-gating account would predict.
Read the full abstract
Robotics
Dual-Layer Semantic-Spatial Belief Mapping for Aerial Object Goal Navigation
Aerial Object Goal Navigation (ObjectNav) requires an unmanned aerial vehicle (UAV) to locate a described target in an unknown outdoor environment using onboard visual observations. Vision-language models (VLMs) can interpret open-ended target descriptions and visual observations, but their frame-level outputs are often noisy, sparse, and spatially transient. We propose AeroBelief, a dual-layer semantic-spatial belief mapping framework that transforms transient VLM observations into persistent spatial guidance. It separates broad contextual plausibility from target-specific evidence: an intuition layer accumulates scene-level semantic cues for exploration, while an evidence layer preserves qualified target-specific observations for approach and confirmation. Evidence-gated fusion combines the two layers into spatial belief hotspots. We further introduce object-conditioned visual reasoning with conservative evidence qualification to improve observation reliability before spatial accumulation. In parallel, egocentric regional guidance converts quadtree coverage into UAV-centered, yaw-aligned directional proposals and stabilizes them through temporal commitment. Its regional scoring is independent of semantic belief values, maintaining exploration pressure and reducing repeated low-gain search. Experiments on the UAV-ON benchmark show that AeroBelief achieves the best reported overall SR, OSR, and SPL among the compared methods, reaching 21.61%, 35.57%, and 10.62, respectively. These results support the effectiveness of persistent semantic-spatial belief, conservative evidence qualification, and temporally stable regional guidance for aerial ObjectNav.
Read the full abstract
Quantum Physics
Quantum-state texture measure and texture transformation
Quantum-state texture quantifies structural irregularities of a state in a selected basis and has emerged as a valuable resource for gate characterization in universal circuits. Consequently, a class of contractive distance based texture measures and a framework for constructing convex-roof extended texture measure have been proposed. Here, we extend this theory in several directions. We examine the convertibility of a pure state to any state under texture-free operations, and fully solve the deterministic transformation problem between any two states in the qubit case. We then propose two classes of texture measures: convex-function-based measures and texture cost defined via minimal cost of texture contained in pure states. Moreover, we show that every texture monotone gives rise to a non-negative function which admits the same properties as the function used in the convex-roof extension—thus providing a converse to that construction. Our work thereby offers a relatively comprehensive resource-theoretic formulation of quantum-state texture.
Read the full abstract
Artificial Intelligence
WorldAgen: Unified State-Action Prediction with Test-Time World Model Training
How can vision-language-action (VLA) models adapt to new environments where world dynamics shift? While recent research has combined world modeling and action prediction to improve VLA performance, existing methods largely rely on pretraining on static datasets, without mechanisms for active adaptation at deployment time. As a result, these models often fail to generalize when deployed in unseen scenarios with novel object configurations or dynamics. We present WorldAgen, a unified framework that jointly learns world modeling and action prediction while enabling Test-Time Training (TTT) to adapt to new environments. WorldAgen employs a shared Transformer backbone with two heads: (1) a world model head that predicts future states from past state-action trajectories, and (2) an agent model head that predicts actions conditioned on task instructions. We design a Mixed Unidirectional Attention Mask to separate these two models. During test time, WorldAgen samples exploratory actions, collects ground-truth state transitions, and performs lightweight TTT updates to refine its world model. This adaptation improves the model's understanding of the environment and leads to more accurate action predictions. Experiments on the CALVIN and LIBERO benchmarks demonstrate that our baseline model achieves comparable, and in some cases superior, performance to current state-of-the-art approaches. Moreover, with TTT on a small number of samples, our method surpasses existing state-of-the-art models, highlighting the effectiveness of adapting world models at inference time.
Read the full abstract
Computation and Language
Snugi-AI-v2 @ eRisk 2026 Task 2: Early Depression Detection via a Learned Stopping Policy with Sustained Confidence Gate
We describe the Snugi-AI-v2 submission to eRisk 2026 Task 2, the second edition of contextualized early depression detection from Reddit discussions. Our central contribution is a learned MLP stopping policy trained to directly optimize ERDE50, replacing the fixed and tiered threshold strategies used in all prior eRisk Task 2 submissions. Combined with a sustained confidence gate that commits only after N=3 consecutive rounds of high policy confidence, the system reduces false positives caused by transient emotional posts without sacrificing recall. The pipeline encodes each discussion thread with a frozen MentalRoBERTa model, maps the accumulated representation to a depression probability via an MLP classifier, and delegates the timing decision to the learned policy. Our best run achieves F1 = 0.73 (Run 1) and F_latency = 0.70 (Runs 0 and 3), with a median alert round of 8 out of 500, completing the full evaluation in 1 hour 26 minutes, the fastest among all complete-submission teams. We report a systematic ablation across five runs spanning two encoder variants, four stopping strategies, and three gate values, along with negative results from GRPO policy training, BDI-II post filtering, MentalLongformer encoding, and DeBERTa ensembling. Code: https://github.com/chiuyuwen91/erisk-2026
Read the full abstract
Databases
Generalized DBLog: A Verified Contract for Interleaving Copied Rows with a Change Log
Change-data capture (CDC) feeds downstream systems like caches, search indexes, and data warehouses from a database's log of committed row changes. When bootstrapping, adding a table, or repairing downstream data, a pipeline must also copy existing rows. Merging this copy with the active log introduces the copy-to-log handoff problem. Changes must not fall through a gap, and older copied state must not overwrite a newer logged update or resurrect a deleted row. DBLog, developed at Netflix, addressed this problem by reading tables in chunks and interleaving those reads with the live log. Watermarks identify the changes that overlap each read, and the log wins when a copied row is stale. Debezium and Flink CDC have since adapted this design. Earlier work proved that applying the original algorithm's copied rows and logged changes in their emitted order reconstructs the source's rows, including the effect of every logged insert, update, and delete processed. Generalized DBLog asks when the same result holds for variants of that design. We state the conditions the source and capture implementation must satisfy. Once copying and reconciliation are complete, we prove that the result holds across all selected tables and key ranges even when their rows were read at different times. A single database snapshot is not required for the copy. Further logged changes advance the reconstructed state one event at a time. We establish these guarantees for classic watermarking, Debezium's signal-table and read-only modes, Flink CDC's parallel chunks, reads and dumps tied to exact log positions, and engine-consistent backups whose log position lies within known bounds. The complete theory is machine-checked in Isabelle/HOL, its core independently verified in Lean 4, and the protocols are also examined by bounded model checking in TLA+.
Read the full abstract
Robotics
OmniNav: Robust Long-Horizon Target Navigation in Dynamic Environments
Long-horizon target navigation requires a robot to sustain task execution across evolving observations, decisions, and physical interactions. This requires three coupled capabilities: maintaining valid scene memory, revising target beliefs under partial observability, and selecting interaction-feasible navigation endpoints. However, the state underlying each capability is only conditionally valid: scene representations become stale when objects move or disappear, unsuccessful searches alter beliefs over target locations, and geometrically convenient endpoints may still be infeasible for manipulation. To address these challenges, we present OmniNav, which formulates long-horizon navigation as continual inference over a factorized task state posterior coupling scene validity, target belief, and interaction feasibility. For representation, OmniNav incrementally constructs an updatable 3D object scene memory, preventing stale scene evidence from propagating to subsequent decisions. For exploration, it introduces an evidence-aware Bayesian belief-revision mechanism that derives dependency-aware region priors from semantic context, incorporates unsuccessful searches as negative evidence, and updates them for posterior-guided frontier selection. For interaction, OmniNav incorporates manipulation reachability and collision constraints into navigation-endpoint selection and propagates execution feedback through hierarchical closed-loop recovery. Extensive experiments demonstrate that OmniNav achieves the highest success rates among the compared methods on semantic ObjectNav and fine-grained instance navigation benchmarks, remains robust to target relocation, and improves real-world pick-and-place success from 53.3% to 71.7% over an adapted open-loop baseline. The project page of OmniNav is available at https://omni-nav.github.io/.
Read the full abstract
Analysis of PDEs
Two global stability theorems for small-data $3D$ compressible Euler solutions: Unique maximal globally hyperbolic developments with gradient-blowup & smooth global existence in the entire spacetime
We prove a pair of complementary small-data stability theorems describing the global future and past structure of classical solutions to the isentropic, spherically symmetric $3D$ compressible Euler equations. We allow any equation of state with positive sound speed, except that our shock-formation results do not apply to the Chaplygin gas. Our first theorem concerns open sets of smooth Cauchy data that are perturbations of trivial data with vanishing velocity and constant positive density. The perturbed data have finite kinetic energy, and the perturbed density is equal to a positive constant plus a signed “asymptotically flat” tail. Our main theorem yields a complete description of the existence and uniqueness of the maximal globally hyperbolic development (MGHD) of the data. The boundary of the MGHD contains hypersurfaces that extend to spatial infinity on which our solutions develop gradient-singularities. This is the first MGHD existence-uniqueness-stability result for shock-forming solutions for any multi-$D$ quasilinear wave system. While prior works have yielded local portions of “candidate” MGHDs, neither the existence nor the uniqueness of an MGHD can be inferred from local considerations. Our second theorem considers analogous data with the opposite sign of the $1/r$ density tail. We prove global existence throughout spacetime, to both the future and past. The solution's asymptotic behavior towards null infinity is not linear, but rather is distorted by a logarithmic bending of the sound cones away from the flat Minkowski ones, leading to logarithmically enhanced dispersion. This is the first small-data global existence result in the entire spacetime for any $3D$ quasilinear wave system that fails to satisfy the null condition and the weak null condition. The main mechanism of stabilization is a global-in-spacetime rarefaction effect, tied to the $1/r$ tail.
Read the full abstract
Combinatorics
Multicolor Ramsey numbers of ordered matchings
For an ordered graph $H$ and an integer $q\geq2$, let $r_{<}(H;q)$ denote the $q$-color ordered Ramsey number of $H$. Conlon, Fox, Lee and Sudakov asked whether, for every $q\geq3$, there is a constant $c_q$ such that $r_{<}(M;q)\leq n^{c_q\log n}$ for every ordered matching $M$ on $n$ vertices. We answer this negatively in a strong form: for every $q\geq2$, there is $c_q>0$ such that almost every perfect matching $M$ on $[n]$ satisfies $$r_{<}(M;q)>2^{c_q(\log n)^q/(\log\log n)^{q-1}}.$$ This matches the general upper bound up to a factor of $(\log\log n)^{q-1}$ in the exponent. We also give two applications. First, we prove a lower bound conjectured by Fox, He and Wigderson for multicolor Ramsey numbers of acyclic digraphs. Second, we strengthen a result of Axenovich, Rollin and Ueckerdt by giving a superquasipolynomial lower bound on the maximum chromatic number of $M$-free ordered graphs, for almost every perfect matching $M$ on $[n]$.
Read the full abstract
Computation and Language
When Metrics Reward the Worst Translations: Internalizing Cultural Reasoning for Social Media Translation Evaluation
Automatic translation quality metrics trained on general-domain corpora systematically fail on social media content, where communicative intent is encoded in culturally loaded expressions (internet slang, homophonic ciphers, and platform-specific idioms) rather than surface token patterns. We conduct a systematic empirical analysis demonstrating that standard metrics including COMET, XCOMET, and BERTScore exhibit near-zero or negative correlation with human cultural judgments, and even display a severity inversion in which scores increase as translation quality deteriorates. We further show that this failure extends to large language model judges: Qwen3-235B achieves Cohen's kappa of only 0.162, revealing that the bottleneck is not reasoning capacity but cultural grounding: models lack the domain-specific cultural knowledge needed to identify which aspects of a translation require scrutiny. To address this, we propose CuRIL, a reinforcement learning framework that internalizes cultural reasoning: cultural annotations are prepended inside the model's reasoning, excluded from policy gradients via a token-level loss mask, and injected with a probability that decays to zero over training, progressively forcing autonomous cultural judgment. On a 1,444-sample human-annotated social media translation benchmark, Qwen3-8B trained with CuRIL achieves Cohen's kappa 0.370 and Exact Match accuracy of 45.22%, approaching Gemini-3.1-Pro with 30x fewer parameters and surpassing models up to 235B in scale. We further demonstrate that our judge produces reliable reward signals for downstream translation optimization, reducing the low-quality translation rate by over 20 percentage points under independent human evaluation.
Read the full abstract
Computer Vision
SciFigure2Code: An AI-Reconstructed Benchmark for Scientific Figure-to-Code
Scientific figures are the interface through which research claims are inspected and reused, but final published panels rarely expose the data or plotting code that produced them. Recovering this hidden provenance from pixels is therefore underdetermined. We introduce SciFigure2Code, an AI-reconstructed benchmark that evaluates presentation recovery: generating editable Python programs that preserve how a scientific panel is arranged and read. Role-specialized Codex agents generate, execute, visually refine, and audit silver-standard presentation programs that capture geometry, visual hierarchy, encodings, annotations, and typography. This reconstruction-and-audit protocol turns final published panels into auditable reference packages; the resulting resource contains 6,740 reviewed panels and SciFigureBench, a balanced 337-panel test set across 31 chart subtypes, five domains, and three complexity levels. Across 14 zero-shot models, execution and structural fidelity remain weak; a 328-panel full-figure study further exposes failures to locate and isolate requested panels. Claude Opus 4.7 leads image-only reconstruction, Claude Opus 4.6 leads caption-assisted reconstruction, and plan-then-code prompting improves all four tested models. SciFigure2Code provides an auditable testbed for constructing editable, visually faithful scientific figure presentations.
Read the full abstract
Information Theory
Function Tables for Secure Distributed Matrix Multiplication
We introduce function tables, an entrywise representation of the coefficient functions that appear in the worker responses of a secure distributed matrix multiplication (SDMM) scheme. We work under the outer-product partition, with $K$ row blocks, $L$ column blocks, and privacy against any $T$ colluding workers, in the general model of linear encoding and linear decoding. In this representation, privacy is a rank condition on the data and mask coefficients, and decodability is linear independence of the desired entries modulo the nuisance space. Degree tables, cyclic-addition tables, and algebraic-geometry constructions are the special cases obtained by restricting the coefficient functions to a structured family; we impose no such restriction, so our converses bind every linear scheme. For $T=1$, we determine the exact optimum over every finite field $\mathbb{F}_q$: it is $KL+K+L$ when $q\geq3$, and $KL+K+L+1$ over $\mathbb{F}_2$, where the identity $z^2=z$ forces one more worker. For arbitrary $T$, we prove $N\geq KL+K+L$ and $N\geq\max\{K,L\}+T$ with no MDS hypothesis on the masks; the first is stronger than the previously known bound $KL+\max\{K,L\}+2T-1$ whenever $\min\{K,L\}\geq2T$. We then reduce field feasibility exactly to MDS existence: a scheme exists over $\mathbb{F}_q$ if and only if an $[\max\{K,L\}+T,T]$ linear MDS code does, and whenever it does, a Cartesian construction attains $N=(K+T)(L+T)$ over that same field. For $T=2$ this makes $q\geq\max\{K,L\}+1$ necessary and sufficient, and we give a projective-line construction with $N=KL+K+L+2$ whenever $KL+K+L$ divides $q-1$; for $K,L\geq2$ it matches the best known worker count while requiring only an element of order $KL+K+L$.
Read the full abstract
Machine Learning
Geodesic-informed Generative Diffusion Model For Topology-preserved Image Video Generation
Generative diffusion models have emerged as a class of powerful techniques for various imaging applications, including but not limited to synthesis, reconstruction, and segmentation. Despite their success, current generative models pose two key limitations. First, they primarily rely on image intensity and texture information, with limited attention to underlying object geometry. As a result, they do not guarantee geometric or topological consistency during the generation process, which is a crucial requirement for high-stakes domains such as computational anatomy, biology, and robotics, where preserving object structure is critical. Second, existing models fail to explicitly learn or represent shape changes in the generative process. Such deformation dynamics remain occluded within network parameters; hence leaving the transformation process uninterpretable and physically uninformed. To address these challenges, we introduce IGG (Image Generation informed by Geodesic dynamics), a novel framework that integrates topology-preserving geodesic principles into the diffusion-based generative process. In contrast to conventional methods that operate in image intensity space, IGG learns and synthesizes diverse samples within geodesic deformation spaces, where geometric object changes are learned as smooth and invertible smooth mappings from a given template/source image. Our code is publicly available at https://github.com/nellie689/IGG.
Read the full abstract
Machine Learning
Topology-induced Operators Reveal Complementary Graph Representations without Training
Graph representation learning has largely focused on designing increasingly sophisticated models to transform graph topology into vector representations, or embeddings. However, the extent to which embedding quality depends on model learning, rather than on the underlying topological transformations, remains unclear. Here, we show that informative embeddings can be derived without complicated model design and gradient-based training. Propagating random features through implicit hierarchical structures induced by random walks and anonymous walks yields embeddings that capture node proximity and structural role, respectively. These two training-free embeddings preserve complementary aspects of graph organization and perform competitively with classic and recent methods across various node-, edge-, and graph-level tasks. They often require substantially less computation, resulting in a favorable quality-efficiency trade-off. Combining the two types of embeddings further improves inference quality of some tasks compared with using either embedding type alone. Our results suggest that informative graph embeddings can arise from carefully chosen topological transformations before any learning operation is applied.
Read the full abstract
Optimization and Control
M-duality in fixed-point problems for general normed spaces
Solving fixed-point problems by reducing residual bounds is one of the central approaches in fixed-point iteration, and, in particular, the Halpern iteration is known to effectively reduce the residual. Recently, a new type of duality theorem has been discovered in the convex optimization and fixed-point problem literature and establish a certain symmetry in the convergence behavior of algorithms that are dual to each other. However, these duality theorems rely on a Lyapunov-style proof structure and mostly focus on Hilbert spaces. In this work, we first establish an M-duality theorem for Mann iterations with Lipschitz operators in general normed spaces, assuming only mild conditions on the coefficients of the iterations. Moreover, leveraging this M-duality, we derive new algorithms that attain a strictly smaller worst-case residual bound than that of the Halpern iteration, which was previously known as the state-of-the-art method in general normed spaces.
Read the full abstract
Analysis of PDEs
Asymmetric Periodic Water Waves in Finite Depth
We consider the full two-dimensional water-wave equations in finite depth, with and without surface tension. Water waves have been studied mathematically for more than two centuries. Reflection symmetry remains a common assumption in constructions of periodic steady waves, although asymmetric profiles have been observed in experiments and numerical computations. We construct families of periodic stationary solutions whose free surfaces have no axis of reflection, in both the pure-gravity and capillary–gravity cases. To the best of our knowledge, this provides the first rigorous construction of asymmetric periodic pure-gravity waves for the full two-dimensional water-wave problem in finite depth. The proof combines localized vorticity laws with a Lyapunov–Schmidt reduction. In the pure-gravity case, we introduce a small background shear flow to obtain an invertible boundary operator and couple the interior and free-surface approximations at leading order.
Read the full abstract
Artificial Intelligence
SWE-Bench Pro Verified: A Reliable Benchmark for Software Engineering Agents
SWE-Bench Pro has emerged as a standard benchmark for evaluating software engineering agents on challenging repository-level tasks. However, our analysis work show that its evaluation is undermined by two sources of unreliability: reward hacking, enabled by leakage of gold solutions or hidden evaluation information, and task quality issues, including misleading problem statements and improperly scoped tests. These issues can inflate benchmark performance and obscure agents' true coding ability. We present SWE-Bench Pro Verified, a verified version of SWE-Bench Pro that addresses both problems. Our approach combines anti-hacking safeguards that eliminate major leakage channels without disrupting normal agent functionality, with task refinement that minimally corrects inconsistencies within flawed instances. Evaluations on SWE-Bench Pro Verified reveal that some models perform substantially worse than previously evaluated, suggesting that existing results on SWE-Bench Pro may overestimate real software engineering capability. SWE-Bench Pro Verified offers a more trustworthy benchmark for assessing software engineering agents.
Read the full abstract
Computer Vision
MRI-Guided Reslice-Refined Cross-Slice SDF Reconstruction of the Left Ventricle from Cardiac MRI with Sparse Axial Supervision
Reconstructing a three-dimensional left-ventricular (LV) endocardial surface from cardiac magnetic resonance (CMR) data is challenging when supervision is available on only a small number of axial slices. Through-plane geometry is weakly constrained, and automatically generated two-dimensional masks can propagate segmentation errors into the recovered shape. We present MR-RS-SDFR, a per-case implicit signed distance field (SDF) framework that reconstructs a continuous LV surface from a CMR volume and sparse axial weak masks. The method first builds a cross-slice SDF initialization from axial and longitudinal geometric cues and then refines the field using two complementary signals: MRI edge-field normal alignment, which provides an image-derived boundary cue independent of the weak masks, and differentiable reslice Dice and contour consistency, which preserve agreement with the observed planes. We evaluate three weak-mask generators – LOO TransUNet, LOO nnU-Net, and an off-the-shelf Medical SAM3 model used without MM-WHS-specific training or fine-tuning – and five sparsity levels from 4 to 64 axial planes. In the sparse-16 setting, final MR-RS-SDFR reconstruction reaches 0.928 Dice and 3.80mm HD95 with Medical SAM3 masks. The upstream generators do not exhibit a single common ranking across 2D and dense 3D segmentation, and nnU-Net- and Medical-SAM3-driven sparse reconstruction achieve the same mean final Dice despite different upstream error profiles. Across all three sparse-16 mask sources, MR-RS-SDFR is numerically better than protocol-matched full GHD+DVS in both Dice and HD95. Final Dice improves markedly from sparse-4 to sparse-16 and then saturates at the reported precision through sparse-64. These results support MRI-guided per-case SDF refinement as a reconstruction strategy that remains effective across weak-mask generators and supervision densities.
Read the full abstract
Computation and Language
ConversationalVoice: Full-Duplex Speech Data from Real Conversations through Source-Faithful Reconstruction and Conversation-Grounded Expansion
Full-duplex speech models require training data that preserves turn-taking, overlap, interruption, and backchannel behavior, yet these signals are entangled across speakers in noisy real-world recordings. We present Conversational Voice, a pipeline that converts real two-speaker excerpts into three complementary training-data artifacts. (1) Separation recovers speaker-specific tracks with stable speaker assignments, a canonical transcript, and naturally observed interaction timing. (2) Reconstruction generates speech in matched voices from a fixed source transcript, reconstructs the source turn order, pauses, and overlaps, and adds word-level alignment and delivery instructions. (3) Expansion generates new dialogue constrained by the source context, speakers, and observed interaction pattern. Automatic speaker-verification metrics remain strong across stages, with same-speaker similarity of 0.983-0.991 and positive discrimination margins of 0.199-0.209. Predicted speech quality (NISQA MOS) is 3.56 for separation, 4.41 for reconstruction, and 4.61 for expansion. A Gemini-based automatic evaluator assigns expansion mean scores of 4.94/5 for contextual coherence and 4.80/5 for dialogue naturalness. Expansion and reconstruction exhibit broadly similar interaction profiles; expansion's turn, overlap-event, backchannel, and interruption rates are 4.6%, 8.0%, 13.2%, and 16.0% lower, respectively. We evaluate data properties only; downstream gains in full-duplex model training remain for future work.
Read the full abstract
Other Condensed Matter
Transport properties and topological phase transitions for a Creutz-Su-Schrieffer-Heeger ladder
In this work, we investigate the electronic, topological, and transport properties of a Creutz-Su-Schrieffer-Heeger (CSSH) ladder. Using a tight-binding model within the Green's function formalism, we calculate the energy spectrum, local density of states (LDOS), and electronic transmission. We first determine the energy spectrum of the CSSH ladder and analyze the different topological phases present in the system, identifying one trivial phase and three distinct nontrivial regions. We then study electronic transport and show that the transmission reproduces the different topological phases through characteristic transport signatures. Finally, we derive the conditions for the emergence of non-topological flat bands and demonstrate that these bands also provide the necessary conditions for the formation of bound states in the continuum (BICs). Our results establish a direct connection between the topological properties, flat-band formation, and electronic transport in the CSSH ladder.
Read the full abstract
Astrophysics of Galaxies
The Roman eXtreme Deep Field (RXDF)
The Roman eXtreme Deep Field (RXDF) program is one of the five General Astrophysics Survey (GAS) programs approved for observing time with the Nancy Grace Roman Space Telescope in Cycles 1 and 2. It has been allocated 386.41 hours to carry out an imaging survey to AB = 30 mag (5-sigma) over ~140x larger area than the Hubble eXtreme Deep Field (HXDF) full-depth area (ACS+WFC3/IR). The RXDF will cover the full Roman wavelength range with 7 bands, reaching AB = 30 mag in RZYJH, 29 mag in F, and 28 mag in K, over a full-depth area of 678.75 arcmin^2 embedded in a total area of 1,243 arcmin^2, and far exceeding the depths of the Roman Core Community Surveys (CCS). The RXDF is within the Euclid Ultra Deep Field (EUDF) near the North Ecliptic Pole (NEP), a strategic long-term field for generational space facilities, with a wealth of multi-wavelength data including extensive coverage from the James Webb Space Telescope (JWST) NEXUS Treasury program. The observations will cover 3 epochs at a 1-year cadence, each epoch divided into 3 sub-epochs ~10 days apart, enabling time-domain studies on time baselines from ~10 days to over ~2 years. The RXDF is uniquely positioned to address critical questions in reionization, large scale structure (LSS), growth of supermassive black holes (SMBHs), little red dots (LRDs), and high-z supernovae (SNe); the volumes probed by HST+JWST are too small at these extreme depths, and even the deepest CCS tiers are too shallow. In addition to our key objectives, a wealth of additional science will be enabled by engaging the community with our rapidly released datasets, revolutionizing a wide range of science for a lasting legacy. This short document, which is converted from the approved RXDF proposal, aims to provide the community with a summary of the program.
Read the full abstract
High Energy Physics (Experiment)
Search for Axion Dark Matter around \texorpdfstring{$15.6\,\mu\text{eV}$}{15.6 microeV} with a Broadly Tunable High-Temperature Superconducting Cavity
We report an axion dark matter search in the mass range of $15.30\text{--}15.85\,\mu\text{eV}$ using a broadly tunable high-temperature superconducting (HTS) haloscope. By soldering substrate-stripped rare-earth barium copper oxide (REBCO) films onto a copper shell, we achieved a quality factor 3–4 times higher than in copper cavities across its tuning band in an 8\text{-T} magnetic field. We set robust Frequentist 90%~confidence-level exclusion limits on the axion–photon coupling down to 1.3 times the KSVZ coupling, while a complementary Bayesian analysis achieves KSVZ-level sensitivity.
Read the full abstract
Networking
Information-Entropy-Driven Fault Propagation Modeling for Probabilistic Network Performance Prediction
Network faults can trigger cascading effects that cause abrupt and nonstationary performance degradation. Existing learning-based performance predictors mainly focus on normal operation or treat fault-induced topology and routing changes as static inputs, and typically produce deterministic point estimates. They overlook fault-propagation dynamics and uncertainty in performance evolution. The predefined-rule and purely data-driven propagation models lack a unified representation of fault definition, propagation mechanism, and impact quantification. Additionally, generic denoisers in conditional diffusion models fail to incorporate fault propagation into uncertainty modeling. To address these limitations, we propose an information-entropy-driven fault propagation paradigm (IEFP) that characterizes fault propagation via relative entropy, mutual information and transfer entropy. We then design a fault-aware graph message-passing mechanism that propagation contexts modulate network representation learning. We further develop FEMNet, which employs this mechanism as a tailored denoiser within a conditional diffusion model to enable probabilistic network performance prediction under complex fault scenarios. Compared with the strongest baselines, IEFP improves fault-prediction performance, while FEMNet reduces errors in both point and probabilistic KPI prediction.
Read the full abstract
Analysis of PDEs
Global mild solutions and the semiclassical limit for the Fermi–Dirac BGK model
We prove global existence of mild solutions to the spatially inhomogeneous Fermi–Dirac BGK equation for arbitrary-size Pauli-admissible initial data with finite mass and kinetic energy, allowing both vacuum and locally saturated zero-temperature states. The construction relies on a moment-compatible regularization of the local equilibrium that preserves the Pauli bound and uniform moment control while remaining consistent up to the saturation boundary. The solutions satisfy mass, momentum, and energy conservation and, under an additional finite spatial second-moment assumption, an entropy-gap H-theorem on the full Pauli interval. Under uniform moment and entropy bounds, we further prove that, after extraction of a subsequence, quantum mild solutions converge strongly in phase space, uniformly on bounded time intervals, to a mild solution of the classical BGK equation.
Read the full abstract
Strongly Correlated Electrons
Successive Phase Transitions from a Composite Fermion Liquid to a Fractional Quantum Hall State at {\nu}=3/2 Driven by In-Plane Magnetic Field
We report an even-denominator fractional quantum Hall state at {\nu} = 3/2 induced entirely by in-plane magnetic field B_|| in an ultra-high-mobility GaAs quantum well. As B_|| increases, the system undergoes two successive transitions: from a composite fermion liquid to a soft-gap FQH state (B_||~12.2 T), then via a topological phase transition to a hard-gap robust FQH state (B_||~14.7 T), accompanied by a daughter state at {\nu} = 19/13. We present systematic data, and discuss a possible scenario in interpreting these findings. Our work demonstrates that topological order may be engineered through k-space Fermi contour splitting under an in-plane magnetic field.