paper-with-me

Papers

LemonHarness Technical Report

2026-06-23 · Kailong Ren, Fubo Sun, Jiachen Liu, Liu Yang, Zimo Yin, Jiaying Li, Congli Yin, Ming He, Yu Huo, Jiawei Liu, Zeping Chen, Yubin Huangfu, Ronghua Li, Yixuan Wu, Xing Su, Yanzhi Xu, Likang Wu, Hongke Zhao, Lei Zhang, Xiaohui Geng, Jianping Fan arxiv

As large language model (LLM) agents are applied to longer tasks, they increasingly modify workspace state across multiple rounds of iteration. However, agents typically observe only tool outputs and log fragments, while the actual state changes occur in the file system. Without explicit workspace boundaries, state-changing operations such as file writes and temporary artifact generation may scatter changes across paths. Over time, these weakly constrained changes accumulate, making states such as modified files difficult to track. This paper presents LemonHarness, an integrated execution framework for long-horizon agents. LemonHarness establishes an explicit execution boundary by constraining state-changing operations within a clearly defined workspace and bringing model invocation, tool execution, and rule knowledge within a single controlled boundary. State-changing operations, including file writes, dependency installation, and temporary artifact creation, are executed through structured tool interfaces, with execution feedback recorded as observations available to subsequent model decisions. The system also introduces a reusable rule knowledge base, which turns recurring execution rules and acceptance criteria into runtime knowledge. LemonHarness further adds a time-aware execution mechanism that exposes elapsed and remaining budget to the model, so it can rebalance exploration, implementation, and validation effort as time pressure shifts and avoid timeouts from long waits or excessive verification. On Terminal-Bench 2.0, LemonHarness_GPT-5.3-CodeX reached 84.49% accuracy over 445 trials; pairing the same framework with the stronger GPT-5.5 backbone raised the average accuracy to 86.52% across five jobs. The results suggest that a unified runtime boundary, callable rule knowledge, and time-aware execution can improve the stability of long-horizon agent execution.

📄 PDF Abstract BibTeX arXiv:2606.24311

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Spectral Toolkit of Algorithms for Graphs: Technical Report (2)

2024-06-06 · Peter Macgregor, He Sun

Spectral Toolkit of Algorithms for Graphs (STAG) is an open-source library for efficient graph algorithms. This technical report presents the newly implemented component on locality sensitive hashing, kernel density esti…

ClusteringDensity Estimation

Duplicate Bug Report Detection With a Combination of Information Retrieval and Topic Modeling

2013-04-08 · 27th IEEE/ACM International Conference on Automated Software Engineering 2013 4 · Anh Tuan Nguyen, Tung Thanh Nguyen, Tien N. Nguyen, David Lo 외

Detecting duplicate bug reports helps reduce triaging efforts and save time for developers in fixing the same issues. Among several automated detection approaches, text-based information retrieval (IR) approaches have be…

DescriptiveInformation RetrievalRetrieval

Technical Report: The effect of Input Parameters on Falsification of Cyber-Physical Systems

2022-09-15 · Zahra Ramezani, Knut Åkesson

The aim of this technical report is to investigate the effect of input parameters on the falsification of cyber-physical systems (CPSs).

Spectral Toolkit of Algorithms for Graphs: Technical Report (1)

2023-04-05 · Peter Macgregor, He Sun

Spectral Toolkit of Algorithms for Graphs (STAG) is an open-source library for efficient spectral graph algorithms, and its development starts in September 2022. We have so far finished the component on local graph clust…

ClusteringGraph Clustering

Technical Report with Proofs for A Full Picture in Conformance Checking: Efficiently Summarizing All Optimal Alignments

2025-06-12 · Philipp Bär, Moe T. Wynn, Sander J. J. Leemans

This technical report provides proofs for the claims in the paper "A Full Picture in Conformance Checking: Efficiently Summarizing All Optimal Alignments".

All