{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OLQ2BQE55AJ7CBCHFPTB2UOB7S","short_pith_number":"pith:OLQ2BQE5","canonical_record":{"source":{"id":"2605.16157","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T16:38:04Z","cross_cats_sorted":[],"title_canon_sha256":"0ec7ed869a40f9e2027dcdc21bcdc42b77db11b4d644bdc03fe35fa5d1438dd5","abstract_canon_sha256":"d9010e334e547c054c7aa9e489f852e36ec6b5658a8a8b85e6c9908b5f2307f7"},"schema_version":"1.0"},"canonical_sha256":"72e1a0c09de813f104472be61d51c1fca0febcae82be30e2f6eda4214cf5bf4d","source":{"kind":"arxiv","id":"2605.16157","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16157","created_at":"2026-05-20T00:01:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16157v1","created_at":"2026-05-20T00:01:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16157","created_at":"2026-05-20T00:01:55Z"},{"alias_kind":"pith_short_12","alias_value":"OLQ2BQE55AJ7","created_at":"2026-05-20T00:01:55Z"},{"alias_kind":"pith_short_16","alias_value":"OLQ2BQE55AJ7CBCH","created_at":"2026-05-20T00:01:55Z"},{"alias_kind":"pith_short_8","alias_value":"OLQ2BQE5","created_at":"2026-05-20T00:01:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OLQ2BQE55AJ7CBCHFPTB2UOB7S","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16157","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T16:38:04Z","cross_cats_sorted":[],"title_canon_sha256":"0ec7ed869a40f9e2027dcdc21bcdc42b77db11b4d644bdc03fe35fa5d1438dd5","abstract_canon_sha256":"d9010e334e547c054c7aa9e489f852e36ec6b5658a8a8b85e6c9908b5f2307f7"},"schema_version":"1.0"},"canonical_sha256":"72e1a0c09de813f104472be61d51c1fca0febcae82be30e2f6eda4214cf5bf4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:55.414131Z","signature_b64":"eA9qar+MRFoBcxa9f7CzH0LOQGosaFCiulAtne2Y5SqFPgGJxW6+g5aTL7sSo0oeN+w9zK6mmP+gKFtAH6v9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72e1a0c09de813f104472be61d51c1fca0febcae82be30e2f6eda4214cf5bf4d","last_reissued_at":"2026-05-20T00:01:55.413195Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:55.413195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16157","source_version":1,"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-20T00:01:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gNpoWxCcsj5koI9/tP/hL+d04rpoXgNjXQ82/FQyOOs8Ze59KbAQlvf30NbfmYatiSe7qOcqdxqvGZTEgsMjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:44.481968Z"},"content_sha256":"9846b383aa5493e0cc6f80ded37286475d2a4bac16d3698b5641f21887ff6f1a","schema_version":"1.0","event_id":"sha256:9846b383aa5493e0cc6f80ded37286475d2a4bac16d3698b5641f21887ff6f1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OLQ2BQE55AJ7CBCHFPTB2UOB7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verifiers and Generators: Epistemic Semantics for Intuitionistic Logic (Long Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Epistemic realizability interpretations using verifiers and generators are sound and complete for minimal, second-order, and higher-order intuitionistic logic.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Pablo Barenbaum","submitted_at":"2026-05-15T16:38:04Z","abstract_excerpt":"This paper explores epistemic realizability, a form of realizability in which the property that a piece of data constitutes evidence for a logical proposition is semi-decidable. In this framework, each proposition A is assigned a verifier} program that checks whether a datum X is a realizer for A, and a dual generator program that behaves as a generic realizer for X. We propose epistemic realizability interpretations for minimal logic, second-order intuitionistic logic, and higher-order intuitionistic logic, proving that each system is sound and complete under the proposed semantics."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose epistemic realizability interpretations for minimal logic, second-order intuitionistic logic, and higher-order intuitionistic logic, proving that each system is sound and complete under the proposed semantics.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The framework assumes that the property of a datum constituting evidence for a proposition is semi-decidable, which permits the definition of verifier and generator programs that faithfully capture the epistemic content of the logic.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Epistemic realizability assigns verifier and generator programs to propositions and proves soundness and completeness for minimal, second-order, and higher-order intuitionistic logic.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Epistemic realizability interpretations using verifiers and generators are sound and complete for minimal, second-order, and higher-order intuitionistic logic.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8975028fffd4932f907d9132bf80d9ae6fdc5feca9e51629a822c57301c589da"},"source":{"id":"2605.16157","kind":"arxiv","version":1},"verdict":{"id":"2de8b279-a706-4572-8b30-719ebb8b62e6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:42:51.243818Z","strongest_claim":"We propose epistemic realizability interpretations for minimal logic, second-order intuitionistic logic, and higher-order intuitionistic logic, proving that each system is sound and complete under the proposed semantics.","one_line_summary":"Epistemic realizability assigns verifier and generator programs to propositions and proves soundness and completeness for minimal, second-order, and higher-order intuitionistic logic.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The framework assumes that the property of a datum constituting evidence for a proposition is semi-decidable, which permits the definition of verifier and generator programs that faithfully capture the epistemic content of the logic.","pith_extraction_headline":"Epistemic realizability interpretations using verifiers and generators are sound and complete for minimal, second-order, and higher-order intuitionistic logic."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16157/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:18.933489Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:51:32.550628Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T18:22:02.200807Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:31.039052Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T17:31:48.626293Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.440123Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"27cc26ae1808c663269eadceb613743399a30a8f0b5be172d005550d2a073553"},"references":{"count":146,"sample":[{"doi":"","year":2018,"title":"Steve Awodey, Jonas Frey, and Sam Speight. 2018. Impredicative encodings of (higher) inductive types. InProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. 76–85","work_id":"8a940f2f-578f-4890-892c-cb2731ea4804","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"1999.Term Rewriting and All That","work_id":"47b44c57-5410-42c8-a498-2d2b65b3bd99","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1984,"title":"1984.The Lambda Calculus: Its Syntax and Semantics","work_id":"99b9859e-94cb-4128-9c18-f87f143502b0","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1991,"title":"Henk Barendregt. 1991. Introduction to generalized type systems.Journal of Functional Programming1, 2 (1991), 125–154","work_id":"b047fea2-8c05-419a-b103-b9dbe33661c5","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"2013.Lambda Calculus with Types","work_id":"abfc0a04-44dd-4c15-9ea4-6c2382274643","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":146,"snapshot_sha256":"c28434c17f9d21011e7bb378fa8b605784f00c11f91671722d40cfadc473c0ca","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":"2de8b279-a706-4572-8b30-719ebb8b62e6"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xphFQJR/LNjZ7pO2FmsX+K4+TZJukJDhjsgpjCOhF4WnazbvepGaqSmMDAkgKWD4DK/SmCU8nbTegoSRKHPnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:44.483385Z"},"content_sha256":"06a9a840fb710afd89215ce782ff74a7fdd8da8f1505b57df395d2a2a84fb013","schema_version":"1.0","event_id":"sha256:06a9a840fb710afd89215ce782ff74a7fdd8da8f1505b57df395d2a2a84fb013"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S/bundle.json","state_url":"https://pith.science/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S/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-30T20:03:44Z","links":{"resolver":"https://pith.science/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S","bundle":"https://pith.science/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S/bundle.json","state":"https://pith.science/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OLQ2BQE55AJ7CBCHFPTB2UOB7S","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":"d9010e334e547c054c7aa9e489f852e36ec6b5658a8a8b85e6c9908b5f2307f7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T16:38:04Z","title_canon_sha256":"0ec7ed869a40f9e2027dcdc21bcdc42b77db11b4d644bdc03fe35fa5d1438dd5"},"schema_version":"1.0","source":{"id":"2605.16157","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16157","created_at":"2026-05-20T00:01:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16157v1","created_at":"2026-05-20T00:01:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16157","created_at":"2026-05-20T00:01:55Z"},{"alias_kind":"pith_short_12","alias_value":"OLQ2BQE55AJ7","created_at":"2026-05-20T00:01:55Z"},{"alias_kind":"pith_short_16","alias_value":"OLQ2BQE55AJ7CBCH","created_at":"2026-05-20T00:01:55Z"},{"alias_kind":"pith_short_8","alias_value":"OLQ2BQE5","created_at":"2026-05-20T00:01:55Z"}],"graph_snapshots":[{"event_id":"sha256:06a9a840fb710afd89215ce782ff74a7fdd8da8f1505b57df395d2a2a84fb013","target":"graph","created_at":"2026-05-20T00:01: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":"We propose epistemic realizability interpretations for minimal logic, second-order intuitionistic logic, and higher-order intuitionistic logic, proving that each system is sound and complete under the proposed semantics."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The framework assumes that the property of a datum constituting evidence for a proposition is semi-decidable, which permits the definition of verifier and generator programs that faithfully capture the epistemic content of the logic."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Epistemic realizability assigns verifier and generator programs to propositions and proves soundness and completeness for minimal, second-order, and higher-order intuitionistic logic."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Epistemic realizability interpretations using verifiers and generators are sound and complete for minimal, second-order, and higher-order intuitionistic logic."}],"snapshot_sha256":"8975028fffd4932f907d9132bf80d9ae6fdc5feca9e51629a822c57301c589da"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:18.933489Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T18:51:32.550628Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T18:22:02.200807Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:31.039052Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"external_links","ran_at":"2026-05-19T17:31:48.626293Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.440123Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.16157/integrity.json","findings":[],"snapshot_sha256":"27cc26ae1808c663269eadceb613743399a30a8f0b5be172d005550d2a073553","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper explores epistemic realizability, a form of realizability in which the property that a piece of data constitutes evidence for a logical proposition is semi-decidable. In this framework, each proposition A is assigned a verifier} program that checks whether a datum X is a realizer for A, and a dual generator program that behaves as a generic realizer for X. We propose epistemic realizability interpretations for minimal logic, second-order intuitionistic logic, and higher-order intuitionistic logic, proving that each system is sound and complete under the proposed semantics.","authors_text":"Pablo Barenbaum","cross_cats":[],"headline":"Epistemic realizability interpretations using verifiers and generators are sound and complete for minimal, second-order, and higher-order intuitionistic logic.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T16:38:04Z","title":"Verifiers and Generators: Epistemic Semantics for Intuitionistic Logic (Long Version)"},"references":{"count":146,"internal_anchors":0,"resolved_work":146,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Steve Awodey, Jonas Frey, and Sam Speight. 2018. Impredicative encodings of (higher) inductive types. InProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. 76–85","work_id":"8a940f2f-578f-4890-892c-cb2731ea4804","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"1999.Term Rewriting and All That","work_id":"47b44c57-5410-42c8-a498-2d2b65b3bd99","year":1999},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"1984.The Lambda Calculus: Its Syntax and Semantics","work_id":"99b9859e-94cb-4128-9c18-f87f143502b0","year":1984},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Henk Barendregt. 1991. Introduction to generalized type systems.Journal of Functional Programming1, 2 (1991), 125–154","work_id":"b047fea2-8c05-419a-b103-b9dbe33661c5","year":1991},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"2013.Lambda Calculus with Types","work_id":"abfc0a04-44dd-4c15-9ea4-6c2382274643","year":2013}],"snapshot_sha256":"c28434c17f9d21011e7bb378fa8b605784f00c11f91671722d40cfadc473c0ca"},"source":{"id":"2605.16157","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:42:51.243818Z","id":"2de8b279-a706-4572-8b30-719ebb8b62e6","model_set":{"reader":"grok-4.3"},"one_line_summary":"Epistemic realizability assigns verifier and generator programs to propositions and proves soundness and completeness for minimal, second-order, and higher-order intuitionistic logic.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Epistemic realizability interpretations using verifiers and generators are sound and complete for minimal, second-order, and higher-order intuitionistic logic.","strongest_claim":"We propose epistemic realizability interpretations for minimal logic, second-order intuitionistic logic, and higher-order intuitionistic logic, proving that each system is sound and complete under the proposed semantics.","weakest_assumption":"The framework assumes that the property of a datum constituting evidence for a proposition is semi-decidable, which permits the definition of verifier and generator programs that faithfully capture the epistemic content of the logic."}},"verdict_id":"2de8b279-a706-4572-8b30-719ebb8b62e6"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9846b383aa5493e0cc6f80ded37286475d2a4bac16d3698b5641f21887ff6f1a","target":"record","created_at":"2026-05-20T00:01: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":"d9010e334e547c054c7aa9e489f852e36ec6b5658a8a8b85e6c9908b5f2307f7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T16:38:04Z","title_canon_sha256":"0ec7ed869a40f9e2027dcdc21bcdc42b77db11b4d644bdc03fe35fa5d1438dd5"},"schema_version":"1.0","source":{"id":"2605.16157","kind":"arxiv","version":1}},"canonical_sha256":"72e1a0c09de813f104472be61d51c1fca0febcae82be30e2f6eda4214cf5bf4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72e1a0c09de813f104472be61d51c1fca0febcae82be30e2f6eda4214cf5bf4d","first_computed_at":"2026-05-20T00:01:55.413195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:55.413195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eA9qar+MRFoBcxa9f7CzH0LOQGosaFCiulAtne2Y5SqFPgGJxW6+g5aTL7sSo0oeN+w9zK6mmP+gKFtAH6v9DA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:55.414131Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16157","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9846b383aa5493e0cc6f80ded37286475d2a4bac16d3698b5641f21887ff6f1a","sha256:06a9a840fb710afd89215ce782ff74a7fdd8da8f1505b57df395d2a2a84fb013"],"state_sha256":"0cb1945f46b4321f19f05e565f540988787ea908b4f7e9c64b1f7554d6f3f9c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOWfQbiUGjSAAKFBOytpaPDdHN+g9CM/rKqU2c8Ee0DvuCXXGhF9m3VyicCd/Bs+bZy4C10cfwbQAzYSM/L9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:03:44.489102Z","bundle_sha256":"05c02559b0ece1fab3ca873b16c23ba3747894f8d24fcc336627da034f37bc7c"}}