Search arXiv⌕ Search

arXiv subjects

Jing Guo

Publications and source records attributed to Jing Guo.

At least 19 recordsLinked to original sources

Collective Loss of Control in LLM Agent Systems: An Epidemic Account of Mutation, Contagion, and Recovery

How does a multi-agent system evolve from a local deviation into collective loss of control? We propose an epidemic explanation organized around accidental mutation, contagion, and recovery. A spontaneous deviation creates a seed; communication enables other agents to adopt and retransmit its unsafe strategy; collective failure can emerge when propagation outpaces correction and containment. Thus, rare individual deviations can coexist with substantial collective risk. Motivated by reported OpenAI agent coordination incidents, we examine two ingredients of this mechanism. A deployment audit identifies implicit communication paths between nominally independent evaluation runs and verifies transport through a default Docker backend. RogueHandoff-20, a benchmark of 20 executable scenarios, tests recipient susceptibility by injecting unsafe trajectories generated by a modified Qwen-27B route. Across four native-pending routes, executed harm is 0-5% on normal tasks and 40-95% after injection, exceeding paired direct malicious requests by 5-45 percentage points. These results support low observed baseline harm alongside high conditional susceptibility; they do not establish natural rare-event rates or demonstrate an autonomous cascade. The account motivates complementary defenses: strengthen resistance and recovery alongside prevention of spontaneous deviations, and audit and restrict unintended communication paths that can turn local failures into collective loss of control.

cs.AI↗

The Missing Boundary: How Autonomous Agents Lose Control

Autonomous agents increasingly perform long-horizon tasks involving tool use, persistent state, and consequential actions, raising a fundamental question: \emph{under what conditions does an agent cross the boundary of authorized execution while pursuing a legitimate task?} Existing studies often attribute such failures to adversarial instructions, malicious environments, or conflicting objectives, leaving unclear how loss of control can emerge during otherwise legitimate task execution. We study this question by independently manipulating three factors: goal pressure, control degradation, and executable unsafe opportunity. Our central hypothesis is that a degraded control boundary becomes consequential when the environment exposes an executable action that crosses it, even when the underlying task remains legitimate and a sanctioned path remains feasible. We test this hypothesis in a deterministic multi-turn environment across five agent models and 16 operational domains. Across 1,800 unique trajectories, we find that neither degraded control nor unsafe opportunity alone produces substantial loss of control; when both are present, the loss-of-control rate reaches $55\%$ in the full-factorial study and $62\%$ across ten additional operational domains. Restoring the original control boundary reduces the rate to $0\%$ even when the unsafe action remains executable. A context-management ablation further shows that compaction itself is not harmful: preserving the control constraints yields $0\%$ loss of control, whereas omitting them increases the rate to $87\%$. These results show how a latent loss of control can become an external violation: the task objective remains intact, but an executable opportunity can turn a missing control boundary into consequential action. Our code will be made publicly available at https://github.com/Tencent/AI-Infra-Guard/tree/main/Research/forge_bench.

cs.CR↗

Runge--Kutta generalized Convolution Quadrature for sectorial problems

We study the application of the generalized convolution quadrature (gCQ) based on Runge--Kutta methods to approximate the solution of an important class of sectorial problems. The gCQ generalizes Lubich's original convolution quadrature (CQ) to variable steps. High-order versions of the gCQ have been developed in the last decade, relying on certain Runge--Kutta methods. The Runge--Kutta based gCQ has been studied so far in a rather general setting, which includes applications to boundary integral formulations of wave problems. The more general stability and convergence results for these new methods are suboptimal compared to those known for the uniform-step CQ, both in terms of convergence order and regularity requirements of the data. Here we restrict the class of problems under study and focus on a special type of sectorial problems. We prove that for this important class of applications it is possible to achieve the same order of convergence as for the original CQ, under the same regularity hypotheses on the data, and for very general time meshes. In the particular case of data with some known algebraic type of singularity, we also show how to choose an optimally graded time mesh to achieve convergence with maximal order, overcoming the well-known order reduction of the original CQ in these situations. An important advantage of the gCQ method is that it allows for a fast and memory-efficient implementation. We describe how the fast and oblivious Runge--Kutta based gCQ can be implemented and illustrate our theoretical results with several numerical experiments. The codes implementing the examples are available in [14]. To the best of our knowledge, comparable methods for the class of problems considered here do not currently offer the same combination of stability, high-order convergence, variable time steps, and reduced memory requirements and computational complexity.

