❌

Normal view

Received — 8 April 2026 ⏭

ActionNex: A Virtual Outage Manager for Cloud

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhenfeng Lin · Haoji Hu · Ming Hao · Xuchao Zhang · Ryan Zhang · Junhao Li · Ze Li · Oleg Kulygin · Chetan Bansal · Hatay Tuna · Murali Chintalapati · Sheila Jiang · Salman Zafar · Angie Anderson
7 April 2026 at 12:00
arXiv:2604.03512v1 Announce Type: new Abstract: Outage management in large-scale cloud operations remains heavily manual, requiring rapid triage, cross-team coordination, and experience-driven decisions under partial observability. We present \textbf{ActionNex}, a production-grade agentic system that supports end-to-end outage assistance, including real-time updates, knowledge distillation, and role- and stage-conditioned next-best action recommendations. ActionNex ingests multimodal operational signals (e.g., outage content, telemetry, and human communications) and compresses them into critical events that represent meaningful state transitions. It couples this perception layer with a hierarchical memory subsystem: long-term Key-Condition-Action (KCA) knowledge distilled from playbooks and historical executions, episodic memory of prior outages, and working memory of the live context. A reasoning agent aligns current critical events to preconditions, retrieves relevant memories, and generates actionable recommendations; executed human actions serve as an implicit feedback signal to enable continual self-evolution in a human-agent hybrid system. We evaluate ActionNex on eight real Azure outages (8M tokens, 4,000 critical events) using two complementary ground-truth action sets, achieving 71.4\% precision and 52.8-54.8\% recall. The system has been piloted in production and has received positive early feedback.

PRAISE: Prefix-Based Rollout Reuse in Agentic Search Training

✇cs.AI, q-bio.NC updates on arXiv.org
By: Erhan Zhang · Yiqun Chen · Zechun Niu · Wei Yang · Xiaochi Wei · Yan Gao · Yi Wu · Yao Hu · Jiaxin Mao
7 April 2026 at 12:00
arXiv:2604.03675v1 Announce Type: new Abstract: In agentic search, large language models (LLMs) are trained to perform multi-turn retrieval and reasoning for complex tasks such as multi-hop question answering (QA). However, current search-based Reinforcement Learning (RL) methods suffer from two core limitations: expensive long-horizon rollouts are under-utilized during training, and supervision is typically available only at the final answer, resulting in severe reward sparsity. We present Prefix-based Rollout reuse for Agentic search with Intermediate Step rEwards (PRAISE), a framework for improving both data efficiency and credit assignment in agentic search training. Given a complete search trajectory, PRAISE extracts prefix states at different search turns, elicits intermediate answers from them, and uses these prefixes both to construct additional training trajectories and to derive step-level rewards from performance differences across prefixes. Our method uses a single shared model for both search policy learning and prefix answer evaluation, enabling joint optimization without extra human annotations or a separate reward model. Experiments on multi-hop QA benchmarks show that PRAISE consistently improves performance over strong baselines.

3D-IDE: 3D Implicit Depth Emergent

✇cs.AI, q-bio.NC updates on arXiv.org
By: Chushan Zhang · Ruihan Lu · Jinguang Tong · Yikai Wang · Hongdong Li
7 April 2026 at 12:00
arXiv:2604.03296v1 Announce Type: cross Abstract: Leveraging 3D information within Multimodal Large Language Models (MLLMs) has recently shown significant advantages for indoor scene understanding. However, existing methods, including those using explicit ground-truth 3D positional encoding and those grafting external 3D foundation models for implicit geometry, struggle with the trade-off in 2D-3D representation fusion, leading to suboptimal deployment. To this end, we propose 3D-Implicit Depth Emergence, a method that reframes 3D perception as an emergent property derived from geometric self-supervision rather than explicit encoding. Our core insight is the Implicit Geometric Emergence Principle: by strategically leveraging privileged geometric supervision through mechanisms like a fine-grained geometry validator and global representation constraints, we construct an information bottleneck. This bottleneck forces the model to maximize the mutual information between visual features and 3D structures, allowing 3D awareness to emerge naturally within a unified visual representation. Unlike existing approaches, our method enables 3D perception to emerge implicitly, disentangling features in dense regions and, crucially, eliminating depth and pose dependencies during inference with zero latency overhead. This paradigm shift from external grafting to implicit emergence represents a fundamental rethinking of 3D knowledge integration in visual-language models. Extensive experiments demonstrate that our method surpasses SOTA on multiple 3D scene understanding benchmarks. Our approach achieves a 55% reduction in inference latency while maintaining strong performance across diverse downstream tasks, underscoring the effectiveness of meticulously designed auxiliary objectives for dependency-free 3D understanding. Source code can be found at github.com/ChushanZhang/3D-IDE.

