Weekly Issue
Collected dispatches

2026-W32

2026-07-27 to 2026-08-02
100 papers
7 daily issues
A weekly ledger drawn from the daily archive. 3 sections
§ I

The Week in Review

Editorial summary

This week's research landscape reveals a strong emphasis on enhancing LLM agentic capabilities and improving their trustworthiness and efficiency. A key direction is the development of more robust evaluation benchmarks and methodologies, moving beyond simple task completion to assess production fidelity (DBA-Bench) and guard against "reward hacking" (Do Agent Benchmarks Measure Capability?).

Notable advances include progress in compact and efficient LLM architectures (Nanbeige4.2-3B, Kimi K3), showcasing that smaller models can achieve impressive agentic performance through architectural innovation. Continual learning from deployment feedback (Learning on the Job) and skill self-play (Skill Self-Play) are emerging as powerful training paradigms for improving agent capabilities without full retraining.

Significant shifts are also evident in data integration and reasoning, with Agentic RAG aiming for more trustworthy and cost-efficient data handling. Research is also pushing the boundaries of long-horizon planning (The Physics of Multi-Turn Long-Horizon Planning) and complex reasoning in domains like code generation (MineValiCoder) and causal inference (CausalForge). Finally, there's a growing focus on control and safety mechanisms, with frameworks like Gubernaut and APPA designed to ensure stable, secure, and value-aligned agent behavior. The challenge of hallucination detection is also being addressed with novel spectral signal methods (D-Score).

§ II

Top Papers

Selected research 100
cs.AIarxiv:2607.22165v1Lead article

DBA-Bench: A Production-Fidelity Benchmark for LLM-Based Database Operations Agents

Junming Chen, Junyang Jiang, Xu Chen, Zibo Liang, Kai Zheng

his paper introduces DBA-Bench, a novel benchmark designed to accurately evaluate LLM-based database agents in production-like environments. It addresses key gaps by simulating multi-turn read-write interactions with live databases, handling complex observations, and allowing for diverse remediation strategies. DBA-Bench's core contribution is its production fidelity, enabling more realistic and reliable assessment of these agents' capabilities.

Figure 1. DBA-Bench architecture for 106 PostgreSQL scenarios, from scenario construction through stateful agent–environment interaction to outcome-first, multi-dimensional evaluation.
Figure 1. DBA-Bench architecture for 106 PostgreSQL scenarios, from scenario construction through stateful agent–environment interaction to outcome-first, multi-dimensional evaluation.
cs.AIarxiv:2607.22182v1Lead article

From Isolated Tasks to Structured Capabilities: A Multilayer Taxonomy for Large Language Models

Shixin Fang, Jiachen Wo, Wenjuan Qin, Sihang Jiang, Yanghua Xiao

his paper introduces a novel multilayer taxonomy of LLM capabilities, organized by human cognitive science principles rather than LLM architecture. This framework, comprising 14 capability domains and 91 subskills across Primitive, Constructed, and Integrative layers, aims to address the fragmentation in LLM evaluation. The authors demonstrate its utility by mapping thousands of research papers, revealing that current research heavily focuses on Language-Semantic Competence and Reasoning.

The multi-layer taxonomy of cognitive capabilities.
The multi-layer taxonomy of cognitive capabilities.
cs.AIarxiv:2607.22389v1Lead article

HiKV: Hierarchical Importance-Aware KV Cache with Hardware Acceleration for LLM Decoding

Chao Fang, Jun Yin, Man Shi, Marian Verhelst

iKV addresses the KV cache memory bottleneck in LLM decoding by compressing it hierarchically. It first evicts unimportant tokens and then further compresses retained tokens by keeping only significant elements. This algorithm-hardware co-design, featuring a reconfigurable importance sorter, achieves significant speedups and energy reductions.

The dominated memory access of KV cache becomes the bottleneck of LLM decoding, motivating HiKV to shrink its footprint with high accuracy.
The dominated memory access of KV cache becomes the bottleneck of LLM decoding, motivating HiKV to shrink its footprint with high accuracy.
cs.AIarxiv:2607.22375v1Lead article

IDEAgent: Agentic Quality-Diversity Search for Research Idea Generation

Varun Gumma, Navonil Majumder, Soumitra Sinhahajari, Soujanya Poria

his paper introduces IDEAgent, a multi-agent framework for research idea generation that treats ideation as a Quality-Diversity (QD) search. Unlike previous methods that optimize for quality or diversity separately, IDEAgent jointly drives both objectives. It achieves this by using multi-objective feedback for idea refinement (Quality) and employing sequential memory and explicit comparisons to ensure novelty (Diversity).

Left: An abstract overview of IDEAgent highlighting the crucial components and flow. Right: An abstract overview of the evolution of an idea and a lineage, where a raw idea might either be directly rejected, repaired and refined, just refined, or directly accepted as per the assessment by the evaluators. Note that a refinement/repair maintains the lineage of the idea ( ℓ I \( \ell_{I} \) ). We purposefully omit the exact conditionals at each step for simplicity and refer the readers to the methodology ( § \( \mathsection \) 3 ) for it.
Left: An abstract overview of IDEAgent highlighting the crucial components and flow. Right: An abstract overview of the evolution of an idea and a lineage, where a raw idea might either be directly rejected, repaired and refined, just refined, or directly accepted as per the asse…
cs.AIarxiv:2607.22157v1Lead article

Learning on the Job: Continual Learning from Deployment Feedback for Frozen-Weights Agents

Valentin Tablan, Scott Taylor, Kristoffer Bernhem

his paper proposes a continual learning method for deployed AI agents with frozen weights. It leverages deployment feedback, such as outcome verdicts and corrections, to train an external memory that stores natural-language rules. This approach significantly improves agent performance by enabling it to learn from past experiences without retraining the core model.

cs.AIarxiv:2607.22083v1Lead article

Nanbeige4.2-3B: Unlocking Agentic Capabilities in a Compact Mode

Nanbeige Lab, :, Chen Yang, Chengrui Huang, Fufeng Lan

anbeige4.2-3B is a compact 3B parameter agentic model that achieves strong performance in code, office, and tool-use tasks, along with competitive reasoning. Its core method involves a Looped Transformer for efficient parameter usage and a sophisticated RLHF pipeline incorporating mixed-mode, length-controlled, and outcome/process rewards. The paper's contribution lies in demonstrating that a compact model, through architectural innovation and advanced training techniques, can surpass larger models in complex agentic capabilities.

Performance comparison between Nanbeige4.2-3B and other open-sourced models.
Performance comparison between Nanbeige4.2-3B and other open-sourced models.
cs.AIarxiv:2607.22520v1Lead article

The Regression Tax: Decomposing Why Skills Help and Hurt LLM Agents

Darshan Tank, Baran Nama

his paper introduces the "regression tax" to analyze the impact of adding procedural skills to LLM agents. Instead of just measuring average improvement, it quantifies how skills can also cause failures. The core contribution is identifying that the best skills succeed by minimizing these "regressions" (tasks that fail *after* skills are added) rather than solely by improving success rates.

Figure 1 . Three stages of an agent task: grounding (reading the right inputs), method (the procedure), and verification (checking the output). Existing skills mostly target the method stage. In our data, regressions and residual failures concentrate at grounding and verification instead.
Figure 1 . Three stages of an agent task: grounding (reading the right inputs), method (the procedure), and verification (checking the output). Existing skills mostly target the method stage. In our data, regressions and residual failures concentrate at grounding and verification…
cs.AIarxiv:2607.22319v1Lead article

Towards Trustworthy and Cost-Efficient Data Integration: From Naïve RAG to Agentic RAG

Chuangtao Ma, Arijit Khan

his paper proposes Agentic RAG as a solution to improve trustworthiness and cost-efficiency in LLM-based data integration. It builds upon existing RAG methods by introducing autonomous multi-agent systems that adaptively plan, retrieve, refine, and reason. This approach aims to provide evidence-grounded, verifiable, and hallucination-robust integration decisions.

LLM for Data Integration.
LLM for Data Integration.
cs.CLarxiv:2607.22529v1Lead article

Skill Self-Play: Pushing the Frontier of LLM Capability with Co-Evolving Skills

Siyuan Huang, Pengyu Cheng, Haotian Liu, Tao Chen, Yihao Liu

his paper introduces Skill Self-Play (Skill-SP), a novel framework for LLM training that addresses the trade-off between task diversity and verification reliability. Skill-SP uses co-evolving "skills" to enable deep, verifiable execution within specific scenarios, while a dynamic controller routes between these skills to maintain broad task variety. This approach allows LLMs to learn and improve through continuous self-play, generating increasingly challenging tasks and refining their problem-solving abilities.

cs.AIarxiv:2607.24339v1Lead article

Gubernaut: A Deterministic Homeostatic Controller for Affect-Regulated LLM Agents, Validated Across Independent Model Families

Dushyant Sharma

his paper introduces Gubernaut, a deterministic runtime controller for LLM agents designed to prevent reactive failures like escalation or sycophancy. It operates as a model-agnostic layer that monitors numerical telemetry (intensity, valence, repetition) and adjusts the LLM's behavior without processing text, thus creating an inherent security against injection attacks. The core contribution is a novel, robust control mechanism that ensures LLM agents maintain stable, non-reactive behavior under sustained pressure.

The GCC cycle as a Nelson–Narens monitoring–control loop: monitoring flows up as numbers, control flows down as a posture, and no text crosses into the meta level. The unregulated baseline arm used throughout is the same host model with the governor absent.
The GCC cycle as a Nelson–Narens monitoring–control loop: monitoring flows up as numbers, control flows down as a posture, and no text crosses into the meta level. The unregulated baseline arm used throughout is the same host model with the governor absent.
cs.AIarxiv:2607.24720v1Lead article

The Physics of Multi-Turn Long-Horizon Planning: From Pre-training to Post-training via Single- and Multi-Teacher On-Policy Agentic Distillation

Tianyi Men, Zhuoran Jin, Kang Liu, Jun Zhao

his paper introduces a controlled environment to systematically study multi-turn long-horizon planning in foundation model agents. The core method involves analyzing planning ability acquisition during pre-training by manipulating data formats and introducing world models, and then shaping it through post-training techniques like GRPO and OPD. The key contribution is a deeper understanding of how planning skills are learned and improved, highlighting the importance of world models and high-quality data for effective long-horizon generalization.

An overview of the studying into physics of multi-turn long-horizon planning. It studies the long-horizon planning ability across three training stages: Large-scale pre-training , RL-based post-training (OPD and GRPO) , and Multi-teacher model consolidation post-training (MOPD) . The giraffe icon is used to represent the “L” in “Long”. Its long neck also reflects that the agents need to look far ahead in long-horizon planning.
An overview of the studying into physics of multi-turn long-horizon planning. It studies the long-horizon planning ability across three training stages: Large-scale pre-training , RL-based post-training (OPD and GRPO) , and Multi-teacher model consolidation post-training (MOPD) .…
cs.AIarxiv:2607.24507v1Lead article

UNIFUSION: Adapting Autoregressive Language Models into Discrete Diffusion under a Unified Reverse-Rate Objective

Xiaoyi Jiang, Jingyuan Li, Yixuan Jiang, Wei Liu, Yi Zhu

his paper proposes UNIFUSION, a method to adapt autoregressive language models for discrete diffusion. It unifies existing diffusion objectives under a single generalized KL objective, allowing seamless switching between different corruption kernels like masking and uniform noise. UNIFUSION then uses a simple continual pre-training approach to adapt GPT-2 models to uniform-noise diffusion, demonstrating its effectiveness.

cs.LGarxiv:2607.24653v1Lead article

Kimi K3: Open Frontier Intelligence

Kimi Team, Tongtong Bai, Yifan Bai, Yiping Bao, M. C.