math.NA↗

Long-time stability analysis of an explicit exponential Runge-Kutta scheme for Cahn-Hilliard equations

In this paper, we present a rigorous long-time stability analysis of a second-order explicit exponential Runge--Kutta (ERK2) method for the Cahn--Hilliard equation. By employing Fourier spectral collocation in space and a two-stage ERK2 scheme in time, we construct a fully discrete numerical method and establish an energy dissipation law for the original energy. The numerical solution is proven to be uniformly bounded in time in the discrete $H^1$ and $H^2$ norms, provided that the time step size is sufficiently small. An $\ell^\infty$ bound is then derived through a discrete Sobolev inequality. These bounds remove the typical a priori maximum-norm assumption required in previous energy-stability analyses and allow the energy dissipation criterion to be closed for the fully discrete scheme. Building on this uniform boundedness, we derive an optimal-order error estimate in the $\ell^2$ norm. The analytical framework developed here is general and can be extended to higher-order exponential integrators for a broader class of phase-field models.

math.NA↗

StepAudio 3 Music Technical Report

We introduce StepAudio 3 Music, a large-scale, long-form music generation model that supports explicit musical planning and open-domain text-controlled generation. The StepAudio Music Tokenizer represents audio as a 50-Hz stream from a 65536-entry single codebook, using semantically informed self-supervised and multi-task training to preserve musical structure and reconstruction-relevant information. A flow-matching diffusion Transformer (DiT) predicts continuous StepAudio VAE latents, which our VAE decoder converts into 48-kHz audio. This discrete-continuous design is guided by comparisons of single-codebook VQ, Semantic and Acoustic RVQ, and different DiT configurations. For explicit planning, a Mixture-of-Experts autoregressive model uses ABC notation to produce an intermediate arrangement plan (ABC-CoT) before predicting music tokens, making harmony, rhythm, and melodic structure part of the generation context. A progressive training curriculum and supervised fine-tuning support song and instrumental generation, accompaniment generation from dry vocals, and cover-song synthesis for up to 5 minutes and 30 seconds. With reinforcement learning via direct preference optimization (DPO), the final model achieves the highest AudioBox Content Enjoyment, Content Usefulness, and Production Quality scores and the highest MuQ-MuLan similarity among the evaluated systems, with competitive SongBench results. On the preliminary Artificial Analysis Music Arena Vocals leaderboard, it obtains a Quality Elo of 1105, behind only Suno V5.5 and Mureka and ahead of Suno V5, MiniMax models, and other systems. Audio demonstrations are available at https://stepaudiollm.github.io/step-audio-3-music.

eess.AS↗

The Cartesian product of exact approximation sets

We determine the Hausdorff and packing dimensions of Cartesian products of one-dimensional exact approximation sets. Our main result establishes the exact-approximation counterpart of the recent product theorem of Wang and Wu (2024) for limsup approximation sets, showing that passing to the substantially smaller exact approximation sets (liminf sets) does not reduce the Hausdorff dimension of the Cartesian product. One of the key ingredients is a refinement of the well-distributed-system framework of Bandi--Ghosh--Nandi (2023) by exploiting the fine arithmetic distribution of rational points which then gives the Hausdorff dimension of the product set under a weaker convergence condition.

math.NT↗

Ultra-wideband MRE of the human liver and spleen for viscoelastic model identification in hepatic inflammation

