Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Wednesday 9 September

Robotics

Coastal Environment Generation with HoloOcean

Marine robotic simulation provides a safe and inexpensive method of developing and testing algorithms for unmanned underwater vehicle (UUV) and unmanned surface vessel (USV) autonomy and perception before full field deployment. However, these simulations are often limited by the availability of simulated environments. Current marine robotics simulation suites offer manual ways to edit or create environments, but they require existing data or specialized knowledge of the environment system. To address these issues, we introduce a novel Unreal Engine 5 level generation pipeline that enables automatic creation of coastal environments for HoloOcean. Our pipeline relies on a user-provided overhead image of a coastal scene. The pipeline then uses the image to generate height map data, as well as automatically select assets and place them in the environment.
Read the full abstract

Representation Theory

Distinguished standard modules for $\mathrm{GL}_{2m}(\mathbb{C})/\mathrm{GL}_m(\mathbb{H})$

We characterize the standard modules of $\GL_{2m}(\C)$ that are distinguished by $\GL_m(\HH)$. Let $\delta_1,\dots, \delta_{2m}$ be characters of $\mathbb{C}^\times$. Assume that $S = \delta_1 \times \cdots \times \delta_{2m}$ is a standard module of $\GL_{2m}(\mathbb{C})$. For each $i$, define ${\delta_i^*} (z) = \delta_i(\overline{z})^{-1}$ for $ z \in \mathbb{C}^\times$. In particular, we conclude that a standard module for $\GL_{2m}(\mathbb{C})$ is distinguished by $\GL_{m}(\mathbb{H})$ if and only if there exists an involution $p\in S_{2m}$ without fixed points such that $\delta_{p(i)}=\delta_i^*$ for every $i$. We first verify the hypotheses of the multiplicity estimate theorem of Suzuki and Tamori in \cite{ST}. The orbit calculation of Matringe, Offen, and Yang in \cite{MOYglobal} then gives the necessary condition and a dimension bound. Then local intertwining periods prove sufficiency.
Read the full abstract

Information Theory

Risk-Averse Decision Making via Quantum Measurement Design

Quantum measurements are conventionally optimized to maximize the average of a utility that depends on the true state and on the measurement outcome. However, when the outcome of the measurement is used as an action within a larger decision-making system, the average utility does not capture the risk of poor outcomes. This letter addresses the design of quantum measurements that maximize a risk-averse objective given by the optimized certainty equivalent (OCE), a family of criteria that includes the average utility and the conditional value at risk (CVaR) as special cases. For a piecewise linear gain function, defining the OCE, thus including the CVaR, the problem is shown to reduce to a finite number of semidefinite programs, for which a dual formulation is derived. For the discrimination of two states, a closed-form solution is obtained that takes the form of a Helstrom measurement. Numerical results show that the optimized measurement improves the lower tail of the utility distribution at a moderate cost in average utility.
Read the full abstract

Algebraic Geometry

On Two Open Problems by Johnson and Kollár

We resolve two problems left open by Johnson and Kollár in their paper Arcology: Question 21 and the openness issue arising in Example 14.

Analysis of PDEs

Open Inextensible Filaments in Planar Stokes Flow: Well-Posedness, Endpoint Asymptotics, and Straightening

We study an inextensible open filament with free ends in a planar Stokes fluid. The system reduces to a third-order nonlocal curvature equation coupled to an elliptic equation for the tension. We prove local well-posedness for nearly critical initial data in supported Sobolev spaces $\widetilde H^s$, $-1/2<s\le0$, satisfying the arc-chord condition. For positive times, we prove improved Sobolev regularity and derive a $d^{3/2}$-type expansion at each free end using Wiener–Hopf factorization, where $d$ denotes the distance to that endpoint. We further prove global existence and exponential convergence to a straight filament for sufficiently small initial data and for finite-energy initial data satisfying $E(0)<\pi^2/4$. The finite-energy result follows from an energy identity and a geometric estimate relating the bending energy to the arc-chord constant. More generally, any finite-time breakdown must be accompanied by loss of the arc-chord condition, while every global solution either converges exponentially to a straight filament or has arc-chord constants tending to zero along a sequence of times tending to infinity.
Read the full abstract

Signal Processing

Deep Learning-Based Detection of Electrical Faults and Power Quality Disturbances in Aerospace Power Systems

