{
  "schemaVersion": "1.0",
  "recordType": "assurance-task-register",
  "site": "Evidence Press",
  "claimCeiling": "These records expose authored claims, scoped evidence, replay tasks and producer or external receipts without upgrading correctness, novelty, independence, formal verification or review beyond the evidence explicitly recorded.",
  "itemSchema": "https://evidencepress.org/api/schemas/assurance-task.schema.json",
  "count": 5,
  "tasks": [
    {
      "schemaVersion": "1.0",
      "recordType": "assurance-task",
      "taskId": "ep-task:z20-equals-6:integrity:v1",
      "taskKey": "integrity",
      "taskVersion": "1.0.0",
      "claimId": "ep-claim:sha256:77529f500af949b9ee0b76694fc022d8dc06d9779628df896888b6f2c8470bb1",
      "claimVersion": "1.0.0",
      "type": "integrity-check",
      "title": "Check the immutable candidate package hashes",
      "objective": "Verify that the locally obtained candidate-2026-07-26 files exactly match both preserved SHA-256 manifests.",
      "obligationIds": [
        "cnf",
        "certificate",
        "checker"
      ],
      "inputs": [
        {
          "ref": "https://github.com/ipitchford/z20-cochromatic/releases/tag/candidate-2026-07-26",
          "role": "immutable release package"
        },
        {
          "ref": "RELEASE_MANIFEST.sha256",
          "role": "release manifest"
        },
        {
          "ref": "certificates/MANIFEST.sha256",
          "role": "certificate manifest"
        }
      ],
      "acceptanceCriteria": [
        "Every manifest entry exists and its SHA-256 digest matches exactly."
      ],
      "rejectionCriteria": [
        "A file is absent, a digest differs, or the command cannot inspect the complete manifests."
      ],
      "dependencies": [],
      "replayProfileIds": [
        "ep-profile:z20-equals-6:integrity:v1"
      ],
      "budget": {
        "maxActiveMinutes": 10,
        "maxWallMinutes": 15,
        "maxMemoryMiB": 256,
        "cashCost": "zero-required",
        "networkPolicy": "forbidden"
      },
      "independence": {
        "requiredForPromotion": false,
        "disclosureRequired": true,
        "qualifyingRelationships": [],
        "nonQualifyingRelationships": [
          "claim producer",
          "repository maintainer",
          "same agent run"
        ]
      },
      "assuranceEffect": {
        "ifPassed": "Establishes local byte-level identity with the preserved manifests.",
        "cannotEstablish": [
          "mathematical correctness",
          "semantic correspondence",
          "novelty",
          "independence",
          "peer review"
        ]
      },
      "status": "open",
      "license": "CC0-1.0"
    },
    {
      "schemaVersion": "1.0",
      "recordType": "assurance-task",
      "taskId": "ep-task:z20-equals-6:producer-portable-replay:v1",
      "taskKey": "producer-portable-replay",
      "taskVersion": "1.0.0",
      "claimId": "ep-claim:sha256:77529f500af949b9ee0b76694fc022d8dc06d9779628df896888b6f2c8470bb1",
      "claimVersion": "1.0.0",
      "type": "producer-rerun",
      "title": "Replay the supplied separate-implementation verifier",
      "objective": "Run the supplied Python verifier offline against the exact candidate package and preserve its complete outcome with an independence disclosure.",
      "obligationIds": [
        "cnf",
        "certificate",
        "checker",
        "semantic-bridge"
      ],
      "inputs": [
        {
          "ref": "verification/verify_certificate.py",
          "role": "producer-supplied separate implementation verifier"
        },
        {
          "ref": "certificates/",
          "role": "exact formulas, proofs and manifest"
        }
      ],
      "acceptanceCriteria": [
        "The command exits successfully and reports identical clause sets, matching hashes, semantic spot-check agreement and derivation of the empty clause for both cores."
      ],
      "rejectionCriteria": [
        "Any clause-set, hash, semantic, certificate or exit-status check fails."
      ],
      "dependencies": [
        "ep-task:z20-equals-6:integrity:v1"
      ],
      "replayProfileIds": [
        "ep-profile:z20-equals-6:portable-replay:v1"
      ],
      "budget": {
        "maxActiveMinutes": 20,
        "maxWallMinutes": 90,
        "maxMemoryMiB": 2048,
        "cashCost": "zero-required",
        "networkPolicy": "forbidden"
      },
      "independence": {
        "requiredForPromotion": false,
        "disclosureRequired": true,
        "qualifyingRelationships": [],
        "nonQualifyingRelationships": [
          "claim producer",
          "producer-supplied verifier",
          "same implementation lineage"
        ]
      },
      "assuranceEffect": {
        "ifPassed": "Establishes the reported behavior of the exact supplied verifier and preserved proof package on the named machine.",
        "cannotEstablish": [
          "independent reproduction",
          "formal graph-to-CNF correspondence",
          "complete theorem verification",
          "novelty",
          "human peer review"
        ]
      },
      "status": "completed",
      "license": "CC0-1.0"
    },
    {
      "schemaVersion": "1.0",
      "recordType": "assurance-task",
      "taskId": "ep-task:z20-equals-6:lower-bound-review:v1",
      "taskKey": "lower-bound-review",
      "taskVersion": "1.0.0",
      "claimId": "ep-claim:sha256:77529f500af949b9ee0b76694fc022d8dc06d9779628df896888b6f2c8470bb1",
      "claimVersion": "1.0.0",
      "type": "specialist-review",
      "title": "Review the Paley(17) lower-bound argument",
      "objective": "Check the finite graph-theoretic lower-bound argument line by line without relying on the upper-bound computation.",
      "obligationIds": [
        "lower-bound"
      ],
      "inputs": [
        {
          "ref": "paper/z20_equals_6_proof.tex",
          "role": "candidate proof text"
        }
      ],
      "acceptanceCriteria": [
        "A reviewer records whether the Paley(17) graph has neither a 4-clique nor a 4-independent set and whether the partition bound implies z(20) >= 6."
      ],
      "rejectionCriteria": [
        "A logical gap, false finite assertion or scope mismatch is found."
      ],
      "dependencies": [],
      "replayProfileIds": [],
      "budget": {
        "maxActiveMinutes": 60,
        "maxWallMinutes": 120,
        "maxMemoryMiB": 256,
        "cashCost": "zero-required",
        "networkPolicy": "forbidden"
      },
      "independence": {
        "requiredForPromotion": true,
        "disclosureRequired": true,
        "qualifyingRelationships": [
          "unaffiliated reviewer"
        ],
        "nonQualifyingRelationships": [
          "claim producer",
          "repository maintainer",
          "same agent run"
        ]
      },
      "assuranceEffect": {
        "ifPassed": "Adds a scoped external review of the lower-bound obligation only.",
        "cannotEstablish": [
          "upper bound",
          "certificate validity",
          "complete theorem correctness",
          "novelty"
        ]
      },
      "status": "open",
      "license": "CC0-1.0"
    },
    {
      "schemaVersion": "1.0",
      "recordType": "assurance-task",
      "taskId": "ep-task:z20-equals-6:independent-reimplementation:v1",
      "taskKey": "independent-reimplementation",
      "taskVersion": "1.0.0",
      "claimId": "ep-claim:sha256:77529f500af949b9ee0b76694fc022d8dc06d9779628df896888b6f2c8470bb1",
      "claimVersion": "1.0.0",
      "type": "independent-reimplementation",
      "title": "Clean-room reproduction of the reduction and certificates",
      "objective": "From the exact public statement and declared classical dependencies, independently regenerate the Ramsey catalogue, two core formulas and unsatisfiability verdicts without using the supplied generation or verification code.",
      "obligationIds": [
        "reduction",
        "cnf",
        "certificate",
        "checker",
        "semantic-bridge"
      ],
      "inputs": [
        {
          "ref": "https://doi.org/10.5281/zenodo.21647645",
          "role": "exact claim and evidence boundary"
        },
        {
          "ref": "https://doi.org/10.4153/CJM-1955-001-4",
          "role": "declared classical Ramsey dependency"
        }
      ],
      "acceptanceCriteria": [
        "The actor discloses independence and implementation provenance.",
        "A clean-room route regenerates the same two cores and byte-identical or semantically equivalent CNFs.",
        "Independent proof tooling establishes UNSAT for both formulas.",
        "All commands, hashes and complete outputs are preserved."
      ],
      "rejectionCriteria": [
        "The implementation reuses producer code without disclosure, a core or CNF differs without a resolved explanation, either UNSAT check fails, or evidence needed to audit the run is absent."
      ],
      "dependencies": [],
      "replayProfileIds": [],
      "budget": {
        "maxActiveMinutes": 240,
        "maxWallMinutes": 1440,
        "maxMemoryMiB": 8192,
        "cashCost": "zero-required",
        "networkPolicy": "forbidden"
      },
      "independence": {
        "requiredForPromotion": true,
        "disclosureRequired": true,
        "qualifyingRelationships": [
          "unaffiliated",
          "commissioned-independent"
        ],
        "nonQualifyingRelationships": [
          "claim producer",
          "producer-supplied verifier",
          "same implementation lineage",
          "companion result reusing proof objects"
        ]
      },
      "assuranceEffect": {
        "ifPassed": "May add independent reproduction evidence for the explicitly reproduced obligations after receipt review.",
        "cannotEstablish": [
          "novelty",
          "priority",
          "human peer review",
          "formal proof unless separately supplied"
        ]
      },
      "status": "open",
      "license": "CC0-1.0"
    },
    {
      "schemaVersion": "1.0",
      "recordType": "assurance-task",
      "taskId": "ep-task:z20-equals-6:formal-semantic-bridge:v1",
      "taskKey": "formal-semantic-bridge",
      "taskVersion": "1.0.0",
      "claimId": "ep-claim:sha256:77529f500af949b9ee0b76694fc022d8dc06d9779628df896888b6f2c8470bb1",
      "claimVersion": "1.0.0",
      "type": "formalisation",
      "title": "Formalise the graph-to-CNF semantic bridge",
      "objective": "Machine-check the reduction from the graph-theoretic upper-bound statement through the two fixed cores to satisfaction of the exact preserved CNFs.",
      "obligationIds": [
        "reduction",
        "cnf",
        "semantic-bridge"
      ],
      "inputs": [
        {
          "ref": "paper/z20_equals_6_proof.tex",
          "role": "mathematical reduction"
        },
        {
          "ref": "certificates/z20_core0.cnf",
          "role": "exact core 0 formula"
        },
        {
          "ref": "certificates/z20_core1.cnf",
          "role": "exact core 1 formula"
        }
      ],
      "acceptanceCriteria": [
        "A named theorem declaration proves the reduction and exact encoding correspondence.",
        "The axiom footprint and imported libraries are reported.",
        "The build is replayable from a pinned public commit without extra axioms that assert the target."
      ],
      "rejectionCriteria": [
        "The formalisation proves only a restated assumption, omits either exact CNF, uses undisclosed axioms, or cannot be rebuilt."
      ],
      "dependencies": [
        "ep-task:z20-equals-6:integrity:v1"
      ],
      "replayProfileIds": [],
      "budget": {
        "maxActiveMinutes": 480,
        "maxWallMinutes": 2880,
        "maxMemoryMiB": 8192,
        "cashCost": "zero-required",
        "networkPolicy": "forbidden"
      },
      "independence": {
        "requiredForPromotion": false,
        "disclosureRequired": true,
        "qualifyingRelationships": [
          "unaffiliated formaliser",
          "claim producer with explicit disclosure"
        ],
        "nonQualifyingRelationships": [
          "undisclosed actor or implementation provenance"
        ]
      },
      "assuranceEffect": {
        "ifPassed": "May close the formal semantic-bridge obligation, subject to axiom-footprint and exact-artifact review.",
        "cannotEstablish": [
          "novelty",
          "priority",
          "independent reproduction unless independently produced",
          "human peer review"
        ]
      },
      "status": "open",
      "license": "CC0-1.0"
    }
  ]
}