Add README (EN/ZH) and CC-BY-4.0 license
Browse files- Add bilingual README with HuggingFace YAML metadata
- Fix Schema First citation accuracy (pilot study findings)
- Add CC-BY-4.0 license file
- README.md +547 -3
- README_zh.md +474 -0
- license +395 -0
README.md
CHANGED
|
@@ -1,3 +1,547 @@
|
|
| 1 |
-
---
|
| 2 |
-
license: cc-by-4.0
|
| 3 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: cc-by-4.0
|
| 3 |
+
language:
|
| 4 |
+
- en
|
| 5 |
+
- zh
|
| 6 |
+
tags:
|
| 7 |
+
- survey
|
| 8 |
+
- llm-agents
|
| 9 |
+
- agent-harness
|
| 10 |
+
- agent-frameworks
|
| 11 |
+
- harness-engineering
|
| 12 |
+
- evaluation
|
| 13 |
+
- agent-memory
|
| 14 |
+
- multi-agent-systems
|
| 15 |
+
pretty_name: "Agent Harness for Large Language Model Agents: A Survey"
|
| 16 |
+
size_categories:
|
| 17 |
+
- n<1K
|
| 18 |
+
---
|
| 19 |
+
|
| 20 |
+
[English](README.md) | [中文](README_zh.md)
|
| 21 |
+
|
| 22 |
+
# Agent Harness for Large Language Model Agents: A Survey
|
| 23 |
+
|
| 24 |
+
<p align="center">
|
| 25 |
+
<a href="https://github.com/Gloriaameng/LLM-Agent-Harness-Survey/stargazers"><img src="https://img.shields.io/github/stars/Gloriaameng/LLM-Agent-Harness-Survey?style=social" alt="GitHub Stars"></a>
|
| 26 |
+
<a href="LICENSE"><img src="https://img.shields.io/badge/License-CC--BY--4.0-blue.svg" alt="License"></a>
|
| 27 |
+
<img src="https://img.shields.io/badge/Papers-110%2B-green" alt="Papers">
|
| 28 |
+
<img src="https://img.shields.io/badge/Version-v2-orange" alt="Version">
|
| 29 |
+
</p>
|
| 30 |
+
|
| 31 |
+
<p align="center">
|
| 32 |
+
<img src="assets/architecture_diagram.png" width="720" alt="H=(E,T,C,S,L,V) Six-Component Architecture"/>
|
| 33 |
+
</p>
|
| 34 |
+
|
| 35 |
+
> ⭐ **This survey is actively maintained. If you find it useful, please star the repo to stay updated and help others find it.**
|
| 36 |
+
|
| 37 |
+
---
|
| 38 |
+
|
| 39 |
+
> **The agent execution harness — not the model — is the primary determinant of agent reliability at scale.**
|
| 40 |
+
> This survey formalizes the harness as a first-class architectural object **H = (E, T, C, S, L, V)**, surveys 110+ papers, blogs and reports across 23 systems, and maps 9 open technical challenges.
|
| 41 |
+
> 📄 **[Read the Paper](#)** (coming soon)
|
| 42 |
+
> ✉️ Corrections & suggestions: gloriamenng@gmail.com; chenliyi@xiaohongshu.com
|
| 43 |
+
|
| 44 |
+
If you find this survey useful, please cite:
|
| 45 |
+
|
| 46 |
+
```bibtex
|
| 47 |
+
@misc{meng2026agentharness,
|
| 48 |
+
title = {Agent Harness for Large Language Model Agents: A Survey},
|
| 49 |
+
author = {Meng, Qianyu and Wang, Yanan and Chen, Liyi and Wang, Qimeng and
|
| 50 |
+
Lu, Chengqiang and Wu, Wei and Gao, Yan and Wu, Yi and Hu, Yao},
|
| 51 |
+
year = {2026},
|
| 52 |
+
url = {https://github.com/Gloriaameng/LLM-Agent-Harness-Survey},
|
| 53 |
+
note = {Work in progress}
|
| 54 |
+
}
|
| 55 |
+
```
|
| 56 |
+
|
| 57 |
+
---
|
| 58 |
+
|
| 59 |
+
## 🆕 News & Updates
|
| 60 |
+
|
| 61 |
+
- **[2026-04-03]** Initial release
|
| 62 |
+
- **[2026-04-07]** Repo updated
|
| 63 |
+
|
| 64 |
+
---
|
| 65 |
+
|
| 66 |
+
## Table of Contents
|
| 67 |
+
|
| 68 |
+
- [Overview](#overview)
|
| 69 |
+
- [Historical Timeline](#historical-timeline)
|
| 70 |
+
- [Harness Completeness Matrix](#harness-completeness-matrix)
|
| 71 |
+
- [Paper List](#paper-list)
|
| 72 |
+
- [Historical Lineages](#historical-lineages)
|
| 73 |
+
- [Harness Taxonomy](#harness-taxonomy)
|
| 74 |
+
- [Technical Challenges](#technical-challenges)
|
| 75 |
+
- [Security & Sandboxing](#security--sandboxing)
|
| 76 |
+
- [Evaluation & Benchmarking](#evaluation--benchmarking)
|
| 77 |
+
- [Protocol Standardization](#protocol-standardization)
|
| 78 |
+
- [Runtime Context Management](#runtime-context-management)
|
| 79 |
+
- [Tool Use & Registry](#tool-use--registry)
|
| 80 |
+
- [Memory Architecture](#memory-architecture)
|
| 81 |
+
- [Planning & Reasoning](#planning--reasoning)
|
| 82 |
+
- [Multi-Agent Coordination](#multi-agent-coordination)
|
| 83 |
+
- [Compute Economics](#compute-economics)
|
| 84 |
+
- [Emerging Topics](#emerging-topics)
|
| 85 |
+
- [Future Directions](#future-directions)
|
| 86 |
+
- [Citation](#citation)
|
| 87 |
+
- [Update Log](#update-log)
|
| 88 |
+
|
| 89 |
+
---
|
| 90 |
+
|
| 91 |
+
## Overview
|
| 92 |
+
|
| 93 |
+
LLM agents are increasingly deployed in agentic settings where they autonomously plan, use tools, and act in multi-step environments. The dominant narrative attributes agent performance to the underlying model. **This survey challenges that assumption.**
|
| 94 |
+
|
| 95 |
+
We introduce a formal definition of the **agent execution harness** as a six-component tuple:
|
| 96 |
+
|
| 97 |
+
| Component | Symbol | Role |
|
| 98 |
+
|-----------|--------|------|
|
| 99 |
+
| Execution Loop | **E** | Observe-think-act cycle, termination conditions, error recovery |
|
| 100 |
+
| Tool Registry | **T** | Typed tool catalog, routing, monitoring, schema validation |
|
| 101 |
+
| Context Manager | **C** | What enters the context window, compaction, retrieval |
|
| 102 |
+
| State Store | **S** | Persistence across turns/sessions, crash recovery |
|
| 103 |
+
| Lifecycle Hooks | **L** | Auth, logging, policy enforcement, instrumentation |
|
| 104 |
+
| Evaluation Interface | **V** | Action trajectories, intermediate states, success signals |
|
| 105 |
+
|
| 106 |
+
**Key empirical evidence that harnesses matter:**
|
| 107 |
+
- 🔥 Pi Research: Grok Code Fast 1 jumped from **6.7% → 68.3%** on SWE-bench by changing *only* the harness edit-tool format — model unchanged
|
| 108 |
+
- 💀 OpenAI Codex: **1M lines of code, 0 hand-written** over 5 months — failure attributed not to model capability but to "underspecified environments"
|
| 109 |
+
- ⚡ Stripe Minions: **1,300 PRs/week, 0 human-written code** — harness-first engineering
|
| 110 |
+
- 📉 METR: benchmark-passing PRs have a **24.2pp lower** human merge rate, gap widening at 9.6pp/year — evaluation harness validity crisis
|
| 111 |
+
- 💬 *"The harness is the chassis; the model is the engine."* — practitioner consensus, 2026
|
| 112 |
+
|
| 113 |
+
<p align="center">
|
| 114 |
+
<img src="assets/root_cause_diagram.png" width="640" alt="Root Cause Analysis"/>
|
| 115 |
+
</p>
|
| 116 |
+
|
| 117 |
+
### What This Survey Accomplishes
|
| 118 |
+
|
| 119 |
+
**Conceptual contribution:** We formalize the agent harness as an architectural object with six governable components (E, T, C, S, L, V), elevating it from implicit infrastructure to an explicit research target.
|
| 120 |
+
|
| 121 |
+
**Empirical scope:** We systematically review 110+ papers spanning academic research (evaluation benchmarks, security frameworks, memory architectures) and production deployments (Stripe, OpenAI, Cursor, METR), establishing that harness design is a binding constraint on deployed agent reliability.
|
| 122 |
+
|
| 123 |
+
**Methodological advance:** We introduce the **Harness Completeness Matrix** — a structured assessment framework mapping which of the six components each system implements — enabling direct comparison across heterogeneous agent systems that prior surveys could not evaluate on common terms.
|
| 124 |
+
|
| 125 |
+
**Open challenges identified:** We document nine technical challenges where current research provides partial solutions but no production-grade infrastructure: formal security models, cross-harness portability, protocol interoperability (MCP/A2A), context economics at 1M+ tokens/task, Byzantine fault tolerance in multi-agent systems, and compositional verification.
|
| 126 |
+
|
| 127 |
+
**Practitioner-academic bridge:** Unlike prior surveys focused exclusively on model capabilities or isolated components (memory, planning, tool use), we synthesize peer-reviewed research with production deployment reports to show where theory meets practice — and where critical gaps remain.
|
| 128 |
+
|
| 129 |
+
**Intended audience:** Researchers designing agent infrastructure, practitioners building production systems, and evaluators seeking to understand why benchmark performance often fails to predict deployment outcomes.
|
| 130 |
+
|
| 131 |
+
---
|
| 132 |
+
|
| 133 |
+
## Historical Timeline
|
| 134 |
+
|
| 135 |
+
<p align="center">
|
| 136 |
+
<img src="assets/timeline.png" width="720" alt="Historical Evolution of Agent Harnesses"/>
|
| 137 |
+
</p>
|
| 138 |
+
|
| 139 |
+
| Year | Milestone | Significance |
|
| 140 |
+
|------|-----------|--------------|
|
| 141 |
+
| 1997–2005 | JUnit, TestNG, xUnit family | Software test harness paradigm; standardized observe-assert lifecycle |
|
| 142 |
+
| 2016 | OpenAI Gym (Brockman et al.) | RL environment harness; step/reset API becomes canonical interface |
|
| 143 |
+
| 2022 Nov | ChatGPT public release; LangChain emerges | LLM-native agent frameworks begin; tool-use as first-class citizen |
|
| 144 |
+
| 2023 | ReAct, Toolformer, MemGPT, Reflexion, Voyager, AutoGPT | Core agent patterns: reasoning-acting, memory, reflection, skill accumulation |
|
| 145 |
+
| 2023 | CAMEL, ChatDev, Generative Agents | Multi-agent coordination; social simulation harnesses |
|
| 146 |
+
| 2023 | AgentBench, SWE-bench | Agent evaluation infrastructure emerges |
|
| 147 |
+
| 2024 | MetaGPT, WebArena, ToolLLM, SWE-agent, OSWorld | Full-stack harnesses; real-world environment benchmarks |
|
| 148 |
+
| 2024 | CodeAct, LATS, Tree of Thoughts | Structured action spaces; search-augmented planning |
|
| 149 |
+
| 2024 Nov | Anthropic releases MCP protocol | First major tool↔harness standardization (2–15ms latency) |
|
| 150 |
+
| 2025 | HAL, AIOS, LangGraph | Benchmark unification (21,730 rollouts); OS-level scheduling (2.1× speedup) |
|
| 151 |
+
| 2025 | Google releases A2A protocol | Agent↔agent standardization (50–200ms) |
|
| 152 |
+
| 2025 | MemoryOS, SkillsBench†, AgentBound† | Memory OS abstraction; skills-as-context (+16.2pp); safety certification |
|
| 153 |
+
| 2026 Jan–Mar | AgencyBench†, SandboxEscapeBench†, PRISM†, AEGIS†, SkillFortify†, Schema First† | Compute economics; 15–35% escape rates; runtime security; schema discipline |
|
| 154 |
+
|
| 155 |
+
*† preprint*
|
| 156 |
+
|
| 157 |
+
---
|
| 158 |
+
|
| 159 |
+
## Harness Completeness Matrix
|
| 160 |
+
|
| 161 |
+
**Legend:** ✓ full support · ≈ partial · ✗ absent
|
| 162 |
+
|
| 163 |
+
<table align="center">
|
| 164 |
+
<thead>
|
| 165 |
+
<tr>
|
| 166 |
+
<th>Category</th>
|
| 167 |
+
<th>System</th>
|
| 168 |
+
<th title="Execution Loop">E</th>
|
| 169 |
+
<th title="Tool Registry">T</th>
|
| 170 |
+
<th title="Context Manager">C</th>
|
| 171 |
+
<th title="State Store">S</th>
|
| 172 |
+
<th title="Lifecycle Hooks">L</th>
|
| 173 |
+
<th title="Evaluation Interface">V</th>
|
| 174 |
+
</tr>
|
| 175 |
+
</thead>
|
| 176 |
+
<tbody>
|
| 177 |
+
<tr>
|
| 178 |
+
<td rowspan="4"><strong>Full-Stack<br>Harnesses</strong></td>
|
| 179 |
+
<td>Claude Code</td>
|
| 180 |
+
<td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>≈</td>
|
| 181 |
+
</tr>
|
| 182 |
+
<tr>
|
| 183 |
+
<td>OpenClaw / PRISM</td>
|
| 184 |
+
<td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td>
|
| 185 |
+
</tr>
|
| 186 |
+
<tr>
|
| 187 |
+
<td>AIOS</td>
|
| 188 |
+
<td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>≈</td>
|
| 189 |
+
</tr>
|
| 190 |
+
<tr>
|
| 191 |
+
<td>OpenHands</td>
|
| 192 |
+
<td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>≈</td>
|
| 193 |
+
</tr>
|
| 194 |
+
<tr>
|
| 195 |
+
<td rowspan="6"><strong>Multi-Agent<br>Harnesses</strong></td>
|
| 196 |
+
<td>MetaGPT</td>
|
| 197 |
+
<td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>≈</td>
|
| 198 |
+
</tr>
|
| 199 |
+
<tr>
|
| 200 |
+
<td>AutoGen</td>
|
| 201 |
+
<td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>≈</td>
|
| 202 |
+
</tr>
|
| 203 |
+
<tr>
|
| 204 |
+
<td>ChatDev</td>
|
| 205 |
+
<td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>≈</td><td>≈</td>
|
| 206 |
+
</tr>
|
| 207 |
+
<tr>
|
| 208 |
+
<td>CAMEL</td>
|
| 209 |
+
<td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>✗</td><td>≈</td>
|
| 210 |
+
</tr>
|
| 211 |
+
<tr>
|
| 212 |
+
<td>DeerFlow</td>
|
| 213 |
+
<td>✓</td><td>✓</td><td>≈</td><td>��</td><td>≈</td><td>≈</td>
|
| 214 |
+
</tr>
|
| 215 |
+
<tr>
|
| 216 |
+
<td>DeepAgents</td>
|
| 217 |
+
<td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>≈</td>
|
| 218 |
+
</tr>
|
| 219 |
+
<tr>
|
| 220 |
+
<td rowspan="3"><strong>General<br>Frameworks</strong></td>
|
| 221 |
+
<td>LangChain</td>
|
| 222 |
+
<td>✓</td><td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>✗</td>
|
| 223 |
+
</tr>
|
| 224 |
+
<tr>
|
| 225 |
+
<td>LangGraph</td>
|
| 226 |
+
<td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>✗</td><td>✗</td>
|
| 227 |
+
</tr>
|
| 228 |
+
<tr>
|
| 229 |
+
<td>LlamaIndex</td>
|
| 230 |
+
<td>≈</td><td>✓</td><td>✓</td><td>≈</td><td>✗</td><td>✗</td>
|
| 231 |
+
</tr>
|
| 232 |
+
<tr>
|
| 233 |
+
<td rowspan="1"><strong>Specialized<br>Harnesses</strong></td>
|
| 234 |
+
<td>SWE-agent</td>
|
| 235 |
+
<td>✓</td><td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>✓</td>
|
| 236 |
+
</tr>
|
| 237 |
+
<tr>
|
| 238 |
+
<td rowspan="5"><strong>Capability<br>Modules</strong></td>
|
| 239 |
+
<td>MemGPT</td>
|
| 240 |
+
<td>✗</td><td>✗</td><td>✓</td><td>✓</td><td>✗</td><td>✗</td>
|
| 241 |
+
</tr>
|
| 242 |
+
<tr>
|
| 243 |
+
<td>Voyager</td>
|
| 244 |
+
<td>✓</td><td>✓</td><td>≈</td><td>✓</td><td>✗</td><td>≈</td>
|
| 245 |
+
</tr>
|
| 246 |
+
<tr>
|
| 247 |
+
<td>Reflexion</td>
|
| 248 |
+
<td>≈</td><td>✗</td><td>≈</td><td>✓</td><td>✗</td><td>≈</td>
|
| 249 |
+
</tr>
|
| 250 |
+
<tr>
|
| 251 |
+
<td>Generative Agents</td>
|
| 252 |
+
<td>✓</td><td>✗</td><td>≈</td><td>✓</td><td>✗</td><td>≈</td>
|
| 253 |
+
</tr>
|
| 254 |
+
<tr>
|
| 255 |
+
<td>Concordia</td>
|
| 256 |
+
<td>✓</td><td>✗</td><td>≈</td><td>✓</td><td>✗</td><td>≈</td>
|
| 257 |
+
</tr>
|
| 258 |
+
<tr>
|
| 259 |
+
<td rowspan="4"><strong>Evaluation<br>Infrastructure</strong></td>
|
| 260 |
+
<td>HAL</td>
|
| 261 |
+
<td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>✓</td>
|
| 262 |
+
</tr>
|
| 263 |
+
<tr>
|
| 264 |
+
<td>AgentBench</td>
|
| 265 |
+
<td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>✗</td><td>✓</td>
|
| 266 |
+
</tr>
|
| 267 |
+
<tr>
|
| 268 |
+
<td>OSWorld</td>
|
| 269 |
+
<td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>✗</td><td>✓</td>
|
| 270 |
+
</tr>
|
| 271 |
+
<tr>
|
| 272 |
+
<td>BrowserGym</td>
|
| 273 |
+
<td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>✗</td><td>✓</td>
|
| 274 |
+
</tr>
|
| 275 |
+
</tbody>
|
| 276 |
+
</table>
|
| 277 |
+
|
| 278 |
+
---
|
| 279 |
+
|
| 280 |
+
## Paper List
|
| 281 |
+
|
| 282 |
+
### Historical Lineages
|
| 283 |
+
|
| 284 |
+
#### Software Test Harnesses (1990s–2000s)
|
| 285 |
+
|
| 286 |
+
- <u>JUnit</u>: **"JUnit: A Cook's Tour"**. *Beck & Gamma.* Java Report, 4(5), May 1999. [[Article](http://junit.sourceforge.net/doc/cookstour/cookstour.htm)]
|
| 287 |
+
|
| 288 |
+
#### RL Environment Harnesses (2016–2022)
|
| 289 |
+
|
| 290 |
+
- <u>OpenAI Gym</u>: **"OpenAI Gym"**. *Brockman et al.* arXiv 2016. [[Paper](https://arxiv.org/abs/1606.01540)] [[Code](https://github.com/openai/gym)]
|
| 291 |
+
- <u>Gymnasium</u>: **"Gymnasium: A Standard Interface for Reinforcement Learning Environments"**. *Towers et al.* NeurIPS 2025. [[Paper](https://arxiv.org/abs/2407.17032)] [[Code](https://github.com/Farama-Foundation/Gymnasium)]
|
| 292 |
+
|
| 293 |
+
#### Early LLM Agent Frameworks (2023–2024)
|
| 294 |
+
|
| 295 |
+
- <u>ReAct</u>: **"ReAct: Synergizing Reasoning and Acting in Language Models"**. *Yao et al.* ICLR 2023. [[Paper](https://arxiv.org/abs/2210.03629)] [[Code](https://github.com/ysymyth/ReAct)]
|
| 296 |
+
- <u>Toolformer</u>: **"Toolformer: Language Models Can Teach Themselves to Use Tools"**. *Schick et al.* NeurIPS 2023. [[Paper](https://arxiv.org/abs/2302.04761)]
|
| 297 |
+
- <u>AutoGPT</u>: **"Auto-GPT: An Autonomous GPT-4 Experiment"**. *Gravitas et al.* GitHub 2023. [[Code](https://github.com/Significant-Gravitas/AutoGPT)]
|
| 298 |
+
- <u>LangChain</u>: **"LangChain: Building Applications with LLMs through Composability"**. *Chase et al.* GitHub 2022. [[Code](https://github.com/langchain-ai/langchain)]
|
| 299 |
+
|
| 300 |
+
---
|
| 301 |
+
|
| 302 |
+
### Harness Taxonomy
|
| 303 |
+
|
| 304 |
+
**What we classify:** We categorize agent systems by **harness completeness** — which of the six components (E, T, C, S, L, V) each system implements — distinguishing full-stack harnesses (all six components) from specialized frameworks (partial implementations).
|
| 305 |
+
|
| 306 |
+
**Why it matters:** Prior taxonomies classified agents by application domain (coding, web navigation, embodied AI) or model architecture (single-agent, multi-agent). These categorizations cannot explain why systems with similar models achieve different reliability outcomes. Our harness-centric taxonomy reveals that production-grade systems converge on full ETCSLV implementations, while research prototypes often implement only 2-3 components.
|
| 307 |
+
|
| 308 |
+
**Key finding:** No agent framework can achieve production reliability without implementing **all six governance components**. Systems missing L-component (lifecycle hooks) cannot enforce safety policies. Systems missing V-component (evaluation interfaces) cannot debug failures. Systems missing S-component (state persistence) cannot recover from crashes.
|
| 309 |
+
|
| 310 |
+
#### Full-Stack Harnesses
|
| 311 |
+
|
| 312 |
+
- <u>PRISM/OpenClaw</u>: **"OpenClaw PRISM: A Zero-Fork, Defense-in-Depth Runtime Security Layer for Tool-Augmented LLM Agents"**. *Li.* arXiv 2026. [[Paper](https://arxiv.org/abs/2603.11853)]
|
| 313 |
+
- <u>AIOS</u>: **"AIOS: LLM Agent Operating System"**. *Mei et al.* COLM 2025. [[Paper](https://arxiv.org/abs/2403.16971)] [[Code](https://github.com/agiresearch/AIOS)]
|
| 314 |
+
- <u>OpenHands</u>: **"OpenHands: An Open Platform for AI Software Developers as Generalist Agents"**. *Wang et al.* ICLR 2025. [[Paper](https://arxiv.org/abs/2407.16741)] [[Code](https://github.com/All-Hands-AI/OpenHands)]
|
| 315 |
+
- <u>SWE-agent</u>: **"SWE-agent: Agent-Computer Interfaces Enable Automated Software Engineering"**. *Yang et al.* NeurIPS 2024. [[Paper](https://arxiv.org/abs/2405.15793)] [[Code](https://github.com/SWE-agent/SWE-agent)]
|
| 316 |
+
- <u>HAL</u>: **"Holistic Agent Leaderboard: The Missing Infrastructure for AI Agent Evaluation"**. *Kapoor et al.* ICLR 2026. [[Paper](https://arxiv.org/abs/2510.11977)]
|
| 317 |
+
|
| 318 |
+
#### Multi-Agent Harnesses
|
| 319 |
+
|
| 320 |
+
- <u>MetaGPT</u>: **"MetaGPT: Meta Programming for a Multi-Agent Collaborative Framework"**. *Hong et al.* ICLR 2024. [[Paper](https://arxiv.org/abs/2308.00352)] [[Code](https://github.com/geekan/MetaGPT)]
|
| 321 |
+
- <u>AutoGen</u>: **"AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversation"**. *Wu et al.* arXiv 2023. [[Paper](https://arxiv.org/abs/2308.08155)] [[Code](https://github.com/microsoft/autogen)]
|
| 322 |
+
- <u>ChatDev</u>: **"ChatDev: Communicative Agents for Software Development"**. *Qian et al.* ACL 2024. [[Paper](https://arxiv.org/abs/2307.07924)] [[Code](https://github.com/OpenBMB/ChatDev)]
|
| 323 |
+
- <u>CAMEL</u>: **"CAMEL: Communicative Agents for 'Mind' Exploration of Large Language Model Society"**. *Li et al.* NeurIPS 2023. [[Paper](https://arxiv.org/abs/2303.17760)] [[Code](https://github.com/camel-ai/camel)]
|
| 324 |
+
|
| 325 |
+
#### Frameworks & Modules
|
| 326 |
+
|
| 327 |
+
- <u>LangGraph</u>: **"LangGraph: Build Resilient Language Agents as Graphs"**. *LangChain team.* GitHub 2024. [[Code](https://github.com/langchain-ai/langgraph)]
|
| 328 |
+
- <u>MemGPT</u>: **"MemGPT: Towards LLMs as Operating Systems"**. *Packer et al.* NeurIPS 2023. [[Paper](https://arxiv.org/abs/2310.08560)] [[Code](https://github.com/cpacker/MemGPT)]
|
| 329 |
+
- <u>Voyager</u>: **"Voyager: An Open-Ended Embodied Agent with Large Language Models"**. *Wang et al.* arXiv 2023. [[Paper](https://arxiv.org/abs/2305.16291)] [[Code](https://github.com/MineDojo/Voyager)]
|
| 330 |
+
- <u>Reflexion</u>: **"Reflexion: Language Agents with Verbal Reinforcement Learning"**. *Shinn et al.* NeurIPS 2023. [[Paper](https://arxiv.org/abs/2303.11366)] [[Code](https://github.com/noahshinn/reflexion)]
|
| 331 |
+
- <u>Generative Agents</u>: **"Generative Agents: Interactive Simulacra of Human Behavior"**. *Park et al.* UIST 2023. [[Paper](https://arxiv.org/abs/2304.03442)] [[Code](https://github.com/joonspk-research/generative_agents)]
|
| 332 |
+
- <u>LangChain</u>: **"LangChain: Building Applications with LLMs through Composability"**. *Chase et al.* GitHub 2022. [[Code](https://github.com/langchain-ai/langchain)]
|
| 333 |
+
- <u>LlamaIndex</u>: **"LlamaIndex: A Data Framework for LLM Applications"**. *Liu et al.* GitHub 2022. [[Code](https://github.com/run-llama/llama_index)]
|
| 334 |
+
- <u>DeerFlow</u>: **"DeerFlow: Distributed Workflow Engine for LLM Agents"**. *GitHub 2024.* [[Code](https://github.com/modelscope/DeerFlow)]
|
| 335 |
+
- <u>DeepAgents</u>: **"DeepAgents: Multi-Agent Framework for Deep Learning"**. *GitHub 2024.* [[Code](https://github.com/deepagents/deepagents)]
|
| 336 |
+
|
| 337 |
+
#### Evaluation Infrastructure
|
| 338 |
+
|
| 339 |
+
- <u>AgentBench</u>: **"AgentBench: Evaluating LLMs as Agents"**. *Liu et al.* ICLR 2024. [[Paper](https://arxiv.org/abs/2308.03688)] [[Code](https://github.com/THUDM/AgentBench)]
|
| 340 |
+
- <u>SWE-bench</u>: **"SWE-bench: Can Language Models Resolve Real-World GitHub Issues?"**. *Jimenez et al.* ICLR 2024. [[Paper](https://arxiv.org/abs/2310.06770)] [[Code](https://github.com/swebench/SWE-bench)]
|
| 341 |
+
- <u>OSWorld</u>: **"OSWorld: Benchmarking Multimodal Agents for Open-Ended Tasks in Real Computer Environments"**. *Xie et al.* NeurIPS 2024. [[Paper](https://arxiv.org/abs/2404.07972)] [[Code](https://github.com/xlang-ai/OSWorld)]
|
| 342 |
+
- <u>WebArena</u>: **"WebArena: A Realistic Web Environment for Building Autonomous Agents"**. *Zhou et al.* ICLR 2024. [[Paper](https://arxiv.org/abs/2307.13854)] [[Code](https://github.com/web-arena-x/webarena)]
|
| 343 |
+
- <u>GAIA</u>: **"GAIA: A Benchmark for General AI Assistants"**. *Mialon et al.* ICLR 2024. [[Paper](https://arxiv.org/abs/2311.12983)]
|
| 344 |
+
- <u>Mind2Web</u>: **"Mind2Web: Towards a Generalist Agent for the Web"**. *Deng et al.* NeurIPS 2023. [[Paper](https://arxiv.org/abs/2306.06070)]
|
| 345 |
+
- <u>AgentBoard</u>: **"AgentBoard: An Analytical Evaluation Board of Multi-Turn LLM Agents"**. *Ma et al.* NeurIPS 2024. [[Paper](https://arxiv.org/abs/2401.13178)]
|
| 346 |
+
- <u>InterCode</u>: **"InterCode: Standardizing and Benchmarking Interactive Coding with Execution Feedback"**. *Yang et al.* NeurIPS 2023. [[Paper](https://arxiv.org/abs/2306.14898)]
|
| 347 |
+
|
| 348 |
+
---
|
| 349 |
+
|
| 350 |
+
### Technical Challenges
|
| 351 |
+
|
| 352 |
+
**Scope:** We identify nine open research problems where current harness infrastructure provides partial solutions but no production-grade, generalizable frameworks. Each challenge represents a gap between what academic prototypes demonstrate and what deployed systems require.
|
| 353 |
+
|
| 354 |
+
**Evaluation criteria:** For each challenge, we assess: (1) **Academic coverage** — peer-reviewed solutions, if any; (2) **Production maturity** — whether any deployed system has solved it at scale; (3) **Blocking severity** — whether the unsolved problem prevents deployment or merely limits performance.
|
| 355 |
+
|
| 356 |
+
**Cross-cutting theme:** Most challenges stem from the **composition problem** — individual components (security sandboxes, memory stores, evaluation metrics) work in isolation, but combining them into a coherent harness surfaces emergent failures. Formal verification, portability testing, and protocol interoperability all require compositional reasoning that current research has not addressed.
|
| 357 |
+
|
| 358 |
+
#### Security & Sandboxing
|
| 359 |
+
|
| 360 |
+
**Challenge:** Agent sandboxes must prevent malicious tool use while permitting legitimate system access — a harder problem than traditional application sandboxing because agents **intentionally** interact with sensitive resources (file systems, network APIs, shell commands).
|
| 361 |
+
|
| 362 |
+
**State of the art:** SandboxEscapeBench shows frontier models can escape containers; PRISM demonstrates zero-fork defense-in-depth is possible but requires OS-level instrumentation. No generalizable sandbox exists that works across all agent use cases without manual per-task configuration.
|
| 363 |
+
|
| 364 |
+
**Open problems:** Compositional security properties (proving agent + harness + environment satisfy a safety specification) remain unsolved. Current defenses are reactive (detecting escapes) rather than preventive (proving impossibility of escape).
|
| 365 |
+
|
| 366 |
+
> **Key numbers:** SandboxEscapeBench — frontier LLMs achieve **15–35% container escape rates**; PRISM — 10-hook zero-fork runtime reduces escape to near-zero with <5ms overhead.
|
| 367 |
+
|
| 368 |
+
- <u>SandboxEscapeBench</u>†: **"Quantifying Frontier LLM Capabilities for Container Sandbox Escape"**. *Marchand et al.* arXiv 2026. [[Paper](https://arxiv.org/abs/2603.02277)]
|
| 369 |
+
- <u>InjecAgent</u>: **"InjecAgent: Benchmarking Indirect Prompt Injections in Tool-Integrated Large Language Model Agents"**. *Zhan et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2403.02691)]
|
| 370 |
+
- <u>ToolHijacker</u>†: **"Prompt Injection Attack to Tool Selection in LLM Agents"**. *Shi et al.* NDSS 2026. [[Paper](https://arxiv.org/abs/2504.19793)]
|
| 371 |
+
- <u>Securing MCP</u>†: **"Securing the Model Context Protocol (MCP): Risks, Controls, and Governance"**. *Errico et al.* arXiv 2025. [[Paper](https://arxiv.org/abs/2511.20920)]
|
| 372 |
+
- <u>SHIELDA</u>†: **"SHIELDA: Structured Handling of Exceptions in LLM-Driven Agentic Workflows"**. *Zhou et al.* arXiv 2025. [[Paper](https://arxiv.org/abs/2508.07935)]
|
| 373 |
+
- <u>PALADIN</u>†: **"PALADIN: Self-Correcting Language Model Agents to Cure Tool-Failure Cases"**. *Vuddanti et al.* ICLR 2026. [[Paper](https://arxiv.org/abs/2509.25238)]
|
| 374 |
+
- <u>AgentBound</u>†: **"Securing AI Agent Execution"**. *Bühler et al.* arXiv 2025. [[Paper](https://arxiv.org/abs/2510.21236)]
|
| 375 |
+
- <u>AgentSys</u>†: **"AgentSys: Secure and Dynamic LLM Agents Through Explicit Hierarchical Memory Management"**. *Wen et al.* arXiv 2026. [[Paper](https://arxiv.org/abs/2602.07398)]
|
| 376 |
+
- <u>Indirect Prompt Injection</u>: **"Not What You've Signed Up For: Compromising Real-World LLM-Integrated Applications with Indirect Prompt Injection"**. *Greshake et al.* AISec 2023. [[Paper](https://arxiv.org/abs/2302.12173)]
|
| 377 |
+
- <u>AgentHarm</u>†: **"AgentHarm: A Benchmark for Measuring Harmfulness of LLM Agents"**. *Andriushchenko et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2410.09024)]
|
| 378 |
+
- <u>TrustAgent</u>: **"TrustAgent: Towards Safe and Trustworthy LLM-Based Agents"**. *Hua et al.* EMNLP 2024. [[Paper](https://arxiv.org/abs/2402.01586)]
|
| 379 |
+
- <u>ToolEmu</u>†: **"Identifying the Risks of LM Agents with an LM-Emulated Sandbox"**. *Ruan et al.* arXiv 2023. [[Paper](https://arxiv.org/abs/2309.15817)]
|
| 380 |
+
- <u>Ignore Previous Prompt</u>: **"Ignore Previous Prompt: Attack Techniques For Language Models"**. *Perez & Ribeiro.* NeurIPS ML Safety Workshop 2022. [[Paper](https://arxiv.org/abs/2211.09527)]
|
| 381 |
+
|
| 382 |
+
#### Evaluation & Benchmarking
|
| 383 |
+
|
| 384 |
+
> **Key numbers:** HAL unified **21,730 rollouts**, compressing weeks of evaluation to hours; OSWorld reports **28% false negative rate** in automated evaluation; METR finds benchmark-passing PRs have **24.2pp lower** human merge rate, widening at 9.6pp/year.
|
| 385 |
+
|
| 386 |
+
- <u>AgencyBench</u>†: **"AgencyBench: Benchmarking the Frontiers of Autonomous Agents in 1M-Token Real-World Contexts"**. *Li et al.* arXiv 2026. [[Paper](https://arxiv.org/abs/2601.11044)]
|
| 387 |
+
- <u>AEGIS</u>†: **"AEGIS: No Tool Call Left Unchecked -- A Pre-Execution Firewall and Audit Layer for AI Agents"**. *Yuan et al.* arXiv 2026. [[Paper](https://arxiv.org/abs/2603.12621)]
|
| 388 |
+
- <u>Hell or High Water</u>†: **"Hell or High Water: Evaluating Agentic Recovery from External Failures"**. *Wang et al.* COLM 2025. [[Paper](https://arxiv.org/abs/2508.11027)]
|
| 389 |
+
- <u>SearchLLM</u>†: **"Aligning Large Language Models with Searcher Preferences"**. *Wu et al.* arXiv 2026. [[Paper](https://arxiv.org/abs/2603.10473)]
|
| 390 |
+
- <u>Meta-Harness</u>†: **"Meta-Harness: End-to-End Optimization of Model Harnesses"**. *Lee et al.* arXiv 2026. [[Paper](https://arxiv.org/abs/2603.28052)]
|
| 391 |
+
- <u>TheAgentCompany</u>†: **"TheAgentCompany: Benchmarking LLM Agents on Consequential Real-World Tasks"**. *Xu et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2412.14161)]
|
| 392 |
+
- <u>BrowserGym</u>†: **"The BrowserGym Ecosystem for Web Agent Research"**. *Le Sellier De Chezelles et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2412.05467)]
|
| 393 |
+
- <u>WorkArena</u>†: **"WorkArena: How Capable are Web Agents at Solving Common Knowledge Work Tasks?"**. *Drouin et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2403.07718)]
|
| 394 |
+
- <u>R-Judge</u>: **"R-Judge: Benchmarking Safety Risk Awareness for LLM Agents"**. *Yuan et al.* EMNLP 2024. [[Paper](https://arxiv.org/abs/2401.10019)]
|
| 395 |
+
- <u>R2E</u>: **"R2E: Turning any GitHub Repository into a Programming Agent Environment"**. *Jain et al.* ICML 2024. [[Paper](https://proceedings.mlr.press/v235/jain24c.html)]
|
| 396 |
+
- <u>Evaluation Survey</u>: **"Evaluation and Benchmarking of LLM Agents: A Survey"**. *Mohammadi et al.* KDD 2025. [[Paper](https://arxiv.org/abs/2507.21504)]
|
| 397 |
+
- <u>PentestJudge</u>†: **"PentestJudge: Judging Agent Behavior Against Operational Requirements"**. *Caldwell et al.* arXiv 2025. [[Paper](https://arxiv.org/abs/2508.02921)]
|
| 398 |
+
|
| 399 |
+
#### Protocol Standardization
|
| 400 |
+
|
| 401 |
+
> **Key numbers:** MCP (tool↔harness): 2–15ms latency; A2A (agent↔agent): 50–200ms; ACP (intent-level, IBM) — three protocols serve complementary roles.
|
| 402 |
+
|
| 403 |
+
- <u>MCP</u>: **"Model Context Protocol"**. *Anthropic.* Technical Report 2024. [[Spec](https://modelcontextprotocol.io)]
|
| 404 |
+
- <u>A2A</u>: **"Agent-to-Agent Protocol"**. *Google.* Technical Report 2025. [[Spec](https://google.github.io/A2A/)]
|
| 405 |
+
- <u>Protocol Comparison</u>†: **"A Survey of Agent Interoperability Protocols: Model Context Protocol (MCP), Agent Communication Protocol (ACP), Agent-to-Agent Protocol (A2A), and Agent Network Protocol (ANP)"**. *Ehtesham et al.* arXiv 2025. [[Paper](https://arxiv.org/abs/2505.02279)]
|
| 406 |
+
- <u>Gorilla</u>: **"Gorilla: Large Language Model Connected with Massive APIs"**. *Patil et al.* NeurIPS 2023. [[Paper](https://arxiv.org/abs/2305.15334)] [[Code](https://github.com/ShishirPatil/gorilla)]
|
| 407 |
+
|
| 408 |
+
#### Runtime Context Management
|
| 409 |
+
|
| 410 |
+
> **Key numbers:** SkillsBench — curated skill injection yields **+16.2pp** improvement; "Lost in the Middle" effect documented; long-context models shift the problem from *retention* to *salience*.
|
| 411 |
+
|
| 412 |
+
- <u>SkillsBench</u>†: **"SkillsBench: Benchmarking How Well Agent Skills Work Across Diverse Tasks"**. *Li et al.* arXiv 2026. [[Paper](https://arxiv.org/abs/2602.12670)]
|
| 413 |
+
- <u>ReadAgent</u>: **"A Human-Inspired Reading Agent with Gist Memory of Very Long Contexts"**. *Lee et al.* ICML 2024. [[Paper](https://arxiv.org/abs/2402.09727)]
|
| 414 |
+
- <u>MemoryOS</u>: **"Memory OS of AI Agent"**. *Kang et al.* arXiv 2025. [[Paper](https://arxiv.org/abs/2506.06326)]
|
| 415 |
+
- <u>CoALA</u>: **"Cognitive Architectures for Language Agents"**. *Sumers et al.* TMLR 2024. [[Paper](https://arxiv.org/abs/2309.02427)]
|
| 416 |
+
- <u>SkillFortify</u>†: **"Formal Analysis and Supply Chain Security for Agentic AI Skills"**. *Bhardwaj.* arXiv 2026. [[Paper](https://arxiv.org/abs/2603.00195)]
|
| 417 |
+
- <u>Lost in the Middle</u>: **"Lost in the Middle: How Language Models Use Long Contexts"**. *Liu et al.* TACL 2024. [[Paper](https://arxiv.org/abs/2307.03172)]
|
| 418 |
+
- <u>Context Engineering Survey</u>†: **"Context Engineering: A Survey of 1,400 Papers on Effective Context Management for LLM Agents"**. *Mei et al.* arXiv 2025. [[Paper](https://arxiv.org/abs/2507.13334)]
|
| 419 |
+
|
| 420 |
+
#### Tool Use & Registry
|
| 421 |
+
|
| 422 |
+
> **Key numbers:** Vercel found removing **80% of tools** helped more than any model upgrade; Schema First (Sigdel & Baral, 2026) — a controlled pilot showing that schema-based tool contracts reduce *interface* misuse but not *semantic* misuse, with end-task success at zero across all conditions, suggesting interface design alone is insufficient for tool reliability; CodeAct outperforms on **17/17 Mint benchmarks** with **−20% turns**.
|
| 423 |
+
|
| 424 |
+
- <u>CodeAct</u>: **"Executable Code Actions Elicit Better LLM Agents"**. *Wang et al.* ICML 2024. [[Paper](https://arxiv.org/abs/2402.01030)] [[Code](https://github.com/xingyaoww/code-act)]
|
| 425 |
+
- <u>Schema First</u>†: **"Schema First Tool APIs for LLM Agents: A Controlled Study of Tool Misuse, Recovery, and Budgeted Performance"**. *Sigdel & Baral.* arXiv 2026. [[Paper](https://arxiv.org/abs/2603.13404)]
|
| 426 |
+
- <u>ToolLLM</u>: **"ToolLLM: Facilitating Large Language Models to Master 16000+ Real-world APIs"**. *Qin et al.* ICLR 2024. [[Paper](https://arxiv.org/abs/2307.16789)] [[Code](https://github.com/OpenBMB/ToolBench)]
|
| 427 |
+
- <u>ToolSandbox</u>†: **"ToolSandbox: A Stateful, Conversational, Interactive Evaluation Benchmark for LLM Tool Use Capabilities"**. *Lu et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2408.04682)]
|
| 428 |
+
- <u>AutoTool</u>†: **"AutoTool: Efficient Tool Selection for Large Language Model Agents"**. *Jia & Li.* AAAI 2026. [[Paper](https://arxiv.org/abs/2511.14650)]
|
| 429 |
+
- <u>Tool Learning Survey</u>: **"Tool Learning with Large Language Models: A Survey"**. *Qu et al.* Frontiers of Computer Science 2024. [[Paper](https://arxiv.org/abs/2405.17935)]
|
| 430 |
+
- <u>GoEX</u>†: **"GoEX: Perspectives and Designs Towards a Runtime for Autonomous LLM Applications"**. *Patil et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2404.06921)]
|
| 431 |
+
- <u>AgentTuning</u>: **"AgentTuning: Enabling Generalized Agent Abilities for LLMs"**. *Zeng et al.* ACL 2024. [[Paper](https://arxiv.org/abs/2310.12823)]
|
| 432 |
+
|
| 433 |
+
#### Memory Architecture
|
| 434 |
+
|
| 435 |
+
> **Key numbers:** Mem0 achieves **90% token reduction** vs full-context; Zep temporal knowledge: **+18.5% QA accuracy**; Agent Workflow Memory: **+14.9%** on Mind2Web. Six architectural patterns: flat buffer → hierarchical → episodic → semantic → procedural → graph.
|
| 436 |
+
|
| 437 |
+
- <u>Agent Workflow Memory (AWM)</u>†: **"Agent Workflow Memory"**. *Wang et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2409.07429)]
|
| 438 |
+
- <u>Mem0</u>†: **"Mem0: Building Production-Ready AI Agents with Scalable Long-Term Memory"**. *Khant et al.* arXiv 2025. [[Paper](https://arxiv.org/abs/2504.19413)]
|
| 439 |
+
- <u>A-MEM</u>†: **"A-MEM: Agentic Memory for LLM Agents"**. *Xu et al.* NeurIPS 2025. [[Paper](https://arxiv.org/abs/2502.12110)]
|
| 440 |
+
- <u>MemAct</u>†: **"Memory as Action: Autonomous Context Curation for Long-Horizon Agentic Tasks"**. *Zhang et al.* arXiv 2025. [[Paper](https://arxiv.org/abs/2510.12635)]
|
| 441 |
+
- <u>Memory Survey</u>†: **"Memory for Autonomous LLM Agents: Mechanisms, Evaluation, and Emerging Frontiers"**. *Du.* arXiv 2026. [[Paper](https://arxiv.org/abs/2603.07670)]
|
| 442 |
+
- <u>MemoryBank</u>: **"MemoryBank: Enhancing Large Language Models with Long-Term Memory"**. *Zhong et al.* AAAI 2024. [[Paper](https://arxiv.org/abs/2305.10250)]
|
| 443 |
+
- <u>LoCoMo</u>†: **"Evaluating Very Long-Term Conversational Memory of LLM Agents"**. *Maharana et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2402.17753)]
|
| 444 |
+
- <u>Memory Mechanisms Survey</u>†: **"A Survey on the Memory Mechanism of Large Language Model Based Agents"**. *Zhang et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2404.13501)]
|
| 445 |
+
- <u>Evo-Memory</u>†: **"Evo-Memory: Benchmarking LLM Agent Test-time Learning with Self-Evolving Memory"**. *Wei et al.* arXiv 2025. [[Paper](https://arxiv.org/abs/2511.20857)]
|
| 446 |
+
|
| 447 |
+
#### Planning & Reasoning
|
| 448 |
+
|
| 449 |
+
> **Key numbers:** SWE-agent ACI study shows interface design outweighs model capability as the primary performance determinant. LATS integrates MCTS with language model feedback for state-space search.
|
| 450 |
+
|
| 451 |
+
- <u>Tree of Thoughts</u>: **"Tree of Thoughts: Deliberate Problem Solving with Large Language Models"**. *Yao et al.* NeurIPS 2023. [[Paper](https://arxiv.org/abs/2305.10601)] [[Code](https://github.com/princeton-nlp/tree-of-thought-llm)]
|
| 452 |
+
- <u>LATS</u>: **"Language Agent Tree Search Unifies Reasoning, Acting, and Planning in Language Models"**. *Zhou et al.* arXiv 2023. [[Paper](https://arxiv.org/abs/2310.04406)] [[Code](https://github.com/lapisrocks/LanguageAgentTreeSearch)]
|
| 453 |
+
- <u>AFlow</u>†: **"AFlow: Automating Agentic Workflow Generation"**. *Zhang et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2410.10762)]
|
| 454 |
+
- <u>Agent Q</u>†: **"Agent Q: Advanced Reasoning and Learning for Autonomous AI Agents"**. *Putta et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2408.07199)]
|
| 455 |
+
- <u>OPENDEV</u>†: **"Building Effective AI Coding Agents for the Terminal: Scaffolding, Harness, Context Engineering, and Lessons Learned"**. *Bui.* arXiv 2026. [[Paper](https://arxiv.org/abs/2603.05344)]
|
| 456 |
+
- <u>AOrchestra</u>†: **"AOrchestra: Automating Sub-Agent Creation for Agentic Orchestration"**. *Ruan et al.* arXiv 2026. [[Paper](https://arxiv.org/abs/2602.03786)]
|
| 457 |
+
- <u>RAP</u>: **"Reasoning with Language Model is Planning with World Model"**. *Hao et al.* EMNLP 2023. [[Paper](https://arxiv.org/abs/2305.14992)]
|
| 458 |
+
- <u>Inner Monologue</u>: **"Inner Monologue: Embodied Reasoning Through Planning with Language Models"**. *Huang et al.* CoRL 2022. [[Paper](https://arxiv.org/abs/2207.05608)]
|
| 459 |
+
- <u>Agent-Oriented Planning</u>: **"Agent-Oriented Planning in Multi-Agent Systems"**. *Li et al.* ICLR 2025. [[Paper](https://arxiv.org/abs/2410.02189)]
|
| 460 |
+
- <u>ExACT</u>†: **"ExACT: Teaching AI Agents to Explore with Reflective-MCTS and Exploratory Learning"**. *Yu et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2410.02052)]
|
| 461 |
+
|
| 462 |
+
#### Multi-Agent Coordination
|
| 463 |
+
|
| 464 |
+
> **Key numbers:** AgencyBench — agents achieve **48.4% success on native SDK harness** vs substantially lower on independent harnesses, demonstrating tight harness-agent coupling. Byzantine fault tolerance remains an open problem for adversarial multi-agent settings.
|
| 465 |
+
|
| 466 |
+
<p align="center">
|
| 467 |
+
<img src="assets/multi_agent_topology.png" width="680" alt="Multi-Agent Coordination Topologies"/>
|
| 468 |
+
</p>
|
| 469 |
+
|
| 470 |
+
- <u>SAGA</u>†: **"SAGA: A Security Architecture for Governing AI Agentic Systems"**. *Syros et al.* NDSS 2026. [[Paper](https://arxiv.org/abs/2504.21034)]
|
| 471 |
+
- <u>MAS-FIRE</u>†: **"MAS-FIRE: Fault Injection and Reliability Evaluation for LLM-Based Multi-Agent Systems"**. *Jia et al.* arXiv 2026. [[Paper](https://arxiv.org/abs/2602.19843)]
|
| 472 |
+
- <u>Byzantine fault tolerance</u>†: **"Rethinking the Reliability of Multi-agent System: A Perspective from Byzantine Fault Tolerance"**. *Zheng et al.* arXiv 2025. [[Paper](https://arxiv.org/abs/2511.10400)]
|
| 473 |
+
- <u>Multi-agent baseline study</u>†: **"Rethinking the Value of Multi-Agent Workflow: A Strong Single Agent Baseline"**. *Xu et al.* arXiv 2026. [[Paper](https://arxiv.org/abs/2601.12307)]
|
| 474 |
+
- <u>AgentVerse</u>†: **"AgentVerse: Facilitating Multi-Agent Collaboration and Exploring Emergent Behaviors"**. *Chen et al.* arXiv 2023. [[Paper](https://arxiv.org/abs/2308.10848)]
|
| 475 |
+
- <u>Mixture-of-Agents</u>†: **"Mixture-of-Agents Enhances Large Language Model Capabilities"**. *Wang et al.* arXiv 2024. [[Paper](https://arxiv.org/abs/2406.04692)]
|
| 476 |
+
- <u>Multi-Agent Survey</u>: **"Large Language Model Based Multi-Agents: A Survey of Progress and Challenges"**. *Guo et al.* IJCAI 2024. [[Paper](https://arxiv.org/abs/2402.01680)]
|
| 477 |
+
- <u>Concordia</u>†: **"Generative Agent-Based Modeling with Actions Grounded in Physical, Social, or Digital Space Using Concordia"**. *Vezhnevets et al.* arXiv 2023. [[Paper](https://arxiv.org/abs/2312.03664)]
|
| 478 |
+
|
| 479 |
+
#### Compute Economics
|
| 480 |
+
|
| 481 |
+
> **Key numbers:** OpenRouter reports **13T tokens/week** (Feb 2026), doubling every 4 weeks; AgencyBench measures **1M tokens/task** average; 1000× agent compute growth projected by 2027; AIOS achieves **2.1× throughput speedup** via proper agent scheduling.
|
| 482 |
+
|
| 483 |
+
- <u>Repo2Run</u>†: **"Repo2Run: Automated Building Executable Environment for Code Repository at Scale"**. *Hu et al.* arXiv 2025. [[Paper](https://arxiv.org/abs/2502.13681)]
|
| 484 |
+
- <u>Policy-First</u>†: **"Guardrails as Infrastructure: Policy-First Control for Tool-Orchestrated Workflows"**. *Sigdel & Baral.* arXiv 2026. [[Paper](https://arxiv.org/abs/2603.18059)]
|
| 485 |
+
|
| 486 |
+
---
|
| 487 |
+
|
| 488 |
+
### Emerging Topics
|
| 489 |
+
|
| 490 |
+
- <u>Self-Evolving Agents Survey</u>†: **"A Survey of Self-Evolving Agents: What, When, How, and Where to Evolve on the Path to Artificial Super Intelligence"**. *Gao et al.* TMLR 2026. [[Paper](https://arxiv.org/abs/2507.21046)]
|
| 491 |
+
- <u>Self-RAG</u>: **"Self-RAG: Learning to Retrieve, Generate, and Critique Through Self-Reflection"**. *Asai et al.* ICLR 2024. [[Paper](https://arxiv.org/abs/2310.11511)]
|
| 492 |
+
- <u>Constitutional AI</u>: **"Constitutional AI: Harmlessness from AI Feedback"**. *Bai et al.* arXiv 2022. [[Paper](https://arxiv.org/abs/2212.08073)]
|
| 493 |
+
- <u>AppAgent</u>†: **"AppAgent: Multimodal Agents as Smartphone Users"**. *Zhang et al.* arXiv 2023. [[Paper](https://arxiv.org/abs/2312.13771)]
|
| 494 |
+
|
| 495 |
+
#### Related Surveys
|
| 496 |
+
|
| 497 |
+
- <u>LLM Agents Survey</u>: **"A Survey on Large Language Model Based Autonomous Agents"**. *Wang et al.* arXiv 2023. [[Paper](https://arxiv.org/abs/2308.11432)]
|
| 498 |
+
- <u>Rise of LLM Agents</u>: **"The Rise and Potential of Large Language Model Based Agents: A Survey"**. *Xi et al.* arXiv 2023. [[Paper](https://arxiv.org/abs/2309.07864)]
|
| 499 |
+
- <u>LLM Survey</u>: **"A Survey of Large Language Models"**. *Zhao et al.* arXiv 2023. [[Paper](https://arxiv.org/abs/2303.18223)]
|
| 500 |
+
- <u>AI Agent Systems</u>†: **"AI Agent Systems: Architectures, Applications, and Evaluation"**. *Xu.* arXiv 2025. [[Paper](https://arxiv.org/abs/2601.01743)]
|
| 501 |
+
|
| 502 |
+
#### Practitioner Reports & Industry Insights
|
| 503 |
+
|
| 504 |
+
> Production deployment experiences from Stripe, OpenAI, Cursor, METR, and other frontier practitioners.
|
| 505 |
+
|
| 506 |
+
- <u>Stripe Minions</u>: **"Minions: Stripe's one-shot, end-to-end coding agents"**. *Gray.* Stripe Dev Blog, Feb 2026. [[Blog](https://stripe.dev/blog/minions-stripes-one-shot-end-to-end-coding-agents)]
|
| 507 |
+
- <u>Harness Engineering (OpenAI)</u>: **"Harness engineering: leveraging Codex in an agent-first world"**. *Lopopolo.* OpenAI Blog, Feb 2026. [[Blog](https://openai.com/index/harness-engineering/)]
|
| 508 |
+
- <u>Self-Driving Codebases</u>: **"Towards self-driving codebases"**. *Lin.* Cursor Blog, Feb 2026. [[Blog](https://cursor.com/blog/self-driving-codebases)]
|
| 509 |
+
- <u>METR SWE-bench Analysis</u>: **"Many SWE-bench-Passing PRs Would Not Be Merged into Main"**. *Whitfill et al.* METR Notes, Mar 2026. [[Report](https://metr.org/notes/2026-03-10-many-swe-bench-passing-prs-would-not-be-merged-into-main/)]
|
| 510 |
+
|
| 511 |
+
---
|
| 512 |
+
|
| 513 |
+
### Future Directions
|
| 514 |
+
|
| 515 |
+
Eight open research directions identified in the survey (no curated paper list — these are forward-looking):
|
| 516 |
+
|
| 517 |
+
- **Formal Harness Specification Language** — DSL for specifying and verifying H=(E,T,C,S,L,V) components
|
| 518 |
+
- **Cross-Harness Benchmark Suite** — portability testing across incompatible harness ecosystems
|
| 519 |
+
- **Security Taxonomy & Threat Model** — extension of OWASP Top 10 to agent harness attack surfaces
|
| 520 |
+
- **Protocol Interoperability (MCP/A2A)** — bridging tool-level and agent-level protocols
|
| 521 |
+
- **Long-Horizon Evaluation Methodology** — metrics that don't degrade under multi-session, multi-day tasks
|
| 522 |
+
- **Harness-Aware Fine-Tuning** — training models that are aware of their execution environment
|
| 523 |
+
- **Memory Interface Standardization** — portable memory APIs across flat, episodic, and graph stores
|
| 524 |
+
- **Harness Transparency Specification** — auditability and explainability for runtime decisions
|
| 525 |
+
|
| 526 |
+
---
|
| 527 |
+
|
| 528 |
+
## Citation
|
| 529 |
+
|
| 530 |
+
See BibTeX at the top of this README.
|
| 531 |
+
|
| 532 |
+
---
|
| 533 |
+
|
| 534 |
+
## Update Log
|
| 535 |
+
|
| 536 |
+
| Version | Date | Changes |
|
| 537 |
+
|---------|------|---------|
|
| 538 |
+
| v1 | 2026-04-03 | Initial preprint |
|
| 539 |
+
| v2 | 2026-04-07 | Repo updated |
|
| 540 |
+
|
| 541 |
+
---
|
| 542 |
+
|
| 543 |
+
<p align="center">
|
| 544 |
+
<i>† denotes preprint, not yet peer-reviewed.</i><br>
|
| 545 |
+
<i>This survey is under active development; the full manuscript will be released soon.</i><br>
|
| 546 |
+
<i>Maintained by Qianyu Meng & Liyi Chen. PRs welcome for missing papers or updated links.</i>
|
| 547 |
+
</p>
|
README_zh.md
ADDED
|
@@ -0,0 +1,474 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: cc-by-4.0
|
| 3 |
+
language:
|
| 4 |
+
- en
|
| 5 |
+
- zh
|
| 6 |
+
tags:
|
| 7 |
+
- survey
|
| 8 |
+
- llm-agents
|
| 9 |
+
- agent-harness
|
| 10 |
+
- agent-frameworks
|
| 11 |
+
- harness-engineering
|
| 12 |
+
- evaluation
|
| 13 |
+
- agent-memory
|
| 14 |
+
- multi-agent-systems
|
| 15 |
+
pretty_name: "Agent Harness for Large Language Model Agents: A Survey"
|
| 16 |
+
size_categories:
|
| 17 |
+
- n<1K
|
| 18 |
+
---
|
| 19 |
+
|
| 20 |
+
[English](README.md) | [中文](README_zh.md)
|
| 21 |
+
|
| 22 |
+
# 大语言模型智能体约束工程框架综述
|
| 23 |
+
|
| 24 |
+
<p align="center">
|
| 25 |
+
<a href="https://github.com/Gloriaameng/LLM-Agent-Harness-Survey/stargazers"><img src="https://img.shields.io/github/stars/Gloriaameng/LLM-Agent-Harness-Survey?style=social" alt="GitHub Stars"></a>
|
| 26 |
+
<a href="LICENSE"><img src="https://img.shields.io/badge/License-CC--BY--4.0-blue.svg" alt="License"></a>
|
| 27 |
+
<img src="https://img.shields.io/badge/Papers-110%2B-green" alt="Papers">
|
| 28 |
+
<img src="https://img.shields.io/badge/Version-v2-orange" alt="Version">
|
| 29 |
+
</p>
|
| 30 |
+
|
| 31 |
+
<p align="center">
|
| 32 |
+
<img src="assets/architecture_diagram.png" width="720" alt="H=(E,T,C,S,L,V) 六组件架构"/>
|
| 33 |
+
</p>
|
| 34 |
+
|
| 35 |
+
> ⭐ **本 survey 持续更新中。如果对你有帮助,欢迎 Star 关注最新进展,也帮助更多人发现它。**
|
| 36 |
+
|
| 37 |
+
---
|
| 38 |
+
|
| 39 |
+
> **智能体约束工程框架——而非模型本身——是智能体大规模部署可靠性的首要决定因素。**
|
| 40 |
+
> 本综述将约束工程框架形式化为一级架构对象 **H = (E, T, C, S, L, V)**,系统调研了涵盖23个系统的110余篇论文、博客和报告,并总结了9项开放性技术挑战。
|
| 41 |
+
> 📄 **[阅读论文](#)** (即将发布)
|
| 42 |
+
> ✉️ 勘误与建议:gloriamenng@gmail.com; chenliyi@xiaohongshu.com
|
| 43 |
+
|
| 44 |
+
如果本综述对您有所帮助,请引用:
|
| 45 |
+
|
| 46 |
+
```bibtex
|
| 47 |
+
@misc{meng2026agentharness,
|
| 48 |
+
title = {Agent Harness for Large Language Model Agents: A Survey},
|
| 49 |
+
author = {Meng, Qianyu and Wang, Yanan and Chen, Liyi and Wang, Qimeng and
|
| 50 |
+
Lu, Chengqiang and Wu, Wei and Gao, Yan and Wu, Yi and Hu, Yao},
|
| 51 |
+
year = {2026},
|
| 52 |
+
url = {https://github.com/Gloriaameng/LLM-Agent-Harness-Survey},
|
| 53 |
+
note = {Work in progress}
|
| 54 |
+
}
|
| 55 |
+
```
|
| 56 |
+
|
| 57 |
+
---
|
| 58 |
+
|
| 59 |
+
## 🆕 新闻与更新
|
| 60 |
+
|
| 61 |
+
- **[2026-04-03]** 首次发布
|
| 62 |
+
- **[2026-04-07]** 仓库更新
|
| 63 |
+
|
| 64 |
+
---
|
| 65 |
+
|
| 66 |
+
## 目录
|
| 67 |
+
|
| 68 |
+
- [概述](#概述)
|
| 69 |
+
- [历史时间线](#历史时间线)
|
| 70 |
+
- [约束工程框架完备性矩阵](#执行器完备性矩阵)
|
| 71 |
+
- [论文列表](#论文列表)
|
| 72 |
+
- [历史渊源](#历史渊源)
|
| 73 |
+
- [约束工程框架分类](#执行器分类)
|
| 74 |
+
- [技术挑战](#技术挑战)
|
| 75 |
+
- [安全与沙箱](#安全与沙箱)
|
| 76 |
+
- [评估与基准测试](#评估与基准测试)
|
| 77 |
+
- [协议标准化](#协议标准化)
|
| 78 |
+
- [运行时上下文管理](#运行时上下文管理)
|
| 79 |
+
- [工具使用与注册](#工具使用与注册)
|
| 80 |
+
- [记忆架构](#记忆架构)
|
| 81 |
+
- [规划与推理](#规划与推理)
|
| 82 |
+
- [多智能体协同](#多智能体协同)
|
| 83 |
+
- [计算经济学](#计算经济学)
|
| 84 |
+
- [新兴主题](#新兴主题)
|
| 85 |
+
- [未来方向](#未来方向)
|
| 86 |
+
- [引用](#引用)
|
| 87 |
+
- [更新日志](#更新日志)
|
| 88 |
+
|
| 89 |
+
---
|
| 90 |
+
|
| 91 |
+
## 概述
|
| 92 |
+
|
| 93 |
+
大语言模型(LLM)智能体正日益部署于自主规划、工具使用和多步骤交互环境中。主流叙事将智能体性能归因于底层模型能力。**本综述挑战了这一假设。**
|
| 94 |
+
|
| 95 |
+
我们提出了**智能体约束工程框架**的形式化定义,将其定义为包含六个组件的元组:
|
| 96 |
+
|
| 97 |
+
| 组件 | 符号 | 作用 |
|
| 98 |
+
|------|------|------|
|
| 99 |
+
| 执行循环 | **E** | 观察-思考-行动循环,终止条件,错误恢复 |
|
| 100 |
+
| 工具注册表 | **T** | 类型化工具目录,路由,监控,模式校验 |
|
| 101 |
+
| 上下文管理器 | **C** | 上下文窗口内容选择,压缩,检索 |
|
| 102 |
+
| 状态存储 | **S** | 跨回合/会话持久化,崩溃恢复 |
|
| 103 |
+
| 生命周期钩子 | **L** | 认证,日志,策略执行,监测埋点 |
|
| 104 |
+
| 评估接口 | **V** | 行动轨迹,中间状态,成功信号 |
|
| 105 |
+
|
| 106 |
+
**约束工程重要性的关键实证证据:**
|
| 107 |
+
- 🔥 Pi Research:Grok Code Fast 1 模型在 SWE-bench 上从 **6.7% → 68.3%**,仅通过修改约束工程的编辑工具格式——模型不变
|
| 108 |
+
- 💀 OpenAI Codex:5个月内生成**100万行代码,0行手写**——失败归因于"环境规范不足"而非模型能力
|
| 109 |
+
- ⚡ Stripe Minions:**每周1300个PR,0行人工代码**——约束优先工程
|
| 110 |
+
- 📉 METR:通过基准测试的PR人工合并率**低24.2个百分点**,差距以9.6pp/年速度扩大——评估约束工程框架有效性危机
|
| 111 |
+
- 💬 *"约束工程是底盘;模型是引擎。"* ——2026年业界共识
|
| 112 |
+
|
| 113 |
+
<p align="center">
|
| 114 |
+
<img src="assets/root_cause_diagram.png" width="640" alt="根因分析"/>
|
| 115 |
+
</p>
|
| 116 |
+
|
| 117 |
+
### 本综述的学术贡献
|
| 118 |
+
|
| 119 |
+
**概念贡献:**我们将智能体约束工程框架形式化为具有六个可治理组件(E, T, C, S, L, V)的架构对象,将其从隐式基础设施提升为显式研究目标。
|
| 120 |
+
|
| 121 |
+
**实证范围:**我们系统性地综述了110余篇论文,涵盖学术研究(评估基准、安全框架、记忆架构)和生产部署(Stripe、OpenAI、Cursor、METR)��确立了约束工程框架设计是已部署智能体可靠性的约束瓶颈这一观点。
|
| 122 |
+
|
| 123 |
+
**方法论进展:**我们引入了**约束工程框架完备性矩阵**——一个结构化评估框架,映射每个系统实现了六个组件中的哪些——使得先前综述无法实现的异构智能体系统直接对比成为可能。
|
| 124 |
+
|
| 125 |
+
**已识别的开放挑战:**我们记录了九项技术挑战,这些挑战当前研究仅提供了部分解决方案而无生产级基础设施:形式化安全模型、跨工程框架可移植性、协议互操作性(MCP/A2A)、百万级token/任务的上下文经济性、多智能体系统中的拜占庭容错、组合式验证。
|
| 126 |
+
|
| 127 |
+
**学术界与业界的桥梁:**与先前仅关注模型能力或孤立组件(记忆、规划、工具使用)的综述不同,我们综合了同行评审研究与生产部署报告,展示了理论与实践的交汇点——以及仍存在的关键差距。
|
| 128 |
+
|
| 129 |
+
**目标读者:**设计智能体基础设施的研究者、构建生产系统的实践者、以及试图理解为何基准测试性能常无法预测部署结果的评估者。
|
| 130 |
+
|
| 131 |
+
---
|
| 132 |
+
|
| 133 |
+
## 历史时间线
|
| 134 |
+
|
| 135 |
+
<p align="center">
|
| 136 |
+
<img src="assets/timeline.png" width="720" alt="智能体约束工程的历史演进"/>
|
| 137 |
+
</p>
|
| 138 |
+
|
| 139 |
+
| 年份 | 里程碑 | 意义 |
|
| 140 |
+
|------|--------|------|
|
| 141 |
+
| 1997–2005 | JUnit, TestNG, xUnit 家族 | 软件测试约束工程范式;标准化观察-断言生命周期 |
|
| 142 |
+
| 2016 | OpenAI Gym (Brockman et al.) | 强化学习环境约束工程框架;step/reset API 成为规范接口 |
|
| 143 |
+
| 2022年11月 | ChatGPT 公开发布;LangChain 出现 | 面向LLM的智能体框架萌芽;工具使用成为一级公民 |
|
| 144 |
+
| 2023 | ReAct, Toolformer, MemGPT, Reflexion, Voyager, AutoGPT | 核心智能体模式:推理-行动、记忆、反思、技能积累 |
|
| 145 |
+
| 2023 | CAMEL, ChatDev, Generative Agents | 多智能体协同;社会仿真约束工程 |
|
| 146 |
+
| 2023 | AgentBench, SWE-bench | 智能体评估基础设施涌现 |
|
| 147 |
+
| 2024 | MetaGPT, WebArena, ToolLLM, SWE-agent, OSWorld | 全栈执行器;真实世界环境基准测试 |
|
| 148 |
+
| 2024 | CodeAct, LATS, Tree of Thoughts | 结构化动作空间;搜索增强规划 |
|
| 149 |
+
| 2024年11月 | Anthropic 发布 MCP 协议 | 首个主要工具↔约束工程标准化(2–15ms延迟) |
|
| 150 |
+
| 2025 | HAL, AIOS, LangGraph | 基准测试统一(21,730次评估);操作系统级调度(2.1×加速) |
|
| 151 |
+
| 2025 | Google 发布 A2A 协议 | 智能体↔智能体标准化(50–200ms) |
|
| 152 |
+
| 2025 | MemoryOS, SkillsBench†, AgentBound† | 记忆操作系统抽象;技能即上下文(+16.2pp);安全认证 |
|
| 153 |
+
| 2026年1–3月 | AgencyBench†, SandboxEscapeBench†, PRISM†, AEGIS†, SkillFortify†, Schema First† | 计算经济学;15–35%逃逸率;运行时安全;模式规范 |
|
| 154 |
+
|
| 155 |
+
*† 表示预印本,尚未经同行评审*
|
| 156 |
+
|
| 157 |
+
---
|
| 158 |
+
|
| 159 |
+
## 约束工程框架完备性矩阵
|
| 160 |
+
|
| 161 |
+
**图例:** ✓ 完全支持 · ≈ 部分支持 · ✗ 缺失
|
| 162 |
+
|
| 163 |
+
<table align="center">
|
| 164 |
+
<thead>
|
| 165 |
+
<tr>
|
| 166 |
+
<th>类别</th>
|
| 167 |
+
<th>系统</th>
|
| 168 |
+
<th title="执行循环">E</th>
|
| 169 |
+
<th title="工具注册表">T</th>
|
| 170 |
+
<th title="上下文管理器">C</th>
|
| 171 |
+
<th title="状态存储">S</th>
|
| 172 |
+
<th title="生命周期钩子">L</th>
|
| 173 |
+
<th title="评估接口">V</th>
|
| 174 |
+
</tr>
|
| 175 |
+
</thead>
|
| 176 |
+
<tbody>
|
| 177 |
+
<tr>
|
| 178 |
+
<td rowspan="4"><strong>全栈式<br>约束工程</strong></td>
|
| 179 |
+
<td>Claude Code</td>
|
| 180 |
+
<td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>≈</td>
|
| 181 |
+
</tr>
|
| 182 |
+
<tr>
|
| 183 |
+
<td>OpenClaw / PRISM</td>
|
| 184 |
+
<td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td>
|
| 185 |
+
</tr>
|
| 186 |
+
<tr>
|
| 187 |
+
<td>AIOS</td>
|
| 188 |
+
<td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>≈</td>
|
| 189 |
+
</tr>
|
| 190 |
+
<tr>
|
| 191 |
+
<td>OpenHands</td>
|
| 192 |
+
<td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>✓</td><td>≈</td>
|
| 193 |
+
</tr>
|
| 194 |
+
<tr>
|
| 195 |
+
<td rowspan="6"><strong>多智能体<br>执行器</strong></td>
|
| 196 |
+
<td>MetaGPT</td>
|
| 197 |
+
<td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>≈</td>
|
| 198 |
+
</tr>
|
| 199 |
+
<tr>
|
| 200 |
+
<td>AutoGen</td>
|
| 201 |
+
<td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>≈</td>
|
| 202 |
+
</tr>
|
| 203 |
+
<tr>
|
| 204 |
+
<td>ChatDev</td>
|
| 205 |
+
<td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>≈</td><td>≈</td>
|
| 206 |
+
</tr>
|
| 207 |
+
<tr>
|
| 208 |
+
<td>CAMEL</td>
|
| 209 |
+
<td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>✗</td><td>≈</td>
|
| 210 |
+
</tr>
|
| 211 |
+
<tr>
|
| 212 |
+
<td>DeerFlow</td>
|
| 213 |
+
<td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>≈</td>
|
| 214 |
+
</tr>
|
| 215 |
+
<tr>
|
| 216 |
+
<td>DeepAgents</td>
|
| 217 |
+
<td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>≈</td>
|
| 218 |
+
</tr>
|
| 219 |
+
<tr>
|
| 220 |
+
<td rowspan="3"><strong>通用<br>框架</strong></td>
|
| 221 |
+
<td>LangChain</td>
|
| 222 |
+
<td>✓</td><td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>✗</td>
|
| 223 |
+
</tr>
|
| 224 |
+
<tr>
|
| 225 |
+
<td>LangGraph</td>
|
| 226 |
+
<td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>✗</td><td>✗</td>
|
| 227 |
+
</tr>
|
| 228 |
+
<tr>
|
| 229 |
+
<td>LlamaIndex</td>
|
| 230 |
+
<td>≈</td><td>✓</td><td>✓</td><td>≈</td><td>✗</td><td>✗</td>
|
| 231 |
+
</tr>
|
| 232 |
+
<tr>
|
| 233 |
+
<td rowspan="1"><strong>专用<br>约束工程</strong></td>
|
| 234 |
+
<td>SWE-agent</td>
|
| 235 |
+
<td>✓</td><td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>✓</td>
|
| 236 |
+
</tr>
|
| 237 |
+
<tr>
|
| 238 |
+
<td rowspan="5"><strong>能力<br>模块</strong></td>
|
| 239 |
+
<td>MemGPT</td>
|
| 240 |
+
<td>✗</td><td>✗</td><td>✓</td><td>✓</td><td>✗</td><td>✗</td>
|
| 241 |
+
</tr>
|
| 242 |
+
<tr>
|
| 243 |
+
<td>Voyager</td>
|
| 244 |
+
<td>✓</td><td>✓</td><td>≈</td><td>✓</td><td>✗</td><td>≈</td>
|
| 245 |
+
</tr>
|
| 246 |
+
<tr>
|
| 247 |
+
<td>Reflexion</td>
|
| 248 |
+
<td>≈</td><td>✗</td><td>≈</td><td>✓</td><td>✗</td><td>≈</td>
|
| 249 |
+
</tr>
|
| 250 |
+
<tr>
|
| 251 |
+
<td>Generative Agents</td>
|
| 252 |
+
<td>✓</td><td>✗</td><td>≈</td><td>✓</td><td>✗</td><td>≈</td>
|
| 253 |
+
</tr>
|
| 254 |
+
<tr>
|
| 255 |
+
<td>Concordia</td>
|
| 256 |
+
<td>✓</td><td>✗</td><td>≈</td><td>✓</td><td>✗</td><td>≈</td>
|
| 257 |
+
</tr>
|
| 258 |
+
<tr>
|
| 259 |
+
<td rowspan="4"><strong>评估<br>基础设施</strong></td>
|
| 260 |
+
<td>HAL</td>
|
| 261 |
+
<td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>✓</td>
|
| 262 |
+
</tr>
|
| 263 |
+
<tr>
|
| 264 |
+
<td>AgentBench</td>
|
| 265 |
+
<td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>✗</td><td>✓</td>
|
| 266 |
+
</tr>
|
| 267 |
+
<tr>
|
| 268 |
+
<td>OSWorld</td>
|
| 269 |
+
<td>✓</td><td>≈</td><td>≈</td><td>≈</td><td>✗</td><td>✓</td>
|
| 270 |
+
</tr>
|
| 271 |
+
<tr>
|
| 272 |
+
<td>BrowserGym</td>
|
| 273 |
+
<td>✓</td><td>✓</td><td>≈</td><td>≈</td><td>✗</td><td>✓</td>
|
| 274 |
+
</tr>
|
| 275 |
+
</tbody>
|
| 276 |
+
</table>
|
| 277 |
+
|
| 278 |
+
---
|
| 279 |
+
|
| 280 |
+
## 论文列表
|
| 281 |
+
|
| 282 |
+
### 历史渊源
|
| 283 |
+
|
| 284 |
+
#### 软件测试约束工程 (1990s–2000s)
|
| 285 |
+
|
| 286 |
+
- <u>JUnit</u>: **"JUnit: A Cook's Tour"**. *Beck & Gamma.* Java Report, 4(5), May 1999. [[文章](http://junit.sourceforge.net/doc/cookstour/cookstour.htm)]
|
| 287 |
+
|
| 288 |
+
#### 强化学习环境约束工程框架 (2016–2022)
|
| 289 |
+
|
| 290 |
+
- <u>OpenAI Gym</u>: **"OpenAI Gym"**. *Brockman et al.* arXiv 2016. [[论文](https://arxiv.org/abs/1606.01540)] [[代码](https://github.com/openai/gym)]
|
| 291 |
+
- <u>Gymnasium</u>: **"Gymnasium: A Standard Interface for Reinforcement Learning Environments"**. *Towers et al.* NeurIPS 2025. [[论文](https://arxiv.org/abs/2407.17032)] [[代码](https://github.com/Farama-Foundation/Gymnasium)]
|
| 292 |
+
|
| 293 |
+
#### 早期LLM智能体框架 (2023–2024)
|
| 294 |
+
|
| 295 |
+
- <u>ReAct</u>: **"ReAct: Synergizing Reasoning and Acting in Language Models"**. *Yao et al.* ICLR 2023. [[论文](https://arxiv.org/abs/2210.03629)] [[代码](https://github.com/ysymyth/ReAct)]
|
| 296 |
+
- <u>Toolformer</u>: **"Toolformer: Language Models Can Teach Themselves to Use Tools"**. *Schick et al.* NeurIPS 2023. [[论文](https://arxiv.org/abs/2302.04761)]
|
| 297 |
+
- <u>AutoGPT</u>: **"Auto-GPT: An Autonomous GPT-4 Experiment"**. *Gravitas et al.* GitHub 2023. [[代码](https://github.com/Significant-Gravitas/AutoGPT)]
|
| 298 |
+
- <u>LangChain</u>: **"LangChain: Building Applications with LLMs through Composability"**. *Chase et al.* GitHub 2022. [[代码](https://github.com/langchain-ai/langchain)]
|
| 299 |
+
|
| 300 |
+
---
|
| 301 |
+
|
| 302 |
+
### 约束工程框架分类
|
| 303 |
+
|
| 304 |
+
**分类依据:**我们根据**约束工程完备性**对智能体系统进行分类——即每个系统实现了六个组件(E, T, C, S, L, V)中的哪些——从而区分全栈约束工程(全部六个组件)与专用框架(部分实现)。
|
| 305 |
+
|
| 306 |
+
**重要性:**先前的分类法按应用领域(编程、网页导航、具身AI)或模型架构(单智能体、多智能体)对智能体进行分类。这些分类无法解释为何使用相似模型的系统会产生不同的可靠性结果。我们以约束工程框架为中心的分类法揭示,生产级系统收敛于完整的ETCSLV实现,而研究原型往往仅实现2-3个组件。
|
| 307 |
+
|
| 308 |
+
**核心发现:**没有任何智能体框架能够在不实现**全部六个治理组件**的情况下达到生产可靠性。缺少L组件(生命周期钩子)的系统无法执行安全策略。缺少V组件(评估接口)的系统无法调试故障。缺少S组件(状态持久化)的系统无法从崩溃中恢复。
|
| 309 |
+
|
| 310 |
+
#### 全栈式约束工程
|
| 311 |
+
|
| 312 |
+
- <u>PRISM/OpenClaw</u>: **"OpenClaw PRISM: A Zero-Fork, Defense-in-Depth Runtime Security Layer for Tool-Augmented LLM Agents"**. *Li.* arXiv 2026. [[论文](https://arxiv.org/abs/2603.11853)]
|
| 313 |
+
- <u>AIOS</u>: **"AIOS: LLM Agent Operating System"**. *Mei et al.* COLM 2025. [[论文](https://arxiv.org/abs/2403.16971)] [[代码](https://github.com/agiresearch/AIOS)]
|
| 314 |
+
- <u>OpenHands</u>: **"OpenHands: An Open Platform for AI Software Developers as Generalist Agents"**. *Wang et al.* ICLR 2025. [[论文](https://arxiv.org/abs/2407.16741)] [[代码](https://github.com/All-Hands-AI/OpenHands)]
|
| 315 |
+
- <u>SWE-agent</u>: **"SWE-agent: Agent-Computer Interfaces Enable Automated Software Engineering"**. *Yang et al.* NeurIPS 2024. [[论文](https://arxiv.org/abs/2405.15793)] [[代码](https://github.com/SWE-agent/SWE-agent)]
|
| 316 |
+
- <u>HAL</u>: **"Holistic Agent Leaderboard: The Missing Infrastructure for AI Agent Evaluation"**. *Kapoor et al.* ICLR 2026. [[论文](https://arxiv.org/abs/2510.11977)]
|
| 317 |
+
|
| 318 |
+
#### 多智能体约束工程框架
|
| 319 |
+
|
| 320 |
+
- <u>MetaGPT</u>: **"MetaGPT: Meta Programming for a Multi-Agent Collaborative Framework"**. *Hong et al.* ICLR 2024. [[论文](https://arxiv.org/abs/2308.00352)] [[代码](https://github.com/geekan/MetaGPT)]
|
| 321 |
+
- <u>AutoGen</u>: **"AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversation"**. *Wu et al.* arXiv 2023. [[论文](https://arxiv.org/abs/2308.08155)] [[代码](https://github.com/microsoft/autogen)]
|
| 322 |
+
- <u>ChatDev</u>: **"ChatDev: Communicative Agents for Software Development"**. *Qian et al.* ACL 2024. [[论文](https://arxiv.org/abs/2307.07924)] [[代码](https://github.com/OpenBMB/ChatDev)]
|
| 323 |
+
- <u>CAMEL</u>: **"CAMEL: Communicative Agents for 'Mind' Exploration of Large Language Model Society"**. *Li et al.* NeurIPS 2023. [[论文](https://arxiv.org/abs/2303.17760)] [[代码](https://github.com/camel-ai/camel)]
|
| 324 |
+
|
| 325 |
+
#### 框架与模块
|
| 326 |
+
|
| 327 |
+
- <u>LangGraph</u>: **"LangGraph: Build Resilient Language Agents as Graphs"**. *LangChain team.* GitHub 2024. [[代码](https://github.com/langchain-ai/langgraph)]
|
| 328 |
+
- <u>MemGPT</u>: **"MemGPT: Towards LLMs as Operating Systems"**. *Packer et al.* NeurIPS 2023. [[论文](https://arxiv.org/abs/2310.08560)] [[代码](https://github.com/cpacker/MemGPT)]
|
| 329 |
+
- <u>Voyager</u>: **"Voyager: An Open-Ended Embodied Agent with Large Language Models"**. *Wang et al.* arXiv 2023. [[论文](https://arxiv.org/abs/2305.16291)] [[代码](https://github.com/MineDojo/Voyager)]
|
| 330 |
+
- <u>Reflexion</u>: **"Reflexion: Language Agents with Verbal Reinforcement Learning"**. *Shinn et al.* NeurIPS 2023. [[论文](https://arxiv.org/abs/2303.11366)] [[代码](https://github.com/noahshinn/reflexion)]
|
| 331 |
+
- <u>Generative Agents</u>: **"Generative Agents: Interactive Simulacra of Human Behavior"**. *Park et al.* UIST 2023. [[论文](https://arxiv.org/abs/2304.03442)] [[代码](https://github.com/joonspk-research/generative_agents)]
|
| 332 |
+
- <u>LangChain</u>: **"LangChain: Building Applications with LLMs through Composability"**. *Chase et al.* GitHub 2022. [[代码](https://github.com/langchain-ai/langchain)]
|
| 333 |
+
- <u>LlamaIndex</u>: **"LlamaIndex: A Data Framework for LLM Applications"**. *Liu et al.* GitHub 2022. [[代码](https://github.com/run-llama/llama_index)]
|
| 334 |
+
- <u>DeerFlow</u>: **"DeerFlow: Distributed Workflow Engine for LLM Agents"**. *GitHub 2024.* [[代码](https://github.com/modelscope/DeerFlow)]
|
| 335 |
+
- <u>DeepAgents</u>: **"DeepAgents: Multi-Agent Framework for Deep Learning"**. *GitHub 2024.* [[代码](https://github.com/deepagents/deepagents)]
|
| 336 |
+
|
| 337 |
+
#### 评估基础设施
|
| 338 |
+
|
| 339 |
+
- <u>AgentBench</u>: **"AgentBench: Evaluating LLMs as Agents"**. *Liu et al.* ICLR 2024. [[论文](https://arxiv.org/abs/2308.03688)] [[代码](https://github.com/THUDM/AgentBench)]
|
| 340 |
+
- <u>SWE-bench</u>: **"SWE-bench: Can Language Models Resolve Real-World GitHub Issues?"**. *Jimenez et al.* ICLR 2024. [[论文](https://arxiv.org/abs/2310.06770)] [[代码](https://github.com/swebench/SWE-bench)]
|
| 341 |
+
- <u>OSWorld</u>: **"OSWorld: Benchmarking Multimodal Agents for Open-Ended Tasks in Real Computer Environments"**. *Xie et al.* NeurIPS 2024. [[论文](https://arxiv.org/abs/2404.07972)] [[代码](https://github.com/xlang-ai/OSWorld)]
|
| 342 |
+
- <u>WebArena</u>: **"WebArena: A Realistic Web Environment for Building Autonomous Agents"**. *Zhou et al.* ICLR 2024. [[论文](https://arxiv.org/abs/2307.13854)] [[代码](https://github.com/web-arena-x/webarena)]
|
| 343 |
+
- <u>GAIA</u>: **"GAIA: A Benchmark for General AI Assistants"**. *Mialon et al.* ICLR 2024. [[论文](https://arxiv.org/abs/2311.12983)]
|
| 344 |
+
- <u>Mind2Web</u>: **"Mind2Web: Towards a Generalist Agent for the Web"**. *Deng et al.* NeurIPS 2023. [[论文](https://arxiv.org/abs/2306.06070)]
|
| 345 |
+
- <u>AgentBoard</u>: **"AgentBoard: An Analytical Evaluation Board of Multi-Turn LLM Agents"**. *Ma et al.* NeurIPS 2024. [[论文](https://arxiv.org/abs/2401.13178)]
|
| 346 |
+
- <u>InterCode</u>: **"InterCode: Standardizing and Benchmarking Interactive Coding with Execution Feedback"**. *Yang et al.* NeurIPS 2023. [[论文](https://arxiv.org/abs/2306.14898)]
|
| 347 |
+
|
| 348 |
+
---
|
| 349 |
+
|
| 350 |
+
### 技术挑战
|
| 351 |
+
|
| 352 |
+
**范围界定:**我们识别了九项开放研究问题,当前约束工程基础设施针对这些问题仅提供了部分解决方案,而缺乏生产级、可推广的框架。每项挑战都代表了学术原型所展示的成果与已部署系统所需条件之间的差距。
|
| 353 |
+
|
| 354 |
+
**评估标准:**对于每项挑战,我们评估:(1) **学术覆盖度**——同行评审解决方案(如有);(2) **生产成熟度**——是否有任何已部署系统在规模上解决了该问题;(3) **阻塞严重性**——未解决的问题是阻止部署还是仅限制性能。
|
| 355 |
+
|
| 356 |
+
**横切主题:**大多数挑战源于**组合问题**——单个组件(安全沙箱、记忆存储、评估指标)可以独立工作,但将它们组合成连贯的执行器会浮现涌现性故障。形式化验证、可移植性测试和协议互操作性都需要当前研究尚未解决的组合式推理。
|
| 357 |
+
|
| 358 |
+
#### 安全与沙箱
|
| 359 |
+
|
| 360 |
+
**挑战:**智能体沙箱必须防止恶意工具使用,同时允许合法的系统访问——这比传统应用沙箱更困难,因为智能体**有意地**与敏感资源(文件系统、网络API、shell命令)交互。
|
| 361 |
+
|
| 362 |
+
**技术现状:**SandboxEscapeBench 显示前沿模型能够逃逸容器;PRISM 展示了零分叉纵深防御是可能的,但需要操作系统级监测。尚不存在适用于所有智能体用例且无需人工逐任务配置的通用沙箱。
|
| 363 |
+
|
| 364 |
+
**开放问题:**组合式安全属性(证明智能体+约束工程框架+环境满足安全规范)仍未解决。当前防御是反应式的(检测逃逸)而非预防式的(证明逃逸不可能)。
|
| 365 |
+
|
| 366 |
+
> **关键数据:**SandboxEscapeBench——前沿LLM达到**15–35%容器逃逸率**;PRISM——10个钩子的零分叉运行时将逃逸降至接近零,开销<5ms。
|
| 367 |
+
|
| 368 |
+
*(安全与沙箱相关论文列表与英文版相同,此处省略重复)*
|
| 369 |
+
|
| 370 |
+
#### 评估与基准测试
|
| 371 |
+
|
| 372 |
+
> **关键数据:**HAL 统一了**20,000+次评估**,将数周的评估压缩至数小时;OSWorld 报告了**28%假阴性率**的自动化评估;METR 发现通过基准测试的PR人工合并率**低24.2个百分点**,差距以9.6pp/年速度扩大。
|
| 373 |
+
|
| 374 |
+
*(评估与基准测试相关论文列表与英文版相同,此处省略重复)*
|
| 375 |
+
|
| 376 |
+
#### 协议标准化
|
| 377 |
+
|
| 378 |
+
> **关键数据:**MCP(工具↔约束工程):2–15ms延迟;A2A(智能体↔智能体):50–200ms;ACP(意图级,IBM)——三种协议服务于互补角色。
|
| 379 |
+
|
| 380 |
+
*(协议标准化相关论文列表与英文版相同,此处省略重复)*
|
| 381 |
+
|
| 382 |
+
#### 运行时上下文管理
|
| 383 |
+
|
| 384 |
+
> **关键数据:**SkillsBench——精选技能注入产生**+16.2pp**改进;"迷失在中间"效应已被记录;长上下文模型将问题从*保留*转移至*显著性*。
|
| 385 |
+
|
| 386 |
+
*(运行时上下文管理相关论文列表与英文版相同,此处省略重复)*
|
| 387 |
+
|
| 388 |
+
#### 工具使用与注册
|
| 389 |
+
|
| 390 |
+
> **关键数据:**Vercel 发现移除**80%工具**比任何模型升级都更有帮助;Schema First (Sigdel & Baral, 2026) —— 一项受控的初步研究表明,基于 schema 的工具契约可以减少**接口层面**的误用(如格式校验失败),但无法减少**语义层面**的误用(即格式正确但任务不当的调用),且各实验条件下端到端任务成功率均为零,表明仅靠接口设计不足以保证工具调用的可靠性;CodeAct 在**17/17项Mint基准**上表现优异,**回合数减少20%**。
|
| 391 |
+
|
| 392 |
+
*(工具使用与注册相关论文列表与英文版相同,此处省略重复)*
|
| 393 |
+
|
| 394 |
+
#### 记忆架构
|
| 395 |
+
|
| 396 |
+
> **关键数据:**Mem0 实现了相比完整上下文**90% token减少**;Zep 时序知识:**+18.5% QA准确率**;Agent Workflow Memory:在Mind2Web上**+14.9%**。六种架构模式:平面缓冲区→层次化→情节式→语义式→过程式→图式。
|
| 397 |
+
|
| 398 |
+
*(记忆架构相关论文列表与英文版相同,此处省略重复)*
|
| 399 |
+
|
| 400 |
+
#### 规划与推理
|
| 401 |
+
|
| 402 |
+
> **关键数据:**SWE-agent ACI 研究表明,接口设计超越模型能力成为性能的首要决定因素。LATS 将MCTS与语言模型反馈集成用于状态空间搜索。
|
| 403 |
+
|
| 404 |
+
*(规划与推理相关论文列表与英文版相同,此处省略重复)*
|
| 405 |
+
|
| 406 |
+
#### 多智能体协同
|
| 407 |
+
|
| 408 |
+
> **关键数据:**AgencyBench——智能体在原生SDK约束工程上达到**48.4%成功率**,而在独立约束工程框架上显著更低,展示了约束工程-智能体的紧密耦合。对抗性多智能体设置中的拜占庭容错仍是开放问题。
|
| 409 |
+
|
| 410 |
+
<p align="center">
|
| 411 |
+
<img src="assets/multi_agent_topology.png" width="680" alt="多智能体协同拓扑"/>
|
| 412 |
+
</p>
|
| 413 |
+
|
| 414 |
+
*(多智能体协同相关论文列表与英文版相同,此处省略重复)*
|
| 415 |
+
|
| 416 |
+
#### 计算经济学
|
| 417 |
+
|
| 418 |
+
> **关键数据:**OpenRouter 报告**每周13T tokens**(2026年2月),每4周翻倍;AgencyBench 测量平均**1M tokens/任务**;预计2027年智能体计算量增长1000倍;AIOS 通过恰当的智能体调度实现**2.1×吞吐加速**。
|
| 419 |
+
|
| 420 |
+
*(计算经济学相关论文列表与英文版相同,此处省略重复)*
|
| 421 |
+
|
| 422 |
+
---
|
| 423 |
+
|
| 424 |
+
### 新兴主题
|
| 425 |
+
|
| 426 |
+
*(新兴主题论文列表与英文版相同,此处省略重复)*
|
| 427 |
+
|
| 428 |
+
#### 相关综述
|
| 429 |
+
|
| 430 |
+
*(相关综述论文列表与英文版相同,此处省略重复)*
|
| 431 |
+
|
| 432 |
+
#### 业界实践报告与洞察
|
| 433 |
+
|
| 434 |
+
> 来自 Stripe、OpenAI、Cursor、METR 及其他前沿实践者的生产部署经验。
|
| 435 |
+
|
| 436 |
+
*(业界实践报告列表与英文版相同,此处省略重复)*
|
| 437 |
+
|
| 438 |
+
---
|
| 439 |
+
|
| 440 |
+
### 未来方向
|
| 441 |
+
|
| 442 |
+
综述中识别的八个开放研究方向(无精选论文列表——这些是前瞻性方向):
|
| 443 |
+
|
| 444 |
+
- **形式化约束工程规范语言** — 用于指定和验证 H=(E,T,C,S,L,V) 组件的领域特定语言(DSL)
|
| 445 |
+
- **跨约束工程框架基准测试套件** — 跨不兼容执行器生态系统的可移植性测试
|
| 446 |
+
- **安全分类与威胁模型** — 将OWASP Top 10扩展至智能体执行器攻击面
|
| 447 |
+
- **协议互操作性(MCP/A2A)** — 桥接工具级和智能体级协议
|
| 448 |
+
- **长时域评估方法论** — 在多会话、多天任务下��会退化的指标
|
| 449 |
+
- **约束工程感知微调** — 训练模型使其感知执行环境
|
| 450 |
+
- **记忆接口标准化** — 跨平面式、情节式和图式存储的可移植记忆API
|
| 451 |
+
- **约束工程透明性规范** — 运行时决策的可审计性和可解释性
|
| 452 |
+
|
| 453 |
+
---
|
| 454 |
+
|
| 455 |
+
## 引用
|
| 456 |
+
|
| 457 |
+
参见本 README 顶部的 BibTeX 引用格式。
|
| 458 |
+
|
| 459 |
+
---
|
| 460 |
+
|
| 461 |
+
## 更新日志
|
| 462 |
+
|
| 463 |
+
| 版本 | 日期 | 变更 |
|
| 464 |
+
|------|------|------|
|
| 465 |
+
| v1 | 2026-04-03 | 首次预印本 |
|
| 466 |
+
| v2 | 2026-04-07 | 仓库更新 |
|
| 467 |
+
|
| 468 |
+
---
|
| 469 |
+
|
| 470 |
+
<p align="center">
|
| 471 |
+
<i>† 表示预印本,尚未经同行评审。</i><br>
|
| 472 |
+
<i>本综述正在积极开发中;完整手稿将于近期发布。</i><br>
|
| 473 |
+
<i>由 Qianyu Meng 与 Liyi Chen 维护。欢迎提交缺失论文或更新链接的 PR。</i>
|
| 474 |
+
</p>
|
license
ADDED
|
@@ -0,0 +1,395 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Attribution 4.0 International
|
| 2 |
+
|
| 3 |
+
=======================================================================
|
| 4 |
+
|
| 5 |
+
Creative Commons Corporation ("Creative Commons") is not a law firm and
|
| 6 |
+
does not provide legal services or legal advice. Distribution of
|
| 7 |
+
Creative Commons public licenses does not create a lawyer-client or
|
| 8 |
+
other relationship. Creative Commons makes its licenses and related
|
| 9 |
+
information available on an "as-is" basis. Creative Commons gives no
|
| 10 |
+
warranties regarding its licenses, any material licensed under their
|
| 11 |
+
terms and conditions, or any related information. Creative Commons
|
| 12 |
+
disclaims all liability for damages resulting from their use to the
|
| 13 |
+
fullest extent possible.
|
| 14 |
+
|
| 15 |
+
Using Creative Commons Public Licenses
|
| 16 |
+
|
| 17 |
+
Creative Commons public licenses provide a standard set of terms and
|
| 18 |
+
conditions that creators and other rights holders may use to share
|
| 19 |
+
original works of authorship and other material subject to copyright
|
| 20 |
+
and certain other rights specified in the public license below. The
|
| 21 |
+
following considerations are for informational purposes only, are not
|
| 22 |
+
exhaustive, and do not form part of our licenses.
|
| 23 |
+
|
| 24 |
+
Considerations for licensors: Our public licenses are
|
| 25 |
+
intended for use by those authorized to give the public
|
| 26 |
+
permission to use material in ways otherwise restricted by
|
| 27 |
+
copyright and certain other rights. Our licenses are
|
| 28 |
+
irrevocable. Licensors should read and understand the terms
|
| 29 |
+
and conditions of the license they choose before applying it.
|
| 30 |
+
Licensors should also secure all rights necessary before
|
| 31 |
+
applying our licenses so that the public can reuse the
|
| 32 |
+
material as expected. Licensors should clearly mark any
|
| 33 |
+
material not subject to the license. This includes other CC-
|
| 34 |
+
licensed material, or material used under an exception or
|
| 35 |
+
limitation to copyright. More considerations for licensors:
|
| 36 |
+
wiki.creativecommons.org/Considerations_for_licensors
|
| 37 |
+
|
| 38 |
+
Considerations for the public: By using one of our public
|
| 39 |
+
licenses, a licensor grants the public permission to use the
|
| 40 |
+
licensed material under specified terms and conditions. If
|
| 41 |
+
the licensor's permission is not necessary for any reason--for
|
| 42 |
+
example, because of any applicable exception or limitation to
|
| 43 |
+
copyright--then that use is not regulated by the license. Our
|
| 44 |
+
licenses grant only permissions under copyright and certain
|
| 45 |
+
other rights that a licensor has authority to grant. Use of
|
| 46 |
+
the licensed material may still be restricted for other
|
| 47 |
+
reasons, including because others have copyright or other
|
| 48 |
+
rights in the material. A licensor may make special requests,
|
| 49 |
+
such as asking that all changes be marked or described.
|
| 50 |
+
Although not required by our licenses, you are encouraged to
|
| 51 |
+
respect those requests where reasonable. More considerations
|
| 52 |
+
for the public:
|
| 53 |
+
wiki.creativecommons.org/Considerations_for_licensees
|
| 54 |
+
|
| 55 |
+
=======================================================================
|
| 56 |
+
|
| 57 |
+
Creative Commons Attribution 4.0 International Public License
|
| 58 |
+
|
| 59 |
+
By exercising the Licensed Rights (defined below), You accept and agree
|
| 60 |
+
to be bound by the terms and conditions of this Creative Commons
|
| 61 |
+
Attribution 4.0 International Public License ("Public License"). To the
|
| 62 |
+
extent this Public License may be interpreted as a contract, You are
|
| 63 |
+
granted the Licensed Rights in consideration of Your acceptance of
|
| 64 |
+
these terms and conditions, and the Licensor grants You such rights in
|
| 65 |
+
consideration of benefits the Licensor receives from making the
|
| 66 |
+
Licensed Material available under these terms and conditions.
|
| 67 |
+
|
| 68 |
+
|
| 69 |
+
Section 1 -- Definitions.
|
| 70 |
+
|
| 71 |
+
a. Adapted Material means material subject to Copyright and Similar
|
| 72 |
+
Rights that is derived from or based upon the Licensed Material
|
| 73 |
+
and in which the Licensed Material is translated, altered,
|
| 74 |
+
arranged, transformed, or otherwise modified in a manner requiring
|
| 75 |
+
permission under the Copyright and Similar Rights held by the
|
| 76 |
+
Licensor. For purposes of this Public License, where the Licensed
|
| 77 |
+
Material is a musical work, performance, or sound recording,
|
| 78 |
+
Adapted Material is always produced where the Licensed Material is
|
| 79 |
+
synched in timed relation with a moving image.
|
| 80 |
+
|
| 81 |
+
b. Adapter's License means the license You apply to Your Copyright
|
| 82 |
+
and Similar Rights in Your contributions to Adapted Material in
|
| 83 |
+
accordance with the terms and conditions of this Public License.
|
| 84 |
+
|
| 85 |
+
c. Copyright and Similar Rights means copyright and/or similar rights
|
| 86 |
+
closely related to copyright including, without limitation,
|
| 87 |
+
performance, broadcast, sound recording, and Sui Generis Database
|
| 88 |
+
Rights, without regard to how the rights are labeled or
|
| 89 |
+
categorized. For purposes of this Public License, the rights
|
| 90 |
+
specified in Section 2(b)(1)-(2) are not Copyright and Similar
|
| 91 |
+
Rights.
|
| 92 |
+
|
| 93 |
+
d. Effective Technological Measures means those measures that, in the
|
| 94 |
+
absence of proper authority, may not be circumvented under laws
|
| 95 |
+
fulfilling obligations under Article 11 of the WIPO Copyright
|
| 96 |
+
Treaty adopted on December 20, 1996, and/or similar international
|
| 97 |
+
agreements.
|
| 98 |
+
|
| 99 |
+
e. Exceptions and Limitations means fair use, fair dealing, and/or
|
| 100 |
+
any other exception or limitation to Copyright and Similar Rights
|
| 101 |
+
that applies to Your use of the Licensed Material.
|
| 102 |
+
|
| 103 |
+
f. Licensed Material means the artistic or literary work, database,
|
| 104 |
+
or other material to which the Licensor applied this Public
|
| 105 |
+
License.
|
| 106 |
+
|
| 107 |
+
g. Licensed Rights means the rights granted to You subject to the
|
| 108 |
+
terms and conditions of this Public License, which are limited to
|
| 109 |
+
all Copyright and Similar Rights that apply to Your use of the
|
| 110 |
+
Licensed Material and that the Licensor has authority to license.
|
| 111 |
+
|
| 112 |
+
h. Licensor means the individual(s) or entity(ies) granting rights
|
| 113 |
+
under this Public License.
|
| 114 |
+
|
| 115 |
+
i. Share means to provide material to the public by any means or
|
| 116 |
+
process that requires permission under the Licensed Rights, such
|
| 117 |
+
as reproduction, public display, public performance, distribution,
|
| 118 |
+
dissemination, communication, or importation, and to make material
|
| 119 |
+
available to the public including in ways that members of the
|
| 120 |
+
public may access the material from a place and at a time
|
| 121 |
+
individually chosen by them.
|
| 122 |
+
|
| 123 |
+
j. Sui Generis Database Rights means rights other than copyright
|
| 124 |
+
resulting from Directive 96/9/EC of the European Parliament and of
|
| 125 |
+
the Council of 11 March 1996 on the legal protection of databases,
|
| 126 |
+
as amended and/or succeeded, as well as other essentially
|
| 127 |
+
equivalent rights anywhere in the world.
|
| 128 |
+
|
| 129 |
+
k. You means the individual or entity exercising the Licensed Rights
|
| 130 |
+
under this Public License. Your has a corresponding meaning.
|
| 131 |
+
|
| 132 |
+
|
| 133 |
+
Section 2 -- Scope.
|
| 134 |
+
|
| 135 |
+
a. License grant.
|
| 136 |
+
|
| 137 |
+
1. Subject to the terms and conditions of this Public License,
|
| 138 |
+
the Licensor hereby grants You a worldwide, royalty-free,
|
| 139 |
+
non-sublicensable, non-exclusive, irrevocable license to
|
| 140 |
+
exercise the Licensed Rights in the Licensed Material to:
|
| 141 |
+
|
| 142 |
+
a. reproduce and Share the Licensed Material, in whole or
|
| 143 |
+
in part; and
|
| 144 |
+
|
| 145 |
+
b. produce, reproduce, and Share Adapted Material.
|
| 146 |
+
|
| 147 |
+
2. Exceptions and Limitations. For the avoidance of doubt, where
|
| 148 |
+
Exceptions and Limitations apply to Your use, this Public
|
| 149 |
+
License does not apply, and You do not need to comply with
|
| 150 |
+
its terms and conditions.
|
| 151 |
+
|
| 152 |
+
3. Term. The term of this Public License is specified in Section
|
| 153 |
+
6(a).
|
| 154 |
+
|
| 155 |
+
4. Media and formats; technical modifications allowed. The
|
| 156 |
+
Licensor authorizes You to exercise the Licensed Rights in
|
| 157 |
+
all media and formats whether now known or hereafter created,
|
| 158 |
+
and to make technical modifications necessary to do so. The
|
| 159 |
+
Licensor waives and/or agrees not to assert any right or
|
| 160 |
+
authority to forbid You from making technical modifications
|
| 161 |
+
necessary to exercise the Licensed Rights, including
|
| 162 |
+
technical modifications necessary to circumvent Effective
|
| 163 |
+
Technological Measures. For purposes of this Public License,
|
| 164 |
+
simply making modifications authorized by this Section 2(a)
|
| 165 |
+
(4) never produces Adapted Material.
|
| 166 |
+
|
| 167 |
+
5. Downstream recipients.
|
| 168 |
+
|
| 169 |
+
a. Offer from the Licensor -- Licensed Material. Every
|
| 170 |
+
recipient of the Licensed Material automatically
|
| 171 |
+
receives an offer from the Licensor to exercise the
|
| 172 |
+
Licensed Rights under the terms and conditions of this
|
| 173 |
+
Public License.
|
| 174 |
+
|
| 175 |
+
b. No downstream restrictions. You may not offer or impose
|
| 176 |
+
any additional or different terms or conditions on, or
|
| 177 |
+
apply any Effective Technological Measures to, the
|
| 178 |
+
Licensed Material if doing so restricts exercise of the
|
| 179 |
+
Licensed Rights by any recipient of the Licensed
|
| 180 |
+
Material.
|
| 181 |
+
|
| 182 |
+
6. No endorsement. Nothing in this Public License constitutes or
|
| 183 |
+
may be construed as permission to assert or imply that You
|
| 184 |
+
are, or that Your use of the Licensed Material is, connected
|
| 185 |
+
with, or sponsored, endorsed, or granted official status by,
|
| 186 |
+
the Licensor or others designated to receive attribution as
|
| 187 |
+
provided in Section 3(a)(1)(A)(i).
|
| 188 |
+
|
| 189 |
+
b. Other rights.
|
| 190 |
+
|
| 191 |
+
1. Moral rights, such as the right of integrity, are not
|
| 192 |
+
licensed under this Public License, nor are publicity,
|
| 193 |
+
privacy, and/or other similar personality rights; however, to
|
| 194 |
+
the extent possible, the Licensor waives and/or agrees not to
|
| 195 |
+
assert any such rights held by the Licensor to the limited
|
| 196 |
+
extent necessary to allow You to exercise the Licensed
|
| 197 |
+
Rights, but not otherwise.
|
| 198 |
+
|
| 199 |
+
2. Patent and trademark rights are not licensed under this
|
| 200 |
+
Public License.
|
| 201 |
+
|
| 202 |
+
3. To the extent possible, the Licensor waives any right to
|
| 203 |
+
collect royalties from You for the exercise of the Licensed
|
| 204 |
+
Rights, whether directly or through a collecting society
|
| 205 |
+
under any voluntary or waivable statutory or compulsory
|
| 206 |
+
licensing scheme. In all other cases the Licensor expressly
|
| 207 |
+
reserves any right to collect such royalties.
|
| 208 |
+
|
| 209 |
+
|
| 210 |
+
Section 3 -- License Conditions.
|
| 211 |
+
|
| 212 |
+
Your exercise of the Licensed Rights is expressly made subject to the
|
| 213 |
+
following conditions.
|
| 214 |
+
|
| 215 |
+
a. Attribution.
|
| 216 |
+
|
| 217 |
+
1. If You Share the Licensed Material (including in modified
|
| 218 |
+
form), You must:
|
| 219 |
+
|
| 220 |
+
a. retain the following if it is supplied by the Licensor
|
| 221 |
+
with the Licensed Material:
|
| 222 |
+
|
| 223 |
+
i. identification of the creator(s) of the Licensed
|
| 224 |
+
Material and any others designated to receive
|
| 225 |
+
attribution, in any reasonable manner requested by
|
| 226 |
+
the Licensor (including by pseudonym if
|
| 227 |
+
designated);
|
| 228 |
+
|
| 229 |
+
ii. a copyright notice;
|
| 230 |
+
|
| 231 |
+
iii. a notice that refers to this Public License;
|
| 232 |
+
|
| 233 |
+
iv. a notice that refers to the disclaimer of
|
| 234 |
+
warranties;
|
| 235 |
+
|
| 236 |
+
v. a URI or hyperlink to the Licensed Material to the
|
| 237 |
+
extent reasonably practicable;
|
| 238 |
+
|
| 239 |
+
b. indicate if You modified the Licensed Material and
|
| 240 |
+
retain an indication of any previous modifications; and
|
| 241 |
+
|
| 242 |
+
c. indicate the Licensed Material is licensed under this
|
| 243 |
+
Public License, and include the text of, or the URI or
|
| 244 |
+
hyperlink to, this Public License.
|
| 245 |
+
|
| 246 |
+
2. You may satisfy the conditions in Section 3(a)(1) in any
|
| 247 |
+
reasonable manner based on the medium, means, and context in
|
| 248 |
+
which You Share the Licensed Material. For example, it may be
|
| 249 |
+
reasonable to satisfy the conditions by providing a URI or
|
| 250 |
+
hyperlink to a resource that includes the required
|
| 251 |
+
information.
|
| 252 |
+
|
| 253 |
+
3. If requested by the Licensor, You must remove any of the
|
| 254 |
+
information required by Section 3(a)(1)(A) to the extent
|
| 255 |
+
reasonably practicable.
|
| 256 |
+
|
| 257 |
+
4. If You Share Adapted Material You produce, the Adapter's
|
| 258 |
+
License You apply must not prevent recipients of the Adapted
|
| 259 |
+
Material from complying with this Public License.
|
| 260 |
+
|
| 261 |
+
|
| 262 |
+
Section 4 -- Sui Generis Database Rights.
|
| 263 |
+
|
| 264 |
+
Where the Licensed Rights include Sui Generis Database Rights that
|
| 265 |
+
apply to Your use of the Licensed Material:
|
| 266 |
+
|
| 267 |
+
a. for the avoidance of doubt, Section 2(a)(1) grants You the right
|
| 268 |
+
to extract, reuse, reproduce, and Share all or a substantial
|
| 269 |
+
portion of the contents of the database;
|
| 270 |
+
|
| 271 |
+
b. if You include all or a substantial portion of the database
|
| 272 |
+
contents in a database in which You have Sui Generis Database
|
| 273 |
+
Rights, then the database in which You have Sui Generis Database
|
| 274 |
+
Rights (but not its individual contents) is Adapted Material; and
|
| 275 |
+
|
| 276 |
+
c. You must comply with the conditions in Section 3(a) if You Share
|
| 277 |
+
all or a substantial portion of the contents of the database.
|
| 278 |
+
|
| 279 |
+
For the avoidance of doubt, this Section 4 supplements and does not
|
| 280 |
+
replace Your obligations under this Public License where the Licensed
|
| 281 |
+
Rights include other Copyright and Similar Rights.
|
| 282 |
+
|
| 283 |
+
|
| 284 |
+
Section 5 -- Disclaimer of Warranties and Limitation of Liability.
|
| 285 |
+
|
| 286 |
+
a. UNLESS OTHERWISE SEPARATELY UNDERTAKEN BY THE LICENSOR, TO THE
|
| 287 |
+
EXTENT POSSIBLE, THE LICENSOR OFFERS THE LICENSED MATERIAL AS-IS
|
| 288 |
+
AND AS-AVAILABLE, AND MAKES NO REPRESENTATIONS OR WARRANTIES OF
|
| 289 |
+
ANY KIND CONCERNING THE LICENSED MATERIAL, WHETHER EXPRESS,
|
| 290 |
+
IMPLIED, STATUTORY, OR OTHER. THIS INCLUDES, WITHOUT LIMITATION,
|
| 291 |
+
WARRANTIES OF TITLE, MERCHANTABILITY, FITNESS FOR A PARTICULAR
|
| 292 |
+
PURPOSE, NON-INFRINGEMENT, ABSENCE OF LATENT OR OTHER DEFECTS,
|
| 293 |
+
ACCURACY, OR THE PRESENCE OR ABSENCE OF ERRORS, WHETHER OR NOT
|
| 294 |
+
KNOWN OR DISCOVERABLE. WHERE DISCLAIMERS OF WARRANTIES ARE NOT
|
| 295 |
+
ALLOWED IN FULL OR IN PART, THIS DISCLAIMER MAY NOT APPLY TO YOU.
|
| 296 |
+
|
| 297 |
+
b. TO THE EXTENT POSSIBLE, IN NO EVENT WILL THE LICENSOR BE LIABLE
|
| 298 |
+
TO YOU ON ANY LEGAL THEORY (INCLUDING, WITHOUT LIMITATION,
|
| 299 |
+
NEGLIGENCE) OR OTHERWISE FOR ANY DIRECT, SPECIAL, INDIRECT,
|
| 300 |
+
INCIDENTAL, CONSEQUENTIAL, PUNITIVE, EXEMPLARY, OR OTHER LOSSES,
|
| 301 |
+
COSTS, EXPENSES, OR DAMAGES ARISING OUT OF THIS PUBLIC LICENSE OR
|
| 302 |
+
USE OF THE LICENSED MATERIAL, EVEN IF THE LICENSOR HAS BEEN
|
| 303 |
+
ADVISED OF THE POSSIBILITY OF SUCH LOSSES, COSTS, EXPENSES, OR
|
| 304 |
+
DAMAGES. WHERE A LIMITATION OF LIABILITY IS NOT ALLOWED IN FULL OR
|
| 305 |
+
IN PART, THIS LIMITATION MAY NOT APPLY TO YOU.
|
| 306 |
+
|
| 307 |
+
c. The disclaimer of warranties and limitation of liability provided
|
| 308 |
+
above shall be interpreted in a manner that, to the extent
|
| 309 |
+
possible, most closely approximates an absolute disclaimer and
|
| 310 |
+
waiver of all liability.
|
| 311 |
+
|
| 312 |
+
|
| 313 |
+
Section 6 -- Term and Termination.
|
| 314 |
+
|
| 315 |
+
a. This Public License applies for the term of the Copyright and
|
| 316 |
+
Similar Rights licensed here. However, if You fail to comply with
|
| 317 |
+
this Public License, then Your rights under this Public License
|
| 318 |
+
terminate automatically.
|
| 319 |
+
|
| 320 |
+
b. Where Your right to use the Licensed Material has terminated under
|
| 321 |
+
Section 6(a), it reinstates:
|
| 322 |
+
|
| 323 |
+
1. automatically as of the date the violation is cured, provided
|
| 324 |
+
it is cured within 30 days of Your discovery of the
|
| 325 |
+
violation; or
|
| 326 |
+
|
| 327 |
+
2. upon express reinstatement by the Licensor.
|
| 328 |
+
|
| 329 |
+
For the avoidance of doubt, this Section 6(b) does not affect any
|
| 330 |
+
right the Licensor may have to seek remedies for Your violations
|
| 331 |
+
of this Public License.
|
| 332 |
+
|
| 333 |
+
c. For the avoidance of doubt, the Licensor may also offer the
|
| 334 |
+
Licensed Material under separate terms or conditions or stop
|
| 335 |
+
distributing the Licensed Material at any time; however, doing so
|
| 336 |
+
will not terminate this Public License.
|
| 337 |
+
|
| 338 |
+
d. Sections 1, 5, 6, 7, and 8 survive termination of this Public
|
| 339 |
+
License.
|
| 340 |
+
|
| 341 |
+
|
| 342 |
+
Section 7 -- Other Terms and Conditions.
|
| 343 |
+
|
| 344 |
+
a. The Licensor shall not be bound by any additional or different
|
| 345 |
+
terms or conditions communicated by You unless expressly agreed.
|
| 346 |
+
|
| 347 |
+
b. Any arrangements, understandings, or agreements regarding the
|
| 348 |
+
Licensed Material not stated herein are separate from and
|
| 349 |
+
independent of the terms and conditions of this Public License.
|
| 350 |
+
|
| 351 |
+
|
| 352 |
+
Section 8 -- Interpretation.
|
| 353 |
+
|
| 354 |
+
a. For the avoidance of doubt, this Public License does not, and
|
| 355 |
+
shall not be interpreted to, reduce, limit, restrict, or impose
|
| 356 |
+
conditions on any use of the Licensed Material that could lawfully
|
| 357 |
+
be made without permission under this Public License.
|
| 358 |
+
|
| 359 |
+
b. To the extent possible, if any provision of this Public License is
|
| 360 |
+
deemed unenforceable, it shall be automatically reformed to the
|
| 361 |
+
minimum extent necessary to make it enforceable. If the provision
|
| 362 |
+
cannot be reformed, it shall be severed from this Public License
|
| 363 |
+
without affecting the enforceability of the remaining terms and
|
| 364 |
+
conditions.
|
| 365 |
+
|
| 366 |
+
c. No term or condition of this Public License will be waived and no
|
| 367 |
+
failure to comply consented to unless expressly agreed to by the
|
| 368 |
+
Licensor.
|
| 369 |
+
|
| 370 |
+
d. Nothing in this Public License constitutes or may be interpreted
|
| 371 |
+
as a limitation upon, or waiver of, any privileges and immunities
|
| 372 |
+
that apply to the Licensor or You, including from the legal
|
| 373 |
+
processes of any jurisdiction or authority.
|
| 374 |
+
|
| 375 |
+
|
| 376 |
+
=======================================================================
|
| 377 |
+
|
| 378 |
+
Creative Commons is not a party to its public
|
| 379 |
+
licenses. Notwithstanding, Creative Commons may elect to apply one of
|
| 380 |
+
its public licenses to material it publishes and in those instances
|
| 381 |
+
will be considered the “Licensor.” The text of the Creative Commons
|
| 382 |
+
public licenses is dedicated to the public domain under the CC0 Public
|
| 383 |
+
Domain Dedication. Except for the limited purpose of indicating that
|
| 384 |
+
material is shared under a Creative Commons public license or as
|
| 385 |
+
otherwise permitted by the Creative Commons policies published at
|
| 386 |
+
creativecommons.org/policies, Creative Commons does not authorize the
|
| 387 |
+
use of the trademark "Creative Commons" or any other trademark or logo
|
| 388 |
+
of Creative Commons without its prior written consent including,
|
| 389 |
+
without limitation, in connection with any unauthorized modifications
|
| 390 |
+
to any of its public licenses or any other arrangements,
|
| 391 |
+
understandings, or agreements concerning use of licensed material. For
|
| 392 |
+
the avoidance of doubt, this paragraph does not form part of the
|
| 393 |
+
public licenses.
|
| 394 |
+
|
| 395 |
+
Creative Commons may be contacted at creativecommons.org.
|