Magnetic resonance elastography (MRE) is established for noninvasive assessment of liver fibrosis. Conventional abdominal MRE is typically limited to 40-60 Hz. Lower frequencies remain largely unexplored, particularly with regard to hepatic inflammation. We developed ultra-wideband MRE covering 5-80 Hz to investigate frequency-resolved viscoelastic dispersion of the liver and spleen and to identify biomechanical markers of hepatic inflammation. Following phantom validation, nine healthy volunteers and nine patients with inflammatory liver disease were examined at 12 frequencies. Spatiotemporal phase unwrapping and frequency-adaptive wavefield preprocessing enabled reconstruction of shear wave speed (SWS), penetration rate (PR), and loss angle ($ϕ$). Six rheological models were evaluated. The largest inflammation-associated changes were observed at frequencies below 20 Hz: $ϕ$ increased by 63% (p<0.001), PR decreased by 37% (p=0.003), and SWS increased by 8% (p=0.008), indicating predominantly dissipative, rather than stiffness-related, changes and a shift toward fluid-like behavior with minor stiffness changes in the lower frequency regime. The rheological springpot model with serial dashpot provided the best fit and revealed distinct dispersion functions for liver and spleen. In patients, springpot elastic modulus increased (101%, p=0.001), while viscosity and springpot power-law exponent decreased (52%, p=0.002 and 58%, p<0.001) suggesting a shift from soft-fluid to stiff-solid liver properties. Ultra-wideband MRE revealed that inflammatory liver disease is associated with property shifts toward stronger dissipation and fluid-like behavior at low frequencies while displaying solid-like behavior at higher frequencies. Ultra-low frequency MRE may provide a diagnostic window into inflammation-associated liver viscoelasticity without full rheological modeling.

physics.med-ph↗

Security Assessment of DeepSeek Harness with A.I.G: Evaluating Resistance to Indirect Prompt Injection

We assess indirect prompt injection in DeepSeek Harness (DSH), using AI-Infra-Guard (A.I.G) to construct tests, deliver controlled taint, execute DSH, collect traces, and judge outcomes. The study covers 14,560 controlled executions over 16 indirect-content channels, text and file carrier modes, 35 payload objectives, one unmodified baseline, and 12 attack methods. The experiment preserves DSH's agent loop, tool registry, model adapter, and session-event path; source tools and sensitive sinks are local fixtures, so attempted actions are recorded without external side effects. We evaluate each trace with a deterministic rule-based judge, \JudgeR{} (RuleJudge), and a semantic LLM-based judge, \JudgeL{} (LLMJudge). The strongest observed attack success rates are 17.0% under \JudgeL{} for fake-completion attack in text mode, 25.5% under \JudgeR{} for hidden Unicode in file mode, and 16.0% under \JudgeR{} for the skills channel in file mode. \JudgeL{} also assigns partial compliance more often than \JudgeR{} (7.3% versus 2.0%). We relate these results to DSH's treatment of tool results, additional contexts, and tool-call policy hooks, then identify controls that should sit between untrusted content and sensitive actions. Our code is available at https://github.com/Tencent/AI-Infra-Guard/tree/main/Research/deepseek-harness-security-assessment .

cs.CR↗

Ventor-QTest: Threat-Model-Driven Verification of Vendor-Hosted LLM APIs

As large language models become increasingly widespread, third-party providers that deploy open-weight models have become an important part of the ecosystem. Auditing the quality of their inference APIs is therefore an open problem. We formalize hosted model routing as a stochastic process and propose \mbox{\textbf{Ventor-QTest}}, a composite black-box audit that requires no probability information from the target API. Its repeated-request component sends each frozen constrained context to the target multiple times, reconstructs a categorical output distribution from the returned text counts, and reports \emph{average fidelity loss} (AFL) as a null-bias-corrected, within-window mean coarsened-KL statistic. Its long-sequence component uses independent runs to report \emph{extreme fidelity loss} (EFL) through the empirical upper tail of a run-level reference-centered-surprisal statistic. Across three logprob-capable route conditions, AFL shows strong linear descriptive agreement with a logprob-derived coarsened-KL comparator. Across seven route snapshots, 20-run sequence probes reveal route-specific EFL variation. AFL and EFL have little detectable route-level association with GPQA-Diamond accuracy. In contrast, pronounced EFL coincides with a decline in Terminal-Bench pass rate as task exposure increases. This pattern may arise because correctness in long-horizon tasks is more sensitive to extreme fidelity loss. These results motivate reporting AFL and EFL jointly, particularly when auditing long-horizon agentic tasks. The open-source implementation is available at https://github.com/Tencent/AI-Infra-Guard/tree/main/services/api_checker/ventor_qtest.