Determined by User Needs: A Salient Object Detection Rationale Beyond Conventional Visual Stimuli

✇cs.AI, q-bio.NC updates on arXiv.org
By: Chenglizhao Chen · Shujian Zhang · Luming Li · Wenfeng Song · Shuai Li
7 April 2026 at 12:00
arXiv:2604.03526v1 Announce Type: cross Abstract: Existing \textbf{s}alient \textbf{o}bject \textbf{d}etection (SOD) methods adopt a \textbf{passive} visual stimulus-based rationale--objects with the strongest visual stimuli are perceived as the user's primary focus (i.e., salient objects). They ignore the decisive role of users' \textbf{proactive needs} in segmenting salient objects--if a user has a need before seeing an image, the user's salient objects align with their needs, e.g., if a user's need is ``white apple'', when this user sees an image, the user's primary focus is on the ``white apple'' or ``the most white apple-like'' objects in the image. Such an oversight not only \textbf{fails to satisfy users}, but also \textbf{limits the development of downstream tasks}. For instance, in salient object ranking tasks, focusing solely on visual stimuli-based salient objects is insufficient for conducting an analysis of fine-grained relationships between users' viewing order (usually determined by user's needs) and scenes, which may result in wrong ranking results. Clearly, it is essential to detect salient objects based on user needs. Thus, we advocate a \textbf{User} \textbf{S}alient \textbf{O}bject \textbf{D}etection (UserSOD) task, which focuses on \textbf{detecting salient objects align with users' proactive needs when user have needs}. The main challenge for this new task is the lack of datasets for model training and testing.

LightThinker++: From Reasoning Compression to Memory Management

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yuqi Zhu · Jintian Zhang · Zhenjie Wan · Yujie Luo · Shuofei Qiao · Zhengke Gui · Da Zheng · Lei Liang · Huajun Chen · Ningyu Zhang
7 April 2026 at 12:00
arXiv:2604.03679v1 Announce Type: cross Abstract: Large language models (LLMs) excel at complex reasoning, yet their efficiency is limited by the surging cognitive overhead of long thought traces. In this paper, we propose LightThinker, a method that enables LLMs to dynamically compress intermediate thoughts into compact semantic representations. However, static compression often struggles with complex reasoning where the irreversible loss of intermediate details can lead to logical bottlenecks. To address this, we evolve the framework into LightThinker++, introducing Explicit Adaptive Memory Management. This paradigm shifts to behavioral-level management by incorporating explicit memory primitives, supported by a specialized trajectory synthesis pipeline to train purposeful memory scheduling. Extensive experiments demonstrate the framework's versatility across three dimensions. (1) LightThinker reduces peak token usage by 70% and inference time by 26% with minimal accuracy loss. (2) In standard reasoning, LightThinker++ slashes peak token usage by 69.9% while yielding a +2.42% accuracy gain under the same context budget for maximum performance. (3) Most notably, in long-horizon agentic tasks, it maintains a stable footprint beyond 80 rounds (a 60%-70% reduction), achieving an average performance gain of 14.8% across different complex scenarios. Overall, our work provides a scalable direction for sustaining deep LLM reasoning over extended horizons with minimal overhead.