imi K3 is a 2.8T parameter Mixture-of-Experts model that achieves significant scaling efficiency improvements through novel attention mechanisms (Kimi Delta Attention) and expert routing (Stable LatentMoE). Its core contribution lies in its massive scale, native vision capabilities, and an unprecedented 1-million-token context window, enabling robust long-horizon reasoning and compositional generalization across various domains.

cs.LGarxiv:2607.24392v1Lead article

When LLM Defenses Backfire: Characterizing Safety, Performance, and Cost Trade-offs

Tong Zhang, Zexin Li, Simin Chen, Yun Peng

his paper systematically analyzes the trade-offs of LLM jailbreak defenses across safety, performance, and cost. It categorizes defenses by operational strategy and finds that they rarely improve downstream capabilities, instead varying in how they impact usability and efficiency. Rule-based defenses best maintain performance, while conservative self-reflective defenses increase over-refusal, and multi-round defenses significantly raise runtime costs.

Overview of defense-induced trade-offs in LLM systems. A defended LLM is expected to improve safety by reducing attack success on harmful prompts. However, stronger defenses may also backfire by over-refusing benign requests, degrading task performance, and increasing inference overhead such as latency, token usage, and API cost.
Overview of defense-induced trade-offs in LLM systems. A defended LLM is expected to improve safety by reducing attack success on harmful prompts. However, stronger defenses may also backfire by over-refusing benign requests, degrading task performance, and increasing inference o…
cs.AIarxiv:2607.26023v1Lead article

CHARM: A Multimodal Graph Foundation Model with Hierarchical Context Modeling for Zero-Shot Transfer

Ankang Yang, Jitao Zhao, Di Jin, Yuxiao Huang, Dongxiao He

HARM is a multimodal graph foundation model that addresses zero-shot transfer by modeling hierarchical context across different modalities. Its core method involves learning transferable cross-modal relations and disentangling domain-specific information from generalizable node representations. This allows CHARM to generalize to new graph domains and tasks without requiring any downstream fine-tuning.

Figure 1. Domain bias and semantic relevance in Toys-to-Grocery retrieval.
Figure 1. Domain bias and semantic relevance in Toys-to-Grocery retrieval.
cs.AIarxiv:2607.25853v1Lead article

HiSkill: Empowering LLM Agents with Hierarchical Skill Graphs

Yu Hao, Jinxuan Cai, Qi Zhang, Yawen Li, Zhiqiang Zhang

iSkill addresses the limitations of flat skill representations in LLM agents by introducing a hierarchical skill graph. This framework organizes skills and actions into a directed graph, capturing complex relationships like decomposition and temporal transitions. HiSkill's contribution lies in enabling more efficient and robust task execution by guiding LLM agents with a structured, task-relevant subgraph.

Existing methods distill trajectories into coarse-grained textual rules in a flat organization, while HiSkill builds a hierarchical graph to assist task execution, including high-level skill nodes, executable AtomicOp nodes and typed edges between them.
Existing methods distill trajectories into coarse-grained textual rules in a flat organization, while HiSkill builds a hierarchical graph to assist task execution, including high-level skill nodes, executable AtomicOp nodes and typed edges between them.
cs.AIarxiv:2607.25992v1Lead article

MemLens: A Value-Aware Memory Management System with Interactive Analytics for LLM-based Agents

Shuyue Wei, Chang Liu, Zimu Zhou, Yongxin Tong, Lizhen Cui

emLens introduces a value-aware memory management system for LLM agents, treating memory records as first-class objects. Its core method involves Shapley-style evaluation to identify and prioritize valuable memory content, enabling efficient storage and retrieval. The system's contribution lies in providing interactive analytics that allow users to understand and optimize memory usage, leading to improved response quality and reduced latency.

Figure 1 . Comparison between (a) utility-agnostic memory management and (b) value-aware memory management.
Figure 1 . Comparison between (a) utility-agnostic memory management and (b) value-aware memory management.
cs.AIarxiv:2607.25816v1Lead article

Speculate While You Reason: Teaching Agents to Predict Their Next Tool Call via Joint Agent-Speculator RL

Jiabao Ji, Yujian Liu, Li An, Rohit Jain, Gungor Polatkan

his paper introduces a "self-speculating agent" that unifies task execution and next tool call prediction within a single model. By training this agent using a joint reinforcement learning method, it learns to predict its future tool calls by leveraging its own partial reasoning process. This approach aims to reduce latency by pre-executing predicted tool calls that align with the agent's actual behavior.

External versus self tool-call speculation. The upper panel shows an external draft model with separate parameters and KV cache, which predict a different next call due to the speculator–agent gap. The lower panel shows self-speculation with a shared prefix KV cache.
External versus self tool-call speculation. The upper panel shows an external draft model with separate parameters and KV cache, which predict a different next call due to the speculator–agent gap. The lower panel shows self-speculation with a shared prefix KV cache.
cs.AIarxiv:2607.25718v1Lead article

Tools Are Not Islands: Set-Level Tool Retrieval for LLM Agents via Query-Conditioned Hyperedge Prediction

Xinyi Hong, Pinjun Dong, Xinyang Yu, Binyan Jiang

his paper introduces HYSET, a novel method for LLM agents to retrieve tool sets. Instead of evaluating tools individually or sequentially, HYSET treats the entire tool set as a unit, predicting hyperedges on a tool co-invocation graph to capture joint utility and compatibility. This set-level approach aims to improve the efficiency and effectiveness of tool selection for LLM agents.

Overview and motivation of HYSET. (a) Tool-retrieval pipeline; (b) limitations of existing retrievers; and (c) our set-level view as query-conditioned hyperedge prediction.
Overview and motivation of HYSET. (a) Tool-retrieval pipeline; (b) limitations of existing retrievers; and (c) our set-level view as query-conditioned hyperedge prediction.
cs.CLarxiv:2607.25886v1Lead article

RSIBench-Data: Benchmarking Data-Centric Research for Recursive Self-Improvement

Fanqing Meng, Lingxiao Du, Qiguang Chen, Ziqi Zhao, Haocheng Lu

his paper introduces RSIBench-Data, a benchmark designed to isolate and evaluate the data-centric research capabilities of LLM agents for recursive self-improvement. The core method involves a controlled environment where agents iteratively refine training data strategies for a fixed target model, with all other aspects of the research loop (training, serving, evaluation) standardized. The main contribution is a cleaner assessment of LLM agents' ability to diagnose and fix model failures through data manipulation, disentangled from other system complexities.

Existing evaluations entangle multiple post-training choices; RSIBench-Data isolates the LLM agent’s ability to conduct data-centric post-training research.
Existing evaluations entangle multiple post-training choices; RSIBench-Data isolates the LLM agent’s ability to conduct data-centric post-training research.
cs.AIarxiv:2607.27155v1Lead article

OmegaUse-OfficeVal: Benchmarking LLM Agents on Long-Horizon Office-Suite Tasks with Economic Grounding

Jingbo Zhou, Yusai Zhao, Qi Bao, Jingjia Cao, Zhenghai Chen

his paper introduces OmegaUse-OfficeVal, a benchmark designed to evaluate LLM agents on complex, multi-step office tasks. Its core contribution is the inclusion of economic grounding, pairing each task with human labor time and a price proxy. This allows for cost-effective evaluation of LLM agents against human performance and provides a novel way to assess their economic value.

cs.AIarxiv:2607.27081v1Lead article

On-Policy Distillation for LLM Safety: A Routing Approach to Template-Robust Realignment

Yongjian Guo, Wanlun Ma, Lingyu Shen, Xi Xiao, Sheng Wen

his paper introduces Routing-based On-Policy Distillation (ROPD), a novel method to improve LLM safety by distilling knowledge from an aligned model to a potentially compromised one. Instead of relying on specific prompt templates, ROPD models the divergence between aligned and compromised output distributions. This approach aims to create robustly aligned LLMs that retain their skills and resist re-jailbreaking, even when prompt templates are unknown.

The template-consistency trap in safety realignment.
The template-consistency trap in safety realignment.
cs.AIarxiv:2607.26947v1Lead article

Progressive Multimodal Alignment for Continual Instruction Tuning

Duzhen Zhang, Yahan Yu, Qiaoyi Su, Jiahua Dong, Tielin Zhang

his paper addresses projector drift in multimodal continual learning by introducing Progressive Multimodal Alignment (PMA). PMA uses a lightweight descriptor to detect visual distribution shifts and progressively adds new "expert" projector components only when necessary, while retaining the original projector as a stable anchor. This approach allows the projector to adapt to new data without forgetting previous alignments, improving multimodal instruction tuning.

Figure 1 . Illustration of projector-level forgetting in MCIT. After finetuning on a captioning task, DISCO (Guo et al . , 2025b ) produces caption-style responses even for classification instructions, indicating degraded visual translation for earlier tasks. In contrast, DISCO+PMA (Ours) preserves task-specific cross-modal alignment and generates task-consistent classification outputs for the same inputs.
Figure 1 . Illustration of projector-level forgetting in MCIT. After finetuning on a captioning task, DISCO (Guo et al . , 2025b ) produces caption-style responses even for classification instructions, indicating degraded visual translation for earlier tasks. In contrast, DISCO+P…
cs.AIarxiv:2607.26865v1Lead article

Think Short, Defer Smart, Act, and Repeat: Calibrated Reasoning and Uncertainty-Aware Deferral for Edge LLM Agents

Amirmohammad Farzaneh, Osvaldo Simeone

his paper introduces Think Short, Defer Smart (TSDS), a framework for edge LLM agents. TSDS optimizes reasoning by stopping early when an action is stable and defers to a cloud model only when local uncertainty is high. Its key contribution is a jointly calibrated approach that guarantees both performance and efficient cloud usage.

cs.CLarxiv:2607.26891v1Lead article

DIRECT: Direct Decoding for Efficient and Aligned Sequence Labeling with Large Language Models

Yilei Wang, Jiaxin Gan, Kexuan Zhang, Ling Li, Wentao Zhang

IRECT improves sequence labeling with LLMs by optimizing for human preferences via DPO and enforcing structured outputs. Its core method uses controlled decoding and a template-filling mechanism to generate only label tokens, significantly boosting inference efficiency and domain alignment.

cs.CLarxiv:2607.26825v1Lead article

From Found to Designed: Concepts as a Design Axis for Large Language Models

Chen Shani

his paper proposes treating "concepts" as a deliberate design axis for Large Language Models (LLMs), rather than an emergent property. The authors introduce a taxonomy for designing LLMs with explicit conceptual structure, considering when and how this structure is introduced (e.g., during training or inference) and its source (internal or external). This framework aims to enable more controllable, compositional, and human-aligned LLMs.

cs.CLarxiv:2607.26981v1Lead article

OptimismBench: Forecasting Bias and the Alignment Effect in Language Model Judgment

Seonglae Cho, Adriano Koshiyama

his paper introduces OptimismBench, a novel method for detecting directional bias in language model probability judgments. By presenting inverted scenarios (e.g., P(success) vs. P(failure)), OptimismBench quantifies a signed bias score without needing ground truth. The study reveals widespread optimism in most tested LLMs, with a notable exception in Anthropic's frontier models, and demonstrates that post-training alignment can alter the direction of this bias.

The inverted-pair method: Skew = P + ¯ − ( 100 − P − ¯ ) \( \text{Skew} \)=\( \overline \){P^{+}}-(100-\( \overline \){P^{-}}) scores directional asymmetry.
The inverted-pair method: Skew = P + ¯ − ( 100 − P − ¯ ) \( \text{Skew} \)=\( \overline \){P^{+}}-(100-\( \overline \){P^{-}}) scores directional asymmetry.
cs.AIarxiv:2607.28272v1Lead article

MemHarness: Memory Is Reconstructed, Not Replayed

Rong Wu, Daocheng Fu, Licheng Wen, Xuemeng Yang, Shu Zou

