{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MWPN56BTMJAFJ4JQUUUH35EGFD","short_pith_number":"pith:MWPN56BT","canonical_record":{"source":{"id":"2605.01030","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-01T18:52:47Z","cross_cats_sorted":["cs.LO","cs.PL"],"title_canon_sha256":"e30a1dd55300f8b8a7790e84b87e40f416dd23a74626c5256542f415fafd1f7a","abstract_canon_sha256":"84fd25fb9e1fc013e5d1cc0c7f787b6b13dbece210d9bdfafdce437cf3427937"},"schema_version":"1.0"},"canonical_sha256":"659edef833624054f130a5287df48628ea033924e5f72d11418b636322208f83","source":{"kind":"arxiv","id":"2605.01030","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01030","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01030v3","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01030","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"MWPN56BTMJAF","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"pith_short_16","alias_value":"MWPN56BTMJAFJ4JQ","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"pith_short_8","alias_value":"MWPN56BT","created_at":"2026-05-27T01:05:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MWPN56BTMJAFJ4JQUUUH35EGFD","target":"record","payload":{"canonical_record":{"source":{"id":"2605.01030","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-01T18:52:47Z","cross_cats_sorted":["cs.LO","cs.PL"],"title_canon_sha256":"e30a1dd55300f8b8a7790e84b87e40f416dd23a74626c5256542f415fafd1f7a","abstract_canon_sha256":"84fd25fb9e1fc013e5d1cc0c7f787b6b13dbece210d9bdfafdce437cf3427937"},"schema_version":"1.0"},"canonical_sha256":"659edef833624054f130a5287df48628ea033924e5f72d11418b636322208f83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:55.522359Z","signature_b64":"qxn5jPs8RxGmiQWN11dZtIiqGRymtU/c7DQw0facXZ63rmp++C3bcFvf+DtLrSm9Ioq2+hp2OvorbJA0c6UYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"659edef833624054f130a5287df48628ea033924e5f72d11418b636322208f83","last_reissued_at":"2026-05-27T01:05:55.521775Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:55.521775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.01030","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":"a9cu2DP5voojviE8LC1AQmRrGNaq4dq5LFwZGAD3vG5UH2eFS9w7cZDw3LqKC/Xykg3dSFGIm9MVvVGU+exACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:23:29.127725Z"},"content_sha256":"f530edfbebb519d45cfe7868cf03a04afb9b06cf4fd56e82cc810e278520853a","schema_version":"1.0","event_id":"sha256:f530edfbebb519d45cfe7868cf03a04afb9b06cf4fd56e82cc810e278520853a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MWPN56BTMJAFJ4JQUUUH35EGFD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effect-Transparent Governance for AI Workflow Architectures: Semantic Preservation, Expressive Minimality, and Decidability Boundaries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Effect-level governance can be imposed on AI workflow architectures without reducing their internal computational expressivity or changing permitted behaviors.","cross_cats":["cs.LO","cs.PL"],"primary_cat":"cs.AI","authors_text":"Alan L. McCann","submitted_at":"2026-05-01T18:52:47Z","abstract_excerpt":"We present a machine-checked formalization of structurally governed AI workflow architectures and prove that effect-level governance can be imposed without reducing internal computational expressivity. Using Interaction Trees in Rocq 8.19, we define a governance operator G that mediates all effectful directives, including memory access, external calls, and oracle (LLM) queries. Our development compiles with 0 admitted lemmas and consists of 36 modules, ~12,000 lines of Rocq, and 454 theorems. We establishseven properties: (P1) governed Turing completeness, (P2) governed oracle expressivity, (P"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"effect-level governance can be imposed without reducing internal computational expressivity... semantic transparency: on all executions where governance permits, the governed interpretation is observationally equivalent (modulo governance-only events) to the ungoverned interpretation.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the Interaction Trees model with the defined governance operator G accurately captures all relevant effectful behaviors of real AI workflow architectures, including oracle queries, and that the operator mediates every effect without omission.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A Rocq formalization of 12,000 lines proves that effect governance in AI workflows preserves Turing completeness, expressivity, and observational equivalence to ungoverned executions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Effect-level governance can be imposed on AI workflow architectures without reducing their internal computational expressivity or changing permitted behaviors.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f2136930d91d3a6d13f20e9ffe2dd2fecf3d8d5a8fd38c4eb086d8c83342bfaa"},"source":{"id":"2605.01030","kind":"arxiv","version":3},"verdict":{"id":"94d1cfb4-2581-4696-9087-80271cc1dd65","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T19:22:44.790950Z","strongest_claim":"effect-level governance can be imposed without reducing internal computational expressivity... semantic transparency: on all executions where governance permits, the governed interpretation is observationally equivalent (modulo governance-only events) to the ungoverned interpretation.","one_line_summary":"A Rocq formalization of 12,000 lines proves that effect governance in AI workflows preserves Turing completeness, expressivity, and observational equivalence to ungoverned executions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the Interaction Trees model with the defined governance operator G accurately captures all relevant effectful behaviors of real AI workflow architectures, including oracle queries, and that the operator mediates every effect without omission.","pith_extraction_headline":"Effect-level governance can be imposed on AI workflow architectures without reducing their internal computational expressivity or changing permitted behaviors."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.01030/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T18:39:34.390545Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T17:41:14.033347Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"2d4a486c8accd5dc52bfd3ec09d6cb9dd569396bffdf663614026274cc182da1"},"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":"94d1cfb4-2581-4696-9087-80271cc1dd65"},"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":"ouXfMjdeNL6v6WWNe2QUYh15+jGh6FrPHxwzeXglz+ri39W/85BukC9CJMvKxcIDhtqXIQuWlflMyRtpQKjPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:23:29.128218Z"},"content_sha256":"81b2db86171ae81296b73c9b11b06fe10ea398fdd4cb129703548bbfcf7dd952","schema_version":"1.0","event_id":"sha256:81b2db86171ae81296b73c9b11b06fe10ea398fdd4cb129703548bbfcf7dd952"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWPN56BTMJAFJ4JQUUUH35EGFD/bundle.json","state_url":"https://pith.science/pith/MWPN56BTMJAFJ4JQUUUH35EGFD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWPN56BTMJAFJ4JQUUUH35EGFD/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-31T10:23:29Z","links":{"resolver":"https://pith.science/pith/MWPN56BTMJAFJ4JQUUUH35EGFD","bundle":"https://pith.science/pith/MWPN56BTMJAFJ4JQUUUH35EGFD/bundle.json","state":"https://pith.science/pith/MWPN56BTMJAFJ4JQUUUH35EGFD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWPN56BTMJAFJ4JQUUUH35EGFD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MWPN56BTMJAFJ4JQUUUH35EGFD","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":"84fd25fb9e1fc013e5d1cc0c7f787b6b13dbece210d9bdfafdce437cf3427937","cross_cats_sorted":["cs.LO","cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-01T18:52:47Z","title_canon_sha256":"e30a1dd55300f8b8a7790e84b87e40f416dd23a74626c5256542f415fafd1f7a"},"schema_version":"1.0","source":{"id":"2605.01030","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01030","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01030v3","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01030","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"MWPN56BTMJAF","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"pith_short_16","alias_value":"MWPN56BTMJAFJ4JQ","created_at":"2026-05-27T01:05:55Z"},{"alias_kind":"pith_short_8","alias_value":"MWPN56BT","created_at":"2026-05-27T01:05:55Z"}],"graph_snapshots":[{"event_id":"sha256:81b2db86171ae81296b73c9b11b06fe10ea398fdd4cb129703548bbfcf7dd952","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":"effect-level governance can be imposed without reducing internal computational expressivity... semantic transparency: on all executions where governance permits, the governed interpretation is observationally equivalent (modulo governance-only events) to the ungoverned interpretation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the Interaction Trees model with the defined governance operator G accurately captures all relevant effectful behaviors of real AI workflow architectures, including oracle queries, and that the operator mediates every effect without omission."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A Rocq formalization of 12,000 lines proves that effect governance in AI workflows preserves Turing completeness, expressivity, and observational equivalence to ungoverned executions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Effect-level governance can be imposed on AI workflow architectures without reducing their internal computational expressivity or changing permitted behaviors."}],"snapshot_sha256":"f2136930d91d3a6d13f20e9ffe2dd2fecf3d8d5a8fd38c4eb086d8c83342bfaa"},"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-20T18:39:34.390545Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T17:41:14.033347Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.01030/integrity.json","findings":[],"snapshot_sha256":"2d4a486c8accd5dc52bfd3ec09d6cb9dd569396bffdf663614026274cc182da1","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a machine-checked formalization of structurally governed AI workflow architectures and prove that effect-level governance can be imposed without reducing internal computational expressivity. Using Interaction Trees in Rocq 8.19, we define a governance operator G that mediates all effectful directives, including memory access, external calls, and oracle (LLM) queries. Our development compiles with 0 admitted lemmas and consists of 36 modules, ~12,000 lines of Rocq, and 454 theorems. We establishseven properties: (P1) governed Turing completeness, (P2) governed oracle expressivity, (P","authors_text":"Alan L. McCann","cross_cats":["cs.LO","cs.PL"],"headline":"Effect-level governance can be imposed on AI workflow architectures without reducing their internal computational expressivity or changing permitted behaviors.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-01T18:52:47Z","title":"Effect-Transparent Governance for AI Workflow Architectures: Semantic Preservation, Expressive Minimality, and Decidability Boundaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.01030","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-09T19:22:44.790950Z","id":"94d1cfb4-2581-4696-9087-80271cc1dd65","model_set":{"reader":"grok-4.3"},"one_line_summary":"A Rocq formalization of 12,000 lines proves that effect governance in AI workflows preserves Turing completeness, expressivity, and observational equivalence to ungoverned executions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Effect-level governance can be imposed on AI workflow architectures without reducing their internal computational expressivity or changing permitted behaviors.","strongest_claim":"effect-level governance can be imposed without reducing internal computational expressivity... semantic transparency: on all executions where governance permits, the governed interpretation is observationally equivalent (modulo governance-only events) to the ungoverned interpretation.","weakest_assumption":"That the Interaction Trees model with the defined governance operator G accurately captures all relevant effectful behaviors of real AI workflow architectures, including oracle queries, and that the operator mediates every effect without omission."}},"verdict_id":"94d1cfb4-2581-4696-9087-80271cc1dd65"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f530edfbebb519d45cfe7868cf03a04afb9b06cf4fd56e82cc810e278520853a","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":"84fd25fb9e1fc013e5d1cc0c7f787b6b13dbece210d9bdfafdce437cf3427937","cross_cats_sorted":["cs.LO","cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-01T18:52:47Z","title_canon_sha256":"e30a1dd55300f8b8a7790e84b87e40f416dd23a74626c5256542f415fafd1f7a"},"schema_version":"1.0","source":{"id":"2605.01030","kind":"arxiv","version":3}},"canonical_sha256":"659edef833624054f130a5287df48628ea033924e5f72d11418b636322208f83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"659edef833624054f130a5287df48628ea033924e5f72d11418b636322208f83","first_computed_at":"2026-05-27T01:05:55.521775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:05:55.521775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qxn5jPs8RxGmiQWN11dZtIiqGRymtU/c7DQw0facXZ63rmp++C3bcFvf+DtLrSm9Ioq2+hp2OvorbJA0c6UYBQ==","signature_status":"signed_v1","signed_at":"2026-05-27T01:05:55.522359Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.01030","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f530edfbebb519d45cfe7868cf03a04afb9b06cf4fd56e82cc810e278520853a","sha256:81b2db86171ae81296b73c9b11b06fe10ea398fdd4cb129703548bbfcf7dd952"],"state_sha256":"b0f7e3c78a635ba5ae687243d8ae90cc5c44bb73e4df4558e85d960b349718b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cGk6B3bq9cSBg+dhlI2bR7urh76HpYhZ+FAVuycDFxs4sd2CwPriEiQZO3Z7m2Cj1MY+vbxkZdg/ZcHnz/IFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:23:29.130727Z","bundle_sha256":"9dca9ba8dd19258f0f2c7f4efd167de661f4e0b9130fad01097621d970119c99"}}