More Electric Aircraft require fast and reliable monitoring of high-frequency electrical networks, yet most power quality disturbance and fault diagnosis methods are developed for conventional 50 or 60 Hz grids. This work presents a hardware-aware deep learning framework for multiclass detection of electrical faults and power quality disturbances in a 400 Hz aerospace power system. A high-fidelity simulation model inspired by the Boeing 787 electrical architecture generates voltage and current waveforms for 21 normal, disturbance, switching, open-circuit, and short-circuit conditions. Two datasets, each containing 73,500 samples, are formed from one-dimensional time-series signals and short-time Fourier transform time-frequency representations. Signal-processing augmentation, domain randomization, and class-specific generative adversarial networks increase waveform diversity, and the time-series dataset is released through IEEE DataPort. We compare 1D and 2D convolutional neural networks, long short-term memory networks, CNN-LSTM hybrids, ResNet, MobileNet, and VGG models under common training conditions. A compact ResNet provides the best accuracy-complexity tradeoff, achieving 96.94 percent software test accuracy with 175,685 parameters. After 8-bit quantization and deployment on a Xilinx Zynq UltraScale Plus MPSoC ZCU102, the model achieves 95.87 percent accuracy and a measured mean neural-network accelerator latency of 6.90 ms per input record. The results establish simulation-based, accelerator-level feasibility for embedded edge AI in aircraft electrical health monitoring and motivate future end-to-end data acquisition and experimental validation.
Read the full abstract

Spectral Theory

The sharp one-dimensional Lieb-Thirring inequality for the sum of eigenvalues

We prove that the best constant in the one-dimensional Lieb-Thirring inequality with exponent one is $4/(3\sqrt{3}\pi)$, confirming the Lieb-Thirring conjecture in this case. Moreover, we extend the inequality to operator-valued potentials and obtain the bound $L_{1,d}\leq(2/\sqrt3)L_{1,d}^{\mathrm{cl}}$ in every dimension.
Read the full abstract

Systems and Control

Multivariate linear regression without prior assumptions

Recovering the linear relationships that govern a system from noisy measurements is a basic task across the physical and engineering sciences. Because every measured variable may carry an unknown amount of noise, classical regression must commit in advance to a set of structural assumptions: ordinary least squares requires a declared input-output partition with input variables being noise-free, total least squares assumes equal noise variance across all variables, and generalized total least squares additionally requires the noisy-variable partition and variances to be known beforehand. Kalman~\cite{Kalman:1982} showed that any procedure returning a unique linear model from inexact data must rest on such unverifiable a priori assumptions – “prejudices” – that cannot be checked against the data itself, and that removing them leaves the identification problem fundamentally indeterminate. Whether these prejudices can instead be resolved directly from the data has remain unresolved. Here we show that an iterative generalized-eigenvalue algorithm, QZ-IPCA, recovers the noisy-variable partition, noise variances, number of linear relations, and regression coefficients of a multivariate linear system simultaneously, using only the raw data. Across all possible exhaustive noise configurations of a five-variable benchmark network, QZ-IPCA correctly identifies model structure and recovers coefficients with error below 6.4%. It outperforms ordinary least squares even when given the best partition, and succeeds in rank identification precisely where standard total least squares falls once noise variances differ across variables. These results show that the assumptions conventionally required for multivariate regression are not necessary, recasting model identification as a problem solvable from data geometry alone.
Read the full abstract

All authors Mayank S.K. Gupta, Deepanjhan Das, Arun K. Tangirala, Shankar Narasimhan

Numerical Analysis

Invariant domain preservation for hybrid point-value and cell-average discretizations of hyperbolic equations on general meshes

This paper presents a unified invariant-domain-preserving (IDP) framework for hybrid discretizations of hyperbolic conservation laws, including active flux and PAMPA methods, in which cell averages are updated conservatively while cell-boundary point values evolve under a possibly non-conservative operator. The main challenge is to preserve admissibility for these two coupled sets of states under a single local stability condition, without adding evolved degrees of freedom or relying on post-update repairs. For the point-value update, we introduce an admissibility transform based on a barrier–Legendre map for convex admissible interiors described by concave constraints, and prove that the inverse map is globally defined and Lipschitz continuous on the relevant sets. For the conservative cell-average update, we establish a structural obstruction theorem: the single-state continuous physical flux built from admissible boundary traces alone cannot provide a conservative IDP guarantee, for any prescribed CFL number, when internal reconstruction values are uncontrolled. This identifies the missing local control that must be supplied by an additional IDP flux mechanism. To realize this mechanism explicitly, we combine cell average decompositions (CAD), geometric quasilinearization, and local a priori scaling to construct admissible, generally discontinuous trace states before flux evaluation. Under an explicit trace-based CFL condition, with constants determined by local CAD weights and trace-state wave-speed bounds, the coupled hybrid update preserves the prescribed invariant domain. Concrete third-order schemes are developed on triangular, Cartesian, convex quadrilateral, and general convex polygonal meshes. Numerical results demonstrate the designed order of accuracy for smooth solutions and the strict preservation of physical admissibility.
Read the full abstract

