{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OU3TU2ZHJSZY4EKWOLDQR5EHFW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b73d15f2d08ce2df982f94785ab8d39ba537d8a104d458679b5686189f385999","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-04-30T01:03:15Z","title_canon_sha256":"91017f3675b73634b69786d893554d7ebda280c9f9994f10d4755bd1c305f732"},"schema_version":"1.0","source":{"id":"2604.27289","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.27289","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"2604.27289v3","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.27289","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"OU3TU2ZHJSZY","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"pith_short_16","alias_value":"OU3TU2ZHJSZY4EKW","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"pith_short_8","alias_value":"OU3TU2ZH","created_at":"2026-05-27T01:05:55Z"}],"graph_snapshots":[{"event_id":"sha256:e34aa2fc494cfd02bb6bac9f9d1e175f7d3f6a4c2f6db6e7d582f7751c36dd91","target":"graph","created_at":"2026-05-27T01:05:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The Sufficiency Theorem proves that four atomic primitives (code, reason, memory, call) are expressively complete for any discrete intelligent system, formalized as compositional closure of a Kleisli category (mechanized)."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the four primitives suffice for any discrete intelligent system and that property-based testing on 70,000 random directive sequences is sufficient to validate the BEAM runtime specification against all possible behaviors."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Coq-mechanized proofs establish a coinductive governance safety predicate, invariance across recursion levels, sufficiency of four primitives for any discrete intelligent system, necessity of semantic judgment via Rice's theorem, and a verified BEAM interpreter spec with zero disagreements on 70k+随机"},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Four atomic primitives suffice to express and govern any discrete intelligent system, as shown by machine-checked theorems."}],"snapshot_sha256":"c94919bf5d19f8522f497fbf41b71b24664eadd83311ae9c43090c60ce68d22a"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T22:40:29.629531Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:24:40.184347Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.27289/integrity.json","findings":[],"snapshot_sha256":"6d5d0078ed0c11713ddcc5eaeef1371dda7d01a4fba2321219ad5303fb9e10ba","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present five results in the theory of structural governance for cognitive workflow systems. Three are mechanized in Coq 8.19 using the Interaction Trees library with parameterized coinduction; two are proved on paper with explicit reductions. The Coinductive Safety Predicate (gov_safe) is a coinductive property that captures governance safety for infinite program behaviors, indexed by a boolean permission flag that is provably false for ungoverned I/O and true for governed interpretations (mechanized). The Governance Invariance Theorem establishes that governance is uniform across the meta-","authors_text":"Alan L. McCann","cross_cats":[],"headline":"Four atomic primitives suffice to express and govern any discrete intelligent system, as shown by machine-checked theorems.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-04-30T01:03:15Z","title":"Mechanized Foundations of Structural Governance: Machine-Checked Proofs for Governed Intelligence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.27289","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-07T09:50:14.543580Z","id":"3ab36a6f-8dd7-40c8-be4c-9844d0573c6d","model_set":{"reader":"grok-4.3"},"one_line_summary":"Coq-mechanized proofs establish a coinductive governance safety predicate, invariance across recursion levels, sufficiency of four primitives for any discrete intelligent system, necessity of semantic judgment via Rice's theorem, and a verified BEAM interpreter spec with zero disagreements on 70k+随机","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Four atomic primitives suffice to express and govern any discrete intelligent system, as shown by machine-checked theorems.","strongest_claim":"The Sufficiency Theorem proves that four atomic primitives (code, reason, memory, call) are expressively complete for any discrete intelligent system, formalized as compositional closure of a Kleisli category (mechanized).","weakest_assumption":"That the four primitives suffice for any discrete intelligent system and that property-based testing on 70,000 random directive sequences is sufficient to validate the BEAM runtime specification against all possible behaviors."}},"verdict_id":"3ab36a6f-8dd7-40c8-be4c-9844d0573c6d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c08b26f2bee7def3df8ca08fc3da96b2a323f736e4eaca04a7a8d9589a866b34","target":"record","created_at":"2026-05-27T01:05:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b73d15f2d08ce2df982f94785ab8d39ba537d8a104d458679b5686189f385999","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-04-30T01:03:15Z","title_canon_sha256":"91017f3675b73634b69786d893554d7ebda280c9f9994f10d4755bd1c305f732"},"schema_version":"1.0","source":{"id":"2604.27289","kind":"arxiv","version":3}},"canonical_sha256":"75373a6b274cb38e115672c708f4872d97e2b06344943153c583a34ef4123f7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75373a6b274cb38e115672c708f4872d97e2b06344943153c583a34ef4123f7c","first_computed_at":"2026-05-27T01:05:55.254802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:05:55.254802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3eWFNpS4QU6vJiMqwvRZ8KM4MDXPLXlInzHBvGBc6GafCmWVvZwf/5GX//KL3LXeSzKdadfBhQ+o08tR8howAg==","signature_status":"signed_v1","signed_at":"2026-05-27T01:05:55.255767Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.27289","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c08b26f2bee7def3df8ca08fc3da96b2a323f736e4eaca04a7a8d9589a866b34","sha256:e34aa2fc494cfd02bb6bac9f9d1e175f7d3f6a4c2f6db6e7d582f7751c36dd91"],"state_sha256":"50a2645e99d036fc8070b67a1b5973537d1c059337567ee5c7cbf000e4a930d6"}