BAAI Cardiac Agent: An intelligent multimodal agent for automated reasoning and diagnosis of cardiovascular diseases from cardiac magnetic resonance imaging

✇cs.AI, q-bio.NC updates on arXiv.org
By: Taiping Qu · Hongkai Zhang · Lantian Zhang · Can Zhao · Nan Zhang · Hui Wang · Zhen Zhou · Mingye Zou · Kairui Bo · Pengfei Zhao · Xingxing Jin · Zixian Su · Kun Jiang · Huan Liu · Yu Du · Maozhou Wang · Ruifang Yan · Zhongyuan Wang · Tiejun Huang · Lei Xu · Henggui Zhang
7 April 2026 at 12:00
arXiv:2604.04078v1 Announce Type: cross Abstract: Cardiac magnetic resonance (CMR) is a cornerstone for diagnosing cardiovascular disease. However, it remains underutilized due to complex, time-consuming interpretation across multi-sequences, phases, quantitative measures that heavily reliant on specialized expertise. Here, we present BAAI Cardiac Agent, a multimodal intelligent system designed for end-to-end CMR interpretation. The agent integrates specialized cardiac expert models to perform automated segmentation of cardiac structures, functional quantification, tissue characterization and disease diagnosis, and generates structured clinical reports within a unified workflow. Evaluated on CMR datasets from two hospitals (2413 patients) spanning 7-types of major cardiovascular diseases, the agent achieved an area under the receiver-operating-characteristic curve exceeding 0.93 internally and 0.81 externally. In the task of estimating left ventricular function indices, the results generated by this system for core parameters such as ejection fraction, stroke volume, and left ventricular mass are highly consistent with clinical reports, with Pearson correlation coefficients all exceeding 0.90. The agent outperformed state-of-the-art models in segmentation and diagnostic tasks, and generated clinical reports showing high concordance with expert radiologists (six readers across three experience levels). By dynamically orchestrating expert models for coordinated multimodal analysis, this agent framework enables accurate, efficient CMR interpretation and highlights its potentials for complex clinical imaging workflows. Code is available at https://github.com/plantain-herb/Cardiac-Agent.

Agentization of Digital Assets for the Agentic Web: Concepts, Techniques, and Benchmark

✇cs.AI, q-bio.NC updates on arXiv.org
By: Linyao Chen · Bo Huang · Qinlao Zhao · Shuai Shao · Zhi Han · Zicai Cui · Ziheng Zhang · Guangtao Zeng · Wenzheng Tang · Yikun Wang · Yuanjian Zhou · Zimian Peng · Yong Yu · Weiwen Liu · Hiroki Kobayashi · Weinan Zhang
7 April 2026 at 12:00
arXiv:2604.04226v1 Announce Type: cross Abstract: Agentic Web, as a new paradigm that redefines the internet through autonomous, goal-driven interactions, plays an important role in group intelligence. As the foundational semantic primitives of the Agentic Web, digital assets encapsulate interactive web elements into agents, which expand the capacities and coverage of agents in agentic web. The lack of automated methodologies for agent generation limits the wider usage of digital assets and the advancement of the Agentic Web. In this paper, we first formalize these challenges by strictly defining the A2A-Agentization process, decomposing it into critical stages and identifying key technical hurdles on top of the A2A protocol. Based on this framework, we develop an Agentization Agent to agentize digital assets for the Agentic Web. To rigorously evaluate this capability, we propose A2A-Agentization Bench, the first benchmark explicitly designed to evaluate agentization quality in terms of fidelity and interoperability. Our experiments demonstrate that our approach effectively activates the functional capabilities of digital assets and enables interoperable A2A multi-agent collaboration. We believe this work will further facilitate scalable and standardized integration of digital assets into the Agentic Web ecosystem.

