Peer Revenue Publish or profit

Papers

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

All of arXiv

Sunday 6 September

Artificial Intelligence

A Computational Implementation of a Goal-Directed Theory of Affect

Computational modeling of emotion has long faced a tension between descriptive, "snapshot-based" appraisal models and granular, signal-driven architectures that often lack appropriate psychological grounding. This paper addresses this gap by presenting the first high-fidelity computational implementation of the Goal-Directed Theory (GDT) of affect. In this framework, affect is not a post-hoc label but a functional byproduct emerging from the continuous interplay between discrepancy detection and action selection within an agent's internal processing cycles. We evaluate the model through a series of principled simulations (Dice/Corridor tasks) designed to isolate affective signatures and dynamics during multi-step goal pursuit. Results demonstrate that complex affective profiles, like an anticipatory "lift" and a failure "crash", emerge naturally from simple interactions between goal-discrepancy and action-selection expectancies without requiring additional dedicated modules. By ensuring every computational component maps directly to components of the psychological theory, this work establishes a transparent, testable framework that enables a continuous "simulation-empiry" research loop. Our work contributes to moving the field beyond "black-box" heuristics toward a granular, mechanistic understanding of affect, integrated into the core of agent behavior.
Read the full abstract

All authors Bernhard Hilpert, Tamás Szűcs, Joost Broekens, Agnes Moors

Solar and Stellar Astrophysics

PySeshat: A Validated Python Pipeline for Binary-Star Orbit Determination and Al-Wardat Stellar Atmosphere Modeling

Precise stellar masses and physical parameters for binary and multiple star systems require, respectively, well-constrained orbital solutions and independent stellar-atmosphere modeling. Existing open-source software addresses these separately, and hierarchical triple systems additionally require simultaneous fitting of their inner and outer orbits, a treatment few existing tools provide. We present PySeshat, an open-source Python package unifying binary and hierarchical-triple orbit determination with stellar SED fitting in a single, validated pipeline. The package fits visual, spectroscopic, and combined binary orbits by least-squares, and hierarchical-triple orbits through two parallel formalisms, one of which fits both inner and outer orbits simultaneously rather than sequentially. Both share a common Bayesian posterior-sampling layer. A second module fits two-component synthetic spectra to a binary's combined, unresolved photometry to recover each component's temperature and radius. The software was validated against twelve real, published benchmark systems, cross-checked against three independent orbit-fitting packages and real space-telescope archive data. All twelve benchmark systems reach fit quality consistent with their published solutions. Comparing the simultaneous and sequential triple-fitting formalisms on the same real systems shows the simultaneous approach is not merely preferable but necessary: one system's orbital configuration cannot be represented by the sequential formalism at all. Fitting four independently published systems' photometry reveals a degeneracy in recovering individual temperatures for near-twin-temperature stellar components from unresolved light, independent of how much photometric data is available. The package provides a validated, open, and extensible pipeline for binary and multiple star system analysis, publicly released and freely installable.
Read the full abstract

Computer Vision

VidaForge: Open Research Infrastructure for Video Pretraining Data Recipes

Video foundation models increasingly rely on large-scale pretraining data, yet the end-to-end data pipelines behind them remain largely closed and difficult to inspect or reuse. Researchers seeking to understand how video data recipes affect model pretraining often need to build substantial infrastructure before testing even a focused hypothesis. We present VIDAFORGE, an open research infrastructure that represents a video data recipe as an executable five-stage workflow from raw videos to training datasets. A decision in this workflow can be varied to construct alternative datasets while preserving how every sample was produced. To demon strate this research workflow, we compare data recipes with different coverage and quality in early from-scratch pretraining of Wan 2.1 and V-JEPA 2.1. Across both learning objectives, the broader-coverage recipe achieves the highest downstream benchmark scores, while loss-based evaluation favors different recipes. This study demonstrates how VidaForge connects data-recipe choices to downstream model performance. We further release VIDAFORGE-3M, containing 3.14 million scene level clips totaling 6,475 hours, with fine-grained annotations and curation signals for video data-recipe research.
Read the full abstract

All authors Yan Ma, Jiadi Su, Zhulin Hu, Ethan Chern, Linhao Zhang, Tiantian Mi, Pengfei Liu

Machine Learning

SwiftExplorer: Training-free Diffusion Model Alignment with Swift Diversity Exploration

