arXiv paper· systems security (AI agent supply-chain security)· method paper

Versioned Transitive Dependency-Closure Binding and Operation-Time Effect Governance for Agent Skills: ClosureBound

Genliang Zhu, Chu Wang

cs.CR · cs.AI

Quick verdict

ClosureBound: a commit-time monitor binding agent-skill grants to exact dependency closures; rigorous theory, honest scope, yet purely synthetic evidence.

Summary

The paper presents ClosureBound, a reference monitor for AI agent skills that prevents authorization from silently transferring across changes to a skill's transitive dependency closure. The authors observe that a skill's operational capability extends beyond its signed root directory to nested skills, packages, tool schemas, model artifacts, and services, which can change after load-time verification. ClosureBound resolves an activated skill into a typed, canonically committed dependency graph (SCC-based, Merkle-style commitments), binds each task grant to an exact closure root plus an immutable effect ceiling and purpose/provenance bounds, and re-resolves both closure and normalized external effect at the durability boundary via a prepare/commit protocol with single-consumption reservations. Under five explicit assumptions (complete closure discovery, complete mediation, authoritative freshness, linearizable commit, cryptographic binding), the paper proves metadata non-authority, closure determinism, version non-inheritance, effect non-amplification, operation-time TOCTOU safety, and equivalent-effect path invariance, each with stated non-conclusions. Evaluation is deliberately bounded: 40 synthetic lifecycle fixtures are matched exactly by the full profile while five reduced profiles and six seeded mutants fail predictably; model checking of a finite abstraction reached 84,608 states and 530,752 transitions without invariant violation; a lexical audit of 549 public skills (Anthropic and OpenAI snapshots) found only 21 of 526 roots with bundled files naming every path verbatim. Main limitations: all functional evidence is synthetic and co-designed with the implementation, the reference artifact is excluded from the arXiv bundle (Appendix C), and production costs of complete mediation remain unmeasured.

Review complete

Assessment at a glance

systems security (AI agent supply-chain security)

4

risk flags identified

● high 0

● medium 2

● low 2

Reproducibility readinesslow
Code & data availablenot stated
Review confidencehigh
AI text signal0/20 passages flagged
Deep research viableCode-reproducible

5 strengths · 5 weaknesses · 5 author questions

AI text signal = Binoculars zero-shot detector score over 20 sampled passages (Fast-DetectGPT co-reported) — absence does not prove human authorship, and a flag does not imply misconduct.

Levels reflect verification complexity — not a quality score. Evolve never rates your paper.

Key claims under review

  • Load-time integrity of a skill root does not bind later transitive resolutions or equivalent effect paths; authorization must be re-bound at the durability boundary (Section 2, Fig. 1).
  • Under five explicit assumptions, ClosureBound establishes metadata non-authority, closure determinism, version non-inheritance, effect non-amplification, operation-time TOCTOU safety, and equivalent-path invariance (Theorems 1–5).
  • Each of five reduced profiles and six single-point mutants is necessary: finite traces exist where each weakened evaluator admits an effect excluded by the full joint predicate (Proposition 1, Tables 2–4).
  • Public skill distributions rarely declare their operational closure: only 21 of 526 roots with bundled files name every path verbatim, and 67 roots contain links escaping their root (Section 8.8).
  • The reference kernel is mechanically lightweight in-process (median 0.045 ms closure commitment, 0.120 ms full-profile evaluation on Apple M4 Max), while production-resolution costs are explicitly excluded (Section 8.7).

Strengths

  • Explicit assumption and claim-boundary discipline

    Each theorem (Thms 1–5, Section 6) carries a Non-conclusions paragraph; Table 1 fixes in/out-of-scope questions; Appendix D is a claim checklist. The paper explicitly declines program equivalence, receiver honesty, and benignness claims.

  • Structured necessity evidence

    Proposition 1 plus Table 2 transparent profiles, Table 3 graded fixture results (8→14→20→24→32→40 exact decisions), and Table 4 six mutants with minimal witnesses show each mechanism family is individually necessary.

  • Externally grounded motivation

  • Circularity-aware grant compilation

  • Regression coverage of subtle constructions

