{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SSWLMT43QJITZXPML7UNPCWYSI","short_pith_number":"pith:SSWLMT43","canonical_record":{"source":{"id":"2604.27292","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-04-30T01:12:32Z","cross_cats_sorted":[],"title_canon_sha256":"30ac9e817b2737bcab548dc167b73f2d4802ca394d4c2b780bad83abc3811bb8","abstract_canon_sha256":"fe36b174680d6d3993a92d5ea1205eabb081b1413ff60e835e3b43a679c155f9"},"schema_version":"1.0"},"canonical_sha256":"94acb64f9b82513cddec5fe8d78ad89220a81949cd11307baa9d9682dfc00904","source":{"kind":"arxiv","id":"2604.27292","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SSWLMT43QJITZXPML7UNPCWYSI","target":"record","payload":{"canonical_record":{"source":{"id":"2604.27292","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-04-30T01:12:32Z","cross_cats_sorted":[],"title_canon_sha256":"30ac9e817b2737bcab548dc167b73f2d4802ca394d4c2b780bad83abc3811bb8","abstract_canon_sha256":"fe36b174680d6d3993a92d5ea1205eabb081b1413ff60e835e3b43a679c155f9"},"schema_version":"1.0"},"canonical_sha256":"94acb64f9b82513cddec5fe8d78ad89220a81949cd11307baa9d9682dfc00904","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:55.280672Z","signature_b64":"mwVKnX6tibhA+o1rac6a50BDhxq/kk0D3jyD8sSDxxw6a4tCtdsEjYTyj+i6/XzhLPaK0pQSIVYrSJZZxFnqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94acb64f9b82513cddec5fe8d78ad89220a81949cd11307baa9d9682dfc00904","last_reissued_at":"2026-05-27T01:05:55.280121Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:55.280121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.27292","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNjRCK7MTTFFYD3GcAh77uioV04/9dTaRcFHvPflullx3v0yabIBgwhosbyI8MV9Ynk7g6chy8Rs/+xzJpcFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:25:52.663050Z"},"content_sha256":"786ee944be4cc24ab2f0e249f77e134d21b6cf6f6c424d1055042a34748006ee","schema_version":"1.0","event_id":"sha256:786ee944be4cc24ab2f0e249f77e134d21b6cf6f6c424d1055042a34748006ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SSWLMT43QJITZXPML7UNPCWYSI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Two Boundaries: Why Behavioral AI Governance Fails Structurally","license":"http://creativecommons.org/licenses/by/4.0/","headline":"AI systems governing effects must make their capability boundary identical to the governance boundary or else risk and theater are inevitable.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alan L. McCann","submitted_at":"2026-04-30T01:12:32Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"AI systems governing effects must make their capability boundary identical to the governance boundary or else risk and theater are inevitable.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"38cb018f586a20cf3ba181581333e67c1523aa006bacdecb45a4d726c141fc07"},"source":{"id":"2604.27292","kind":"arxiv","version":3},"verdict":{"id":"a5ed5d72-5c58-40cd-9b74-b96ded340145","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T09:36:34.786156Z","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.","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","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.","pith_extraction_headline":"AI systems governing effects must make their capability boundary identical to the governance boundary or else risk and theater are inevitable."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.27292/integrity.json","findings":[],"available":true,"detectors_run":[{"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","findings_count":0}],"snapshot_sha256":"eba4f51ee62e804a00aa0fdf97f342d0a71f061709795296d19850e6508f7a92"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"a5ed5d72-5c58-40cd-9b74-b96ded340145"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1KXT4MRzNVo4i+gaa4dKVluDorFTHUU8AaRmYebX7WEC6yQxj2RCoxsHRQpLBEMQ7iaETFXcUHnmWUaU41NSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:25:52.664076Z"},"content_sha256":"04be4ad2571103b907d966b2c657a0c0019a76f315b31da01763456e42f11be7","schema_version":"1.0","event_id":"sha256:04be4ad2571103b907d966b2c657a0c0019a76f315b31da01763456e42f11be7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSWLMT43QJITZXPML7UNPCWYSI/bundle.json","state_url":"https://pith.science/pith/SSWLMT43QJITZXPML7UNPCWYSI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSWLMT43QJITZXPML7UNPCWYSI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T22:25:52Z","links":{"resolver":"https://pith.science/pith/SSWLMT43QJITZXPML7UNPCWYSI","bundle":"https://pith.science/pith/SSWLMT43QJITZXPML7UNPCWYSI/bundle.json","state":"https://pith.science/pith/SSWLMT43QJITZXPML7UNPCWYSI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSWLMT43QJITZXPML7UNPCWYSI/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYEsvmCdxsvsV+o11JZnPXtS5evzVRLKJ8IsMCXrOAGOzRiKJTcRjWK+t6i/kXBHocYYP10kE2xsJN6wad6ICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:25:52.668449Z","bundle_sha256":"d0a482dcca74cbe64ac25038ebdfe7e15640cedebc10a1bca7888b7f11741d65"}}