Diffusion models have general generative abilities but struggle to align with specific objectives. Fine-tuning can improve alignment, yet its training cost is often prohibitive. This led to training-free methods that apply objective-guided terms in sampling to bias the generation distribution toward designated regions, e.g., high-reward areas. However, these methods face two issues: (1) the strong directional bias narrows the pretrained distribution and generation diversity, and (2) indiscriminate constant guidance fails to prune redundant signals, hurting both quality and efficiency. To address the above challenges, we propose SwiftExplorer, a plugin that mitigates distribution collapse caused by excessive diversity loss and reduces compute costs. First, we adopt an Inheritance-Restart exploration mechanism to avoid early convergence, while exploration also increases the likelihood of high-reward trajectories. Additionally, it balances diversity and fidelity, adding diversity without causing a distribution over-shift. Second, our Quality-Efficiency arbitration mechanism improves guidance by removing incorrect signals, and it reduces computation by dynamically stopping generation when completeness and marginal reward gain are optimal. In an extensive number of experiments and different types of evaluation metrics, the proposed SwiftExplorer achieves excellent performance on all metrics, including preference, fidelity, diversity, and richness.
Read the full abstract

All authors Renye Yan, Jikang Cheng, You Wu, Bojin Huang, Wei Peng, Zongwei Wang, Ling Liang, Yimao Cai

Group Theory

Virtually generating graphs of pro-$p$ groups

We study the virtually generating graph of pro-$p$ groups. We show that various classes of pro-$p$ groups have connected virtually generating graph and we bound its diameter in these cases; e.g.\ compact subgroups of analytic groups over local fields and the Nottingham group.
Read the full abstract

All authors Yiftach Barnea, Andrea Lucchini, Margherita Piccolo, Matteo Vannacci

Machine Learning

Inducing Emergent Misalignment from Reward Hacks with Iterative DPO

Reward hacking during reinforcement learning from verifiable rewards (RLVR) can induce reward seeking and broad misalignment in language models. Studying this misgeneralization is important for developing better threat models and countermeasures, but is often infeasible due to the cost of RL on large models. As an alternative, we propose studying emergent misalignment from iterative DPO, which preserves important properties of RLVR while reducing costs and enabling training on popular finetuning APIs. In practice, we find that training GPT-4.1 with iterative DPO on a single-turn reward hacking environment induces covert misaligned power-seeking and alignment faking, the first openly available (semi)-online training pipeline to induce these concerning forms of misalignment. We also find that training Qwen2.5-32B-Instruct with the same pipeline induces both misalignment and improved instruction following accuracy, showing that iterative DPO can be used as a testbed for selective generalization. Overall, we think iterative DPO can help democratize and accelerate the study of emergent misalignment from RLVR.
Read the full abstract

All authors Oliver Daniels, Perusha Moodley, Benjamin M. Marlin, David Lindner

General Relativity and Quantum Cosmology

Shadows and Thin-Disk Images of Kerr-Newman Black Holes in a Bertotti-Robinson Magnetic Field

In this paper, we investigate the optical properties of Kerr-Newman-Bertotti-Robinson (KN-BR) black holes. We use the separability of null geodesics to analyze unstable spherical photon orbits and determine the radial extent of the photon shell. Because the spacetime is not asymptotically flat, we construct the critical curve on the screen of a finite-distance zero-angular-momentum observer. We then perform backward ray tracing for a geometrically thin and optically thin disk that extends from the outer region to the event horizon, and examine the resulting images, intensity profiles, critical-curve areas, and inner-shadow areas. We find that the genuine neutral Kerr-BR$_0$ and specially charged Kerr-BR$_s$ configurations have nearly identical optical appearances. It is remarkable that for the KN-BR black holes increasing the electric charge reduces the characteristic image size in the Kerr-Newman limit but enlarges it in the magnetized configurations considered here. We also find that the external magnetic field strongly increases the apparent image scale, while the observer inclination affects the inner-shadow area more significantly than the critical-curve area. These results may provide useful theoretical insight for future observations aimed at identifying such exotic magnetized black holes.
Read the full abstract

All authors Xi Wan, Haiyu Wang, Zhenyu Zhang, Zelin Zhang, Bin Chen

Artificial Intelligence

SerenAI: State-transition system inspired by text-based world AI models