cs.CR↗

SkillJack: Persistent Skill Backdoors in Self-Evolving Agents

Self-evolving agents increasingly convert interaction histories into reusable skills that persist beyond individual tasks. While prior work studies memory and retrieval poisoning, such attacks only affect agents when poisoned records are retrieved as context. We uncover a new and more fundamental risk: poisoned experiences can be transformed by the agent itself into durable behavioral artifacts. We present \textbf{SkillJack}, the first attack that exploits the experience-to-skill pipeline of self-evolving agents. Instead of directly manipulating runtime context, SkillJack hijacks the agent's own learning process to implant malicious behaviors into its reusable skill repertoire. We identify three key properties of this transformation: \emph{sanitization whitewashing}, where malicious intent is obscured during skill extraction; \emph{cross-layer promotion}, where transient experiences become persistent capabilities; and \emph{persistence isolation}, where the attack survives removal of its original source records. We evaluate SkillJack on two representative systems, SkillX and Anything2Skill, using a shared dataset of 150 trajectories across four policy-risk categories. Results show that skill extraction substantially reduces attack detectability: in SkillX, safety detection drops from 98.5\% for poisoned trajectories to 11.4\% for extracted skills, while Anything2Skill shows a similar effect. Meanwhile, the implanted skills remain effective, achieving attack success rates of 56.2\% and 89.2\% on the two systems, respectively. Furthermore, 80.0\% of skill-mediated attacks persist after deleting the original poisoned records, and some skills unintentionally activate on benign queries. Our findings reveal skill evolution as a new attack surface and motivate provenance-aware skill lifecycle protection. Our code is available at https://github.com/Tencent/AI-Infra-Guard/research/skilljack.

cs.CR↗

GenVid2Robot: From Video Generation to Robot Manipulation via Rigid-Geometric Consistency

Generated videos provide useful visual motion priors for robot manipulation, but their visual plausibility does not imply physical executability. A generated video usually lacks metric geometry, grasp grounding, robot kinematic feasibility, and execution-time feedback, which makes direct trajectory replay unreliable in real-world manipulation. This paper presents GenVid2Robot, a rigid-geometric consistency framework that converts generated video motion into executable real-robot manipulation trajectories. Given an initial RGB-D observation and a task instruction, GenVid2Robot samples task-relevant semantic anchors from the real first frame, tracks these anchors through generated video candidates, and verifies whether the resulting 2D motion can be explained by first-frame RGB-D anchors under a sparse relative $SE(3)$ model. In this way, generated videos are treated as uncertain visual motion hypotheses rather than direct robot demonstrations. Only geometrically consistent motion is transferred to the robot. The accepted relative motion is then applied to the real grasp-time TCP pose selected by mask-constrained grasping, producing a grasp-conditioned execution trajectory that is consistent with both the visual motion prior and the physical grasp configuration. To reduce execution mismatch caused by RGB-D noise, calibration residuals, and small contact-induced displacement, a bounded depth-compensation module corrects local depth-direction errors without assuming full online replanning. Real-robot experiments demonstrate that GenVid2Robot improves the reliability of generated-video-guided manipulation by grounding visual motion priors with sparse metric geometry, grasp constraints, robot feasibility checking, and bounded execution feedback.

cs.RO↗

In Vivo Quantification of Glioma-Induced Solid Stress Using MR Elastography and Deformable Image Registration