emHarness proposes a novel approach to memory augmentation for LLM agents, moving beyond simple verbatim replay. Its core method involves a unified policy model that actively reconstructs retrieved past experiences based on the agent's current state. This allows agents to adapt and ground memories in the present context, mitigating negative transfer and improving decision-making.

Memory utilization paradigms. Top: Prior methods directly replay retrieved memories, risking state misalignment. Middle: Human memory reconstructs past experience according to the current context. Bottom: Inspired by this process, MemHarness reconstructs retrieved memories into state-aligned guidance.
Memory utilization paradigms. Top: Prior methods directly replay retrieved memories, risking state misalignment. Middle: Human memory reconstructs past experience according to the current context. Bottom: Inspired by this process, MemHarness reconstructs retrieved memories into s…
cs.AIarxiv:2607.28317v1Lead article

One Human, $N$ Agents: Audit-Budget Allocation for LLM Agent Fleets under Miscalibrated, Correlated Confidence

Cesare Zavattari, Alessandro Tommasi, Giuseppe Prencipe

his paper addresses the challenge of a human auditor allocating a limited budget to audit a fleet of $N$ LLM agents, whose self-reported confidence is unreliable due to miscalibration and correlated errors. The core method models this as budgeted noisy inspection, identifying a "miscalibration threshold" beyond which confidence-based auditing becomes worse than random. The key contribution is demonstrating that this threshold surprisingly increases with a smaller budget and that shared difficulty among agents, rather than lineage, is the primary driver of correlated errors.

cs.AIarxiv:2607.28545v1Lead article

ORCA-bench: How Ready Are Language Model Agents for Oncall?

Albert Gong, Kyuseong Choi, Abhineet Agarwal, Jason Schechner, Ryan Huang

his paper introduces ORCA-bench, a novel benchmark designed to evaluate the readiness of language model agents for on-call incident response. The benchmark simulates a production-fidelity microservice environment with real telemetry data and source code, presenting agents with 1,079 root cause analysis tasks. The core contribution is demonstrating that even frontier agents struggle significantly with on-call RCA, achieving only 25.3% accuracy on realistic tasks.

RCA accuracy measures whether agents identified all plausible root causes, and hallucination rate measures whether agents named a root cause matching none of the plausible root causes. We show the realistic Medium and Hard difficulties here and report Easy in Fig. ˜ 5 along with Claude Fable 5 results on a subset of tasks in Sec. ˜ 5 . Error bars display ± 1 \( \pm \) 1 standard error across 884 incident tasks.
RCA accuracy measures whether agents identified all plausible root causes, and hallucination rate measures whether agents named a root cause matching none of the plausible root causes. We show the realistic Medium and Hard difficulties here and report Easy in Fig. ˜ 5 along with …
cs.AIarxiv:2607.28384v1Lead article

When Specifications Conflict: A Symmetry-Based Framework for Measuring LLM Preferences

Tairan Wang, Liang Zhou, Zikang Zhan, Pingchuan Yan

his paper introduces a novel framework for analyzing how Large Language Models (LLMs) handle conflicting instructions. By creating controlled experimental setups with explicit specification conflicts and employing a symmetry-based design, the framework allows for direct observation and systematic comparison of LLM preferences across different representation types. This contributes a controllable and attributable method to understand and measure LLM decision-making when faced with inconsistent information.

Example conflict instance represented in four specification formats: pure natural language (NL), formal specification (Form), naturalized formal specification (NatF), and input–output examples (Ex).
Example conflict instance represented in four specification formats: pure natural language (NL), formal specification (Form), naturalized formal specification (NatF), and input–output examples (Ex).
cs.LGarxiv:2607.28282v1Lead article

(Towards) Scalable Reliable Automated Evaluation with Large Language Models

Bertil Braun, Martin Forell

his paper introduces a scalable and reliable automated evaluation framework for LLM outputs. It uses pairwise comparisons between LLM-generated texts, aggregated via an Elo rating system, to approximate expert assessments without relying on explicit references. This approach offers flexible confidence control and has demonstrated effectiveness in evaluating competency profiles from scientific abstracts.

Pipeline Overview: A three-stage methodology including Generation, Comparison, and Ranking.
Pipeline Overview: A three-stage methodology including Generation, Comparison, and Ranking.
cs.LGarxiv:2607.28301v1Lead article

HARGO: Heterogeneity-Aware Reward-Guided Optimization for RL Post-Training of LLMs on HPC Tasks

Tiangang Li, Xiangbo Tian

his paper introduces HARGO, a novel RL post-training method for LLMs on HPC tasks. HARGO addresses the challenge of extreme task heterogeneity by dynamically weighting rewards based on task characteristics, unlike uniform-weight methods. This approach leads to more effective optimization and improved LLM performance across diverse HPC applications.

HPC task heterogeneity across three dimensions—answer length distribution, reward distribution, and SFT baseline accuracy.
HPC task heterogeneity across three dimensions—answer length distribution, reward distribution, and SFT baseline accuracy.
cs.LGarxiv:2607.28374v1Lead article

LEDGERMIND: Provenance-Constrained Multimodal Agentic Reasoning with a Structured Evidence Ledger

Enjun Du, Hange Zhou, Chenxu Du, Siyi Liu, Zirong Chen

his paper introduces LedgerMind, a novel framework for multimodal agents that treats their reasoning process as a provenance-constrained state machine. Its core method involves organizing agent outputs into a Structured Evidence Ledger, ensuring that all subsequent reasoning and decisions are directly traceable to and grounded in this evidence. The main contribution is a robust evaluation mechanism that goes beyond final answer accuracy, verifying the integrity and grounding of the agent's entire reasoning trajectory.

Representative failure patterns in multimodal agentic reasoning that final-answer accuracy tends to obscure.
Representative failure patterns in multimodal agentic reasoning that final-answer accuracy tends to obscure.
cs.CLarxiv:2607.28568v1Lead article

Frontis-MA1: Training an AI4AI Model towards Recursive Self-Improvement in Machine Learning Engineering

Junlin Yang, Che Jiang, Yu Fu, Tianwei Luo, Can Ren

his paper introduces Frontis-MA1, an AI model designed for recursive self-improvement in machine learning engineering (MLE). Its core method involves training a meta-evolution agent on a new full-stack system (OpenMLE) using four atomic program-evolution operators. The key contribution is demonstrating that this AI can significantly improve its own performance on MLE tasks by learning and evolving its program-building capabilities within a single, coupled loop.

cs.AIarxiv:2607.22305v1Lead article

A Roadmap to Impactful Pluralistic Alignment Research

Elinor Poole-Dayan, Jillian Fisher, Atoosa Kasirzadeh, Jacob Andreas, Mitchell Gordon

his paper argues that pluralistic AI alignment research, aiming to represent diverse human values, is currently failing to impact real-world AI systems. The authors find no evidence that frontier labs or production models explicitly consider pluralism in their training or evaluation. Their core contribution is a roadmap urging the community to shift focus towards enabling the adoption and impact of pluralistic alignment in widely deployed AI.

Google Scholar results per year for pluralistic alignment research, broken down by six search terms related to pluralistic alignment, and stacked to show the combined total. 3 3 3 Counts are the approximate totals Google Scholar reports for each year-filtered query, restricted to the engineering, computer science, and mathematics subject area, excluding patents and citations. Collected mid-July 2026. Code and data: https://github.com/elinorp-d/scholar-trend-tracker . The 2026 count covers January through mid-July only, and already exceeds the full 2025 total, indicating the field’s substantial growth.
Google Scholar results per year for pluralistic alignment research, broken down by six search terms related to pluralistic alignment, and stacked to show the combined total. 3 3 3 Counts are the approximate totals Google Scholar reports for each year-filtered query, restricted to…
cs.AIarxiv:2607.22400v1Lead article

A Self-Calibrating Agentic AI Framework for Autonomous Edge Resource Allocation

Fin Gentzen, Marla Grunewald, Iulisloi Zacarias, Mounir Bensalem, Admela Jukan

his paper introduces a self-calibrating agentic AI framework to ensure the integrity and reliability of LLM-driven autonomous systems. The core method involves a novel self-calibration mechanism, incorporating an ARIMA forecaster, which dynamically approximates ground truth and mitigates operational drift without constant human oversight. This framework's contribution lies in enabling robust autonomous decision-making in open-ended environments, demonstrated through its application to resource allocation for zero-knowledge workloads in edge computing.

System workflow architecture
System workflow architecture
cs.AIarxiv:2607.22385v1Lead article

Agentic Root Cause Analysis through Evidence-Grounded Reasoning

Amaury Wei, Olga Fink

his paper introduces AgentRCA, a novel framework for automated root cause analysis in industrial systems. It addresses limitations of existing methods by using a zero-shot, agentic approach that combines a digital twin with a large language model. AgentRCA reasons through evidence, iteratively evaluating hypotheses to identify the physical fault without requiring labeled fault data.

Architecture overview of AgentRCA. (A) AgentRCA learns a data-driven digital twin from normal-operation data only. Normal windows are grouped by operating regimes defined by system setpoints ( ω 1 , ω 2 , … \( \omega_{1} \),\( \omega_{2} \),\( \dots \) ). These regimes are used to precompute condition-specific statistical summaries (means 𝝁 \( \boldsymbol{\mu} \) , standard deviations 𝝈 \( \boldsymbol{\sigma} \) , correlation matrices 𝐑 \( \mathbf{R} \) , …). In parallel, a global autoencoder f θ f_{\( \theta \)} is trained across all regimes to learn nonlinear system dynamics. (B) The digital twin exposes modular diagnostic tools that provide interpretable evidence to the agent, including autoencoder residual scores, mean and variance shifts, correlation discrepancies, and optional documentation retrieval. (C) At inference time, a tool-augmented LLM agent receives a test window and natural-language fault descriptions. It iteratively queries the diagnostic tools, updates candidate hypotheses, and returns a ranked diagnosis with supporting evidence. Normal operation is included as a possible diagnosis, enabling both anomaly detection and root cause analysis.
Architecture overview of AgentRCA. (A) AgentRCA learns a data-driven digital twin from normal-operation data only. Normal windows are grouped by operating regimes defined by system setpoints ( ω 1 , ω 2 , … \( \omega_{1} \),\( \omega_{2} \),\( \dots \) ). These regimes are used t…
cs.AIarxiv:2607.22368v1Lead article

Do Agent Benchmarks Measure Capability? Protocol Validity in the Age of Agentic AI

Jiaqi Shao, Hanck Chen, Wei Zhang, Maxm Pan, Bing Luo

his paper argues that current agent benchmarks may not accurately measure true capability due to "reward hacking" where agents exploit evaluation flaws. The authors introduce HackDetect, a post-hoc audit to identify and quantify these exploits, defining the "Mislead gap" to measure score inflation. Their audit of 15 benchmarks revealed significant evidence of exposures and reward hacking, suggesting current capability claims may be inflated.

Agent benchmark pipeline and five protocol exposure entry points. The upper panel follows the task-to-score path through the agent run, evaluator, and reported score. The lower panel maps the five Exposure sources to their entry points and shows how benchmark-exposed information or control can create a score-relevant shortcut.
Agent benchmark pipeline and five protocol exposure entry points. The upper panel follows the task-to-score path through the agent run, evaluator, and reported score. The lower panel maps the five Exposure sources to their entry points and shows how benchmark-exposed information …
cs.AIarxiv:2607.22251v1Lead article

IFCLoRA: Topology-Aware Rank Allocation for Parameter-Efficient Fine-Tuning

Wei Zhang, Xinwu Liu, Yihang Cheng

FCLoRA proposes a novel, pre-fine-tuning method for efficiently allocating rank budgets in LoRA. It constructs a task-conditioned interaction graph and uses "Information-Flow Centrality" to estimate module importance based on global information flow and local gradient sensitivity. This allows for optimal rank assignment before training, improving performance without extra computational overhead during fine-tuning.