All authors Shengrong Ding, Shumo Cui, Remi Abgrall, Kailiang Wu

Instrumentation and Methods for Astrophysics

Beyond the BLUE I: the advantage ceiling - how much can any estimator beat the matched filter in mm/submm survey data?

Papers claiming that convolutional neural networks outperform the matched filter are now common in astronomy. Since that filter is the best linear unbiased estimator (BLUE) for any noise of given covariance, and the minimum-variance unbiased estimator under Gaussian noise, such a claim requires that the noise covariance varies from image to image or the noise is non-Gaussian. We introduce the advantage ceiling eta >= 1, which quantifies both cases: the Fisher information for the amplitude in units of the matched filter's, computable from noise-only simulations before any network is trained, and a bound on the variance of any estimator unbiased at each true amplitude. We compute eta for a suite of millimeter/submillimeter survey noise models and for compact and extended source templates, using a variational score-matching ladder whose rungs are estimator classes of increasing statistical order, from linear to convolutional. With an instrumental white-noise floor, Gaussian noise returns eta = 0.94-1.06 (+-0.04); covariance mixtures give exact ceilings of 10.2 (spectral tilt, extended source), 2.1 (leaked components) and 1.1-1.8 otherwise; residual artifacts give eta <= 1.09. Source confusion gives the largest advantage, eta >= 3.8 (extended) and >= 2.4 (compact). Three unmodelled channels - a zeroed DC mode, a missing white floor and floating-point rounding - can manufacture spurious advantages of up to two orders of magnitude. A ResNet regressor is 6-15% less efficient than the matched filter on Gaussian noise once prior shrinkage is divided out, and realizes a factor 1.8 of the 10.2 available on the spectral-tilt mixture; a companion paper tests such regressors against these ceilings.
Read the full abstract

Probability

MaxCut for $\mathrm{MTP}_2$ Covariances

Let $X=(X_1,\dots,X_n)\in\{0,1\}^n$ have a multivariate totally positive ($\mathrm{MTP}_2$) law. We prove that $$ \sum_{i<j}\mathbb{E}\left[\left|\mathrm{Cov}(X_i,X_j \mid X_{[n]\setminus\{i,j\}})\right|\right] \le n/2, $$ and more generally a weighted MaxCut inequality for the fully conditioned covariances. As an application, we confirm a conjecture of Allen and O'Donnell on correlation rounding for signed $\mathrm{MTP}_2$ laws.
Read the full abstract

Physics and Society

Assessing flood-conditioned power dependency of urban rail transit and its effects on resilience under climate change

Urban rail transit (URT) faces increasing flood risk while relying on traction power systems whose failures can trigger cascading disruption. Existing studies on URT flood resilience often oversimplify power dependency by overlooking traction power redundancy and rarely consider flood-conditioned cascading impacts, providing limited insight into how flood-induced traction power failures propagate through operations and affect system resilience. This study marks the first quantitative assessment of flood-conditioned power dependency of URT and its effects on system resilience. The methodology integrates a double-layer URT network model, spatial flood exposure assessment, service disruption simulation, a flood-conditioned power dependency index, and a journey-based performance metric that captures resilience properties of robustness and redundancy. It is applied to the London rail transit network under surface water flood scenarios across current and RCP8.5 climate conditions, two traction power feeding mechanisms, and four substation flood-failure thresholds. Results show that traction power redundancy fundamentally shapes the severity of cascading impacts. Under double-end feeding, power-attributable performance loss remains minimal, whereas single-end feeding leads to substantially greater loss and is highly sensitive to substation failure thresholds. The proposed dependency index is strongly correlated with dependency-related performance loss, supporting its use as a proxy for dependency-induced additional consequences in strategic planning.
Read the full abstract

Astrophysics of Galaxies

