Computation and Language
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 9 September
Social intelligence enables agents to read social context, infer intent, and adapt over sustained dialogue. As language models become autonomous collaborators, it is central to building effective and trustworthy human-AI interaction. Existing reinforcement learning methods optimize single-turn utterances and sparse outcome rewards, producing short-sighted policies that struggle to manage goal-relationship tensions across multi-turn interactions. We propose SocialRL, a multi-turn reinforcement learning framework addressing both challenges. First, we apply multi-turn reinforcement learning using PPO that propagates delayed outcome rewards back to each turn, enabling long-horizon planning. Second, we design six process reward dimensions capturing the goal-relationship trade-off, including goal advancement, relational attunement, contextual coherence, etc. A reward model dynamically generates fine-grained scoring criteria for each dimension, while a stage-aware weight schedule prioritizes relationship-building in early turns, goal advancement mid-way, and balanced closure late. Across multiple social-dialogue benchmarks, SocialRL improves Goal Achievement by an average of 9.2 percentage points over the corresponding Base models. These results demonstrate the effectiveness of SocialRL across synthetic and real social scenes, as well as standard and challenging social scenarios.
High Energy Astrophysical Phenomena
1LHAASO J1852+0050u: GeV-100TeV Gamma-ray emission Powered by Star-forming Region?
Star-forming regions (SFRs), including HII regions, have recently attracted significant attention as potential sites of particle acceleration capable of producing PeV cosmic rays, i.e. as potential Galactic PeVatrons. Yet, SFRs known as candidate PeVatrons are still very rare. Here we report a highly likely physical association between the UHE gamma-ray source 1LHAASO J1852+0050u and coincident star-forming regions. Using $\sim$4 years of LHAASO data, the extended source 1LHAASO J1852+0050u (called J1852 in this study) was reanalyzed with a significance of $\sim$13$\sigma$ and 39%-containment radius of 0.35$\deg$. This extended source projectively covers dozens of HII regions and an energetic pulsar PSR J1853+0056. We reanalyzed $\sim$16 years of Fermi-LAT data and found a GeV source (named SrcAG) coincident with the LHAASO source J1852. The CO-line observation shows a molecular clump which coincides with the gamma-ray sources and is related with the ultra-compact HII region G34.26+0.15 at the distance of $\sim$3.3 kpc. Fitting to the spectral energy distribution indicates that PSR J1853+0056 cannot afford the observed gamma-ray flux either for J1852 or SrcAG. Although the contribution from hidden pulsars to the gamma-ray emission could not be excluded, it is most likely that the GeV-100TeV gamma-ray emission is dominantly powered by SFR through p-p hadronic interaction between the protons accelerated in the SFR and MCs: the GeV emission is ascribed to the protons accelerated by protostars' activities, while the TeV emission ascribed to the protons accelerated by massive stars in the SFR.
Read the full abstract
Computer Vision
MethaneFuse: Learning from Multi-Sensor Satellite Observations for Methane Plume Detection
Methane plume detection from satellite imagery is constrained by incomplete observations: public satellites provide complementary spatial, spectral, and atmospheric evidence, but real plume cases rarely contain fully paired multi-sensor measurements because of revisit schedules, cloud coverage, acquisition quality, and the transient nature of emissions. Most learning-based detectors rely on single-sensor inputs, especially Sentinel-2 (S2), leaving many reported plume cases unusable. We construct MethaneUnion, a temporal multi-sensor dataset built from Carbon Mapper plume reports and matched S2, Landsat 8/9 (L8/9), EMIT, and Sentinel-5P (S5P) observations. Built on MethaneUnion, MethaneFuse learns from heterogeneous satellite observations under partial sensor availability without requiring complete four-sensor measurements. MethaneUnion expands usable coverage from 3,211 valid S2-matched plume cases to 8,981 reported plume cases with multi-sensor observations. At the representative 480 m setting, MethaneFuse achieves 84.87 F1 and 93.62 AUROC, improving over the strongest baseline by 5.65 F1 and 8.30 AUROC points while reducing false positives by 8.19 points. Sensor-availability experiments show that MethaneFuse improves detection when S2 is available and transfers plume knowledge to L8/9, EMIT, and S5P when S2 is unavailable. These results demonstrate the value of learning from incomplete heterogeneous sensor observations for practical methane plume detection.
Read the full abstract
Materials Science
Morphology and depletion force-based large-scale self-assembly of nanocubes on surface
Self-assembling nanoparticles is a highly efficient and facile way to form functional nano-, micro- and macrostructures. However, currently available methods lack precision and controllability in size, shape and composition, suffer from poor reproducibility and scalability, and require complex steps and expensive materials. Here, we present the uniform morphology-induced and depletion force-directed nanoparticle assembly on surface (MIDAS) method with gold nanocubes (AuNCs). Using this approach, morphology-sensitive depletion forces trigger shape-selective flocculation and assembly of the AuNCs with uniform size and shape. Importantly, the surface roughness-controlled substrate drives the large-scale formation of AuNC-assembled monolayers (2D AuNAMs) or three-dimensional AuNC-assembled multilayers (3D AuNAMs) in a highly specific manner without any complex ligand modification or preparation steps. Lattice-gas modeling and kinetic Monte Carlo simulations show the depletion force is the key parameter determining supercrystal morphology and corroborate the experimental findings. This work establishes a generalizable nanoparticle assembly mechanism and demonstrates the broad applicability of the MIDAS strategy for scalable fabrication and patterning of 2D and 3D nanoparticle architectures.
Read the full abstract
Applied Physics
Through-thickness coupling of diffusion and viscoelastic relaxation in the transient bending of bilayer microcantilevers
Static-mode microcantilever sensors detect chemical analytes through the bending of a bilayer beam whose polymer coating swells upon absorption. The transient bending is usually modeled as if the coating absorbed analyte uniformly, which is adequate for thin coatings but breaks down as the coating thickens and a moving diffusion front couples to depth-dependent viscoelastic relaxation. We resolve this coupling with a purpose-built finite-element solver requiring only one linear solve per time step, and show that the through-thickness structure controls the transient response in ways uniform-uptake models cannot capture. Verified against a published analytical solution, the solver reproduces the full transition from a pronounced curvature overshoot (up to nearly twice the steady-state value) when diffusion is fast relative to relaxation to a monotonic rise when it is slow. In the intermediate-thickness regime the analytical solution cannot reach, the thickness maximizing the steady-state signal and the thickness preserving the transient overshoot are governed by different physics, one geometric and one dynamic, so one coating cannot be optimized for both. The overshoot further survives realistic surface mass-transfer resistance, justifying the idealized surface boundary condition used throughout.
Read the full abstract
Differential Geometry
Multiply warped products with harmonic Weyl tensor and zero radial Weyl curvature
In this article, we study multiply warped products with a one-dimensional base, harmonic Weyl tensor and zero radial Weyl curvature. We prove that these manifolds have at most three fibers and describe their local geometry. The proof uses a conformal change which makes the warping functions quadratic polynomials, together with the compatibility equations imposed by the Ricci tensor. The resulting metrics are either obtained from locally conformally flat multiply warped products by replacing their space-form fibers with Einstein manifolds, or belong to a three-fiber family with equal fiber dimensions and positive Einstein constants. Examples show that the bound is sharp and that neither Weyl condition implies the other. We also discuss the stronger restrictions arising from soliton-type equations.
Read the full abstract
Optimization and Control
Arithmetic Scar Accessibility and Generic Schrodinger Control on Metric Graphs
We study internal exact controllability of the free Schrödinger equation on finite compact metric graphs with Kirchhoff conditions at interior vertices and a fixed Dirichlet-Neumann assignment at exterior vertices. For a prescribed primitive cycle or exterior-to-exterior path, we identify an arithmetic criterion ensuring that the corresponding scar is accessible by exact high-frequency eigenfunctions of a fixed target metric. The criterion is formulated by intersecting the regular scar stratum of the secular set with the orbit-closure torus of the target length vector, and it can hold for resonant metrics beyond the rationally independent class. Under an intrinsic Diophantine condition on the orbit-closure flow, the construction is quantitative: along an exact eigensequence the mass outside the prescribed support decays polynomially, yielding a polynomial degeneration law for finite-frequency observation when that support is uncontrolled. Rationally independent metrics have full phase-orbit closure and therefore make every primitive obstruction accessible. Combining this spectral result with the known graph-theoretic characterization and sufficiency of the Graph Geometric Control Condition (GGCC), we prove that, for every rationally independent and hence for Lebesgue-almost every metric, GGCC is necessary and sufficient for exact controllability at every positive time in the free setting.
Read the full abstract
Sound
Arti-JEPA: Adapting Video World Model to Real-Time MRI of the Vocal Tract for Speech-Production Analysis
Real-time MRI (rtMRI) captures the dynamics of the entire vocal tract during speech, but labeled data are scarce and the modality - single-slice, grayscale, low-resolution - differs substantially from the natural videos that video foundation models are trained on. We introduce Arti-JEPA, a joint embedding predictive architecture to model vocal tract rtMRI by continuing its self-supervised objective on about 62h of unlabelled vocal-tract videos, and evaluate the frozen representation on three tasks: cross-domain phoneme prediction (on typical speakers), fluent-vs-disfluent classification (a corpus containing stuttered speech), and characterizing pre/post-operative transfer (after partial glossectomy). Three key findings emerge. (1) A temporal video prior decisively outperforms per-frame image encoders, and latent prediction (V-JEPA) is at least as strong as pixel reconstruction (VideoMAE), with the edge on fine-grained phonemes. (2) Domain adaptation is task-dependent: it roughly doubles cross-domain phoneme prediction $\kappa$ (to 0.352) but does not help binary stuttering classification. (3) Arti-JEPA was able to recover phoneme signal from pre/post glossectomy speech — an in-domain probe decodes patients at least as well as a typical speaker, indicating that the residual transfer gap is cross-speaker/domain misalignment, not surgical signal loss, and post-operative decoding does not fall below performance on pre-operative speech. Together, these position a frozen, domain-adapted rtMRI encoder as a reusable measurement tool for articulatory and clinical speech science.
Read the full abstract
Optimization and Control
Closed-loop $\alpha$-Potential Stochastic Differential Games via a BSDE Approach
In this paper, we study the closed-loop $\alpha $-potential stochastic differential game (SDG) problem as a continuation of our prior research on open-loop control (see \cite{GLZ2025}). By utilizing the backward stochastic differential equation (BSDE) approach, we derive a precise estimate for the parameter $\alpha $. Compared to our earlier work \cite{GLZ2025}, this study incorporates both first- and second-order sensitivity state processes, as well as the sensitivity of the control process. A distinguishing feature of this work is that, in the context of $N$-player heterogeneous agent games involving mean-field type interactions, we derive an $N$-uniform upper bound for the minimal potential approximation error. In contrast to the corresponding open-loop estimates, the closed-loop bound contains feedback-induced contributions that need not vanish with $N$. Consequently, our present estimate does not in general guarantee $\alpha \rightarrow 0$.
Read the full abstract
General Relativity and Quantum Cosmology
Analytic motions of spinning particles in Schwarzschild-(anti-)de Sitter spacetime
The motion of a spinning test particle in a static, spherically symmetric spacetime with a cosmological constant is studied within the Mathisson-Papapetrou-Dixon formalism, working to linear order in the particle's spin. By exploiting the symmetries of the background, the radial and latitudinal dynamics are reduced to first-order equations governed by a spin-deformed quintic polynomial. A complete classification of the real root structure of this quintic is carried out, from which the allowed orbital types for spinning particles in the Schwarzschild-anti-de Sitter and Schwarzschild-de Sitter geometries follow directly. The parameter dependence of the root structure and of the stable circular orbit interval is analyzed. In particular, for values of the cosmological constant beyond the Stuchlík limit, where spinless particles admit no bound orbits, spinning particles can still remain bound. The radial motion is expressed piecewise in terms of Lauricella hypergeometric functions, with the simple positive real roots of the quintic acting as branch cuts. The latitudinal motion consists of small oscillations about an equatorial plane, and its phase, governed by the same quintic, admits an analogous analytic representation.
Read the full abstract
Artificial Intelligence
LexAgentHallu: A Hierarchical Benchmark for Profiling Hallucinations in Legal Agents
As large language models are increasingly deployed as tool-augmented legal agents, they introduce agentic hallucinations where tool-call and reasoning errors cascade into fabricated holdings and miscited authority. However, existing legal benchmarks evaluate only single-turn QA with outcome-level metrics, while agentic hallucination benchmarks lack legal-specific diagnostic capability. Neither answers to what extent and how a legal agent hallucinates along its trajectory. To address these limitations, we introduce LexAgentHallu, a legal agentic hallucination benchmark designed to evaluate to what extent and how legal agents fail along multi-step trajectories. Built through a four-stage expert-in-the-loop pipeline, LexAgentHallu contains 3414 instances across 17 legal categories and 6 task types. Each instance is annotated under a dual-layer hallucination taxonomy of 7 high-level categories and 27 fine-grained subclasses, covering both substantive errors and agent-procedural failures. We further design fine-grained metrics that quantify to what extent and localize how each failure occurs along an agent's execution path. Our evaluation across 18 proprietary and open-source agents uncovers a Right-Answer-Wrong-Reason effect and reveals that hallucination subclasses cluster rather than scatter, forming distinct agentic framework, legal task, and category profiles. These findings, invisible to outcome-level evaluation, validate the diagnostic power of LexAgentHallu for evaluating agentic hallucination in law.
Read the full abstract
Quantum Physics
Generalized Fidelity, the Data Processing Inequality, and Convexity
In this paper, we show that the generalized Bures–Wasserstein distance induced by the generalized fidelity fails the data processing inequality (DPI) in every dimension $n\geq2$. In dimension two, we derive three sufficient conditions guaranteeing the DPI by using an explicit formula for the real part of the generalized fidelity. Furthermore, we find a necessary and sufficient condition under which the generalized fidelity reduces to the Uhlmann fidelity. We also show that neither the generalized Bures–Wasserstein distance nor its square is convex in one state, even with the other state and the reference fixed, in every dimension $n\geq2$.
Read the full abstract
Robotics
HiRAD: A Flexible Large-Scale AGV Routing System
Automatic Guided Vehicles (AGVs) substantially boost warehouse throughput, but routing large-scale AGV fleets remains challenging. Classical Multi-Agent Pathfinding solvers suffer from exploding combinatorial complexity and super-quadratic runtime, while relying on idealized grid or piecewise-linear motion models that mismatch real-world kinematics. Recent Reinforcement Learning (RL) solutions improve flexibility via decentralized agent policies but depend on discretized spatiotemporal representations, require millions of episodes to converge, and incur full-map observation at every step, which leads to large models, slow convergence, and high inference latency that violates real-time industrial control constraints. To address these bottlenecks, we propose HiRAD, a hierarchical RL framework for continuous-space AGV routing with real-time guarantees: (1) a step-level spatiotemporal representation that translates continuous motion into a differentiable RL problem, (2) a hierarchical strategy that splits heading choice from velocity control to reduce the action space, and (3) an asynchronous event-driven decision pipeline that lowers inference complexity from O(n^2) to O(n) and cuts per-step latency by as much as 71 percent. Across random graphs and two warehouse maps, HiRAD reduces makespan by 45 percent to 63 percent and shortens end-to-end runtime.
Read the full abstract
Number Theory
An elementary approach to Sun Kim's general theta function identities
Ramanujan's modular equations of degrees $3$, $5$, $7$, $11$ and $23$ are closely related to certain theta function identities. Warnaar generalized the identities arising from the modular equations of degrees $3$ and $7$ to a general theta function identity. Kim subsequently obtained a further general theta function identity associated with the modular equations of degrees $5$, $11$ and $23$, and established several general theta function identities containing known partition theorems as special cases. In this paper, we present an elementary approach to Kim's general theta function identities, yielding $q$-series proofs of these identities within a common framework.
Read the full abstract
Differential Geometry
Product structures and decompositions of $\mathbb{Z}_2\times\mathbb{Z}_2$-symmetric spaces
In this paper, we establish the decomposition and product theory of $\Gamma$-symmetric spaces, where $\Gamma$ is isomorphic to $\mathbb{Z}_2\times\mathbb{Z}_2$. These results lead to the local classification of semisimple Riemannian $\mathbb{Z}_2\times\mathbb{Z}_2$-symmetric spaces of nontrivial type. Furthermore, we identify notable phenomena specific to $\mathbb{Z}_2\times\mathbb{Z}_2$-symmetric spaces: the existence of distinct product structures and that of an example with the trivial infinitesimal isotropy representation.
Read the full abstract
Rings and Algebras
A counterexample to Huang's weak majorization conjecture
We give a counterexample to a weak majorization problem, proposed by Z. Huang (Linear Algebra Appl., 434 (2) (2011) 457–462), for singular values of Hadamard products of nonnegative matrices. The problem asks whether, for all nonnegative matrices $A$ and $B$, \begin{equation*} \bigl\{s_j^2(A\Had B)\bigr\} \prec_w \bigl\{s_j(A\Had A)s_j(B\Had B)\bigr\} \end{equation*} holds, where $\Had$ denotes the Hadamard product, $\prec_w$ means weak majorization, and $s_j(\cdot)$ is the $j$th largest singular value of a matrix. To answer this problem, we construct two $3\times3$ entrywise positive symmetric matrices. We give rigorous upper and lower bounds for the relevant singular-value sums by Sturm's theorem, and show that the inequality fails for the partial sum with $k=2$.
Read the full abstract
Distributed Computing
Epoch: Compiling Diffusion Blocks for Sparse MoE Serving
Diffusion language models generate text by refining a fixed-size block of token positions through many forward passes, a loop that does not match the per-forward execution unit used by most LLM serving systems. A dense MoE runtime binds all work to the refinement-iteration clock: it rebuilds similar routing structure on every forward, recomputes expert outputs for positions whose logits are already dead, and sends those positions through dense expert-parallel collectives. This paper presents \sys{}, a serving system that treats the diffusion block as a compilation unit. \sys{} compiles a small block plan for the block-clock structure of one diffusion block and refreshes every value that can affect a live decode decision on the iteration clock. \sys{} realizes this plan along three dense axes of an MoE forward: \atlas{} compiles a coverage-driven active expert support per layer while recomputing gate logits every iteration; \lsp{} keeps full sequence shards as model state but routes only live, newly decoded, and refresh-required positions through fresh routed-expert computation; \freshlane{} carries this fresh token–expert worklist through expert-parallel dispatch, kernels, and combine, then restores the dense logical shard at the layer boundary. We implement \sys{} on 8 NVIDIA H100 GPUs and evaluate it on three open-weight block-diffusion MoE models (LLaDA-MoE, LLaDA2.0-mini, and LLaDA2.0-Flash, spanning 7B to 100B total parameters) across GSM8K, HumanEval, MGSM, and MT-Bench. \sys{} improves end-to-end execution time by up to 2.7$\times$ over the strongest surviving baseline under the same 8-GPU placement and remains feasible at the largest batch sizes where multiple baselines run out of memory, while preserving task quality relative to the dense reference.
Read the full abstract
Mathematical Physics
Euler-Poincare Reduction: A Geometric Treatment of the Relativistic Spinning Particle
The heavy top is a classic example of Euler-Poincare reduction on a semidirect product group, demonstrating how an advected quantity-the direction of gravity-couples to rotational motion. While the description of relativistic spinning particles via Lie group configurations is well established in Hamiltonian (symplectic) mechanics, we demonstrate that an explicit Lagrangian Euler-Poincare reduction provides a direct, transparent parallel to the heavy top. Specifically, we show that the free relativistic spinning particle on the Poincare group is the precise Lorentzian analog of this system, with spacetime position being the advected quantity. This geometric unification not only illuminates the underlying symmetry of both systems but also clarifies why the introduction of external electromagnetic fields leads to a partial reduction. Finally, we establish that the transition to left-trivialized coordinates acts as a geometric selection mechanism, naturally favoring a class of interaction Lagrangians where spin-field coupling manifests as a dynamical redefinition of the particle's mass.
Read the full abstract
Hardware Architecture
Minimal Deadlock-Free Routing for Degree-Six Triangular-Lattice Meshes and Tori with Two Forbidden Turns
Degree-six triangular-lattice interconnection networks offer substantial minimal-path diversity, but their additional directions complicate deadlock-free routing under wormhole flow control. We study a finite hexagon-shaped mesh and its periodic torus quotient in a common six-direction coordinate system. For the finite mesh, we construct a minimal partially adaptive routing relation that uses one virtual channel and forbids only two directed turns. For the torus, we prove that every source-destination pair has a unique closest lattice lift, but that the same two-turn physical routing relation still has a cyclic one-VC resource CDG for every n >= 3. We eliminate this residual periodic dependency by combining two virtual channels with Hamiltonian coordinates and group-specific datelines. Each same-group segment crosses its dateline at most once, which permits a global rank on VC-labelled channel resources. We prove minimal all-pairs connectivity for both physical routing relations and acyclicity of the complete resource CDG for the proposed one-VC mesh and two-VC torus constructions. For a single static bidirectional link failure known before a routing epoch, we further rotate the turn rule toward the failed orientation and replace a failed hop by a same-group two-hop triangle bypass. This restricted extension preserves all-pairs connectivity and the original VC counts, with at most one additional hop relative to the healthy shortest-path distance.
Read the full abstract
Robotics
PccDiffuser: Multi-solution Motion Planning for Continuum Robots
We present the PccDiffuser, a conditional diffusion framework for continuum robots that learns a multimodal distribution over complete configuration-space paths and samples multiple candidate solutions in parallel, which are subsequently converted into an executable trajectory by time allocation considering actuator constraints. Under the piecewise constant-curvature model, we use exponential co-ordinates to describe the robot kinematics, and use graph neural network to encode a variable number of environment obstacles. Analytical differential kinematics is incorporated in the denoising process to improve terminal accuracy and whole-body clearance. On a mixed test set comprising workspace with zero to four obstacles, PccDiffuser achieved a success rate of 91%. Compared with existing sampling- and optimisation-based benchmarks, it delivered both a higher success rate and greater computational efficiency, with the latter advantage becoming more substantial when sampling more candidate solutions. Experiments on a three-section tendon-driven continuum robot further demonstrate consecutive planning, multi-solution planning, and whole-body obstacle avoidance.
Read the full abstract
Applied Physics
Maximum signal-to-noise ratio enhancement by averaging under a limited measurement time
Averaging through repetitive measurement is a ubiquitous strategy for improving signal-to-noise ratio (SNR) and is commonly assumed to yield a $\sqrt{N}$ enhancement with the number of repetitions $N$. This assumption, however, implicitly requires the signal amplitude to be independent of measurement duration. This condition does not generally hold in dynamical sensing systems with finite response time and a fixed measurement time. We derive a closed-form expression for the SNR enhancement factor by analytically accounting for the competition between statistical noise reduction and dynamical signal attenuation, and demonstrate the existence of a strict upper bound on the SNR enhancement. The enhancement factor is a non-monotonic function of $N$ with a well-defined maximum at an optimal repetition number, beyond which further averaging degrades the SNR. Moreover, below a threshold set by the ratio of measurement time to response time, averaging yields no enhancement at all. These two regimes delimit where the conventional $\sqrt{N}$ law breaks down. Experimental validation using nanomechanical gas sensing, with two receptor-analyte systems deliberately chosen to bracket this enhancement transition, confirms the theoretical predictions. Our results show that measurement time is a finite resource to be optimally partitioned between signal accumulation and averaging, and provide a quantitative guideline for selecting the repetition number in time-constrained sensing such as real-time and repetitive gas or odor detection.
Read the full abstract
Optimization and Control
Heavy-Ball Method under Randomized Schedules
We study how predefined randomized parameter schedules accelerate the heavy-ball method on general smooth convex objectives. Our analysis distinguishes two levels of randomization: sampling gradient-evaluation times within intervals whose boundaries are deterministic, and additionally randomizing the time boundaries themselves. With deterministic time boundaries, we construct fixed-time and anytime schedules that achieve an expected last-iterate function value gap of order $\mathcal{O}(1/K^{4/3})$; the anytime schedule also satisfies the same rate almost surely. We then use randomized time boundaries and obtain the improved last-iterate rate $\mathcal{O}(1/K^{3/2})$, both in expectation and almost surely. To the best of our knowledge, this is the first global nonasymptotic convergence guarantee for the heavy-ball method on general smooth convex functions that improves polynomially over the classical $\mathcal{O}(1/K)$ rate. Our result shows that the heavy-ball method achieves a strictly better convergence rate than the best known result $\mathcal{O}(1/K^{\log_2(1+\sqrt{2})})$ attainable by plain gradient descent with silver stepsize schedules.
Read the full abstract
Distributed Computing
Breaking Fault Lines: Unifying TEE-Assisted BFT Consensus in Partially Trusted Worlds
This paper revisits TEE-assisted BFT under a universal partial-TEE model, where an arbitrary subset of replicas execute inside TEEs while the remaining replicas operate without hardware trust guarantees. We show that heterogeneous trust changes the structure of quorum formation and fault tolerance. In particular, we derive a tight resilience bound f < max {n/3, m/2}, where n is the total number of replicas and m is the number of TEE-enabled replicas. The result reveals a sharp threshold phenomenon: TEEs improve fault tolerance only once they exceed two-thirds of the deployment. Guided by this characterization, we introduce two protocol principles: (1) a dual-quorum construction that safely combines TEE-only and mixed quorums, and (2) a TEE-leader fast path that leverages hardware-enforced non-equivocation to reduce both consensus and view-change latency. We realize these ideas in Raftel, which is, to our knowledge, the first HotStuff-style BFT protocol designed explicitly for arbitrary partial-TEE deployments, and in chained-Raftel, a pipelined variant that further accelerates mixed-trust execution. We implement both protocols atop Intel SGX and evaluate them in LAN and WAN environments. Our results show that Raftel achieves up to 625 TPS with sub-670 ms latency in WAN settings, outperforming HotStuff by up to 308 TPS in throughput while approaching the performance of fully TEE-assisted protocols.
Read the full abstract
Strongly Correlated Electrons
Orbital-selective electronic modes induced by doping and originating from distinct spin excitations: an essential feature of orbital-selective Mott transition
The nature of the orbital-selective Mott transition (OSMT) remains elusive. This study shows that, by doping an orbitally degenerate spin-1 antiferromagnetic insulator in the Kanamori-Hubbard model, electronic modes emerge in the band gap in an orbital-selective manner, exhibiting momentum-shifted spin-mode dispersion relations. Electronic modes originating from conventional spin excitations, including the low-energy one, appear in the doped orbital, while those from inter-orbital spin excitations appear in the undoped orbital. These emergent modes constitute an essential feature of the OSMT.
Read the full abstract
Classical Analysis and ODEs
Mockenhaupt's Three-Term Hardy-Littlewood Majorant Conjecture
For an integer $k \ge 0$, let $f_k(x) = 1 + e(x) + e((k+2)x)$ and $g_k(x) = 1 + e(x) - e((k+2)x)$ on $\mathbb{T} = \mathbb{R}/\mathbb{Z}$, where $e(x) = e^{2\pi i x}$. Mockenhaupt conjectured that $\|g_k\|_{L^p(\mathbb{T})} > \|f_k\|_{L^p(\mathbb{T})}$ whenever $2k < p < 2k+2$. The conjecture was previously known for $k \le 5$. We give a single analytic proof valid for every $k \ge 4$; in particular, this settles all previously open cases $k \ge 6$ and establishes the conjecture for every $k \ge 0$. The proof reduces the norm comparison to resonant Fourier coefficients on the two-torus and represents these coefficients, after analytic continuation, by triple-Bessel integrals. Neumann's product formula and the Weber-Schafheitlin formula yield a quantitative positive lower bound for the leading mode, while the remaining odd modes are controlled by a uniform tail estimate. The leading mode is then shown to dominate the tail for every $k \ge 4$. AI Usage. The mathematical argument of this paper was produced by the auto-research system Apex Math, an AI system built by Apex Intelligence. See Appendix A for the complete AI usage statement.
Read the full abstract
Chaotic Dynamics
Dynamics Creation through Neural Dynamical Transfer Learning
Data-driven machine learning has established a robust foundation for reconstructing nonlinear dynamical systems from observations, primarily for the purposes of forecasting and control. However, most existing efforts focus on recovering specific observed dynamics rather than the generative synthesis of new ones. Inspired by image fusion and style transfer, we introduce a neural network framework termed Neural Dynamical Transfer Learning (NDTL) to create new systems with prescribed dynamics from pairs of parent nonlinear dynamical systems. By computing fundamental dynamical signatures, including the intrinsic dimension, the Kaplan-Yorke dimension, the invariant measure statistics, and the Lyapunov spectrum, we demonstrate that NDTL preserves key features inherited from the parent models while simultaneously generating novel dynamics. Beyond these validation examples, NDTL induces a criterion for dynamics classification, creates stable oscillatory coexistence in the Hastings-Powell food chain model, produces interpretable epidemiological models, and provides a chaotic source for image encryption.
Read the full abstract
Statistical Mechanics
Intermittent continuous-time random walks under renewal reset mechanism
Stochastic resetting as a practical and efficient search strategy in complex and disordered environments has long been a topic of interest to researchers. Based on the competition between jumping and resetting, this article proposes and investigates intermittent continuous-time random walks (CTRWs) under stochastic resetting, using the smaller waiting time for jump and reset as the renewal time, where the waiting times for both jump and reset can have arbitrary distributions. After each renewal event, the system will proceed with new waiting times for jump and reset regardless of their previous histories. We study the governing equation and Montroll-Weiss equation with renewal resetting, as well as the Markovian resetting for intermittent CTRWs. We prove the existence of non-equilibrium stationary states within the renewal reset mechanism when the jump and reset waiting times follow any exponential and power law distributions. For exponential and Gaussian distributed jump lengths, we examine the mean square displacements (MSDs) of particles to determine their monotonicity and asymptotic stability. Moreover, we calculate the first-arrival time to quantify search efficiency, and validate the intermittent CTRWs under renewal resetting lead to a finite mean first-arrival time (MFAT) to any fixed position for exponential jump and reset waiting time distributions (WTDs), power-law jump and exponential reset WTDs, as well as exponential jump and power-law reset WTDs. However, the MFAT diverges for power-law jump and reset WTDs. The intermittent CTRW model, which is based on the competition mechanism, can be applied to many physical scenarios, such as the foraging strategy of animals that return to their nests after an unsuccessful foraging attempt, or the work planning of intelligent robots that return to energy replenishment points after prolonged operation.
Read the full abstract
Computer Vision
Distilling Image Prototypes for Guided Test-Time Adaptation
Test-Time Adaptation (TTA) enhances the robustness of models against distribution shifts but faces two critical challenges: error accumulation from noisy pseudo-labels and catastrophic forgetting of source knowledge. Uncertainty-based approaches designed to mitigate error accumulation often yield overconfident or computationally expensive estimates, while strategies intended to prevent forgetting via prototype replay rely on static representations that easily become misaligned as the model adapts. To address these issues, this paper proposes a novel framework, Distilling Image Prototype for Guided Test-Time Adaptation (DIPTTA). The core of the proposed approach is the introduction of a Distill Image Prototype (DIP), a compact set of synthetic images that serves as a dynamic and regenerative anchor of source knowledge. This prototype enables a dynamic feature replay mechanism that continuously generates feature prototypes aligned with the current state of the model, thus effectively preventing catastrophic forgetting. Furthermore, the DIP anchors a source-calibrated uncertainty estimation method, which provides a less biased measure of sample reliability by leveraging stable source knowledge, thereby robustly suppressing error accumulation. Extensive experiments on multiple benchmarks demonstrate that DIPTTA significantly outperforms state-of-the-art methods, particularly under severe domain shifts. The source code is available at https://github.com/LiwenWang919/DIPTTA.
Read the full abstract
Computer Vision
IAE-VTG: Interaction-Aligned Action-Entity Video Temporal Grounding
Video Temporal Grounding (VTG) localizes the video segment that matches a natural-language query. Many queries describe an action performed by a particular entity. Existing methods often encode the query as a whole or use general video-text interactions, without explicitly checking whether the action and entity occur together. They may therefore select a segment that contains both concepts but not the event described by the query. We propose Interaction Aligned Action-Entity Video Temporal Grounding (IAE-VTG), which models this rela?tionship at both the representation and training assignment levels. First, the Fine-grained Disentangled Interaction Module (FDIM) separates action and entity related query information and aligns it with complementary motion and appearance features. It then combines token-level interactions to build representations that capture the relationship between the action and entity. Second, Interaction-Sensitive Assignment (ISA) adds this interaction evidence to bipartite matching, so training targets are selected using both temporal overlap and semantic compatibility. This reduces supervision from temporally plausible but semantically incorrect proposals. Experiments on QVHighlights, Charades?STA, and TACoS show that IAE-VTG consistently improves strong baselines and achieves competitive or state-of-the-art performance on standard grounding metrics. Additional analyses show that the method is especially effective when similar actions or entities appear at multiple times and produces more reliable assignments for complex events.
Read the full abstract
Artificial Intelligence
Can Artificial Intelligence Support Healthcare and Mental Health Through Early Cyberbullying Detection ? The Impact of Emotion-Aware AI on Proactive Online Safety
Healthcare systems, mental health, and public well-being are increasingly affected by cyberbullying and harmful online interactions. This paper presents CareGuard, an early-warning framework designed to support healthcare-driven mental health protection and proactive online safety through the detection of cyberbullying-related content using advanced natural language processing techniques. CareGuard integrates zero-shot semantic labeling with fine-tuned transformer-based models, including BERT, DistilBERT, and RoBERTa, to enable robust and context-aware classification across sensitive cyberbullying categories. To improve efficiency and reduce unnecessary computation in healthcare-oriented monitoring settings, the framework incorporates an emotion-aware filtering mechanism alongside cosine similarity-based semantic screening, allowing the system to focus on semantically relevant and emotionally salient content. Experimental results on benchmark datasets demonstrate that CareGuard effectively balances detection accuracy and computational efficiency, highlighting its potential for scalable deployment in healthcare systems, mental health monitoring, and online safety applications.