Search arXiv⌕ Search

arXiv subjects

Liang Chen

Publications and source records attributed to Liang Chen.

At least 55 records · Page 3Linked to original sources
arXiv2026

Jet Power, Bulk Lorentz Factor, Black Hole Spin, and Magnetic Field of Accretion Disk in Jetted Active Galactic Nuclei: A Large Gamma-Ray Emission Sample

We present a catalog of physical parameters for powerful jet-accretion disk-black hole systems in one of the largest samples of gamma-ray emitting jetted active galactic nuclei (AGNs), including jet kinetic and radiative powers, jet radiative efficiencies, bulk Lorentz factors, black hole spins, accretion-disk magnetic fields and Compton dominance. Comparing jet kinetic power estimators for blazars, values derived from spectral energy distribution (SED) fitting tend to exceed those estimated via cavity power and other scaling relations. For radiatively efficient AGNs, most sources are inferred to possess high spins; for radiatively inefficient AGNs, many potentially have high spins, though some may differ. This indicates that black hole spin does not effectively distinguish radiatively efficient from inefficient jetted AGNs. Our results suggest accretion-disk magnetic field strength as a key discriminator, proposing a tentative dividing value of $\approx 10^{3.9}$ Gauss between radiatively efficient and inefficient populations. Jet power and bulk Lorentz factor exhibit significant correlations with black hole mass in radiatively efficient AGNs, while weak-to-moderate correlations are observed in radiatively inefficient AGNs within narrow accretion-rate bins. Our analysis reveals that jet power correlates with both disk luminosity and magnetic field strength. Furthermore, correlations linking Eddington ratio and Compton dominance with jet properties are consistent with the jet-accretion connection. Finally, jet radiative power and bulk Lorentz factor show a potential dependence on black hole spin. These results are consistent with the scenario in which jets are powered and accelerated by energy extraction from rapidly spinning black holes via accretion-disk magnetic fields.

astro-ph.HE↗
arXiv2026

A scalable chip-integrated single-photon source array based on 50 individually addressable neutral atoms

Scalable arrays of identical single-photon sources are a central resource for photonic quantum information processing, quantum networks and quantum metrology. Neutral atoms provide intrinsically identical emitters that can be assembled and rearranged in optical tweezers, but a many-channel fiber interface to individually trapped atoms has remained a major technical challenge. Here we demonstrate a chip-interfaced single-photon source array based on 50 individually addressable $^{87}\mathrm{Rb}$ atoms. A glass waveguide fan-out converts the \SI{5}{\micro m} pitch of the optical-tweezer array to the \SI{127}{\micro m} pitch of a commercial fiber array, mapping each atom to its own waveguide, fiber and single-photon detector. We resolve all 50 channels with an average nearest-neighbor cross-talk of $0.4\%$ and a uniform insertion loss of \SI{2.9}{dB}, and verify single-photon emission with $g^{(2)}(0)=0.29$, presently limited by detector dark counts and residual cooling-light scattering. Combining per-channel atom discrimination, rearrangement and reservoir replenishment, we prepare source subarrays of up to 24 atoms with a $93\%$ fill fraction. For small target numbers, atom loss is repaired from the reservoir at the detection-limited rate of \SI{118}{Hz}. We further fabricate a 784-channel waveguide chip, showing that the photonic interface can be extended well beyond the present number. This architecture establishes a fiber-native neutral-atom platform for larger arrays of identical single-photon sources.

physics.atom-ph↗
arXiv2026

MedClaw: Heuristic Agent Harness for Long-Horizon Surgical Video Reasoning

