Papers · organized/paper_cards

论文

3 张论文卡片 · Agent 智能体 · 应用落地

开放获取 全部 绿色 · 724
4.4 OpenComputer:Verifiable Software Worlds for Computer-Use Agents
4.4 OpenComputer:面向 Computer-Use Agents 的可验证软件世界(⭐⭐⭐⭐⭐)
arXiv:2605.19769 Agent 智能体 应用落地 OA · 绿色 被引 6 · S2

实验表明,OpenComputer 的硬编码验证器比 LLM-as-judge 评估更贴合人类裁定,尤其当任务成败取决于细粒度应用状态时。Experiments show that OpenComputer's hard-coded verifiers align more closely with human adjudication than LLM-as-judge evaluation, especially when success depends on fine-grained application state.

arXiv-1:Design Patterns for Deploying AI Agents with Model Context Protocol
arXiv-1:基于Model Context Protocol部署AI Agent的设计模式
arXiv:2603.13417 Agent 智能体 应用落地 OA · 绿色 被引 4 · S2

本文提出三种协议级原语以填补Model Context Protocol的空白:身份传递、自适应工具预算与结构化错误语义,并提出Structured Error Recovery Framework (SERF),提供机器可读的失败语义以支持确定性的Agent自校正。Three protocol-level primitives are proposed to fill gaps in the Model Context Protocol: identity propagation, adaptive tool budgeting, and structured error semantics, and the Structured Error Recovery Framework (SERF), which provides machine-readable failure semantics that enable deterministic agent self-correction.

[TOKI] A Bitemporal Operator Algebra for Contradiction Resolution in LLM-Agent Persistent Memory
[TOKI] 面向LLM-Agent持久记忆中矛盾解析的双时态算子代数
arXiv:2606.06240 Agent 智能体 应用落地 OA · 绿色 被引 4 · S2

研究表明矛盾解析本质上是写入时并发控制,并将缺失的契约——一个在隔离性、模式与来源维度上被证明正确的写入时正确性规范——显式化,固定了每个生产启发式都默认假设、却没有任何已部署系统显式给出的保证。It is shown that contradiction resolution is write-time concurrency control and make the missing contract explicit, a write-time correctness specification, proved sound across isolation, schema, and provenance, pinning the guarantee every production heuristic assumes but no deployed system makes explicit.