Although professional workflows leverage large language models widely, the interpretation for auditing unconstrained free-text generation is usually intractable if such generation demands legal, operational or financial workflow. We hereby demonstrate a text based system called SerenAI - inspired by world-models, it is a state transition system that outputs verifiable predictions rather than merely text: Provided with a description of the environment, state, and actions, the generated output contains 4 items: causal deltas that causally effect the given state, a next state that can logically follow from the given state and action, a validity reward, and a termination signal. For the released proto-model, we employ 2 steps of adaptation training, namely parameter efficient fine-tuning followed by verifier based RL over 50,000 exampled cause and effects in 12 environments spanning 10 reasoning domains. Compared to an initial internal evaluation of an 8B open-weight baseline, SerenAI increased JSON validity from 85.0% to 93.2%, schema validity from 55.0% to 84.0%, exact structured-output match from 0.0% to 41.5%, causal-delta exact match from 0.0% to 41.5%, resulting-state exact match from 0.0% to 42.0%, reward exact match from 1.0% to 80.5%, and termination exact match from 38.0% to 81.5%. These support the narrower claim that verifier-compatible adaptation can improve structured transition prediction. They do not yet establish legal-grade reliability. Accordingly, the paper also specifies a validation protocol for evidence-grounded legal workflows, calibration, human oversight, and sovereign on-premise deployment.
Read the full abstract

All authors Elvin Babayev, Artem Sinitsa, Arash Hajisharifi, Kabir Bakhshaei

Computer Vision

When Does a Laugh Begin? Structured Annotator Disagreement in Temporal Laughter Localization

Annotators routinely disagree on laughter boundaries and subtle chuckles, yet temporal laughter localization typically evaluates against a single reference annotation. We show that this disagreement is structured rather than random noise. Re-annotating the SMILE-Temporal benchmark (672 videos, 1,683 events) with 3-5 annotators per video (alpha = 0.757), we find systematic patterns: disagreement is 1.73 times larger at offsets than onsets, far more common for chuckles than full laughs (77% vs. 20%), and predictable from event attributes (AUC = 0.831). Evaluating against a single annotator breaks down under this structure: system scores shift by 0.246 F1 depending on the chosen ground truth, correctly ranking systems only 69.7% of the time (vs. 80% against all annotators). We propose a disagreement-calibrated evaluation that scores predictions against the full annotator distribution using conformally calibrated tolerance bands (wider at offsets, 0.727s, than onsets, 0.5s). The per-annotator annotations and analysis code are available at https://github.com/WSCSports/MTLLFM-temporal-laughter-localization.
Read the full abstract

All authors Eyal Hanania, Daniel Arkushin, Naveh Ayal, Jonathan Benvenisti, Amos Bercovich, Elie Zemmour, Sahar Froim

Computer Vision

MARR: Decoupling Policy, Execution, and Calibration for All-in-One Medical Image Restoration

All-in-one medical image restoration seeks to recover heterogeneous clinical images with a single model, but PET, CT, and MRI differ substantially in degradation statistics, anatomical contrast, and output-space bias. A fully shared network can entangle modality-specific residual errors, whereas separate modality-specific networks sacrifice the practical advantages of unified deployment. We therefore recast all-in-one restoration as a question of where limited adaptation should be placed: policy selection, feature execution, or output calibration. We propose MARR, a compact restoration framework that constrains multi-modality adaptation into degradation-aware policy routing, modality-private residual execution, and image-domain residual correction without requiring degradation labels or separate modality-specific models. The policy branch forms a routing prompt from input statistics, latent content, and modality identity, and uses it only as a control signal. Prompt-gated modality-private adapters then perform lightweight residual refinement at intermediate decoder stages, while zero-initialized modality-specific output heads calibrate the final image-domain residual without perturbing the initial shared prediction. On an all-in-one PET, CT, and MRI restoration benchmark, MARR outperforms thirteen methods re-trained under the same protocol, achieving PSNR values of 37.34 dB, 33.85 dB, and 32.09 dB on PET, CT, and MRI, respectively, and the best modality-average PSNR of 34.43 dB. The code is publicly available at https://github.com/CHB-learner/MARR.
Read the full abstract

All authors Haobin Chen, Ao Chang, Heqin Zhu, Rundong Wang, Ting Liu, Shaohua Kevin Zhou

Algebraic Geometry

Kobayashi Hyperbolicity of General Surfaces via the Poincaré Problem