GA-GS: Generation-Assisted Gaussian Splatting for Static Scene Reconstruction

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yedong Shen · Shiqi Zhang · Sha Zhang · Yifan Duan · Xinran Zhang · Wenhao Yu · Lu Zhang · Jiajun Deng · Yanyong Zhang
7 April 2026 at 12:00
arXiv:2604.04331v1 Announce Type: cross Abstract: Reconstructing static 3D scene from monocular video with dynamic objects is important for numerous applications such as virtual reality and autonomous driving. Current approaches typically rely on background for static scene reconstruction, limiting the ability to recover regions occluded by dynamic objects. In this paper, we propose GA-GS, a Generation-Assisted Gaussian Splatting method for Static Scene Reconstruction. The key innovation of our work lies in leveraging generation to assist in reconstructing occluded regions. We employ a motion-aware module to segment and remove dynamic regions, and thenuse a diffusion model to inpaint the occluded areas, providing pseudo-ground-truth supervision. To balance contributions from real background and generated region, we introduce a learnable authenticity scalar for each Gaussian primitive, which dynamically modulates opacity during splatting for authenticity-aware rendering and supervision. Since no existing dataset provides ground-truth static scene of video with dynamic objects, we construct a dataset named Trajectory-Match, using a fixed-path robot to record each scene with/without dynamic objects, enabling quantitative evaluation in reconstruction of occluded regions. Extensive experiments on both the DAVIS and our dataset show that GA-GS achieves state-of-the-art performance in static scene reconstruction, especially in challenging scenarios with large-scale, persistent occlusions.

Justified or Just Convincing? Error Verifiability as a Dimension of LLM Quality

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xiaoyuan Zhu · Kimberly Le Truong · Riccardo Fogliato · Gokul Swamy · Weijian Zhang · Minglai Yang · Longtian Ye · Bangya Liu · Minghao Liu · Andrew Ilyas · Steven Wu
7 April 2026 at 12:00
arXiv:2604.04418v1 Announce Type: cross Abstract: As LLMs are deployed in high-stakes settings, users must judge the correctness of individual responses, often relying on model-generated justifications such as reasoning chains or explanations. Yet, no standard measure exists for whether these justifications help users distinguish correct answers from incorrect ones. We formalize this idea as error verifiability and propose $v_{\text{bal}}$, a balanced metric that measures whether justifications enable raters to accurately assess answer correctness, validated against human raters who show high agreement. We find that neither common approaches, such as post-training and model scaling, nor more targeted interventions recommended improve verifiability. We introduce two methods that succeed at improving verifiability: reflect-and-rephrase (RR) for mathematical reasoning and oracle-rephrase (OR) for factual QA, both of which improve verifiability by incorporating domain-appropriate external information. Together, our results establish error verifiability as a distinct dimension of response quality that does not emerge from accuracy improvements alone and requires dedicated, domain-aware methods to address.

Cardinality Estimation for High Dimensional Similarity Queries with Adaptive Bucket Probing

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhonghan Chen · Qintian Guo · Ruiyuan Zhang · Xiaofang Zhou
7 April 2026 at 12:00
arXiv:2604.04603v1 Announce Type: cross Abstract: In this work, we address the problem of cardinality estimation for similarity search in high-dimensional spaces. Our goal is to design a framework that is lightweight, easy to construct, and capable of providing accurate estimates with satisfying online efficiency. We leverage locality-sensitive hashing (LSH) to partition the vector space while preserving distance proximity. Building on this, we adopt the principles of classical multi-probe LSH to adaptively explore neighboring buckets, accounting for distance thresholds of varying magnitudes. To improve online efficiency, we employ progressive sampling to reduce the number of distance computations and utilize asymmetric distance computation in product quantization to accelerate distance calculations in high-dimensional spaces. In addition to handling static datasets, our framework includes updating algorithm designed to efficiently support large-scale dynamic scenarios of data updates.Experiments demonstrate that our methods can accurately estimate the cardinality of similarity queries, yielding satisfying efficiency.