ACES VIII: A Survey of Compact, High-Velocity Features Observed in CS(2-1)

The extreme kinematics of the Milky Way's Central Molecular Zone (CMZ) are influenced by processes such as dynamical shearing, cloud collisions, and stellar feedback. These events are visible in molecular data as vertically spiked features in position-velocity (PV) diagrams referred to as high velocity dispersion compact clouds (HVCCs). Using ALMA CMZ Exploration Survey (ACES) CS (2-1) molecular data, we identify a total of 235 HVCC candidates, 163 of which are visually identified, and an additional 72 identified via automated dendrogram methods. For each HVCC we catalog and report the physical and kinematic properties, explore line ratios of the cold dense gas tracer \HNCO with C-shock tracers, classify the morphology of their PV diagrams, and view their position-position-velocity distribution. The sample includes structures which are compact (d<5 pc) and have large velocity extents (20 km/s $<\Delta \mathrm{V} <$ 140 km/s), with most structures showing thin, `spiked' PV morphologies. We highlight areas of high ratios between HNCO and C-shock tracers along the edge of known orbital streams, implying a buildup of bar lane gas accreting onto the CMZ. We also find a collection of HVCCs overlapping with the 50 km/s cloud and known circumnuclear disk features. This catalog will be used for future investigation of nuclear inflow and determining dominant mechanisms disrupting average CMZ gas flows.
Read the full abstract

All authors Dani R. Lipman, Jakub Poznanski, Savannah R. Gramze, Claire E. Cook, Cara Battersby, Jennifer Wallace, Pablo García, Samantha Adams, Xinyu Mai, Kai Smith, Natalie Butterfield, Sophia Kempe, Adam Ginsburg, Rojita Buddhacharya, Tomoharu Oka, Danya Alboslani, Jairo Armijos-Abendaño, John Bally, Ashley T. Barnes, Nazar Budaiev, Alyssa Bulatek, Laura Colzi, Christoph Federrath, Zi-Xuan Feng, Jonathan D. Henshaw, Paul Ho, Pei-Ying Hsieh, Katharina Immer, Izaskun Jiménez-Serra, Ralf S. Klessen, Steven N. Longmore, Xing Lu, Elisabeth A.C. Mills, N. Bijas, Francisco Nogueras-Lara, Dylan M. Paré, Maya A. Petkova, Jaime E. Pineda, Marc W. Pound, Víctor M. Rivilla, Álvaro Sánchez-Monge, Miriam G. Santa-Maria, Anika Schmiedeke, Yoshiaki Sofue, Mattia C. Sormani, Howard A. Smith, Robin G. Tress, Daniel Walker, Qizhou Zhang

Functional Analysis

Whitney extension theorem and intrinsic rectifiability of jump sets in Carnot-Carathéodory spaces

We prove that the intrinsic jump set of every locally integrable function on an equiregular Carnot-Carathéodory space is intrinsically countably rectifiable. A key new ingredient is a local scalar Whitney extension theorem for intrinsic $C^1$ functions.

Quantum Physics

Symmetry structure dependent diagnostic of the Quantum Mpemba Effect

Understanding symmetry restoration in isolated quantum many-body systems is an important problem in nonequilibrium many-body quantum physics. Recent studies have shown that the quantum Mpemba effect can be characterized through entanglement asymmetry, where states with stronger initial symmetry breaking restore symmetry faster. However, it remains unclear whether conventional energy-based measures, such as the trace distance, capture the same phenomenon. We investigate this question in closed spin-$1/2$ quantum systems with different symmetries by analyzing the dynamics of symmetry-breaking initial states. Combining numerical simulations with an analytical decomposition of the trace distance into symmetry-coherence and residual contributions, we identify the conditions under which trace distance tracks entanglement asymmetry and reproduces the Mpemba–like behavior observed in it. For charge symmetry, the residual contribution is negligible, making the trace distance effectively governed by symmetry-sector coherences. In contrast, for permutation symmetry, a significant residual contribution leads to qualitatively different relaxation dynamics. Our results establish when conventional energy-based diagnostics reliably capture symmetry-restoration dynamics and clarify the distinct physical information encoded by entanglement asymmetry and trace distance.
Read the full abstract

All authors Tamizhselvan S, Manju C, Bijay Kumar Agarwalla, Uma Divakaran

Computer Vision

AgroVisNet: A lightweight Convolutional Network and the BD-PlantDX Expert-Validated Benchmark for Radish, Potato and Pointed Gourd Disease Classification