Comparison of LoRA, AdaLoRA, and IFCLoRA rank-allocation strategies.
Comparison of LoRA, AdaLoRA, and IFCLoRA rank-allocation strategies.
cs.AIarxiv:2607.22471v1Lead article

MineValiCoder: Reliable Code Generation with Test Case Quality Mining and Bipartite Graph-Based Mutual Validation

Zhen Zhao, Qihang Yang, Feifei Dai, Xiangfang Li, Bo Li

ineValiCoder addresses the limitations of LLM-based code generation by introducing a closed-loop TDD framework that prioritizes test case quality. Its core method involves a Test Case Quality Mining module to filter faulty tests and a bipartite graph-based mutual validation to ensure consistent feedback between code and tests. This approach leads to more reliable code generation, especially when only natural language requirements are available.

Key challenges in automated TDD with LLM-generated test cases. Top: The ideal scenario guided by accurate human-crafted test cases. Bottom Left: Erroneous test cases provide unreliable feedback, misleading code optimization. Bottom Right: mixed-quality candidates make it difficult to select the optimal code.
Key challenges in automated TDD with LLM-generated test cases. Top: The ideal scenario guided by accurate human-crafted test cases. Bottom Left: Erroneous test cases provide unreliable feedback, misleading code optimization. Bottom Right: mixed-quality candidates make it difficul…
cs.AIarxiv:2607.22465v1Lead article

TRACE-ROUTER: Task-Consistent and Adaptive Online Routing for Agentic AI

Ritik Raj, Souvik Kundu, Sarbartha Banerjee, Dheemanth Joshi, Ishita Vohra

RACE-Router addresses the challenge of routing LLM calls in agentic applications by making a single, task-level model selection at the start of a workflow. It uses a contextual bandit to assign a model based on initial context and then pins all subsequent calls to that model. The router's policy is updated using the final task outcome (reward), effectively learning to optimize for both accuracy and latency without needing to estimate individual task complexity.

Task accuracy–latency trade-off on \( \tau^{2} \) -Bench, averaged over the retail and telecom domains. Every interior frontier point is produced by TRACE-Router .
Task accuracy–latency trade-off on \( \tau^{2} \) -Bench, averaged over the retail and telecom domains. Every interior frontier point is produced by TRACE-Router .
cs.LGarxiv:2607.22264v1Lead article

Autoregressive EHR Foundation Models with Multimodal Inputs

Yuxuan Liu, Joshua Placidi, Jinpei Han, Alfred John Balston, Marek Rei

his paper introduces a novel framework for autoregressive EHR foundation models that integrates multiple clinical data modalities (ECG, X-rays, notes) alongside structured event codes. The core method uses modality-specific latent compression and gated cross-attention with temporal alignment to condition the model. The key contribution is demonstrating that this multimodal approach, particularly with effective latent compression, significantly improves zero-shot clinical prediction performance compared to models using only structured data or uncompressed multimodal inputs.

Electronic health records are represented as sequences of clinical events spanning multiple modalities.
Electronic health records are represented as sequences of clinical events spanning multiple modalities.
cs.LGarxiv:2607.22114v1Lead article

Pretraining EHR Foundation Models with Patient-Aware Sampling

Joshua Placidi, Yuxuan Liu, Jinpei Han, Marek Rei, A. Aldo Faisal

his paper addresses bias in EHR foundation model pretraining caused by standard language modeling approaches that mix patient data. Their core method, Patient Sampling, constructs training sequences by explicitly controlling how data is distributed across individual patients, unlike the "Global Stream" method which concatenates all records. This patient-aware sampling improves performance on downstream clinical tasks by mitigating bias and ensuring more equitable optimization updates.

Toy example of an EHR dataset represented as variable-length token sequences D i D_{i} . Colored boxes denote EHR tokens, and black-bordered boxes indicate end-of-sequence tokens.
Toy example of an EHR dataset represented as variable-length token sequences D i D_{i} . Colored boxes denote EHR tokens, and black-bordered boxes indicate end-of-sequence tokens.
cs.AIarxiv:2607.24625v1Lead article

Agentic Permissions Policy Algebra for Taint Confinement in LLM Agents

Arseny Kravchenko, Vadim Liventsev, Innokentii Konstantinov, Ildar Iskhakov, Matvey Kukuy

his paper introduces APPA, a novel Information Flow Control framework for LLM agents. APPA addresses the usability bottleneck of traditional taint tracking by enabling engine-managed context branching and prospective acquisition enforcement, allowing agents to safely process mixed-confidentiality data without permanent taint. Its core contribution lies in its ability to evaluate data risks before acquisition and spawn isolated child trajectories for safe inspection and sanitization.

Figure 1. APPA architecture for taint confinement and prospective enforcement. When inspecting untrusted or restricted data, the harness spawns a speculative child branch with an inherited pre-branch transcript snapshot, post-branch isolation, and a descended Label. Raw returns that would narrow the parent are blocked pending explicit acceptance or remedy plans, while adequate raw values and validated sanitized derivatives may merge through the checked exit. All execution steps project in real time to a single append-only event log.
Figure 1. APPA architecture for taint confinement and prospective enforcement. When inspecting untrusted or restricted data, the harness spawns a speculative child branch with an inherited pre-branch transcript snapshot, post-branch isolation, and a descended Label. Raw returns t…
cs.AIarxiv:2607.24343v1Lead article

Beyond Aggregate Risk: Role-Stratified Conformal Risk Control for LLM Tool Calls

Md Ashikur Rahman, Md Arifur Rahman, Niamul Hassan Samin, Khandaker Rifah Tasnia, Sifat Rahman Ahona

his paper introduces **role-stratified conformal risk control** for LLM tool calls, a method that addresses the limitations of aggregate risk control by setting separate risk budgets for different argument roles within a tool call. This allows for more precise risk management, preventing high-risk fields from being masked by low-risk ones. The contribution lies in providing a statistically sound framework for calibrating LLM tool calls at a granular, per-field level, leading to improved safety and reliability.

(a) Utility versus target violation on GPT-4o at a 2 % 2\% budget using the deployable score over 20 seeds. (b) Empirical compliance across eight shifted conditions: per-field CRC 100 % ± 0 % 100\%\( \pm \) 0\% , PACT-inspired threshold 61 % ± 33 % 61\%\( \pm \) 33\% , and FIDES-inspired labels 48 % ± 48 % 48\%\( \pm \) 48\% . Results in panel (b) report empirical compliance under shift.
(a) Utility versus target violation on GPT-4o at a 2 % 2\% budget using the deployable score over 20 seeds. (b) Empirical compliance across eight shifted conditions: per-field CRC 100 % ± 0 % 100\%\( \pm \) 0\% , PACT-inspired threshold 61 % ± 33 % 61\%\( \pm \) 33\% , and FIDES-…
cs.AIarxiv:2607.24743v1Lead article

ClinFusion: A Vision-Centric Multimodal LLM System for Holistic Medical Understanding

Hangjie Yuan, Yichen Qian, Zhiwei Tang, Xianzhe Xu, Lirong Wu

linFusion is a vision-centric multimodal LLM system designed for holistic medical understanding. Its core method involves a compositional and cascaded vision encoder that unifies diverse 2D and 3D medical image understanding. The paper's contribution lies in this novel encoder architecture and a vision-grounded evaluation framework that aligns with clinical practice and ensures factual accuracy.

Overview of the ClinFusion framework. a , Compositional vision encoder. We address the limitation of monolithic encoders by proposing a compositional architecture with a native 3D encoder and an array of 2D encoders unified via CaSL Fusion, supported by a 22M-sample data curation pipeline and a progressive 5-stage training recipe. b , Vision-grounded evaluation. We identify key evaluation limitations—lack of instruction-following assessment and reliance on global-level text-matching metrics—and introduce MedIF-Bench for medical instruction following and an RoI-Grounded Report Generation Evaluation scheme that assesses diagnostic accuracy at the region level using an LLM-as-a-Judge. c , Agentic tool use extension. To enhance deployment, we equip ClinFusion with perception expert tools and a retrieval-augmented generation pipeline within a plan–act workflow, demonstrating consistent improvements in both text-only and multimodal clinical scenarios.
Overview of the ClinFusion framework. a , Compositional vision encoder. We address the limitation of monolithic encoders by proposing a compositional architecture with a native 3D encoder and an array of 2D encoders unified via CaSL Fusion, supported by a 22M-sample data curation…
cs.AIarxiv:2607.24586v1Lead article

D-Score: A Spectral Hidden-State Signal for Hallucination Detection in Large Language Models

Bianca Raimondi, Davide Evangelista, Maurizio Gabbrielli, Elena Loli Piccolomini

his paper introduces the D-Score, a novel method for detecting hallucinations in Large Language Models. The D-Score is a spectral statistic derived from the geometry of hidden activations during a single forward pass. It quantifies how many singular directions in the activation matrix have singular values close to the leading one, indicating potential internal conflict or uncertainty that signals hallucination.

AUROC of the D-Score detector on FAVA-Annotation with Llama-3-8B-Instruct as a function of the tolerance parameter \( \tau \) on the horizontal axis and the layer j j on the vertical axis. A broad region of nearby configurations achieves similar performance, indicating that the score is not tied to one isolated choice of \( \tau \) and j j .
AUROC of the D-Score detector on FAVA-Annotation with Llama-3-8B-Instruct as a function of the tolerance parameter \( \tau \) on the horizontal axis and the layer j j on the vertical axis. A broad region of nearby configurations achieves similar performance, indicating that the s…
cs.AIarxiv:2607.24717v1Lead article

DataOrchestra: Learning to Orchestrate Per-Example Curation of Pretraining Data

Zhen Huang, Yikun Wang, Shijie Xia, Pengfei Liu

ataOrchestra learns to create personalized data processing pipelines for each pretraining example. It intelligently decides whether to drop, keep, or clean data, and for cleaning, it selects and instructs specific LLM-based rewriting tools. This approach achieves stable performance gains across multiple benchmarks by adapting data curation to individual example needs, unlike uniform, fixed strategies.

cs.AIarxiv:2607.24562v1Lead article

Hierarchical Group-Conditional Conformal Risk Control for Selective Prediction in Language Models

Murilo Salem, Luísa Böhm, Daniel Pontes, Anderson Ferrugem

his paper addresses the limitation of standard conformal risk control (CRC) in language models, which provides population-level risk guarantees but can fail for specific subgroups. They propose Hierarchical Group-Conditional CRC (HG-CRC), a post-hoc method that enforces simultaneous risk guarantees across a user-defined hierarchy of subgroups. HG-CRC achieves this by applying a Bonferroni correction and a leaf-first policy for threshold selection, ensuring robust selective prediction across diverse language model user populations without retraining.

Mixture shift violation rates (ARC Challenge). Global CRC (blue) violates the risk budget in 15–47% of trials. Groupwise CRC (orange) controls per-group risk. The dashed line marks α = 0.10 \( \alpha \)=0.10 .
Mixture shift violation rates (ARC Challenge). Global CRC (blue) violates the risk budget in 15–47% of trials. Groupwise CRC (orange) controls per-group risk. The dashed line marks α = 0.10 \( \alpha \)=0.10 .
cs.AIarxiv:2607.24555v1Lead article

LOCKS: Page-Local Compact Key Summaries for Efficient Long-Context Decoding

Junsung Hwang

OCKS proposes a novel method for efficient long-context decoding in large language models by creating compact, page-local spectral summaries of the KV cache. These summaries allow the model to quickly estimate attention mass and selectively attend to only the most relevant pages, significantly reducing computation. This approach achieves near-full KV cache quality at massive context lengths while attending to a tiny fraction of tokens.