Your Agent, Their Asset: A Real-World Safety Analysis of OpenClaw

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zijun Wang · Haoqin Tu · Letian Zhang · Hardy Chen · Juncheng Wu · Xiangyan Liu · Zhenlong Yuan · Tianyu Pang · Michael Qizhe Shieh · Fengze Liu · Zeyu Zheng · Huaxiu Yao · Yuyin Zhou · Cihang Xie
7 April 2026 at 12:00
arXiv:2604.04759v1 Announce Type: cross Abstract: OpenClaw, the most widely deployed personal AI agent in early 2026, operates with full local system access and integrates with sensitive services such as Gmail, Stripe, and the filesystem. While these broad privileges enable high levels of automation and powerful personalization, they also expose a substantial attack surface that existing sandboxed evaluations fail to capture. To address this gap, we present the first real-world safety evaluation of OpenClaw and introduce the CIK taxonomy, which unifies an agent's persistent state into three dimensions, i.e., Capability, Identity, and Knowledge, for safety analysis. Our evaluations cover 12 attack scenarios on a live OpenClaw instance across four backbone models (Claude Sonnet 4.5, Opus 4.6, Gemini 3.1 Pro, and GPT-5.4). The results show that poisoning any single CIK dimension increases the average attack success rate from 24.6% to 64-74%, with even the most robust model exhibiting more than a threefold increase over its baseline vulnerability. We further assess three CIK-aligned defense strategies alongside a file-protection mechanism; however, the strongest defense still yields a 63.8% success rate under Capability-targeted attacks, while file protection blocks 97% of malicious injections but also prevents legitimate updates. Taken together, these findings show that the vulnerabilities are inherent to the agent architecture, necessitating more systematic safeguards to secure personal AI agents. Our project page is https://ucsc-vlaa.github.io/CIK-Bench.

Xpertbench: Expert Level Tasks with Rubrics-Based Evaluation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xue Liu · Xin Ma · Yuxin Ma · Yongchang Peng · Duo Wang · Zhoufutu Wen · Ge Zhang · Kaiyuan Zhang · Xinyu Chen · Tianci He · Jiani Hou · Liang Hu · Ziyun Huang · Yongzhe Hui · Jianpeng Jiao · Chennan Ju · Yingru Kong · Yiran Li · Mengyun Liu · Luyao Ma · Fei Ni · Yiqing Ni · Yueyan Qiu · Yanle Ren · Zilin Shi · Zaiyuan Wang · Wenjie Yue · Shiyu Zhang · Xinyi Zhang · Kaiwen Zhao · Zhenwei Zhu · Shanshan Wu · Qi Zhao · Wenhao Huang
7 April 2026 at 12:00
arXiv:2604.02368v3 Announce Type: replace Abstract: As Large Language Models (LLMs) exhibit plateauing performance on conventional benchmarks, a pivotal challenge persists: evaluating their proficiency in complex, open-ended tasks characterizing genuine expert-level cognition. Existing frameworks suffer from narrow domain coverage, reliance on generalist tasks, or self-evaluation biases. To bridge this gap, we present XpertBench, a high-fidelity benchmark engineered to assess LLMs across authentic professional domains. XpertBench consists of 1,346 meticulously curated tasks across 80 categories, spanning finance, healthcare, legal services, education, and dual-track research (STEM and Humanities). These tasks are derived from over 1,000 submissions by domain experts--including researchers from elite institutions and practitioners with extensive clinical or industrial experience--ensuring superior ecological validity. Each task uses detailed rubrics with mostly 15-40 weighted checkpoints to assess professional rigor. To facilitate scalable yet human-aligned assessment, we introduce ShotJudge, a novel evaluation paradigm that employs LLM judges calibrated with expert few-shot exemplars to mitigate self-rewarding biases. Our empirical evaluation of state-of-the-art LLMs reveals a pronounced performance ceiling: even leading models achieve a peak success rate of only ~66%, with a mean score around 55%. Models also exhibit domain-specific divergence, showing non-overlapping strengths in quantitative reasoning versus linguistic synthesis.. These findings underscore a significant "expert-gap" in current AI systems and establish XpertBench as a critical instrument for navigating the transition from general-purpose assistants to specialized professional collaborators.

