Daily Issue
Vol. I — No. 24
12 · 06
Friday, 12 June 2026
Generated 2026-06-12 10:53
google/gemini-2.5-flash-lite
Dynamism is a function of change. — Hillary Clinton 35 items · 3 sections
§ 0

The Morning

Local weather 1
This morning in
London
Overcast
Today's range
21.2°15.9°
currently 18.9°
Feels
16.6°
Rain
24%
Wind
23 km/h
Humid
71%
Rise
04:43
Set
21:17
§ I

From the arXiv

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

Agents-K1: Towards Agent-native Knowledge Orchestration

Zongsheng Cao, Bihao Zhan, Jinxin Shi, Jiong Wang, Fangchen Yu

gents-K1 addresses the lack of scientific knowledge orchestration in LLM agents by converting raw documents into agent-native knowledge graphs. Its core method involves a multimodal parser to extract detailed entities, evidence, and relations from full papers, an information extraction backbone trained with GRPO, and a tri-source agent interface for unified retrieval. This contributes a richer, structured representation of scientific knowledge, enabling more sophisticated agent reasoning.

Agents-K1 : Architecture and Capabilities. Left : Extracting multimodal knowledge from scientific papers. Middle : Schema-adaptive extensions for core research tasks. Right : Enhancing LLM reasoning and verifiable knowledge tracing.
Agents-K1 : Architecture and Capabilities. Left : Extracting multimodal knowledge from scientific papers. Middle : Schema-adaptive extensions for core research tasks. Right : Enhancing LLM reasoning and verifiable knowledge tracing.
Amortized per-call cost vs. reuse count N N (log–log). The from-scratch cost is flat at C prefill C_{\( \text{prefill} \)} ; KV-reuse falls as C prefill / N + C reuse C_{\( \text{prefill} \)}/N+C_{\( \text{reuse} \)} toward a floor of C reuse C_{\( \text{reuse} \)} .
Amortized per-call cost vs. reuse count N N (log–log). The from-scratch cost is flat at C prefill C_{\( \text{prefill} \)} ; KV-reuse falls as C prefill / N + C reuse C_{\( \text{prefill} \)}/N+C_{\( …
cs.AIarxiv:2606.13361v1

Can I Buy Your KV Cache?

Luoyuan Zhang

This paper proposes a method to significantly reduce computation costs for large language models by precomputing and sharing Key-Value (KV) caches. Instead of each agent recomputing the KV cache for identical documents, a publisher can generate it once, allowi…

cs.AIarxiv:2606.13662v1

EurekAgent: Agent Environment Engineering is All You Need For Autonomous Scientific Discovery

Amy Xin, Jiening Siow et al.

EurekAgent's core method is "environment engineering," which focuses on designing the resources, constraints, and interfaces of an agent's execution environment to guide its behavior towards productive scientific discovery. The paper's main contribution is dem…

EurekAgent score evolution progress on the 26-circle packing problem.
EurekAgent score evolution progress on the 26-circle packing problem.
Overview of our evaluation probing human and LLM causal reasoning . a. Illustration of the evaluation format used for testing causal reasoning in people and LLMs. For each prompt, subjects are first presented with the scenario. After reading the prompt, subjects press SPACE to see the two response options and then select the most likely completion. b. Summary of the 11 categories we used in our evaluation of everyday causal reasoning.
Overview of our evaluation probing human and LLM causal reasoning . a. Illustration of the evaluation format used for testing causal reasoning in people and LLMs. For each prompt, subjects are first p…
cs.AIarxiv:2606.13607v1

Reasoning as Pattern Matching: Shared Mechanisms in Human and LLM Everyday Reasoning

Zach Studdiford, Gary Lupyan

This paper proposes that both humans and LLMs perform everyday reasoning through pattern matching, rather than abstract world models. By observing similar error patterns in human participants and LLMs on common-sense reasoning tasks, the researchers identify s…

cs.AIarxiv:2606.13598v1

Reward Modeling for Multi-Agent Orchestration

King Yeung Tsang, Zihao Zhao et al.

This paper introduces Orchestration Reward Modeling (OrchRM), a self-supervised method for training multi-agent system orchestrators. OrchRM uses intermediate execution artifacts to create win-lose pairs for training a reward model, eliminating the need for hu…

№06
cs.CL
9

EvoArena: Tracking Memory Evolution for Robust LLM Agents in Dynamic Environments

Jundong Xu, Qingchuan Li et al.

EvoArena is a new benchmark suite designed to evaluate LLM agents in dynamic environments that progressively change over time. The paper introduces EvoMem, a memory system that tra…

№07
cs.CL
9

HyperTool: Beyond Step-Wise Tool Calls for Tool-Augmented Agents

Yaxin Du, Yifan Zhou et al.

HyperTool addresses the inefficiency of step-wise tool calls in LLM agents by introducing a unified, MCP-style interface. This allows models to execute complex tool workflows withi…

№08
cs.CL
9

Recursive Agent Harnesses

Elias Lumer, Sahil Sen et al.

This paper introduces the Recursive Agent Harness (RAH), a novel approach that extends recursive language models by using full agent harnesses, equipped with tools and execution ca…

№09
cs.AI
8

AgentBeats: Agentifying Agent Assessment for Openness, Standardization, and Reproducibility

Xiaoyuan Liu, Jianhong Tu et al.

This paper introduces Agentified Agent Assessment (AAA), a novel method for evaluating AI agents by using judge agents and standardized interaction protocols (A2A and MCP). AAA's c…

№10
cs.AI
8

An LLM System for Autonomous Variational Quantum Circuit Design

Kenya Sakka, Wataru Mizukami et al.

This paper presents an LLM-based autonomous system for designing variational quantum circuits, addressing the reliance on human expertise. The core method involves an iterative, cl…

§ II

The Town Square

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