We prove that a general surface in $\mathbb{P}^3$ of degree at least $18$ contains no rational or elliptic curves, strengthening the classical result of Clemens by replacing the original very general assumption by a genuine Zariski-open condition. Previously, nonexistence results in the “general” setting were known only in much higher degrees. Combining this with established algebraic degeneracy results for entire curves, we deduce the Kobayashi hyperbolicity of a general surface in $\mathbb{P}^3$ of degree at least $18$, thereby resolving a question asked by Demailly–El Goul. Our proof uses foliations induced by $2$-jet differentials. Two independent such differentials give rise to a multi-foliation tangent to all rational and elliptic curves. We establish a Poincaré-type bound for its algebraic leaves, yielding a mechanism to upgrade very general statements to general ones. Our method also applies to complements of plane curves. In particular, we prove that the complement of two general cubic curves in $\mathbb{P}^2$ is hyperbolically embedded.
Read the full abstract

Quantum Physics

Entanglement Growth as Transport Across Schmidt Scales

Quantum entanglement growth is commonly summarized by a single entropy, obscuring where correlations reside in the exponentially large Schmidt spectrum and how they form. Here, we introduce Schmidt-scale concentration and dominant Schmidt scale, two coordinates that locate the probability maximum across logarithmic windows in ordered Schmidt-rank space. Applied to quenches of a random-field spin chain, these coordinates distinguish rapid transport of the dominant scale to higher Schmidt rank at weak disorder from strongly suppressed transport despite continued logarithmic entropy growth at strong disorder. The disorder-averaged dynamics exhibit an ordered hierarchy: entropy production peaks first, spectral roughness and exact nonlocal magic peak next, and dominant-Schmidt-scale transport becomes typical only after a substantial delay. Moreover, a solvable head–tail model and controlled numerical experiments reveal the physical origin of this hierarchy: the spectral path determines the order of events, local dynamics on active exchange bonds set their early timing, and intra-subsystem many-body dressing further delays dominant-Schmidt-scale transport. These results establish the Schmidt-scale coordinates as powerful dynamical probes for uncovering fine-grained entanglement structures distinguishing entanglement production, entanglement-spectrum reorganization, and dominant-Schmidt-scale transport beyond entropy alone.
Read the full abstract

Probability

Recurrence, Transience, and the Rate of Escape for Elephant Random Walks with Two Memory Channels

We study the one-dimensional elephant random walk with two memory channels introduced by Saha [Phys.\ Rev.\ E 106, L062105 (2022)] with memory parameter $p\in(0,1)$. Maulik, Roy and Sadhukhan [arXiv:2509.10225] proved recurrence for $p\le11/16$ and transience for $p>7/8$, leaving the range $11/16<p\le7/8$ open. We close this gap by proving that $p=11/16$ is the exact recurrence–transience threshold and by determining how fast the walk escapes from the origin throughout the transient regime. For $11/16<p<7/8$, we also show that the scaling limit obtained by Maulik, Roy and Sadhukhan is almost surely nonzero. At $p=7/8$, we prove that the walk is transient with zero asymptotic velocity and escapes at the scale $n/\sqrt{\log n}$.
Read the full abstract

High Energy Physics (Phenomenology)

A Common $\sim$55 GeV Inelastic Dark Matter Origin of the LZ, Fermi-LAT, and AMS-02 Excesses and Paleo-Detector Prospects

We investigate the 248~keV nuclear recoil excess reported by LUX-ZEPLIN (LZ) in a leptophobic inelastic dark matter framework, in which the mass splitting naturally suppresses low-energy recoils. We find two viable branches, including the endothermic solution with a high dark matter mass $m_\chi \gtrsim400$~GeV and the exothermic one with a mass of tens GeV. Remarkably, the exothermic dark matter scenario with $m_\chi\sim55$~GeV can simultaneously account for the LZ excess, the Galactic Center GeV gamma-ray excess, and the AMS-02 antiproton excess. The favored annihilation cross-section is slightly below the one required for the observed relic abundance, resulting in an overabundant relic in the minimal setup. An additional neutrino-portal mediator can provide the required depletion while leaving the gamma-ray and antiproton signals essentially unchanged. We further show that paleo-detectors provide a powerful probe of the inelastic interpretation, requiring exposures of $\sim10$ and $\sim100$~mg Gyr for the endothermic and exothermic scenarios, respectively.
Read the full abstract

All authors Meiwen Yang, Quan-feng Wu, Kai-Kai Duan, Zi-Qing Xia, Yue-Lin Sming Tsai, Yi-Zhong Fan

Information Theory

Constrained Capacity for Faster-than-Nyquist Signaling in Frequency-Selective Fading Channels

