{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ARN4Z42D4YVVXJTDCFV7GUCALJ","short_pith_number":"pith:ARN4Z42D","canonical_record":{"source":{"id":"2605.15732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T08:35:38Z","cross_cats_sorted":[],"title_canon_sha256":"01a9ed4835be30fde68a46d72c135f4046dd0b3ee249d19176d369432905972f","abstract_canon_sha256":"6f19037c87f85b99b1d833317fdf89cceb72db3003dea8e2d9d318628d1ec951"},"schema_version":"1.0"},"canonical_sha256":"045bccf343e62b5ba663116bf350405a6b8f13b793542becc276ec92a5b33a6b","source":{"kind":"arxiv","id":"2605.15732","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15732","created_at":"2026-05-20T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15732v1","created_at":"2026-05-20T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15732","created_at":"2026-05-20T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"ARN4Z42D4YVV","created_at":"2026-05-20T00:01:15Z"},{"alias_kind":"pith_short_16","alias_value":"ARN4Z42D4YVVXJTD","created_at":"2026-05-20T00:01:15Z"},{"alias_kind":"pith_short_8","alias_value":"ARN4Z42D","created_at":"2026-05-20T00:01:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ARN4Z42D4YVVXJTDCFV7GUCALJ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T08:35:38Z","cross_cats_sorted":[],"title_canon_sha256":"01a9ed4835be30fde68a46d72c135f4046dd0b3ee249d19176d369432905972f","abstract_canon_sha256":"6f19037c87f85b99b1d833317fdf89cceb72db3003dea8e2d9d318628d1ec951"},"schema_version":"1.0"},"canonical_sha256":"045bccf343e62b5ba663116bf350405a6b8f13b793542becc276ec92a5b33a6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:15.340912Z","signature_b64":"uVvkgC+xI+9Um9Ld4L0qMFrcsJEBl/0AFsv5B9xTA3p1vV95rl2GSyvbh+85g6JxuC6ruPgMuD8hVL11uCUfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"045bccf343e62b5ba663116bf350405a6b8f13b793542becc276ec92a5b33a6b","last_reissued_at":"2026-05-20T00:01:15.339971Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:15.339971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15732","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:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"732Q47c7ktqNFPj7ddCDw2Wgd0jtAO4Zz49BVgHrHZXQoIZtWu72OBph78+ivl9RKYwDwUMXe1T7UnebtK5yDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:11:47.647515Z"},"content_sha256":"0e49218bd71e0629f217568bbd942cd5214ff9353d448917866cae2f2731ac7d","schema_version":"1.0","event_id":"sha256:0e49218bd71e0629f217568bbd942cd5214ff9353d448917866cae2f2731ac7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ARN4Z42D4YVVXJTDCFV7GUCALJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cut-Elimination for the Bimodal Logic GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A hypersequent calculus for the bimodal logic GR admits cut-elimination.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hirohiko Kushida","submitted_at":"2026-05-15T08:35:38Z","abstract_excerpt":"In this paper, we present a hypersequent calculus for bimodal logic GR, where the two modalities represent the arithmetic provability predicates of Goedel and Rosser, respectively. We prove the cut-elimination theorem for the calculus."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present a hypersequent calculus for bimodal logic GR, where the two modalities represent the arithmetic provability predicates of Gödel and Rosser, respectively. We prove the cut-elimination theorem for the calculus.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The specific hypersequent rules correctly capture the axioms and semantics of the bimodal logic GR without introducing extraneous theorems or failing to derive the intended provability statements.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A hypersequent calculus for bimodal logic GR is presented and proven to satisfy cut-elimination.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A hypersequent calculus for the bimodal logic GR admits cut-elimination.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5bce2ed40f3ed1df7efc0a834af49e24b1d5e8a07e061a565615a19f1d3a497c"},"source":{"id":"2605.15732","kind":"arxiv","version":1},"verdict":{"id":"74b6fa9c-2847-4ff3-b34f-032fc412131b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:03:59.400725Z","strongest_claim":"We present a hypersequent calculus for bimodal logic GR, where the two modalities represent the arithmetic provability predicates of Gödel and Rosser, respectively. We prove the cut-elimination theorem for the calculus.","one_line_summary":"A hypersequent calculus for bimodal logic GR is presented and proven to satisfy cut-elimination.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The specific hypersequent rules correctly capture the axioms and semantics of the bimodal logic GR without introducing extraneous theorems or failing to derive the intended provability statements.","pith_extraction_headline":"A hypersequent calculus for the bimodal logic GR admits cut-elimination."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15732/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:25.144185Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:19.114837Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:12:36.438583Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.991423Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"34aae8575bfef54ba8d11e07bce44afb0edaccfaaf699331fdb9a66b62293bb5"},"references":{"count":18,"sample":[{"doi":"","year":2002,"title":"S.N. Artemov and L.D. Beklemishev, PROVABILITY LOGIC, Handbook of Philosophical Logic, D. Gabbay and F. Guenthner (eds.), Volume 10, pp. 189-360, 2002, Kluwer Academic Publishers","work_id":"5c40e7e2-122a-4c18-af4d-051d70fc0e66","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1993,"title":"Boolos,The Logic of Provability, Cambridge University Press, 1993","work_id":"50ef34fd-d2cf-4efa-8cc2-efee36370545","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"Buss, An Introduction to Proof Theory.Handbook of Proof Theory, Elsevier Science, pp","work_id":"9aa91f18-2fda-4935-8de5-78dfb1142058","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1979,"title":"D. Guaspari, and R. M. Solovay, Rosser sentences,Annals of Mathematical Logic, vol. 16 (1979), pp. 81-99","work_id":"7d87e2cb-77d3-4ed1-ae99-03c837b63976","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1017/s1755020325000036","year":2025,"title":"R. Kashima, T. Kurahashi, S. Iwata, and S. Morioka, Cut-free Sequent Calculi for the Provability Logic D,The Review of Symbolic Logic.Published online 2025:1-22. doi:10.1017/S1755020325000036 42","work_id":"eb9c0bcc-a141-4182-bfe8-1edb6a0545b3","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":18,"snapshot_sha256":"f15788c5e3cddd187e0cb62620ec269ae92ae6468ce73bd0b9c7a69aa4e85ba4","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"2af29840b7f303fca88d8058164389de17529b5c17d8ff49e4a888d23c8cd21c"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"74b6fa9c-2847-4ff3-b34f-032fc412131b"},"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:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59EqcR0hkhVoTLI34k1oSuc1DMbajt5UgYnaptA/jqKUDzSsu7kgio9MHgFKEpflehAdJykv6+e5xg9rydo0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:11:47.648729Z"},"content_sha256":"4cec9919dadff055936d6f1254b90207e8286a65d0dddbc3bf7b4913a81552ae","schema_version":"1.0","event_id":"sha256:4cec9919dadff055936d6f1254b90207e8286a65d0dddbc3bf7b4913a81552ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ARN4Z42D4YVVXJTDCFV7GUCALJ/bundle.json","state_url":"https://pith.science/pith/ARN4Z42D4YVVXJTDCFV7GUCALJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ARN4Z42D4YVVXJTDCFV7GUCALJ/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-06-10T04:11:47Z","links":{"resolver":"https://pith.science/pith/ARN4Z42D4YVVXJTDCFV7GUCALJ","bundle":"https://pith.science/pith/ARN4Z42D4YVVXJTDCFV7GUCALJ/bundle.json","state":"https://pith.science/pith/ARN4Z42D4YVVXJTDCFV7GUCALJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ARN4Z42D4YVVXJTDCFV7GUCALJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ARN4Z42D4YVVXJTDCFV7GUCALJ","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":"6f19037c87f85b99b1d833317fdf89cceb72db3003dea8e2d9d318628d1ec951","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T08:35:38Z","title_canon_sha256":"01a9ed4835be30fde68a46d72c135f4046dd0b3ee249d19176d369432905972f"},"schema_version":"1.0","source":{"id":"2605.15732","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15732","created_at":"2026-05-20T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15732v1","created_at":"2026-05-20T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15732","created_at":"2026-05-20T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"ARN4Z42D4YVV","created_at":"2026-05-20T00:01:15Z"},{"alias_kind":"pith_short_16","alias_value":"ARN4Z42D4YVVXJTD","created_at":"2026-05-20T00:01:15Z"},{"alias_kind":"pith_short_8","alias_value":"ARN4Z42D","created_at":"2026-05-20T00:01:15Z"}],"graph_snapshots":[{"event_id":"sha256:4cec9919dadff055936d6f1254b90207e8286a65d0dddbc3bf7b4913a81552ae","target":"graph","created_at":"2026-05-20T00:01:15Z","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 present a hypersequent calculus for bimodal logic GR, where the two modalities represent the arithmetic provability predicates of Gödel and Rosser, respectively. We prove the cut-elimination theorem for the calculus."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The specific hypersequent rules correctly capture the axioms and semantics of the bimodal logic GR without introducing extraneous theorems or failing to derive the intended provability statements."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A hypersequent calculus for bimodal logic GR is presented and proven to satisfy cut-elimination."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A hypersequent calculus for the bimodal logic GR admits cut-elimination."}],"snapshot_sha256":"5bce2ed40f3ed1df7efc0a834af49e24b1d5e8a07e061a565615a19f1d3a497c"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"2af29840b7f303fca88d8058164389de17529b5c17d8ff49e4a888d23c8cd21c"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:25.144185Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:19.114837Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:12:36.438583Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.991423Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15732/integrity.json","findings":[],"snapshot_sha256":"34aae8575bfef54ba8d11e07bce44afb0edaccfaaf699331fdb9a66b62293bb5","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we present a hypersequent calculus for bimodal logic GR, where the two modalities represent the arithmetic provability predicates of Goedel and Rosser, respectively. We prove the cut-elimination theorem for the calculus.","authors_text":"Hirohiko Kushida","cross_cats":[],"headline":"A hypersequent calculus for the bimodal logic GR admits cut-elimination.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T08:35:38Z","title":"Cut-Elimination for the Bimodal Logic GR"},"references":{"count":18,"internal_anchors":0,"resolved_work":18,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"S.N. Artemov and L.D. Beklemishev, PROVABILITY LOGIC, Handbook of Philosophical Logic, D. Gabbay and F. Guenthner (eds.), Volume 10, pp. 189-360, 2002, Kluwer Academic Publishers","work_id":"5c40e7e2-122a-4c18-af4d-051d70fc0e66","year":2002},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Boolos,The Logic of Provability, Cambridge University Press, 1993","work_id":"50ef34fd-d2cf-4efa-8cc2-efee36370545","year":1993},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Buss, An Introduction to Proof Theory.Handbook of Proof Theory, Elsevier Science, pp","work_id":"9aa91f18-2fda-4935-8de5-78dfb1142058","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"D. Guaspari, and R. M. Solovay, Rosser sentences,Annals of Mathematical Logic, vol. 16 (1979), pp. 81-99","work_id":"7d87e2cb-77d3-4ed1-ae99-03c837b63976","year":1979},{"cited_arxiv_id":"","doi":"10.1017/s1755020325000036","is_internal_anchor":false,"ref_index":5,"title":"R. Kashima, T. Kurahashi, S. Iwata, and S. Morioka, Cut-free Sequent Calculi for the Provability Logic D,The Review of Symbolic Logic.Published online 2025:1-22. doi:10.1017/S1755020325000036 42","work_id":"eb9c0bcc-a141-4182-bfe8-1edb6a0545b3","year":2025}],"snapshot_sha256":"f15788c5e3cddd187e0cb62620ec269ae92ae6468ce73bd0b9c7a69aa4e85ba4"},"source":{"id":"2605.15732","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:03:59.400725Z","id":"74b6fa9c-2847-4ff3-b34f-032fc412131b","model_set":{"reader":"grok-4.3"},"one_line_summary":"A hypersequent calculus for bimodal logic GR is presented and proven to satisfy cut-elimination.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A hypersequent calculus for the bimodal logic GR admits cut-elimination.","strongest_claim":"We present a hypersequent calculus for bimodal logic GR, where the two modalities represent the arithmetic provability predicates of Gödel and Rosser, respectively. We prove the cut-elimination theorem for the calculus.","weakest_assumption":"The specific hypersequent rules correctly capture the axioms and semantics of the bimodal logic GR without introducing extraneous theorems or failing to derive the intended provability statements."}},"verdict_id":"74b6fa9c-2847-4ff3-b34f-032fc412131b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0e49218bd71e0629f217568bbd942cd5214ff9353d448917866cae2f2731ac7d","target":"record","created_at":"2026-05-20T00:01:15Z","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":"6f19037c87f85b99b1d833317fdf89cceb72db3003dea8e2d9d318628d1ec951","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T08:35:38Z","title_canon_sha256":"01a9ed4835be30fde68a46d72c135f4046dd0b3ee249d19176d369432905972f"},"schema_version":"1.0","source":{"id":"2605.15732","kind":"arxiv","version":1}},"canonical_sha256":"045bccf343e62b5ba663116bf350405a6b8f13b793542becc276ec92a5b33a6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"045bccf343e62b5ba663116bf350405a6b8f13b793542becc276ec92a5b33a6b","first_computed_at":"2026-05-20T00:01:15.339971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:15.339971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uVvkgC+xI+9Um9Ld4L0qMFrcsJEBl/0AFsv5B9xTA3p1vV95rl2GSyvbh+85g6JxuC6ruPgMuD8hVL11uCUfBA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:15.340912Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15732","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e49218bd71e0629f217568bbd942cd5214ff9353d448917866cae2f2731ac7d","sha256:4cec9919dadff055936d6f1254b90207e8286a65d0dddbc3bf7b4913a81552ae"],"state_sha256":"7ca3f3171dfb1fe9555fc7b4ae502bfdb741b8f5f19a364b7b498a2fac5fec39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQ0gbDs16Zx/HFwDRLPVVfCSINdIwMhsLYyhSkDUu5CK3CpSr6B1jc9cQkfrpkMUFN1aakiT5SAXOrZXx4rnCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T04:11:47.654136Z","bundle_sha256":"6a5c79078c7fedcb9c38a4d6b71e78ff948df0cbbd5dac386e448f38690c19f5"}}