Atomic Physics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 3 September
Ion pumps used in cold-atom experiments generate stray magnetic fields that can perturb magneto-optical trapping, shift Zeeman sensitive energy levels, and introduce systematic errors in precision spectroscopy. We numerically investigate a compact low-stray-field ion pump configuration designed to reduce magnetic flux leakage through the ultrahigh-vacuum port without increasing the overall pump size. Starting from a simplified magnetic model of a standard ion pump, we study two complementary modifications: auxiliary permanent magnets surrounding the original pump magnets with opposite magnetisation, and a soft-magnetic honeycomb field stopper integrated at the pump port. The resulting combined configuration strongly reduces the magnetic flux density outside the pump. In the geometry considered here, the field at 10 mm from the UHV port is reduced by 97.9%, while the calculated reduction in effective pumping speed due to the honeycomb stopper is 17.9%. These results indicate that engineered magnetic compensation and field-guiding structures can support more compact cold-atom vacuum systems while preserving pumping performance. Further work should validate the design with nonlinear magnetostatic modelling, molecular-flow simulations, and measurements on a complete pump geometry.
Computer Vision
Occlusion-Robust Multimodal Emotion Recognition in VR via Fusion of Facial Images and EMG
Head-mounted displays (HMDs) fundamentally limit emotion recognition in virtual reality (VR): by occluding the upper face, they render conventional image-based facial expression analysis incomplete, particularly for applications requiring real-time affective assessment. We address this challenge by fusing lower-face video with facial electromyography (EMG) from the occluded upper face to classify seven emotional categories (six basic emotions plus neutral). We introduce a synchronized multimodal dataset from 20 participants, pairing lower-face video with seven-channel upper-face EMG elicited by validated emotion stimuli. Under subject-independent test, our proposed late-fusion architecture merging convolutional visual embeddings with RBF-kernel EMG representations achieves 51% macro-F1, outperforming both image-only (41%) and EMG-only (43%) baselines. These results demonstrate that upper-face EMG provides robust complementary information under HMD-induced visual occlusion and establish a foundation for multimodal emotion recognition in naturalistic VR environments. This approach facilitates affect-adaptive applications, including communication training and therapeutic interventions. The dataset will be shared upon request under an ethical-use agreement.
Read the full abstract
Earth and Planetary Astrophysics
Effect of stellar spot-only spectral lines in high-resolution transit spectroscopy
We investigate how a representative single spectral line present only in a stellar spot can introduce distortions in high-resolution planetary absorption spectra. Specifically, we assess whether such spot-induced features may resemble planetary atmospheric absorption and the observational or stellar conditions under which they become significant. Using the SOAPv4 code, we simulated transit observations of an atmosphere-less planet across a star with a spot containing an additional absorption line compared to the photosphere's spectrum. Two systems were modelled: a close-in Jupiter-sized planet and a distant Earth-sized planet transiting a Sun-sized star. We varied the stellar rotation period and the spot size, and ensured that the planet transits the spot. Spectral lines were idealised Gaussians to isolate the impact of the spot-specific feature. We show that a single stellar spot line can generate spurious features in the absorption spectrum. These features contaminate the absorption spectrum in ways that may lead to misinterpretation if not accounted for. For Jupiter-sized planets with short transits, the features are mainly emission-like, but can nonetheless dampen a potential true atmospheric absorption signature. For Earth-sized planets with long transits, the distortion is mainly absorption-like and could be interpreted as planetary absorption. These results highlight the importance of accounting for stellar heterogeneity and activity in the analysis of high-resolution absorption spectra.
Read the full abstract
Dynamical Systems
Combinatorial Search for Strong Shift Equivalence
The most important open problem of symbolic dynamics consists in finding a procedure to decide whether two subshifts of finite type are conjugate or, equivalently, whether two nonnegative integer matrices are strong shift equivalent. While the problem remains hard in general, the literature also contains specific examples of matrices that are not known to be strong shift equivalent: the Baker matrices, and Ashley's eight-by-eight. These specific examples have been open for 30 years. Using computer experiments, we show that the Baker matrices are indeed strong shift equivalent for small values of k, and that Ashley's eight-by-eight matrix is indeed strong shift equivalent to the one-by-one matrix 2
Read the full abstract
Commutative Algebra
Cohen–Macaulayness of $\mathrm{Inc}(\mathbb{N})$-Invariant Chains of Edge Ideals
Let $(G_n)_{n\ge n_0}$ be a family of graphs on $[n]$ whose edge ideals $I_n\subseteq R_n=k[x_1,\dots,x_n]$ form an $\mathrm{Inc}(\mathbb{N})$-invariant chain, $I_{n+r}=\mathrm{Inc}(\mathbb{N})_{n,n+r}(I_n)$ for $n\ge n_0,\ r\ge0$. We determine which pairs $(n,r)$ make $R_{n+r}/I_{n+r}$ Cohen–Macaulay, for five classical families: line graphs $L_n$, complements of line graphs $L_n^c$, complete graphs $K_n$, cyclic graphs $C_n$, and complements of cyclic graphs $C_n^c$. For line graphs we give the generators of $I_{n+r}$, the height and Krull dimension of $R_{n+r}/I_{n+r}$, and a complete classification: for $n\ge5$, $R_{n+r}/I_{n+r}$ is Cohen–Macaulay if and only if $r=n-4$. For complements of line graphs, complete graphs, and complements of cyclic graphs, we show the chain is Cohen–Macaulay unconditionally, for every $r\ge0$; the first and third arise from the same underlying phenomenon, in which the $\mathrm{Inc}(\mathbb{N})$-invariant chain reproduces the original graph itself at each step. For cyclic graphs we prove $\mathrm{Inc}(\mathbb{N})_{n,n+r}(I(C_n))=I(K_{n+r})$ once $r\ge n-3$, giving Cohen–Macaulayness in this range, and conjecture – with supporting computational and structural evidence – a complete classification: Cohen–Macaulayness holds if and only if $r\ge\lfloor(n-4)/2\rfloor$ and $r\ne n-4$.
Read the full abstract
Robotics
Toward Physically Grounded JEPA World Models for Goal-Conditioned Robotic Planning
Action-conditioned JEPA world models enable planning toward visually specified goals without reconstructing future pixels, yet latent prediction alone does not explicitly encourage the learned representations to retain information relevant to robotic control. We introduce an end-to-end JEPA world model that augments latent prediction with inverse dynamics (IDM) and state alignment (SA). While inverse dynamics discourages latent collapse and makes latent transitions informative of the actions that produced them, state alignment grounds consecutive representations in their associated physical configuration and motion. Across four benchmark tasks, our model attains the highest success rates on TwoRoom (100%), PushT (98%), and OGBench-Cube (87%), while performing comparably to LeWorldModel on Reacher. Our ablation further shows that adding state alignment consistently improves planning success over IDM alone across all four tasks. Although LeWorldModel, our primary baseline, attains higher average straightening on OGBench-Cube, transition-subspace analysis shows that its transition energy is concentrated in a substantially lower-dimensional subspace. Our state-aligned model exhibits a higher effective transition dimension than LeWorldModel and improves planning over IDM alone, supporting state alignment as an effective complement to inverse dynamics for robotic planning.
Read the full abstract
Earth and Planetary Astrophysics
Dynamically favorable hosts for submoons around Jupiter and Saturn
The long-term stability of small bodies orbiting natural satellites (submoons) in the Solar System has been previously investigated using an analytical approximation of a three-body problem, focusing mainly on tidal forces and neglecting other perturbations. This approach suggests that submoons around most of the regular satellites in the Solar System could be stable. However, no such object has been detected to date. In this work, we extend these previous results by numerically testing the survival of submoons around a large number of satellites of Jupiter and Saturn. Our goal is to rank the satellites of Jupiter and Saturn according to how dynamically favorable they are for submoon survival over the simulated timescales. For each regular or irregular satellite considered, we performed 130 separate N-body integrations, each containing one hypothetical submoon with a different initial semimajor axis and inclination. From the 1 Myr survival fractions, we rank the satellites according to their dynamical favorability for submoon survival over the simulated timescale. We find that, after 1 Myr, the satellites with the highest survival fractions (above 30%) are Iapetus ($\approx 37\%$), Titan ($\approx 35\%$), Rhea ($\approx 32\%$), Phoebe ($30\%$), Callisto ($\approx 34\%$), and Ganymede ($30\%$). Rather than providing absolute probabilities for the existence of submoons, these survival fractions identify the most dynamically favorable hosts. Iapetus, Titan, Rhea, Phoebe, Callisto, and Ganymede are the most dynamically favorable submoon hosts among the tested satellites.
Read the full abstract
Computer Vision
FlashRender: Few-Step Generative Rendering via Camera-Controlled Video MeanFlow
We present FlashRender, a few-step generative rendering framework that retakes a source video along a target camera trajectory in seconds. We identify sampling-step-dependent camera control as a prominent manifestation of discretization error in existing multi-step generative rendering models and show that resolving this inconsistency substantially lowers denoising trajectory curvature, facilitating subsequent step distillation. To this end, we introduce Representation Transformation and Alignment (RETA), which aligns hidden source-video representations with target-video features from a frozen visual geometry model. This directly encodes the geometric transformation within the source-video stream, enabling sampling-step-consistent camera control. We then fine-tune the model with the MeanFlow objective on the lower-curvature denoising trajectory induced by RETA, allowing the model to more effectively address discretization error. Finally, we apply on-policy flow map distillation to correct self-rollout errors under fixed few-step sampling. Extensive experiments show that RETA, MeanFlow, and on-policy flow map distillation play complementary roles in few-step generative rendering. Together, they enable our approach to match multi-step baselines in video quality and geometric consistency at 25x lower sampling cost while achieving superior camera controllability, even under out-of-distribution target camera trajectories.
Read the full abstract
Distributed Computing
JuPyLive: Seamless Migration of Jupyter Notebook Resources from Laptop to HPC
This work introduces JuPyLive, a migration mechanism that enables seamless transition of Jupyter notebooks between local resources of user's workstation and remote resources of high-performance computing~(HPC) environments, while preserving the user experience. JuPyLive eliminates the underlying complexities of migration process, enabling users to freely choose among available local and remote resources, directly within the familiar Jupyter notebook environment via a single click. JuPyLive leverages ElasticNotebook to manage in-memory state migration, it automates resource allocation on HPC cluster and orchestrates required remote communication channels between the source and destination to enable a bidirectional migration. Furthermore, HPC status monitor of JuPyLive provides a live overview of available remote resources, allowing users to make informed decisions on choosing the relevant resources before initiating a migration process. The proposed fully automatic mechanism requires no code changes or configurations by the end user, nor does it demand users to learn a new syntax, instead the migration process can be intuitively initiated and monitored using visual elements from within the Jupyter notebook. By bridging the gap between local workspace and remote resources, JuPyLive offers a seamless experience for scaling local resource-intensive workflows with minimal user intervention, thus further democratizing the usage of HPC clusters among the interdisciplinary researchers.
Read the full abstract
Robotics
TRaIL-Odom: Tightly Coupled Continuous Time Radar-IMU-LiDAR Odometry with Adaptive Doppler Weighting
Existing radar-LiDAR fusion methods rely on fixed residual weights, even though the informativeness of radar Doppler and LiDAR geometry is scan- and direction-dependent, leading to uniform radar weighting that misallocates Doppler information across translational directions. To address this limitation, we propose two degeneracy-aware Doppler reweighting modules within a tightly coupled Radar-IMU-LiDAR odometry framework: per-point radar reweighting and scan-wise radar gain scheduling. Since geometric degeneracy is directional, we first identify weak translational directions from the LiDAR geometry and reweight individual radar Doppler constraints based on their alignment with the weak subspace. We further adjust the overall radar contribution using LiDAR geometric anisotropy such that radar is emphasized when LiDAR observability is poor and suppressed when LiDAR constraints are already reliable. Across 13 evaluated sequences, TRaIL-Odom achieves state-of-the-art overall performance, with clear advantages in geometrically degenerate scenes. In ablation experiments on three degenerate sequences, combining the two adaptive weighting modules reduces RMSE ATE and RTE by 86.0% and 78.5% relative to the fixed-weight baseline. We make our code and an accompanying dataset publicly available at https://github.com/ChiyunNoh/TRaIL-Odom.
Read the full abstract
Statistical Mechanics
Sample-specific rectification-like response in a boundary-driven exclusion process
We investigate the current response of a boundary-driven symmetric exclusion process with quenched site disorder. Hard-core particles hop symmetrically on a one-dimensional lattice with site-dependent rates and are injected and removed at the boundaries by two reservoirs of different densities. We approximate the steady-state density profile using a Galerkin projection at linear order and a mean-field closure at higher orders, and thereby obtain the current as a nonlinear function of the reservoir density difference. At linear order in the reservoir density difference, the current-response coefficient depends on the mean reservoir density $\rho$, in contrast to the homogeneous case. Through the linear-response relation, this dependence leads to an equilibrium current-fluctuation coefficient that is asymmetric under $\rho\rightarrow 1-\rho$. Beyond linear response, nonzero even-order current contributions break the antisymmetry of the current under reversal of the reservoir density difference, producing rectification-like behavior in individual disorder realizations. We further show that spatial-reflection symmetry of the equilibrium density profile rules out such behavior, so broken spatial-reflection symmetry of the profile is a necessary condition for rectification-like behavior. Within the present approximation, we further find that, for continuously distributed site disorder, rectification-like behavior occurs arbitrarily close to equilibrium for almost every disorder realization. At the ensemble level, however, the disorder-averaged current remains antisymmetric because the disorder ensemble is invariant under spatial reflection. These results provide a mechanism for rectification-like transport arising from sample-specific spatial heterogeneity rather than from an explicitly imposed directional asymmetry.
Read the full abstract
Networking
A Semantic-Aware Multiple Access Scheme Leveraging Spatial Redundancy for Uplink-Dominant Network Services
The transition toward semantic-aware communication offers a paradigm shift for next-generation mobile networks, promising to decouple information significance from raw data transmission. Despite advances in semantic extraction, the integration of semantic intelligence into the Medium Access Control (MAC) layer remains underexplored, particularly in exploiting spatial correlations among users. To address this, we introduce a novel multiple access scheme designed for uplink-dominant network services. This framework optimizes the trade-off between spectrum utilization and sustainability by formulating variable-packet-length access as distinct $\alpha$-fairness and energy efficiency problems. A key innovation of our approach is the quantification of spatial redundancies through novel metrics of self-throughput and assisted-throughput, which account for the semantic correlation of data across user equipment. We analyze these formulations to identify optimal bounds before proposing PRISM (Protocol for Redundancy Identification in Semantic Multiple-access). Grounded in Model-free Multi-Agent Deep Reinforcement Learning (MADRL), PRISM enables devices to autonomously govern spectrum access using only local observations. Extensive evaluations demonstrate that PRISM successfully leverages redundancies to outperform semantic-oblivious schemes, achieving up to \({90\%}\) of the centralized optimal benchmark and improving both objectives by up to \({2\times}\) across diverse user-semantic association matrices. These results validate PRISM as a viable candidate for future distributed mobile network applications, complemented by orthogonal Multiple Access Schemes where signals are multiplexed in the semantic domain.
Read the full abstract
Analysis of PDEs
Local well-posedness of the higher-order nonlinear Schrödinger equation on the half-line: the case of two boundary conditions
We prove the local Hadamard well-posedness of the higher-order nonlinear Schrödinger equation with negative dispersion coefficient on the half-line under nonzero Dirichlet and Neumann boundary data. The paper uncovers a striking feature of this model: unlike the positive-dispersion case studied in (Alk{\i}n, Mantzavinos, Ozsari, 2024), well-posedness requires two boundary conditions rather than one. This reflects a structural limitation in the underlying global relation, which allows elimination of at most one unknown boundary trace. Using the unified transform of Fokas, we derive an explicit solution formula for the associated forced linear problem and establish sharp Sobolev and Strichartz estimates on the half-line. These linear estimates, together with corresponding Cauchy problem bounds, yield local well-posedness in both high- and low-regularity Sobolev spaces, as well as local Lipschitz continuity of the solution map.
Read the full abstract
Computer Vision
Building Pretraining Data for World Models: An Unreal Engine-Based Pipeline for Action-Conditioned Video Generation
Action-conditioned video models require large-scale visual data paired with control signals that are temporally aligned with the resulting scene transitions. Such supervision is difficult to obtain from ordinary real-world video because the actions that caused each visual change are typically unknown. We present a large-scale synthetic data production pipeline built on Unreal Engine for generating action-conditioned, multi-view video. To accommodate the different execution requirements of real-time physics and high-quality offline rendering, the pipeline executes trajectory generation and final rendering in two stages: Stage I runs real physics in PIE and records per-frame character states, control inputs, and camera states into an intermediate trajectory representation; Stage II replays those trajectories in a new engine process and renders them offline with Movie Render Queue (MRQ). Around this core, we develop a distributed production system with cache-aware task partitioning, node-local slot scheduling, automated scene screening, aesthetic and luminance filtering, partial-output recovery, asynchronous upload, and continuous cluster health monitoring. The production cluster contains 25 servers with eight NVIDIA RTX 5090 GPUs per server. From 2,384 asset packs, 429 levels were retained for production together with a pool of 40 humanoid characters. The pipeline has produced 2,691 hours of 1080p video and 6,076 hours of 720p video. We describe the system architecture, the implementation decisions that emerged from production failures, and the limitations of using perceptual quality proxies for world-model data curation. The pipeline described in this report constitutes the Unreal Engine synthetic-data production component used in EchoWM.
Read the full abstract
Probability
An Effective SPDE Model for a Schrödinger Equation with a Fluctuating Magnetic Potential
We consider the Schrödinger equation for a charged particle in a randomly fluctuating external magnetic field and establish a singular perturbation limit in which the solution converges to a deterministic Schrödinger equation with Gaussian fluctuations. We propose a stochastic Schrödinger equation incorporating the behavior of both the deterministic average and the fluctuations and show that it has the same limiting behavior as the original model, while providing a simpler way to study the distribution of relevant observables.
Read the full abstract
Mesoscale and Nanoscale Physics
Spectral Function Method and Janus Quantum Numbers in Quasiperiodic Systems
The absence of translational symmetry in quasiperiodic systems invalidates conventional band theory, posing the central challenge in the field. Building upon the incommensurate energy band (IEB) concept, we establish a unified spectral theory for quasiperiodic systems by introducing two key advances. First, we develop an efficient spectral function method that calculates $A(k,\omega)$ using a small truncated Hamiltonian matrix, bypassing full diagonalization. It converges via a distinctive successive locking of energy moments, yielding exact thermodynamic-limit results without finite-size scaling. Second, we introduce that quasiperiodic eigenstates possess Janus quantum numbers: a single eigenstate, continuously tracked across localization transitions, carries dual labels in momentum and real space, which naturally reduce to the familiar Bloch momentum and band index in the commensurate limit. Together with IEB, these advances constitute a “band theory” for quasiperiodic systems, enabling us to define, compute, and label states with the same facility as in periodic ones.
Read the full abstract
Computer Vision
WIDE: Wildcard Inference with Dynamic Expansion for Cross-Modal Generative Retrieval
Generative retrieval has demonstrated significant success by unifying representation learning and search into a single sequence-to-sequence generation task. However, extending this paradigm to cross-modal retrieval reveals a critical challenge arising from the inherent information asymmetry across different modalities, such as the gap between concise text queries and dense visual candidates. This structural mismatch causes the autoregressive decoder to suffer from forced hallucination when generating identifiers via standard trie-constrained beam search, where the model is severely penalized for failing to guess fine-grained details absent from the query, allowing irrelevant candidates to hijack top rankings. To address this issue, we propose Wildcard Inference with Dynamic Expansion (WIDE). WIDE employs Adaptive Entropy Thresholding (AET) to calibrate layer-specific uncertainty boundaries offline. During the decoding generation phase, Asymmetry-aware Wildcard Decoding (AWD) detects semantic blind spots and emits wildcards instead of forced deterministic identifiers, dynamically expanding the search space without incurring log-probability penalties. Finally, Blind-Spot Re-ranking (BSR) evaluates the expanded candidate pool using a hybrid scoring mechanism that combines discrete generation confidence with continuous semantic similarity. Extensive experiments on the M-BEIR benchmark demonstrate that WIDE outperforms state-of-the-art generative retrieval methods, effectively suppressing forced hallucination while maintaining compact index structures.
Read the full abstract
Artificial Intelligence
GPS-Bench: A Governance Policy Benchmark for Automating Policy Analysis
Policy analysis requires more than predicting whether a proposal will pass: it requires identifying who will be affected, how those actors respond, and what follows. LLM-based policy simulations model these processes at scale, but their validity is hard to establish when plausible behaviour is never compared with observed outcomes. We introduce GPS-Bench, an evidence-grounded benchmark for governance policy simulation that links policies to relevant actors, actor actions and downstream impacts using legislative records, lobbying disclosures, regulatory documents, corporate filings, economic data and other public evidence. Actors are reconstructed from the dated record rather than prompted as archetypes, so a persona is an evidence object with provenance; a human-annotated pool forms the Gold evaluation set, while cases labelled by a separate LLM from retrieved evidence are treated as Silver supervision and never as test labels. Because every inference mode reads the same grounded state and emits the same schema, GPS-Bench turns "does multi-agent simulation help?" into a controlled comparison: we contrast joint reasoning, independent and communicating actor agents, graph-based methods and weight-level fine-tuning over one policy state. Fine-tuning on the grounded record gives the strongest actor-level impact prediction, and decomposition does not beat it; what decomposition adds is mechanism. Agents hold private, non-identical evidence, each seeing its own exposure clause, and address named partners with concrete joint proposals, what they offer, what they need in return, and why acting together beats acting alone, so the coalitions that form can be checked against the commitments the record holds. GPS-Bench therefore gives a common empirical setting for studying when evidence, actor modelling and multi-agent interaction improve the prediction and interpretation of policy outcomes.
Read the full abstract
Portfolio Management
An Entropic Factor Model for Robust Portfolio Replication
Portfolio replication, or the construction of a tradable basket of assets to match the risk-return profile of a target benchmark, is fundamentally an ill-posed inverse problem. When restricted to a subset of available assets, classical variance-minimizing models often yield unstable, over-leveraged portfolios highly vulnerable to market shocks. We propose a unified, two-stage methodology rooted in information theory to achieve robust portfolio replication. First, we model the constituent asset returns against target factors, estimating parameters within data-driven empirical bounds via an entropy minimization principle. Second, using the same entropic approach, we determine the optimal weight replication. In both cases we use an entropy function of the Fermi-Dirac type defined directly on sets of constraints of the inverse problem. We validate this Entropic Factor Model (EFM) against standard Ordinary Least Squares (OLS) across five numerical experiments, including standard equity tracking, multi-asset synthesis, and severe stress-test scenarios. Empirical results demonstrate that the EFM consistently outperforms OLS in terms of annualized turnover and net-of-fees returns. Crucially, during the COVID-19 market crash and under severe idiosyncratic data corruption, the entropic framework acts as a probabilistic “circuit breaker", defensively reducing capital allocation to compromised assets and providing a highly robust, risk-averse solution for generalized portfolio replication.
Read the full abstract
Quantum Physics
Enhancing noise robustness in device-independent conference key agreement with asymmetric parity-CHSH inequalities
Conference key agreement allows multiple remote parties to establish a shared secret key with information-theoretical security. In device-independent conference key agreement, security can be guaranteed with minimal assumptions on the devices used, provided that a violation of a Bell inequality is observed. However, implementations are extremely challenging because high detection efficiency is required to observe loophole-free Bell violations. Here, we enhance the robustness of device-independent conference key agreement by introducing a new family of multipartite Bell inequalities called the asymmetric parity-Clauser-Horne-Shimony-Holt (CHSH) inequalities. We derive a tight analytical lower bound on the conditional von Neumann entropy of the outcomes of one of the parties in a protocol based on this inequality, including noisy preprocessing. Using this bound, we analyze robustness to detection inefficiencies as well as local and global depolarizing noise. We show that the combination of the asymmetric parity-CHSH inequality and noisy preprocessing can significantly improve the robustness to imperfections.
Read the full abstract
Plasma Physics
$X$-dispersionless solver for electromagnetic and axion fields in a cylindrical particle-in-cell code
We develop a quasi-cylindrical direction-splitting (QDS) dispersionless Maxwell solver for the open-source EPOCH particle-in-cell framework. The method preserves the exact axial phase velocity for every retained azimuthal mode by advecting transverse transport variables with the $c\Delta t=\Delta x$ shift. Building on the same transport viewpoint, we formulate an axion solver that advances the Klein–Gordon equation and the axion-regenerated electromagnetic fields within the QDS solver, so that axion–photon coupling is handled self-consistently. Benchmarks demonstrate that the cylindrical QDS solver reproduces the standard Yee wakefield structure while removing the axial group-velocity error and reducing computational cost by orders of magnitude. In the resonant axion generation test via two-color laser mixing, the QDS solver eliminates the spurious vacuum source term and maintains phase matching, whereas the Yee solver suffers from rapid dephasing due to numerical dispersion. The proposed algorithm therefore enables quasi-3D simulations of axion–photon physics in laser-plasma interaction with dispersion-free laser transport.
Read the full abstract
Optimization and Control
Well-posedness of Filtering Equations in Weighted Sobolev Spaces with Unbounded System Coefficients
Nonlinear filtering problem is one of the core subjects in modern control theory. In this paper, we will study the well-posedness of the three fundamental evolution equations arising in continuous-time nonlinear filtering–the robust Duncan-Mortensen-Zakai (DMZ) equation, the stochastic DMZ equation, and the Kushner-Stratonovich equation–within a unified buffered weighted formulation. An exponential-type weight function and the corresponding weighted Sobolev spaces are introduced to enable a variational treatment of the filtering equations in a more general setting, in which the coefficients of the filtering system may be unbounded with polynomial growth. Under mild and easily verifiable assumptions, we first establish the well-posedness of the weak solution to the robust DMZ equation in these weighted spaces. Using the gauge (exponential) transformation and its inverse, these results are then transferred to the stochastic DMZ equation and the Kushner-Stratonovich equation, whose solutions are shown to exist and be unique in buffered weighted Sobolev spaces, yielding a unified treatment of all three filtering equations. Sufficient conditions for the well-posedness are also summarized, which illustrate the wide applicability of the proposed framework to general nonlinear filtering systems.
Read the full abstract
Other Condensed Matter
Magnetic Couplings in Half-Filled Bipartite Graphs
We break from perturbative frameworks to establish a non-perturbative generalization of magnetic exchange rules in half-filled bipartite networks. While historical models remain strictly tied to the debatable perturbation approach in the dilute limit and require the absence of zero-energy modes, our universal mechanism governs exchange interactions across arbitrary bipartite graphs. By bypassing traditional expansion bottlenecks, this framework provides an analytical predictive tool for magnetism in complex lattices, offering key design principles to engineer stable, long-range order in next-generation 2D spintronic devices
Read the full abstract
Cryptography and Security
The Native-Signature Boundary in Post-Quantum Distributed Authorization
Post-quantum signature migration poses a distinct systems problem when authorization is distributed among multiple parties. In native threshold signing, the signature algorithm may determine key generation, share state, preprocessing, interaction, combination, refresh, and recovery. Architectures that evaluate threshold policy outside the native signing relation can reduce this coupling, but their authorization evidence is not accepted by an unchanged native verifier unless a trusted complete-key signer translates approval into a native signature. This paper organizes that design boundary through three properties: native-signature compatibility, unilateral-signing resistance, and threshold-layer agility. We classify specialized threshold signatures, generic MPC signing, distributed hash-based constructions, programmable multisignature and dual-gate authorization, and threshold-authorized HSM signing. A migration impact surface identifies which components change with the signature algorithm. Across the surveyed families, no design simultaneously provides native output, unilateral-signing resistance, and threshold-layer agility. This is an architectural tension, not an impossibility claim, and it clarifies why a replaceable API alone does not make distributed authorization cryptographically agile.
Read the full abstract
Artificial Intelligence
Dalek: A Constructive Agent Machine
We present Dalek, a closed machine designed for agents that realizes self-maintenance, self-evolution, self-reproduction, and self-organization on any substrate satisfying a general host contract. The machine is built from three primitives—actors, messages, and channels. Four obligations—a host boundary, a construction language, admissible transitions, and rule heredity—give its boundary, identity, and closure a structural basis. Von Neumann's 1948 self-reproducing automaton supplies a hereditary constructional core: a self-description together with a constructor, a copier, and a controller. Dalek combines this core with the four obligations and rederives its medium for a text-and-message agent substrate, adding explicit structures for boundary, identity, history, and growth. A large language model and a compiler occupy the payload position and form a general capability producer. New capabilities are authored, compiled, installed into the description, and inherited by descendants. The same path produces the machine's own organs and even its runtime, closing heredity and evolution within the machine.
Read the full abstract
Nuclear Theory
Influence of configuration-interaction on isospin impurities and isospin symmetry breaking corrections to superallowed $0^+\rightarrow 0^+$ beta decays
The symmetry-conserving density functional theory (DFT)-based no-core configuration-interaction (DFT-NCCI) framework is applied for the first time to investigate the impact of configuration interaction (CI) on the Coulomb (isospin) impurity, $\alpha_{\rm C}$, in the ground and excited states of $^{10}$C, $^{10}$B, and $^{14}$N, as well as on the isospin-symmetry-breaking (ISB) correction to the superallowed $0^+ \rightarrow 0^+$ $\beta$ decay of $^{10}$C. We demonstrate, among other findings, that within the DFT-NCCI framework CI has a negligible effect on the ground-state isospin impurities, which are dominated by a single doorway state. In contrast, CI significantly modifies the impurities in excited states, including the isobaric analogue $I=0^+,\,T=1$ state in $^{10}$B. Hence, it also has a non-negligible impact on the ISB correction to the superallowed $\beta$ decay of $^{10}$C. Our calculations yield $\bar{\delta}_{\rm C}=0.45(4)\%$ when the Coulomb interaction is taken as the sole source of ISB, and $\bar{\delta}_{\rm ISB}=0.46(6)\%$ when short-range charge-symmetry-breaking (CSB) terms are included in addition. Hence, no statistically significant dependence of the ISB correction on the short-range CSB interaction is observed for this decay. Comparison with our previous results reveals a strong sensitivity to the nuclear symmetry energy, which governs the strength of the isospin-restoring force and whose value in finite nuclei remains difficult to constrain because of its intricate dependence on the momentum-dependent terms of the effective interaction.
Read the full abstract
Computer Vision
SafeRI: Recognition and Intervention for Token-Level Safety Intervention in Large Vision Language Models
Existing safety alignment methods for vision-language models usually modify the model behavior globally: once the safety parameters are trained or loaded, they participate in both unsafe and already-safe generations. This always-on intervention can unnecessarily perturb the model's original reasoning path and degrade general multimodal capabilities. We argue that safety alignment should be an on-demand intervention rather than a permanent modification to every decoding trajectory. To this end, we propose a streaming recognition and gated LoRA framework for intrinsic VLM safety. During autoregressive generation, a lightweight recognizer estimates whether the current pre-token generation state is safe or unsafe. Its output updates the LoRA gate for the following decoding step; otherwise, generation follows the frozen-backbone policy. The LoRA module is trained from unsafe prefixes, transition statements, and safe continuations, so that it learns to redirect unsafe generations back to safe responses after activation. Experiments across multiple safety and general-purpose benchmarks demonstrate the effectiveness of our method in post-alignment settings.
Read the full abstract
Quantum Physics
Pulse-Controlled Topologically Protected Quantum Batteries
Quantum batteries have emerged as a promising new generation of energy-storage devices for powering quantum technologies. Long-distance charging is particularly attractive because it minimizes interference between the charger and the battery, thereby attracting considerable interest. Here, we propose a topologically protected long-distance charging protocol for quantum batteries based on a pulse-controlled superconducting qubit chain. By dynamically modulating the pulse-mediated couplings, we realize topologically protected energy transfer from the charger to the battery. We show that the charging process is free of energy backflow and remains robust against imperfections in pulse control. Moreover, the energy stored in the battery at the target time is fully extractable, and the protocol remains effective for relatively large system sizes. To further accelerate charging, we optimize the pulse shape and elucidate the underlying physical mechanism. Our pulse-controlled topological quantum battery protocol provides a versatile framework for implementing long-distance topological charging and establishes a theoretical foundation for designing optimal-control strategies to enhance quantum battery performance.
Read the full abstract
Quantum Physics
Heralded one-, two- and three-photon states from waveguided parametric down-conversion
The manifold coincidences and singles counting provides a resource-saving quantum-optics analysis tool, since it is appropriate even in the presence of heavy experimental imperfections. Here, we prepare cross-polarized twin beams in the telecommunication wavelength range via parametric down-conversion in a periodically-poled KTiOPO$_4$ waveguide and herald photon-number states up to three photons. First, we show that the single-click probability is a versatile tool not only for extracting the state's mean photon number but also for sampling values of the moment generating function being the core behind any quantum optical state. Second, we measure values of the normalized factorial moments of photon number, $g^{(m)}_{\text{h}}$, up to the order $m = n+1$ for the heralded $n$-photon state. These normalized photon correlations provide an expedient method for examining the higher-order non-classicality of light by violating the condition $g^{(m+1)}_{\text{h}} \ge g^{(m)}_{\text{h}} \ge 1$.
Read the full abstract
Computational Physics
BU-MBAR: A hybrid solution strategy for the MBAR equations
The multi-state Bennett acceptance ratio (MBAR) equations combine the data collected under different thermodynamic conditions in a statistically optimal way. Due to their practical importance, several solution strategies have been devised to optimize the convergence of the resulting set of coupled equations. However, even with graphics processing unit (GPU) acceleration, the convergence of these methods can still be either unstable or slow. We propose a new approach where the equations are interpreted as the limit of infinitesimal bin width of the respective weighted histogram analysis method (WHAM). In the proposed binned-to-unbinned MBAR (BU-MBAR) method, the bin width is adapted dynamically to ensure a stable and efficient convergence to the asymptotic solution.