Recoverability as a System Primitive for Long-Horizon AI Agents

• URL: http://arxiv.org/abs/2609.13672v1
• Date: Sat, 12 Sep 2026 02:54:33 GMT
• Title: Recoverability as a System Primitive for Long-Horizon AI Agents
• Abstract summary: We introduce recoverability as a system primitive that makes reuse an explicit decision.<n>Four deterministic and 20 paired file challenges demonstrate that accurate restoration and successful completion can conceal disallowed starting points.
• Score: 5.008310199603767
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: AI agents can be interrupted while editing files, calling tools, or carrying out multi-step tasks. Restarting repeats completed work, but continuing from unverified or outdated progress can carry earlier errors forward. A saved state is not necessarily a suitable place to resume. We introduce recoverability as a system primitive that makes reuse an explicit decision: select a supported starting point and a permitted recovery action, or withhold automatic continuation. Its behavioral contract binds that choice to supporting evidence, execution, and independent checks. A reference architecture connects persistence, validation, and control, with complementary runtime instances testing distinct responsibilities. Four deterministic and 20 paired file challenges demonstrate that accurate restoration and successful completion can conceal disallowed starting points. Progress controls attribute retained work to shared restoration. Event-time tests show that permission must also constrain the action, and that independently held policy evidence can expose violations even after an effect occurs. These findings establish why recovery decisions need their own evaluation, beyond restored bytes and final task success. Within supplied policies and a declared trust model, the contribution is a common, testable interface for retaining justified progress and making the conditions for its reuse explicit and enforceable.

Related papers

• From Intent to Execution Grant: An Execution-Boundary Conformance Profile for High-Risk AI Actions [9.27474112226667]
  EBL-Core decides whether one canonical, fully materialized AI-generated candidate may receive action-scoped execution authority under explicit conditions.<n>It binds, policy non-weakening, evidence handling, deterministic adjudication, verification, and grant lifecycle behavior.<n>Across 100 trials, 32 concurrent Redemption attempts yielded exactly one successful Redemption and protected test effect per trial.
  arXiv  Detail & Related papers  (2026-09-10T14:21:45Z)
• From Interaction Traces to Persistent Skills: Online Evolution for Computer-Use Agents [48.50635499112162]
  We present an online skill-evolution framework that converts interaction trajectories and evaluator feedback into a persistent, versioned library of reusable procedures.<n>We compare the full evolving-library system with a configuration-matched empty-library control across four OSWorld application domains.<n>In GIMP, provenance-aware analysis reveals retrieval across task-of-origin boundaries and revision, where repeated accepted edits fail to recover the originating task.
  arXiv  Detail & Related papers  (2026-09-04T08:29:45Z)
• When Is an Agent Evaluation Over? Outcome Finality and Cross-Unit Separation [0.0]
  Current agent evaluations score models on the state visible at the end of a stopped run which they count as one trial.<n> interpreting the score as a final result would require two conditions that the endpoint does not necessarily establish: outcome finality and cross-unit separation.<n>We argue that a final label is justified only when anything that could still change the claimed outcome is resolved, bounded, or retained as uncertainty.
  arXiv  Detail & Related papers  (2026-08-14T23:39:47Z)
• Diagnosis Before Recovery: Turning Agent Failures into Selective Self-Correction [22.654396704495934]
  Development-set failures can recover part of the missing diagnostic substrate by deciding which recovery interventions are admissible.<n>We propose DARC, a diagnosis-guided recovery harness that profiles task-family failure modes, prunes mismatched interventions from a shared recovery library, and freezes a verifier-selected success-cost policy for deployment.
  arXiv  Detail & Related papers  (2026-08-12T08:14:45Z)
• Independent Patch Verification for Coding Agents with a Bidirectional Reconstruct-and-Verify Framework [49.16055123488827]
  coding agents powered by large language models can now generate code patches directly from bug reports.<n>No mechanism independently verifies whether it truly resolves the reported problem.<n>We propose RETRACE, a training-free post-generation verification framework.
  arXiv  Detail & Related papers  (2026-08-09T22:59:13Z)
• From Trajectories to Evidence: Auditable Experimental Records for Industrial Research Agents [47.678562263387214]
  Research agents increasingly conduct multi-round machine-learning experiments in industrial recommendation settings.<n>Yet a completed trajectory is not automatically evidence: generated artifacts may be unsupported or incomplete, executed rounds may be invalid or confounded, and later modifications may obscure earlier findings.<n>We introduce an evidence-grounded framework that couples bounded verification of consequential artifacts with post-execution claim qualification.
  arXiv  Detail & Related papers  (2026-08-05T13:37:38Z)
• PhyAgentOS: A Self-Evolving Operating System for Embodied Agents with Decoupled Cognitive Planning and Physical Execution [49.776611937968]
  We present PhyAgentOS, a foundation delivering scheduling, verification, memory, benchmarking, and safety as system-level services.<n>Its Session-Centered treats a session, not an action, as the minimum unit of scheduling, compatibility, supervised execution, evidence collection, and acceptance.<n>SessionVerifier distinguishes execution termination from semantic task completion via evidence-grounded verdicts of success, failure, or replan.<n> Benchmarking reuses the deployment session and verification path, so results trace to real execution.
  arXiv  Detail & Related papers  (2026-07-18T04:46:53Z)
• DART: Semantic Recoverability for Structured Tool Agents [17.458285666498337]
  We introduce DART, a modular runtime that localizes a failed instance and certifies semantically recoverable boundaries.<n>We show that DART correctly recovers all evaluated commitment-sensitive cases where baseline local recovery fails.<n>These results show that controller legality does not imply semantic validity, and that sound local recovery requires an explicit admissibility check.
  arXiv  Detail & Related papers  (2026-05-22T07:30:43Z)
• Verify-Gated Completion as Admission Control in a Governed Multi-Agent Runtime: A Bounded Architecture Case Study [0.6875312133832079]
  We study verify-gated completion as an admission-control pattern for governed multi-agent runtimes.<n>We show that under observed conditions, a read-only verify gate plus packetized admission records made completion decisions inspectable and fail-closed.
  arXiv  Detail & Related papers  (2026-05-18T07:52:13Z)
• ClawForge: Generating Executable Interactive Benchmarks for Command-Line Agents [59.626170560327274]
  We present textbfClawForge, a generator-backed benchmark framework for executable command-line categories under state conflict.<n>We instantiate this framework as the ClawForge-Bench (17 scenarios, 6 ability categories)
  arXiv  Detail & Related papers  (2026-05-13T21:34:08Z)
• Affordance Agent Harness: Verification-Gated Skill Orchestration [45.231685718099264]
  Affordance grounding requires identifying where and how an agent should interact in open-world scenes.<n>We propose Affordance Agent Harness, a closed-loop runtime that unifies skills with an evidence store and cost control.
  arXiv  Detail & Related papers  (2026-05-01T13:45:16Z)
• Verification of Robust Properties for Access Control Policies [51.736723807086385]
  Existing methods for verifying access control policies require the policy to be complete and fully determined before verification can proceed.<n>We introduce robust property verification: the problem of determining what a policy's structure commits it to regardless of how pending decisions are resolved and regardless of subsequent extension.<n>We show that despite quantifying universally over all possible policy extensions the judgment reduces to proof search in a second-order logic programming language.
  arXiv  Detail & Related papers  (2026-03-13T17:14:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.