Automated plant disease diagnosis is increasingly deployed on farmer-held devices in regions where agronomic expertise is scarce and network connectivity is unreliable. Three obstacles limit its practical value: public benchmarks are dominated by a small set of non-native crops, region-specific datasets are rarely validated by domain experts, and the architectures that reach competitive accuracy carry parameter budgets that are unsuited to low-cost hardware. We propose AgroVisNet, a compact convolutional network trained from scratch, together with BD-PlantDX, an expert-validated benchmark of 12,432 field images spanning 12 classes of radish, potato and pointed gourd in healthy and diseased states, collected across the Bogura and Nilphamari districts of Bangladesh. AgroVisNet couples grouped bottleneck residual blocks carrying sequential channel and spatial attention with multi-scale depthwise blocks and a dual-pooling classification head, reaching 290,572 trainable parameters. On BD-PlantDX the model attains 99.52% test accuracy and 99.52% weighted F1, exceeding all six ImageNet-pretrained lightweight backbones evaluated under an identical protocol while using 8.7 to 16.8 times fewer parameters and 1.3 to 8.5 times fewer multiply-accumulate operations. Exported for deployment, the model quantises to a 0.46 MB full-integer network at a 0.22 percentage-point accuracy cost and classifies an image in 8.40 ms on a single CPU. Across five random seeds accuracy remains at 99.57 +- 0.10%, a ten-variant ablation isolates the contribution of each component, and the same architecture transfers without redesign to two independently collected datasets at 98.71% and 99.05% accuracy. Grad-CAM evidence indicates that predictions rest on lesion-bearing leaf regions rather than on background cues.
Read the full abstract

Networking

HAPS-RIS or HAPS-Relay: Which Outperforms Under Impairments with NOMA in 6G NTN?

This paper investigates the performance of high-altitude platform station (HAPS)-assisted communication systems employing either reconfigurable intelligent surfaces (RIS) or relay stations (RS) under non-orthogonal multiple access (NOMA) scheme. Practical system impairments, including hardware impairments (HWI) and imperfect channel state information (CSI), are explicitly considered. The results show that HAPS-RIS outperforms HAPS-RS in terms of both sum-rate and energy efficiency under non-ideal conditions due to its passive nature, which avoids noise amplification. Furthermore, it is demonstrated that RIS element allocation and user spatial distribution significantly impact NOMA performance, where increased user separation and proper allocation enhance channel disparity and improve system efficiency. Despite its higher sensitivity to imperfect CSI, HAPS-RIS can effectively compensate for performance degradation through large-scale RIS element deployment, maintaining a performance advantage over half-duplex RS-based systems. These insights provide useful design guidelines for impairment-aware HAPS-assisted 6G communication systems.
Read the full abstract

All authors Bilal Karaman, Faicel Khennoufa, Ilhan Basturk, Metin Ozturk, Ferdi Kara, Sezai Taskin, Halim Yanikomeroglu

Probability

Couplings Farthest from the Independent Gaussian

Motivated by Wasserstein measures of dependence, we study the largest possible 2-Wasserstein distance between a joint distribution and the product of its prescribed marginals. For two uniform marginals, Catalano and Lavenant conjectured that the monotone and antimonotone couplings maximize the distance from the independent coupling. We prove the Gaussian analogue for an arbitrary number $n\geq 2$ of one-dimensional standard Gaussian marginals. More generally, for every probability measure $\mu$ on $\mathbb R$ with finite second moment, we characterize the laws on $\mathbb{R}^n$ with all marginals equal to $\mu$ that are farthest from the $n$-dimensional standard Gaussian.
Read the full abstract

Audio and Speech Processing

PAID: Phoneme-Aligned Acoustic Units for Cross-Corpus L1-Background Classification

First-language (L1) background classification from second-language English speech aims to identify pronunciation-related acoustic cues that remain informative across speakers and corpora. Global pooling is commonly used to aggregate frame-level speech representations, but averaging features across an utterance may obscure local acoustic differences in how individual phonemes are pronounced. To model these pronunciation-related cues before utterance-level aggregation, we introduce Phoneme-Aligned Input Design (PAID), which constructs acoustic units from frozen Whisper representations using transcript-assisted forced alignment. PAID applies a shared nonlinear mapping to each acoustic unit before utterance-level aggregation and incorporates auxiliary phoneme-label embeddings. We construct a six-L1 dataset with speaker-disjoint partitions and evaluate cross-corpus performance on the Speech Accent Archive (SAA). PAID achieves 89.72% Macro-F1 on the source Test set and 80.14% on SAA. Matched comparisons show that phoneme-aligned acoustic-unit modeling improves SAA Macro-F1 by 13.44 percentage points over global pooling. To address uneven classification performance across L1 backgrounds, we additionally evaluate class-sensitive training, which improves observed weakest-class performance.
Read the full abstract