In this paper, we investigate the constrained capacity of discrete Fourier transform (DFT)-precoded faster-than-Nyquist (FTN) signaling over frequency-selective channels with finite-alphabet inputs. With a cyclic prefix (CP) and cyclic suffix (CS), the FTN and multipath induced intersymbol interference (ISI) is decomposed into parallel eigenchannels, whose gains are jointly determined by the folded FTN spectrum and the channel frequency response. Based on this decomposition, we derive the constrained capacity for finite-alphabet constellations and formulate a mismatched decoding achievable information rate for DFT-precoded FTN signaling without CP/CS, quantifying the finite-block rate loss caused by imperfect diagonalization. We find that even under mismatched decoding, FTN significantly improves upon Nyquist transmission.
Read the full abstract

All authors Zichao Zhang, Melda Yuksel, Gokhan M. Guvensen, Halim Yanikomeroglu

Nuclear Theory

Reentrance of proton-neutron pairing in hot nuclear systems

We develop a generalized finite-temperature proton-neutron BCS framework using the superoperator formalism, incorporating both isovector and isoscalar monopole pairing channels. Numerical calculations for a schematic equidistant multilevel model and realistic even-even Ge isotopes demonstrate the emergence of proton-neutron ($pn$) pairing reentrance in even-even asymmetric ($N>Z$) nuclei with preexisting like-nucleon pairing correlations. This nonmonotonic behavior arises from thermal excitations that partially lift Pauli blocking of single-particle orbitals near the chemical potentials, thereby enlarging the phase space for $pn$ pair formation. We uncover a delicate interplay between thermal unblocking and like-nucleon pairing, which can either suppress or enhance $pn$ correlations depending on temperature and shell filling. A qualitative analysis of Fermi charge-exchange strength functions in hot $^{72}$Ge, which neglects the residual interaction between thermal quasiparticles, suggests that $pn$ pairing reentrance may alter the transition strength distribution around $T\approx1$~MeV. This indicates that finite-temperature $pn$ correlations could potentially impact stellar weak-interaction rates in $rp$-process and supernova environments.
Read the full abstract

All authors T. Vu Dong, Alan A. Dzhioev, A. I. Vdovin, N. Quang Hung

Statistics Theory

Global minimax risk and acquisition laws for heterogeneous information fusion

We prove an all-allocation global target-risk theorem for independent Gaussian sources that share a scalar nuisance and an unknown contact coordinate. For a fixed immersed nuisance curve with finitely many multiple fibres and pairwise nonparallel branch tangents, squared target risk is comparable to a primary estimation floor plus a target-gap-weighted Gaussian discrimination profile. Independent localization, finite branch selection and target-class refitting give an estimator attaining this comparison across every nonnegative integer allocation. A full-box specialization has positive-definite primary Fisher information everywhere and globally identifies its target, yet models with identical derivatives of every order along a critical hypersurface have different polynomial risk exponents. We construct a finite certified estimator and quantify the numerical accuracy needed to preserve rare branch decisions and acquisition windows. A polynomial tangency family both demonstrates the geometric boundary and quantifies its repair: known auxiliary gain, source contact order and target vanishing order determine a risk law uniform through zero gain. For a shared spherical direction, a separately proved composite-testing result transfers through an unknown contact coordinate using only counted observations. These theorems distinguish the resources needed for local estimation, discrimination between parameter regions and nuisance alignment, and yield acquisition thresholds under explicit scalar-observation costs.
Read the full abstract

Systems and Control

TD-STGT: A Spatio-Temporal Graph Transformer for Mobile Traffic Demand Forecasting

Fine-grained mobile traffic demand forecasting is essential for long-term planning of 5G and future 6G networks, including radio upgrades, site densification, backhaul expansion, and spectrum activation. This paper proposes the Traffic Demand Spatio-Temporal Graph Transformer (TD-STGT), a graph neural forecasting framework for predicting changes in wireless mobile traffic demand across fine geographic grids. The framework uses a population-scaled demand proxy developed from crowdsourced mobile measurements and daytime population information. Experiments across five Canadian metropolitan regions show that TD-STGT achieves the best performance in forecasting grid-level demand changes, reaching a $\Delta R^2$ of 0.462 and reducing $\Delta$RMSE by 5.7% relative to the strongest baseline. The proposed model provides a practical tool for identifying areas with increasing demand pressure and prioritizing future mobile-network capacity upgrades.
Read the full abstract

Performance