Weaknesses

  • Entirely synthetic, co-designed evaluation

  • Artifact not released

  • No executed baseline comparison

  • Availability cost unquantified

  • Load-bearing completeness assumption in tension with own audit

Full Review Report

$1.99 · one-time

Unlock the complete preliminary analysis Evolve produced for this paper.

Report preview

Scope & Claims

ClosureBound targets a specific systems-security gap in the emerging Agent Skills ecosystem: a skill's operational capability exceeds its signed root directory because nested skills, packages, tool schemas, model artifacts, and services resolve lazily and can change after load-time verification (Section 1, Fig. 1). The central claim is that authorization must bind, jointly, (a) the exact transitive heterogeneous dependency closure and (b) the normalized external effect, at the durability boundary — not the root name, manifest, or load-time artifact. Six properties are proven under five explicit assumptions (Section 3.3): metadata non-authority (Thm 1), closure determinism (Lemma 1), version/closure non-inheritance (Thm 2), transitive effect non-amplification (Thm 3), operation-time freshness (Thm 4), and supported equivalent-path invariance (Thm 5). Scope discipline is unusually strong: Table 1 fixes in/out-of-scope questions, every theorem carries a Non-conclusions paragraph, and Appendix D is a claim checklist. The authors candidly exclude program equivalence, remote-service honesty, content benignness, and unmediated effects.

The remaining sections cover Methodology Assessment, Statistical Evidence, Results & Reproducibility, Limitations & Risks, and Verdict & Recommendations.

  • All 5 strengths & 5 weaknesses, analyzed in detail
  • 4 risk flags with severity, section & reviewer questions
  • Methods & statistical evidence assessment
  • 5 questions a peer reviewer would ask
  • Full six-dimension evaluation report & recommendations

One-time purchase · this paper only

One-time purchase, this paper only. AI-generated preliminary analysis — not peer review.

Frequently asked questions

What problem does ClosureBound solve?

AI agent skills assemble their real capability at runtime from nested skills, packages, tools, models, and external services, so a signature on the top-level directory does not cover the whole dependency chain. ClosureBound re-verifies the exact transitive dependency closure and the normalized effect at the moment an action becomes durable, so a changed dependency or an equivalent-but-different execution path cannot silently reuse an old authorization.

What are the paper's main results?

Under five explicit assumptions the authors prove six safety properties, including that changed dependencies cannot inherit authority and equivalent paths cannot bypass policy. A synthetic suite of 40 lifecycle cases is handled perfectly by the full design while five weakened profiles and six mutants fail exactly as predicted; model exploration of a finite abstraction covers 84,608 states without violations; and an audit of 549 public skills shows closures are rarely explicitly enumerable — only 21 of 526 roots with bundled files list every path.

Is the ClosureBound code available?

No. Appendix C states that the evaluated implementation, machine-readable traces, and verification commands are retained internally and are not included in the arXiv source bundle; the paper discloses methods, configurations, and aggregate numbers only, so independent execution currently requires access to the authors.

What are the main limitations acknowledged?

The authors list six: proofs are conditional on complete dependency discovery and sink mediation; effect semantics cover only registered adapters, not arbitrary code; remote service behavior cannot be verified from stable endpoints; evaluation is finite and partly static; cost is measured in a single process excluding network and signatures; and there is no guarantee about receiver-side settlement or exactly-once effects. The review adds that all functional evidence is synthetic and the artifact is not public.

About this review

This is an AI-generated preliminary review by Evolve.Pub, produced from the openly available text of the paper. It is not peer review and does not represent the authors' views. The canonical record of the paper is at the publisher link above.

Go deeper on this paper

Wrote a paper? Stress-test it before reviewers do.

Upload your manuscript for the same structured scrutiny — reasoning, statistics, evidence, figures, and reproducibility.

Scan your paper
Versioned Transitive Dependency-Closure Binding and Operation-Time Effect Governance for Agent Skills: ClosureBound | Evolve.Pub