Spectral Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 31 August
For $N\geq 3$ and a potential phase $\vartheta\in\mathbb{R}$, we study the non-self-adjoint almost Mathieu matrix obtained by multiplying the discrete Laplacian by a complex phase with angle $\varphi\in\mathbb{R}$, $A_N(\varphi,\vartheta)=e^{i\varphi}(S+S^{-1})/2+\operatorname{diag}(\cos(2\pi j/N+\vartheta))_{j\in\mathbb{Z}/N\mathbb{Z}}$, where $S e_j=e_{j+1}$ is the periodic shift on $\mathbb{C}^N$. We derive a Chambers formula and isolate the part $Q_{N,\varphi}$ of the characteristic polynomial that depends only on $N$ and $\varphi$, but not on $\vartheta$ or on a change of boundary conditions for the shift operator. We then show, for every $N$, that the zeros of $Q_{N,\varphi}$ lie on the two perpendicular lines $e^{i\varphi/2}\mathbb{R}\cup e^{i(\varphi/2+\pi/2)}\mathbb{R}$. For even $N$, the same property holds for the matrices $A_N(\varphi,\vartheta)$ with $\vartheta\in 2\pi\mathbb{Z}/N$, and we compute their limiting eigenvalue measure explicitly. For $\varphi\in[-\pi,\pi]$, the eigenvalue distribution approximates elliptic-integral densities with masses $1-|\varphi|/\pi$ and $|\varphi|/\pi$, and maximal radii $2|\cos(\varphi/2)|$ and $2|\sin(\varphi/2)|$, respectively. At $\varphi=\pi/2$, the central polynomial $Q_{N,\varphi}$ factors into positive quartic factors. This proves that the Scottish flag matrix, after Trefethen and Chapman, has its spectrum on the two diagonal lines of the saltire.
Exactly Solvable and Integrable Systems
Lattice KP type equations arising from eigenfunctions and Dbar problem
In this paper, we construct the lattice Kadomtsev-Petviashvili (KP) type eigenfunction equations. A homogeneous nonlocal $\bar{\partial}$ problem is considered, from which we are able to define the eigenfunction of the Lax pair of the lattice KP equation. The eigenfunction together with its expansions at infinity and at a finite analytic point provide formulations of the lattice modified KP equation, the lattice Schwarzian KP equation and the Nijhoff-Quispel-Capel KP (NQC-KP) equation. We also consider an inhomogeneous nonlocal $\bar{\partial}$ problem. It defines the eigenfunction of the Lax pair of the lattice modified KP equation. This eigenfunction generates a direct formulation for the NQC-KP equation, which is different from the previous ones. Explicit solutions of these equations are obtained, from which we can see the difference of the different formulations for same equations.
Read the full abstract
Spectral Theory
Band edges of periodic Schrödinger operators are generically isolated and nondegenerate
For periodic Schrödinger operators $H_V=-\Delta+V$ with bounded real-valued potentials on $\mathbb R^d$ with $d\ge2$, we show that for generic potentials, each endpoint of every spectral gap is attained by a single Bloch band at only finitely many quasimomenta, and has a nondegenerate Hessian at every attaining point. This proves the Spectral Edge Conjecture for periodic Schrödinger operators.
Read the full abstract
Computation and Language
GPAgentBench-2K: Benchmarking Large Language Model Agents in Complex Clinical Action Space
Large Language Models (LLMs) show great potential as clinical agents, yet existing benchmarks reduce clinical workflows to static predictions or unconstrained Markov Decision Processes (MDPs) with coarse action sets. To address this, we introduce GPAgentBench-2K, the first Constrained MDP (CMDP) LLM-agent benchmark for primary-care clinical decision-making, constructed from expert-validated records of real-world GP encounters. Our environment models a full spectrum of six foundational clinical actions, imposes a topological workflow prior over the action space, and operationalizes safety-informed abstention as a first-class outcome. Evaluating 16 state-of-the-art LLMs reveals a significant performance degradation as the action space scales. Crucially, we uncover a clinical quality-safety gap: even frontier models with the highest diagnosis accuracy violate safety constraints in over half of high-risk cases. Finally, we establish a reference point using Constrained Group Relative Policy Optimization (C-GRPO), and show that while explicitly modeling constraints improves performance over unconstrained RL methods, it remains far from clinically acceptable safety.
Read the full abstract
Representation Theory
Classification of Simple Harish-Chandra Modules over the Loop Mirror HeisenbergVirasoro Algebra
The loop mirror Heisenberg-Virasoro algebra, an embedded subalgebra of the loop Heisenberg-Virasoro algebra, admits a family of interesting truncated subalgebras including those of Takiff type and \(\mathfrak{bms}_3\) type. We give a complete classification of simple Harish-Chandra modules over the loop mirror Heisenberg-Virasoro algebra, whose simple modules fall into three categories, highest weight modules, lowest weight modules, and evaluation modules of the intermediate series. As a by-product, we classify all simple Harish-Chandra modules over the truncated mirror Heisenberg-Virasoro algebras \(\mathcal{L}(n)\) for \(n\geq2\). By virtue of shift operators in the \(d\)-parameter family, we give a more streamlined proof of Theorem 3.3 from the work [Classification of simple $W_n$-modules with finite-dimensional weight spaces, J. Reine Angew. Math., 720 (2016), 199-216] by Y. Billig and V. Futorny, which states the key Billig-Futorny identity. Furthermore, our approach can be extended to the computation of annihilators for uniformly bounded modules over some other Lie (super)algebras.
Read the full abstract
Computational Engineering
The PUR-1 Cyber-Physical Digital Twin
Digital twin technologies have the potential to improve operational flexibility and responsiveness capabilities of nuclear systems. To provide decision support, cyber event characterization, state estimation, predictive control, and real-time dynamic processing of operational data, however, an efficient digital twin needs to integrate multiple models (data-driven as well as physics-based) with explainability while at the same time maintain two-way synchronization with the physical facility at a time constant less than its operational cycle. In this work, we present the Purdue University Reactor One Digital Twin (PUR-1 DT), a cyber-physical digital twin with a complete high-fidelity physics-based and AI-driven virtual model stack (neutronics, thermal-hydraulics, point kinetics) which provides closed-loop explainable diagnostics, forecasting, predictive control, and action recommendation back to the reactor via two-way communications and a cyber-physical testbed. We demonstrate real-time synchronized state estimation and short-term forecasting over a full reactor operational cycle and conduct a series of benchmarking experiments to validate accuracy and latency. Our results show good agreement with experimental results and lay the groundwork for further development and experimental demonstration of DT-enabled functionalities in real-world facilities.
Read the full abstract
Representation Theory
Poisson blow-ups and the adjoint quotient
We leverage Polishchuk's Poisson blow-up criterion in the context of algebro-geometric integrable systems. In more detail, one may associate an integrable system $\tau:\mathfrak{X}\longrightarrow\mathfrak{B}$ to each affine Poisson scheme $\mathfrak{X}$ over $\mathbb{C}$. We prove that the blow-ups of $\mathfrak{X}$ along fibers of $\tau$ are Poisson schemes occurring in a family $\widetilde{\mathfrak{X}\times\mathfrak{B}}\longrightarrow\mathfrak{B}$, where $\widetilde{\mathfrak{X}\times\mathfrak{B}}$ is itself a Poisson scheme. This result is subsequently specialized to the adjoint quotient $\tau:\mathfrak{g}\longrightarrow\mathfrak{g}/\!/G=:\mathfrak{c}$ of a finite-dimensional complex semisimple Lie algebra $\mathfrak{g}$ with integrating algebraic group $G$. We show that the family $\widetilde{\mathfrak{g}\times\mathfrak{c}}\longrightarrow\mathfrak{c}$ is flat, conical, and equipped with a canonical Poisson Hamiltonian $G$-variety structure. We also obtain Poisson-geometric results on the fibers of this family, which are blow-ups of $\mathfrak{g}$ along regular adjoint orbit closures.
Read the full abstract
Computer Vision
ATGS: Anchored Temporal Gaussian Splatting for Long Volumetric Video Representation
Volumetric video enables immersive free viewpoint rendering of dynamic real world scenes, yet existing methods struggle with long sequences and complex motions, often leading to temporal instability and visual artifacts. To address these challenges, we propose \ourname, a Gaussian splatting based framework for volumetric video reconstruction. Our key insight is that explicitly tracking long term complex motion with individual Gaussian primitives is inherently unstable. Instead, we organize Gaussians around time conditioned anchors that localize their spatial and temporal support, thereby reducing long range motion complexity. We further introduce a temporal windowing strategy to activate only anchors relevant to the queried time, which improves scalability and temporal coherence. In addition, to ensure spatial and temporal stability, we design a compact set of multi level anchor features that encode global features, local spatial features, and local temporal features, jointly constraining Gaussian generation. Extensive experiments demonstrate that \ourname \ consistently outperforms prior methods on long sequence volumetric videos with complex motions. Project page: https://github.com/WuJH2001/ATGS.
Read the full abstract
High Energy Physics (Experiment)
ConCA: Concentration-Aware Channel Attention for Fine-Grained Visual Recognition
Lightweight channel attention mechanisms are widely used in image classification, yet their effectiveness in fine-grained visual recognition (FGVR) remains limited. Most modules summarize each channel by global average pooling (GAP), which captures activation magnitude but ignores spatial concentration, so channels with different spatial distributions but identical means receive the same descriptor. We propose Concentration-Aware Channel Attention (ConCA), which pairs the mean with a shift-invariant negative-input entropy (NegEnt), computed via a softmax over the negated activations, forming a dual descriptor that jointly encodes magnitude and concentration. A depthwise 1-D convolutional multi-layer perceptron (MLP), whose parameter count is linear in the number of channels, maps the pair to a per-channel weight. On six fine-grained benchmarks, ConCA improves over attention-free, SE-Net, and ECA-Net baselines as well as four richer descriptor-based modules under a controlled from-scratch protocol, and it generalizes across eight backbones on iNat2021-mini. These results indicate that the channel descriptor, together with the per-channel gating that maps it to attention weights, is an important but underexplored aspect of lightweight channel attention in FGVR.
Read the full abstract
Rings and Algebras
On Completeness of $n$-ary Hom-Nambu and Hom-Lie Superalgebras
We introduce and study completeness for multiplicative $n$-ary Hom-Nambu superalgebras. Because an $n$-ary Hom-Nambu bracket is not necessarily totally super-skew-symmetric, we define its center as the intersection of its positional centers. A multiplicative $n$-ary Hom-Nambu superalgebra is complete when its center is trivial, and every $\alpha^{k+1}$-derivation is inner for all $k \geq 0$. We show that this notion reduces to the usual completeness for multiplicative $n$-Hom-Lie superalgebras. Furthermore, we establish a completeness criterion for surjective brackets with a zero twisting map and provide a complete $n$-ary Hom-Nambu superalgebra that is not an $n$-Hom-Lie superalgebra. We also study the direct sums of complete $n$-Hom-Lie superalgebras and the behavior of centers under twisting. Finally, starting from a multiplicative Hom-Lie superalgebra, we consider recursively induced multiplicative $n$-ary Hom-Nambu superalgebras. When the twisting map is surjective, we prove that triviality of the center is preserved and reflected in this construction. We also observe that every binary $\alpha^k$-derivation satisfies the corresponding relative $\alpha^k$-derivation identity for the induced bracket. Finally, we determine the complete members in the selected low-dimensional Hom-Lie and $3$-Hom-Lie superalgebra classifications.
Read the full abstract
Artificial Intelligence
A.X K2 Technical Report
We introduce A.X K2, a 688B-parameter Mixture-of-Experts (MoE) language model trained from scratch as a high-performance foundation for agentic applications. Trained on approximately 8.5T tokens—fewer than its predecessor, A.X K1—on a smaller but higher-quality mixture with substantially expanded agentic and software-engineering data, it nonetheless improves over A.X K1 across the board, by over 30 percentage points on some benchmarks, reflecting large gains in token efficiency. To support long contexts efficiently, we introduce Sparse Gated Attention (SGA), which combines sparse attention with gated attention, and adopt Gated Norm (GN) to stabilize large-scale training. SGA is trained natively at 128K through a sparse indexer warmup that optimizes the indexer against its own sparse top-$k$ selection rather than the dense attention distribution, making adaptation markedly cheaper: each query reads only 2,048 positions, yet long-context quality is unchanged and A.X K2 scores 94.6 on RULER out to 256K. The outlier suppression of GN in turn keeps 4-bit NVFP4 serving within one point of FP8 accuracy. A simple yet effective Think-Fusion recipe further lets users switch between thinking and non-thinking modes within a single unified model. Extensive evaluations show that A.X K2 performs competitively against strong open-weight baselines, matching or exceeding them on math and Korean-language benchmarks.
Read the full abstract
Combinatorics
A requested analytic proof of an identity of Dixit, Kumar, and Srivastava
Recently Dixit, Kumar, and Srivastava investigated what they called Rascoe and non-Rascoe partitions. These are defined to be the set of distinct partitions where the length of the partition is a part of the partition and is not a part respectively. In this note we provide a $q$-series theoretic proof of two identities regarding the generating function for unrestricted Rascoe and non-Rascoe partitions fulfilling a request of Dixit, Kumar, and Srivastava. We also prove a conjecture of Beck relating non-Rascoe partitions and the rank of a partition.
Read the full abstract
Software Engineering
Open-Source Autonomous Driving System Analysis and Multi-Disciplinary Hardware-in-the-Loop Research Paradigm with Reinforcement-Learning Testing and Large Language Models
Open-source autonomous driving systems provide an inspectable software foundation for intelligent vehicle research. Under real-vehicle deployment conditions, the recording and review of experimental conditions are important for interpreting system behavior and reusing experimental results. However, in a shared real-vehicle environment involving multiple vehicles, task processes, code modifications, and hardware testing feedback are often distributed across different teams and experimental stages, making it challenging to maintain continuous and reviewable experimental records. To address this limitation, this paper examines an Apollo-on-Hongqi EV environment and proposes a real-vehicle experimental framework. The framework connects multi-vehicle experiments, repository-based code reuse and software-hardware testing feedback within a unified review process. Large language models and RL-based testing serve as auxiliary components for record organization, anomaly summarization, and simulation-based candidate scenario generation. Based on this setting, this paper analyzes preliminary evidence from multi-vehicle collaborative experimentation, code and experimental-skill sharing, and software-hardware collaborative testing. The analysis shows that experimental records can be examined together with their operating conditions, providing a reviewable basis for Apollo-on-Hongqi EV research.
Read the full abstract
Probability
Extinction and extinguishment properties for a nonlinear predator-prey branching model
We study extinction and extinguishment in a two-type continuous-state nonlinear branching model driven by Brownian branching noise and spectrally positive stable jumps. The populations are subject to nonlinear self-regulation and a mixed-sign predator–prey interaction: the second promotes the first, whereas the first suppresses the second. Two complementary structures are developed. An exact power–logarithmic cancellation functional removes the interaction drifts and yields stochastic Lyapunov estimates, nonexplosion, and boundary criteria. In the multiplicative regimes, integrating-factor identities and geometric Lévy factorizations express extinction through weighted exposure clocks and reduce the long-time analysis to effective decay rates. These methods yield almost-sure extinction criteria and identify a regime in which finite-time extinction and nonextinction coexist. On nonextinction, both populations remain positive at all finite times and converge jointly to zero, exhibiting joint extinguishment rather than positive persistence.
Read the full abstract
Cryptography and Security
Understanding Stage-Wise Utility-Risk Trade-offs in LLM Agent Memory
Long-term memory is becoming a core capability of LLM agents, enabling personalization and long-horizon interaction. However, memory mechanisms that retain, transform, or expose more information can affect both benign utility and susceptibility to memory poisoning. Existing evaluations typically measure memory utility or attack risk in isolation under fixed configurations, providing limited insight into how stage-specific design choices reshape their trade-off. We present MemGauge, a controllable framework that separately varies writing admission, management policy, and retrieval exposure under matched clean and poisoned conditions. Across 11 LLMs and two long-term memory benchmarks, controlled evaluations reveal three distinct profiles: a threshold-like risk transition during writing, policy-dependent local decoupling during management, and coupled growth of utility and risk during retrieval. We further apply analogous stage-level measurements to four existing memory systems and observe diagnostic associations qualitatively consistent with these profiles. These results show that targeted poisoning risk varies across memory operations and motivate stage-aware evaluation and control of LLM-agent memory.
Read the full abstract
Quantum Physics
Data and code for collision-model Dicke-state preparation: depth-fidelity frontiers, circuit costs, and superconducting-processor measurements
Dicke states are multipartite entangled states in which a fixed number of quantum excitations is coherently shared among many qubits. Originally introduced in the context of cooperative emission and superradiance, they are now important resources for quantum sensing, networking, and collective quantum phenomena. Preparing prescribed Dicke states with high fidelity, however, remains challenging, particularly as the system size and excitation number increase. Here we present an open dataset and accompanying code for preparing Dicke states using a collision-based quantum protocol. The dataset covers systems from five to fourteen qubits over a broad range of excitation numbers and records how the best-found noiseless preparation fidelity changes with circuit depth. It also provides circuit-resource estimates and experimental measurements for selected states on the 54-qubit IQM Emerald superconducting processor. The accompanying code reproduces the processed data and validation checks, providing a reusable benchmark for studying the trade-off between state-preparation fidelity, circuit cost, and hardware noise.
Read the full abstract
Machine Learning
Benchmarking Peptide-Protein Affinity Prediction Across Peptide and Target Shifts
Peptide-protein affinity models are often evaluated with a single data split, obscuring whether they interpolate among measurements for observed targets or generalize across peptide or target shifts. We integrated three sources of quantitative peptide-protein binding data to obtain 11,349 deduplicated pairs and benchmarked ten peptide representations, ESM-2 protein embeddings, and six regressors under peptide-similarity, within-target, and leave-target-out partitions. Across 60 matched representation-regressor configurations, mean test Spearman correlations were 0.462, 0.669, and 0.530, respectively. The top configuration shifted from ECFP-16 count fingerprints with random forest in the first two settings to HELM-BERT with Extra Trees when exact target sequences were excluded. Representation-rank correlations ranged from -0.042 to 0.624 across partitions, whereas regressor-rank correlations ranged from 0.771 to 0.943. Learning curves showed that representation differences were largest with limited supervision and narrowed as training data increased. PeptideCLM-2 adaptation and simple element-wise interaction features provided no consistent gain over a frozen encoder and direct concatenation under the tested protocols. These conclusions are specific to a dataset that pools transformed Kd, Ki, and IC50 measurements and to target exclusion at the exact-sequence level. Peptide-protein affinity benchmarks should therefore align data partitions with the intended use and jointly assess the effects of data scale, molecular representation, and downstream learner.
Read the full abstract
Analysis of PDEs
Exact counting of spherical metrics with one conical singularity on rectangular tori
We prove that for every integer $n\geq 2$ and $8\pi(n-1)<\rho<8\pi n$, the singular Liouville equation $\Delta u+\e^u=\rho\delta_0$ on a rectangular torus $E_{\mathrm{i}b}=\mathbb{C}/(\mathbb Z+\mathrm{i} b\mathbb Z)$ has exactly $n$ solutions, which are all axisymmetric. Together with previous results by Chen-Lin and Lin-Wang, this yields that \begin{itemize} \item $E_{\mathrm{i} b}$ admits no spherical metrics with a conical singularity of angle $2\pi\vartheta$ as long as $\vartheta$ is a positive odd integer. \item For every integer $n\geq 1$, $E_{\mathrm{i} b}$ admits exactly $n$ spherical metrics with a conical singularity of angle $2\pi\vartheta$ for each $\vartheta\in (2n-1, 2n+1)$. \end{itemize} The basic idea is to prove that the linearized equation has only trivial solutions in the space of axisymmetric functions. The previous method of analysing nodal domains via Bol's isoperimetric inequality only works for $\rho\leq 8\pi$. We develop a unified approach for all $\rho\in (0,+\infty)\setminus 8\pi\mathbb{N}_{\geq 1}$ by exploring the deep connection with the monodromy of the classical Lamé equation.
Read the full abstract
Analysis of PDEs
Łojasiewicz–Simon inequalities near bubbling configurations for the Yamabe functional on bounded domains
We establish Łojasiewicz–Simon type gradient inequalities for the Yamabe functional on bounded smooth domains near configurations consisting of finitely many concentrating bubbles, with or without a regular component. A weighted decomposition separates the finite-dimensional spectral and bubble parameters from an infinite-dimensional coercive remainder. We obtain quantitative estimates for the parameters, the remainder, and the corresponding energy gaps, in both the regular-plus-bubbling and the pure-bubbling regimes. These inequalities quantify the deviation from such surfaces and are essential for studying the dynamics of related parabolic flows.
Read the full abstract
Operator Algebras
Jensen' s trace inequality with equality condition and noncommutative Lamperti's theorem
Let $\mathcal M$ be a semifinite von Neumann algebra equipped with a semifinite faithful normal trace $\tau$. We establish Jensen's trace inequality in full generality and characterize its equality case, which answers two questions raised in [Kosaki2013] and [HaradaKosaki2008]. As an application, we derive noncommutative Lamperti-type inequalities and their equality conditions. Employing this result, we characterize linear isometries (not necessarily surjective) on a class of $F$-normed noncommutative Orlicz spaces, which provides a noncommutative Lamperti's theorem for linear isometries.
Read the full abstract
Cryptography and Security
Reducio: Optimized Confidential Serverless Cloud Deployments for Enterprise Customers
Serverless platforms based on Confidential Virtual Machines (CVMs) have been recently proposed to address the privacy problems with serverless functions, while achieving low latency. Unfortunately, our study indicates that to achieve these properties, existing proposals impose non-trivial requirements in terms of infrastructure changes and platform memory. Reducio is an alternate serverless platform design that does not require infrastructure changes and significantly reduces platform memory requirements. The platform is designed using two key components: (1) a function isolation framework inside a CVM based on kernel deprivileging features that minimize infrastructure requirements, and (2) a layer-wise caching methodology and algorithm that effectively uses a small in-memory function cache. Our evaluation indicates that Reducio can significantly reduce both platform requirements for deployment and function memory consumption.
Read the full abstract
Mesoscale and Nanoscale Physics
Switchable Magnetoelectric Transport in Graphene via a Van der Waals Multiferroic
Electric and magnetic control of transport properties at atomic interfaces is central to the development of next generation electronics and spintronics. Van der Waals multiferroics materials that simultaneously host dielectric and magnetic orders down to the monolayer limit offer a promising platform for such interfacial control, yet the realization of electronic functionalities that exploit the unique attributes of van der Waals multiferroics has largely remained elusive. Here, we realize a van der Waals heterostructure comprising graphene and the multiferroic CuCrP2S6, enabling gate-switchable magnetoelectric transport in graphene, mediated by the multiferroic layer. The charge-neutrality resistance peak of graphene exhibits pronounced hysteresis arising from polarization flip in the multiferroic state. Application of an in-plane magnetic field shifts this peak in a polarization-dependent manner, revealing magnetic-field-induced polarization modulation a direct signature of the magnetoelectric effect. Furthermore, cooling the device under an applied electric field enables domain control of the multiferroic order, allowing reversible switching of the interfacial magnetoelectric transport. These results provide the first demonstration of interfacial magnetoelectric transport in a vdW heterostructure, and establish a pathway for engineering two-dimensional van der Waals interfaces for functional device applications.
Read the full abstract
General Relativity and Quantum Cosmology
Black hole correspondences of quasi-topological gravity : Shadows, quasinormal modes, graybody factors
Within the framework of quasi-topological gravity, we systematically investigate the correspondences among three classes of observables—the shadow, the quasinormal modes, and the graybody factors—of regular black holes in $D = 5$ dimensions. Using the WKB approximation and GrayHawk numerical integration, we test the applicability of the GBF–QNM correspondence and the shadow–GBF correspondence in the low-mode ($l=2$) and higher-dimensions ($D=5$): the difference between the GBF–QNM correspondence and the numerical results remains small in magnitude; we apply the known Langer correction (replacing $l$ by the effective angular momentum $\kappa = \sqrt{l(l+D-3)} \simeq l + (D-3)/2$), which reduces the error of the shadow–GBF correspondence at low modes to a level comparable with that of the GBF–QNM correspondence. Our work extends the shadow–GBF correspondence to higher-dimensional regular black holes, providing a viable route to predict the black hole spectrum and the Hawking radiation profile from a single observable, and thereby to realize multi-messenger tests of gravity.
Read the full abstract
Signal Processing
Site-specific Channel Modeling Based on Remote-Sensing Maps for 6G Space–Air–Ground Digital Twins
Site-specific channel models are essential for wireless digital twins of 6G space–air–ground communication systems. However, 3D maps are difficult to obtain over wide areas, which limits large-area site-specific channel modeling. To address this issue, this paper proposes a remote-sensing-based augmented ray-tracing channel modeling framework. The framework comprises a deterministic RT branch, a measurement-statistical branch, and an RT augmentation branch. To overcome the difficulty of acquiring large-area 3D maps, the deterministic RT branch reconstructs a 3D RT scene from satellite remote-sensing imagery and calibrates its electromagnetic material parameters using measured path loss. To provide the statistical parameters required for RT augmentation, the measurement-statistical branch establishes the marginal distributions and interparameter dependence models of the channel parameters. Specifically, a wideband UAV channel measurement campaign is conducted at 4.60 GHz, and a proposed multipath estimation method estimates the complex amplitudes, delays, and Doppler shifts of the measured multipath. To bridge the gap between RT predictions and measurements, the RT augmentation branch organizes the RT multipath into LoS, LoS-tail, and NLoS components, generates additional short-delay LoS-tail paths, and reallocates the component and path powers according to the measurement-derived statistics while preserving the total RT received power. The validation results show that the proposed framework reduces the path loss RMSE from 5.45 to 4.35 dB and, relative to calibrated RT, decreases the RMS delay spread and normalized Doppler spread RMSEs by 53.03 and 26.48, respectively. The proposed framework provides a site-specific channel modeling approach for 6G space–air–ground digital-twin studies.
Read the full abstract
Differential Geometry
The symmetric maximal surface equation
We establish the existence of smooth solutions to the symmetric maximal surface equation with degenerate boundary conditions. Moreover, we prove that these solutions maximize the associated area functionals. This result serves as the Lorentzian analogue of minimal graphs in hyperbolic spaces together with their associated area minimizing problem.
Read the full abstract
Classical Analysis and ODEs
Square Functions and Rectifiability under Monotone Transformations of the Density
Let $\mu$ be an $n$-AD-regular measure in $\mathbb{R}^d$. Chousionis, Garnett, Le and Tolsa [CGLT] proved that $\mu$ is uniformly $n$-rectifiable if and only if the square function built from the density differences $\Delta_\mu(x,r)=\mu(B(x,r))/r^n-\mu(B(x,2r))/(2r)^n$ satisfies a Carleson condition. In this paper we show that the same characterization holds if the density is first composed with a function $F$ which is bi-Lipschitz on the interval $[c_0^{-1},c_0]$ determined by the AD-regularity constant $c_0$. The main example is $F=\log$, introduced in [Le], for which the square function takes the scale-invariant form $\Delta_\mu^{\log}(x,r) = \log\bigl(\mu(B(x,r))/\mu(B(x,2r))\bigr)+n\log 2$. We give a complete proof, extend the statement to the smooth square functions of [CGLT], where the density is replaced by the convolution of $\mu$ with a Gaussian or a more general radial kernel, discuss what happens when $F$ is not bi-Lipschitz, and treat the case $\mu(\mathbb{R}^d)<\infty$, where the behavior of $F$ near zero enters in only one of the two implications. We also show that the qualitative characterization of $n$-rectifiable measures by Tolsa and Toro [TT], in terms of the same square function at $\mu$-almost every point, holds after composition with any locally bi-Lipschitz $F$. This requires neither AD-regularity nor doubling, and for $F=\log$ the condition $\lim_{r\to0}\Delta_\mu(x,r)=0$ becomes $\lim_{r\to0}\mu(B(x,r))/\mu(B(x,2r))=2^{-n}$.
Read the full abstract
Quantitative Methods
Science sandboxes measure the scientific capability of AI agents
Scientific progress depends not only on finding solutions, but on learning the rules that explain why they work and using that understanding to design better experiments. We introduce science sandboxes, a framework for studying this capability in AI agents through repeated cycles of experimentation, feedback, and hypothesis revision. Science sandboxes invite an agent to query the natural world in different ways, ranging from "wet" physical experiments, to "damp" predictive models trained on empirical data, to "dry" invented rules. By establishing a common experimental loop and a protocol for evaluating agents within it, science sandboxes allow assessment of both quantitative performance on specific metrics and qualitative scientific reasoning, across a spectrum of empirical verifiability. Here, we instantiate this framework in two biological settings, models of regulatory genomics and protein fitness prediction, and examine the capabilities of frontier agents. Across these settings, we could see when agents successfully optimized a quantitative metric without understanding the rules underlying the system. In particular, their scientific reasoning deteriorated when they encountered systems whose rules fell outside familiar biological priors. By highlighting such failure modes, science sandboxes make the frontier of scientific capability measurable and provide a controlled setting in which to study and ultimately expand it.
Read the full abstract
Materials Science
Coexisting Large and Small Polarons in Photoexcited CeO$_2$
Time-resolved terahertz (THz) spectroscopy is used to probe polaron formation in CeO$_2$. The ultrafast THz photoconductivity is dominated by contributions from large hole and small electron polarons. Delocalized large hole polarons are formed on a $820 \pm 50$ fs time scale and are of Fröhlich type, with optical conductivity well described by a simple Drude model and a transient hole mobility of $100$ cm$^2$/Vs. Small electron polarons form via localized coupling to Ce lattice sites, revealed by reduction in the lattice Born effective charge causing a transient phonon softening. These results establish the dual polaron nature of CeO$_2$ and provide a basis for understanding charge transfer dynamics in metal oxide photocatalysts.
Read the full abstract
Information Retrieval
Doc-REFRAG: Rethinking Multimodal Document Retrieval-Augmented Generation
Real-world knowledge resides in multimodal documents, necessitating retrieval-augmented generation (RAG) for accurate question answering. However, existing multimodal RAG models are primarily designed for single-image or closed-document settings and exhibit limited accuracy in realistic multi-image scenarios. Moreover, processing numerous retrieved images incurs substantial computational overhead from irrelevant visual tokens. To address these challenges, we introduce DocLongRAG, a large-scale dataset of 343K question–answer pairs, each associated with an average of 37.4 retrieved images to reflect authentic RAG workflows. Building on this dataset, we propose Doc-REFRAG, a question-guided framework that compresses visual tokens into coarse chunks and selectively expands question-relevant ones via a lightweight RL-based selector. Experiments on six benchmarks show that Doc-REFRAG outperforms eleven strong baselines, achieving state-of-the-art accuracy with significantly lower inference latency. Our resources are available at https://github.com/Collab-Gen/Doc-REFRAG.
Read the full abstract
Machine Learning
Reinforcement Learning for Symbolic Equation Solving
We present a reinforcement-learning agent that solves symbolic equations step by step, covering both nonlinear closed equations (radicals, exponentials, trigonometric) and a controlled class of restricted-open families requiring a change of variables (CoV) such as completing the square. We cast algebra as an MDP with a dynamic action space and a tree-structured policy (TreeMLP). The main policy learns from reward alone with no supervised solution traces; the CoV substitution comes from a supervised generator interchangeable with a CAS call. On closed equations the agent matches the prior best on CommonCore (0.93 greedy vs. ConPoLe's 0.925) under a single policy. On four hand-designed restricted-open families (quadratic, cubic, quartic, exponential) it reaches 0.79 beam / 0.67 greedy, exceeding the strongest non-learned search (A-star, 0.64). Learned CoV timing has content only on the exponential family, the one requiring a nested CoV, where a natural rule solves none of the held-out equations while the policy solves 75% from reward alone. At 10x scale a sharp seed-level bimodality emerges; a UCB learning-progress curriculum shows a non-significant positive trend toward mitigating it. We do not claim general open-equation solving: every open-equation result is confined to these four controlled families.