{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4S76J3NMMICRS6I574KDISQUV5","short_pith_number":"pith:4S76J3NM","canonical_record":{"source":{"id":"2605.14170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T22:49:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"582cf939a3e8615c5080165b4c032c5ae7ecbb70e6f2626351163750b96cc565","abstract_canon_sha256":"5cc2ea8abb256e3ef7eecdf4e4d39eb37659453074a747c01e718e9cda486f5c"},"schema_version":"1.0"},"canonical_sha256":"e4bfe4edac620519791dff14344a14af644d1f404415600429fc017b8a372e29","source":{"kind":"arxiv","id":"2605.14170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14170","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14170v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14170","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"4S76J3NMMICR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"4S76J3NMMICRS6I5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"4S76J3NM","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4S76J3NMMICRS6I574KDISQUV5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T22:49:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"582cf939a3e8615c5080165b4c032c5ae7ecbb70e6f2626351163750b96cc565","abstract_canon_sha256":"5cc2ea8abb256e3ef7eecdf4e4d39eb37659453074a747c01e718e9cda486f5c"},"schema_version":"1.0"},"canonical_sha256":"e4bfe4edac620519791dff14344a14af644d1f404415600429fc017b8a372e29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:11.365368Z","signature_b64":"GWwP/IO3BysEtyZ0OFSDb9/frnVUp0PYx4rBsmuO2+wduMPoQpW9Zf3KNDXIycA6ieD/n6Rvigt5/G3tFjDDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4bfe4edac620519791dff14344a14af644d1f404415600429fc017b8a372e29","last_reissued_at":"2026-05-17T23:39:11.364287Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:11.364287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14170","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-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MwGjdb58sw9cN4qLeW6Vzm+BWRCCNTqkdAevSgL40MYCTl+onQwlJI6At0pWIKOszm0EGM2Mc9xGkloU/IzUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:01:59.864685Z"},"content_sha256":"7bef75ccebb9137e1fbe6c4c7a75e9de033c7a632e0d00ae60ba6bdcd91f3e3a","schema_version":"1.0","event_id":"sha256:7bef75ccebb9137e1fbe6c4c7a75e9de033c7a632e0d00ae60ba6bdcd91f3e3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4S76J3NMMICRS6I574KDISQUV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"MBBP-LD improves quantum LDPC decoding by running parallel belief propagation across multiple parity-check bases derived from cycle-free Tanner subtrees.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hessam Mahdavifar, Sheida Rabeti","submitted_at":"2026-05-13T22:49:35Z","abstract_excerpt":"In this paper, we propose a belief-propagation (BP)-based decoder, termed the Multiple-Bases Belief-Propagation List Decoder (MBBP-LD), for quantum low-density parity-check (QLDPC) codes. The key idea is to generate \\emph{structured decoding diversity} by constructing multiple redundant parity-check representations via cycle-free subtree decompositions of the Tanner graph, and running BP decoding in parallel across these representations. This extends the classical Multiple-Bases Belief-Propagation (MBBP) framework to the quantum setting while preserving the linear-time complexity and efficienc"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For bivariate bicycle codes [[144,12,12]] and [[288,12,18]], MBBP-LD achieves up to 20% reduction in error rate compared to BPGD and up to 30% compared to BP-OSD in the low- and moderate-error regimes while requiring substantially fewer total BP iterations.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The cycle-free subtree decompositions of the Tanner graph produce sufficiently diverse and consistent parity-check representations that improve BP convergence without introducing new inconsistencies or requiring super-linear overhead.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"MBBP-LD creates multiple cycle-free subtree decompositions of the Tanner graph to run parallel BP decodings on quantum LDPC codes, cutting error rates by up to 30% versus BP-OSD and 20% versus BPGD on tested bivariate bicycle codes with fewer total iterations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"MBBP-LD improves quantum LDPC decoding by running parallel belief propagation across multiple parity-check bases derived from cycle-free Tanner subtrees.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f61845408fbe5f7ec45fc4021c9834031a7021acd895e23a395f29ba969b914b"},"source":{"id":"2605.14170","kind":"arxiv","version":1},"verdict":{"id":"92af6d86-1966-4956-bfa6-5c79a0d177ec","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:43:21.738775Z","strongest_claim":"For bivariate bicycle codes [[144,12,12]] and [[288,12,18]], MBBP-LD achieves up to 20% reduction in error rate compared to BPGD and up to 30% compared to BP-OSD in the low- and moderate-error regimes while requiring substantially fewer total BP iterations.","one_line_summary":"MBBP-LD creates multiple cycle-free subtree decompositions of the Tanner graph to run parallel BP decodings on quantum LDPC codes, cutting error rates by up to 30% versus BP-OSD and 20% versus BPGD on tested bivariate bicycle codes with fewer total iterations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The cycle-free subtree decompositions of the Tanner graph produce sufficiently diverse and consistent parity-check representations that improve BP convergence without introducing new inconsistencies or requiring super-linear overhead.","pith_extraction_headline":"MBBP-LD improves quantum LDPC decoding by running parallel belief propagation across multiple parity-check bases derived from cycle-free Tanner subtrees."},"references":{"count":23,"sample":[{"doi":"","year":1962,"title":"R. Gallager, “Low-density parity-check codes,”IRE Transactions on information theory, vol. 8, no. 1, pp. 21–28, 1962","work_id":"e4fcd8e9-c455-415e-b63f-fd5aa6f9b259","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"Fifteen years of quantum LDPC coding and improved decoding strategies,","work_id":"6d1032ff-1fa0-4f30-a96d-e26cb7c65ad3","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Quantum low-density parity- check codes,","work_id":"fcccd828-c25e-4fb1-8187-d0d9eab61fdd","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Quantum low-density parity-check codes","work_id":"309b64a3-ed84-4a6b-ab00-a1b9d6ac53d0","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Degenerate quantum LDPC codes with good finite length performance","work_id":"45bee9f2-7c04-4106-9652-e6cd494b04c0","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":23,"snapshot_sha256":"3d2319fa80357c040efa06bf9318a75b20e5080ff07e812e937b19df3c923fda","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":"92af6d86-1966-4956-bfa6-5c79a0d177ec"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1qgi9N4WW12F6vyFt2ANL1d0SYSu+7n6jhTf+oTaYG61KDFIZYB7KHqR6fQyxfvryq3Gi+q6wlAPB+T4+ViBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:01:59.865791Z"},"content_sha256":"f8a933d71ddcd58088edb040b3c73e8ec06bb5dda633741cdb408e0cde9b4a47","schema_version":"1.0","event_id":"sha256:f8a933d71ddcd58088edb040b3c73e8ec06bb5dda633741cdb408e0cde9b4a47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5/bundle.json","state_url":"https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4S76J3NMMICRS6I574KDISQUV5/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-25T17:01:59Z","links":{"resolver":"https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5","bundle":"https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5/bundle.json","state":"https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4S76J3NMMICRS6I574KDISQUV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4S76J3NMMICRS6I574KDISQUV5","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":"5cc2ea8abb256e3ef7eecdf4e4d39eb37659453074a747c01e718e9cda486f5c","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T22:49:35Z","title_canon_sha256":"582cf939a3e8615c5080165b4c032c5ae7ecbb70e6f2626351163750b96cc565"},"schema_version":"1.0","source":{"id":"2605.14170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14170","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14170v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14170","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"4S76J3NMMICR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"4S76J3NMMICRS6I5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"4S76J3NM","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:f8a933d71ddcd58088edb040b3c73e8ec06bb5dda633741cdb408e0cde9b4a47","target":"graph","created_at":"2026-05-17T23:39: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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For bivariate bicycle codes [[144,12,12]] and [[288,12,18]], MBBP-LD achieves up to 20% reduction in error rate compared to BPGD and up to 30% compared to BP-OSD in the low- and moderate-error regimes while requiring substantially fewer total BP iterations."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The cycle-free subtree decompositions of the Tanner graph produce sufficiently diverse and consistent parity-check representations that improve BP convergence without introducing new inconsistencies or requiring super-linear overhead."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"MBBP-LD creates multiple cycle-free subtree decompositions of the Tanner graph to run parallel BP decodings on quantum LDPC codes, cutting error rates by up to 30% versus BP-OSD and 20% versus BPGD on tested bivariate bicycle codes with fewer total iterations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"MBBP-LD improves quantum LDPC decoding by running parallel belief propagation across multiple parity-check bases derived from cycle-free Tanner subtrees."}],"snapshot_sha256":"f61845408fbe5f7ec45fc4021c9834031a7021acd895e23a395f29ba969b914b"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we propose a belief-propagation (BP)-based decoder, termed the Multiple-Bases Belief-Propagation List Decoder (MBBP-LD), for quantum low-density parity-check (QLDPC) codes. The key idea is to generate \\emph{structured decoding diversity} by constructing multiple redundant parity-check representations via cycle-free subtree decompositions of the Tanner graph, and running BP decoding in parallel across these representations. This extends the classical Multiple-Bases Belief-Propagation (MBBP) framework to the quantum setting while preserving the linear-time complexity and efficienc","authors_text":"Hessam Mahdavifar, Sheida Rabeti","cross_cats":["math.IT"],"headline":"MBBP-LD improves quantum LDPC decoding by running parallel belief propagation across multiple parity-check bases derived from cycle-free Tanner subtrees.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T22:49:35Z","title":"Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes"},"references":{"count":23,"internal_anchors":0,"resolved_work":23,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"R. Gallager, “Low-density parity-check codes,”IRE Transactions on information theory, vol. 8, no. 1, pp. 21–28, 1962","work_id":"e4fcd8e9-c455-415e-b63f-fd5aa6f9b259","year":1962},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Fifteen years of quantum LDPC coding and improved decoding strategies,","work_id":"6d1032ff-1fa0-4f30-a96d-e26cb7c65ad3","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Quantum low-density parity- check codes,","work_id":"fcccd828-c25e-4fb1-8187-d0d9eab61fdd","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Quantum low-density parity-check codes","work_id":"309b64a3-ed84-4a6b-ab00-a1b9d6ac53d0","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Degenerate quantum LDPC codes with good finite length performance","work_id":"45bee9f2-7c04-4106-9652-e6cd494b04c0","year":2021}],"snapshot_sha256":"3d2319fa80357c040efa06bf9318a75b20e5080ff07e812e937b19df3c923fda"},"source":{"id":"2605.14170","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:43:21.738775Z","id":"92af6d86-1966-4956-bfa6-5c79a0d177ec","model_set":{"reader":"grok-4.3"},"one_line_summary":"MBBP-LD creates multiple cycle-free subtree decompositions of the Tanner graph to run parallel BP decodings on quantum LDPC codes, cutting error rates by up to 30% versus BP-OSD and 20% versus BPGD on tested bivariate bicycle codes with fewer total iterations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"MBBP-LD improves quantum LDPC decoding by running parallel belief propagation across multiple parity-check bases derived from cycle-free Tanner subtrees.","strongest_claim":"For bivariate bicycle codes [[144,12,12]] and [[288,12,18]], MBBP-LD achieves up to 20% reduction in error rate compared to BPGD and up to 30% compared to BP-OSD in the low- and moderate-error regimes while requiring substantially fewer total BP iterations.","weakest_assumption":"The cycle-free subtree decompositions of the Tanner graph produce sufficiently diverse and consistent parity-check representations that improve BP convergence without introducing new inconsistencies or requiring super-linear overhead."}},"verdict_id":"92af6d86-1966-4956-bfa6-5c79a0d177ec"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7bef75ccebb9137e1fbe6c4c7a75e9de033c7a632e0d00ae60ba6bdcd91f3e3a","target":"record","created_at":"2026-05-17T23:39: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":"5cc2ea8abb256e3ef7eecdf4e4d39eb37659453074a747c01e718e9cda486f5c","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T22:49:35Z","title_canon_sha256":"582cf939a3e8615c5080165b4c032c5ae7ecbb70e6f2626351163750b96cc565"},"schema_version":"1.0","source":{"id":"2605.14170","kind":"arxiv","version":1}},"canonical_sha256":"e4bfe4edac620519791dff14344a14af644d1f404415600429fc017b8a372e29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4bfe4edac620519791dff14344a14af644d1f404415600429fc017b8a372e29","first_computed_at":"2026-05-17T23:39:11.364287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:11.364287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GWwP/IO3BysEtyZ0OFSDb9/frnVUp0PYx4rBsmuO2+wduMPoQpW9Zf3KNDXIycA6ieD/n6Rvigt5/G3tFjDDDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:11.365368Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bef75ccebb9137e1fbe6c4c7a75e9de033c7a632e0d00ae60ba6bdcd91f3e3a","sha256:f8a933d71ddcd58088edb040b3c73e8ec06bb5dda633741cdb408e0cde9b4a47"],"state_sha256":"ccf049a58a2b988502e19536e9b65ccb8c2c15f7dd906d0070a65770b4724d0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nqo1WVGqIQLVLZbLFthiDd5jptDjveP2l464ZCj2zzpaiXRDDbI63QZLBZrm33YB64JPQPsk6MVrNeJQlZHqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:01:59.870226Z","bundle_sha256":"eb80e94cc4a0b9bb7aa61232a257cd3e85dc6f73f068507a360d452e633e0ca1"}}