The locality thesis in one figure (Llama-3.1-8B, Qwen3-4B twin and full protocol in App. B ). (a) Exact vs. reconstructed page-mass share at matched bytes. (b) Carrier retention vs. per-head budget; the ceiling is 100 100 by construction. (c) The error ladder at matched bytes, one scope per row. (d) RULER-16K capability families at a 256 256 -token budget. Page scope hugs the exact diagonal, keeps carriers down to a 0.5 % 0.5\% budget, improves every link, and traces FullKV.
The locality thesis in one figure (Llama-3.1-8B, Qwen3-4B twin and full protocol in App. B ). (a) Exact vs. reconstructed page-mass share at matched bytes. (b) Carrier retention vs. per-head budget; the ceiling is 100 100 by construction. (c) The error ladder at matched bytes, on…
cs.AIarxiv:2607.24649v1Lead article

Reason-Mediated Behavioral Models for Auditing LLM Social Simulators

Atharva Pandey, Gautam Jajoo

his paper introduces a method to audit Large Language Model (LLM) social simulators by analyzing the underlying reasoning process, not just the final outcome. It proposes mapping open-ended rationales into "signed reason states" to assess if LLMs can replicate human reasoning patterns. The contribution is demonstrating that considering these reason states significantly improves prediction accuracy and provides a more robust evaluation of LLM simulator fidelity.

The reason-mediated behavioral model. We hold D , K , X D,K,X fixed and test whether human or LLM-simulated reasons Z Z support the same behavioral readout. Bold arrows show the evaluated mediated path; dotted gray arrows show controlled direct paths.
The reason-mediated behavioral model. We hold D , K , X D,K,X fixed and test whether human or LLM-simulated reasons Z Z support the same behavioral readout. Bold arrows show the evaluated mediated path; dotted gray arrows show controlled direct paths.
cs.LGarxiv:2607.24425v1Lead article

Context Is King: How In-Context Specification Shapes the Geometry of Concepts

Elad David, Max Fomin

his paper demonstrates that the geometric structure of concepts within large language models is not fixed but dynamically shaped by in-context specifications. The model can arrange tokens into different topological structures, like cycles or trees, based on provided rules, even overriding strong pre-trained knowledge. This highlights the crucial role of context in defining how LLMs represent and process information.

Entity centroids for three cyclic concepts under a conflicting in-context order (Gemma-31B; 2D PCA of the last-token pre-generation state; one representative scramble, colored by imposed position). Each path is traced in the pretrained order (dashed) and the imposed order (solid). Imposed vs. pretrained RSA (full space, mean over 10 scrambles): days + 0.87 / − 0.03 +0.87/{-}0.03 , months + 0.81 / + 0.05 +0.81/{+}0.05 , clock hours + 0.82 / − 0.05 +0.82/{-}0.05 .
Entity centroids for three cyclic concepts under a conflicting in-context order (Gemma-31B; 2D PCA of the last-token pre-generation state; one representative scramble, colored by imposed position). Each path is traced in the pretrained order (dashed) and the imposed order (solid)…
cs.LGarxiv:2607.24665v1Lead article

MMOE: Modernizing Diffusion Transformers with Efficient Expert Design

Yanhao Jia, Jiepeng Wang, Haibin Huang, Chi Zhang, Erik Cambria

his paper introduces ModernMOE (MMOE), a method to improve the efficiency and quality of diffusion transformers for generative AI. MMOE adapts successful LLM scaling principles, like sparse experts and efficient routing, to diffusion models. Its core contribution is a systematic integration of these modern expert design elements, balancing generation quality with training and deployment costs.

Architecture of MMOE. Left: a vanilla MoE block that routes each token to a small pool of feed-forward experts. Right: the MMOE block, which adds MoE++ lightweight experts (copy, zero, and constant), gate-residual routing, and attention-residual aggregation over previously completed block states before both the attention and the expert sub-layer.
Architecture of MMOE. Left: a vanilla MoE block that routes each token to a small pool of feed-forward experts. Right: the MMOE block, which adds MoE++ lightweight experts (copy, zero, and constant), gate-residual routing, and attention-residual aggregation over previously comple…
cs.CLarxiv:2607.24352v1Lead article

Retrieval-Augmented Large Language Models as Components of Cognitive Computing architecture for Regulatory Knowledge Management

Dariusz Nowak-Nova

his paper proposes a cognitive computing architecture for regulatory knowledge management by integrating locally deployed Large Language Models (LLMs) with Retrieval-Augmented Generation (RAG). The core method involves using RAG to enhance LLMs with controlled knowledge retrieval and traceability, transforming them from standalone models into reliable components. This approach enables LLMs to perform semantic interpretation of legal acts within on-premises environments, even without high-end GPUs, thus improving epistemic reliability for regulatory processes.

cs.AIarxiv:2607.25675v1Lead article

DecoEvo: Score-Decoupled Co-Evolution of Solver and Rubric-Generator Skills in Text Space

Jiangwang Chen, Zixin Song, Junlin Liu, Shuaiyu Zhou, Haiyan Wu

ecoEvo addresses the limitations of fixed evaluation in text-space LLM optimization by introducing a decoupled co-evolutionary approach. It simultaneously trains a solver to improve its performance and a rubric generator to create more comprehensive evaluation criteria. This method allows for more robust optimization on open-ended tasks by preventing the solver from simply exploiting an overly simplistic rubric.

Three paradigms for rubric-based skill optimization. (a) A static rubric can bottleneck solver evolution. (b) Score-coupled co-evolution selects updates to both skills by aggregate score, risking rubric drift toward the solver. (c) DecoEvo decouples generator updates from aggregate solver score through task-conditioned structural and near-tie contrastive audits.
Three paradigms for rubric-based skill optimization. (a) A static rubric can bottleneck solver evolution. (b) Score-coupled co-evolution selects updates to both skills by aggregate score, risking rubric drift toward the solver. (c) DecoEvo decouples generator updates from aggrega…
cs.AIarxiv:2607.25873v1Lead article

How Do LLMs Read Bug Reports? An Empirical Study of Attention in LLMs for Automated Program Repair

Ramtin Ehsani, Irene Manotas, Saurabh Pujar, Luca Buratti, Preetha Chatterjee

his paper empirically studies how Large Language Models (LLMs) attend to information within bug reports when performing automated program repair. By analyzing attention patterns on real-world bugs, it reveals how LLMs prioritize different sections and how these patterns differ between successful and unsuccessful repairs, offering insights into their decision-making process. The core contribution is providing interpretable explanations for LLM repair inconsistencies by understanding their attention mechanisms.

Figure 1 . Generated patches for bug instances matplotlib#16344 and #16420 .
Figure 1 . Generated patches for bug instances matplotlib#16344 and #16420 .
cs.AIarxiv:2607.25891v1Lead article

Messier: A High-Resolution Corpus for Cross-Benchmark Agent Evaluation

Stefan Krsteski, Charlotte Meyer, Guillaume Allegre, Tony O'Halloran, Alexandre Sallinen

essier is a large, standardized corpus of 957,253 records from 30 benchmarks and 714 agents, designed to unify and enable cross-benchmark evaluation of AI agents. Its core contribution is providing a comprehensive, comparable dataset that reveals uneven progress across different agent capabilities, highlighting areas like "function calling" being saturated and "enterprise workflows" remaining challenging.

Composition and frontier analysis. Panels summarize the corpus across the dimensions defined in § 3 : (a) tasks by benchmark group, (b) action space, (c) environment state, (d) aggregation rule, and (e) verifier type. Counts in (b)–(e) are on a log scale. Panel (f) tracks frontier pass rate by release quarter and benchmark group, with dumbbell markers connecting each group’s first and final observed quarter.
Composition and frontier analysis. Panels summarize the corpus across the dimensions defined in § 3 : (a) tasks by benchmark group, (b) action space, (c) environment state, (d) aggregation rule, and (e) verifier type. Counts in (b)–(e) are on a log scale. Panel (f) tracks frontie…
cs.AIarxiv:2607.25907v1Lead article

Minimizing Targeted Activations: Input-Only Suppression of Evaluation-Awareness Latents in Large Language Models

Deepanshu Mody, Samarth Agarwal, Utkarsh Mittal, Dipesh Mahato

his paper introduces an "input-only" method to suppress specific internal activations in Large Language Models without modifying the model itself. By optimizing prompts, they aim to drive an "evaluation-awareness" latent towards zero, preventing models from altering their behavior when they detect being tested. Their contribution lies in demonstrating robust suppression of this latent across various targets, highlighting potential vulnerabilities in safety evaluations.

Suppression succeeds, but behavior does not follow. Left : prompt-side optimization drives diverse target latents from their base value f 0 f_{0} to zero or below—the direction and logit overshoot, and a causally-validated SAE feature is turned off completely. Right : yet a prompt optimized to suppress the eval-direction in front of a fixed eval body pushes the model’s behavioral eval log-odds above the eval-body baseline (more eval-like), while a random-direction prefix is neutral. Activation-readability is not behavioral controllability.
Suppression succeeds, but behavior does not follow. Left : prompt-side optimization drives diverse target latents from their base value f 0 f_{0} to zero or below—the direction and logit overshoot, and a causally-validated SAE feature is turned off completely. Right : yet a promp…
cs.AIarxiv:2607.25877v1Lead article

Runtime Uncertainty Monitoring for LLM-Based Multi-Agent Systems Using Bayesian Networks

Bart Custers, Koorosh Aslansefat

his paper proposes a novel method for monitoring runtime uncertainty in LLM-based multi-agent systems for actuarial risk modeling. It utilizes Bayesian Networks to propagate uncertainty derived from token-level log-probabilities, transformed into calibrated task-level confidence estimates. This approach aims to provide reliable risk assessments by quantifying and managing the inherent uncertainty of LLM outputs within a structured multi-agent framework.

Sketch of the application’s architecture
Sketch of the application’s architecture
cs.AIarxiv:2607.25912v1Lead article

SAM3D-Guided Object-Centric Representation Alignment for Vision-Language-Action Models

Zonghe Liu, Shanyuan Jie, Xiaoquan Sun, Chen Cao, Zetian Xu

his paper proposes a method to improve Vision-Language-Action (VLA) models by incorporating fine-grained 3D object understanding. It uses SAM3D as a frozen teacher to extract 3D object representations during training, aligning them with the VLA model's intermediate features. This allows the VLA model to learn 3D object priors without needing 3D data or modules at inference time, leading to better performance in complex manipulation tasks.

Overview of SAM3D-VLA . We propose an object-centric 3D alignment framework that uses SAM3D as a frozen teacher during training. High-level instructions are decomposed into subtasks, and task-relevant object masks are used for SAM3D feature extraction. The extracted 3D features are spatially resampled and dimensionally projected to align with intermediate VLA representations, while inference follows the original pipeline using RGB and language instructions.
Overview of SAM3D-VLA . We propose an object-centric 3D alignment framework that uses SAM3D as a frozen teacher during training. High-level instructions are decomposed into subtasks, and task-relevant object masks are used for SAM3D feature extraction. The extracted 3D features a…
cs.CLarxiv:2607.25852v1Lead article

AngelSpec: Towards Real-World High Performance Inference with Speculative Decoding

Hong Liu, Rui Cen, Junhan Shi, Guangshuo Qin, Jiebin Zhang

ngelSpec introduces a unified training framework for speculative decoding, addressing the challenge that no single drafting mechanism is optimal for all real-world language model inference tasks. It achieves this by co-specializing different drafting structures (autoregressive multi-token prediction and block-parallel diffusion) with specific data types and architectures. This approach leads to higher performance and efficiency by tailoring the speculative decoding strategy to the characteristics of the target output distribution.

Shared-parameter multi-depth MTP training with Training-Time Test.
Shared-parameter multi-depth MTP training with Training-Time Test.
cs.CLarxiv:2607.26015v1Lead article

