Artificial Intelligence
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 10 September
Quantifier instantiation is currently the main approach to non-ground SMT solving: solvers generate ground instances and solve the resulting ground SMT problems with CDCL(T)-style reasoning. When a conflict is found, conflict analysis learns only a ground clause, even though the conflict comes from instances of non-ground clauses. Yet non-ground reasoning can give exponentially shorter proofs than purely ground reasoning. We propose a calculus that consists of ground instantiations, CDCL(T)-style rules, and non-ground conflict analysis. The solver reasons on ground instances, but the resolution steps of conflict analysis are performed on their original non-ground clauses. This produces learned clauses that are typically more general than the ground conflict. With a suitable strategy, the learned clauses are even non-redundant. We also show how chronological backtracking can be included in SMT solving. Our calculus gives a common setting for CDCL(T)-style SMT solving, a range of instantiation-based procedures, and non-ground clause learning, and we prove that it simulates CDCL, SCL(FOL), SCL(T), and even Resolution.
Quantum Physics
Joint Mitigation of Algorithmic and Physical Errors in Noisy Hamiltonian Simulation
Product-formula Hamiltonian simulation is naturally suited to near-term quantum processors, but its accuracy is set by two competing errors: finite-step Trotter bias and physical hardware noise. We introduce a joint extrapolation strategy that ties the tunable per-layer noise strength to the Trotter step size, $\lambda(s)=c(sT)^{p+1}$ for a $p$-th order product formula. Along this one-dimensional path, the leading physical-noise and Trotter corrections over the full evolution both enter at order $s^p$ and can be canceled by a single Richardson extrapolation. Building on a previously established finite-order Baker–Campbell–Hausdorff truncation bound, we derive a provably commutator-scaling resource guarantee for the joint extrapolation. For local Hamiltonians with local Lindbladian noise, the protocol mitigates physical noise together with Trotter error with only a constant asymptotic overhead relative to noiseless Trotter extrapolation, provided the required noise strengths lie above the intrinsic device-noise floor. We experimentally demonstrate the protocol for Ising dynamics on a superconducting quantum computer using learned noise amplification. Complementary 100-qubit Sparse Pauli Dynamics (SPD) simulations achieve comparable accuracy to two-dimensional Richardson extrapolation with fewer circuit settings.
Read the full abstract
Computer Vision
Harnessing Intrinsic Subject-Aware Attention for Controllable Multi-Subject Video Generation
Multi-subject video generation faces two key challenges: uncontrollable fidelity strength and potential semantic drift. We address these by analyzing the internal mechanisms of Diffusion Transformers (DiTs). We found that certain attention blocks naturally form an Intrinsic Spatial Grounding Map (ISGM) that precisely locates reference subjects. Building on this insight, we propose Dual-phase Intrinsic Attention Leveraging (DIAL), a framework that uses these internal signals for both training and inference. In low-noise stages, we use ISGM to guide the attention mechanism, allowing precise control over fidelity strength during inference without retraining. In high-noise stages, we use these same maps to automatically build preference pairs at no additional cost for Reinforcement Learning (RL). This RL procedure effectively anchors the model's attention to reference subjects and mitigates semantic drift. Extensive experiments show that DIAL significantly outperforms baseline models on the OpenS2V-Eval benchmark, consistently improving identity consistency and enabling controllable fidelity strength.
Read the full abstract
Computer Vision
UBone3D: Physics-Rectified Conditional Flow Matching for Anatomical 3D Shape Completion from Ultrasound
Three-dimensional ultrasound (US) is a safe, radiation-free complementary modality to CT and X-rays for longitudinal monitoring, yet its segmentation-derived partial point clouds are extremely artifact-laden. Consequently, it is challenging to recover a clean and complete anatomical structure from such US point clouds. In this paper, we present UBone3D, a novel framework based on physics-rectified conditional flow matching (CFM) that performs point cloud completion directly from partial US observations. UBone3D models deterministic physics artifacts (e.g., surface thickening, streaking, dropouts) via a simulated physics proxy, and introduces test-time physics rectification to steer the shape completion. At inference, the completion is jointly steered by two decoupled forces: (1) anatomical plausibility enforced by a CT-trained generative shape prior, BoneFM, and (2) physics consistency enforced by USimNet in the ultrasound formation space. Extensive experiments on simulated and in-vivo data demonstrate significant improvements in reconstruction accuracy and anatomical fidelity over existing baselines.
Read the full abstract
Computation and Language
Structural priors for data-efficient language learning
Efficient language learning requires methods to reduce the reliance on large data and computational resources. We investigate structural transfer: First training models on non-language data to induce useful priors for natural language. This approach is a form of weight initialization for multilingual language modeling. We evaluate transfer via next-token-prediction loss, weight shifts in the model, and downstream linguistic benchmarks. Several symbolic data types - notably music, probabilistic grammars, and cellular automata - yield lower language-modeling loss than random initialization. These gains coincide with smaller weight shifts during subsequent language training, suggesting that structural transfer positions models in a more favorable region of the parameter space. However, a lower loss does not translate consistently into better downstream linguistic performance, and transfer from non-language data is less efficient than additional language data. We conclude that non-language data can serve as a partial substitute for language data for the training objective of next-token prediction but does not reliably support broader linguistic generalization.
Read the full abstract
Machine Learning
DeFiFlowBench: Benchmarking and Improving Safe Executability in Natural-Language DeFi Workflow Synthesis
A structurally valid DeFi workflow can still authorize a costly trade. We introduce DeFiFlowBench, a benchmark of 207 team-authored prompts for natural-language DeFi workflow synthesis. It measures graph coverage, configuration completeness, and declared safety predicates, then tests supported trade configurations on a local EVM. Direct, constrained, and few-shot prompting produce 14-19 unsafe held-out executions per configuration under a fixed 5% price-impact cap. A slippage bound derived from a quote does not prevent the price impact of the order itself. We propose Koan-Safe, which combines a prompt-only intent parser, a replaceable generator, and structural repair with default safety parameters. On 75 held-out workflow prompts, its hybrid variant scores 0.67 on the static safety proxy, compared with 0.33 for the best baseline. Koan-Safe records no unsafe executions on the saved benchmark outputs. A matched-candidate ablation produces 14-17 unsafe executions when enforcement is disabled. Additional tests expose the limits of default injection: permissive existing thresholds can still authorize unsafe trades. A separately evaluated policy cap addresses this failure on a 36-case diagnostic grid. These results support explicit trade protections and execution-based evaluation, while distinguishing declared safety from a general guarantee.
Read the full abstract
Human-Computer Interaction
Design Reflections on Transition to LLM-Aided Novel Visualizations
This study examines data visualization design evolution over 12.5 years, reflecting on the impact of Large Language Models over the last 3.75 years. Using a longitudinal corpus of 55 visualizations from a single-subject design record, the study identifies how LLMs have aided design-space exploration: reducing coding effort, enabling new design opportunities, shock, excitement, accomplishments, and shifts to the design process.
Read the full abstract
Functional Analysis
Jacobians of BV homeomorphisms and their weak-* limits
We prove that in $\mathbb{R}^3$ any $BV$ homeomorphism as well as the weak-* limit of $BV$ homeomorphisms cannot change the sign of the Jacobian, i.e., we have $J_f \geq 0$ almost everywhere or $J_f \leq 0$ almost everywhere.
Optics
Antimony for broadband nanophotonics across the ultraviolet, visible and infrared
Semimetal elemental antimony (Sb) nanostructures show great potential for applications where nanophotonic properties play a key role, such as phase-change optical memories, non-linear optical elements, photothermal therapy agents, photodetectors and photocatalysts. However, designing advanced Sb-based photonic devices critically requires an accurate and reliable knowledge of the optical response of bulk and nanoscale Sb. Herein, we report for the first time a fully consistent and accurately measured dielectric function for Sb nanoscale films in a wide spectral range from the ultraviolet to the far infrared (4 - 0.04 eV, i.e. ~ 0.3 - 30 $\mu$m), surpassing previous reports that explored a limited spectral range. It is found that the Sb spectral response is driven exclusively by giant interband transitions in the visible up to mid infrared (4 - 0.4 eV, i.e. ~ 0.3 - 3 $\mu$m), and that their contribution dominates over that of free carriers down to 0.12 eV (i.e. ~ 10 $\mu$m). Such spectral response enables Sb nanostructures to display spectrally selective and tunable nanophotonic resonances. First, we showcase interband plasmonic resonances in the visible-to-near infrared for Sb nanogratings. Second, we report giant refractive index dielectric resonances in the mid infrared for nanostructured Sb/dielectric/metal resonant cavities. These findings open a pathway to optimized planar Sb nanoscale designs enabling a tailored light-matter interaction, which will be useful for integrated data, telecom, medical, optoelectronic and energy conversion devices operating in a broad spectral range.
Read the full abstract
Combinatorics
A Counterexample to an Eternal Domination Conjecture
A graph $G$ with 243 vertices is shown having $\gamma(G) = \gamma^{\infty}(G) < \theta(G)$, disproving the Gamma-Theta conjecture for eternal dominating sets.
Computer Vision
Recursive Code World Models: Building Complex Worlds through Recursive Scene Programs
Code world models represent worlds as executable programs, but this representation alone does not determine how to construct a complex world. We introduce Recursive Code World Models (RCWM), a framework for reconstructing complex 3D worlds in code from a single reference image. RCWM couples a Recursive Scene Program (RSP) representation with a construction solver that recursively calls itself. An RSP represents the executable world as compositional scene code, while each solver call follows the same complete process: establish the whole, recursively reconstruct unresolved parts, and revisit the whole to refine their composition. This global-local-global recursion gives fine-scale structures their own perception-and-editing loops while preserving scene-wide geometry and relationships. Reference-aligned views propagate a shared camera projection across levels, while parent revisitation addresses boundaries, spatial relations, and shared errors that emerge after local refinement. A vision-language coding agent directly compares reference images with scene renders to guide refinement, recursive descent, and return. Across complex scenes, RCWM outperforms prior code-based image-to-scene reconstruction methods. Ablation studies further support the benefits of recursive construction and suggest that deeper calls can improve finer-scale reconstruction. RCWM provides a recursive construction principle for building complex executable worlds from visual evidence.
Read the full abstract
Artificial Intelligence
ActMap: Single-Pass Uncertainty Quantification from Generation-Time Activation Maps
Practical uncertainty quantification (UQ) for large language models must decide, from a single generation, whether a specific answer should be trusted. Existing methods either sample multiple generations, read only output-token probabilities, or reduce the model's internal computation to a single hidden state. We introduce ActMap, a white-box representation that compresses the generation-time hidden-state trajectory (every layer, every generated token) into a fixed $12\times32\times128$ tensor of temporal-statistic channels that preserves structure across transformer depth and pooled hidden coordinates. The map is captured during the generation pass with no measurable overhead, has a fixed shape across model depths and hidden sizes, and occupies 96 KiB: a compact artifact that can be retained for audit-relevant generations and probed directly, with occlusion analysis localizing the classifier's signal to mid-depth regions of the map. A lightweight classifier, instantiated as a compact Vision Transformer, reads an estimated correctness probability from each map in a fraction of a millisecond; capacity-matched MLPs perform comparably, indicating the representation itself carries the result. Trained and evaluated in-domain on short-answer QA, direct-answer math, and summarization factuality with three instruction-tuned 7-8B models, ActMap consistently outperforms sampling, token-probability, attention, and embedding baselines, and matches ACT-ViT, a detector trained on dense activation tensors $67\times$ larger, at essentially the same mean AUROC with lower calibration error on ten of twelve pairs. The resulting score supports abstention, routing, and selective verification from a single generation, making it a practical primitive for scalable oversight of deployed models.
Read the full abstract
Astrophysics of Galaxies
Resonantly Scattered CIV Emission in Local Star-forming Galaxies: Radiative Transfer Constraints on High-ionization Gas in Reionization Analogs
Rest-frame ultraviolet emission lines are diagnostics of hard ionizing spectra and highly ionized gas in galaxies resembling the sources of cosmic reionization. Nebular CIV emission traces both intrinsic line production and resonant scattering through its velocity-resolved profile. Previous studies have treated CIV empirically, using integrated fluxes, equivalent widths, and line ratios rather than modeling the radiative transfer (RT) shaping the emergent profiles. We present the first systematic RT modeling of resonantly scattered CIV emission profiles in 18 local star-forming galaxies observed with HST/COS. Using the clumpy RT framework PEACOCK, idealized experiments show that profile morphology is governed by column density, gas kinematics, intrinsic equivalent width, and aperture-dependent recovery of scattered emission. We fit continuum-normalized spectra corrected for stellar contributions with a neural-network-accelerated Bayesian pipeline, reproducing P-Cygni-like, double-peaked, double-peaked with two absorption troughs, and blue-bump plus red-peak morphologies. Emission infilling connects these profile classes and complicates kinematic inferences, while aperture losses decouple observed net equivalent widths from intrinsic line production. Combining RT-inferred intrinsic equivalent widths with rest-UV diagnostics, we find that most galaxies are consistent with stellar photoionization, although some may require harder spectra or more extreme ionization conditions. Comparison with CLASSY reveals stronger associations of stellar mass and star formation rate with gas kinematics than with CIV column density. Our results establish CIV as both a tracer of hard ionizing radiation and a resonant-line probe of gas structure and kinematics, with velocity-resolved profiles providing information beyond integrated line strengths in local reionization analogs.
Read the full abstract
Numerical Analysis
Space-time finite element interpolation of nonsmooth functions satisfying boundary conditions
We construct Scott-Zhang-type space-time quasi-interpolation operators on tensor- product meshes for parabolic settings. Specifically, these are linear and uniformly bounded projections from the classical parabolic energy space onto a space-time tensor-product finite element space that preserve discrete Dirichlet boundary conditions on the lateral space-time boundary. We apply our operator in the context of space-time first-order system least-squares finite elements for parabolic equations to establish a quasi-optimal method for inhomogeneous Dirichlet boundary conditions.
Read the full abstract
Machine Learning
Combining Synthetic and Real Data for Low-Resource Historical OCR: A Manchu Case Study
Manchu, now critically endangered, was one of the principal languages of the Qing empire (1636-1912), and its extensive archival record is increasingly digitized but remains difficult to search and analyze at scale. Previous work showed that vision-language models (VLMs) trained only on synthetic Manchu word images can reach 87.4% word accuracy on real Qing manuscripts and prints, leaving a substantial synthetic-to-real gap. This study examines how synthetic and real historical training data should be combined for low-resource OCR. Using 60,000 synthetic and 20,306 real historical word images, we evaluate three pretrained VLMs and a compact convolutional recurrent neural network (CRNN) under four regimes: synthetic-only, real-only, joint synthetic-real, and sequential synthetic-to-real training, following a common checkpoint-selection and archival evaluation protocol. Introducing real training images raises the leading configurations to between 95.09% and 96.28% word accuracy, while no synthetic-only configuration exceeds 87.92%. Synthetic supplementation substantially improves all three VLMs, whereas its marginal effect for the CRNN is sensitive to the training objective. Joint and sequential training yield broadly similar archival accuracy under the tested practical pipelines. A compact CRNN also reaches the leading performance range once real images are available, showing that model scale alone does not determine recognition accuracy. Finally, complementary errors among strong recognizers allow voting to raise accuracy to 98.27% without additional training, while an eighteenth-century Manchu dictionary provides a principled rule for adjudicating disagreements.
Read the full abstract
Analysis of PDEs
Existence and Asymptotic Behavior of Normalized Ground States for a Weighted Elliptic System with Caffarelli–Kohn–Nirenberg Critical Exponent
In this paper, we study the coupled singular weighted elliptic system $$\left\{ \begin{aligned} -\operatorname{div}(|x|^{-2a}\nabla u)+\lambda_1 \frac{u}{|x|^{2a}}&=\beta p\frac{|v|^q|u|^{p-2}u}{|x|^{b(p+q)}}+\frac{|u|^{2^{\sharp}-2}u}{|x|^{b2^{\sharp}}},\quad\text{in}~\mathbb{R}^N, -\operatorname{div}(|x|^{-2a}\nabla v)+\lambda_2\frac{v}{|x|^{2a}}&=\beta q\frac{|u|^p|v|^{q-2}v}{|x|^{b(p+q)}}+\frac{|v|^{2^\sharp-2}v}{|x|^{b{2^\sharp}}},\quad\text{in}~\mathbb{R}^N, \displaystyle\int_{\mathbb{R}^N}\frac{|u|^2}{|x|^{2a}} dx=\rho_1^2,\quad &\int_{\mathbb{R}^N}\frac{|v|^2}{|x|^{2a}}dx=\rho_2^2. \end{aligned} \right. $$ where $N\ge3$, $\beta\in\mathbb{R}$, $\rho_1,\rho_2>0$, $\max\{0,\tfrac{N-4}{2}\}\le a<\tfrac{N-2}{2}$, $a<b<a+1$, $2^{\sharp}:=\frac{2N}{N-2(1+a-b)}$, $p,q>1$ and $2<p+q<2^{\sharp}$. Here $2^\sharp$ is the critical exponent of the Caffarelli–Kohn–Nirenberg inequality, and $\lambda_1,\lambda_2\in\mathbb{R}$ are unknown, since the two weighted masses are prescribed. We show that the ground state level is not attained for $\beta\le0$. For $\beta>0$ we obtain positive normalized ground states, with positive Lagrange multipliers, in the mass subcritical, mass critical, and mass supercritical regimes, for explicit ranges of $\beta$. In the mass supercritical regime, a threshold $\beta_0\ge0$ appears: a ground state exists for every $\beta>\beta_0$ and does not exist for $0<\beta<\beta_0$. We give conditions on $p,q$ under which $\beta_0=0$, and we prove that $\beta_0>0$ when $p,q\ge2$. Finally, we describe the ground states as $\beta\to0^+$ and as $\beta\to+\infty$: after a dilation, they converge to the ground states of the limit system without critical terms, or one component vanishes and the other concentrates on an extremal of the Caffarelli–Kohn–Nirenberg inequality.
Read the full abstract
Artificial Intelligence
From Document Silos to Process Intelligence: A Multi-Layer Knowledge Graph for CMC Process Development
Chemistry, Manufacturing and Controls (CMC) process development generates an enormous body of technical information across a multi-stage, knowledge-intensive continuum from drug discovery to commercial manufacturing. This knowledge is traditionally fragmented across functions and heterogeneous formats, causing traceability gaps and significant knowledge-management costs during technology transfer and regulatory filing. We present a modular agentic-AI platform that converts a heterogeneous corpus of process-development documents into a queryable, dual-layer knowledge graph. A base knowledge layer builds a lexical graph with a Document-Section-Chunk hierarchy through lossless ingestion of digital, scanned, handwritten, and multilingual documents, while an intelligence layer extracts ontology-aligned entities and bridges cross-document concepts through a provenance-anchored domain graph. LLM agents operate across both layers, selecting the retrieval path best suited to each question. We evaluate the lexical layer with a novel three-tier protocol measuring the deployment-fidelity of a retrieval-augmented generation (RAG) system on proprietary data, demonstrated on 505 questions curated from 38 development reports of a Sanofi small-molecule program. Tier-1 multiple-choice accuracy of 95% signals strong platform reliability; the stricter Tier-2 LLM-judge pass rate of 85%, which degrades on comparative and corpus-wide questions, reveals a failure taxonomy that Tier-1 accuracy alone fails to capture. A router agent selects between layers according to question type. We anticipate this protocol will enable future designers of agentic platforms to assess their systems against nonpublic databases, and that graph-based architectures will see broader adoption in pharma as a means of transforming fragmented document repositories into structured process intelligence.
Read the full abstract
Biological Physics
Multiscale retinal flow on a spherical cap of varying aperture
Modelling retinal haemodynamics is crucial for understanding retinal microcirculation but is computationally demanding because it involves coupling between the vasculature and surrounding tissue across multiple scales. This computational burden has been substantially alleviated by a recent analytic solution on the planar disc that enables lumping the capillary bed and surrounding tissue into an effective resistor. However, that formulation treats the retina as a flat surface, whereas the retina is a curved surface with a finite anterior aperture. In this work, we develop a nontrivial and physiologically necessary extension to spherical-cap tissue domains with varying apertures, where surface curvature and finite-aperture boundaries complicate solving coupled Darcy equations on a curved manifold. Using a stereographic projection and a decoupling transformation, we derive an analytic solution for the capillary-tissue system on the spherical cap that represents flow in both the capillary bed and interstitial tissue more realistically while retaining the efficient resistor formulation, a key advantage of the planar-disc formulation. This solution is coupled to one-dimensional (1D) arteriolar and venular flows to obtain a multiscale description of retinal haemodynamics. Using a vasculature model designed to capture retinal vascular features, we show that the multiscale model's predictions are consistent with experimental data. We further explore aperture effects using both a fixed hemispherical vasculature and aperture-dependent vasculature. The aperture affects retinal haemodynamics mainly through changes in the constructed vasculature itself, whereas the surface-averaged pressures and relative terminal flow distributions remain nearly unchanged. This framework provides a foundation for studying retinal pathophysiology on more anatomically realistic domains.
Read the full abstract
Logic
Possibilistic Logic over a Logic of Formal Inconsistency
In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.
Read the full abstract
Artificial Intelligence
Published Unlearning Numbers Move Per Checkpoint, and Not Because the Removed Data Survives: An Audit of 263 Released Batch-Normalized Checkpoints
An unlearning audit reads its verdict off numbers that an unlearned model and its retrained reference each publish, and both also ship batch-normalization statistics that no gradient step wrote and no release records. Refitting them on kept data at bit-identical weights moves 47 of 221 released checkpoints past the spread their own release's seeds show, several inside a method whose average does not move: what moves is the checkpoint's property, not its method's. What does the moving is not the removed data surviving in the state: exchanging kept records for removed ones inside a fixed fitting pool moves a published cell by almost nothing, while how far a checkpoint's shipped state has drifted from any refit does track it. The consequence for a published decision is real but narrow: twelve verdicts cross, four clear a measured recalibration budget, two clear it on every replicate, and a population we trained and sited near its own criterion yields none. A release should therefore name the fitting convention beside the number, on the batch-normalized vision models where this channel exists.
Read the full abstract
Artificial Intelligence
The Convention Gap: Beyond Literal Content in Human-AI Cooperation
Cooperative AI agents are often evaluated against other AIs, yet human cooperation is thought to rely on implicit conventions: shared rules for reading meaning beyond the literal message. We propose the convention gap as a diagnostic of such implicit communication. In the card game Hanabi, where hints are the only messages about one's own hand, the convention gap is the failure probability predicted exactly from the literal content of the hints and the visible cards, minus the observed failure rate of the cards played. We prove that the population gap (the value the gap approaches over many games) is zero when the partner's choices convey nothing beyond their literal content, given a fair shuffle and a player who uses only what was said and seen. A nonzero population gap thus indicates that partner choices conveyed more; it does not measure how much. The gap was +26.2 percentage points (pp) in public human-human games (+46 pp on plays of cards that no hint had pointed to), +16.4 pp for human plays with AI partners, and -0.6 pp in AI-AI games we simulated among rule-based agents. With three AI agents of a published human-AI study, the literal failure probability of the cards humans played was similar across partners (38-41%), yet human failure ranged from 14.4% to 34.4% and the gap from +24.1 to +6.2 pp, and the contrast between partners persisted within participants. Across five levels of Off-Belief Learning agents, trained so that the first level reads past actions only for their literal content and each higher level interprets more, the gap rose monotonically from +1.6 to +21.7 pp. These results argue for reporting the convention gap on human-partnered play, not only AI-AI performance, when evaluating agents intended for human partners.
Read the full abstract
Analysis of PDEs
An Anisotropic Onsager Criterion for the Two-Dimensional Navier–Stokes Equations with Horizontal Viscosity
We consider distributional weak solutions $u\in L^\infty_tL^2_x$ of the two-dimensional Navier–Stokes equations with horizontal viscosity on $\mathbb T^2$ or $\mathbb R^2$, without assuming $\partial_1u\in L^2_tL^2_x$. We show that the Lions integrability condition $u\in L^4_tL^4_x$ together with Onsager-critical regularity in the nondissipative direction, $u\in L^3_tB^{1/3,v}_{3,\infty}$ with the Besov regularity imposed only in the vertical direction, implies $\partial_1u\in L^2_tL^2_x$, with a quantitative bound on the horizontal dissipation. Thus the dissipative regularity is a consequence of the equation and need not be part of the definition of the solution. If moreover $u\in L^3_tB^{1/3,v}_{3,c_0}$, then $u$ belongs to the isotropic critical Onsager space $L^3_tB^{1/3}_{3,c_0}$, satisfies the energy equality, and is continuous in $L^2$. Here $c_0$ indicates that the corresponding dyadic Besov sequence tends to zero at high frequencies. The proof combines absorption of the horizontal energy flux into the dissipation with a one-dimensional commutator estimate for the vertical energy flux.
Read the full abstract
Astrophysics of Galaxies
Tracing Warm Gas through C IV Radiative Transfer
The C IV $\lambda\lambda1548,1551$ resonance doublet is a key tracer of warm gas ($T\sim10^5\,{\rm K}$) within and around galaxies. Recent observations have detected this line in both absorption and emission, revealing asymmetric profiles in galaxies and spatially extended haloes around active galactic nuclei (AGNs). Resonance scattering can strongly modify the emergent spectra and spatial distributions, complicating their interpretation. Using 3D Monte Carlo radiative transfer simulations, we study C IV resonance scattering over a broad range of column densities, intrinsic emission-line widths, and outflow velocities. We find that multiple scattering broadens the line profile and, in outflowing media, modifies the doublet ratio, $R_{\rm CIV}$, defined as the flux ratio of the K and H components at 1548 and 1551 $\mathrm{\mathring{A}}$, respectively. When the outflow velocity approaches or exceeds the doublet separation ($\simeq500\,{\rm km\,s^{-1}}$), K-line photons are redistributed around the H component, driving $R_{\rm CIV}$ below its intrinsic value and, in optically thick fast outflows, even below unity. We also combine photoionization models with resonance scattering to investigate extended C IV haloes around AGNs and compare them with He II $\lambda1640$ emission. Simple photoionization models do not produce C IV emission more extended than He II, whereas resonance scattering redistributes locally produced and central-source C IV photons to larger radii. These results demonstrate that the C IV doublet ratio and spatial distribution provide complementary diagnostics of warm gas.
Read the full abstract
Computer Vision
FreeFlow: A Bias-free Hierarchical Transformer for Optical Flow Estimation
Optical flow methods typically rely on task-specific inductive biases, such as correlation volumes, feature warping, and iterative refinement, among others, to reach high accuracy. While effective, such biases constrain the model to predefined heuristics, which can limit its expressivity and lead to more complex pipelines and additional computational cost. We present FreeFlow, a hierarchical transformer built without any flow-specific components, using instead a single feed-forward encoder–decoder. FreeFlow combines three attention variants: window attention for local processing, shifted-window attention for cross-window information exchange, and a global attention operating at a reduced resolution. The resulting architecture scales naturally with model capacity, enabling a consistent accuracy gain from small to large variants. Despite the absence of standard inductive biases, FreeFlow achieves state-of-the-art results on major benchmarks, including Sintel (0.68/1.48 EPE on Clean/Final), KITTI-2015 (3.23 Fl-all), and Spring (3.192 1px), while remaining memory efficient at 1080p inference.
Read the full abstract
Nuclear Theory
From Superfluid Coherence to High-$K$ Fragment Channels at Nuclear Scission
The origin of fission-fragment spin remains unresolved. For $^{236}$U fission, we combine deformation-dependent finite-temperature pairing with a multidimensional scission-spectrum analysis. Near the pairing-quenching boundary, pair breaking exposes near-Fermi high-$\Omega$ intruder orbitals and opens high-$K$ channels. The resulting maximum spectroscopic capacities range from a few to more than a dozen units of $\hbar$. Rapid neck rupture acts as a non-adiabatic projection freeze-out, where pairing serves as a dynamical gate: its critical attenuation does not generate angular momentum but allows existing high-$K$ projections to be retained diabatically as local fragment-$K$ components while total angular momentum remains conserved.
Read the full abstract
Differential Geometry
A positively curved metric on the Gromoll-Meyer sphere
We construct an explicit deformation of the bi-invariant metric on Sp(2) whose induced metrics on the Gromoll-Meyer exotic 7-sphere have positive sectional curvature for all sufficiently small positive parameters. The deformation is determined by a fixed self-adjoint operator compatible with the quotient action. The proof combines a uniform curvature estimate with an algebraic analysis of the horizontal commuting planes. On the critical set where the lower-order positive terms vanish, we establish an explicit positive lower bound for the cubic coefficient of the curvature numerator. Uniform control of the fourth-order remainder and a compactness argument then show that every sectional curvature is positive
Read the full abstract
High Energy Physics (Phenomenology)
Net-baryon number distributions and the QCD phase diagram
Net-proton multiplicity distributions obtained by the STAR collaboration are analyzed in the grand canonical approach. A method of finding the baryon chemical potential $\mu_B$ immediately from such distributions is applied for the first time. The obtained values of $\mu_B$ are consistent both with those determined earlier using the statistical thermal model and with the results of the fit based on the Hadron Resonance Gas (HRG) model. We propose a criterion of thermalization of fireballs produced in heavy-nuclei collisions.
Read the full abstract
Geometric Topology
Commensurability Relations Between Deligne-Mostow-Thurston and Ghazouani-Pirio Monodromy Groups
We classify commensurability relations between Deligne–Mostow–Thurston monodromy groups and the sixteen arithmetic Ghazouani–Pirio monodromy groups arising from moduli of flat cone metrics on the sphere and on the torus. In both settings, the monodromy group preserves a skew-Hermitian form coming from twisted homology. We use a degeneration method to compute their determinant classes in the genus one case. The defining CM fields and determinant classes of the skew-Hermitian forms determine the commensurability relations. In particular, each of the sixteen arithmetic Ghazouani–Pirio monodromy groups is commensurable with an arithmetic Deligne–Mostow–Thurston monodromy group.
Read the full abstract
Differential Geometry
Stability and Area-Minimizing Property of Higher-Dimensional Helicoids
For each integer $k\geq 1$, we study the $(k+1)$-dimensional helicoid $H_k\subset\mathbb{R}^{2k+1}$ parametrized by \[ (u_1,\ldots,u_k,s) \longmapsto \bigl(u_1e^{is},\ldots,u_ke^{is},s\bigr) \in \mathbb{C}^k\times\mathbb{R}\cong \mathbb{R}^{2k+1}. \] These helicoids form a basic and distinguished family of complete, properly embedded minimal submanifolds diffeomorphic to $\mathbb{R}^{k+1}$, and provide natural higher-dimensional analogues of the classical helicoid in $\mathbb{R}^3$. We completely determine their stability: $H_k$ is stable for $k\geq 3$ and unstable for $k\leq 2$. The sharp transition at $k=3$ is particularly striking: while the classical helicoid $(k=1)$ and its first higher-dimensional analogue $(k=2)$ are unstable, the four-dimensional helicoid $H_3\subset\mathbb{R}^7$ is already stable. For $k\geq 3$, we also determine their area-minimizing property: $H_k$ is area-minimizing when $k$ is even and not area-minimizing when $k$ is odd. The area-minimizing result is proved by constructing an explicit calibration, while the non-area-minimizing result follows from an explicit competitor. In particular, for every even $k\geq 4$, the $(k+1)$-dimensional helicoid $H_k$ is an entire minimal graph in $\mathbb{R}^{2k+1}$ that is area-minimizing.
Read the full abstract
Optimization and Control
Global Linear Convergence of the Proximal Bundle Method under Unknown Piecewise Smoothness and Quadratic Growth
We study why the proximal bundle method (PBM) can perform better in practice when it retains more cutting planes. We consider convex objectives with quadratic growth and an unknown piecewise-smooth structure. Our key observation is that retaining sufficiently many cutting planes allows PBM to exploit the objective's piecewise-smooth structure and behave as if it were optimizing a smooth function. We provide a theoretical explanation for the observed linear convergence of PBM on piecewise-smooth objectives when it retains sufficiently many cutting planes.