Understanding tens-of-minutes surgical videos requires long-horizon temporal reasoning, answering what happens before, after, or across stages of a procedure by grounding the question in visual evidence spread across time. Existing approaches handle this poorly: a one-shot vision-language model (VLM) compresses the whole procedure to fit its context window and loses the detail a "before" or "after" question depends on, while video agents that train the model where to look are data-hungry and transfer poorly to out-of-domain surgery. We build an agent harness that separates reasoning from perception and improves by evolving context rather than optimizing weights. A text-only orchestrator plans which evidence to gather and issues an auditable sequence of tool calls, while frozen vision-language sub-agents execute each call over the pixels, viewing, cropping, inspecting frames, and retrieving external knowledge. We further propose a gradient-free, reward-gated Heuristic Skill Distillation loop that mines the agent's own low-scoring traces and keeps a candidate skill only when it raises a validation reward, yielding reusable retrieval skills, notably directed re-look. Growing an external skill library rather than tuning weights, the loop adapts from only about 100 labeled examples, far fewer than supervised or reinforcement fine-tuning requires. To evaluate this agent, we introduce MedClawBench, a de-leaked, doctor-grounded benchmark of 1,123 questions over self-built long neurosurgery recordings and a held-out public lecture-video test split. Across both datasets and all four evaluation dimensions, our agent consistently outperforms one-shot VLMs and general video-agent frameworks, with the largest gains on the long, out-of-domain neurosurgery videos. Project page: https://fyycs.github.io/medclaw/.

cs.CV↗
arXiv2026

MindMemOS: A Portable and Self-Evolving Memory Operating Layer for AI Agents

Memory is a core component of AI agents, enabling them to accumulate experience, maintain personalization, and adapt over long-term interactions. However, existing memory systems often remain fixed after development, limiting their ability to adapt their memory models, organization strategies, and procedural knowledge through continued use. We present MindMemOS, a portable and self-evolving memory operating layer that organizes open-world information using a unified entity property timestructure. MindMemOS supports scenario-adaptive memory modeling, higher-order pattern discovery, autonomous memory refinement, and continuous skill evolution. Its MindMemEvolve algorithm employs validation-driven evolutionary search to optimize memory schemas for target scenarios, whiledreaming consolidates accumulated memories by merging redundant records and resolving conflicts. In addition, implicit corrective feedback serves as a human-in-the-loop signal for identifying and revising potentially inaccurate or misaligned memories. Its MindSkillEvolve algorithm further transforms agent execution trajectories into reusable and progressively refined skills. MindMemOS achieves 94.03% accuracy on LOCOMO and 70.63% on PersonaMem. MindSkillEvolve improves SpreadsheetBench success by 9.2 percentage points over the initial-skill baseline.

cs.AI↗
arXiv2026

Anisotropic Particle Transport from a Pulsar Wind Nebula Revealed by Einstein Probe and LHAASO

Pulsar wind nebulae (PWNe) are major cosmic ray accelerators, yet the mechanisms transporting high-energy particles into the interstellar medium remain elusive. Building on the LHAASO discovery of an ultra-high-energy (UHE) $γ$-ray source near the bow-shock PWN powered by the pulsar PSR J1740+1000, we present a joint Einstein Probe (EP) and LHAASO study of this system. EP observations reveal an extended X-ray tail far exceeding the structure previously seen by XMM-Newton. Updated LHAASO observations show that the $γ$-ray emission is elongated, with its major axis aligned with the extended X-ray tail revealed by EP. This is the first detection of an X-ray pulsar tail associated with a spatially coincident extended UHE $γ$-ray emission. The X-ray and $γ$-ray spectrum can be well explained with a single population of relativistic electrons via synchrotron and inverse Compton radiation, respectively, removing the need for particle re-acceleration during propagation. The results unambiguously show that electrons/positrons above 100 TeV are escaping from the PWN. Instead of the immediate, isotropic diffusion into ambient interstellar medium that is typically assumed, these particles are transported anisotropically over at least $\sim$10 pc, either guided by the background magnetic field or carried by an advective outflow.

astro-ph.HE↗
arXiv2026

Kimi K2.5: Visual Agentic Intelligence

