Other Condensed Matter
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 9 September
Thermally generated magnons enable heat-driven spin transport in magnetic insulators, yet the relative importance of multiple microscopic mechanisms governing their propagation remains incompletely understood. Here, we investigate thermal magnon transport in low-damping Li$_{0.5}$Al$_{1.0}$Fe$_{1.5}$O$_4$/Pt nanodevices using a nonlocal spin Seebeck geometry that separates magnon transport from local thermoelectric effects. Thermal imaging establishes a detector region outside the thermal healing length, enabling intrinsic nonlocal measurements. We find that thermal magnon transport is strongly suppressed by magnetic fields far above saturation, and further that thermal magnon transport decreases with increasing temperature despite an increasing magnon population. Brillouin light scattering reveals the key microscopic mechanism driving this effect: increasing field reduces the group velocity of backward volume magnons, directly reducing the magnon spin diffusion length. Micromagnetic simulations reproduce this behavior only when a temperature-dependent exchange stiffness is included. These results identify magnon group velocity and exchange stiffness as key parameters governing thermal magnon transport in ferrimagnetic thin films.
General Economics
Reducing Prescription Errors Through Information Intervention: A Field Experiment in Healthcare Operations
Drug-drug interaction (DDI) errors pose serious risks to patient safety. Existing decision-support systems often require physicians to respond to alerts, disrupting workflows and contributing to high override rates. We examine whether a non-mandatory information intervention can reduce DDI errors and foster learning. Using a randomized field experiment with India's largest electronic medical record platform, we analyze 2.81 million prescriptions from 1,700 physicians using a difference-in-differences design. Treatment physicians received real-time information highlighting DDI errors without being required to respond, while control physicians received no such information. The intervention reduced DDI errors by 8.6%, corresponding to an estimated US$4.8 million in annual hospitalization cost savings and approximately 134 lives potentially saved. We identify two mechanisms: reactive correction, whereby physicians remove errors after they are flagged, and proactive learning, whereby they avoid errors before alerts occur. While early reductions are driven primarily by correction, physicians increasingly avoid errors over time. They also become less likely to repeat previously flagged errors and reduce new errors, suggesting that learning generalizes beyond specific drug pairs. The effects are consistent across physician types and do not compromise productivity or care quality. Our findings show that non-mandatory information interventions can improve patient safety through both immediate error correction and persistent, generalizable learning.
Read the full abstract
Computation and Language
SEA-SpeechBench: A Large-Scale Multitask Benchmark for Speech Understanding Across Southeast Asia
The rapid advancement of audio and multimodal large language models has unlocked transformative speech understanding capabilities, yet evaluation frameworks remain predominantly English-centric, leaving Southeast Asian (SEA) languages critically underrepresented. We introduce SEA-SpeechBench, to the best of our knowledge, the first large-scale multitask benchmark that evaluates speech understanding in 11 SEA languages through 97,194 samples across 99 evaluation sets and 597 hours of curated audio data. Our benchmark comprises 9 diverse tasks across 3 categories: speech processing (automatic speech recognition, speech translation, spoken question answering), paralinguistic analysis (emotion, gender, age, speaker recognition), and temporal understanding, a novel dimension featuring timestamped content queries and temporal localization within extended audio sequences up to 3 minutes. We implement multilingual prompting in both native SEA languages and English to reflect user interactions with audio-language models. Evaluation of leading open-source and proprietary systems reveals marked performance gaps. Across all models, performance remains underwhelming on temporal understanding, emotion recognition, and speech translation. Prompting in low-resource languages such as Burmese and Tamil lags behind English by up to 41 percentage points. Our findings expose critical model limitations and underscore the need for inclusive model development. The SEA-SpeechBench benchmark is available at https://zwenyu.github.io/SEA-SpeechBench/.
Read the full abstract
Software Engineering
Introducing Consort: A Spec-First Agent Framework for Enforced, Test-Driven Development on Live Database Branches
When an agent writes code, the development framework becomes the control system for a non-deterministic worker. Spec-first, agent-driven frameworks have gained rapid traction since 2025; the installable ones, GitHub Spec Kit, obra/superpowers, BMAD, and GSD, and our own, all capture intent through a specification or durable planning artifacts. Since they agree on capturing intent up front, what separates them is how each enforces the engineering discipline that keeps agent-written code clean, correct, and maintainable. Every framework enforces that discipline somehow; they differ in how. We characterize three modes: enforcement by persuasion (prompt discipline the model may ignore), by front-loaded structure (strong specs, then a trusted build), and through controls the agent cannot edit (a deterministic orchestrator, human-approved gates, immutable tests, and a green result that must pass against a live, branched database). We introduce Consort, a spec-first, test-driven agent framework built on the third, enforcing that discipline through controls the agent runs inside but cannot bypass, in which a deterministic orchestrator drives separate role agents through a spec-first design lane and a test-driven build lane on a live database branch. We argue that enforcing the tests and gates in code keeps agent-written code honest and verifiable, while its specialized roles, like the human roles before them, are what make it maintainable, claims we frame as a pre-registered, testable hypothesis.
Read the full abstract
Computer Vision
Recovering Biomechanical Signals from Missing Keypoints Using Temporal Interpolation in Monocular Gait Analysis
Monocular pose estimation enables low-cost gait analysis but is sensitive to missing keypoints caused by occlusion, detection errors, or efficiency-driven model reduction. While prior work on recovering missing joints focuses on complex learned models, the effectiveness of simple temporal methods remains underexplored. We evaluate knee-angle estimation under a missing-ankle-keypoint condition and test a first-order temporal interpolation scheme as a recovery mechanism. Across 527 frames of monocular walking video (428 with valid baseline detections), removing the ankle keypoint increased mean angular error to 23.4{\deg} +/- 46.7{\deg} and collapsed signal variance to near zero. Temporal interpolation reduced error to 1.1{\deg} +/- 6.7{\deg} and restored variance and smoothness to within a few percent of baseline. These results indicate that gait signals possess sufficient temporal redundancy for a simple, computationally trivial interpolation scheme to recover a critical missing joint, without resorting to learned reconstruction models. The findings support low-complexity, real-time-compatible designs for gait analysis in resource-constrained or occlusion-prone monocular settings.
Read the full abstract
High Energy Physics (Phenomenology)
Next-to-Leading-Order Calculation of the Light Tensor $(J^P=2^+)$ Hybrid Correlation Function
We report on the QCD calculations underlying a next-to-leading-order (NLO) QCD Laplace sum-rule analysis of the light tensor $(J^P = 2^+)$ hybrid meson mass and coupling. This article focuses on the calculation of the NLO perturbative and leading-log NLO non-perturbative contributions. The diagrammatic renormalization method is employed, and a renormalization-group approach is used to determine the leading-log NLO corrections to condensate contributions, including the dimension-six gluon condensate, whose renormalization we extend to $n_f$ quark flavors. The NLO contributions provide a systematically improved theoretical description of the light tensor hybrid correlation function, leading to more reliable determinations of its mass and coupling. The phenomenological implications of our results are discussed separately in these proceedings.
Read the full abstract
Cryptography and Security
Session Attestation for Unmodified TLS Services in Confidential Virtual Machines
Confidential cloud services aim to protect sensitive requests from the infrastructure that executes them. However, running a service inside a trusted execution environment does not ensure that users' plaintext appears only within the protected environment. We formulate Endpoint-Substitution Relay (ESR), a common attack outcome in which an adversary receives plaintext at a client-accepted endpoint while relaying requests to the legitimate service to preserve correct behavior. We present TLSLatch, a transparent session-attestation mechanism for services running in confidential virtual machines. TLSLatch attests the protected origin of the server's ephemeral TLS 1.3 key share and gates outbound traffic until verification succeeds. It requires no changes to applications, TLS libraries, certificates, or application protocols, and adds no extra payload-encryption layer. We implement TLSLatch with a hardware-backed Hygon CSV CVM server and clients on Linux, Windows, and macOS. Across these platforms, TLSLatch reduces completion time for 1KB requests by 56.9%–65.5% compared with nested TNG, and for 64MB requests by 43.8%–82.4% compared with CMaaS using application-key reuse. These results show that transparent session attestation can preserve existing TLS stacks while adding low-overhead endpoint binding to confidential cloud services.
Read the full abstract
Information Theory
Fundamental Limits of Joint Target Detection and Parameter Estimation - Characterizing Mixed-State Sensing Limits via Posterior Entropy Volume
The development of integrated sensing and communication calls for a unified theoretical foundation for sensing. This paper models target-presence patterns and continuous physical parameters as a mixed discrete-continuous state $\Xi$ on a branched reference measure, and treats posterior entropy volume and joint mutual information as two complementary representations of the same limit. Entropy volume carries physical units, can be compared with engineering scales such as resolution cells, and remains meaningful when the number of active targets varies; mutual information is dimensionless, invariant to coordinates and units, and additive through the chain rule. We define entropy number, entropy volume, and mixed entropy volume for discrete, continuous, and mixed states, respectively. The maximum-entropy principle for the uniform distribution on a support of fixed measure explains the measure-theoretic meaning of the exponential entropy scale, while the main limit follows from a mixed asymptotic equipartition property and a posterior probability-volume inequality through conditional typical sets. For asymptotically reliable high-probability sensing regions, the minimum achievable first-order posterior mixed entropy volume equals the prior mixed entropy volume multiplied by $2^{-I(\Xi;Y)}$, where $I(\Xi;Y)=I(V;Y)+I(X_V;Y\mid V)$. Thus, detection and estimation contributions multiply in the volume domain and add in the bit domain, and one sensing bit halves the posterior effective measure. We further prove that posterior-preserving cascades attain the direct-inference limit, while arbitrary intermediate compression incurs the exact information loss $I(\Xi;Y\mid Z)$. Numerical results for a single-target presence-range model illustrate the information composition, posterior entropy-volume contraction, and cascade-interface loss.
Read the full abstract
Systems and Control
Graph-Based Characterization of Vision-Derived Dynamic Modes for Structural Damage Identification
This study presents a graph theoretic framework for characterizing damage-induced changes in the dynamics of a vibrating cantilever beam from non-contact video measurements. Within this approach, dynamics of the beam under healthy and damaged conditions with crack depths of 5, 10, and 13 mm are initially modeled using delay-embedded dynamic mode decomposition (DMD) from vision-based measurements. The resulting mode matrix from DMD is used to construct the adjacency matrix of a graph for this vibrating beam system, and its topological features such as graph connectivity, centrality, two-star statistics, and dyadic configurations are evaluated as damage-sensitive measures. Additionally, different DMD-based spectral and modal measures are evaluated to support the graph theoretic damage assessment. The results show a monotonic reduction in graph connectivity, nodal accessibility, and local organization of the graph with increasing crack depth. A parametric numerical study further validates the decreasing connectivity trend observed experimentally. The results demonstrate that the topological features of the graph derived from the DMD mode matrix provide an interpretable representation of damage-induced changes in the beam dynamics and offer a promising basis for vision-based structural damage identification.
Read the full abstract
Systems and Control
Koopman Spectral Reduced-Order Modeling of Spherical Diffusion in Lithium-Ion Batteries
Physics-based battery models provide internal electrochemical states for estimation and control, but solving the partial differential equations governing solid diffusion can be computationally expensive. This paper therefore develops an analytical Koopman spectral reduced-order model for the single particle model. The Koopman eigenfunctionals and eigenvalues are derived directly from the eigenfunctions of the self-adjoint zero-flux diffusion operator. The zero mode represents the volume average concentration, the nonzero modes describe decaying radial gradients, and projection of the current dependent surface flux yields a linear state-space model that reconstructs the average, surface, and full radial concentrations. Unlike data-driven Koopman models, the proposed formulation requires neither training data nor empirical lifting functions. Compared with a 400 control volume finite volume model (FVM) during a constant 1C discharge, the 80 Koopman mode model achieves negative and positive surface concentration RMSE values of $1.26\times10^{-5}\,\mathrm{mol/m^{3}}$ and $4.10\times10^{-6}\,\mathrm{mol/m^{3}}$, a terminal voltage RMSE of $8.42\times10^{-4}\,\mathrm{V}$. The models with 5 and 80 Koopman modes were approximately 225 and 31 times faster than the FVM model, respectively. These results demonstrate a physically interpretable and computationally efficient representation of battery diffusion dynamics.
Read the full abstract
Artificial Intelligence
PRAGMA: Evaluating Personalized Guidance with Memory Alignment in Lifelong Conversations
Large language models (LLMs) are increasingly deployed as personalized assistants that interact with users over extended periods of time. As conversations grow longer, relying on full interaction histories becomes increasingly inefficient and unreliable: long contexts introduce substantial computational overhead, making it difficult for models to consistently identify and utilize the most relevant information for the current request. These challenges have motivated memory systems that structure and retrieve user-specific information. In realistic interactions, users often seek practical guidance such as recommendations, planning, and decision support. Unlike factual recall tasks, personalized guidance requires models to integrate information across multiple past conversations and reason about changing user preferences and experiences. However, existing conversational memory evaluations mainly focus on retrieval and factual recall. To study this challenge, we introduce PRAGMA, a benchmark for evaluating personalized guidance in long-term conversations. PRGAMA contains curated longitudinal conversation histories, evidence annotations, and guidance scenarios grounded in evolving user contexts and incorrect user assumptions. Experiments across retrieval systems, memory systems, and long-context models reveal that current systems struggle both to recover the appropriate conversational evidence and to effectively use it for personalized guidance. Our results highlight the need for memory architectures that support robust conversational retrieval and memory-grounded reasoning beyond evidence recall.
Read the full abstract
Quantum Physics
Finite Realizations and Effective Memory in Nonlinear Quantum Filtering
Nonlinear dynamics generate non-Gaussian states and operations, but they also make continuously monitored quantum systems difficult to track. A quantum filter performs this task by compressing a noisy measurement record into a set of evolving variables that predict future observables. For Gaussian dynamics, this compression is exact and finite. In nonlinear systems, conventional moment equations generally expand without bound, but the failure of one representation does not prove that every finite description is impossible. Here we formulate quantum filtering as a realization problem for general quantum input–output maps. We introduce the linearized observable Hankel operator $K_O$, which maps changes in the past measurement record to changes in a future conditional observable. Any finite-dimensional smooth filter forces $K_O$ to have finite rank, so infinite rank provides a coordinate-independent proof that no exact finite-dimensional filter exists. Applied to single-mode polynomial bosonic systems under continuous quadrature monitoring, this yields a sharp boundary: Gaussian dynamics and the measurement-aligned Conditional Momentum Moment class admit finite realizations, whereas dynamics outside these classes produce infinitely many response directions and admit no finite-dimensional smooth exact filter. Exact impossibility, however, need not imply large practical complexity. The singular values of $K_O$ quantify how many response directions matter at a chosen local accuracy, defining the effective memory of an observable. For the Kerr and Duffing oscillators, these singular values decay rapidly despite infinite exact rank, showing that infinite exact memory can coexist with low finite-accuracy complexity. The framework therefore separates exact realizability from effective complexity in nonlinear quantum filtering.
Read the full abstract
Machine Learning
PELM: Power Efficient On-Device LLM Inference with Speculative Decoding and Dynamic Voltage Frequency Scaling
Deploying Large Language Models (LLMs) directly on mobile platforms at the edge is gaining traction due to a myriad of benefits, such as increased privacy, personalization, and reduced latency. However, LLMs have heavy computational requirements, which are difficult for resource-constrained mobile and edge platforms to fulfill. In addition to limited compute resources, mobile and edge systems often have a compact form factor and lack physical mechanisms to dissipate heat generated from high processor usage rates (e.g., fans) to prevent throttling and reduced processing power, which LLMs can easily cause. To mitigate these effects, prior works have proposed various power governing strategies, such as dynamic voltage and frequency scaling (DVFS), for reducing power and heat generation for heavy computational tasks on mobile platforms. Recently, DVFS methods tailored for mobile LLMs have also been proposed. However, these methods mostly focus on optimizing hardware parameters and processor frequencies, and they fall short under some thermally constrained scenarios. Drawing from recent advances in machine learning, we identify and take advantage of the key insight that not all tokens require full-depth inference to maintain high-quality generation. Motivated by this, we present PELM, a solution that augments traditional DVFS processor frequency tuning with two additional workload-specific knobs: 1) speculative decoding and 2) variable verification depth to expand the optimization space to multiple dimensions for more power efficient on-device LLM inference. In extensive evaluations across hardware platforms and datasets, PELM demonstrates superior performance compared to state-of-the-art power governing methods, with up to 23.1% speedup and 52.4% reduction in energy consumption, while maintaining comparable task performance. The source code is available at https://github.com/imec-nu/PELM.
Read the full abstract
High Energy Astrophysical Phenomena
Searching for Type Ia Supernovae in the Dark Energy Spectroscopic Instrument
With the development of large-scale photometric surveys, an increasing number of supernova candidates are being discovered, leading to a rapidly growing demand for supernova spectra. In addition to equipping photometric surveys with follow-up spectroscopic facilities, archival spectra from large multi-object spectroscopic surveys can be mined to provide spectroscopic classifications for candidates and to find supernovae missed by previous surveys. In this work, we combine Principal Component Analysis (PCA), the Local Outlier Factor (LOF) algorithm, and the supernova classification tool SNID to search for Type Ia supernovae among 1,757,303 galaxy spectra from the Dark Energy Spectroscopic Instrument (DESI) Data Release 1 (DR1). We finally obtain 247 Type Ia supernovae and 17 supernovae of other types. Among these, 202 supernovae lack classification records in the Transient Name Server (TNS) and represent newly identified SNe. These results demonstrate the potential of multi-object spectroscopic surveys to supplement supernova samples, particularly for transients missed by traditional photometric surveys.
Read the full abstract
Applied Physics
Round-the-Clock Sub-Ambient Cooling via Dynamic Sky View Factor Steering
Passive daytime radiative cooling holds significant potential to address sustainability challenges such as the energy-water nexus. However, common static horizontal configurations cannot respond to dynamic changes of environmental conditions such as solar position and cloud coverage, thereby forfeiting the opportunity of optimizing the cooling performance in the 24-h day-night cycle. Here, inspired from the heliotropism of sunflowers, we develop a dynamic sky view factor steering (DSVFS) system. By dynamically steering the emitter to an optimal angle, this system not only relaxes the stringent dual requirement of ultra-high solar reflectivity and infrared emissivity of the radiative emitter, but also maximizes its cooling power round-the clock. Using this DSVFS system, we experimentally demonstrate sub-ambient cooling during a typical hot noon even with a near-blackbody emitter; with a selective emitter, we demonstrate an increase of cooling power by 135% as compared to its static counterpart. Case studies of multiple cities across the world indicate a maximum annual electricity saving of up to 200 kWh/m^2.
Read the full abstract
Machine Learning
Cascading Gradient Inversion via LT-Code Inspired Peeling in Federated Learning
Federated learning shares model updates rather than raw data, yet these updates can be inverted to reconstruct the clients' training data. Analytic reconstruction attacks, which invert a gradient in closed form, degrade as the batch grows: prior single-round attacks recover only about half of a batch of size $100$ even when the attacker fully controls the network parameters, and known upper bounds limit what any such method can recover. We establish a connection between gradient inversion and the theory of erasure-correcting codes, and use it to construct attacks that exceed these bounds. Our attacks recover batches exactly, together with every sample's label, from a single FedSGD round, and certify each recovery without ground-truth data. On eight image and tabular benchmarks they outperform prior single-round attacks by a wide margin. Even a passive attacker who only observes an honestly trained network recovers $94$–$100\%$ of ImageNet batches at sizes up to $128$, more than prior single-round attacks achieve even with active manipulation of the model, and in the active setting more than $90\%$ is recovered at batch sizes of several hundred. These results show that the privacy leakage of federated learning has been underestimated.
Read the full abstract
Social and Information Networks
Link prediction in complex networks via fusing node centrality and local similarity indices: a fair-protocol reassessment and parameter design principles
We reassess a published fusion method under a fair protocol. Local similarity indices are cheap but score every node pair without common neighbors zero, and weighting them by a node centrality product, as proposed for PageRank, is not robust once the protocol is made comparable across indices; on our eight-network panel the reported improvement does not survive that protocol for six of the seven local indices. We study these issues in a unified piecewise framework that modulates the local score multiplicatively by a centrality product when local information suffices and uses a small-dose centrality product as a completion term when it does not. A scale analysis and a reassessment on eight real-world networks (five-fold cross-validation, exhaustive negative samples) trace this to the O(n^-2) scale of the PageRank product, whose modulation factor is then a near-identity map, and to its rank correlation with degree exceeding 0.89; control arms show scale calibration is necessary but not sufficient. The min-max normalized DomiRank product instead has an O(1) range and substantial non-degree content, and a grid search yields unified parameters (omega=5, c=0.1) under which DR-JC/HPI/SO significantly outperform their local baselines already at the dataset level (p=0.027 and 0.035), the remaining four at the fold level only; DR-RA attains an average AUC of 0.9257, above nine of ten comparison methods, whereas degree-only preferential attachment reaches only 0.7736. Mechanism decomposition shows the two mechanisms contribute differently across index families and should be dosed separately, yielding a safety boundary 0 < c <= 0.3, a plateau omega in [0.5, 12] and a near-critical plateau sigma in [0.7, 0.95]. Two negative results bound the claim: under a degree-corrected benchmark the gains over local baselines vanish and reverse in sign, and the AUC gains do not translate into top-L hit rate.
Read the full abstract
Artificial Intelligence
RESCUE-BENCH: Towards Relation-Aware Multi-Party Emotional Support Conversation Systems
Existing emotional support conversation systems mainly focus on one-on-one seeker-supporter interactions and individual emotional states, leaving interpersonal relations in multi-party scenarios underexplored. In this work, we introduce relation-aware emotional support conversation, a new task that evaluates whether LLMs can capture and utilize the evolving dynamics of relationships to offer more effective emotional support. We construct RESCUE (Relation-aware Emotional Support Conversation Understanding and Evaluation Benchmark) from real couple and family interview conversations, containing 191 samples, 7,079 annotated turns, and 1,064.8 minutes of video. Based on rich annotations of socio-emotional and support-related dynamics, RESCUE defines six tasks that evaluate two core capabilities required for relation-aware emotional support: Relational Understanding and Relation-Sensitive Support. Experiments with ten LLMs show that current models perform relatively well on tasks relying on local emotional or intervention cues, but struggle with relation-intensive tasks such as relation pattern prediction, viewpoint prediction, and support strategy prediction. These findings reveal the limitations of current LLMs in modeling interpersonal relations and making relation-sensitive support decisions.
Read the full abstract
Machine Learning (Statistics)
Why Learning Rediscovers the Closed-Form Diagonal Regularizer
Recovering modal amplitudes from a few sensors requires regularization, and the shape of the penalty decides how strongly each mode is shrunk. The best shape depends on the truncation noise that discarded modes add to every measurement, which is unobserved and could be room-specific. We identify a diagonal saturation principle: for a single snapshot, isotropic truncation noise makes the Bayes-optimal Tikhonov shape a closed-form power law Gamma_k proportional to lambda_k^|s|, set by the prior alone and independent of the domain. The off-diagonal anisotropy equals the Herfindahl index H of the discarded-mode power exactly, Weyl's eigenvalue counting law fixes the number of discarded modes and hence H, and Berry's random-wave conjecture enters only through a diagonal term D, which we measure directly. Together they predict an approximately flat loss landscape over the penalty exponent, which leaves a learned diagonal regularizer little to gain from tuning the exponent per room. On simulated acoustic rooms the closed form stays within 5.83% of a per-room power-law oracle across observation windows, and three learned diagonal architectures track its error, the closest within a fraction of a point and none more than 3pp above it, while learning qualitatively different spectra. In the truncation regime no tested method consistently improves on the closed form, including Learned Iterative Ridge, which couples modes across layers. The framework extends to heat diffusion through a known Green's-function correction with no new free parameters.
Read the full abstract
High Energy Astrophysical Phenomena
Pulse Signal Simulation of Pulsars
The present thesis is a work in progress on improving the simulation of integrated pulse profiles of pulsars. Pulsars, highly magnetized rotating neutron stars, serve as precise cosmic clocks useful for studying gravity and the interstellar medium. Although periodic pulses from many pulsars are observed and modeled at differ- ent radio frequencies, a robust realistic simulation of their profiles utilizing their parameters remain underdeveloped. The present study focuses on developing a physically consistent model to reproduce observed pulse shapes across multiple frequencies. This study will be useful in coherently understanding the various as- pects of the pulsar emission mechanism. These integrated pulse profiles are the time-averaged properties of pulsar emission and are obtained after averaging indi- vidual pulses over a few thousand rotations. Observed to be highly stable, these are indicative of the global properties of the pulsar magnetosphere. By refining simulation techniques and incorporating the propagation effects of the interstellar medium, this work will prove to be helpful in generating synthetic, yet realistic models. The results are expected to contribute to the interpretation of observa- tional data and to the development of improved timing and emission models for pulsars
Read the full abstract
Quantum Physics
Perfect State Transfer from a Localised Two-Excitation State to a Dicke State via Static Spin-Network Hamiltonians
I construct a family of time-independent, excitation-preserving spin Hamiltonians realising perfect state transfer from a localised two-excitation state to the symmetric two-excitation Dicke state, for every $N\ge4$. The Hamiltonian has the physical form $H=\sum_{i<j}J_{ij}(\sigma_i^+\sigma_j^-+\sigma_j^+\sigma_i^-)+\sum_i\epsilon_i n_i$ with real couplings, and satisfies $e^{-iHt}|110\cdots0\rangle=e^{i\phi}|D_N^{(2)}\rangle$ at a finite time. An $S_{N-2}$ permutation symmetry on the unoccupied spins reduces the dynamics to a four-dimensional invariant subspace. Requiring $(|\psi_0\rangle+|D_N^{(2)}\rangle)/2$ to be a zero eigenvector fixes the on-site energies in closed form and leaves three coupling parameters free. The inverse spectral problem then becomes two polynomial equations in two coupling ratios; eliminating one gives a degree-six reciprocal polynomial, which $z=x+x^{-1}$ converts to a cubic. For the spectral family $(-n,-1,1)$ with odd $n$, factorising the cubic's leading coefficient and evaluating it at $z=-2$ shows that some odd $n$ always produces a real root below $-2$, which a subresultant lifts back to the original system. The existence argument is symbolic and uses no numerical optimisation. Since that coefficient contains no odd powers of $n$, the required $n$ comes with an explicit threshold, not an asymptotic guarantee. I also cost the construction: couplings grow as $N^{1/2}$ and the on-site range as $N^{3/2}$, the transfer time stays within a factor 2.3-3.0 of the Mandelstam-Tamm limit at every size, and the fidelity is sensitive to systematic drift of the spectator-spectator coupling class but tolerant of independent bond disorder, which self-averages. This is a constrained analogue of perfect state transfer: for general real states an unconstrained real symmetric matrix suffices, whereas here the Hamiltonian must have excitation-preserving spin-network form.
Read the full abstract
Number Theory
The three Kanade-Russell identities modulo nine
We prove the three symmetric Kanade-Russell identities modulo nine.
Metric Geometry
Gromov–Hausdorff Distance Between Euclidean Unit Balls
What is the Gromov–Hausdorff distance between Euclidean unit balls of different dimensions, denoted by $d_\gh(B^m,B^n)$, for $m>n$? Note that the lower bound coming from the stability of persistent homology is zero, since all balls possess identical (trivial) persistent homology. To establish non-trivial lower bounds, we exploit the Borsuk–Ulam theorem. For any $m > n \ge 1$, we prove that $d_\gh(B^m,B^n)\ge \tfrac{1}{1+\alpha_n} > \frac{1}{2}$, where we determine $\alpha_n$ explicitly. We also prove that $d_\gh(B^m,B^n)\to 1$ as $m\to \infty$ and that $d_\gh(B^m,B^n)<1$ for all finite $m>n\geq 1$.
Read the full abstract
Plasma Physics
A polar-harmonic unified gas-kinetic scheme for magnetized ion dynamics from cyclotron kinetics to the Hall-Pedersen constitutive limit
Magnetized ion transport in weakly ionized plasmas ranges from gyroangle-dependent kinetics to Hall-Pedersen drift-diffusion as collisionality and magnetization vary. We develop a polar-harmonic unified gas-kinetic scheme (PH-UGKS) for the ion Vlasov-BGK equation in a uniform magnetic field. The scheme evolves the full ion distribution by coupling a conservative density update to exponential evolution of its nonequilibrium component. Exact collision-rotation integration in gyroangle Fourier space is combined with a time-averaged kinetic flux that incorporates spatial transport and electric acceleration, together with a compact Hall-Pedersen correction to the density flux. The scheme conserves ion number, and analysis establishes second-order temporal consistency and asymptotic preservation of the Hall-Pedersen density limit at fixed magnetization. Numerical tests reproduce ion Bernstein dispersion and Dory-Guest-Harris growth rates and resolve changes in the gyroharmonic spectrum as the collision-to-gyrofrequency ratio varies. The driven ion-flux response agrees with an independent characteristic-Volterra reference, including finite-frequency departures from the instantaneous Hall-Pedersen relation. In collisional tests, accurate responses are obtained with time steps far larger than both the collision time and the gyroperiod. Fixed-resolution density tests confirm convergence to the corresponding Hall-Pedersen discretization. The same kinetic formulation thus connects kinetic response and macroscopic transport without switching to a fluid solver or subcycling microscopic time scales.
Read the full abstract
Robotics
A Risk-Sensitive and Uncertainty-Aware Decision-Making and Control Framework for Safe and Robust Autonomous Driving
Reinforcement learning (RL) has demonstrated considerable potential for autonomous driving decision-making. However, its deployment in urban autonomous driving, particularly at highly interactive unsignalized intersections, remains challenging, as learned policies may struggle to maintain both safety and robust decision-making in complex traffic situations. Conventional safety-filtering approaches typically employ fixed conservative constraints, which may improve safety at the cost of excessive intervention and degraded traffic efficiency. To address these limitations, we propose a Risk-sensitive and Uncertainty-aware Decision-making and Control (RUDC) framework for safe and robust autonomous driving. RUDC couples risk-sensitive distributional RL with ensemble-based policy uncertainty quantification, jointly accounting for tail risks in return distributions and uncertainty in learned policies. An uncertainty-aware high-order control barrier function (HOCBF)-based safety correction mechanism adaptively adjusts constraint strictness according to policy uncertainty, while a learnable residual predictor compensates for CBF model mismatches and discretization errors. Extensive simulations at unsignalized intersections demonstrate that RUDC achieves a favorable balance among safety, efficiency, and robustness, outperforming representative safe RL baselines under both nominal and challenging OOD and long-tail scenarios while satisfying real-time requirements.
Read the full abstract
Soft Condensed Matter
Geodesic Trapping and Escape of Active Particles on Curved Surfaces
Active particles on curved surfaces can become trapped along closed geodesics even without physical barriers. We show that escape from these geometric traps exposes a fundamental distinction between continuous and discrete reorientation. At high Péclet numbers, active Brownian particles escape efficiently through rotational diffusion, whereas run-and-tumble particles remain trapped much longer; at low Péclet numbers, both reduce to passive diffusion. Gaussian curvature controls escape by focusing or defocusing neighboring geodesics, producing distinct asymptotic scalings of the mean exit time.
Read the full abstract
Probability
Freeness for the $G$-circulant Decomposition of the Partial Transpose of Random Matrices
We introduce a left $G$-circulant decomposition for matrices indexed by an arbitrary finite group $G$, extending the diagonal decomposition associated with cyclic groups. We show that, when $A\in M_{|G|}(\mathcal A)$ is free from $M_{|G|}(\mathbb C)$, the components arising from the left $G$-circulant decomposition of $A^t$ form a free family, with the components associated with inverse pairs forming $R$-diagonal pairs. We also describe the distributions of these components in terms of the distribution of $A$. Our results recover the cyclic case and show that different group structures of the same order may lead to different free decompositions of the same matrix.
Read the full abstract
Artificial Intelligence
Black-Box Red Teaming of Agentic AI: A Taxonomy-Driven Framework for Automated Risk Discovery
Agentic systems are rapidly moving to production, where they read untrusted inputs, call tools with real permissions, and act autonomously, expanding the security surface beyond chat-only models. Yet standard evaluations remain single-turn and fail to capture multi-step agent vulnerabilities. We present a systematic black-box framework for risk-aware agent evaluation requiring only basic system descriptions. Our approach introduces: (1) a seven-domain taxonomy mapping observable behaviors to risk categories, (2) fully automated SAGE-RT red teaming producing 120 adversarial scenarios per domain, and (3) human-validated evaluation using LLM judges. Empirical validation across two agent architectures (CrewAI and AutoGen) with four base models reveals alarming patterns: 56.25% average governance risk, 65% privacy risk in multi-agent configurations, and agent behavior vulnerabilities reaching 85%. Our black-box approach effectively identifies critical architectural vulnerabilities without privileged access, providing a scalable path toward safer agent deployments.
Read the full abstract
Artificial Intelligence
RobustSGPO: Search-Space Control for Agent Harness Evolution
Semantic-gradient-based prompt optimization (SGPO) improves agent harnesses using execution feedback, but its local update rule leaves the choice of edit scope and operation unresolved. We introduce RobustSGPO, which specifies the requested edit, constructs and checks the patch, and continues search from either the incumbent or retained snapshots. We evaluate permission scheduling, cumulative controls, and task-family transfer in the AgentX brainstorming workflow using 120 tasks, 95 runs, and 7,350 candidate attempts. Periodic $1\to2\to3$ scheduling exceeds fixed maximum permission by 0.28 test-score points. RobustSGPO increases completion on 30 held-out tasks from 60.0% to 80.0% and improves test quality from 3.77 to 4.14 under a 20-million-token budget. Category retention reduces source-task degradation after a shift, whereas random retention reaches a higher destination endpoint. Search-space control benefits quality through executable edits and alternative starting points, with measurable retention overhead.
Read the full abstract
Astrophysics of Galaxies
High Resolution Spectroscopic Follow-up Observation Results for 13 EMP Candidates Selected by Narrow-band Photometry
Extremely metal-poor (EMP; [Fe/H] < -3.0) stars preserve key information about the earliest stages of Galactic chemical evolution. Based on a training set of spectroscopic metallicities, we constructed catalogs of more than 120,000 EMP candidates from large-scale narrow-band photometric surveys. To validate this approach, we obtained high-resolution CFHT/ESPaDOnS spectra for 13 candidates selected from the SkyMapper-based catalog. The follow-up observation confirms that the narrow-band photometric selection is effective in identifying very metal-poor stars and retaining a substantial EMP fraction: four targets are confirmed as EMP stars, and all targets remain very metal-poor with [Fe/H] < -2.4. The photometric metallicities are systematically lower than the spectroscopic values by 0.44 dex, with a relatively small scatter of 0.19 dex, indicating a systematic offset in the photometric metallicity scale that could be reduced through improved calibration. Abundances for more than 20 chemical species are derived, leading to the identification of a new potassium-enhanced r-II star, J2001-1215. By combining chemical abundances with orbital properties, five stars are found to be dynamically consistent with known Galactic substructures, including Gaia–Sausage–Enceladus, Thamnos, and Sequoia. These stars provide high-resolution chemical measurements for the extremely metal-poor regime of these Galactic substructures. These results underscore the role of narrow-band photometry in efficiently selecting EMP candidates for targeted high-resolution spectroscopic follow-up, thereby enabling detailed chemical and dynamical studies of the early Milky Way.