{
  "schema": "fprd.result-review.audit-certificate.v1",
  "date": "2026-09-01",
  "status": "pass_with_correction",
  "review_units": [
    {
      "claims": ["FPRD-SH-B06", "FPRD-SH-X05", "FPRD-SH-C14"],
      "title": "Pentagon macro-event versus path compiler",
      "mathematics": [
        "The natural backward-prefix automaton has 11 states and 35 transitions.",
        "Its language-preserving boundary quotient is a minimal six-state partial reversible DFA with ten transitions.",
        "All 488,281 alphabet words of lengths zero through eight were tested; exactly 781 are accepted.",
        "The 66/81 carrier and 87/191 carrier-controller counts were removed because their precise model and verifier were not recovered."
      ]
    },
    {
      "claims": ["FPRD-SH-T25", "FPRD-SH-T26", "FPRD-SH-B03", "FPRD-SH-C12", "FPRD-SH-T27", "FPRD-SH-X03"],
      "title": "Support tensors and the Shannon-capacity dictionary",
      "mathematics": [
        "Cartesian support intersection agrees with strong-product adjacency.",
        "All 1,099 simple graphs through five vertices have the stated uniform support representation.",
        "The common support width is max(1, Delta(G)); the positive floor is required for edgeless graphs.",
        "The perfect-policy corollary follows from the perfect graph theorem and the Lovasz-theta sandwich."
      ]
    }
  ],
  "independent_evidence": {
    "checker": "pentagon_shannon_independent_review.py",
    "checker_sha256": "585167caacd962fbf22246773a3646d8325ad401d9f1411e964650456d75aab4",
    "output": "independent-output.json",
    "output_sha256": "f108568cd9bbfa3d35a79a2b2a95f389c5a777f641e6a8dfb90fe49cc0152693",
    "result": "pass"
  },
  "source_evidence_replayed": {
    "support_tensor_checker_sha256": "5dd3251b19f74e56a92242c8009ce39a034d1deceb91c6c3a021c9dfdd95552b",
    "support_tensor_output_sha256": "74a484d6d11a9f48a26ab366f17e16ae83257d46f2d73e8ccec3a4228c84dfd4",
    "result": "pass"
  },
  "primary_sources_verified": [
    {"title": "The Prefix Automaton", "doi": "10.25596/jalc-2021-017"},
    {"title": "Normal Hypergraphs and the Perfect Graph Conjecture", "doi": "10.1016/0012-365X(72)90006-4"},
    {"title": "On the Shannon Capacity of a Graph", "doi": "10.1109/TIT.1979.1055985"},
    {"title": "On the Shannon Capacity of Triangular Graphs", "doi": "10.37236/3214"},
    {"title": "Bounding the Graph Capacity with Quantum Mechanics and Finite Automata", "doi": "10.1109/TIT.2025.3544970"},
    {"title": "Advances in the Shannon Capacity of Graphs", "doi": "10.3934/math.2026111", "arxiv": "2509.24600"}
  ],
  "maturity_decision": "No level changes. C14 remains L4 after narrowing it to the independently reproduced direct-block computation; the unreproduced carrier counts are withdrawn."
}