We introduce Kimi K2.5, an open-source multimodal agentic model designed to advance general agentic intelligence. K2.5 emphasizes the joint optimization of text and vision so that two modalities enhance each other. This includes a series of techniques such as joint text-vision pre-training, zero-vision SFT, and joint text-vision reinforcement learning. Building on this multimodal foundation, K2.5 introduces Agent Swarm, a self-directed parallel agent orchestration framework that dynamically decomposes complex tasks into heterogeneous sub-problems and executes them concurrently. Extensive evaluations show that Kimi K2.5 achieves state-of-the-art results across various domains including coding, vision, reasoning, and agentic tasks. Agent Swarm also reduces latency by up to $4.5\times$ over single-agent baselines. We release the post-trained Kimi K2.5 model checkpoint to facilitate future research and real-world applications of agentic intelligence.

cs.CL↗
arXiv2026

Controlled Memory Interference in Continual LLM Agents

Long-term memory enables AI agents to maintain continuity across sessions, personalize behavior, and evolve through accumulated experience. Yet memory evolution is not simply a process of storing more information: new experiences may reinforce, revise, or interfere with existing memory states. Existing systems mainly emphasize memory construction and relevance-based retrieval, but several memories may remain simultaneously relevant while differing in state, temporal validity, or authority. We introduce Controlled Memory Interference (CMI), a controlled diagnostic and data-generation framework for studying how agent memory evolves under different memory relationships. Across controlled memory evolution, benign accumulation has limited effects, whereas relationship-specific interference sharply suppresses update plasticity with little stability gain, either by blocking target-memory exposure or by disrupting its downstream use. Lexical and Dense retrieval exhibit distinct interference pathways, while poisoning is more sensitive to update-authority cues than to recency alone. Beyond diagnosis, CMI provides targeted examples for interference-aware memory learning, improving the distinction between valid updates and interference-inducing memories while preserving performance on original memory tasks. These findings show that memory evolution is shaped not only by memory scale, but also by interactions among accumulated experiences. More broadly, memory interference emerges as an important factor for reliable continual agent memory systems.

cs.AI↗
arXiv2026

Verifiable Memory: Learning Unified Memory Management with Local and Global Verifiers for Large Language Model Agents

Large language model (LLM) agents must retain reusable information, control a bounded active context, and recover earlier evidence during long-horizon interaction. Existing methods commonly optimize long-term memory (LTM) and short-term memory (STM) separately, while unified policies are often trained primarily with trajectory-level feedback, which provides weak credit for individual memory decisions. We present Verifiable Memory (VerMem), a framework that represents LTM, active context, and episodic history as distinct states and controls them with one memory operation policy. Seven atomic operations let the policy add, revise, or soft-delete LTM entries; retrieve LTM into the active context; filter or summarize the active context; and restore selected episodic fragments. VerMem is initialized by supervised fine-tuning and trained with a three-stage reinforcement-learning curriculum. The local verifier scores executable memory transitions, and a global verifier assesses evidence coherence and terminal-memory consistency after task completion. These scores are combined with programmatically computed task, evidence-recall, efficiency, and constraint signals through hierarchical credit assignment. The verifiers are used only during training. Across five benchmarks and two LLM backbones, VerMem achieves the best result on the vast majority of reported metrics and consistently outperforms strong memory baselines. Under controlled online-token budgets on three interactive benchmarks, it also achieves the strongest efficiency--performance frontier among the compared methods. Code is available at https://github.com/Sun-SYSU-24/VerMem.

cs.AI↗
arXiv2026

The Extended Ultrahigh-energy Gamma-Ray Emission in the Vicinity of PSR J2238+5903