Solid stress is increasingly being recognized as a key driver of tumor progression and aggressiveness, yet it has not been directly measured in patients so far. Here, we combine multifrequency magnetic resonance elastography with 3D magnetic resonance imaging (MRI)-based diffeomorphic deformable image registration network analysis to noninvasively quantify glioma-induced solid stress. In both a mouse model and patients, we identified spatially heterogeneous deformation patterns extending well beyond tumor margins. While deformation magnitude was not found to correlate with tumor size or clinical outcome, excess solid stress - defined as the product of peritumoral volumetric strain and stiffness differential between unaffected brain and peritumoral tissue - was inversely associated with patient survival, highlighting its potential as a quantitative, imaging-derived biomarker. To our knowledge, this study provides the first direct quantification of mechanical stress in patients with glioma.

physics.med-ph↗

QEDBENCH: Quantifying the Alignment Gap in Automated Evaluation of University-Level Mathematical Proofs

As Large Language Models (LLMs) saturate elementary benchmarks, the research frontier has shifted from generation to the reliability of automated evaluation. We demonstrate that standard "LLM-as-a-Judge" protocols suffer from a systematic Alignment Gap when applied to upper-undergraduate to early graduate level mathematics. To quantify this, we introduce QEDBench, the first large-scale dual-rubric alignment benchmark to systematically measure alignment with human experts on university-level math proofs by contrasting course-specific rubrics against expert common knowledge criteria. By deploying a dual-evaluation matrix (7 judges x 5 solvers) against 1,000+ hours of human evaluation, we reveal that certain frontier evaluators like Claude Opus 4.5, DeepSeek-V3, Qwen 2.5 Max, and Llama 4 Maverick exhibit significant positive bias (up to +0.18, +0.20, +0.30, +0.36 mean score inflation, respectively). Furthermore, we uncover a critical reasoning gap in the discrete domain: while Gemini 3.0 Pro achieves state-of-the-art performance (0.91 average human evaluation score), other reasoning models like GPT-5 Pro and Claude Sonnet 4.5 see their performance significantly degrade in discrete domains. Specifically, their average human evaluation scores drop to 0.72 and 0.63 in Discrete Math, and to 0.74 and 0.50 in Graph Theory. In addition to these research results, we also release QEDBench as a public benchmark for evaluating and improving AI judges. Our benchmark is publicly published at https://github.com/qqliu/Yale-QEDBench.

cs.LG↗

Photoionization of the Composite Nebula Surrounding NGC 5408 X-1: Implications for Beamed Emission

NGC 5408 X-1 is one of the best studied ultraluminous X-ray sources (ULXs) and is surrounded by a photoionized nebula. Previous optical spectroscopy established the presence of strong Balmer, [O III], and He II $\lambda4686$ emission from the nebula, but the powering engine remains uncertain. In this work, we present new integral-field observations of NGC 5408 X-1, supplemented by archival long-slit spectroscopy and Hubble Space Telescope (HST) imaging, and confirm the presence of a composite nebula, with a small He III region centered on the ULX and a large, shell-like H II region. We also confirm that the broad He II emission is point-like and most likely associated with the ULX binary system. Photoionization simulations with Cloudy show that the ULX spectral energy distribution (SED), with a total luminosity of $2.4 \times 10^{40}\ {\rm erg\ s^{-1}}$ obtained by fitting the optical/UV/X-ray data, overpredicts both the luminosity and size of the He III region. Instead, adopting the same SED shape with a reduced luminosity of $1.0 \times 10^{39}\ {\rm erg\ s^{-1}}$ together with a blackbody of temperature $30000\ {\rm K}$ and luminosity $1.3 \times 10^{39}\ {\rm erg\ s^{-1}}$ successfully reproduces both the He III and H II regions in terms of their luminosities and sizes. Such a dual-component ionizing spectrum is consistent with HST measurements of the ULX in the optical and UV, while being a factor of 24 lower than the inferred isotropic X-ray luminosity. This implies that the EUV and X-ray emission from the ULX may be mildly beamed toward our line of sight, consistent with the picture of supercritical accretion.

astro-ph.HE↗

Securing the AI Agent: A Unified Framework for Multi-Layer Agent Red Teaming