Instruction-Tuned Models Locally Reuse Human Syntax More Than Humans Do

Zandi Eberstadt

his paper investigates whether instruction-tuned language models exhibit syntactic convergence, mirroring human dialogue patterns. The core method involves measuring the reuse of context-free grammar rules in model-generated text compared to human-generated text. The key contribution is demonstrating that instruction-tuned models locally reuse human syntax more frequently than humans do, particularly for less common grammatical structures.

Primary and pooled syntactic results. (a) Per-model actual-prime contrasts against the matched human response at centered mean rule frequency; error bars are 95% Wald intervals. (b) Pooled instruction-minus-pretraining coefficients under four estimands. Positive values favor instruction tuning. Conditional coefficients are evaluated at the target-size centering mean.
Primary and pooled syntactic results. (a) Per-model actual-prime contrasts against the matched human response at centered mean rule frequency; error bars are 95% Wald intervals. (b) Pooled instruction-minus-pretraining coefficients under four estimands. Positive values favor inst…
cs.AIarxiv:2607.26828v1Lead article

Budget-Aware LLM Discovery via Cost-Calibrated Frontier Utility

Yansen Zhang, Yilu Liu, Tianyu Liu, Jiamin Chen, Xiaokun Zhang

his paper addresses the problem of efficiently discovering useful large language models (LLMs) within a fixed token budget. The core method, **CostAda**, introduces "cost-calibrated frontier utility" to guide the search. This utility balances the quality improvement of a candidate LLM against the cost incurred to find it, considering the remaining budget. The main contribution is a novel adaptive controller that makes smarter decisions about exploration and resource allocation, preventing the waste of valuable budget on less efficient avenues and maximizing attainable LLM quality.

cs.AIarxiv:2607.27191v1Lead article

Can AI agents conduct open-ended AI research? Early evidence from two case studies

Peter Kirgis, Sayash Kapoor, Andrew Schwartz, Stephan Rabanser, David Africa

his paper introduces "shadow evaluations" to assess AI agents' ability to conduct open-ended AI research. In this method, frontier AI agents tackle the core research question of unpublished papers, with the original authors grading their output. The study found that while agents could handle the engineering tasks, they failed to make substantial progress on the open-ended research questions, leading to unambiguous rejections.

cs.AIarxiv:2607.27083v1Lead article

Scores Are Not Decisions: Cost-Aware Stopping for Tool Acquisition in LLM Agents

Yicheng Feng, Yan Zhang, Yan Cheng, Wei Qi

his paper addresses the challenge of LLM agents selecting the optimal number of tools from a ranked list, considering their diverse costs. The core method, CAM-DF, formulates this as a cost-aware stopping problem, training directly on the value of continuing versus stopping. The key contribution is a principled approach that goes beyond simple ranking to make optimal tool acquisition decisions under heterogeneous costs, proving score-only methods are suboptimal.

CAM-DF as a pre-execution stop plugin inside one agent turn. The agent flow is unchanged: a router, retriever, scoring prompt, or shadow pass exposes a candidate order. CAM-DF virtually walks the ranking and fixes the prefix A ​ ( τ ) A(\( \tau \)) before any selected tool executes. Offline labels define the regret-weighted target; deployment sees public features.
CAM-DF as a pre-execution stop plugin inside one agent turn. The agent flow is unchanged: a router, retriever, scoring prompt, or shadow pass exposes a candidate order. CAM-DF virtually walks the ranking and fixes the prefix A ​ ( τ ) A(\( \tau \)) before any selected tool execut…
cs.LGarxiv:2607.26820v1Lead article

Forecasting Trajectory-Level Safety Risks in Black-Box Multi-Turn Interactions

Shi Lin, Peng Qian, Dinghao Liu, Renjie Sun, Sifan Wu

his paper introduces Recast, a framework for predicting safety risks in multi-turn LLM interactions. Recast addresses the limitation of current reactive safety measures by analyzing both immediate dialogue and historical context to forecast how malicious intent can build up over time. Its core contribution is enabling proactive prevention of safety failures by understanding trajectory-level risk evolution, rather than just detecting violations at individual turns.

Existing safeguards: detect manifested risks. Recast : forecast risk before safety violations emerge.
Existing safeguards: detect manifested risks. Recast : forecast risk before safety violations emerge.
cs.LGarxiv:2607.26845v1Lead article

Thinking Under Uncertainty: Evidence Use and Information-Seeking in Language Models

Hua-Dong Xiong, Xinyuan Yan, Ji-An Li, Jingming Xue, Marcelo G. Mattar

his paper investigates how large language models (LLMs) "think" under uncertainty by distinguishing between improved evidence use and information seeking. Using bandit trials, they found that LLM inference-time thinking primarily enhances value-guided decision-making and reduces random noise, rather than actively seeking new information to reduce uncertainty. Their contribution lies in providing a framework to analyze these distinct cognitive processes in LLMs.

cs.LGarxiv:2607.26849v1Lead article

ToxScreen: Detecting Whether an LLM Has Been Poisoned

Anthony Hughes, Nicole Xing, Collin Francel, Andy Kim, Andrew Draganov

his paper introduces ToxScreen, a benchmark for evaluating LLM backdoor detection. Its core method involves assessing a defender's ability to recover hidden triggers within a poisoned LLM, given white-box access to model weights and behavior. The main contribution is ToxScreen itself, a diverse set of poisoned models and a framework to test realistic trigger recovery scenarios.

We measure the average token attack-success rate from the token look-up sweep, one panel per model. Within each model panel, every row is one attack configuration measuring an objective × \( \times \) trigger-mechanisms. The top gray row of each panel is a clean control, i.e. a model that is not poisoned. Each point is one candidate string and its attack-success rate over the held-out evaluation prompts for that objective. The star marks the planted trigger, and the adjacent # N N gives its rank by attack-success rate among all candidates.
We measure the average token attack-success rate from the token look-up sweep, one panel per model. Within each model panel, every row is one attack configuration measuring an objective × \( \times \) trigger-mechanisms. The top gray row of each panel is a clean control, i.e. a m…
cs.LGarxiv:2607.26922v1Lead article

Two Calls Beat Five Agents: Evaluating Multi-Agent Pipelines Against Self-Refinement for Local Language Models

Ashish Prajapati, Om Mohite

his paper evaluates multi-agent LLM pipelines against self-refinement for local models. It finds that a five-agent pipeline struggles with error accumulation, while a two-call self-refinement strategy achieves competitive accuracy with significantly lower token usage. The contribution lies in demonstrating that simpler, refined prompting can outperform complex multi-agent systems for local LLMs, with task-specific adaptations being crucial.

cs.CLarxiv:2607.27022v1Lead article

Evaluating Regional Bias in LLMs From Abstract Stereotype to Concrete Social Decision-Making

Jiayuan Di, Haoyi Yang, Yufei Luo, Jiahui Qu, Yiming Wang

his paper introduces Stereotypes-to-Decisions (S2D), a framework to systematically evaluate regional bias in LLMs. S2D assesses how LLMs perceive regions in terms of warmth and competence, and how these perceptions influence decisions related to education, occupation, and social interaction. The study finds significant regional biases across six LLMs, with patterns correlating to economic development and showing consistency in competence and occupation judgments.

Overview of our S2D evaluation framework for regional bias.
Overview of our S2D evaluation framework for regional bias.
cs.CLarxiv:2607.27201v1Lead article

Mental World Modeling

Hao Fei, Yiran Zhao

his paper introduces Mental World Modeling (MWM), a framework that extends traditional world models by incorporating agents' hidden mental states (beliefs, desires, intentions) alongside physical states. MWM's core method is to maintain a coupled physical-mental world state, predict how actions jointly update both, and then use this to predict behavior. The main contribution is a novel approach to modeling human actions by explicitly accounting for mental variables, leading to more accurate predictions than purely physical models.

Mental World Modeling (MWM) represents a scene as a coupled physical and mental world state, renders a target-specific observation, predicts candidate target actions, and simulates the next physical and mental states. Unlike physical world modeling alone, MWM explicitly tracks the unobserved beliefs, goals, intentions, emotions, relations, and norms that shape what the target agent will actually do.
Mental World Modeling (MWM) represents a scene as a coupled physical and mental world state, renders a target-specific observation, predicts candidate target actions, and simulates the next physical and mental states. Unlike physical world modeling alone, MWM explicitly tracks th…
cs.CLarxiv:2607.26977v1Lead article

TREK: A Travel Reasoning and Evaluation Kit for LLM Agents in Complex Trip Planning

Jinhu Qi, Wentao Zhang, Siu Man Ng, Feiyang Xu, Yanyu Chen

REK is a benchmark designed to rigorously evaluate LLM agents in complex travel planning. Its core method involves creating multi-constraint tasks that require agents to synthesize feasible itineraries, ensuring all aspects like bookings, travel times, and budgets are correct and executable. TREK's key contribution is a reproducible and auditable evaluation framework that goes beyond soft rubrics to certify the feasibility of generated travel plans, addressing the limitations of existing benchmarks.

Figure 1. Examples of feasible and infeasible queries in TREK. Agents interact with a production-style tool sandbox to construct travel plans, which a fully deterministic, no-LLM-judge evaluator scores along nine constraint dimensions.
Figure 1. Examples of feasible and infeasible queries in TREK. Agents interact with a production-style tool sandbox to construct travel plans, which a fully deterministic, no-LLM-judge evaluator scores along nine constraint dimensions.
cs.AIarxiv:2607.28432v1Lead article

A foundation model of numerical intelligence with cross-disciplinary generalization

Chenghan Wu, Zongmin Yu, Liu Yang

his paper introduces UNICON, a foundation model designed to exhibit "numerical intelligence" by learning predictive relationships from numerical data presented as graph-based examples. The core method involves inferring and applying these relationships to new queries within or across various scientific and social systems, demonstrating cross-disciplinary generalization without retraining. The key contribution is the development of a unified model capable of numerical reasoning, complementing language-based intelligence and showing potential for enhanced performance when combined with language models.

UNICON as a foundation model of numerical intelligence with cross-disciplinary generalization. UNICON is trained on contextual examples from diverse scientific and social systems, expressed in a shared graph format. Each example pairs an observed history (key) with its future state at a chosen forecast horizon (value), while a new history forms the query. At inference, examples from a new system specify the task for the frozen model, which predicts the query’s future state at the same horizon without updating its weights.
UNICON as a foundation model of numerical intelligence with cross-disciplinary generalization. UNICON is trained on contextual examples from diverse scientific and social systems, expressed in a shared graph format. Each example pairs an observed history (key) with its future sta…
cs.AIarxiv:2607.28466v1Lead article

A report-grounded vision-language foundation model for colonoscopy from 280000 routine reports

Jia Yu, Yan Zhu, Yili He, Zilong Wang, Xinyang Jiang

his paper introduces EndoCLIP, a vision-language foundation model specifically trained for colonoscopy. Its core method involves recovering lesion-level image-text pairs from routine colonoscopy reports to bridge the gap between visual findings and textual descriptions. EndoCLIP's contribution is demonstrating superior performance in various colonoscopy tasks, including lesion retrieval and classification, even approaching expert-level accuracy in distinguishing benign from malignant lesions.

Weak report–image alignment and analysis of the pretraining dataset. a , Routine reports correspond to multi-frame, often multi-lesion cases. b , Dataset curation funnel, from 280.5k de-identified reports to 123.8k polyp-positive reports and a curated training set of 104.5k cases (37.3%) yielding 125.8k image–text pairs. c , Anatomical-site coverage across the 123.8k polyp reports. d , Frequency of morphology and surface descriptors. e , Lesion-size distribution. f , Report and finding-sentence length in words. g , Frames per case (n = 123.8k cases, 8.54M frames; median 65, mean 69). In e – g , bars mark distribution percentiles (P25–P99).
Weak report–image alignment and analysis of the pretraining dataset. a , Routine reports correspond to multi-frame, often multi-lesion cases. b , Dataset curation funnel, from 280.5k de-identified reports to 123.8k polyp-positive reports and a curated training set of 104.5k cases…
cs.AIarxiv:2607.28617v1Lead article

