{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UETSWBP7SHSNJDR54S3LK7RWOT","short_pith_number":"pith:UETSWBP7","canonical_record":{"source":{"id":"2506.03094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-06-03T17:25:13Z","cross_cats_sorted":[],"title_canon_sha256":"67461d033565995abdbecf38d66e252c39f26e59965ef4b9b9c2281f2f79dfbd","abstract_canon_sha256":"e447d552b64691ef2613e4e9d27f0a39a4f704cbcf55b5879f35bd8d24cda53c"},"schema_version":"1.0"},"canonical_sha256":"a1272b05ff91e4d48e3de4b6b57e3674d8cf1a32fdc79247ce44ab5fe5fd3411","source":{"kind":"arxiv","id":"2506.03094","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03094","created_at":"2026-07-05T11:15:14Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03094v1","created_at":"2026-07-05T11:15:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03094","created_at":"2026-07-05T11:15:14Z"},{"alias_kind":"pith_short_12","alias_value":"UETSWBP7SHSN","created_at":"2026-07-05T11:15:14Z"},{"alias_kind":"pith_short_16","alias_value":"UETSWBP7SHSNJDR5","created_at":"2026-07-05T11:15:14Z"},{"alias_kind":"pith_short_8","alias_value":"UETSWBP7","created_at":"2026-07-05T11:15:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UETSWBP7SHSNJDR54S3LK7RWOT","target":"record","payload":{"canonical_record":{"source":{"id":"2506.03094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-06-03T17:25:13Z","cross_cats_sorted":[],"title_canon_sha256":"67461d033565995abdbecf38d66e252c39f26e59965ef4b9b9c2281f2f79dfbd","abstract_canon_sha256":"e447d552b64691ef2613e4e9d27f0a39a4f704cbcf55b5879f35bd8d24cda53c"},"schema_version":"1.0"},"canonical_sha256":"a1272b05ff91e4d48e3de4b6b57e3674d8cf1a32fdc79247ce44ab5fe5fd3411","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:14.700674Z","signature_b64":"l4Z3l42TQ/oomQKcl38bwG//OrH1fRAdRqaMxwju4exlfYTBjydg9C7YDHt01HGFVMGDAz63VldVKq6RFB0AAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1272b05ff91e4d48e3de4b6b57e3674d8cf1a32fdc79247ce44ab5fe5fd3411","last_reissued_at":"2026-07-05T11:15:14.700151Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:14.700151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.03094","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-07-05T11:15:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XKTVo/tZtZ1pxwfScWvKQ0hRJn5XJTxJkqVGbksUoqE9dIdN1eDDVROsbrNHmbPIBy6ptMKE6CJovk7j/QmaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:07:11.283590Z"},"content_sha256":"aab5a83f4bd993d1399c9847e4174359b265130f57bdeb94053805eb4186ef34","schema_version":"1.0","event_id":"sha256:aab5a83f4bd993d1399c9847e4174359b265130f57bdeb94053805eb4186ef34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UETSWBP7SHSNJDR54S3LK7RWOT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Bicycle architecture supports an order of magnitude larger logical quantum circuits than surface codes for the same number of physical qubits.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew W. Cross, Eddie Schoute, Emily Pritchett, Jay M. Gambetta, Malcolm Carroll, Michael E. Beverland, Patrick Rall, Theodore J. Yoder","submitted_at":"2025-06-03T17:25:13Z","abstract_excerpt":"We present the bicycle architecture, a modular quantum computing framework based on high-rate, low-overhead quantum LDPC codes identified in prior work. For two specific bivariate bicycle codes with distances 12 and 18, we construct explicit fault-tolerant logical instruction sets and estimate the logical error rate of the instructions under circuit noise. We develop a compilation strategy adapted to the constraints of the bicycle architecture, enabling large-scale universal quantum circuit execution. Integrating these components, we perform end-to-end resource estimates demonstrating that an "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Integrating these components, we perform end-to-end resource estimates demonstrating that an order of magnitude larger logical circuits can be implemented with a given number of physical qubits on the bicycle architecture than on surface code architectures.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The logical error rates and resource counts rely on specific circuit-noise models and the assumption that the bivariate bicycle codes maintain their distance and threshold properties when embedded in the modular layout with the proposed compilation strategy.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Bivariate bicycle codes enable a modular architecture that supports an order of magnitude more logical circuit volume per physical qubit than surface-code designs under circuit noise.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Bicycle architecture supports an order of magnitude larger logical quantum circuits than surface codes for the same number of physical qubits.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"52f24a269f06c4ad9f37fa4d608a8c456e28c262d6a51867743c5e3f8f8f3649"},"source":{"id":"2506.03094","kind":"arxiv","version":1},"verdict":{"id":"19412772-0ad4-4804-95ab-e2bb6766311b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T19:29:15.418634Z","strongest_claim":"Integrating these components, we perform end-to-end resource estimates demonstrating that an order of magnitude larger logical circuits can be implemented with a given number of physical qubits on the bicycle architecture than on surface code architectures.","one_line_summary":"Bivariate bicycle codes enable a modular architecture that supports an order of magnitude more logical circuit volume per physical qubit than surface-code designs under circuit noise.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The logical error rates and resource counts rely on specific circuit-noise models and the assumption that the bivariate bicycle codes maintain their distance and threshold properties when embedded in the modular layout with the proposed compilation strategy.","pith_extraction_headline":"Bicycle architecture supports an order of magnitude larger logical quantum circuits than surface codes for the same number of physical qubits."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.03094/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":28,"sample":[{"doi":"10.1103/physreva.96.042316","year":2024,"title":"Quantum error correction below the surface code threshold","work_id":"9ed6d039-9adf-4d1d-ab46-0dec78dc0170","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/tit.2021.3081415","year":2021,"title":"Interleaving: Modular architectures for fault-tolerant photonic quantum computing","work_id":"d3eb7cbd-7438-4e71-9c2d-ce8373f00ab6","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1063/1.1499754","year":2024,"title":"Journal of Mathemat- ical Physics43(9), 4452–4505 (2002) https://doi.org/10.1063/1.1499754","work_id":"5255cedc-0cb7-434f-bec2-932c8fbc393c","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.22331/q-2021-04-15-433","year":2048,"title":"Quantum 5, 433 (2021) https://doi.org/10.22331/q-2021-04-15-433","work_id":"b7a705c5-10d2-4d6f-b409-6b6fe2f2a9a4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.5281/zenodo.13777072","year":2024,"title":"How to factor 2048 bit RSA integers with less than a million noisy qubits","work_id":"bd1d7c03-8dbc-468f-979f-49215d18eb4c","ref_index":5,"cited_arxiv_id":"2505.15917","is_internal_anchor":true}],"resolved_work":28,"snapshot_sha256":"68bab00d3875b6e89be282bc968d1d9a37ab262ac2915aa18d48c568298f826c","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b07814810e01bda7dbf2be96c1ce610c30b1bac1e66339830c7925fc2c8d7f37"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"19412772-0ad4-4804-95ab-e2bb6766311b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:15:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+1kwXGtjDHMRW5j7OAQyT9jT+gOtnsmG0DEc7JgA3EmS1n5S5fTs4NCQTHzwDJ/C5HB+3iZGkdHQDG4s2M16Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:07:11.284451Z"},"content_sha256":"5c65cb4a3fe87b16e7acdc8119db04d24decac28b5cc959e883c91967e4c23a2","schema_version":"1.0","event_id":"sha256:5c65cb4a3fe87b16e7acdc8119db04d24decac28b5cc959e883c91967e4c23a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UETSWBP7SHSNJDR54S3LK7RWOT/bundle.json","state_url":"https://pith.science/pith/UETSWBP7SHSNJDR54S3LK7RWOT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UETSWBP7SHSNJDR54S3LK7RWOT/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-08-04T22:07:11Z","links":{"resolver":"https://pith.science/pith/UETSWBP7SHSNJDR54S3LK7RWOT","bundle":"https://pith.science/pith/UETSWBP7SHSNJDR54S3LK7RWOT/bundle.json","state":"https://pith.science/pith/UETSWBP7SHSNJDR54S3LK7RWOT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UETSWBP7SHSNJDR54S3LK7RWOT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UETSWBP7SHSNJDR54S3LK7RWOT","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":"e447d552b64691ef2613e4e9d27f0a39a4f704cbcf55b5879f35bd8d24cda53c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-06-03T17:25:13Z","title_canon_sha256":"67461d033565995abdbecf38d66e252c39f26e59965ef4b9b9c2281f2f79dfbd"},"schema_version":"1.0","source":{"id":"2506.03094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03094","created_at":"2026-07-05T11:15:14Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03094v1","created_at":"2026-07-05T11:15:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03094","created_at":"2026-07-05T11:15:14Z"},{"alias_kind":"pith_short_12","alias_value":"UETSWBP7SHSN","created_at":"2026-07-05T11:15:14Z"},{"alias_kind":"pith_short_16","alias_value":"UETSWBP7SHSNJDR5","created_at":"2026-07-05T11:15:14Z"},{"alias_kind":"pith_short_8","alias_value":"UETSWBP7","created_at":"2026-07-05T11:15:14Z"}],"graph_snapshots":[{"event_id":"sha256:5c65cb4a3fe87b16e7acdc8119db04d24decac28b5cc959e883c91967e4c23a2","target":"graph","created_at":"2026-07-05T11:15:14Z","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":"Integrating these components, we perform end-to-end resource estimates demonstrating that an order of magnitude larger logical circuits can be implemented with a given number of physical qubits on the bicycle architecture than on surface code architectures."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The logical error rates and resource counts rely on specific circuit-noise models and the assumption that the bivariate bicycle codes maintain their distance and threshold properties when embedded in the modular layout with the proposed compilation strategy."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Bivariate bicycle codes enable a modular architecture that supports an order of magnitude more logical circuit volume per physical qubit than surface-code designs under circuit noise."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Bicycle architecture supports an order of magnitude larger logical quantum circuits than surface codes for the same number of physical qubits."}],"snapshot_sha256":"52f24a269f06c4ad9f37fa4d608a8c456e28c262d6a51867743c5e3f8f8f3649"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b07814810e01bda7dbf2be96c1ce610c30b1bac1e66339830c7925fc2c8d7f37"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.03094/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present the bicycle architecture, a modular quantum computing framework based on high-rate, low-overhead quantum LDPC codes identified in prior work. For two specific bivariate bicycle codes with distances 12 and 18, we construct explicit fault-tolerant logical instruction sets and estimate the logical error rate of the instructions under circuit noise. We develop a compilation strategy adapted to the constraints of the bicycle architecture, enabling large-scale universal quantum circuit execution. Integrating these components, we perform end-to-end resource estimates demonstrating that an ","authors_text":"Andrew W. Cross, Eddie Schoute, Emily Pritchett, Jay M. Gambetta, Malcolm Carroll, Michael E. Beverland, Patrick Rall, Theodore J. Yoder","cross_cats":[],"headline":"Bicycle architecture supports an order of magnitude larger logical quantum circuits than surface codes for the same number of physical qubits.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes"},"references":{"count":28,"internal_anchors":1,"resolved_work":28,"sample":[{"cited_arxiv_id":"","doi":"10.1103/physreva.96.042316","is_internal_anchor":false,"ref_index":1,"title":"Quantum error correction below the surface code threshold","work_id":"9ed6d039-9adf-4d1d-ab46-0dec78dc0170","year":2024},{"cited_arxiv_id":"","doi":"10.1109/tit.2021.3081415","is_internal_anchor":false,"ref_index":2,"title":"Interleaving: Modular architectures for fault-tolerant photonic quantum computing","work_id":"d3eb7cbd-7438-4e71-9c2d-ce8373f00ab6","year":2021},{"cited_arxiv_id":"","doi":"10.1063/1.1499754","is_internal_anchor":false,"ref_index":3,"title":"Journal of Mathemat- ical Physics43(9), 4452–4505 (2002) https://doi.org/10.1063/1.1499754","work_id":"5255cedc-0cb7-434f-bec2-932c8fbc393c","year":2024},{"cited_arxiv_id":"","doi":"10.22331/q-2021-04-15-433","is_internal_anchor":false,"ref_index":4,"title":"Quantum 5, 433 (2021) https://doi.org/10.22331/q-2021-04-15-433","work_id":"b7a705c5-10d2-4d6f-b409-6b6fe2f2a9a4","year":2048},{"cited_arxiv_id":"2505.15917","doi":"10.5281/zenodo.13777072","is_internal_anchor":true,"ref_index":5,"title":"How to factor 2048 bit RSA integers with less than a million noisy qubits","work_id":"bd1d7c03-8dbc-468f-979f-49215d18eb4c","year":2024}],"snapshot_sha256":"68bab00d3875b6e89be282bc968d1d9a37ab262ac2915aa18d48c568298f826c"},"source":{"id":"2506.03094","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-13T19:29:15.418634Z","id":"19412772-0ad4-4804-95ab-e2bb6766311b","model_set":{"reader":"grok-4.3"},"one_line_summary":"Bivariate bicycle codes enable a modular architecture that supports an order of magnitude more logical circuit volume per physical qubit than surface-code designs under circuit noise.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Bicycle architecture supports an order of magnitude larger logical quantum circuits than surface codes for the same number of physical qubits.","strongest_claim":"Integrating these components, we perform end-to-end resource estimates demonstrating that an order of magnitude larger logical circuits can be implemented with a given number of physical qubits on the bicycle architecture than on surface code architectures.","weakest_assumption":"The logical error rates and resource counts rely on specific circuit-noise models and the assumption that the bivariate bicycle codes maintain their distance and threshold properties when embedded in the modular layout with the proposed compilation strategy."}},"verdict_id":"19412772-0ad4-4804-95ab-e2bb6766311b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aab5a83f4bd993d1399c9847e4174359b265130f57bdeb94053805eb4186ef34","target":"record","created_at":"2026-07-05T11:15:14Z","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":"e447d552b64691ef2613e4e9d27f0a39a4f704cbcf55b5879f35bd8d24cda53c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-06-03T17:25:13Z","title_canon_sha256":"67461d033565995abdbecf38d66e252c39f26e59965ef4b9b9c2281f2f79dfbd"},"schema_version":"1.0","source":{"id":"2506.03094","kind":"arxiv","version":1}},"canonical_sha256":"a1272b05ff91e4d48e3de4b6b57e3674d8cf1a32fdc79247ce44ab5fe5fd3411","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1272b05ff91e4d48e3de4b6b57e3674d8cf1a32fdc79247ce44ab5fe5fd3411","first_computed_at":"2026-07-05T11:15:14.700151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:14.700151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l4Z3l42TQ/oomQKcl38bwG//OrH1fRAdRqaMxwju4exlfYTBjydg9C7YDHt01HGFVMGDAz63VldVKq6RFB0AAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:14.700674Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.03094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aab5a83f4bd993d1399c9847e4174359b265130f57bdeb94053805eb4186ef34","sha256:5c65cb4a3fe87b16e7acdc8119db04d24decac28b5cc959e883c91967e4c23a2"],"state_sha256":"c9902238583a41777dfa449c666af8bb79ce973b9ae3fb7c5f263846d033c7c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0NhrtNNo1T2LP6KHG13/Gqb0bH2A0WsFQt2ZX5gtAz5dE8Ij2CmISQjux1oIzxhr988jPvXsAlvmfS48BV9Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T22:07:11.289153Z","bundle_sha256":"f8e8a018111517155a4eb8f43cf72b50a5778736b9640f8dd75890df762912ab"}}