High Energy Astrophysical Phenomena
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 10 September
4U~0114+65 is a high-mass X-ray binary composed of the B1\,Ia supergiant V*~V662~Cas and one of the slowest known accreting neutron stars, with a spin period of $\sim$9.4 ks. In 2025, its long X-ray pulsations became undetectable in Swift/BAT monitoring, motivating a Director's Discretionary Time observation with XMM-Newton. We compare this observation with a 2015 XMM-Newton observation, when the source was brighter and clearly pulsed, and analyze the long-term spin evolution using Swift/BAT data. We performed average and pulse-phase-resolved spectroscopy using the same model as in previous work. The 2025 observation still reveals weak pulsations, with a period of about 9.3 ks, despite their non-detection in Swift/BAT. The overall spectral shape remains similar in both epochs, but the luminosity decreased by about one order of magnitude, mainly due to strong suppression of the bulk-motion Comptonization component. Although the absorbing column is higher in 2025, the inferred wind properties remain broadly compatible with those from 2015, suggesting that no major global change in the donor wind is required. Instead, the results point to a substantial reduction in accretion efficiency close to the neutron-star magnetosphere. We propose that 4U~0114+65 may be evolving toward partial centrifugal inhibition in the strong-coupling regime, where the toroidal magnetic-field component is comparable to the poloidal one. If confirmed, this would represent the first observational evidence of this state. Accretion would become progressively less efficient and more intermittent without reaching a fully developed propeller regime. The apparent disappearance of the pulse in long-term hard X-ray monitoring would then result from the lower luminosity and reduced absolute pulsed flux, rather than from the loss of the underlying spin modulation.
Robotics
CARLAverse: A Highly Modular, Distributed, and Multimodal Framework for Human-in-the-Loop Simulation
The development of autonomous driving demands comprehensive testing in mixed-traffic scenarios involving vulnerable road users (VRUs), where purely artificial agents often fail to capture authentic human social negotiations. While human-in-the-loop (HITL) simulators enable safe investigation of these interactions, existing multi-agent platforms struggle with the network latency and synchronization constraints required for high-fidelity haptic feedback. To resolve this, we present CARLAverse, an open-source, multimodal simulation ecosystem. Extending modular hardware abstraction, CARLAverse integrates driving (DrivoCARLA), cycling (CycloCARLA), and pedestrian (WalkoCARLA) simulators into a shared virtual environment. Its core methodological contribution is a distributed physics architecture: latency-critical ego dynamics and high-frequency force feedback are computed locally on client nodes, while a central CARLA server orchestrates non-player character (NPC) physics and global traffic. By decoupling haptic control loops from network bottlenecks, CARLAverse enables scalable, cross-institutional HITL experiments without compromising physical immersion. Code and documentation: https://git.ieem-ka.de/simulator-environments/carlaverse
Read the full abstract
Computer Vision
Pre- and Post-Treatment Brain Metastases Segmentation Using nnU-Net with Post-Processing for BraTS 2026
Brain metastases exhibit high inter-lesion variability in size, enhancement pattern, and post-treatment appearance, making volumetric segmentation of both pre- and post-treatment cases the central challenge of the BraTS 2026 Task 1 (Brain Metastases). We build a pragmatic pipeline on a 5-fold nnU-Net ResEnc-L ensemble, in which each fold is trained independently for 1,000 epochs with the standard Dice + cross-entropy loss on 1,296 four-modality training cases. This ensemble is followed by a rule-based post-processing cascade tuned for the lesion-wise Dice similarity coefficient (LW-DSC), a detection-oriented metric that behaves very differently from the traditional global Dice. The final pipeline reaches an LW-DSC of 0.733 / 0.751 / 0.713 / 0.549 on the enhancing tumour (ET), tumour core (TC), whole tumour (WT), and resection cavity (RC) sub-regions on the official validation leaderboard. Rather than trusting these leaderboard gains, we audit every post-processing stage with a five-fold out-of-fold (OOF) analysis with no model-training leakage over all 1,296 training cases, scored with the official BraTS evaluation code (BraTS_evaluation): it confirms two stages as robust, per-fold-consistent improvements while the third improves only the leaderboard and does not reproduce out-of-fold. We further provide a mechanistic analysis of the LW-DSC metric that explains why recall-recovering post-processing carries low risk whereas component deletion does not, and we report thirteen negative results spanning loss engineering, alternative backbones, and inference-time settings, several of which run counter to widely held intuitions. Source code is released under Apache-2.0 at https://github.com/hornbeamliu/brats2026-met.
Read the full abstract
Robotics
3D Euler-Angle Orientation Control for Two-Ray Fading Mitigation in Maritime Air-to-Sea Communications
Maritime Air-to-Sea links are dominated by a line-of-sight ray and a sea-surface reflected ray whose destructive combination produces deep fades. Existing mitigation strategies optimize Unmanned Aerial Vehicle position or trajectory but leave attitude unexploited. This paper treats the full three dimensional attitude as a physical-layer control variable that shapes the two-ray interference through antenna phase-center displacement. Under small-angle and far-field assumptions, the constructive-interference condition reduces to an affine constraint in the Euler angles and admits a closed-form family of minimum-norm attitude candidates. A differentiable soft-minimum rule yields a smooth reference tracked by a constrained Nonlinear Model Predictive Control controller on a fully-actuated tilting multirotor. The proposed scheme increases cumulative throughput by 11.4% over a pitch-only benchmark and 22.2% over a zero-orientation baseline, while preserving trajectory tracking and respecting actuator limits.
Read the full abstract
Networking
IPv6 Hitlist Service: Lessons Learned From 10 Years of Operation
After becoming an Internet Draft more than 30 years ago, IPv6 has seen an increase in deployment and use in the past years. As measurements in the IPv6 Internet require new approaches due to the vastly larger address space, hitlists have come along as one possible source for finding IPv6 targets. One of the most prominent hitlists is provided by the IPv6 Hitlist Service. In this paper, we share insights from 10 years of operations of the IPv6 Hitlist Service: We show different evolutions of the service, highlighting important changes along the way. To better understand the representativeness of the hitlist, we perform a coverage analysis using real-world traffic data from a major central European ISP and Tier-1 network, finding that at least one address is known to the IPv6 Hitlist Service for 87.1 % of ASes and 56.5 % of /48 prefixes originating IPv6 traffic. We also share results from a conducted user survey and analyze users accessing the IPv6 Hitlist Service, finding diverse use cases and access patterns across time (e.g., one-off vs. continuous downloads) and available data (e.g., all vs. responsive addresses). Finally, we provide best practice recommendations when working with the hitlist and share lessons learned during its 10-year operation.
Read the full abstract
Information Theory
Fundamentals of Energy-Efficient Hardware Configurations for Wireless Links with Sleep Modes
In this paper, we examine the energy efficiency (EE) of a base station (BS) with multiple antennas. We use a state-of-the-art power consumption (PC) model that captures the passive and active parts of the transceiver circuitry, including the effects of radiated power, signal processing, and passive consumption. The paper treats the transmit power, bandwidth, and number of antennas as the optimization variables. We provide novel closed-form solutions for the optimal ratios of power per unit bandwidth and power per transmit antenna, and discover a new relationship in which the radiated power equals the total transceiver power at the EE-optimal operating point. A central finding is that the EE-optimal signal-to-noise ratio (SNR) collapses to a universal numerical constant of approximately 5.93 dB, independent of channel and hardware parameters. We present an algorithm that jointly optimizes the three design variables to achieve maximum EE under practical constraints, and provide analytical insight into whether maximum power or maximum bandwidth is optimal and how many antennas a BS should utilize. We further extend the optimization framework to incorporate quality-of-service (QoS) requirements and three advanced sleep modes of varying depth: absolute sleep, deep sleep, and idle mode. We characterize the optimal hardware configuration for each mode and determine when the rush-to-sleep strategy, which transmits briefly at the EE-optimal active configuration and sleeps the rest of the time, is optimal. Incorporating wake-up transition delays, we reveal how latency constraints and sleep-mode-specific transition times jointly dictate the optimal sleep mode for data packets with absolute deadlines. Together, these results indicate that energy-efficient operation requires treating transmission and sleep as a single coupled optimization.
Read the full abstract
Statistical Mechanics
Work as a function of protocol duration for the efficient erasure of an underdamped memory: isothermal to adiabatic transition
We use evolutionary reinforcement learning to determine efficient time-dependent erasure protocols for an underdamped cantilever moving in a double-well potential, an experimental realization of a 1-bit memory. We investigate how the mean work $\langle W \rangle $ needed to erase a bit scales as a function of the protocol duration $\tau$. We find two regimes, depending on how $\tau$ compares to the relaxation time of the system $t_r$. For $\tau \gg t_r$, the quasistatic isothermal regime, we recover Landauer's bound plus an overhead that scales as $1/\tau$, similar to the overdamped case. By contrast, for $\tau<t_r$ erasure becomes adiabatic and $\langle W \rangle$ grows more slowly than in the isothermal case. This growth is bounded from below as $1/\tau$, which we derive using a gedanken optimal protocol. Finally, comparison with overdamped erasure shows that learned protocols can outperform protocols that are optimal subject to equilibrium boundary conditions.
Read the full abstract
Computer Vision
BridgeMatch: Conditional Transport Bridges in Matching Matrix Space for 3D Deformable Registration
Non-rigid point cloud registration depends on accurate correspondences under deformation and partial visibility. Existing coarse-to-fine methods use coarse matches to select regions for fine matching, but incorrect selection can remove valid correspondences before refinement. We introduce \paper, a conditional transport framework that connects coarse correspondence estimation to high-resolution matching. A diffusion model first estimates a coarse matching matrix. We lift the complete estimate to a fine-level source matrix and refine its scores with a geometry-conditioned bridge. We consider two bridge formulations: a deterministic endpoint-parameterized flow and a stochastic paired Brownian bridge with endpoint and noise prediction. At each step, the current matrix provides an alignment for the next prediction. Both models reuse backbone features throughout inference. Experiments on 4DMatch and 4DLoMatch show improved correspondence and non-rigid registration accuracy. The models also transfer to CAPE and DeepDeform without target-domain training. Ablations examine the roles of candidate coverage, source initialization, and refinement budget.
Read the full abstract
Quantum Algebra
Gelfand–Tsetlin bases for representations of $\mathrm U_{q}(\mathfrak{gl}_n)$ at roots of unity
In this paper, we construct Gelfand–Tsetlin bases for representations of $\mathrm U_q(\mathfrak{gl}_n)$ at roots of unity. As an application, we obtain explicit bases for certain baby Verma modules of $\mathrm U_q(\mathfrak{gl}_3)$ and determine their composition series.
Logic in Computer Science
Statistical Symmetry Release for Equivariant Quantum Learning
Hard symmetry constraints reduce model complexity, but can also erase label information. Statistical symmetry release determines when finite data and quantum measurements justify relaxing such a constraint, which directions to open, and how far to move. We connect global signal detection to local, loss-dependent improvement. A two-copy twirl–swap gate estimates task information in the symmetry-breaking complement with a dimension-independent copy count under paired-state and group-unitary access; reweighting the same records resolves representation sectors. An exact duality distinguishes this Hilbert–Schmidt signal from the larger signal accessible to bounded-outcome readouts. Local improvement is governed by the release gradient and a loss-corrected double-commutator matrix. Simultaneous confidence bounds convert empirical direction selection into certified descent, using either shared Pauli measurements or scalar probes with state-independent truncation bounds. Gaussian testing lower bounds quantify the cost of searching over unknown directions in the calibrated local experiment. Independent validation controls adaptively generated models, and a fast squared-loss bound preserves the approximation–estimation rate of a nested release path. On an eight-qubit Ising model, shared measurements certify release with 6300 times fewer shots than the specified scalar estimator on the tested budget grids. Quotient quantum natural gradient then controls parameter redundancy during training. Together, these results turn symmetry relaxation into a statistically justified model-selection decision.
Read the full abstract
Mathematical Physics
A proof of the Hodge universality conjecture at nonzero dispersion
We prove that a scalar tau-symmetric Hamiltonian deformation of the Riemann hierarchy in generalized standard form is uniquely determined by the nonzero coefficient of $u_x^2$ and the coefficients of $u_{xx}^g$, $g\ge2$, in its first Hamiltonian density. This determines the original hierarchy up to normal Miura transformations. Combined with the construction of Hodge-class double ramification hierarchies by Buryak–Rossi, this establishes Hodge universality at nonzero dispersion.
Read the full abstract
Analysis of PDEs
Parabolic-hyperbolic splitting in support propagation for stochastic porous media equations
We develop a randomly-localized energy method to derive qualitative results on the support propagation of stochastic porous media equations with linear conservative noise. Unlike in previous works, where energies are localized by weighting them with a spatial bump function, we weight them with profiles which are solutions to stochastic transport equations. This modulates out the support propagation due to the conservative noise term, and energy arguments—which otherwise fail in this setting—are again applicable. As a result, finite speed of propagation along with sufficient and necessary conditions on the existence of waiting time phenomena (modulo stochastic transport) are proven. These methods and results demonstrate, on short time scales, that the support propagation may be disintegrated into two independent parts, one due to the evolution of the porous media equation and one due to stochastic transport.
Read the full abstract
Functional Analysis
Sharp Volume-Based Bounds for BMO Functions on Compact Domains and Applications
We establish sharp localized $L^r$ bounds for compactly supported functions of bounded mean oscillation (BMO). Classical estimates obtained via the John-Nirenberg inequality bound the $L^r$ norm of such a function in terms of the diameter of its support. We show that the diameter dependence can be replaced by the Lebesgue measure of the support, the relevant quantity for thin, highly eccentric domains. The proof relies on non-increasing rearrangements and the Bennett-DeVore-Sharpley theorem, and requires no vanishing-oscillation hypothesis. We present physical and operator-theoretic applications: geometric collapse in tubular neighborhoods, a localized Cwikel-Lieb-Rozenblum bound for Schrödinger operators, and decoupling bounds for the localized action of Calderón-Zygmund singular integrals.
Read the full abstract
Strongly Correlated Electrons
Topological band structure of excitons in octochlore KTb$_{3}$F$_{10}$: an analog of the Luttinger Semimetal
Understanding the symmetry and topology of band structures in crystalline solids has been among the defining themes of a generation of condensed matter physicists, with implications across many different platforms including electronic bands, photonic crystals, phonons and magnetic excitations. In the latter systems, there is usually magnetic long-range order and time reversal symmetry breaking. Here we further enrich the possible band structures available to magnetic systems by examining dispersive crystal field excitations above a ground state that is a simple product of singlets. In these systems, there is an interplay of magnetic interactions and band topology with both crystal and time reversal symmetries. Using high-resolution neutron spectroscopy we reveal the dispersion relations of bosonic excitons in KTb$_{3}$F$_{10}$, an experimental realization of the octochlore lattice. We show that there are pinch point features in the scattering intensity. The dominant coupling in this system is the long-range magnetostatic dipolar interaction, whose singularity at the zone center is passed onto the scattering intensity. However, the pinch points survive when the range of the dipoles is truncated to finite shell number in the form of a three-band quadratic band touching protected by cubic symmetry. This model, which is related to the Luttinger semi-metal, provides a general long wavelength model for the emergence of pinch point scattering intensity encompassing also the true long-range dipolar model.
Read the full abstract
Astrophysics of Galaxies
The properties of central stellar knots embedded in galactic bulges of CIELO simulations
Deeply bound stellar substructures of about 1 kpc at the center of bulges are found in a subset of galaxies from the cosmological chemo-hydrodynamical zoom-in CIELO simulation suite. They were identified as stellar overdensities at the lowest binding energies in each galaxy's circularity-energy $(\epsilon, E)$ plane. We refer to these overdensities as stellar knots. We aim to characterize their properties in the context of bulge assembly using CIELO simulated galaxies spanning a wide range of stellar masses ($10^{8.0}$-$10^{10.7}\,\mathrm{M}_{\odot}$), with diverse formation histories. We inspect 54 galactic bulges. Within them, we isolate stellar knot candidates in $(\epsilon, E)$ space, and identify 28 robust knots satisfying successive selection criteria: kinematic, concentration, and morphology. We characterize their chemical enrichment, formation timescales, formation sites, progenitor gas origin, and spatial distributions. Across all galaxy masses, knots are systematically alpha-element enhanced, having assembled the bulk of their stellar mass at earlier epochs and on shorter timescales than other bulge populations, with a median of $\sim$2$\,$Gyr versus $\sim$5$\,$Gyr. Regarding their origin, knots are predominantly in-situ ($5\%$ accreted mass fraction, roughly half that of the rest of the bulge), with negligible disk-born stars contribution and the largest gas fractions originating from a primordial central spheroid ($21\%$ versus 16–17$\%$ for the surrounding populations), consistent with being the primary gas fuel for the alpha-element enhancement. In terms of structure, knots exhibit a variety of morphologies, with spheroidal shapes predominating. Dynamical selection in $(\epsilon, E)$ space of CIELO galaxies demonstrates its effectiveness in recovering coeval stellar populations, pointing to stellar knots as plausible fossil signatures of early in-situ bulge assembly.
Read the full abstract
Materials Science
A Community-Developed Domain Ontology for Magnetic Materials
Magnetic materials play a crucial role in energy-related technologies, mobility, and sensing, but their complex multiscale behaviour and the coexistence of multiple unit systems pose persistent challenges for data exchange and interpretation. This paper presents a domain ontology for magnetic materials, developed within the European Union funded Magnetic Multiscale Modelling Suite (MaMMoS) project and aligned with the Elementary Multiperspective Material Ontology (EMMO). The ontology formalises intrinsic, hysteretic, and microstructural properties across multiple length scales and supports semantic interoperability between simulation tools, databases, and experimental workflows. One key feature of the ontology is its code-based and human-readable structure, enabled through the EMMOntoPy framework, which allows for direct manipulation and versioning without relying on opaque .owl or .ttl files. This facilitates collaborative development and improves transparency. The ontology supports FAIR (Findable, Accessible, Interoperable, Reusable) principles and is openly available for extension by the community. The aim of the MaMMoS project is to foster reproducibility, improve traceability, and promote the adoption of ontology in the magnetism domain. The ontology that has been developed already serves as the foundation for multiple software tools that handle all kinds of magnetic material data.
Read the full abstract
Computer Vision
BruNet: A Cross-Domain Transfer Framework for Bruise Segmentation
Segmenting bruises is a challenging task in medical imaging due to limited data and annotations, diffuse boundaries, and highly variable appearance. In this work, we propose BruNet, a segmentation framework that combines a ViT-based visual encoder (a self-supervised DINOv3 or a pretrained LingBot-Vision backbone) with a SAM-based mask decoder. BruNet is trained on the HAM10000 skin lesion dataset and evaluated on a separate bruise dataset without additional fine-tuning. Although a small number of prior studies have explored machine learning and computer vision for bruise analysis, existing work has primarily focused on detection, classification, or colour analysis rather than pixel-level localisation. To the best of our knowledge, this is the first study to address automatic bruise segmentation. Our results show that BruNet outperforms CNN-based models, state-of-the-art segmentation models, ChatGPT-4o/5-assisted SAM2 zero-shot baselines, and the medical-oriented MedSAM model, demonstrating strong cross-domain generalisation to bruise segmentation.
Read the full abstract
Operator Algebras
The classification of flows on $\mathrm{II}_1$ factors and Connes' bicentralizer problem
We solve two long-standing open problems in von Neumann algebras. First, we classify all flows with full Connes spectrum on the hyperfinite $\mathrm{II}_1$ factor up to cocycle conjugacy. Every such flow is cocycle conjugate to an irrational rotation flow on a noncommutative torus. In particular, there is a unique outer flow with full Connes spectrum up to cocycle conjugacy. This settles Takesaki's classification problem for flows on the hyperfinite $\mathrm{II}_1$ factor. To prove this result, we draw on type $\mathrm{III}$ theory. Notably, we develop bicentralizer machinery for trace-preserving actions of locally compact groups. In the amenable case, we relate the bicentralizer conjecture to the Rokhlin property. For abelian groups, we prove an analog of the Connes–Størmer transitivity theorem and we generalize the Connes–Takesaki relative commutant theorem. A new resonance phenomenon is revealed which allows us to solve the bicentralizer conjecture for actions of $\mathbb{R}$. We then go back to the type $\mathrm{III}$ world and use this new resonance phenomenon to solve Connes' bicentralizer conjecture for all type $\mathrm{III}_1$ factors.
Read the full abstract
Data Analysis and Statistics
Combinations of measurements that are simultaneous fits of parameters of interest and systematic uncertainties using the BLUE method
Combining estimates of the same physics parameter obtained from different measurements improves the precision and robustness of the parameter determination. Modern particle physics measurements are often performed using likelihood fits that include the physics parameter(s) of interest together with nuisance parameters representing systematic uncertainties. In high-statistics analyses, typical of many analyses at the Large Hadron Collider, these nuisance parameters can be constrained in the likelihood fits. We describe how the Best Linear Unbiased Estimator method for combinations can be applied to both the estimates of the parameters of interest and the estimates of the nuisance parameters. We show with concrete example combinations that including the nuisance parameters can improve the precision on the parameters of interest. We show with pseudo-experiments that the uncertainty reported by the combination is reliable and that the approximate likelihood combination proposed in a previous publication and implemented in the Convino software reports an underestimated uncertainty. The method is implemented in an open-source software tool, Combiner.
Read the full abstract
Computation and Language
ReGround: Grounding Reviewer Comments in Multimodal Evidence
Reviewer comments naturally relate to specific parts of the reviewed paper, yet grounding these comments to the underlying evidence is difficult due to long multimodal documents. Existing benchmarks do not capture this setting and largely focus on explicit, information-seeking queries. We introduce ReGround, a large-scale dataset for reviewer comment grounding that links 10,267 reviewer comments to 16,274 evidence in the original anonymous submission of 3,656 papers. We build on a simple observation: author rebuttals often include explicit references to content of the submission used to address reviewer comments, providing a high-precision annotation source. We cast grounding as a retrieval task and evaluate a wide range of retrieval methods. Results show that retrieval over the entire paper content performs poorly, evidence-type inference is a major bottleneck, and multimodal evidence provides complementary signals that text alone misses. Our dataset exposes grounding reviewer comments as a difficult and practically important problem for scientific document understanding.
Read the full abstract
Materials Science
Bottom-up Synthesis of Metastable 2D Hexagonal Copper(I) Iodide on Monolayer and within Bilayer Graphene
Copper(I) iodide (CuI) is a wide-bandgap semiconductor crystallizing in the 3D $\gamma$-phase under ambient conditions; its layered van der Waals bulk phase $\beta$-CuI is stable only between 643 and 673 K. The two-dimensional (2D) h-CuI form has been obtained via liquid-phase exfoliation of mechanochemically prepared precursors and via encapsulation between graphene sheets, whereas bottom-up growth of 2D h-CuI on open surfaces has not yet been demonstrated. Here, we report a vapor-phase synthesis of h-CuI directly on low-defect, large-area monolayer and within bilayer reduced oxo-graphene (r-oxo-G) at low temperatures. Using a copper TEM grid as the solid-state precursor for copper, HI-vapor exposure at 40 $\deg$C initiates nucleation, while annealing at 180 $\deg$C promotes the growth of extended h-CuI domains. Aberration-corrected HRTEM resolves the atomic structure, local twist angles, and lattice anisotropy of the CuI/r-oxo-G nanohybrid, while STEM-EDX yields a Cu:I ratio consistent with 1:1. First-principles calculations show that van der Waals adhesion to graphene stabilizes the supported hexagonal layer. Under the presented low-temperature precursor conditions, pathways for nucleation of the $\gamma$-phase are not available, allowing the hexagonal phase to form selectively at the graphene interface. Ab initio molecular dynamics simulations show that the heterostructure retains its hexagonal lattice order at 600 K, including on an open monolayer graphene support. The lateral extent of the growth is limited mainly by remaining interfacial adsorbates. These results establish a route to metastable 2D h-CuI on a chemically inert graphene template, which may be useful for wide-bandgap electronic and optoelectronic devices.
Read the full abstract
Artificial Intelligence
Flexible and Interpretable Accent Distance Measurements
Determining the differences between two speakers' accents is a fundamental task in linguistics and speech technology research. The methodology used to measure these differences depends on the specific research area. A phonetics researcher may demonstrate accent variation by comparing vowel formants in paired recordings of individual words. These results will be interpretable, but the recordings will be time-consuming to collect and may not be representative of connected speech. Accented Text-to-Speech (TTS) research has pushed towards using accent embeddings derived from accent classification tasks. These embeddings can be produced from any speech recording, but are not readily interpretable. In this paper, we demonstrate that articulatory representations created through articulatory inversion can be used as an interpretable basis for accent comparison and that optimal transport provides a framework for accent comparison across arbitrary recording types.
Read the full abstract
Quantum Physics
Local decoders for fault-tolerant quantum computation and translation-invariant stabilizer codes
We construct the first fully spatially local fault-tolerant quantum computer based on topological codes in fewer than four spatial dimensions. Our construction is a two-dimensional architecture that uses only geometrically local quantum and classical operations, bounded-speed classical communication and computation, and a constant density of quantum and classical resources. The core component is a new time-translation-invariant cellular-automaton decoder for the surface code. This decoder preserves logical information for a time stretched-exponential in the code distance and operates continuously during state injection, stabilizer-state preparation, lattice surgery, and transversal readout. We also prove that every translation-invariant topological Pauli stabilizer code is locally decodable under phenomenological noise.
Read the full abstract
Number Theory
On the bounded-conductor finiteness conjecture in equal characteristic
We investigate the equal-characteristic case of the Moon–Taguchi bounded-conductor finiteness conjecture for mod $p$ Galois representations over global function fields. We first establish a conditional finiteness theorem: for any global function field $K$ of characteristic $p$ and any integer $n \ge 1$, there are only finitely many isomorphism classes of continuous, semisimple, everywhere unramified, and geometric representations $\rho: G_K \to \mathrm{GL}_n(\overline{\mathbf{F}}_p)$ that admit an everywhere unramified characteristic-zero lift. Furthermore, we prove that the conjecture fails in general without this lifting hypothesis. Concretely, we construct infinitely many global function fields $K$ of characteristic $p$ admitting a continuous, surjective, absolutely irreducible, everywhere unramified, and geometric representation $\rho_r: G_K \twoheadrightarrow \mathrm{SL}_2(\mathbf{F}_{p^r})$ for each integer $r \ge 4$. As a corollary, we construct an everywhere unramified Galois extension \(L/K\), regular over \(\mathbf F_p\), with Galois group \[ \mathrm{Gal}(L/K)\cong \prod_{r\geq4}\mathrm{PSL}_2(\mathbf F_{p^r}). \] Combined with known cross-characteristic finiteness theorems, this completely resolves the question posed by Moon and Taguchi in dimension two: such extensions exist over global function fields of characteristic \(p\), whereas they cannot exist over global function fields of characteristic different from \(p\).
Read the full abstract
Optimization and Control
Efficient Algorithms for Energy-Aware Single-Machine Scheduling with Battery Storage
Energy-aware scheduling has become a central challenge in modern manufacturing environments. As industries increasingly aim to reduce operational costs and carbon emissions, aligning production activities with electricity tariffs is increasingly important. The integration of battery energy storage system (BESS) further enhances the potential to reduce energy purchase costs; however, incorporating such systems introduces complex interdependencies between job scheduling and BESS management decisions, significantly complicating the problem structure.\\In this work, we study the problem of minimizing the energy cost of executing a set of jobs on a single machine within a fixed time horizon, where electricity prices follow a Time-of-Use (TOU) tariff. In addition, we consider the presence of a BESS that can be charged from the grid and discharged during high-price periods to reduce overall energy costs. To efficiently address this problem, we propose and analyze two matheuristic algorithm variants designed to effectively coordinate production scheduling and BESS usage decisions.
Read the full abstract
Algebraic Topology
The homotopy types of directed path and trace spaces
We construct a saturated directed space with a Hausdorff $\Delta$-generated underlying space and two distinct points such that the trace space between them is homeomorphic to a square, whereas the directed path space has a nontrivial fundamental group. In particular, the canonical quotient map is not a weak homotopy equivalence. The same conclusion holds for regular directed paths modulo increasing homeomorphisms.
Read the full abstract
Earth and Planetary Astrophysics
Lava Tube Exploration with LunarLeaper
Lunar pits, some of which are interpreted as collapse features into underlying lava tubes, expose otherwise inaccessible stratigraphy and may provide entry points to subsurface voids that preserve records of lunar volcanism and offer potential sites for future human exploration. We synthesize the current state of knowledge on lunar pits and lava tubes, covering their morphological characteristics, classification, proposed formation mechanisms, mechanical stability, and detection from orbit. We then review the open science questions that pit and pit-wall investigation is uniquely placed to address, spanning the volcanic stratigraphy of the lunar maria, the structure and lateral variability of the regolith, and the dimensions and accessibility of subsurface conduits. To evaluate how these questions can be tackled in situ, we assess the feasibility and expected performance of geophysical and remote-sensing investigations for subsurface voids and surface exposures, mainly focusing on gravity measurements, ground-penetrating radar, high-resolution imaging, and spectroscopy. Building on this, we present LunarLeaper, a small legged robot mission concept combining a gravimeter, ground-penetrating radar, high-resolution imager, spectrometer, and leg-based geomechanical experiments to deliver the first in situ investigation of a mare pit. The concept targets the Marius Hills Pit and its associated rille, with a mobility architecture optimized for the rugged terrain encountered at pit edges and funnel slopes.
Read the full abstract
Artificial Intelligence
RouteRepair: Instance-Level Failure Diagnosis and Targeted Repair in LLM-Based Automated Heuristic Design for Routing Optimization
Efficient routing optimization is essential to freight transportation, urban logistics, and shared mobility, where high-quality heuristics are often required under limited computational budgets. Recent large language model (LLM)-based automated heuristic design methods can generate effective routing rules, but aggregate evaluation may mask recurrent failures on particular instance structures. To address this limitation, this study develops RouteRepair, which diagnoses parent-specific weaknesses from instance-level performance and applies targeted modifications to the corresponding heuristic components while protecting behavior that already performs well. Routing evidence, solver behavior, and program context are combined to define bounded repair objectives, and each intervention is validated through matched parent-child evaluation of failure recovery and collateral degradation. Experiments on the traveling salesman problem (TSP) and capacitated vehicle routing problem (CVRP) span constructive search, guided local search, and ant colony optimization. RouteRepair-GLS reduces the mean TSP optimality gap from 1.7476% to 0.7587%, while the constructive CVRP heuristic lowers average route cost by 1.91% relative to the savings heuristic; the generated ACO priors also outperform matched hand-designed priors. These results show that failure-aware, evidence-constrained refinement can improve routing heuristics on difficult instances while preserving performance on cases they already solve well.
Read the full abstract
Quantum Physics
Self-guided certification of nonlocality in quantum networks
Bell's theorem shows that quantum theory is incompatible with local hidden-variable models. In recent years, research on nonlocality has moved beyond Bell's original scenario to quantum networks, where multiple independent sources distribute physical systems among distant parties, giving rise to correlations certified by nonlinear rather than standard Bell inequalities. Here, we introduce a self-guided protocol that variationally optimizes each party's measurement to maximize the violation of a network Bell inequality, with the violation evaluated efficiently at each step via local Pauli classical shadows and the search driven by the Complex Simultaneous Perturbation Stochastic Approximation (CSPSA) algorithm. Once converged, the measurement settings it returns are implemented directly and the inequality is re-evaluated without shadows. This two-stage structure separates a device-dependent search from a certificate that depends only on the observed statistics and on the causal structure of the network. We validate the protocol by numerically simulating it on the triangle network using the Wagon-Wheel inequality, recovering the violation achieved by the Fritz distribution, and extending the certification to non-maximally entangled and noisy states.
Read the full abstract
Computation and Language
Cross-Lingual Clinical Annotation Projection as Constrained Text Generation: A Six-Language Study
Background: To determine whether cross-lingual clinical annotation projection can be formulated as a text-preserving, document-level generative task that produces verifiable character-level annotations for multilingual clinical corpus construction, and to characterize its robustness and computational trade-offs relative to candidate-based projection pipelines. Methods: We developed a constrained LLM projection workflow that inserts entity tags directly into immutable target-language text, followed by deterministic validation and character-offset reconstruction. We evaluated it alongside supervised candidate-span projection and hybrid ML-LLM refinement for transferring Spanish Disease, Symptom, and Procedure annotations into six languages. Evaluation used MultiClinAI gold standard with strict span matching and character-overlap F1 Results: Direct LLM projection achieved the strongest and most consistent performance. GLM 5.2 obtained a mean Strict F1 of 0.9201 across 18 language-entity combinations, while locally deployable Gemma4:31B achieved 0.9133. The best LLM configuration improved Strict F1 over the previous state of the art in all 18 settings, by 0.0564-0.1512, yielding 55,416 grounded mentions with reconstructed offsets. Conclusions: Direct LLM-based projection enables high-quality multilingual clinical annotation transfer and provides a practical approach for extending clinical NLP resources to languages with fewer annotated datasets and language-specific tools. Combined with local inference and deterministic validation, it can substantially reduce expert time and cost for multilingual clinical corpus construction.