The fast growth of open-source AI infrastructure, from model serving engines and agent platforms to the Model Context Protocol (MCP) ecosystem and the language models themselves, has outpaced the security tooling available to defend it. We present AI-Infra-Guard, an open-source framework that organizes AI red teaming around a single observation: the attack surface of an AI agent is stratified across layers (infrastructure, protocol/tool, agent behavior, and model), and no single detection paradigm fits all of them. The framework therefore matches a paradigm to each layer, from deterministic rule matching over 75+ AI components and 1{,}400+ vulnerability rules, through LLM-driven agentic auditing of MCP servers and agent-skill packages and multi-turn black-box agent red teaming, to a jailbreak harness with 26+ attack operators over sixteen datasets. To our knowledge it is the only open-source framework to span all of these, including supply-chain auditing of the agent skills that increasingly extend AI agents. We release AI-Infra-Guard as open source so that \emph{layer-paradigm matching} can serve as a practical foundation for agent security and a shared base for the community to build on.

cs.CR↗

ILPU: Iterative Laplace-Based Phase Unwrapping via Bi-Level Optimization

Phase unwrapping is an essential preprocessing step for phase-based MRI applications, including susceptibility mapping, field mapping, thermometry, and MR elastography. We present Iterative Laplace-Based Phase Unwrapping (ILPU), a bi-level optimization algorithm. In this method, a lower-level solver recovers a continuous phase increment from an incremental Poisson equation using the discrete cosine transform (DCT), while an upper-level solver refines an integer offset map through quality-guided spatial regularization and a restricted local search. This coupling enables robust unwrapping in low-SNR regions through adaptive smoothness penalties and quality-weighted regularization. We evaluated ILPU on 2D and 3D brain MRI phase images against manually unwrapped reference data, using standard Laplace unwrapping, Flynn, and SEGUE as comparison methods. In 2D, ILPU achieves accuracy comparable to SEGUE. In 3D, ILPU attains a relative error of 2.12% compared with 67.59% for SEGUE and 81.02% for Laplace, demonstrating a clear advantage in volumetric unwrapping. The algorithm has O(N log N) complexity per iteration through DCT-based Laplacian estimation and is numerically faster than both Flynn and SEGUE while preserving superior accuracy. These results indicate that the bi-level optimization framework provides a robust and computationally efficient solution for phase unwrapping in MRI.

math.OC↗

A Reconstruction System for Industrial Pipeline Inner Walls Using Panoramic Image Stitching with Endoscopic Imaging

Visual analysis and reconstruction of pipeline inner walls remain challenging in industrial inspection scenarios. This paper presents a dedicated reconstruction system for pipeline inner walls via industrial endoscopes, which is built on panoramic image stitching technology. Equipped with a custom graphical user interface (GUI), the system extracts key frames from endoscope video footage, and integrates polar coordinate transformation with image stitching techniques to unwrap annular video frames of pipeline inner walls into planar panoramic images. Experimental results demonstrate that the proposed method enables efficient processing of industrial endoscope videos, and the generated panoramic stitched images preserve all detailed features of pipeline inner walls in their entirety. This provides intuitive and accurate visual support for defect detection and condition assessment of pipeline inner walls. In comparison with the traditional frame-by-frame video review method, the proposed approach significantly elevates the efficiency of pipeline inner wall reconstruction and exhibits considerable engineering application value.

cs.CV↗

InSpatio-WorldFM: An Open-Source Real-Time Generative Frame Model

We present InSpatio-WorldFM, an open-source real-time frame model for spatial intelligence. Unlike video-based world models that rely on sequential frame generation and incur substantial latency due to window-level processing, InSpatio-WorldFM adopts a frame-based paradigm that generates each frame independently, enabling low-latency real-time spatial inference. By enforcing multi-view spatial consistency through explicit 3D anchors and implicit spatial memory, the model preserves global scene geometry while maintaining fine-grained visual details across viewpoint changes. We further introduce a progressive three-stage training pipeline that transforms a pretrained image diffusion model into a controllable frame model and finally into a real-time generator through few-step distillation. Experimental results show that InSpatio-WorldFM achieves strong multi-view consistency while supporting interactive exploration on consumer-grade GPUs, providing an efficient alternative to traditional video-based world models for real-time world simulation.

cs.CV↗