Information Retrieval
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 8 September
The differentiable search index (DSI) framework (Tay et al., 2022) has become the de facto baseline for generative retrieval. However, DSI is hard to reproduce: no public implementation covers all three original document identifier types (atomic, naive, semantic), reported results vary widely, and the ubiquitous NQ320K dataset is built from Natural Questions through diverse and underspecified preprocessing. We introduce ReDSI, the first open-source DSI implementation supporting all three identifier types, together with a parameterizable and well-documented NQ320K construction pipeline. Experimentally, we achieve results that are competitive with or stronger than previous DSI baselines. Moreover, we conduct extensive experiments under model downscaling, covering retrieval effectiveness, parameter efficiency, training methods and decoding strategies, opening novel directions for future research.
Signal Processing
A Material-Aware Channel Model for Efficient CKM Generation via Environment Reconstruction
Channel knowledge map (CKM) is a promising technology for environment-aware wireless communication, sensing, and localization in 6G networks. Accurate CKM generation requires precise reconstruction of the environment, including 3D geometries and scatterer materials, typically from multi-modal sensory observations such as LiDAR point clouds and sparse channel measurements. While the former is relatively easy to acquire, materials remain difficult to obtain directly from sparse channel measurements due to the lack of an explicit channel model linking them. To fill this gap, this paper proposes a material-aware channel model that explicitly characterizes the influence of scatterer materials on the wireless channel. Based on this model, an iterative gradient descent based material reconstruction algorithm is proposed. Full wave simulation results validate the developed model and the proposed algorithm, demonstrating their potentials for efficient CKM generation via environment reconstruction.
Read the full abstract
Combinatorics
Extremal problems for cancellative and locally thin hypergraphs
We study Turán-type extremal problems for cancellative and locally thin uniform hypergraphs. An $r$-uniform hypergraph is $t$-cancellative if $(\cup_{i=1}^t A_i)\cup B\ne (\cup_{i=1}^t A_i)\cup C$ whenever $A_1,\ldots,A_t,B,C$ are distinct edges. Let $C_t(n,r)$ denote the maximum number of edges in such a hypergraph on $n$ vertices. For all fixed integers $t,k\ge2$, we prove that $C_{2(t-1)}(n,tk)=(1+o(1))\frac{\binom{n}{k}}{\binom{tk-1}{k-1}}$ as $n\to\infty$. In the case $t=2$, this shows that Füredi's 2012 upper bound for $C_2(n,2k)$ is asymptotically sharp. The lower bound uses locally sparse induced packings, while the upper bound follows from double counting and a matching argument. More generally, for integers $s\ge t\ge1$, an $r$-uniform hypergraph is locally $(s,t)$-thin if among any $s$ distinct edges, at least $t$ contain a vertex that lies in none of the other $s-1$ edges. This notion includes cancellative hypergraphs as special cases. We establish general upper and lower bounds for the corresponding extremal numbers and determine their polynomial order of growth under suitable divisibility assumptions.
Read the full abstract
Number Theory
Rational functions over finite fields with Galois closure of genus zero
Let $k=\mathbb F_q$. We classify, up to pre- and post-composition by $k$-Möbius transformations, all separable $k$-indecomposable rational functions $f\in k(X)$ of degree greater than one whose Galois closure has genus zero. The classification is valid in arbitrary characteristic and includes exact arithmetic conditions and class counts over the prescribed field. Semilinear Frobenius descent determines the finite-field forms and which geometric decompositions descend to $k$. For every separable $f\in k(X)$ of degree greater than one with Galois closure of genus zero and every $m\geqslant1$, we prove that $f$ permutes $\mathbf P^1(\mathbb F_{q^m})$ if and only if it is exceptional over $\mathbb F_{q^m}$, meaning that it permutes $\mathbf P^1(L)$ for infinitely many finite extensions $L/\mathbb F_{q^m}$. No indecomposability assumption or lower bound on $q$ is needed. The argument combines fixed-point averaging with ramification on the Galois-closure curve. If the full constant field is $\mathbb F_{q^d}$, these properties depend only on $\gcd(m,d)$. For each classified family we determine the permutation extension degrees explicitly and characterize polynomial representatives.
Read the full abstract
Geometric Topology
Conformal tetrahedra and global rigidity of sphere packings in constant curvature background geometry
In this paper, we give the dual characterization of conformal tetrahedra in constant curvature spaces, which develops a geometric technique to obtain the global rigidity of (ideal) hyperbolic, Euclidean, spherical sphere packings on a tetrahedron. Moreover, we introduce ideal hyperbolic sphere packings and extend the variational principle to obtain the global rigidity of (ideal) hyperbolic sphere packings on 3-manifolds. We also provide a characterization of conformal $n(\ge3)$-simplices in constant curvature spaces, which is useful for studying higher-dimensional sphere packings.
Read the full abstract
Machine Learning
Earth System World Model for What-If Simulations: A Case Study for Terrestrial Ecosystems
Machine learning emulators have become essential for accelerating expensive Earth-system simulations, but most existing approaches remain passive forecasters: they reproduce simulator trajectories under prescribed forcings without an explicit interaction mechanism for user-specified interventions. This limits their use in interactive scientific workflows and Earth-system digital twins, where users often need to explore how a system would respond if selected state components were changed. We propose an action-conditioned world-modeling framework for Earth-system emulation that reformulates simulator trajectories as supervision for controllable state-transition learning. The key idea is transition-action pretraining: naturally observed state changes are treated as label-free action supervision, allowing the model to learn both prescribed dynamics and action-conditioned responses without manually annotated interventions. We further introduce masked response learning to infer unobserved variables under partial state edits and learn coupled system dependencies. We test this framework on ecosystem dynamics across six global regions and multiple stand ages. Experiments show that the model preserves competitive long-horizon emulation accuracy while enabling controllable structural interventions and coherent responses in coupled ecosystem-cycle variables. These results suggest a practical route from passive Earth-system emulators toward interactive, intervention-aware scientific surrogates.
Read the full abstract
Adaptation and Self-Organizing Systems
Double explosive transitions in adaptive multilayer networks with higher-order interactions
Can asymmetry between two interacting networks fundamentally change how they synchronize? We identify double explosive transitions in the forward direction, backward direction, or a combination thereof, with single or double hysteresis loops in an adaptive bilayer multiplex network of Kuramoto oscillators with pairwise and three-body interactions and asymmetric phase lags. Using the Ott-Antonsen reduction, we derive a low-dimensional system and perform a stability analysis. The reduced model accurately captures the full microscopic dynamics and enables analytical expressions for the bifurcation points. Systematic mapping across multiple parameter planes reveals eight distinct synchronization regimes. The relative ordering of saddle-node and pitchfork bifurcation points—controlled by phase-lag asymmetry, cross-layer adaptation, and the higher-order interaction strength—creates two distinct coherent branches (weak and strong), giving rise to double explosive transitions. Crucially, phase-lag asymmetry acts as a robust control knob: while symmetric phase lags suppress explosive transitions, layer-specific differences promote multistability and double explosive transitions. The higher-order interaction strength $K_2$ and adaptation strengths $q$, $p$, and $h$ further modulate these transitions in a complex, parameter-dependent manner. Excellent agreement between analytical predictions and numerical simulations confirms the robustness of our reduced description.
Read the full abstract
Robotics
CAST: Alternating State-Value Targets and Expanded Policy Gradients for Model-Based Reinforcement Learning
Model-based reinforcement learning (MBRL) is a family of RL methods that learn a model of the environment and use it for action selection, making it well suited to robotics due to its sample efficiency. Combining learned models with online planning can further improve action selection, as the planner can exploit the model to find better actions than the learned policy alone. Recent methods combining learned policies with online planning typically learn the value of the policy rather than the stronger planner-guided behavior. We present CAST (Critic with Alternating State-value Target), which uses planner-guided behavior to improve value learning while regularizing the value estimate with the current policy. CAST replaces the action-value critic with a state-value critic, trained using a target that combines a real planner-guided transition and an imagined transition under the current policy. The resulting value function corresponds to an alternating process between planner-guided behavior and the current policy, allowing it to benefit from the stronger planner behavior while being regularised by the policy being learned. We evaluate CAST on the DeepMind Control and HumanoidBench Suites against several state-of-the-art methods, and demonstrate successful transfer to a physical Unitree Go2 quadruped performing a dynamic handstand.
Read the full abstract
Complex Variables
The sharp constant in the Mashreghi-Ransford inequality
Let $(a_n)_{n\geq0}$ be a sequence of complex numbers, and define \[ b_n=\sum_{k=0}^n \binom{n}{k} a_k, \qquad c_n=\sum_{k=0}^n \binom{n}{k}(-1)^{n-k}a_k. \] Let $\beta>1$, put $\alpha=\sqrt{\beta^2-1}$, and suppose that $b_n,c_n=O(\beta^n)$. Mashreghi and Ransford proved that \[ \limsup_{n\to\infty}\frac{|a_n|}{\alpha^n} \leq \kappa \left(\limsup_{n\to\infty}\frac{|b_n|}{\beta^n}\right)^{\!1/2}\! \left(\limsup_{n\to\infty}\frac{|c_n|}{\beta^n}\right)^{\!1/2} \] with a universal constant satisfying $2/\sqrt{3} \leq \kappa\leq2$. We prove that the optimal constant is indeed $\kappa=2/\sqrt{3}$. The proof, which uses exponential generating functions, Phragmén-Lindelöf estimates, and Cauchy's formula, is compared to the classical one of Mashreghi and Ransford.
Read the full abstract
Machine Learning
Length Generalization for Transformers via Compression
Recent advancements in transformer length generalization theory enable us to reliably predict when a transformer can learn to solve a task. In particular, the C-RASP hypothesis (a formalized version of the so-called RASP-l conjecture) posits that transformers length-generalize on a task if and only if a solution is expressible in the C-RASP language. While this hypothesis has strong empirical validation, theoretical problems arise from the fact that no computable length generalization bounds exist for C-RASP, alongside the discovery of seemingly contradictory experiments. To address these problems, we refine the C-RASP hypothesis utilizing the recently-proposed fragments C-RASP+ and C-RASP1. These fragments have computable length generalization bounds, though in the worst case requiring an extremely large (double exponential) sample size. It is an open question whether these sample size bounds are tight. In this paper, we resolve this open question by providing an exponentially tighter bound. In doing so, we show a polynomial length generalization bound for transformers if we adopt compressed strings, via a novel connection to power words. As an application, we show how this yields a fine-grained analysis of the C-RASP conjecture that resolves contradicting experimental evidence against it.
Read the full abstract
Computer Vision
Matching in Context: Temporal Fusion and Query Adaptation for Training-Free Video Temporal Grounding
Text-guided Video Temporal Grounding (VTG) localizes moments in an untrimmed video that correspond to a text query. Supervised approaches require costly temporal annotations and task-specific training, yet can generalize poorly under distribution shift. To reduce this dependence on task-specific supervision, training-free approaches use pretrained vision-language models to localize moments by measuring the similarity between video and query features. However, independently encoded frames provide limited temporal context, while a fixed query embedding can assign similar scores to different candidate moments within the video. To address these limitations, we propose DSE-VTG, a \underline{D}ual-\underline{S}ide \underline{E}nhancement framework that combines visual evidence across temporal granularities with video-specific query adaptation, without task-specific training. On the visual side, Multi-scale Similarity Fusion (MSF) combines frame- and clip-level similarities into a unified, temporally aware similarity profile. On the query side, Query-level Test-Time Adaptation (Q-TTA) uses pseudo-labels to optimize a lightweight additive offset for more discriminative matching within the video, without fine-tuning the backbone or calling external large language models. Experiments on three standard and two out-of-distribution (OOD) benchmarks show gains over the prior training-free methods. On Charades-STA, DSE-VTG improves mIoU by 5.89 percentage points over the strongest compared baseline under the same backbone. Under distribution shift, DSE-VTG reaches 50.86 mIoU on Charades-CG Novel-Word, surpassing the strongest supervised baseline by 2.76 mIoU. Our code will be released upon acceptance.
Read the full abstract
Geometric Topology
Asymptotically conformal and asymptotically rigid mapping class groups
We give conditions ensuring that an asymptotically rigid mapping class group, specifically a surface Houghton group $\mathcal{H}(S)$, has finite index in the asymptotically conformal modular group $\text{Mod}_0(X)$, where $X$ is a hyperbolic structure on $S$. These include geometric conditions on the pieces of the underlying rigid structure, as well as the existence in $\mathcal{H}(S)$ of an end-periodic homeomorphism which is asymptotically conformal. As a consequence, if $S$ has $n\geq 3$ ends, then $\text{Mod}_0(X)$ has type $F_{n-1}$ but not $FP_n$. We also establish analogous results for $L^p$ modular groups.
Read the full abstract
Computer Vision
FIRE3D: Feed-forward Interactive 3D Scene Reconstruction Within A Minute
We present FIRE3D, a unified framework that transforms a single RGB image or casual video into interactable 3D scene assets for games and interactive applications in under a minute for up to twelve textured instances including preprocessing. At the core of FIRE3D is a feed-forward inference pipeline that predicts a compositional scene representation from posed RGB-D observations estimated from the RGB capture, including the 6-DoF pose, bounding box, mesh, and texture for detected objects. By modeling the scene as a collection of discrete entities, FIRE3D produces amodal object assets that can be independently edited and used in interactive applications. Our framework requires no test-time optimization, runs substantially faster than the compared reconstruction systems, and provides object-level completeness beyond existing feed-forward 3D approaches. We demonstrate leading detection accuracy, strong geometry reconstruction, and competitive rendering quality on the evaluated benchmarks, with substantial runtime gains.
Read the full abstract
Combinatorics
Coloring graphs with no long induced path
Let $P_t$ denote the induced path on $t$ vertices. Let $\omega(G)$ denote the maximum number of vertices in a clique of a graph $G$. Gyárfás (1987) proved that every $P_t$-free graph $G$ satisfies $\chi(G)\le(t-1)^{\omega(G)-1}$, and Gravier, Hoàng, and Maffray (2003) improved this to $\chi(G)\le (t-2)^{\omega(G)-1}$ for $t\ge4$. We lower the base of the exponential by one: for every $t\ge5$, every $P_t$-free graph $G$ satisfies \[ \chi(G)\le 3\,(t-3)^{\omega(G)+4}. \] The proof combines two refinements of the Gyárfás path argument and was developed with the assistance of Claude Fable 5.1 of Anthropic and GPT Pro of OpenAI.
Read the full abstract
Dynamical Systems
Degenerating orbits of the Longest Edge Bisection process
We study the Longest Edge Bisection (LEB) process as a dynamical system on the projective shape space of simplices. A long-standing conjecture going back to Adler and Rivara-Levin and motivated by finite-element mesh refinement, often taken as a standing assumption, is that this procedure is non-degenerate and, in fact, in a certain way periodic. We prove: \begin{itemize} \item There are 3-dimensional simplices such that the longest edge-bisection algorithm degenerates. \item There is an open set of 4-dimensional simplices on which the longest edge-bisection algorithm degenerates. \item If parametrizing the space of $d$-dimensional simplices by independent standard Gaussian vectors, then as $d$ increases, a random simplex degenerates asymptotically almost surely. \end{itemize} This is realized through exhibiting hyperbolic behaviour of the LEB process. We also exhibit elliptic behaviour that is nonperiodic.
Read the full abstract
Analysis of PDEs
On 2D Scattering for a Critical Nonlinear Schrödinger Flow
We study modified scattering for the two-dimensional defocusing nonlinear Schrödinger equation (NLS) with the gauge-invariant, scattering-critical nonlinearity $|u|u$. We prove that the remodulated interaction representation has a local $L^2$ limit for general data in $\Sigma=H^1\cap\F^{-1}H^1$. For radial data, we prove convergence in $L^p(\R^2)$ for every $2<p<\infty$.
Read the full abstract
Distributed Computing
Exploring the Genesis Platform Capabilities to Accelerate Scientific Discovery in OPAL
Autonomous, cross-facility science requires capabilities that no individual project should have to build for itself: managed execution for long-lived services, versioned distribution of models to remote compute systems, governed access to large language models, a shared substrate for experimental data, and end-to-end provenance. The U.S. Department of Energy Genesis Mission platform, delivered through the American Science Cloud, provides these as reusable services. This paper reports how the Genesis platform enables cross-facility experiments and accelerates scientific discovery. We explore the plant phenotyping workflow of the Orchestrated Platform for Autonomous Laboratories as the exemplar: it couples Oak Ridge National Laboratory's Advanced Plant Phenotyping Laboratory with the Frontier supercomputer. In a 40-day nickel-treatment campaign, the resulting workflow replaced roughly twelve hours of manual analysis with interactive queries returning in seconds to minutes.
Read the full abstract
Formal Languages and Automata
Graph-based automata
We study graph-based automata: nondeterministic finite automata obtained from edge-colored or oriented graphs by taking every vertex as both initial and accepting, and every edge as a pair of opposite transitions. The language of these automata corresponds to the set of edge-colored or oriented paths mapping to their corresponding graphs. We develop an analogous notion for trees and characterise the languages recognised by these models. For tree languages we prove the existence of a unique size- minimal graph and, more generally, a homomorphism-minimal graph for both word and tree languages using duality methods. In order to further motivate these models, we showcase a few results at the inter- section between graph theory and automata theory: We relate graph-based automata to reversible automata, give a decomposition of graph-based languages into reversible languages, and introduce the remanent language of an undirected graph as the inter- section of all its orientations. This remanent language captures structural information on the graph such as chromatic number.
Read the full abstract
Optimization and Control
On the cost of reaching an attainable state for the boundary-controlled 1-D heat equation
We consider the heat equation in an interval of the real line, with null initial condition, and Dirichlet boundary controls. We study the cost of reaching an attainable state at some time $T>0$. Precisely, given a state in the interval that we know is reachable by suitable boundary controls, we estimate the size of the smallest controls that reach it, in terms of an appropriate norm of this state. Our estimate is optimal in some sense as the time horizon goes to $0$.
Read the full abstract
Computer Vision
Leveraging Visual and Geometric Priors for Metric-scale and Complete Vehicle Gaussian Reconstruction from Limited Views
High-fidelity vehicle assets are essential for controllable traffic scene generation, particularly for synthesizing rare and safety-critical long-tail scenarios. However, reconstructing a reusable vehicle representation from in-the-wild onboard images remains challenging for two reasons. First, image-to-3D generation methods generally produce models without reliable metric scale. Second, onboard cameras usually observe only one side of a target vehicle, making conventional multi-view reconstruction incomplete on unobserved regions. To solve these problems, we propose a feed-forward vehicle asset reconstruction method, which leverages two complementary priors to reconstruct 3D Gaussian representations for vehicles using sparse one-sided observations. To achieve metric-scale reconstruction, a visual foundation model is first utilized to serve as a visual prior for Gaussian initialization. The Gaussian attributes are then estimated by a learnable encoder-decoder module. A symmetry-aware cloning strategy is presented to complete the unobserved side directly in Gaussian space, which exploits the bilateral structure of vehicles as a geometric prior. Experiments on the public dataset demonstrate that the proposed method significantly outperforms existing approaches in both vehicle asset completeness and geometric accuracy.
Read the full abstract
High Energy Physics (Phenomenology)
Axion Hair and Pulsar Electrodynamics: modelling, discharge dynamics, and particle-in-cell simulations
In a companion paper, we demonstrated that static axion field gradients sourced by dense nuclear matter (axion hair) can dominate the near-field electrodynamics of old rotation-powered pulsars, leading to new constraints on light QCD axions and on CP-violating axion-nucleon interactions. This article provides the extended theoretical and numerical framework underlying those results. We begin by providing a detailed description of the sourcing of axion hair from dense nuclear matter, computing self-consistent field profiles for each interaction across the relevant parameter space. We then study the modification to the electrodynamics induced in the polar gap region by these axion gradients; this is done at the analytic level by studying the modification induced by axion field gradients on the effective discharge parameter (computed in the force-free limit of the split monopole magnetic field configuration, and looking at leading deviations from the force-free limit for dipolar field configurations), and numerically by developing dedicated 1D particle-in-cell simulations which capture the leading order dynamical behavior near the star. Our results demonstrate that axion hair serves to either enhance acceleration, or enhance screening, where the relevant effect changes between the northern and southern hemispheres of the star, and between the field lines which support out-flowing and return currents.
Read the full abstract
Mesoscale and Nanoscale Physics
Non-perturbative theory of valley splitting in Si qubits from variational wave function: periodic effects of shear strain and asymptotic freedom in the wiggle-well potential
Valley splitting sets the energy scale at which spin and valley degrees of freedom hybridize in silicon quantum-well qubits, but its sensitivity to interface structure makes it difficult to predict. Using the valleyor basis, we formulate a two-band effective-mass model for intervalley coupling in a finite quantum well and develop an analytical framework for treating non-perturbative effects of shear strain and wiggle-well potentials. For a $z$-independent coupling $V_s\tau_2$, corresponding to uniform shear strain, we construct a variational state from the exact plane-wave valleyors and a hard-wall envelope. This yields closed-form expressions for the two lowest states and their splitting, including the characteristic oscillatory $|\sin(k_{\rm min}L)|$ dependence. The variational result agrees with exact diagonalization to within $\sim1\%$ for realistic couplings, and provides a simple prescription for tuning the shear strain away from the nodes to enhance the valley splitting. We further show that finite barrier heights primarily renormalize the effective width of the quantum well while preserving the oscillatory dependence. For a wiggle-well coupling $V_w\cos(k_wz)\tau_1$, the valleyor representation reveals a crossover near the $k_w=2k_1$ resonance from wiggle-dominated splitting to orbital quantization. Remarkably, at high wiggle-well amplitudes, the empty-box energy scale predominantly dictates the near-resonant valley splitting, while the wiggle-well potential enters only as a sub-leading correction. This behavior can be viewed as asymptotic freedom for spin qubits. Away from resonance, the splitting exhibits a broadly peaked resonance with diffraction-like side-lobes as a function of detuning.
Read the full abstract
Chemical Physics
Orbital choice in constructing model Hamiltonians
Model Hamiltonians (e.g., the Hubbard or Heisenberg models) provide a simple yet physically meaningful description of complex electronic phenomena through a small number of parameters, such as electron hopping integrals or magnetic exchange couplings. Their construction typically exploits the local nature of electron correlation effects and therefore relies on localized orbitals. Although many localization schemes are available, the resulting localized orbitals depend not only on the chosen localization functional but also on the orbital space to which the localization procedure is applied. These choices are often treated as technical details and are rarely discussed explicitly. Here, we demonstrate that different, chemically reasonable choices of localized orbitals can lead to substantially different model Hamiltonian parameters, even when they produce nearly identical electronic energies. Using Density Matrix Downfolding, we systematically investigate how the localization functional and, more importantly, the choice of model orbital space affect effective Hamiltonians derived from ab initio calculations for representative $\pi$-conjugated systems and transition metal complexes.
Read the full abstract
Nuclear Experiment
Indirect Measurement of the $\rm S^*(E)$ Factor for $\rm {}^{12}C({}^{12}C,\mathit{p}){}^{23}Na$ at Gamow Energies via the Trojan Horse Method with Near-0 degree Spectator Detection
The astrophysical S*(E) factor for the 12C+12C reaction within the Gamow window plays a pivotal role in modeling stellar carbon burning and explosive nucleosynthesis scenarios. However, direct measurements or even simple extrapolations at these energies are severely hindered by Coulomb suppression and the possible presence of narrow resonances. To address this challenge, we performed an indirect measurement of the 12C(16O,ap)23Na reaction at the HI-13 Tandem Accelerator, employing 16O=(12C+a) as the Trojan Horse nucleus. A key innovation of this Trojan Horse Method (THM) study is the implementation of a copper beam-stopper foil, which enabled the detection of spectator particles near 0, the angular region where their yield is maximized under quasi-free kinematics. The S*(E) factor for the 12C(12C,p)23Na reaction in the astrophysically relevant energy range was extracted using the THM formalism based on the DWBA. Our results confirm the presence of resonant structures within the Gamow window around 1.5 MeV in both the p0 and p1 proton channels. No evidence of a hindrance effect is observed in the measured energy range. Without considering the resonance details, the overall trend of our results is qualitatively in reasonable agreement with the THM-Tumino2018 and TTIK2025 data, but differs significantly from the trend of the Modified-THM-Muk2019 data.
Read the full abstract
Systems and Control
Asynchronous Model Predictive Control Under Model Mismatch: Stability and Performance Guarantees
Certainty-equivalence model predictive control (CE-MPC) is widely used for its simplicity and efficiency, but theoretical guarantees under asynchronous feedback remain limited. This paper establishes stability and performance guarantees for asynchronous CE-MPC of input-constrained nonlinear systems. We first derive a nominal stability condition and competitive-ratio bound that explicitly account for inter-execution intervals without prescribing a feedback mechanism. A value-function perturbation analysis for quadratic stage costs then accommodates additive, potentially non-smooth model mismatch without constraint qualification conditions. Combining these results yields stability criteria and competitive-ratio bounds for CE-MPC under general asynchronous feedback, including event/self-triggered and multi-step MPC. The guarantees explicitly relate prediction horizon, inter-execution time, and uncertainty magnitude, quantifying performance degradation relative to an ideal infinite-horizon controller. These results clarify tradeoffs between feedback frequency, model accuracy, and horizon length, guiding asynchronous MPC design using approximate or learned models.
Read the full abstract
Atomic Physics
Hyperfine-driven polarization effects in elastic muon scattering by atomic nuclei
We present a theoretical study of polarization dynamics in the elastic scattering of muons and antimuons by high-magnetic-moment atomic nuclei, using ${}_{83}^{209}$Bi as a benchmark. The analysis tracks the evolution of (anti)muon polarization and its transfer to the nucleus, emphasizing nuclear-structure corrections. These corrections significantly alter both the differential cross sections and the polarization observables. Our results demonstrate that measuring scattered muon polarization serves as a sensitive probe for nuclear charge radii and magnetic dipole moments.
Read the full abstract
Physics Education
From Local Context to Climate Science: Low-Cost Experimentation in the Initial Training of Physics Teachers
Climate change poses a major scientific, environmental, and educational challenge, requiring approaches that connect physical concepts, empirical evidence, and socially relevant environmental issues. This study presents and analyzes a low-cost experimental investigation developed within the "Physics and the Environment" course of a Physics teacher training program at the State University of the Tocantina Region of Maranhão (UEMASUL), Brazil. The experiment involved constructing a simplified thermal simulator using accessible materials and comparing a confined system with an open control system, both exposed simultaneously to solar radiation. The results showed that the average temperature inside the simulator was $45.91^{\circ}\mathrm{C}$, compared to $38.58^{\circ}\mathrm{C}$ in the external control system, corresponding to a mean temperature difference of $7.33^{\circ}\mathrm{C}$ (among other analyses). These results demonstrate that the experimental setup was capable of producing and measuring a significant thermal difference between the two systems. However, the observed temperature rise should not be interpreted as a direct measure of the atmospheric greenhouse effect, given that the experimental apparatus involves both radiative and non-radiative heat transfer mechanisms. The study emphasizes the educational potential of low-cost experimentation as a strategy to integrate electromagnetic radiation, energy balance, temperature, heat transfer, and climate science into the initial training of physics teachers. It also highlights the importance of explicitly discussing the limitations of experimental models and distinguishing local experimental evidence from conclusions regarding global climate processes.
Read the full abstract
Cryptography and Security
A New Backscattering Dual-Polarized Rectenna for Wireless Power Transfer and IoT Applications
This paper proposes an innovative dual-polarized backscattering rectenna that operates in two distinct modesenergy harvesting and backscattering modulation-driven by two-bit digital control signals. By utilizing two orthogonal (co-and cross-) polarizations, the design represents a versatile candidate for IoT applications such as battery-free wireless sensing, identification, localization, and communication. The rectenna's dual functionality is validated through its integration into a proofof-concept battery-free wireless sensor, where it operates both as an energy harvester and as a dual-polarized backscattering modulator. As a proof of concept, a 16-byte AES-128 encrypted payload is backscattered over the wireless power transfer link to enhance the resilience of a battery-free Bluetooth Low Energy (BLE) wireless sensor against replay, relay, and eavesdropping attacks.
Read the full abstract
Artificial Intelligence
Closing the Consistency Gap: Self-Evolving Agents That Learn to Stay on Course
Large language model (LLM)-powered agents can be accurate on average yet unreliable in production, a discrepancy that has been observed but remains largely unaddressed. When given the same task five times, a ReAct agent on the AppWorld benchmark using GPT-4.1 succeeds in all five runs only 53% of the time, even though its per-run pass rate averages 77%. We call this 24-point shortfall the consistency gap, and we argue that addressing it is a precondition for trustworthy AI agent deployment. We present a self-evolving agent framework that reduces this gap by identifying unstable, low-consistency steps in agent trajectories and converting them into episodic memory the agent can draw on in future runs. At its core is a Consistency Analyzer that pinpoints where and why a trajectory is likely to flip across executions, and a Guideline Generator that converts the diagnosis into targeted guidelines, committed to memory and injected into future agent executions on similar tasks. On AppWorld with ReAct/GPT-4.1, our framework raises the fraction of tasks that succeed in all five runs by +16 points on same-task evaluation and +13 points on similar-task generalization.
Read the full abstract
High Energy Physics (Theory)
Splitting Dynamics of Multiply Quantized Vortices in Holographic Superfluid of Finite Temperature
We study the splitting dynamics of multiply quantized vortices with winding numbers $n=5,6,7$ and $8$ in a two-dimensional holographic superfluid at finite temperature, by combining linear perturbation analysis of quasinormal modes with fully nonlinear real-time numerical simulations. Three new physical phenomena are revealed. First, the number of unstable modes no longer strictly follows the $2n-3$ formula as $n$ increases. For the vortex with $n=8$, the unstable mode with $p=2(n-1)$ is absent throughout the entire temperature range, so that only $2n-4$ unstable modes exist. Second, the transition of the dominant unstable mode with increasing temperature exhibits new characteristics. For vortices with $n\le 6$, the dominant mode changes sequentially as $p=2,3,\dots,n$, whereas for $n\ge 7$ jump-like transitions occur-for instance, for $n=7$ the dominant mode jumps from $p=2$ to $p=4$ at $T=0.325T_c$ and then directly to $p=7$ at $T=0.359T_c$, and for $n=8$ it jumps directly from $p=2$ to $p=8$ at $T=0.302T_c$. Third, a single splitting pattern of high-winding-number vortices can contain multiple sub-splitting patterns with distinct topological structures, as exemplified by the $l=4$ pattern of the $n=8$ vortex, which exhibits three sub-patterns at low, intermediate and high temperatures. The nonlinear simulations confirm the predictions of the linear stability analysis, and the implications of our results for cold-atom experiments are discussed.