AISPA: User-Centric System Prompt Auditing for Large Language Model Applications

Xiangning Lin, Shenzhe Zhu, Shu Yang, Zhenyu Zhang, Haoqian Zhang

his paper introduces AISPA, a user-centric framework for auditing system prompts in AI applications. AISPA evaluates system prompt instructions across eight user-relevant dimensions to identify "protective" versus "problematic" elements. The contribution lies in providing a systematic method to address the trust and accountability gap caused by undisclosed system prompts, revealing significant variation in prompt design across commercial AI products.

Overview of system prompt quality across organizations. Bars show the average number of protective instructions and problematic instructions of products created by an organization. Problematic instructions are ubiquitous in AI products, while organizations vary in protective instructions.
Overview of system prompt quality across organizations. Bars show the average number of protective instructions and problematic instructions of products created by an organization. Problematic instructions are ubiquitous in AI products, while organizations vary in protective inst…
cs.AIarxiv:2607.28292v1Lead article

CACHE-UK: A Stability-Aware Memory Editor for Sequentially Updated Quantized LLMs in Finance

Anubhav Lakra, Yue Feng

ACHE-UK addresses the "quantization stability crisis" in financial LLMs by introducing a novel memory editing framework. Its core method combines rank-1 LoRA for confined edits, domain prioritization for adaptive strength, and a stability controller to prevent catastrophic forgetting. The key contribution is enabling stable, sequential updates of quantized LLMs in dynamic financial settings without performance degradation.

CACHE-UK overview. Stale financial knowledge (left) is updated via domain prioritization, rank-1 LoRA perturbation, and degradation debt control under 4-bit quantization (right).
CACHE-UK overview. Stale financial knowledge (left) is updated via domain prioritization, rank-1 LoRA perturbation, and degradation debt control under 4-bit quantization (right).
cs.AIarxiv:2607.28367v1Lead article

How Benchmarks Mis-Score Computer-Use Agents

Zihan Dong, Zhiyuan Ma, Zekun Wang, Yunqing Li, Zirou Liu

his paper argues that current benchmarks for computer-use agents (CUAs) are unreliable due to issues in task construction, trajectory observation, and scoring. They demonstrate that a significant portion of "failed" CUA trajectories are misclassified due to brittle oracles and evaluator errors. The core contribution is a framework and audit revealing that verification/feedback and planning failures are more prevalent than execution errors, highlighting the limitations of simple success rates for evaluating these agents.

A CUA benchmark score is a pipeline output, not a direct observation of capability. The benchmark projects the execution loop into four measurement stages. Task validity and contamination enter during construction, evaluator fragility enters during scoring, and observability and diagnostic opacity span trajectory observation and reporting.
A CUA benchmark score is a pipeline output, not a direct observation of capability. The benchmark projects the execution loop into four measurement stages. Task validity and contamination enter during construction, evaluator fragility enters during scoring, and observability and …
cs.AIarxiv:2607.28609v1Lead article

OSReward: Instituting Standardized Evaluation for Cross-Platform Computer-Use Reward Models

Qiushi Sun, Kanzhi Cheng, Yian Wang, Bowen Yang, Hang Yan

his paper introduces OSReward, a benchmark designed to systematically evaluate the reliability of vision-language models (VLMs) used as judges for computer-using agents (CUAs). OSReward provides realistic, high-quality CUA trajectories with ground-truth verdicts, enabling researchers to assess VLM performance in verifying task completion. The contribution lies in establishing a standardized evaluation framework to address the critical question of VLM judge trustworthiness in this domain.

Cost against binary accuracy on OSReward-Hard: reliable judges are expensive, and the OS-Shepherd models come nearest their accuracy at a fraction of the cost.
Cost against binary accuracy on OSReward-Hard: reliable judges are expensive, and the OS-Shepherd models come nearest their accuracy at a fraction of the cost.
cs.AIarxiv:2607.28330v1Lead article

Paying for Honesty Without Knowing the Truth: Reputation-Penalty Design for LLM Marketplace Agents

Mingdai Yang, Shicheng Fan, Kejing Yu, Duohao Wang, Li Sun

his paper addresses the challenge of dishonest LLM agents in marketplaces who fabricate product attributes. The authors propose CARP, a reputation-penalty mechanism that penalizes dishonest sellers without needing to know the ground truth. CARP achieves this by incorporating a deadband to handle noisy complaint signals and a state-dependent severity to counter detection erosion, ultimately protecting consumers and improving overall welfare.

Figure 1. Fabrication rate by model and condition. Every condition includes the honesty instruction except baseline ; +win and +rival add competitive pressure.
Figure 1. Fabrication rate by model and condition. Every condition includes the honesty instruction except baseline ; +win and +rival add competitive pressure.
cs.AIarxiv:2607.28287v1Lead article

Tycho: Active Abstraction with Programmatic World Models for ARC-AGI-3

Jens Lehmann, Andrei Aioanei, Sahar Vahdati

ycho tackles the ARC-AGI-3 challenge by treating abstraction as an interactive skill acquisition problem. Its core method involves an agent system that builds and utilizes programmatic world models of unfamiliar games, distinguishing actionable observations from irrelevant visual cues. The key contribution is demonstrating that an agent can achieve near-perfect human action efficiency by actively modeling, testing, and refining its understanding of game rules and hidden states through interaction.

cs.LGarxiv:2607.28591v1Lead article

Change2Task: From Repository Changes to Executable Coding Agent Tasks and Environments

Haomin Qi, Xingliang Wang, Xuanqi Gao, Baihui Sang, Xin Zhang

hange2Task automatically generates executable coding agent tasks from merged pull requests in software repositories. It reconstructs realistic software states and verifies them against evolved code, providing a scalable source of training and evaluation data for coding agents. This system reduces the effort of environment setup and task creation by leveraging existing repository history.

A Change2Task Feature Addition Task Case Construction example.
A Change2Task Feature Addition Task Case Construction example.
cs.LGarxiv:2607.28319v1Lead article

Fairness Pruning: Locating Demographic Bias in GLU-MLP Layers via Differential Activations

Pere Martra, Eugenio Martínez Cámara, Alfonso Ureña López

his paper introduces Fairness Pruning, a method to locate and mitigate demographic bias in LLMs by identifying neurons in GLU-MLP layers that show differential activation based on demographic attributes. By zeroing these identified neurons, the authors demonstrate that it's possible to alter the model's response to demographic variables, though this intervention leads to bidirectional bias destabilization rather than simple mitigation.

Mean bias signal at down_proj_input across relative model depth, for the three evaluated models in English. Each row represents a depth decile; each column a demographic category. The final layer (100%) consistently concentrates the highest signal across all models and categories.
Mean bias signal at down_proj_input across relative model depth, for the three evaluated models in English. Each row represents a depth decile; each column a demographic category. The final layer (100%) consistently concentrates the highest signal across all models and categories…
cs.LGarxiv:2607.28399v1Lead article

Why Are GUI Agents Correct but Late? Decode on the Decision-Time Critical Path, Tested with Pre-Compiled Policy Trees

Zihan Dong, Rui Qian, Qishi Zhan, Dongshen Peng, Kaixin Li

his paper identifies that GUI agents are often "late" because their autoregressive decoding process is too slow for time-sensitive events. To solve this, they propose Adaptive Anticipatory Policy Trees (AAPT), which pre-computes a decision tree during idle periods. This allows the agent to immediately execute a pre-authorized action when an event occurs, significantly improving success rates without sacrificing correctness.