We present a comprehensive analysis of the recently discovered TeV gamma-ray source, LHAASO J2238+5900. Based on data collected from the LHAASO, our fitting results suggest that the source is significantly extended with an angular extension of 0.54° \pm 0.01° and is spatially coincident with the pulsar PSR J2238+5903. Its spectrum is characterized by a power-law with a cutoff at 41.0\pm 3.5 TeV. Additionally, the source exhibits a significant signal of 7.9σabove 100 TeV, implying that it is a PeVatron candidate. While the gamma-ray emission is consistent with a pulsar wind nebula (PWN) scenario, the relatively large extension size also allows for a halo interpretation, potentially caused by electron-positron pairs escaping from the PWN.

astro-ph.HE↗
arXiv2026

Rydberg quantum antennas for chip-interfaced single-photon source array

We propose a Rydberg quantum antenna, consisting of a one-dimensional chain of neutral atoms trapped in a standing-wave optical tweezer, as a chip-interfaced single-photon source. Rydberg blockade induces a single collective excitation in the atomic chain, while its ordered geometry shapes the photon emission into a directional beam, thereby realizing a quantum antenna that emits strictly one photon at a time. Through numerical simulations, we demonstrate single-photon collection efficiencies into a waveguide exceeding 70\% through a high-NA lens with a negligible multiple excitation probability. These performance are robust against probabilistic atom loading in the standing-wave dipole traps, requiring only ten atoms, indicating experimental feasibility. The Rydberg quantum antenna thus offers a unique route toward scalable arrays of high-efficiency, high-purity, and identical single-photon sources interfaced with a photonic chip, addressing key challenges in photonic quantum information technology.

quant-ph↗
arXiv2026

ClawBench: Can AI Agents Complete Everyday Online Tasks?

AI agents may be able to assist with emails and documents, but can they reliably complete everyday online workflows on real websites? Everyday online tasks offer a realistic yet unsolved testbed for evaluating the next generation of AI agents. To this end, we introduce ClawBench, an evaluation framework comprising 153 everyday online tasks that people need to accomplish regularly in their lives and work, spanning 144 platforms across 15 categories, from completing purchases and booking appointments to submitting job applications. These tasks require capabilities beyond existing benchmarks, such as obtaining relevant information from user-provided documents, navigating multi-step workflows across diverse platforms, and write-heavy operations like filling in many detailed forms correctly. Unlike existing benchmarks that evaluate agents in offline sandboxes with static pages, ClawBench operates on production websites, preserving the full complexity, dynamic nature, and interaction challenges of real-world web environments. An interception layer captures and blocks the final submission request, ensuring safe evaluation without real-world side effects. Our evaluations of 8 frontier models show that both proprietary and open-source models complete only a small portion of these tasks. For example, Claude Sonnet 4.6 achieves only 33.3%, which exposes gaps in current AI agents. Progress on ClawBench brings us closer to AI agents that can function as general-purpose assistants.

cs.CL↗
arXiv2026

Single-atom sensor for low-frequency electric field

Precision measurement of low-frequency electric field (LFEF) signals with frequency from 30 kHz to 300 kHz is crucial for advancing both fundamental science and practical applications, owing to their unique frequency regime. For conventional electromagnetic antennas, the long wavelength (i.e., several kilometers) of the LFEF leads to a severe size constraint that efficient radiation becomes challenging to achieve when the antenna size is much smaller than the long wavelength of the LFEF signals, which in turn results in a reduction of measurement sensitivity and compromises antenna's performance. By exploiting the high intrinsic sensitivity of cold trapped ions to weak alternating electric signals via Coulomb interaction, we demonstrate a single-ion phonon laser sensor acted by an injection-locked 40Ca+ ion confined in a surface-electrode trap. Combining the beat frequency technique with the injection-locked phonon laser oscillation, we demonstrate a practical and efficient approach for simultaneous extraction of the frequency, phase, and amplitude from a single measurement, without the need for sideband cooling. This approach achieves precision detection for LFEF signals with the sensitivity of 404 uV/(m * Hz1/2) and the detection limit of 61.5 uV/m. Besides, this approach also shows remarkable robustness against noise. Our study helps realizing practical single-atom sensors in the low-frequency regime, opening avenues for applications in subsurface communication, precision metrology, mass spectrometry, and biomedical monitoring.