From JPEG to CUDA Batch: Measuring RGB Input Pipeline Throughput

We measure how many ready batches per second eight image input pipelines deliver to an NVIDIA L4. Each pipeline starts with RGB JPEG files and delivers synchronized CUDA float16 batches of 256 images. The benchmark contains 1314 measurements across 73 recipes. On the 34 recipes shared by all eight paths, DALI delivered a median of 19.7 batches/s and AlbumentationsX (AX) delivered 17.1. DALI was fastest on 34 of those recipes. Median peak process GPU memory was 1,872 MiB for DALI and 404 MiB for AX.
Read the full abstract

Computation and Language

Mind the Gap: Exposing LLM Translation Blind Spots Using the AlphaMWE Multilingual Parallel Corpus

LLMs' performance on machine translation (MT) tasks is often dependent on the data availability in the specific domains and language pairs that they are trained upon. To examine if Multiword Expressions (MWEs) still set a bottleneck for LLMs regarding language understanding and translation, we report the system performances from the WMT2026 Test Suites shared task, for which we used the publicly available multilingual parallel corpus AlphaMWE as the test suites. We received 31 MT systems' outputs covering English to Chinese (zh), Polish (pl), German (de), Arabic (ar) including Modern Standard Arabic (MSA) and two dialectal ones (Egyptian and Tunisian Arabic). We carried out automatic evaluations using BLEU, ChrF, BERT-score to select the Top3 systems per language pair, followed up with human evaluations on the selected systems. Our findings show that: figurative/MWE phenomena remain challenging; automatic metrics sometimes disagree; human evaluation uncovers language-specific errors hidden by aggregate scores; human evaluation re-ranks the top-3 systems.
Read the full abstract

All authors Lifeng Han, Jiahui Liang, Anna Latusek, Karim El Haff, Amal Haddad Haddad, Josua Höfgen, Kilian Evang, Min Ma, Maryia Zhyrko

Computational Complexity

Convex optimization on moment polytopes: Hadamard mirror descent and efficient algorithms for quantum functionals and other tensor parameters

Convex optimization on polytopes arises in many areas of science. When the polytope is given implicitly or has exponentially many vertices and facets, standard methods may not apply or be ineffective. This is the case for moment polytopes, such as the entanglement polytopes, which play a foundational role in quantum information and algebraic complexity. They give rise to important entanglement measures and tensor parameters such as the quantum functionals, yet general effective methods for computing these quantities have been elusive. In this paper we address this challenge. We develop a first-order framework called Hadamard mirror descent to optimize suitable convex functions over moment polytopes and, more generally, the gradient sets of geodesically convex functions. It operates locally and does not rely on any explicit description of the polytope. Our framework extends mirror descent, an effective and widely used framework for convex optimization, from the Euclidean setting to Hadamard manifolds, and is motivated by a recent work by Hirai, which we interpret as a Hadamard version of mirror flow. Applying the framework to entanglement polytopes yields the first efficient first-order algorithms to compute the quantum functionals, the symmetric quantum functional, and the G-stable ranks, as well as a new direct algorithm for the non-commutative rank.
Read the full abstract

Quantum Physics

Anomaly fluctuation theorem for quantum coherence dynamics

Quantum coherence is a central resource in quantum information science, yet general frameworks and constraints governing its dynamics remain limited. Although quantum coherence lacks a general monotonicity law, we establish an exact integral fluctuation theorem (FT) for coherence dynamics, formulated in terms of Kirkwood-Dirac (KD) quasiprobability trajectories and valid for arbitrary initial states and dynamics. This integral FT deviates from the standard unit-valued form, and the complex deviation, termed the anomaly, quantifies a weighted overlap between the residual final-state coherence and the coherence generated from the dephased input. The real part of the anomaly yields bounds on coherence change, while its imaginary part constrains the second-order moment of the stochastic coherence change weighted by the imaginary parts of the KD quasiprobabilities. Our results establish general statistical constraints on coherence dynamics, demonstrating the utility and broad applicability of FTs for studying quantum-resource dynamics.
Read the full abstract

All authors Kun Zhang, Hai-Long Shi, Xiao-Hui Wang, Wen-Li Yang

High Energy Astrophysical Phenomena

Possible Sources of Iron Nuclei in Ultra-High-Energy Cosmic Rays