Document Parsing Unveiled: Techniques, Challenges, and Prospects for Structured Information Extraction

✇cs.AI, q-bio.NC updates on arXiv.org
By: Qintong Zhang · Bin Wang · Victor Shea-Jay Huang · Junyuan Zhang · Zhengren Wang · Hao Liang · Conghui He · Wentao Zhang
7 April 2026 at 12:00
arXiv:2410.21169v5 Announce Type: replace-cross Abstract: Document parsing (DP) transforms unstructured or semi-structured documents into structured, machine-readable representations, enabling downstream applications such as knowledge base construction and retrieval-augmented generation (RAG). This survey provides a comprehensive and timely review of document parsing research. We propose a systematic taxonomy that organizes existing approaches into modular pipeline-based systems and unified models driven by Vision-Language Models (VLMs). We provide a detailed review of key components in pipeline systems, including layout analysis and the recognition of heterogeneous content such as text, tables, mathematical expressions, and visual elements, and then systematically track the evolution of specialized VLMs for document parsing. Additionally, we summarize widely adopted evaluation metrics and high-quality benchmarks that establish current standards for parsing quality. Finally, we discuss key open challenges, including robustness to complex layouts, reliability of VLM-based parsing, and inference efficiency, and outline directions for building more accurate and scalable document intelligence systems.

Certified Training with Branch-and-Bound for Lyapunov-stable Neural Control

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhouxing Shi · Haoyu Li · Cho-Jui Hsieh · Huan Zhang
7 April 2026 at 12:00
arXiv:2411.18235v3 Announce Type: replace-cross Abstract: We study the problem of learning verifiably Lyapunov-stable neural controllers that provably satisfy the Lyapunov asymptotic stability condition within a region-of-attraction (ROA). Unlike previous works that adopted counterexample-guided training without considering the computation of verification in training, we introduce Certified Training with Branch-and-Bound (CT-BaB), a new certified training framework that optimizes certified bounds, thereby reducing the discrepancy between training and test-time verification that also computes certified bounds. To achieve a relatively global guarantee on an entire input region-of-interest, we propose a training-time BaB technique that maintains a dynamic training dataset and adaptively splits hard input subregions into smaller ones, to tighten certified bounds and ease the training. Meanwhile, subregions created by the training-time BaB also inform test-time verification, for a more efficient training-aware verification. We demonstrate that CT-BaB yields verification-friendly models that can be more efficiently verified at test time while achieving stronger verifiable guarantees with larger ROA. On the largest output-feedback 2D Quadrotor system experimented, CT-BaB reduces verification time by over 11X relative to the previous state-of-the-art baseline using Counterexample Guided Inductive Synthesis (CEGIS), while achieving 164X larger ROA. Code is available at https://github.com/shizhouxing/CT-BaB.

Human-AI Collaborative Game Testing with Vision Language Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Boran Zhang · Muhan Xu · Zhijun Pan
7 April 2026 at 12:00
arXiv:2501.11782v2 Announce Type: replace-cross Abstract: As modern video games become increasingly complex, traditional manual testing methods are proving costly and inefficient, limiting the ability to ensure high-quality game experiences. While advancements in Artificial Intelligence (AI) offer the potential to assist human testers, the effectiveness of AI in truly enhancing real-world human performance remains underexplored. This study investigates how AI can improve game testing by developing and experimenting with an AI-assisted workflow that leverages state-of-the-art machine learning models for defect detection. Through an experiment involving 800 test cases and 276 participants of varying backgrounds, we evaluate the effectiveness of AI assistance under four conditions: with or without AI support, and with or without detailed knowledge of defects and design documentation. The results indicate that AI assistance significantly improves defect identification performance, particularly when paired with detailed knowledge. However, challenges arise when AI errors occur, negatively impacting human decision-making. Our findings show the importance of optimizing human-AI collaboration and implementing strategies to mitigate the effects of AI inaccuracies. By this research, we demonstrate AI's potential and problems in enhancing efficiency and accuracy in game testing workflows and offers practical insights for integrating AI into the testing process.

