@techreport{watts-agentic-authority-graph-validation-00,
    number =    {draft-watts-agentic-authority-graph-validation-00},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-watts-agentic-authority-graph-validation/00/},
    author =    {Deonté Watts},
    title =     {{Agentic Authority Graph Validation: A Non-Vacuous Interchange Profile for Revocation-Cut Analysis}},
    pagetotal = 8,
    year =      2026,
    month =     oct,
    day =       14,
    abstract =  {Agentic and delegated systems can represent authority as a graph whose paths terminate at consequential resources. Abstract graph models are useful, but interoperable validation requires a machine- readable representation and deterministic rules that do not accidentally accept vacuous or incomplete graphs. This document defines Agentic Authority Graph Validation (AAGV), a JSON interchange profile and validation algorithm for authority roots, consequential sinks, declared normal paths, revocation cut sets, and snapshot edge state. AAGV deliberately distinguishes structural cut validity from operational closure. It rejects missing sink sets, missing normal- path inventories, dangling references, non-dominating cuts, and non- revocable cut edges; it returns INDETERMINATE rather than CLOSED when relevant edge state is unknown. AAGV does not define an authorization token, discover hidden paths, or prove physical containment.},
}