quant-ph↗
arXiv2026

Scalable and Efficient Joint Spiking Embedding Predictive Architecture for Large-Scale Dynamic Graphs

Dynamic graph learning aims to capture evolving structural and semantic patterns in real-world systems, such as fraud detection and recommender systems. Due to the scarcity of labeled data in real-world dynamic graphs, recent studies have introduced generative or contrastive paradigms (e.g., masked graph autoencoders or graph contrastive learning) to generate task-agnostic graph embeddings. However, these methods typically rely on complex edge-level reconstruction objectives and tailored graph augmentation strategies. This incurs substantial computational overhead when scaling to large-scale dynamic graphs. In this paper, we propose SG-JEPA, a joint spiking embedding predictive architecture for large-scale dynamic graphs. In contrast to existing self-supervised methods, SG-JEPA partitions nodes into context and target sets along the temporal dimension to learn embeddings that are predictive of each other via additional spatial-temporal information. Furthermore, through encoding sequential inputs into coarse-to-fine spike count embeddings, spiking neurons enable SG-JEPA to adapt to the varying computational constraints of downstream tasks. Extensive experiments demonstrate that SG-JEPA achieves competitive or even superior performance over discriminative baselines on node classification, while effectively scaling to the dynamic graph with 13 million edges. SG-JEPA avoids the complex machinery (negative sampling, graph augmentations, edge-level reconstruction, etc.), resulting in superior training efficiency and memory scalability compared with prior self-supervised dynamic graph baselines.

cs.LG↗
arXiv2026

An Efficient Augmented Lagrangian Framework for Dynamic Optimal Transport on Surfaces Based on Second-Order Cone Programming Reformulation

This paper proposes an efficient numerical optimization framework for solving dynamic optimal transport (DOT) problems on surfaces, computing both the quadratic Wasserstein distance and the associated interpolation. Building on the convex DOT model of Benamou-Brenier-Lisini, we first properly reformulate its dual problem, discretized on a triangular mesh in space and a staggered grid in time, into a linear second-order cone programming (SOCP) problem. Then the resulting SOCP is solved via an inexact proximal augmented Lagrangian method with a highly efficient numerical implementation, and the algorithm is guaranteed to converge to a Karush-Kuhn-Tucker point without imposing any additional assumptions. Finally, we implement the proposed framework as an open-source software package. The effectiveness, robustness, and computational efficiency of the software are validated through extensive numerical experiments across diverse datasets, demonstrating that it consistently outperforms state-of-the-art surface DOT solvers by several times in speed, while the commercial solvers Gurobi and MOSEK either fail to solve the same SOCP reformulation due to out-of-memory or require substantially prolonged computation times.

math.OC↗
arXiv2026

VCG-Bench: Towards A Unified Visual-Centric Benchmark for Structured Generation and Editing

Despite the rapid advancements in Vision-Language Models (VLMs), a critical gap remains in their ability to handle structured, controllable diagrammatic tasks essential for professional workflows. Existing methods predominantly rely on pixel-based synthesis, which operates in probabilistic pixel spaces and is inherently limited in editability and fidelity. Instead, we propose a new Diagram-as-Code paradigm with symbolic logic that leverages mxGraph Extensible Markup Language (XML) for precise diagram generation and editing. We present VCG-Bench, a unified benchmark for visual-centric \texttt{mxGraph} tasks. VCG-Bench comprises: (1) a taxonomized dataset of 1,449 diverse diagrams spanning 6 domains and 15 sub-domains, (2) a paradigm definition that integrates Generation (Vision-to-Code) and Editability (Code-to-Code), (3) a Tailored Evaluation Protocol employing multi-dimensional metrics such as \texttt{mxGraph} Execution Success Rate, Style Consistency Score (SCS), etc. Experimental results highlight the challenges faced by current State-of-the-Art (SOTA) VLMs in structured fidelity and instruction compliance, reflecting their vision and reasoning capabilities.

