{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ZQXKZT7T7PX3SEOBSEPTTJXREZ","short_pith_number":"pith:ZQXKZT7T","canonical_record":{"source":{"id":"2212.03214","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-06T18:37:27Z","cross_cats_sorted":[],"title_canon_sha256":"3c839cec774a3ac825f624335aaf2addb950ec85e60b96c91b906684268eeaa8","abstract_canon_sha256":"b14a4330f400d2f39ea5d41ae0ffb168708041884424377048d844b3b2e54d6f"},"schema_version":"1.0"},"canonical_sha256":"cc2eaccff3fbefb911c1911f39a6f1264233a0b80a6f497121fb987591925ec5","source":{"kind":"arxiv","id":"2212.03214","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.03214","created_at":"2026-07-05T06:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"2212.03214v2","created_at":"2026-07-05T06:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.03214","created_at":"2026-07-05T06:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZQXKZT7T7PX3","created_at":"2026-07-05T06:18:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZQXKZT7T7PX3SEOB","created_at":"2026-07-05T06:18:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZQXKZT7T","created_at":"2026-07-05T06:18:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ZQXKZT7T7PX3SEOBSEPTTJXREZ","target":"record","payload":{"canonical_record":{"source":{"id":"2212.03214","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-06T18:37:27Z","cross_cats_sorted":[],"title_canon_sha256":"3c839cec774a3ac825f624335aaf2addb950ec85e60b96c91b906684268eeaa8","abstract_canon_sha256":"b14a4330f400d2f39ea5d41ae0ffb168708041884424377048d844b3b2e54d6f"},"schema_version":"1.0"},"canonical_sha256":"cc2eaccff3fbefb911c1911f39a6f1264233a0b80a6f497121fb987591925ec5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:18:09.726831Z","signature_b64":"5xCBXrmP7iibxnM7TzyrHknuxNzqwbmoAeIp90bZ1KZkYchyqbeQgLo3+Q5bpM0ykTF9blvfpFPtjLl+cjitAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc2eaccff3fbefb911c1911f39a6f1264233a0b80a6f497121fb987591925ec5","last_reissued_at":"2026-07-05T06:18:09.726423Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:18:09.726423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.03214","source_version":2,"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-05T06:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NDI+pShZ5VwlTNALRIzD5+S5L8MJZEfXTDg6pkBFY4Dm7twtQ4eXTSsbIgOxjYK5jJmLcgiwP1J9vszVg3HbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:51:27.034252Z"},"content_sha256":"ec8890fa7b82aa057db8ad58dd34ae4181d6aad9f4b68c60fa8187479104502a","schema_version":"1.0","event_id":"sha256:ec8890fa7b82aa057db8ad58dd34ae4181d6aad9f4b68c60fa8187479104502a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ZQXKZT7T7PX3SEOBSEPTTJXREZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Belief Propagation Algorithms for Decoding of Surface Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Josias Old, Manuel Rispler","submitted_at":"2022-12-06T18:37:27Z","abstract_excerpt":"Belief propagation (BP) is well-known as a low complexity decoding algorithm with a strong performance for important classes of quantum error correcting codes, e.g. notably for the quantum low-density parity check (LDPC) code class of random expander codes. However, it is also well-known that the performance of BP breaks down when facing topological codes such as the surface code, where naive BP fails entirely to reach a below-threshold regime, i.e. the regime where error correction becomes useful. Previous works have shown, that this can be remedied by resorting to post-processing decoders ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.03214","kind":"arxiv","version":2},"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/2212.03214/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-07-05T06:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5fguG/4xXgGvwDPBf8RhjnYN5B/3pNKqiwISJmPzs2uiLyhR2q2ApWJHnIT+rGk1FiFIidn1+SUw6Ar/RBKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:51:27.034867Z"},"content_sha256":"30dc578ce9d00faf65bf965b846c0b28214ce8c19f350e51e161ef636ccf6475","schema_version":"1.0","event_id":"sha256:30dc578ce9d00faf65bf965b846c0b28214ce8c19f350e51e161ef636ccf6475"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQXKZT7T7PX3SEOBSEPTTJXREZ/bundle.json","state_url":"https://pith.science/pith/ZQXKZT7T7PX3SEOBSEPTTJXREZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQXKZT7T7PX3SEOBSEPTTJXREZ/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-03T19:51:27Z","links":{"resolver":"https://pith.science/pith/ZQXKZT7T7PX3SEOBSEPTTJXREZ","bundle":"https://pith.science/pith/ZQXKZT7T7PX3SEOBSEPTTJXREZ/bundle.json","state":"https://pith.science/pith/ZQXKZT7T7PX3SEOBSEPTTJXREZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQXKZT7T7PX3SEOBSEPTTJXREZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ZQXKZT7T7PX3SEOBSEPTTJXREZ","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":"b14a4330f400d2f39ea5d41ae0ffb168708041884424377048d844b3b2e54d6f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-06T18:37:27Z","title_canon_sha256":"3c839cec774a3ac825f624335aaf2addb950ec85e60b96c91b906684268eeaa8"},"schema_version":"1.0","source":{"id":"2212.03214","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.03214","created_at":"2026-07-05T06:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"2212.03214v2","created_at":"2026-07-05T06:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.03214","created_at":"2026-07-05T06:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZQXKZT7T7PX3","created_at":"2026-07-05T06:18:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZQXKZT7T7PX3SEOB","created_at":"2026-07-05T06:18:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZQXKZT7T","created_at":"2026-07-05T06:18:09Z"}],"graph_snapshots":[{"event_id":"sha256:30dc578ce9d00faf65bf965b846c0b28214ce8c19f350e51e161ef636ccf6475","target":"graph","created_at":"2026-07-05T06:18:09Z","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/2212.03214/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Belief propagation (BP) is well-known as a low complexity decoding algorithm with a strong performance for important classes of quantum error correcting codes, e.g. notably for the quantum low-density parity check (LDPC) code class of random expander codes. However, it is also well-known that the performance of BP breaks down when facing topological codes such as the surface code, where naive BP fails entirely to reach a below-threshold regime, i.e. the regime where error correction becomes useful. Previous works have shown, that this can be remedied by resorting to post-processing decoders ou","authors_text":"Josias Old, Manuel Rispler","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-06T18:37:27Z","title":"Generalized Belief Propagation Algorithms for Decoding of Surface Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.03214","kind":"arxiv","version":2},"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:ec8890fa7b82aa057db8ad58dd34ae4181d6aad9f4b68c60fa8187479104502a","target":"record","created_at":"2026-07-05T06:18:09Z","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":"b14a4330f400d2f39ea5d41ae0ffb168708041884424377048d844b3b2e54d6f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-06T18:37:27Z","title_canon_sha256":"3c839cec774a3ac825f624335aaf2addb950ec85e60b96c91b906684268eeaa8"},"schema_version":"1.0","source":{"id":"2212.03214","kind":"arxiv","version":2}},"canonical_sha256":"cc2eaccff3fbefb911c1911f39a6f1264233a0b80a6f497121fb987591925ec5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc2eaccff3fbefb911c1911f39a6f1264233a0b80a6f497121fb987591925ec5","first_computed_at":"2026-07-05T06:18:09.726423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:18:09.726423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5xCBXrmP7iibxnM7TzyrHknuxNzqwbmoAeIp90bZ1KZkYchyqbeQgLo3+Q5bpM0ykTF9blvfpFPtjLl+cjitAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:18:09.726831Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.03214","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec8890fa7b82aa057db8ad58dd34ae4181d6aad9f4b68c60fa8187479104502a","sha256:30dc578ce9d00faf65bf965b846c0b28214ce8c19f350e51e161ef636ccf6475"],"state_sha256":"612a0de521af84465e047429a73e0f5d8f16cfd3052140457283b4d33346ed70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u++twEIsEQ+gegJAZK89sJ7MhLdjWWloUFvnUH97+bm3E+dCooQCekLJrG3OU/Ei8wfOhDQVdBwKQPxdh9DFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:51:27.039945Z","bundle_sha256":"a5ab5f38e0f4586f45d27882ea002a1f6bb6e395cff3846f54584654a8dca9f2"}}