Daily Issue
Vol. I — No. 46
06 · 08
Thursday, 6 August 2026
Generated 2026-08-06 10:20
google/gemini-2.5-flash-lite
Man is condemned to be free; because once thrown into the world, he is responsible for everything he does. — Sartre, Jean-Paul 39 items · 3 sections
§ 0

The Morning

Local weather 1
This morning in
London
Partly cloudy
Today's range
20.8°14.4°
currently 18.6°
Feels
15.9°
Rain
0%
Wind
12 km/h
Humid
43%
Rise
05:32
Set
20:40
§ I

From the arXiv

arXiv preprints 10 of 20
cs.AIarxiv:2608.05144v1Lead article

Argus: A General-Purpose Agentic Runtime for Long-Horizon Reasoning

Boxiu Li, Zimo Wen, Yijia Fan, Junxiang Lei, Sufeng Guo

rgus provides a general-purpose agentic runtime for long-horizon reasoning by employing a persistent, self-evolving architecture. It separates user intent from operational details and uses a review process for all new components, allowing agents to persist when successful and pivot when facing issues. This approach significantly improves performance on complex tasks like software engineering benchmarks compared to simpler methods.

Argus runtime and breadth evidence. The central diagram shows Manager authority over tasks, research verticals, and Stage transitions; Planner, Engineer, and Reviewer operate over a shared workspace whose knowledge, event log, artifacts, backlog, budget, daemon, and memory persist across bounded missions. The surrounding cards report outcomes from seven task-native evaluations. Their bars use independent scales and indicate comparison direction with arrows; they are breadth evidence rather than a single normalized leaderboard.
Argus runtime and breadth evidence. The central diagram shows Manager authority over tasks, research verticals, and Stage transitions; Planner, Engineer, and Reviewer operate over a shared workspace whose knowledge, event log, artifacts, backlog, budget, daemon, and memory persis…
An overview of HiGram . Our method organizes memory into a hierarchical graph structure with upper-level nodes connecting MemoryUnits that store factual information. Then, given a query and an update, our MicroGraph-based path-level localization module retrieves relevant memory MicroGraphs to build a support subgraph, and identifies the affected evidence path. Lastly, coordinated rewriting updates MemoryUnit states and dependency structures within the localized evidence path to maintain consistent memory updates.
An overview of HiGram . Our method organizes memory into a hierarchical graph structure with upper-level nodes connecting MemoryUnits that store factual information. Then, given a query and an update,…
cs.AIarxiv:2608.05095v1

Hierarchical Graph Memory for LLM Agents with Path-level Localization and Rewrite

Xiawei Yue, Boran Wang et al.

This paper introduces HiGram, a hierarchical graph memory for LLM agents designed for long-term reasoning. Its core method organizes memories into a coarse-to-fine structure, reducing irrelevant information and improving retrieval efficiency. HiGram's key cont…

cs.AIarxiv:2608.05141v1

OctoLong: Mid-Training On Cross-Repository Code Contexts Enhances Long-Context Modeling

Indraneil Paul, Falko Helm et al.

This paper introduces OctoLong, a method for creating large, dependency-rich code contexts by recursively retrieving code references. They then use these contexts to mid-train open-source language models, resulting in OctoLong-Instruct, which demonstrates enha…

Causal audit design. The primary contrast holds the receiver and the batch of caches fixed, permuting only which cache reaches each query. Both arms relay an equally well-formed cache, so the true-minus-deranged difference isolates example pairing from any generic benefit of relaying one.
Causal audit design. The primary contrast holds the receiver and the batch of caches fixed, permuting only which cache reaches each query. Both arms relay an equally well-formed cache, so the true-min…
cs.AIarxiv:2608.04893v1

When Does Latent Communication Pay? A Causal Audit of Relayed KV Caches in Multi-Agent LLMs

Jiaming Cheng, Subhransu Das et al.

This paper causally audits the claimed benefits of relaying key-value caches (instead of text) in multi-agent LLMs. The core method involves replacing the relayed cache with manipulated versions (deranged, zeroed, random) to isolate the cache's true impact. Th…

cs.LGarxiv:2608.04934v1

State2State: Environment-Derived Mid-Training for LLM Agents

Xuanyu Lei, Yiqi Zhu et al.

State2State is a novel mid-training method for LLM agents that addresses the limitations of supervised fine-tuning and traditional RL. Its core method involves converting explored environment states into training objectives, challenging agents to reach specifi…

Comparison of supervision sources for LLM agent training. SFT relies on expert trajectories, and task-centric RL relies on human-specified tasks with task-specific verifiers. In contrast, the environment-only setting studied in this work derives learning signals purely from environment itself.
Comparison of supervision sources for LLM agent training. SFT relies on expert trajectories, and task-centric RL relies on human-specified tasks with task-specific verifiers. In contrast, the environm…
№06
cs.CL
9

Skill-Use: Can LLMs Actually Use Skills in Agentic Harnesses?

Jinyi Han, Yuanjian Xu et al.

This paper introduces Skill-Use, a benchmark to evaluate if LLM agents can effectively recognize and apply skills. The core method involves progressive disclosure, where agents mus…

№07
cs.AI
8

A-SR: Self-Evolving Agentic LLMs for Symbolic Regression via Hierarchical Coordination

Wenxiao Zhao, Dong Liu et al.

A-SR introduces a novel self-evolving agentic framework for symbolic regression that moves beyond single-prompt approaches. Its core method involves coordinating specialized LLM ag…

№08
cs.AI
8

ABSeeker: Training Long-Horizon Search Agents via Answer-Backtracked Credit Assignment

Yijun Lu, Rui Ye et al.

ABSeeker trains long-horizon search agents by assigning credit at a finer, step-level rather than trajectory-level. Its core method, Answer-Backtracked Credit Assignment (ABC), rec…

№09
cs.AI
8

Agentic Reinforcement Learning with Observation-Calibrated Self-Distillation

Yi Yang, Cong Qin et al.

This paper introduces Observation-Calibrated Self-Distillation (OCSD) to improve reinforcement learning for large language model agents. OCSD addresses a limitation of prior method…

№10
cs.AI
8

ArtAnno: Annotating Implicit Semantics in Artworks through LLM Agent-Driven Bidirectional Human-AI Augmentation

Xiaoyan Gu, Yifang Wang et al.

ArtAnno introduces Bidirectional Human-AI Augmentation (BiHAA), a closed-loop framework for annotating implicit artwork semantics. It leverages a multi-agent LLM system where AI pr…

§ II

The Town Square

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