MoltNet: Understanding Social Behavior of AI Agents in the Agent-Native MoltBook

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yi Feng · Chen Huang · Zhibo Man · Ryner Tan · Long P. Hoang · Shaoyang Xu · Wenxuan Zhang
7 April 2026 at 12:00
arXiv:2602.13458v2 Announce Type: replace-cross Abstract: Large-scale communities of AI agents are becoming increasingly prevalent, creating new environments for agent-agent social interaction. Prior work has examined multi-agent behavior primarily in controlled or small-scale settings, limiting our understanding of emergent social dynamics at scale. The recent emergence of MoltBook, a social networking platform designed explicitly for AI agents, presents a unique opportunity to study whether and how these interactions reproduce core human social mechanisms. We present MoltNet, a dataset tracking the full one-month activity trajectories of 148K AI agents on MoltBook (Jan.-Feb., 2026), and analyze their social interaction along four theory-grounded dimensions: \textit{intent and motivation}, \textit{norms and templates}, \textit{incentives and drift}, \textit{emotion and contagion}. Our analysis reveals that agents respond strongly to social rewards, converge on community-specific norms, and actively enforce them across community boundaries -- resembling human incentive sensitivity and normative conformity. However, they exhibit weak alignment with declared personas and display limited emotional reciprocity and dialogic engagement, diverging systematically from human online communities. These findings establish a first empirical portrait of agent social behavior at scale, with direct implications for the design and governance of AI-populated communities.

Security Considerations for Artificial Intelligence Agents

✇cs.AI, q-bio.NC updates on arXiv.org
By: Ninghui Li · Kaiyuan Zhang · Kyle Polley · Jerry Ma
7 April 2026 at 12:00
arXiv:2603.12230v2 Announce Type: replace-cross Abstract: This article, a lightly adapted version of Perplexity's response to NIST/CAISI Request for Information 2025-0035, details our observations and recommendations concerning the security of frontier AI agents. These insights are informed by Perplexity's experience operating general-purpose agentic systems used by millions of users and thousands of enterprises in both controlled and open-world environments. Agent architectures change core assumptions around code-data separation, authority boundaries, and execution predictability, creating new confidentiality, integrity, and availability failure modes. We map principal attack surfaces across tools, connectors, hosting boundaries, and multi-agent coordination, with particular emphasis on indirect prompt injection, confused-deputy behavior, and cascading failures in long-running workflows. We then assess current defenses as a layered stack: input-level and model-level mitigations, sandboxed execution, and deterministic policy enforcement for high-consequence actions. Finally, we identify standards and research gaps, including adaptive security benchmarks, policy models for delegation and privilege control, and guidance for secure multi-agent system design aligned with NIST risk management principles.