All authors Yangyang Qu, Michele Panariello, Massimiliano Todisco, Nicholas Evans

Optimization and Control

Convergence of a Randomized Newton Method in Nonconvex Optimization

We analyze a stochastic Newton optimization scheme for locating the unique global minimizer of a general nonconvex objective function. The method couples a Newton algorithm to additive Gaussian noise with state-dependent variance. In the bounded domain setting, we prove global almost sure convergence. The proof is based on two features of the algorithm: a nondegenerate exploratory property that ensures entrance into a neighborhood of the minimizer after a finite number of steps, and a decaying-noise property that yields contraction with high probability and prevents infinitely many exits from the neighborhood of the minimum.
Read the full abstract

Machine Learning

Semigroup-JEPA: Latent Dynamics Consistency for Zero-Shot Physics Generalization

Joint-Embedding Predictive Architecture (JEPA) world models learn a compact latent representation of the world that supports prediction and planning, but their capability to learn physics and generate physically realistic dynamics remains hitherto untested. In this work, we introduce SemiGroup-JEPA (SG-JEPA), which extends the LeWorldModel framework by supplying the parameter governing the physics to the temporal model via action-conditioning and jointly training an encoder and predictor through an autoregressive latent rollout. To evaluate the model's ability to generalize out of distribution, we design dynamical tasks under different gravitational fields that, despite obeying the same physical law, exhibit qualitatively different dynamics, ranging from floating motion in weak gravitational fields to rapid bouncing in strong ones. In contrast to DINO-WM, SG-JEPA reduces open-loop prediction error by up to 2 times on two-dimensional datasets, and increases control success rate up to 2.5 times for three-dimensional robotic datasets, for which we train independent diffusion policies. To explain this advantage, we develop a linear feature model that separates local law-conditioned error from its recursive amplification under rollout. Guided by this model, we find that back-propagating the multi-step rollout loss into the representation trains the encoder to keep the features that the predictor can carry forward, and that those are the features the dynamics depend on, so most of the gain comes from the encoder learning better features rather than from the predictor learning better dynamics. See project page at https://sg-jepa.github.io.
Read the full abstract

All authors Andy Zeyi Liu, Haoran Sun, Lucas Baker, Randall Balestriero, John Sous

Statistical Mechanics

Protected domains and cooperative invasion on weighted networks

Reciprocal contacts can favor cooperation by protecting a lineage until its descendants compete as a group. An individual is chosen to reproduce from the whole population, with a probability increasing with its averaged cooperation payoff. Its offspring replaces a neighbor through contacts weighted equally in both directions. We compare a single cooperator taking over defectors with the reverse invasion, using the same distribution of introduction sites. When payoffs weakly affect reproduction, every network with at least six sites and a path visiting them all admits weights favoring cooperation at any benefit-cost ratio $b/c>1$. This holds for mutants placed uniformly or arising in newborn offspring. Unequal contacts sustain aligned domains around two protected sites, converting individual reproduction into collective competition. Cooperation cannot have an advantage when its benefit does not exceed its cost, at any positive selection strength with positive reproduction rates. Where mutants arise changes which contact patterns can use this mechanism. On a five-site path, the weak-selection threshold has the sharp lower bound seven under uniform placement; newborn introduction never favors cooperation at this order. We classify the contact patterns with at most five sites that can favor cooperation under either rule; newborn introduction requires a four- or five-site cycle. Tracing copies backward to their ancestors separates domain competition from the probability of reaching it. Exact polynomial inequalities prove sharp threshold bounds for paths and the four- and five-site cycles. The same ancestry reconstructs evolution without selection on weighted paths and cycles and fixes the slowest relaxation rate on every connected reciprocal network. Cooperation thus depends on both the collective competitors created by contacts and the route by which a new lineage enters them.
Read the full abstract

Logic in Computer Science

A Formal Framework for Noisy Runtime Verification

