{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XTAJIPPF5EPBS73P54GUHMECMN","short_pith_number":"pith:XTAJIPPF","canonical_record":{"source":{"id":"2605.15344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T19:13:25Z","cross_cats_sorted":[],"title_canon_sha256":"be4e4ea61c171792e35c64ab1f5917188fa0ef2158da63ebad6cc3f012dfe430","abstract_canon_sha256":"59ba10e9cccac9b9a20e911298c098c97eb47a63a60333ab0873d236e112c97f"},"schema_version":"1.0"},"canonical_sha256":"bcc0943de5e91e197f6fef0d43b08263738856e8542c4aa0f89371812c8f4d87","source":{"kind":"arxiv","id":"2605.15344","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15344","created_at":"2026-05-20T00:00:53Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15344v1","created_at":"2026-05-20T00:00:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15344","created_at":"2026-05-20T00:00:53Z"},{"alias_kind":"pith_short_12","alias_value":"XTAJIPPF5EPB","created_at":"2026-05-20T00:00:53Z"},{"alias_kind":"pith_short_16","alias_value":"XTAJIPPF5EPBS73P","created_at":"2026-05-20T00:00:53Z"},{"alias_kind":"pith_short_8","alias_value":"XTAJIPPF","created_at":"2026-05-20T00:00:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XTAJIPPF5EPBS73P54GUHMECMN","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T19:13:25Z","cross_cats_sorted":[],"title_canon_sha256":"be4e4ea61c171792e35c64ab1f5917188fa0ef2158da63ebad6cc3f012dfe430","abstract_canon_sha256":"59ba10e9cccac9b9a20e911298c098c97eb47a63a60333ab0873d236e112c97f"},"schema_version":"1.0"},"canonical_sha256":"bcc0943de5e91e197f6fef0d43b08263738856e8542c4aa0f89371812c8f4d87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:53.557120Z","signature_b64":"dV2bQq8UJEKdc4+/hHviR+rvMl2uytwATJfnpedXs46cPbTNj2QJh9IMRvCHi7exXXBRS/pUb8VRVh3iqO2oCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcc0943de5e91e197f6fef0d43b08263738856e8542c4aa0f89371812c8f4d87","last_reissued_at":"2026-05-20T00:00:53.556262Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:53.556262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15344","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:00:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCS2gf7CTV5Z8t81htIEytFaJPy6mJbnJ5DKRrjj+YMuxnqQcvnuvHhB5YSeQ0MV4bmYBQEv83emwAbWjkrzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:55:14.590235Z"},"content_sha256":"82ea13eaafc6eb2bedf8830b598ce3d7d104bfd83812932d711a79e811a0b74c","schema_version":"1.0","event_id":"sha256:82ea13eaafc6eb2bedf8830b598ce3d7d104bfd83812932d711a79e811a0b74c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XTAJIPPF5EPBS73P54GUHMECMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fire and ice: Partially fault-tolerant quantum computing with selective state filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Concatenating the five-qubit Laflamme code onto the four-qubit Iceberg code produces reliable error-corrected quantum computation at realistic noise rates despite incomplete fault tolerance.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ben W. Reichardt, David Aasen, Rui Chao","submitted_at":"2026-05-14T19:13:25Z","abstract_excerpt":"We develop an error-corrected quantum computation scheme based on concatenating the five-qubit Laflamme code onto the four-qubit Iceberg code. The approach skates a thin line: it is explicitly not fault tolerant, risking higher logical error rates, and it relies on selective filtering to prepare encoded states for error correction, risking significant overhead. Yet, at realistic simulated noise rates, the scheme is reliable and resource efficient. It forges a practical path toward scalable quantum computation."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"At realistic simulated noise rates, the scheme is reliable and resource efficient.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The selective filtering step successfully prepares encoded states for error correction without introducing prohibitive overhead or error rates at the targeted noise levels.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Concatenating the five-qubit Laflamme code onto the four-qubit Iceberg code produces reliable error-corrected quantum computation at realistic noise rates despite incomplete fault tolerance.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b261e1459bf8dcddae38f3158d84b1382b9680ed07fdd4df9c5cb6a1ecd862dd"},"source":{"id":"2605.15344","kind":"arxiv","version":1},"verdict":{"id":"6f631721-e540-4872-bd73-06f8608632e8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:45:54.333083Z","strongest_claim":"At realistic simulated noise rates, the scheme is reliable and resource efficient.","one_line_summary":"Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The selective filtering step successfully prepares encoded states for error correction without introducing prohibitive overhead or error rates at the targeted noise levels.","pith_extraction_headline":"Concatenating the five-qubit Laflamme code onto the four-qubit Iceberg code produces reliable error-corrected quantum computation at realistic noise rates despite incomplete fault tolerance."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15344/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:18.115348Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:54:04.976433Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.208402Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.753937Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"86179179ee7b5586fe83ae9207dce0a5bc3893f0da808c6424562f700c855b4e"},"references":{"count":35,"sample":[{"doi":"","year":2025,"title":"V. V. Albert and P. Faist. The error correction zoo. 2025, ://errorcorrectionzoo.org/","work_id":"b92ab8d1-26a2-49ae-90d0-7223ca1ab1ae","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"N. Berthusen and E. Durso-Sabina . Simple logical quantum computation with concatenated symplectic double codes. (2025), arXiv:2510.18753 http://arxiv.org/abs/2510.18753","work_id":"7631032c-ce37-4c01-b10f-21f05bb1030a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"S. Burton, E. Durso-Sabina , and N. C. Brown. Genons, double covers and fault-tolerant C lifford gates. 2024, arXiv:2406.09951 http://arxiv.org/abs/2406.09951","work_id":"6b707489-eb45-4efb-b334-141659107aeb","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1103/physreva.71.022316","year":2005,"title":"Universal quantum computation with ideal Clifford gates and noisy ancillas.Physical Review A, 71(2)","work_id":"4fb65408-82a0-4e5c-b84f-cb8928eeeb07","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1088/1367-2630/12/8/083039","year":2010,"title":"Majorana Fermion Codes","work_id":"bee5c7fb-56db-491a-a0e0-e917d630a898","ref_index":5,"cited_arxiv_id":"1004.3791","is_internal_anchor":true}],"resolved_work":35,"snapshot_sha256":"d1397aaf8b79979c8c21b8790b8f6cb25d33230461b55408e5f47bd8222185d8","internal_anchors":14},"formal_canon":{"evidence_count":2,"snapshot_sha256":"de932124a07028685dba73778f40ad9b95fba84ee5abaa91952e94dc942663ce"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"6f631721-e540-4872-bd73-06f8608632e8"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZLc1DGzCaSnHn88pbLkee9Kc5Yh2zDmHci1fSwvYKADWDcocV5HvXVWM+250eRrLOsulNx7C428i9SYUsufBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:55:14.590853Z"},"content_sha256":"e8d5e170265488c0468bc258ec8318086b208e8e8d4df8cb776abf4857ce4fb9","schema_version":"1.0","event_id":"sha256:e8d5e170265488c0468bc258ec8318086b208e8e8d4df8cb776abf4857ce4fb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XTAJIPPF5EPBS73P54GUHMECMN/bundle.json","state_url":"https://pith.science/pith/XTAJIPPF5EPBS73P54GUHMECMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XTAJIPPF5EPBS73P54GUHMECMN/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-20T06:55:14Z","links":{"resolver":"https://pith.science/pith/XTAJIPPF5EPBS73P54GUHMECMN","bundle":"https://pith.science/pith/XTAJIPPF5EPBS73P54GUHMECMN/bundle.json","state":"https://pith.science/pith/XTAJIPPF5EPBS73P54GUHMECMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XTAJIPPF5EPBS73P54GUHMECMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XTAJIPPF5EPBS73P54GUHMECMN","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":"59ba10e9cccac9b9a20e911298c098c97eb47a63a60333ab0873d236e112c97f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T19:13:25Z","title_canon_sha256":"be4e4ea61c171792e35c64ab1f5917188fa0ef2158da63ebad6cc3f012dfe430"},"schema_version":"1.0","source":{"id":"2605.15344","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15344","created_at":"2026-05-20T00:00:53Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15344v1","created_at":"2026-05-20T00:00:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15344","created_at":"2026-05-20T00:00:53Z"},{"alias_kind":"pith_short_12","alias_value":"XTAJIPPF5EPB","created_at":"2026-05-20T00:00:53Z"},{"alias_kind":"pith_short_16","alias_value":"XTAJIPPF5EPBS73P","created_at":"2026-05-20T00:00:53Z"},{"alias_kind":"pith_short_8","alias_value":"XTAJIPPF","created_at":"2026-05-20T00:00:53Z"}],"graph_snapshots":[{"event_id":"sha256:e8d5e170265488c0468bc258ec8318086b208e8e8d4df8cb776abf4857ce4fb9","target":"graph","created_at":"2026-05-20T00:00:53Z","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":"At realistic simulated noise rates, the scheme is reliable and resource efficient."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The selective filtering step successfully prepares encoded states for error correction without introducing prohibitive overhead or error rates at the targeted noise levels."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Concatenating the five-qubit Laflamme code onto the four-qubit Iceberg code produces reliable error-corrected quantum computation at realistic noise rates despite incomplete fault tolerance."}],"snapshot_sha256":"b261e1459bf8dcddae38f3158d84b1382b9680ed07fdd4df9c5cb6a1ecd862dd"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"de932124a07028685dba73778f40ad9b95fba84ee5abaa91952e94dc942663ce"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:18.115348Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:54:04.976433Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.208402Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.753937Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15344/integrity.json","findings":[],"snapshot_sha256":"86179179ee7b5586fe83ae9207dce0a5bc3893f0da808c6424562f700c855b4e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop an error-corrected quantum computation scheme based on concatenating the five-qubit Laflamme code onto the four-qubit Iceberg code. The approach skates a thin line: it is explicitly not fault tolerant, risking higher logical error rates, and it relies on selective filtering to prepare encoded states for error correction, risking significant overhead. Yet, at realistic simulated noise rates, the scheme is reliable and resource efficient. It forges a practical path toward scalable quantum computation.","authors_text":"Ben W. Reichardt, David Aasen, Rui Chao","cross_cats":[],"headline":"Concatenating the five-qubit Laflamme code onto the four-qubit Iceberg code produces reliable error-corrected quantum computation at realistic noise rates despite incomplete fault tolerance.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T19:13:25Z","title":"Fire and ice: Partially fault-tolerant quantum computing with selective state filtering"},"references":{"count":35,"internal_anchors":14,"resolved_work":35,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"V. V. Albert and P. Faist. The error correction zoo. 2025, ://errorcorrectionzoo.org/","work_id":"b92ab8d1-26a2-49ae-90d0-7223ca1ab1ae","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"N. Berthusen and E. Durso-Sabina . Simple logical quantum computation with concatenated symplectic double codes. (2025), arXiv:2510.18753 http://arxiv.org/abs/2510.18753","work_id":"7631032c-ce37-4c01-b10f-21f05bb1030a","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"S. Burton, E. Durso-Sabina , and N. C. Brown. Genons, double covers and fault-tolerant C lifford gates. 2024, arXiv:2406.09951 http://arxiv.org/abs/2406.09951","work_id":"6b707489-eb45-4efb-b334-141659107aeb","year":2024},{"cited_arxiv_id":"","doi":"10.1103/physreva.71.022316","is_internal_anchor":false,"ref_index":4,"title":"Universal quantum computation with ideal Clifford gates and noisy ancillas.Physical Review A, 71(2)","work_id":"4fb65408-82a0-4e5c-b84f-cb8928eeeb07","year":2005},{"cited_arxiv_id":"1004.3791","doi":"10.1088/1367-2630/12/8/083039","is_internal_anchor":true,"ref_index":5,"title":"Majorana Fermion Codes","work_id":"bee5c7fb-56db-491a-a0e0-e917d630a898","year":2010}],"snapshot_sha256":"d1397aaf8b79979c8c21b8790b8f6cb25d33230461b55408e5f47bd8222185d8"},"source":{"id":"2605.15344","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T15:45:54.333083Z","id":"6f631721-e540-4872-bd73-06f8608632e8","model_set":{"reader":"grok-4.3"},"one_line_summary":"Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Concatenating the five-qubit Laflamme code onto the four-qubit Iceberg code produces reliable error-corrected quantum computation at realistic noise rates despite incomplete fault tolerance.","strongest_claim":"At realistic simulated noise rates, the scheme is reliable and resource efficient.","weakest_assumption":"The selective filtering step successfully prepares encoded states for error correction without introducing prohibitive overhead or error rates at the targeted noise levels."}},"verdict_id":"6f631721-e540-4872-bd73-06f8608632e8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:82ea13eaafc6eb2bedf8830b598ce3d7d104bfd83812932d711a79e811a0b74c","target":"record","created_at":"2026-05-20T00:00:53Z","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":"59ba10e9cccac9b9a20e911298c098c97eb47a63a60333ab0873d236e112c97f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T19:13:25Z","title_canon_sha256":"be4e4ea61c171792e35c64ab1f5917188fa0ef2158da63ebad6cc3f012dfe430"},"schema_version":"1.0","source":{"id":"2605.15344","kind":"arxiv","version":1}},"canonical_sha256":"bcc0943de5e91e197f6fef0d43b08263738856e8542c4aa0f89371812c8f4d87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcc0943de5e91e197f6fef0d43b08263738856e8542c4aa0f89371812c8f4d87","first_computed_at":"2026-05-20T00:00:53.556262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:53.556262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dV2bQq8UJEKdc4+/hHviR+rvMl2uytwATJfnpedXs46cPbTNj2QJh9IMRvCHi7exXXBRS/pUb8VRVh3iqO2oCA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:53.557120Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15344","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82ea13eaafc6eb2bedf8830b598ce3d7d104bfd83812932d711a79e811a0b74c","sha256:e8d5e170265488c0468bc258ec8318086b208e8e8d4df8cb776abf4857ce4fb9"],"state_sha256":"361d136ae29789424dcef14b654f59a31c38aa7a74d05cecfc25887a8bf203b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ecfN3NMlKKVqOMUI28X03TsGumNSzDBcsjL85gpauQrwPJhoPcUyxKM/D3r+xjUvQch7UXyYrHfSh/RgmgFAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T06:55:14.593488Z","bundle_sha256":"0843478bd7a073eec94fb4f03975ccd965294b79ff90622602c74ac6e70cea73"}}