{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EBNC2SE4QL2GL554QWJ3SBXSBW","short_pith_number":"pith:EBNC2SE4","canonical_record":{"source":{"id":"2608.11563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-12T02:07:24Z","cross_cats_sorted":[],"title_canon_sha256":"afd420f9b5a1878a32c6fb2a036a3bd021ebb2a641ef898e8300a78e705b208f","abstract_canon_sha256":"7c2d28f72464cb36dd91536a4acfb29c857945b55fd13599014c7296d1d68f5f"},"schema_version":"1.0"},"canonical_sha256":"205a2d489c82f465f7bc8593b906f20d8147aa27928097f04438eebe2c73c397","source":{"kind":"arxiv","id":"2608.11563","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11563","created_at":"2026-08-13T00:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11563v1","created_at":"2026-08-13T00:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11563","created_at":"2026-08-13T00:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"EBNC2SE4QL2G","created_at":"2026-08-13T00:22:11Z"},{"alias_kind":"pith_short_16","alias_value":"EBNC2SE4QL2GL554","created_at":"2026-08-13T00:22:11Z"},{"alias_kind":"pith_short_8","alias_value":"EBNC2SE4","created_at":"2026-08-13T00:22:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EBNC2SE4QL2GL554QWJ3SBXSBW","target":"record","payload":{"canonical_record":{"source":{"id":"2608.11563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-12T02:07:24Z","cross_cats_sorted":[],"title_canon_sha256":"afd420f9b5a1878a32c6fb2a036a3bd021ebb2a641ef898e8300a78e705b208f","abstract_canon_sha256":"7c2d28f72464cb36dd91536a4acfb29c857945b55fd13599014c7296d1d68f5f"},"schema_version":"1.0"},"canonical_sha256":"205a2d489c82f465f7bc8593b906f20d8147aa27928097f04438eebe2c73c397","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T00:22:11.686810Z","signature_b64":"UtbBO4Gg8gBnCwDFO1U5ymaJ5LrDP79OU3U3CU24dZbgSy7Dbmh9YhsKViPD9jB6Wiklf9X3do4vj/1pj4C+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"205a2d489c82f465f7bc8593b906f20d8147aa27928097f04438eebe2c73c397","last_reissued_at":"2026-08-13T00:22:11.685219Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T00:22:11.685219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.11563","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-08-13T00:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jo7OQ0mHk3JoULJyji5pWmY7SPSzORNjHxQG2ZI/zICOo0IunF4AfiKO3aGSRhrMGOxcB3vbZ5aYOpDJt5ocBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T08:23:31.598946Z"},"content_sha256":"2af55c9c4ee38cf6d1ee4ee0d3d426e10404b1e595b690c0b334d809674bf195","schema_version":"1.0","event_id":"sha256:2af55c9c4ee38cf6d1ee4ee0d3d426e10404b1e595b690c0b334d809674bf195"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EBNC2SE4QL2GL554QWJ3SBXSBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Quantum Modular Reduction: Crandall reduction and its Fault-tolerant resource analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Changyeol Lee, Ilkwon Sohn, Kwangil Bae, Sungyeon Kook, Wonhyuk Lee, Wooyeong Song","submitted_at":"2026-08-12T02:07:24Z","abstract_excerpt":"Modular arithmetic is central to quantum algorithms for cryptographic problems, including Shor's algorithm and Grover-based cryptanalysis, with modular reduction contributing substantially to circuit cost. Pseudo-Mersenne moduli $q=2^n-c$ allow classical Crandall reduction to replace division with folding and constant arithmetic, providing a structural opportunity for more efficient quantum modular reduction than Barrett reduction. We translate this advantage into a reversible quantum setting by deriving explicit folding and normalization conditions for $2n$-bit inputs. To the best of our know"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11563","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.11563/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-13T00:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uClmtoY6rLtLruPjcz+0gJjIaSMGdccolEyZx+C1RKnrvFHTW9wYtLOZSgHmH5Ev5jlK6/tdrx4eC7PWNwLuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T08:23:31.599449Z"},"content_sha256":"643167042aded3f32eb2ca50ae2f35e20c463c2f78e4c468afb41bf131c01722","schema_version":"1.0","event_id":"sha256:643167042aded3f32eb2ca50ae2f35e20c463c2f78e4c468afb41bf131c01722"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:EBNC2SE4QL2GL554QWJ3SBXSBW","target":"integrity","payload":{"note":"Identifier '10.22331/q-2017-09-11-31' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Haah J, Hastings M B, Poulin D and Wecker D 2017 Magic state distillation with low space overhead and optimal asymptotic input countQuantum131 (doi: 10.22331/q-2017-09-11-31)","arxiv_id":"2608.11563","detector":"doi_compliance","evidence":{"doi":"10.22331/q-2017-09-11-31","arxiv_id":null,"ref_index":20,"raw_excerpt":"Haah J, Hastings M B, Poulin D and Wecker D 2017 Magic state distillation with low space overhead and optimal asymptotic input countQuantum131 (doi: 10.22331/q-2017-09-11-31)","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":20,"audited_at":"2026-08-16T01:08:09.308558Z","event_type":"pith.integrity.v1","detected_doi":"10.22331/q-2017-09-11-31","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"6d8b38ef2d9a71058ed02a95cd381c2276b750b5ead298997f0cb7708f59fc7b","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":20336,"payload_sha256":"71048953ec2007e6b6725ea0030746e08ea09126cb550a1aba034fdb3b9aa79e","signature_b64":"+hb/jFIwqZx7D0Z5IEz54ZG1LmkFvYTrpMxfHFYDFyyM4OHu5MZo9bjP5boTHTSSFkBxiBdYTauwd81FnOaoBg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-16T01:08:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5QoTscgqdCt1+3riIobs3xm8phWngdIGfO2bwn/OU4BwC4qXeF4RnSAxiq2jy+xGWvzAfMT+Ilu4hODSLDrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T08:23:31.602775Z"},"content_sha256":"92aacdfe0d814fbd38f6a437c993dd094f9e9cbb6766d120bc73ef9d36328211","schema_version":"1.0","event_id":"sha256:92aacdfe0d814fbd38f6a437c993dd094f9e9cbb6766d120bc73ef9d36328211"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:EBNC2SE4QL2GL554QWJ3SBXSBW","target":"integrity","payload":{"note":"Identifier '10.1007/978-3-540-30564-4' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Bajard J-C, Imbert L and Plantard T 2005 Modular number systems: beyond the Mersenne familySelected Areas in Cryptography—SAC 2004(Lecture Notes in Computer Science vol 3357) ed H Handschuh and M A Hasan (Berlin: Springer) pp 159–169 (doi: ","arxiv_id":"2608.11563","detector":"doi_compliance","evidence":{"doi":"10.1007/978-3-540-30564-4","arxiv_id":null,"ref_index":14,"raw_excerpt":"Bajard J-C, Imbert L and Plantard T 2005 Modular number systems: beyond the Mersenne familySelected Areas in Cryptography—SAC 2004(Lecture Notes in Computer Science vol 3357) ed H Handschuh and M A Hasan (Berlin: Springer) pp 159–169 (doi: 10.1007/978-3-540-30564-4 11)","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":14,"audited_at":"2026-08-16T01:08:09.308558Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-30564-4","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"02791a076bdf725a97b52b11c8dfec9bc1f86171b8dc29298829b8daac100303","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":20335,"payload_sha256":"92c3c0c693ae95e50c2c3ed6c1b36852599b6b534c6c0797d255d9864b936ae4","signature_b64":"1T+9Ck1M99DyhOU1pnzjeAvya+tYjTRxFV5iRZd6XHFGH+b27vzHWbXAhp8UTGz1IZhrJddEMxf5A9CoVVz6Bw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-16T01:08:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJrWa4eFM5aHdJ5Fc6bmQYRtboEix1VOuVvrhs+KpyBA4VvrBgpsf3hEZ4U0vslNbIZEGGkGn8syUe+r8fIKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T08:23:31.603184Z"},"content_sha256":"22f813a158e3dcff9682fbe6451d03b8793fce657c31142de8c821dbd09cbeeb","schema_version":"1.0","event_id":"sha256:22f813a158e3dcff9682fbe6451d03b8793fce657c31142de8c821dbd09cbeeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW/bundle.json","state_url":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBNC2SE4QL2GL554QWJ3SBXSBW/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-23T08:23:31Z","links":{"resolver":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW","bundle":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW/bundle.json","state":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBNC2SE4QL2GL554QWJ3SBXSBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EBNC2SE4QL2GL554QWJ3SBXSBW","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7c2d28f72464cb36dd91536a4acfb29c857945b55fd13599014c7296d1d68f5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-12T02:07:24Z","title_canon_sha256":"afd420f9b5a1878a32c6fb2a036a3bd021ebb2a641ef898e8300a78e705b208f"},"schema_version":"1.0","source":{"id":"2608.11563","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11563","created_at":"2026-08-13T00:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11563v1","created_at":"2026-08-13T00:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11563","created_at":"2026-08-13T00:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"EBNC2SE4QL2G","created_at":"2026-08-13T00:22:11Z"},{"alias_kind":"pith_short_16","alias_value":"EBNC2SE4QL2GL554","created_at":"2026-08-13T00:22:11Z"},{"alias_kind":"pith_short_8","alias_value":"EBNC2SE4","created_at":"2026-08-13T00:22:11Z"}],"graph_snapshots":[{"event_id":"sha256:643167042aded3f32eb2ca50ae2f35e20c463c2f78e4c468afb41bf131c01722","target":"graph","created_at":"2026-08-13T00:22:11Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.11563/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Modular arithmetic is central to quantum algorithms for cryptographic problems, including Shor's algorithm and Grover-based cryptanalysis, with modular reduction contributing substantially to circuit cost. Pseudo-Mersenne moduli $q=2^n-c$ allow classical Crandall reduction to replace division with folding and constant arithmetic, providing a structural opportunity for more efficient quantum modular reduction than Barrett reduction. We translate this advantage into a reversible quantum setting by deriving explicit folding and normalization conditions for $2n$-bit inputs. To the best of our know","authors_text":"Changyeol Lee, Ilkwon Sohn, Kwangil Bae, Sungyeon Kook, Wonhyuk Lee, Wooyeong Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-12T02:07:24Z","title":"Efficient Quantum Modular Reduction: Crandall reduction and its Fault-tolerant resource analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11563","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2af55c9c4ee38cf6d1ee4ee0d3d426e10404b1e595b690c0b334d809674bf195","target":"record","created_at":"2026-08-13T00:22:11Z","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":"7c2d28f72464cb36dd91536a4acfb29c857945b55fd13599014c7296d1d68f5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-12T02:07:24Z","title_canon_sha256":"afd420f9b5a1878a32c6fb2a036a3bd021ebb2a641ef898e8300a78e705b208f"},"schema_version":"1.0","source":{"id":"2608.11563","kind":"arxiv","version":1}},"canonical_sha256":"205a2d489c82f465f7bc8593b906f20d8147aa27928097f04438eebe2c73c397","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"205a2d489c82f465f7bc8593b906f20d8147aa27928097f04438eebe2c73c397","first_computed_at":"2026-08-13T00:22:11.685219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-13T00:22:11.685219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UtbBO4Gg8gBnCwDFO1U5ymaJ5LrDP79OU3U3CU24dZbgSy7Dbmh9YhsKViPD9jB6Wiklf9X3do4vj/1pj4C+Bw==","signature_status":"signed_v1","signed_at":"2026-08-13T00:22:11.686810Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.11563","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:22f813a158e3dcff9682fbe6451d03b8793fce657c31142de8c821dbd09cbeeb","sha256:92aacdfe0d814fbd38f6a437c993dd094f9e9cbb6766d120bc73ef9d36328211"]}],"invalid_events":[],"applied_event_ids":["sha256:2af55c9c4ee38cf6d1ee4ee0d3d426e10404b1e595b690c0b334d809674bf195","sha256:643167042aded3f32eb2ca50ae2f35e20c463c2f78e4c468afb41bf131c01722"],"state_sha256":"f9ce37f9a4b37e8a11a535bdd40a4da3c7a88b5d076706afa880398c51e239ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKmiGUwVOiQyIdgao8hmu1NPVMCK2tVHtPIZlVm6rdrWd/9oL5hpiExkJ0VwEWsDGdoz8jdZv2CzejrRqVrtCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T08:23:31.605805Z","bundle_sha256":"3d6a05ba394c2a96c909bae861123d891e3efb613744a29d8ccb3bc7844d385b"}}