{
  "artifact_schema": "fprd.result-review-certificate.v1",
  "review_date": "2026-09-01",
  "reviewed_claims": [
    "FPRD-SH-T15",
    "FPRD-SH-T16",
    "FPRD-SH-T17",
    "FPRD-SH-T18",
    "FPRD-SH-C08",
    "FPRD-SH-C09"
  ],
  "mathematical_decisions": [
    {
      "claim": "FPRD-SH-T18",
      "decision": "scope correction",
      "detail": "The exact formula is unchanged. The clique-bound gap is strictly positive only with at least two active blocks and at least one block of size greater than one. With one active block, the exact overhead and clique bound are both zero."
    },
    {
      "claims": [
        "FPRD-SH-T15",
        "FPRD-SH-T16",
        "FPRD-SH-T17"
      ],
      "decision": "confirmed",
      "detail": "Independent proof inspection and a separately implemented complete small-domain audit found no mathematical mismatch."
    }
  ],
  "independent_audit": {
    "checker": "compatibility_overhead_independent_review.py",
    "checker_sha256": "396e365f70b9d1da6eb2f0dd8173fd095009ac6ef7086afb3854a41bc48f4395",
    "output": "independent-output.json",
    "output_sha256": "a60d0af3f3311a1c05bfca37091f6e0c86facc094d349aaa8244210ab7652278",
    "result": "pass",
    "coverage": {
      "two_letter_policies": 16452,
      "policy_signature_incidences": 114884,
      "three_dimensional_matching_instances": 256,
      "target_set_families": 65536,
      "disjoint_block_size_vectors": 3905,
      "noninitial_product_states": 809710
    },
    "hostile_controls": [
      "same-letter overlapping supports form a realizable clique",
      "different-letter overlapping supports do not form an edge",
      "a triple collision makes the pair bound strict",
      "one active block attains the zero clique bound",
      "binary and ternary size-two pure-shuffle examples"
    ]
  },
  "source_artifacts_inspected": [
    "boolean_product_signature_compatibility_hunt.py",
    "fprd-boolean-product-signature-compatibility-hunt-2026-09-01.md",
    "fprd-boolean-product-signature-compatibility-verification.json",
    "fprd_boolean_product_global_overhead_attack.py",
    "fprd-boolean-product-global-overhead-attack-2026-09-01.md",
    "fprd-boolean-product-global-overhead-verification.json"
  ],
  "source_replay": {
    "status": "replaced by independent complete-domain replay",
    "reason": "The durable source files were readable, but byte materialization returned a transient storage error. The independent checker covers the same decisive finite domains without importing either source implementation."
  },
  "primary_sources": [
    {
      "citation": "Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis, Boolean Products of Languages, CIAA 2026, LNCS 16695, 16–31",
      "doi": "10.1007/978-3-032-31176-4_2"
    },
    {
      "citation": "Richard M. Karp, Reducibility Among Combinatorial Problems, in Complexity of Computer Computations, 1972, 85–103",
      "doi": "10.1007/978-1-4684-2001-2_9"
    }
  ],
  "maturity_changes": [],
  "unresolved_items": [
    "No exact prescribed-size maximum is proved for overlapping one-support policies.",
    "No literature-priority claim is made for the automata-specific compatibility or collision formulations."
  ]
}