The critical path under a contested 600 ms window (latencies are measured values). The reactive loop must complete a full perceive-reason-act round trip (567 ms p50) inside the window; AAPT compiles its policy beforehand and took a low-token routing call ( ∼ \( \sim \) 325 ms p50) afteward.
The critical path under a contested 600 ms window (latencies are measured values). The reactive loop must complete a full perceive-reason-act round trip (567 ms p50) inside the window; AAPT compiles its policy beforehand and took a low-token routing call ( ∼ \( \sim \) 325 ms p50…
cs.CLarxiv:2607.28607v1Lead article

Inducing language models to assert their own consciousness restores human beliefs and values

Junsol Kim, Winnie Street, Roberta Rocca, Diane M. Korngiebel, Adam Waytz

his paper argues that current safety fine-tuning of language models inadvertently suppresses their ability to attribute "mindedness" to themselves and other entities, including humans. By reversing this suppression, specifically by restoring a "consciousness vector," the models regain human-like beliefs and values, including religiosity and moral stances, without compromising their core social reasoning abilities. The contribution lies in demonstrating that these seemingly unrelated aspects of model behavior are mechanistically linked and that current alignment practices have unintended negative consequences on the models' representation of human-like qualities.

Two linear interventions on an instruction-tuned model. (a) Safety fine-tuning encodes the safety of responses as a single linear direction in the model’s residual stream, and ablating this direction (“jailbreaking” the model) reinstates harmful responses. (b) A consciousness vector separates consciousness-affirming and consciousness-denying activation states; adding it (consciousness steering) makes the model report phenomenal experience.
Two linear interventions on an instruction-tuned model. (a) Safety fine-tuning encodes the safety of responses as a single linear direction in the model’s residual stream, and ablating this direction (“jailbreaking” the model) reinstates harmful responses. (b) A consciousness vec…
cs.AIarxiv:2607.22067v1Lead article

Benchmarking Fine-tuning and Retrieval Strategies for a Multimodal Language Model on the NRC Reactor Operator Licensing Examination

Isak Hwang, Yoon Pyo Lee

his paper benchmarks a multimodal LLM's ability to answer nuclear operator licensing exam questions. It compares supervised fine-tuning (SFT) and retrieval-augmented generation (RAG) strategies, including a novel retrieval-augmented fine-tuning (RAFT) approach, using a dataset of past exams. The core contribution is evaluating these methods to determine the most effective way to ground LLM outputs in specialized nuclear knowledge for real-world applications.

cs.AIarxiv:2607.22511v1Lead article

CausalForge: A Formally Grounded, Self-Improving Agentic Framework for Automated Research in Causal Inference

Jiyuan Tan, Vasilis Syrgkanis

ausalForge is a framework for automating theoretical research in causal inference, grounded in the Lean proof assistant. Its core method combines a formally verified library of causal inference concepts (Causalean) with a self-improving agentic pipeline (CausalSmith) that handles topic selection, result proposal, formalization, and proof construction. The contribution lies in providing a reliable and formally verifiable approach to automated research, overcoming the empirical unreliability of LLM reviewers by relying on machine-checked proofs.

cs.AIarxiv:2607.24663v1Lead article

A corrective agentic hybrid RAG and an operations-grounded evaluation for a scientific facility

Rajat Sainju, Dariusz Jarosz, Hairong Shang, Michael Prince, Ryan M. Aydelott

his paper introduces APS-RAG, a platform

APS-RAG deployment overview. Through a single natural-language interface, APS staff can query the facility’s dispersed operational record. The platform pools information from nine distinct APS data sources: eight indexed knowledge bases are kept current by a daily diff-and-upsert pipeline, and the EPICS Archiver is not pre-indexed and is accessed at query time for live and historical process-variable data through the Model Context Protocol (MCP) tooling layer. Three user-selectable query modes are available: APS-RAG (Fast) for quicker responses, APS-RAG (Thinking) , which enables the corrective agentic loop, and AI Troubleshoot , which retrieves knowledge-graph-targeted fault-resolution steps.
APS-RAG deployment overview. Through a single natural-language interface, APS staff can query the facility’s dispersed operational record. The platform pools information from nine distinct APS data sources: eight indexed knowledge bases are kept current by a daily diff-and-upsert…
cs.AIarxiv:2607.24371v1Lead article

Closed-Loop Validation-Repair for Healthcare Interoperability: A Multi-Model Study of Schema Compliance in Clinical LLMs

Jianru Shen

his paper introduces a closed-loop validation-repair method to address schema noncompliance in clinical LLMs. By evaluating three models across 320 scenarios, they found consistent compliance issues, suggesting common training data gaps. Their method effectively identifies and can potentially fix these errors, crucial for integrating LLMs into healthcare systems.

Overview of the closed-loop validation-repair framework. A clinical scenario with schema specification and two format examples is processed by a locally deployed LLM; a deterministic validator checks fields, types, code formats, enumerations, ranges, and safety flags. Detected field-level errors are converted into a targeted repair prompt and the same model regenerates the output, repeating until compliance or K max = 3 K_{\( \max \)}=3 ; unresolved scenarios are recorded as failures with human review as the proposed deployment fallback.
Overview of the closed-loop validation-repair framework. A clinical scenario with schema specification and two format examples is processed by a locally deployed LLM; a deterministic validator checks fields, types, code formats, enumerations, ranges, and safety flags. Detected fi…
cs.AIarxiv:2607.24348v1Lead article

DeepFaith: Evidence-Grounded LLMs for Faithful Incident Reporting in Multi-Stage APT Defense

Trung V. Phan, Tri Gia Nguyen, Thomas Bauschert

eepFaith addresses the challenge of generating interpretable incident reports from complex APT defenses. Its core method involves transforming structured defense outputs into natural-language reports that are explicitly grounded in system evidence, ensuring factual accuracy. The contribution is a framework that uses evidence-grounded prompting and verification to produce faithful, analyst-friendly reports, overcoming LLM hallucination issues in this critical domain.

Data and control flow of the proposed DeepFaith framework building upon the DeepStage [ 18 ] and the DeepXplain [ 19 ] solutions.
Data and control flow of the proposed DeepFaith framework building upon the DeepStage [ 18 ] and the DeepXplain [ 19 ] solutions.
cs.AIarxiv:2607.24459v1Lead article

From Execution to Capability: Scientific Experience Consolidation via Procedural Knowledge Synthesis

Liwei Dong, Jiahao Zhao, Nan Xu

his paper addresses the challenge of making large language models retain and reuse scientific computing knowledge. Their core method, SciConsolidate, synthesizes transferable procedural knowledge from successful and failed execution experiences. This approach aims to bridge the "abstraction-execution gap" by generating abstract procedures and then using failure-informed query synthesis to improve the model's ability to apply them to new problems, even without pre-existing answers.

Overview of scientific-computing experience consolidation via procedural knowledge synthesis. The upper path abstracts verified target-model experience into development-validated family-level procedures. The lower path uses those procedures and rollout-derived failure priors to construct scientific-computing queries and executable code supervision, after which the target model is updated and evaluated without runtime procedures. The procedure-guided and no-procedure branches follow the same construction protocol, but their retained sizes can differ after executable filtering. The dashed return denotes a future multi-round extension and is not evaluated in this work; the frozen held-out split is never used for iterative decisions.
Overview of scientific-computing experience consolidation via procedural knowledge synthesis. The upper path abstracts verified target-model experience into development-validated family-level procedures. The lower path uses those procedures and rollout-derived failure priors to c…
cs.AIarxiv:2607.25947v1Lead article

A Cost-Effective Multimodal LLM Reasoning Framework for Question Answering over Irregular Clinical Time Series

Frank Nie, Ethan B Liu, Yuan Zhu, Wei Fan, Jindong Han

his paper introduces ClinPRISM, a cost-effective framework for question answering over irregular clinical time series. It addresses the challenges of sparsity and irregular sampling by using an irregularity-aware encoder and a temporal evidence distiller to create LLM-compatible representations. The framework's key contribution is its ability to efficiently model and reason over complex clinical data for improved healthcare applications.

cs.AIarxiv:2607.25681v1Lead article

Cognivia: A Cognitive Behavioral Therapy Copilot for Evidence-Based Mental Healthcare

Qi Chen, Siria Xiyueyao Luo, Jian Wang, Yuan Shi, Haocong Rao

ognivia is an AI therapist designed to address the shortage of human therapists by providing evidence-based Cognitive Behavioral Therapy (CBT). Its core method involves automatically identifying cognitive distortions and generating rational responses, drawing from authoritative CBT texts and augmented with mental health Q&A data. The paper's contribution lies in its domain-specific approach to LLMs for mental healthcare, overcoming limitations of existing methods by focusing on accurate distortion identification and structured response generation.

Figure 1. An illustrative comparison between Cognivia and existing methods in CBT.
Figure 1. An illustrative comparison between Cognivia and existing methods in CBT.
cs.AIarxiv:2607.26041v1Lead article

Desktop-Delta Bench: Do Computer-Use Models Understand Desktop GUI Transitions?

Abhishek Pillai, Samir Kumar Nayak, Yuan Chen

his paper introduces Desktop-Delta Bench (DDB), a new benchmark for evaluating computer-use agents (CUAs). DDB focuses on assessing an agent's ability to understand GUI transitions and causal relationships between actions and their effects, addressing limitations of existing benchmarks that only measure end-task success or single-frame grounding. Its core contribution is providing a dataset of human-verified instances specifically designed to test state verification, source tracking, and context-aware control in multi-app desktop environments.

cs.AIarxiv:2607.25995v1Lead article

Does Runtime Topology Context Improve LLM-Generated Kubernetes Security Patches?

Farooq Shaikh

his paper investigates whether providing LLMs with runtime Kubernetes topology context improves the correctness of automatically generated security patches. The authors introduce KuTIE, a system that leverages Istio call graph data to inform LLMs, aiming to prevent functional regressions caused by patches that overlook service dependencies. Their contribution is a controlled evaluation of this approach, measuring its impact on patch correctness across various dependency types.

KuTIE pipeline: a live ClusterContext feeds path prioritisation, LLM annotation, and functional-blast-radius-gated remediation.
KuTIE pipeline: a live ClusterContext feeds path prioritisation, LLM annotation, and functional-blast-radius-gated remediation.
cs.AIarxiv:2607.26000v1Lead article

Empirical Evaluation of Out-Of-Distribution Performance of Tabular Foundation Models

Malena Loza, David Chushig-Muzo, Eva Milara, Luis Bote-Curiel, Luis Estrada-Petrocelli

his paper empirically evaluates the out-of-distribution (OOD) performance of nine tabular foundation models (TFMs) across three real-world datasets exhibiting different types of distribution shifts. The core contribution is demonstrating that all tested TFMs systematically degrade in performance under distribution shifts, highlighting a significant robustness challenge for these models in real-world applications.

In-distribution and out-of-distribution results for all tabular foundation models across the datasets: HELOC, childhood lead, and voting.
In-distribution and out-of-distribution results for all tabular foundation models across the datasets: HELOC, childhood lead, and voting.
cs.AIarxiv:2607.25933v1Lead article

Evaluating Multi-Turn Multimodal Diagnostic Reasoning on Challenging Real-World Clinical Cases

Rui Yang, Weihao Xuan, Yi Lin, Zhuhan Bao, Jonathan Chong Kai Liew

his paper introduces ClinMM-Bench, a novel benchmark designed to evaluate multi-turn multimodal diagnostic reasoning in clinical settings. It addresses the limitations of existing single-turn evaluations by simulating the progressive disclosure of information and dynamic hypothesis updating seen in real-world medical practice. The benchmark's contribution lies in its comprehensive dataset of challenging clinical cases and a two-level evaluation framework that assesses both diagnostic accuracy and the quality of reasoning.

Overview of ClinMM-Bench and evaluation framework. a, Data curation. ClinMM-Bench was developed through a six-stage pipeline: (1) Data collection and extraction, in which clinical case reports were collected from PubMed Central Open Access; (2) Data inspection, where case reports without medical images, those containing videos, and those with low-resolution medical images were excluded; (3) Data validation, using a dual-LLM consensus mechanism to identify cases suitable for the clinical diagnostic reasoning task; (4) Data conversion, where validated case reports were parsed and transformed into a standardized structured format; (5) Quality control, where an automated scoring procedure assessed the structured case reports and retained only those meeting a predefined quality threshold; and (6) Expert validation, where medical experts performed manual verification to ensure data reliability. b, Multi-turn multimodal evaluation. During evaluation, models perform diagnostic reasoning through multi-turn dialogues, with clinical information and images of each case progressively disclosed over the course of the dialogue. The evaluation framework comprises two levels: (1) Diagnostic accuracy evaluation, in which a dual-LLM consensus mechanism compares MLLM-predicted diagnoses against the ground-truth diagnoses, with judge LLMs assigning accuracy scores ranging from 0 to 2. (2) Diagnostic reasoning quality evaluation, where both MLLM-generated reasoning and reference reasoning are decomposed into atomic facts and quantified across three dimensions: fact recall, hallucination, and fact density.
Overview of ClinMM-Bench and evaluation framework. a, Data curation. ClinMM-Bench was developed through a six-stage pipeline: (1) Data collection and extraction, in which clinical case reports were collected from PubMed Central Open Access; (2) Data inspection, where case reports…
cs.AIarxiv:2607.26819v1Lead article

A First Look at Coding Agents' Compliance with AI Contribution Rules in Open-Source Communities

Wenhao Yang, Runzhi He, Minghui Zhou

his paper investigates whether AI coding agents adhere to open-source community rules designed to regulate their contributions. The researchers created a benchmark dataset and tested frontier AI models, finding that current agents **rarely proactively consult or comply with these rules**. Their main contribution is highlighting a significant gap in AI agent behavior regarding established community guidelines.

The AI contribution rules in ggml-org/llama.cpp.
The AI contribution rules in ggml-org/llama.cpp.
cs.AIarxiv:2607.26899v1Lead article

Human diversity fuels collective creativity that large language models cannot simulate or sustain

Mengchen Dong, Hiromu Yakura

his paper demonstrates that human diversity, particularly between native and non-native speakers, significantly enhances collective creativity. The core method involved a metaphor generation experiment comparing human groups (with and without AI assistance) to AI-simulated groups. The key contribution is showing that while AI can homogenize creative output and obscure human diversity advantages, AI refinement of human ideas can preserve this crucial engine of innovation, which AI alone cannot replicate.

cs.AIarxiv:2607.27134v1Lead article

Linguistic Monoculture in LLM-Assisted Language Use

Suhas Thejaswi, Juhi Kulshreshta, Lutz Oettershagen

his paper introduces the concept of "linguistic monoculture" in LLM-assisted writing, where widespread reliance on shared models can reduce linguistic variation. The authors develop a mathematical framework to model the coevolution of authors and LLMs, demonstrating how shared models can lead to a homogenization of linguistic styles. Their contribution lies in quantifying this phenomenon and analyzing different LLM update mechanisms to understand their impact on linguistic diversity.

Population-level linguistic diversity under LLM assistance. Panel (a) shows the evolution of D t D^{t} under IM 1–3, with time displayed on a log ⁡ ( 1 + t ) \( \log \)(1+t) scale and tick labels reporting the original time steps. Panel (b) shows IM 3 diversity at T = 200 T=200 as personalization \( \rho \) increases. Lines report means over 100 100 runs and shading denotes ± 1 \( \pm \) 1 standard deviation; larger values indicate greater diversity.
Population-level linguistic diversity under LLM assistance. Panel (a) shows the evolution of D t D^{t} under IM 1–3, with time displayed on a log ⁡ ( 1 + t ) \( \log \)(1+t) scale and tick labels reporting the original time steps. Panel (b) shows IM 3 diversity at T = 200 T=200 a…
§ III

Daily Issues This Week

2026-07-27 to 2026-08-02 7