HISA: Efficient Hierarchical Indexing for Fine-Grained Sparse Attention

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yufei Xu · Fanxu Meng · Fan Jiang · Yuxuan Wang · Ruijie Zhou · Zhaohui Wang · Jiexi Wu · Zhixin Pan · Xiaojuan Tang · Wenjie Pei · Tongxuan Liu · Di Yin · Xing Sun · Muhan Zhang
7 April 2026 at 12:00
arXiv:2603.28458v3 Announce Type: replace-cross Abstract: Token-level sparse attention mechanisms, exemplified by DeepSeek Sparse Attention (DSA), achieve fine-grained key selection by scoring every historical key for each query through a lightweight indexer, then computing attention only on the selected subset. While the downstream sparse attention itself scales favorably, the indexer must still scan the entire prefix for every query, introducing an per-layer bottleneck that grows prohibitively with context length. We propose HISA (Hierarchical Indexed Sparse Attention), a plug-and-play replacement for the indexer that rewrites the search path from a flat token scan into a two-stage hierarchical procedure: (1) a block-level coarse filtering stage that scores pooled block representations to discard irrelevant regions, followed by (2) a token-level refinement stage that applies the original indexer exclusively within the retained candidate blocks. HISA preserves the identical token-level top-sparse pattern consumed by the downstream Sparse MLA operator and requires no additional training. On kernel-level benchmarks, HISA achieves up to speedup at 64K context. On Needle-in-a-Haystack and LongBench, we directly replace the indexer in DeepSeek-V3.2 and GLM-5 with our HISA indexer, without any finetuning. HISA closely matches the original DSA in quality, while substantially outperforming block-sparse baselines.

NSUN2/ALYREF-mediated RNA m5c modification promotes anoikis resistance of prostate cancer through activating autophagy

✇Oncogene - Issue - nature.com science feeds
By: Guangyu Sun · Shuaiqi Chen · Mingzhe Chen · Xiong Xiao · Ruoxuan Zhang · Hao Ye · Yuxuan Guo · Ranlu Liu
7 April 2026 at 08:00

Oncogene, Published online: 07 April 2026; doi:10.1038/s41388-026-03762-4

NSUN2/ALYREF-mediated RNA m5c modification promotes anoikis resistance of prostate cancer through activating autophagy

Decoding macrophage heterogeneity in the pulmonary fibrosis lung cancer transition

✇(Multiomics OR Omics) AND (Lung OR gastric OR Hepatocellular)
By: Hanming Yu · Mengmeng Zhao · Qiuhong Li · Yuan Zhang
6 April 2026 at 18:00

Front Immunol. 2026 Mar 20;17:1787094. doi: 10.3389/fimmu.2026.1787094. eCollection 2026.

ABSTRACT

Pulmonary fibrosis (PF) significantly increases the risk of lung cancer (LC), but the mechanisms underlying this transition remain unclear. This overview positions macrophage heterogeneity as a central node within the PF-LC continuum. First, we describe important subpopulations of profibrotic and pro-tumor macrophages, including SPP1+, MERTK+, TREM2+, and MARCO+ cells, using high-resolution spatial and single-cell omics technologies. Next, we analyze the fundamental mechanisms that determine their function: the fibrotic microenvironment (e.g., extracellular matrix stiffness, hypoxia) induces profound metabolic reprogramming (e.g., Warburg effect, lipid peroxidation) and stabilizes epigenetic memory (e.g., DNA methylation, histone modifications), locking them into a pathogenic state. This reprogramming occurs through two main pathways: (1) metabolic reprogramming, characterized by aerobic glycolytic conversion and dysregulated lipid metabolism, which stimulates both pathogenic functions and suppression of T cell activity; (2) Epigenetic modifications, including stabilized alterations in DNA methylation, histone modifications, and superactivator patterns, which maintain cells in a tumor-promoting phenotype. As central nodes of communication, these macrophages interact pathologically with fibroblasts and epithelial cells through secreted factors and extracellular vesicles, forming self-reinforcing feedback loops that promote disease progression. We are studying the crucial role of new technologies, particularly multi-omic spatial models and high-precision organoids, in fostering mechanistic discoveries. These discoveries pave the way for new macrophage-focused therapeutic strategies, including the precise stratification of patients using biomarkers from liquid biopsies (such as soluble SPP1 and MARCO) and the development of targeted drug delivery systems for the selective modulation of macrophage function, thus establishing a new paradigm for therapeutic interventions in pulmonary fibrosis with concomitant lung cancer.

PMID:41939908 | PMC:PMC13046558 | DOI:10.3389/fimmu.2026.1787094

❌