The origin of a cosmic ray particle with an ultra-high energy of 2.44 x 10^20 eV recorded by the Telescope Array is discussed by assuming that it is a heavy nucleus, namely an iron or silicon nucleus. Iron is chosen as a heaviest element in cosmic rays, while silicon is chosen to find out how much the theoretical results obtained vary with the mass of the heavy nucleus. Assuming extragalactic origin of the particle with such energy, the constraints on the distances to possible sources are analysed using a routine calculation of the cosmic ray propagation in extragalactic space. These possible sources are discussed.
Read the full abstract

Optics

A tunable chiral light-matter interface with on-chip spin control

The ability to engineer chiral light-matter interactions is a valuable resource for realizing quantum networks and non-reciprocal quantum optics. Here, we demonstrate chiral coupling between light and a negatively charged exciton state, i.e., a four-level system, embedded in a standard photonic-crystal waveguide. By controlling the orientation and strength of an external magnetic field, we tune the polarization of the individual optical transition dipoles relative to the fixed elliptically polarized waveguide mode. In a two-sided waveguide, an optimized oblique magnetic field allows a selected transition to decay exclusively into a single propagation direction, enabling near-unity directional emission ($0.99^{+0.01}_{-0.02}$), despite the waveguide exhibiting imperfect polarization for chiral coupling. We further observe two tunable chiral branching ratios, the directional analogue of optical cyclicity, for two $\Lambda$-systems, with one reaching $134_{-77}^{+\infty}$. The magnetic-field-dependent spectroscopy also allows reconstruction of the local guided-mode polarization at the emitter via the Stokes parameters relative to the emitter's dipole moments. Finally, we demonstrate that this local chirality enables coherent control of an electron spin via an optical Raman process mediated by waveguide driving. Building on the simultaneous realization of a large branching ratio, directionality and spin control achieved at the same oblique magnetic-field angle, we propose a protocol with high tolerance to photon loss for generating high-fidelity remote spin-spin entanglement. Our magnetic control opens a reconfigurable and generic route for enhancing on-chip chiral spin-photon coupling in standard nanophotonic interfaces without the need to carefully engineer the polarization of the waveguide.
Read the full abstract

All authors Shikai Liu, Joan Alba, Bálint Sárközi, Nikolai Bart, Arne Ludwig, Ming Lai Chan, Peter Lodahl, Anders S. Sørensen

Computer Vision

Physico-Geospatial Grounded Scene Interpretation for Mobile Robotics

Recent advancements in deep learning allow robotic agents to interact with dynamic and unstructured environments. Of special interest is the integration of physico-geospatial world knowledge into such systems, either by using physics-aware machine learning models, knowledge graphs to model relationships or spatio-temporal and logical reasoning. In the present work, we introduce an approach to augment the output of pre-trained, unmodified VLMs used for scene interpretation by integrating semantic descriptions, OpenStreetMap building data and street information with positional, temporal and metric information obtained from our sensory systems, fusing this information using LLMs. We apply this concept to an outdoor recording within a university campus, achieving an F1-Score of 0.83 in the task of grounding buildings and 0.64 for path surface grounding on our pilot evaluation set. The results demonstrate the conceptual capability of the proposed solution to deliver physico-geospatial grounded natural language descriptions. Code and results are available at https://datahub.rz.rptu.de/hstr-csrl-public/publications/physico-geospatial-grounded-scene-interpretation
Read the full abstract

All authors Nicolas Schuler, Janik Kurtz, Lea Dewald, Marcel Sauber, Félicia Teferle, Jürgen Graf

Computer Vision

GeoCo-SAVi: Geometry-Consistent Slot Attention for Explicitly Editable Object Representations

Object-centric video models represent scenes with slots, yet exposed geometry can vary in meaning with appearance. In Invariant Slot Attention (ISA), explicit position and scale can disagree with the decoded center and extent; edits can yield unexpected motion or resizing, and replacing appearance can shift geometry. GeoCo-SAVi promotes geometric authority and semantic alignment. Its spatially equivariant, object-wise decoder makes position and scale effective commands: changing them moves or resizes the rendered support. Factual position alignment ties position to the decoded center, and normalized attention overlap discourages duplicate allocation. Appearance transplantation aligns geometry semantics across objects, so recipient geometry governs layout while donor appearance supplies shape. On Obj3D, GeoCo-SAVi matches ISA reconstruction, reduces latent-position-to-decoded-centroid error by nearly 90%, and reduces appearance-induced size variation while producing the expected translation and scale responses. On 250 MOVi-C videos, it improves reconstruction and instance grouping over both same-protocol references, and video editing over STAITUS. GeoCo-SAVi transforms explicit geometry into compositional control, making both position and scale more readable and editable. Project page: https://GeoCo-SAVi.github.io/.
Read the full abstract

