Daily Issue
Vol. I — No. 40
29 · 07
Wednesday, 29 July 2026
Generated 2026-07-29 10:21
google/gemini-2.5-flash-lite
Those who can win a war well can rarely make a good peace and those who could make a good peace would never have won the war. — Winston Churchill 33 items · 3 sections
§ 0

The Morning

Local weather 1
This morning in
London
Clear sky
Today's range
33.4°19.7°
currently 26.3°
Feels
28.1°
Rain
0%
Wind
3 km/h
Humid
44%
Rise
05:20
Set
20:54
§ I

From the arXiv

arXiv preprints 10 of 20
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.
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, ex…
cs.AIarxiv:2607.25853v1

HiSkill: Empowering LLM Agents with Hierarchical Skill Graphs

Yu Hao, Jinxuan Cai et al.

HiSkill 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 transiti…

cs.AIarxiv:2607.25992v1

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

Shuyue Wei, Chang Liu et al.

MemLens 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 retri…

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.
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. Th…
cs.AIarxiv:2607.25816v1

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

Jiabao Ji, Yujian Liu et al.

This 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 o…

cs.AIarxiv:2607.25718v1

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

Xinyi Hong, Pinjun Dong et al.

This 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…

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.
№06
cs.CL
9

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

Fanqing Meng, Lingxiao Du et al.

This 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 meth…

№07
cs.AI
8

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

Jiangwang Chen, Zixin Song et al.

DecoEvo addresses the limitations of fixed evaluation in text-space LLM optimization by introducing a decoupled co-evolutionary approach. It simultaneously trains a solver to impro…

№08
cs.AI
8

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

Ramtin Ehsani, Irene Manotas et al.

This paper empirically studies how Large Language Models (LLMs) attend to information within bug reports when performing automated program repair. By analyzing attention patterns o…

№09
cs.AI
8

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

Stefan Krsteski, Charlotte Meyer et al.

Messier 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 contrib…

№10
cs.AI
8

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

Deepanshu Mody, Samarth Agarwal et al.

This 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 …

§ II

The Town Square

Hacker News 4
compiled overnight by google/gemini-2.5-flash-lite · end of issue no. 40 · thank you for reading