arXiv AI

Spine: Compiling Subtask Trees into Structured Context for Long-Horizon Coding Agents

Spine is a new interface and runtime that aligns a language model’s context with the nesting and completion of subtasks in long‑horizon coding problems. By letting agents declare explicit subtask boundaries through work scopes, Spine records interactions in a persistent SpineTree and compiles only the necessary unfinished subtask history into the model’s prompt, replacing completed subtasks with their results while reusing prefix‑cache. Integrated into Codex and Pi, SpineCodex and the reusable Pi package achieve significant performance gains—improving SWE‑Milestone and ProgramBench scores and reducing costs—without the overhead of recursive subagent delegation.

arXiv AI
21h ago

The Last Mile to the Real World: Agent-Native Primitives as Reusable Building Blocks for Solving Real-World Tasks

arXiv:2611.07461v1 Announce Type: cross Abstract: How can an agent handle a real-world task end to end? Frontier models with their own harnesses still fall short on real-world benchmarks: on Terminal...

By Haibo Jin, Peng Kuang, Xiaopeng Yuan, Lucheng Fu, Jerry Wang, Xucheng Yu, Yaoning Yu, Dehao Wu, Runguo Li, Colin Su, Jingxuan Sun, Xuyang Liu, Haojing Luo, Haohan Wang
arXiv AI
Sep 4

Terminal-Universe: Turning Agent Trajectories into Scalable Terminal Environments

Terminal-Universe is a framework that transforms large collections of terminal‑based agent trajectories into reusable, executable environments. By replaying recorded file operations and completing missing files, it reconstructs the original workspace and task, then synthesizes new tasks and multi‑round interactions. The resulting 37.3k task‑sufficient environments enable significant performance gains when fine‑tuning language models on terminal‑based benchmarks.

By Jie Wu, Zhenru Zhang, Beichen Zhang, Xuwu Wang, Yuhui Su, Mouxiang Chen, Peng Wang, Zhihai Wang, Que Shen, Hao Zhou, An Yang, Fei Huang, Yujiu Yang, Dayiheng Liu
Hugging Face Trending Papers
Sep 3

Terminal-Universe: Turning Agent Trajectories into Scalable Terminal Environments

Terminal-Universe is a framework that converts large collections of terminal-based agent trajectories into reusable, executable environments. By replaying recorded file operations and filling missing files with a completion agent, it reconstructs the original workspace and generates new tasks, scaling them in breadth (cross-workspace queries) and depth (multi-round interactions). The resulting 37.3k task-sufficient environments enable significant performance gains when fine‑tuning language models on terminal‑centric benchmarks.

arXiv AI
Oct 9

TaReD: Tool-Aware Recursive Decomposition for Long-Horizon Tasks

TaReD introduces a tool-aware recursive decomposition strategy for long‑horizon tasks, organizing tools into a hierarchy of capabilities and allowing agents to discover and use tools on demand. By aligning subtask decomposition with the required capabilities, the method reduces the unreliability of long execution chains and improves task success rates. Experiments on complex real‑world tasks demonstrate up to a 40‑percentage‑point improvement over baseline approaches.

By Wei-Xiang Mao, Zhi-Kai Chen, De-Chuan Zhan, Han-Jia Ye
arXiv AI
Aug 18

AstronOS: A Unified Execution Model and Runtime for Long-Horizon Agentic Systems

arXiv:2608. 16381v1 Announce Type: new Abstract: Agentic systems often organize execution and state around a single conversation, model invocation, or agent instance, even when real work spans many calls and stages.

By Zhenhang Nie (iFLYTEK Co., Ltd., Hefei, China), Gui Zheng (iFLYTEK Co., Ltd., Hefei, China), Xudong Sun (iFLYTEK Co., Ltd., Hefei, China), Tailong Zhu (iFLYTEK Co., Ltd., Hefei, China), Bin Zhang (iFLYTEK Co., Ltd., Hefei, China)
arXiv AI
Oct 1

Composing Task-specific Agent Harnesses at Test Time with Reusable Primitives

The paper introduces Harness Primitives—reusable agent harness mechanisms mined from failed task trajectories—and a framework called STITCH that selects and composes these primitives into task‑specific harnesses at test time. This approach avoids generating or debugging harness code for each task, achieving up to 12‑point gains in task success over fixed harness baselines and outperforming human‑designed harnesses like Codex CLI. STITCH also demonstrates minimal test‑time overhead (2.7%) and scales efficiently with the size of the primitive library.

By Peng Kuang, Haibo Jin, Dehao Wu, Feiyang Deng, Xiaopeng Yuan, Jerry Wang, Haohan Wang
arXiv AI
21h ago

openJiuwen: Beyond Static Harnesses for Long-Horizon Coding Agents

arXiv:2608.27969v2 Announce Type: replace Abstract: Long-horizon coding agents operate over evolving repository states while increasingly relying on heterogeneous capabilities, delegated agents, and...

By Tao Yu, Xinyu Zhang, Qianqian Chen, Xiaoneng Xiang, Chia Kwangyang, Xingchen Huang, Ran Chen, Yangkai Ding, Zheng Wang, Yeo Boon Hong, Bingzheng Gan, Enrui Hu, Shuo Cheng, Deyang Li, Ruifeng Shi, Hongbo Wang, Qi Ye, Xuefeng Jin, Zhangchun Zhao