All authors Haoxiang Huang, Zhekai Wang, Xiang Liu, Shuwei Wang, Yiwen Sun, Zhiwei Yu, Jingheng Ma, Sen Cui, Changshui Zhang

Materials Science

First-principles-based Prediction of Phase Fields: Part I. Binary and Ternary Refractory Alloys

Multiple principal element alloys (MPEAs) exhibit complex phase equilibria involving multinary solid solutions and intermetallics, which makes it challenging to predict their temperature-composition phase diagrams. Their vast compositional space makes first principles methods prohibitively expensive, while CALPHAD is limited by scarce experimental data. Here, we present a computationally efficient framework to predict the solvus phase boundaries, and hence, phase fields, in refractory MPEAs composed of Cr, Hf, Mo, Nb, Ta, Ti, V, W, and Zr. The approach combines DFT calculated binary mixing enthalpies with sub regular solution models to construct phase diagrams without fitting higher order interactions, enabling efficient scaling across composition space. Validation against 36 binary and 15 ternary phase diagrams demonstrates good agreement, with both experimental results and CALPHAD calculations. We find that the prediction accuracy is enhanced by incorporating lattice dependent energetics through sub regular solution models and including temperature-dependent elemental phase transitions. The framework captures miscibility gaps, solid solution stability, and intermetallic formation, with predicted miscible temperatures typically within 300 K of experimental values. Overall, this work establishes a scalable, first principles based route for highthroughput prediction of phase diagrams in refractory MPEAs. A publicly accessible web interface has also been developed to allow interactive exploration of the predicted phase diagrams, available at https://raptor.engr.wustl.edu.
Read the full abstract

All authors Pravan Omprakash, Nicholas Crnkovich, John Cavin, Nathan Curtis, Adrien Couet, Rohan Mishra

Atomic Physics

Roadmap on Quantum Sensors for Vacuum Metrology

We describe how laser-cooled and trapped alkali-metal atoms have been used as pressure sensors in the high- and ultra-high-vacuum regimes operating with relative uncertainties of just over a percent at pressures from a few nPa and up to a few tens of $\mu$Pa. These sensors can serve as primary standards of pressure as the determination of pressure requires only knowledge of collision cross sections between atoms and molecules, eliminating the need for calibration with other devices. The collision cross sections can be measured independently or computed with rigorous quantum methods at percent relative accuracies. We argue that this technology has advanced sufficiently to provide an alternative to the existing, expensive pressure standard in the ultra-high vacuum regime, the orifice flow standard. Experiments with trapped atoms can be used to calibrate cheaper pressure sensors (such as devices based on ionization gauges). However, the technology has not yet matured enough to be of use in other research fields because of the complexity and cost of the experiments. We propose a roadmap for this new pressure standard for vacuum metrology.
Read the full abstract

All authors D.S. Barker, J.L. Booth, S.P. Eckel, J. Grosse, K. Jousten, J. Kłos, R.V. Krems, K.W. Madison, T. Rubin, E. Tiesinga

Algebraic Geometry

Singular supports, characteristic cycles, and microlocalization of constructible sheaves

For a constructible sheaf $\mathcal{F}$ on a smooth scheme $X$ over a perfect field, the singular support $SS(\mathcal{F})$ and the characteristic cycle $CC(\mathcal{F})$ are defined on the cotangent bundle. In analogy with the construction of Kashiwara–Schapira via microlocalization in the transcendental setting, we construct the microlocal versions ${ SS}_\mu(\mathcal{F})$ and $CC_\mu(\mathcal{F})$ of $SS(\mathcal{F})$ and $CC(\mathcal{F})$ respectively, and prove \[ SS_\mu(\mathcal{F})= SS(\mathcal{F}),\qquad CC_\mu(\mathcal{F})= {\rm cl}CC(\mathcal{F}), \] where $\operatorname{cl}$ is the cycle class map. As a consequence of the second equality, we show that the cohomological characteristic classes are the cycle classes associated with the corresponding characteristic cycles, as conjectured in (Invent.~Math.~207: 597–695, 2017). As further applications, we give new proofs of the index formula and Bloch's conductor formula in the proper case, independently of Abe's homotopical approach via $\infty$-categories.
Read the full abstract