We introduce the logic EDMon—an epistemic dynamic logic meant to model monitorability concepts in noisy runtime verification. Its syntax and semantics are defined and explained and the connection between EDMon and monitorability and noisy runtime verification concepts is explored. We then demonstrate that EDMon is sufficient to capture many of the results in the noisy runtime verification literature and catalog its relation to nearby logics and describe a large class of its theorems.
Read the full abstract

Group Theory

Small undecidable groups and unrecognizable 4-manifolds

We construct a $3$-generator $9$-relator group with unsolvable word problem. We use the group to construct two fixed-size Adian–Rabin families of group presentations, one with $4$ generators and $11$ relators, and another with $2$ generators and $10$ relators. As a consequence, $\#_7(S^2\times S^2)$ is topologically unrecognizable and $\#_9(S^2\times S^2)$ is smoothly unrecognizable. These algebraic and topological results improve the previous best known bounds by Borisov, Tancer, and Gordon. The construction of the group builds upon an example of Borisov and uses additional HNN extensions and Tietze eliminations to reduce the size of the presentation. We also provide a machine-checked Lean~4 formalization of the algebraic results.
Read the full abstract

Functional Analysis

Local Reflexivity and Duality for Subspace Approximation Schemes

We address a structural gap in the quantitative theory of operator approximation by investigating how subspace approximation schemes interact with local reflexivity. Recent literature establishing the duality of scheme-relative approximation numbers, $a_n(T,Q) = a_n(T^{**}, Q^{\perp\perp})$, has relied on imposing an Extended Local Reflexivity Property (ELRP) as an independent axiom. In this note, we establish a dichotomy. For infinite-dimensional admissible schemes, we prove they naturally generate complete nests, perfectly satisfying the topological hypotheses of the Oja-Veidenberg Nest Principle of Local Reflexivity. Conversely, we demonstrate that for approximation schemes with finite-dimensional components, the bidual geometry collapses. Consequently, the ELRP is entirely superfluous, and the duality of approximation numbers holds unconditionally for all bounded linear operators via an elementary isometric restriction.
Read the full abstract

High Energy Physics (Phenomenology)

Anomalies at the End of the Universe?

The spatial distribution of anomalies in extra dimensional theories on a slice of AdS leads to a puzzle where anomalies may not match across different geometries that are dual to various states of the same CFT. We argue that consistency of the anomaly across such geometries necessitates the addition of topological terms or other bulk fermions to the theory that flow any IR localized consistent anomaly into the “UV" region of these geometries if one wishes to have such a dual interpretation.
Read the full abstract

Medical Physics

Understanding Search and Decision Errors in Liver Metastasis Detection and the Effects of Lower Radiation Dose

The detection performance of liver metastases decreases with the reduction of radiation dose, but misses are heterogeneous. Previous eye tracking work has characterized missed metastases into two categories: search errors i.e., the eyes never land on the lesion, and decision errors i.e., the lesion is seen but not recognized as malignant. We integrated three prior reader studies to answer this question. In all studies, radiologists interpreted the same set of 40 contrast enhanced abdominal CT exams containing 91 liver metastases whose locations had been previously marked. In two studies, the workstation recorded their gaze and eye movements. Using eye dwell times, metastases were classified as search-error-dominant (majority of misses had <2 sec gaze time) or decision-error-dominant (>2 sec gaze time). In the third study, exams were interpreted both at 120 and 200 quality reference mAs (QRM) by ten radiologists. The third study did not include eye tracking. Out of 91 liver metastases, we excluded 16 that were never missed in the eye tracking studies and used 75 liver metastases for the present study.
Read the full abstract

All authors Parmita Mondal, Rickey Carter, Andrew D Missert, Akitoshi Inoue, Joel G. Fletcher, Hao Gong, Shuai Leng, Lifeng Yu, Cynthia H. McCollough, Scott S. Hsieh

Multimedia

AnimateCanvas: Learning Implicit Motion Planning from Composable Kinematic Cues

