{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SSWLMT43QJITZXPML7UNPCWYSI","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":"fe36b174680d6d3993a92d5ea1205eabb081b1413ff60e835e3b43a679c155f9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-04-30T01:12:32Z","title_canon_sha256":"30ac9e817b2737bcab548dc167b73f2d4802ca394d4c2b780bad83abc3811bb8"},"schema_version":"1.0","source":{"id":"2604.27292","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.27292","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"2604.27292v3","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.27292","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"SSWLMT43QJIT","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"pith_short_16","alias_value":"SSWLMT43QJITZXPM","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"pith_short_8","alias_value":"SSWLMT43","created_at":"2026-05-27T01:05:55Z"}],"graph_snapshots":[{"event_id":"sha256:04be4ad2571103b907d966b2c657a0c0019a76f315b31da01763456e42f11be7","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":"Rice's theorem (1953) proves the gap is undecidable in the general case for any Turing-complete architecture that attempts to govern effects behaviorally: no algorithm can decide non-trivial semantic properties of arbitrary programs, including the property 'this program's effects comply with the governance policy.' We propose coterminous governance as the testable criterion for any AI governance system: either the two boundaries are provably identical, or risk and theater are structurally inevitable."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That deployed AI systems attempting behavioral governance of effects can be accurately modeled as arbitrary Turing-complete programs whose semantic properties must be decided post-hoc, and that separating computation from effect is both feasible and sufficient to achieve coterminous boundaries in practice."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Behavioral governance of AI effects is undecidable for Turing-complete architectures, making coterminous boundaries via computation-effect separation the only structural solution rather than post-hoc layers."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"AI systems governing effects must make their capability boundary identical to the governance boundary or else risk and theater are inevitable."}],"snapshot_sha256":"38cb018f586a20cf3ba181581333e67c1523aa006bacdecb45a4d726c141fc07"},"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:24.963037Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:24:36.517530Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.27292/integrity.json","findings":[],"snapshot_sha256":"eba4f51ee62e804a00aa0fdf97f342d0a71f061709795296d19850e6508f7a92","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Every system that performs effects has two boundaries: what it can do (expressiveness) and what governance covers (governance). In nearly all deployed AI systems, these boundaries are defined independently, creating three regions: governed capabilities (the only useful region), ungoverned capabilities (risk), and governance policies that address non-existent capabilities (theater). Two of the three regions are failure modes. We focus on the governance of effects: actions that AI systems perform in the world (API calls, database writes, tool invocations). This is distinct from the governance of","authors_text":"Alan L. McCann","cross_cats":[],"headline":"AI systems governing effects must make their capability boundary identical to the governance boundary or else risk and theater are inevitable.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-04-30T01:12:32Z","title":"The Two Boundaries: Why Behavioral AI Governance Fails Structurally"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.27292","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-07T09:36:34.786156Z","id":"a5ed5d72-5c58-40cd-9b74-b96ded340145","model_set":{"reader":"grok-4.3"},"one_line_summary":"Behavioral governance of AI effects is undecidable for Turing-complete architectures, making coterminous boundaries via computation-effect separation the only structural solution rather than post-hoc layers.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"AI systems governing effects must make their capability boundary identical to the governance boundary or else risk and theater are inevitable.","strongest_claim":"Rice's theorem (1953) proves the gap is undecidable in the general case for any Turing-complete architecture that attempts to govern effects behaviorally: no algorithm can decide non-trivial semantic properties of arbitrary programs, including the property 'this program's effects comply with the governance policy.' We propose coterminous governance as the testable criterion for any AI governance system: either the two boundaries are provably identical, or risk and theater are structurally inevitable.","weakest_assumption":"That deployed AI systems attempting behavioral governance of effects can be accurately modeled as arbitrary Turing-complete programs whose semantic properties must be decided post-hoc, and that separating computation from effect is both feasible and sufficient to achieve coterminous boundaries in practice."}},"verdict_id":"a5ed5d72-5c58-40cd-9b74-b96ded340145"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:786ee944be4cc24ab2f0e249f77e134d21b6cf6f6c424d1055042a34748006ee","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":"fe36b174680d6d3993a92d5ea1205eabb081b1413ff60e835e3b43a679c155f9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-04-30T01:12:32Z","title_canon_sha256":"30ac9e817b2737bcab548dc167b73f2d4802ca394d4c2b780bad83abc3811bb8"},"schema_version":"1.0","source":{"id":"2604.27292","kind":"arxiv","version":3}},"canonical_sha256":"94acb64f9b82513cddec5fe8d78ad89220a81949cd11307baa9d9682dfc00904","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94acb64f9b82513cddec5fe8d78ad89220a81949cd11307baa9d9682dfc00904","first_computed_at":"2026-05-27T01:05:55.280121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:05:55.280121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mwVKnX6tibhA+o1rac6a50BDhxq/kk0D3jyD8sSDxxw6a4tCtdsEjYTyj+i6/XzhLPaK0pQSIVYrSJZZxFnqDw==","signature_status":"signed_v1","signed_at":"2026-05-27T01:05:55.280672Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.27292","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:786ee944be4cc24ab2f0e249f77e134d21b6cf6f6c424d1055042a34748006ee","sha256:04be4ad2571103b907d966b2c657a0c0019a76f315b31da01763456e42f11be7"],"state_sha256":"d59e26dbdba2d7d14eaa716f3929031cd6a5074f5330ab77b38b6bf5b705fb10"}