{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:S5QA46ZWCQS7473O6HUJX4TS3W","short_pith_number":"pith:S5QA46ZW","canonical_record":{"source":{"id":"2402.04834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-02-07T13:32:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"59b690b5bbc8f30cace85e2e62ba3a32805ef891a660a3c23f547258deb7a470","abstract_canon_sha256":"daf0ef1d8a6e2ab467359f0667556bee51b77add84a4ec4ecdacb242adfbd932"},"schema_version":"1.0"},"canonical_sha256":"97600e7b361425fe7f6ef1e89bf272ddae544481591a7eda1855911f7f85d344","source":{"kind":"arxiv","id":"2402.04834","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.04834","created_at":"2026-07-05T08:08:20Z"},{"alias_kind":"arxiv_version","alias_value":"2402.04834v2","created_at":"2026-07-05T08:08:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.04834","created_at":"2026-07-05T08:08:20Z"},{"alias_kind":"pith_short_12","alias_value":"S5QA46ZWCQS7","created_at":"2026-07-05T08:08:20Z"},{"alias_kind":"pith_short_16","alias_value":"S5QA46ZWCQS7473O","created_at":"2026-07-05T08:08:20Z"},{"alias_kind":"pith_short_8","alias_value":"S5QA46ZW","created_at":"2026-07-05T08:08:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:S5QA46ZWCQS7473O6HUJX4TS3W","target":"record","payload":{"canonical_record":{"source":{"id":"2402.04834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-02-07T13:32:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"59b690b5bbc8f30cace85e2e62ba3a32805ef891a660a3c23f547258deb7a470","abstract_canon_sha256":"daf0ef1d8a6e2ab467359f0667556bee51b77add84a4ec4ecdacb242adfbd932"},"schema_version":"1.0"},"canonical_sha256":"97600e7b361425fe7f6ef1e89bf272ddae544481591a7eda1855911f7f85d344","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:08:20.684791Z","signature_b64":"fptHzBdKed5KzRvOxFTEWQCe34CvZ4pUeGS1nlJIHhck63cISeuBtriZA6uVBsO5NAuA9yBnQwufGbsEPmdDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97600e7b361425fe7f6ef1e89bf272ddae544481591a7eda1855911f7f85d344","last_reissued_at":"2026-07-05T08:08:20.684309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:08:20.684309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.04834","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-05T08:08:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cetuES8DBVT1TAws1xDIlf6Cblev3MzXCXkfuwdq1ln95txRdB4wr1xwZcdaepwzvEQzRZu1oAY8ivSGwBO6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T07:39:45.735442Z"},"content_sha256":"3c38a5a167a6aceaa8a9a243e12e25ac5744829293992abe2932fe8841a0a28e","schema_version":"1.0","event_id":"sha256:3c38a5a167a6aceaa8a9a243e12e25ac5744829293992abe2932fe8841a0a28e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:S5QA46ZWCQS7473O6HUJX4TS3W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A blockBP decoder for the surface code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Aviad Kaufmann, Itai Arad","submitted_at":"2024-02-07T13:32:32Z","abstract_excerpt":"We present a new decoder for the surface code, which combines the accuracy of the tensor-network decoders with the efficiency and parallelism of the belief-propagation algorithm. Our main idea is to replace the expensive tensor-network contraction step in the tensor-network decoders with the blockBP algorithm - a recent approximate contraction algorithm, based on belief propagation. Our decoder is therefore a belief-propagation decoder that works in the degenerate maximal likelihood decoding framework. Unlike conventional tensor-network decoders, our algorithm can run efficiently in parallel, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.04834","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/2402.04834/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-05T08:08:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibmjNnaOs+aR3xbCd0cLQz6xFBi33218f+s0mZhlGxlbXMGYWl2t9iJvh0vbA8MA26tKhkalNa2A5S7MqmaiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T07:39:45.735971Z"},"content_sha256":"3c640ae0453ff6eacacd03e10d8e92e544aaa2df4d62f9e552d0f8b811fbe1dd","schema_version":"1.0","event_id":"sha256:3c640ae0453ff6eacacd03e10d8e92e544aaa2df4d62f9e552d0f8b811fbe1dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5QA46ZWCQS7473O6HUJX4TS3W/bundle.json","state_url":"https://pith.science/pith/S5QA46ZWCQS7473O6HUJX4TS3W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5QA46ZWCQS7473O6HUJX4TS3W/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-17T07:39:45Z","links":{"resolver":"https://pith.science/pith/S5QA46ZWCQS7473O6HUJX4TS3W","bundle":"https://pith.science/pith/S5QA46ZWCQS7473O6HUJX4TS3W/bundle.json","state":"https://pith.science/pith/S5QA46ZWCQS7473O6HUJX4TS3W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5QA46ZWCQS7473O6HUJX4TS3W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:S5QA46ZWCQS7473O6HUJX4TS3W","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":"daf0ef1d8a6e2ab467359f0667556bee51b77add84a4ec4ecdacb242adfbd932","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-02-07T13:32:32Z","title_canon_sha256":"59b690b5bbc8f30cace85e2e62ba3a32805ef891a660a3c23f547258deb7a470"},"schema_version":"1.0","source":{"id":"2402.04834","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.04834","created_at":"2026-07-05T08:08:20Z"},{"alias_kind":"arxiv_version","alias_value":"2402.04834v2","created_at":"2026-07-05T08:08:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.04834","created_at":"2026-07-05T08:08:20Z"},{"alias_kind":"pith_short_12","alias_value":"S5QA46ZWCQS7","created_at":"2026-07-05T08:08:20Z"},{"alias_kind":"pith_short_16","alias_value":"S5QA46ZWCQS7473O","created_at":"2026-07-05T08:08:20Z"},{"alias_kind":"pith_short_8","alias_value":"S5QA46ZW","created_at":"2026-07-05T08:08:20Z"}],"graph_snapshots":[{"event_id":"sha256:3c640ae0453ff6eacacd03e10d8e92e544aaa2df4d62f9e552d0f8b811fbe1dd","target":"graph","created_at":"2026-07-05T08:08:20Z","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/2402.04834/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new decoder for the surface code, which combines the accuracy of the tensor-network decoders with the efficiency and parallelism of the belief-propagation algorithm. Our main idea is to replace the expensive tensor-network contraction step in the tensor-network decoders with the blockBP algorithm - a recent approximate contraction algorithm, based on belief propagation. Our decoder is therefore a belief-propagation decoder that works in the degenerate maximal likelihood decoding framework. Unlike conventional tensor-network decoders, our algorithm can run efficiently in parallel, ","authors_text":"Aviad Kaufmann, Itai Arad","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-02-07T13:32:32Z","title":"A blockBP decoder for the surface code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.04834","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:3c38a5a167a6aceaa8a9a243e12e25ac5744829293992abe2932fe8841a0a28e","target":"record","created_at":"2026-07-05T08:08:20Z","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":"daf0ef1d8a6e2ab467359f0667556bee51b77add84a4ec4ecdacb242adfbd932","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-02-07T13:32:32Z","title_canon_sha256":"59b690b5bbc8f30cace85e2e62ba3a32805ef891a660a3c23f547258deb7a470"},"schema_version":"1.0","source":{"id":"2402.04834","kind":"arxiv","version":2}},"canonical_sha256":"97600e7b361425fe7f6ef1e89bf272ddae544481591a7eda1855911f7f85d344","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97600e7b361425fe7f6ef1e89bf272ddae544481591a7eda1855911f7f85d344","first_computed_at":"2026-07-05T08:08:20.684309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:08:20.684309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fptHzBdKed5KzRvOxFTEWQCe34CvZ4pUeGS1nlJIHhck63cISeuBtriZA6uVBsO5NAuA9yBnQwufGbsEPmdDBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:08:20.684791Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.04834","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c38a5a167a6aceaa8a9a243e12e25ac5744829293992abe2932fe8841a0a28e","sha256:3c640ae0453ff6eacacd03e10d8e92e544aaa2df4d62f9e552d0f8b811fbe1dd"],"state_sha256":"1f403cf00bc459d2b085ac22d0c67e60b04a5be3e39b473b3fbff6d23960d8bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/DTMn5Pk3X7Kuqz5yknZQFNHM3nuVwodgpP6dKeI509UpZ/xr/lhdAelrH9HUH/dahEt5Ce7pWAsX/zs88BBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T07:39:45.741332Z","bundle_sha256":"52d76c4d4b17cda3e4fe6a9e06cea672f0efd44cdcfaf0e379a5303eea146de3"}}