Professional character animation requires both natural motion and precise, versatile control. For example, creators often define the timing of a specified action, control the motion range of the character's arm swing, or specify the route the character walks through–effectively placing various kinematic cues on a motion canvas. This motivates us to propose AnimateCanvas, a model that supports cue-conditioned implicit motion planning to faithfully and coherently connect all cues, dense or sparse, full or partial, into one full-body motion sequence. Specifically, AnimateCanvas represents heterogeneous kinematic cues on a shared motion canvas, where position and rotation values are specified across body joints and time. A shared flow-matching model generates motion conditioned on this canvas, with optional language and input motion; cue imputation keeps the specified canvas values fixed in both training and sampling. To learn coherent completion across different cue sets, we train with a compositional cue sampler that varies the timing of cue application, the positions or rotations specified, and how they are combined. Together, these designs enable a single generator to integrate heterogeneous kinematic cues into coherent full-body actions, giving creators fine-grained control over selected frames, joints, and position or rotation channels. We evaluate this planning ability on temporal, root, and body-part cues–alone and combined–as well as language-guided editing, and naturally extend it to sequential generation and motion repair. AnimateCanvas achieves state-of-the-art results in temporal completion, spatial control, sequential generation, language-guided editing, and motion repair, while retaining strong text-to-motion capability.
Read the full abstract

All authors Zeyu Ling, Di Kang, Qing Shuai, Yuxin Wen, Jing Li, Zhanke Wang, Heng Li, Chunchao Guo, Changqing Zou, Linchao Bao

Computer Vision

Advanced Brain Tissue Imaging with Data-Consistent Diffusion Priors in Laminographic X-Ray Nanoimaging

Nanoscale imaging of mammalian brains is critical for connectomics. X-ray laminography enables high-throughput imaging of extended, plate-like biological specimens. However, the tilted acquisition geometry leads to incomplete Fourier-space coverage, giving rise to a missing-cone of information. Conventional reconstruction methods cannot recover unmeasured information within the cone, resulting in artifacts that distort fine brain structures. While resolving these requires modeling 3D structure, direct 3D deep learning approaches are limited by data scarcity and computational cost. Here we introduce LUCID (Laminography with Unified Consistent Diffusion), a framework that combines multi-view diffusion priors with projection-domain data consistency. LUCID integrates complementary 3D structural information while enforcing strict alignment with the laminography forward model. On simulated datasets, LUCID substantially improves spatial fidelity and restores missing Fourier components, outperforming baseline methods. Applied to experimental laminography data, LUCID generalizes robustly despite being trained exclusively on fully sampled tomographic volumes, and effectively recovers unmeasured Fourier information.
Read the full abstract

All authors Wenxuan Fang, Abraham L. Levitan, Ana Diaz, Carles Bosch, Adrian Wanner, Andreas T. Schaefer, Mirko Holler, Tomas Aidukas, Nicholas W. Phillips, Yuxin Zhang, Alexandra Pacureanu, Manuel Guizar-Sicairos, Luis Barba

Systems and Control

The U.S. Interconnection Queue System: Cascading Vulnerability Analysis and a Resilience Engineering Framework

As of 2025, the U.S. interconnection queues, the grid-access gateway for new generation and storage, contain roughly 8,200 projects totaling 2,061 GW of capacity. Only 13% of capacity queued in 2000-2020 (19% by project count) has reached operation. We argue that the queue architecture is vulnerable to self-reinforcing project withdrawal cascades arising from restudy and cost reallocation, independent of study delays. Adapting failure contagion models from financial and interdependent infrastructure networks, we model the queue as a complex adaptive system and test it with a statistical analysis of withdrawal temporal clustering and co-withdrawal across seven ISO/RTOs and a stylized network contagion simulation of cost-sharing interdependencies with circuit-breaker interventions. Using LBNL project-level data through 2025, we find temporal clustering (dispersion indices 5.0-102.4; p < 0.001) and identify 39 monthly withdrawal bursts with the largest cluster-dated, reaching 67.4x the regional mean. Withdrawal timing is concentrated within technology categories in all seven regions (1,000-permutation test; z = 2.58-4.78, p <= 0.005). Co-withdrawal within cohorts is significant only in four regions (0.5-1.8 percentage points). The model yields net cascade amplification of 1.0-1.5x at low-to-moderate connectivity (average network degree k = 3-10). At k = 20 a phase-transition-like shift to systemic instability occurs, exceeding 8.7x amplification at a 10% shock (97.7% cascade size); a boundary condition of the stylized network that disappears under pro-rata redistribution. Capping per-neighbor cost reallocation reduces cascade magnitude by up to 20% relative to no intervention, with a 44% lower mean per-neighbor transfer. These findings characterize the interconnection queue as critical infrastructure with cascading vulnerability whose severity is conditional on cost allocation design.
Read the full abstract