cs.CL↗
arXiv2026

Grad2Fair: A Gradient-driven Approach for Graph Fairness without Demographics

Graph neural networks (GNNs) frequently encounter group fairness issues, often yielding biased predictions against specific demographic groups defined by sensitive attributes such as gender or race. While this challenge has motivated extensive research, most existing solutions rely on the strong assumption that demographics are fully available. To bypass this strict requirement, a few recent studies have attempted to use predicted demographics as proxies to enforce fairness constraints. However, predicted demographics may be inaccurate, resulting in the failure to improve fairness. In this work, we investigate the problem of graph fairness without demographic information and avoid the utilization of predicted demographics. Motivated by our observation that the gradient distributions of misclassified nodes implicitly encode demographic information, we first propose GradDist, a gradient-based metric that quantifies bias by measuring the distance between local modes within these distributions. To mitigate this bias, we propose Gradient-to-Fairness (Grad2Fair), a gradient-guided approach for group fairness without demographics. Due to the potential demographics in gradients, Grad2Fair directly leverages gradients to debias and eliminates demographic prediction, thereby enabling stable fairness performance. Experiments on several real-world datasets demonstrate the effectiveness of Grad2Fair, as evidenced by superior performance over baselines in most cases. Our code is available at https://github.com/ZzoomD/Grad2Fair.

cs.LG↗
arXiv2026

Magnetically Arrested Discs Powering Jets in a Large Sample of Low-Accretion FR I Radio Galaxies

We study a sample of 289 Fanaroff-Riley type I (FR I) radio galaxies selected from the LOFAR Two-Metre Sky Survey (LoTSS) DR1, identified by their edge-darkened radio morphologies. Using Sloan Digital Sky Survey (SDSS) DR17 optical photometry and spectroscopy, we derive Eddington-scaled accretion rates spanning -6.84 < log $\dot{m}$ < -0.87 (median $\approx$ -2.84). The vast majority of sources lie below $\dot{m}$ = 0.01, indicating that their central engines are well described by advection-dominated accretion flows (ADAFs). However, even for a rapidly spinning black hole with a = 0.95, the maximum jet power predicted by the Blandford-Znajek mechanism in the standard ADAF regime is lower than the observed jet power (estimated from 151 MHz radio luminosity) for approximately 70% of the sample. We demonstrate that the magnetically arrested disc (MAD) scenario, in which large-scale poloidal magnetic flux accumulates near the event horizon, can fully account for the powerful jets observed in these low-accretion systems. Within the MAD framework, the data are consistent with slow-spinning black holes with $a < 0.5$. This large, uniformly selected LoTSS sample extends the MAD requirement previously established for the bright 3CR FR I population, indicating that magnetically arrested discs are common in FR I radio galaxies across a wide range of luminosities.

astro-ph.GA↗
arXiv2026

Low-latency FPGA-based electronic control system for fast preparation of defect-free atom arrays

The scalability of neutral atom quantum computing demands integrated electronic control systems with low latency, modular architecture, and real-time feedback capability. Here, we present an FPGA-based electronic control system that eliminates the PC from the feedback loop, integrating photon counting, real-time decision-making, and waveform generation within a unified PXIe architecture. The system achieves a total feedback latency of $282\,\mathrm{μs}$ and is validated in practical experiments by assembling defect-free atom arrays from 24 stochastically loaded optical tweezers. A single-round rearrangement achieves a filling fraction of $\sim96\%$, while feedback-controlled iterative rearrangement over five rounds boosts the success probability for generating a 10-atom defect-free array from $65.7\%$ to $95.4\%$. This system establishes the electronic infrastructure necessary for mid-circuit measurement and real-time quantum error correction on neutral-atom platforms.

quant-ph↗