{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SK4XSEQHOGXREB3WHI7V6KXW6E","short_pith_number":"pith:SK4XSEQH","canonical_record":{"source":{"id":"1006.1362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-06-07T20:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"ab6a910d82be9643fe424264aaf1b33dbc8d9abc2eed23e1324b21ffc0473cc4","abstract_canon_sha256":"50c10c76882fa19d02cf9bbcd936251ef372f96048e920b055f81bbfde2c45ae"},"schema_version":"1.0"},"canonical_sha256":"92b979120771af1207763a3f5f2af6f10e08a34bc268de88306abed1476fe58f","source":{"kind":"arxiv","id":"1006.1362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1362","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1362v1","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1362","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"SK4XSEQHOGXR","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SK4XSEQHOGXREB3W","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SK4XSEQH","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SK4XSEQHOGXREB3WHI7V6KXW6E","target":"record","payload":{"canonical_record":{"source":{"id":"1006.1362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-06-07T20:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"ab6a910d82be9643fe424264aaf1b33dbc8d9abc2eed23e1324b21ffc0473cc4","abstract_canon_sha256":"50c10c76882fa19d02cf9bbcd936251ef372f96048e920b055f81bbfde2c45ae"},"schema_version":"1.0"},"canonical_sha256":"92b979120771af1207763a3f5f2af6f10e08a34bc268de88306abed1476fe58f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:15.232327Z","signature_b64":"i6MPHGMom6Jpn2F6noFmWOMMJhDNG+LPlvQCX03Rdscz24L3/cDoiXt2+Lkh8HyGQ14APyP17+q9UTjMcfArDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92b979120771af1207763a3f5f2af6f10e08a34bc268de88306abed1476fe58f","last_reissued_at":"2026-05-18T04:02:15.231616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:15.231616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.1362","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-18T04:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OTShth1Uy5FQwAd5aS6Vq0On7z+ABCsyvN5MB79pPq6+4uIaCTFaoD4tECxnTRqX+o+WVNdAwO6PPhOULxFEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:25:13.012901Z"},"content_sha256":"af735c18ebfc59c296417d6b0bf77c4becb8ace3327ab7bad28caffec95a4574","schema_version":"1.0","event_id":"sha256:af735c18ebfc59c296417d6b0bf77c4becb8ace3327ab7bad28caffec95a4574"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SK4XSEQHOGXREB3WHI7V6KXW6E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A renormalization group decoding algorithm for topological quantum codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Poulin, Guillaume Duclos-Cianci","submitted_at":"2010-06-07T20:05:42Z","abstract_excerpt":"Topological quantum error-correcting codes are defined by geometrically local checks on a two-dimensional lattice of quantum bits (qubits), making them particularly well suited for fault-tolerant quantum information processing. Here, we present a decoding algorithm for topological codes that is faster than previously known algorithms and applies to a wider class of topological codes. Our algorithm makes use of two methods inspired from statistical physics: renormalization groups and mean-field approximations. First, the topological code is approximated by a concatenated block code that can be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1362","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":""},"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-05-18T04:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qsOYVFmD8jxgUoMeEKx8K4wdu9+Eg7qKQWevocGr4bFqwD010fMz62lZrQb0/Q3sAqmAasrckSfreLSxMPbGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:25:13.013648Z"},"content_sha256":"70418ce297e3e524841ec46032c90580f1fb5d57be9eb9c1c588c975ca6a8e49","schema_version":"1.0","event_id":"sha256:70418ce297e3e524841ec46032c90580f1fb5d57be9eb9c1c588c975ca6a8e49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SK4XSEQHOGXREB3WHI7V6KXW6E/bundle.json","state_url":"https://pith.science/pith/SK4XSEQHOGXREB3WHI7V6KXW6E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SK4XSEQHOGXREB3WHI7V6KXW6E/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-25T05:25:13Z","links":{"resolver":"https://pith.science/pith/SK4XSEQHOGXREB3WHI7V6KXW6E","bundle":"https://pith.science/pith/SK4XSEQHOGXREB3WHI7V6KXW6E/bundle.json","state":"https://pith.science/pith/SK4XSEQHOGXREB3WHI7V6KXW6E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SK4XSEQHOGXREB3WHI7V6KXW6E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SK4XSEQHOGXREB3WHI7V6KXW6E","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":"50c10c76882fa19d02cf9bbcd936251ef372f96048e920b055f81bbfde2c45ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-06-07T20:05:42Z","title_canon_sha256":"ab6a910d82be9643fe424264aaf1b33dbc8d9abc2eed23e1324b21ffc0473cc4"},"schema_version":"1.0","source":{"id":"1006.1362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1362","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1362v1","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1362","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"SK4XSEQHOGXR","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SK4XSEQHOGXREB3W","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SK4XSEQH","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:70418ce297e3e524841ec46032c90580f1fb5d57be9eb9c1c588c975ca6a8e49","target":"graph","created_at":"2026-05-18T04:02:15Z","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"},"paper":{"abstract_excerpt":"Topological quantum error-correcting codes are defined by geometrically local checks on a two-dimensional lattice of quantum bits (qubits), making them particularly well suited for fault-tolerant quantum information processing. Here, we present a decoding algorithm for topological codes that is faster than previously known algorithms and applies to a wider class of topological codes. Our algorithm makes use of two methods inspired from statistical physics: renormalization groups and mean-field approximations. First, the topological code is approximated by a concatenated block code that can be ","authors_text":"David Poulin, Guillaume Duclos-Cianci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-06-07T20:05:42Z","title":"A renormalization group decoding algorithm for topological quantum codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1362","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:af735c18ebfc59c296417d6b0bf77c4becb8ace3327ab7bad28caffec95a4574","target":"record","created_at":"2026-05-18T04:02:15Z","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":"50c10c76882fa19d02cf9bbcd936251ef372f96048e920b055f81bbfde2c45ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-06-07T20:05:42Z","title_canon_sha256":"ab6a910d82be9643fe424264aaf1b33dbc8d9abc2eed23e1324b21ffc0473cc4"},"schema_version":"1.0","source":{"id":"1006.1362","kind":"arxiv","version":1}},"canonical_sha256":"92b979120771af1207763a3f5f2af6f10e08a34bc268de88306abed1476fe58f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92b979120771af1207763a3f5f2af6f10e08a34bc268de88306abed1476fe58f","first_computed_at":"2026-05-18T04:02:15.231616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:15.231616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i6MPHGMom6Jpn2F6noFmWOMMJhDNG+LPlvQCX03Rdscz24L3/cDoiXt2+Lkh8HyGQ14APyP17+q9UTjMcfArDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:15.232327Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.1362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af735c18ebfc59c296417d6b0bf77c4becb8ace3327ab7bad28caffec95a4574","sha256:70418ce297e3e524841ec46032c90580f1fb5d57be9eb9c1c588c975ca6a8e49"],"state_sha256":"ade5b464b0cf070f36910baed4e789877666abb81c019677e000e2dd922ce9a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ro96HY+wq/wIx9obj8kEDK7E3nx1nqowuyn0cPIFkQYcrDitsXI5NNCPqfsBqDi3G/eCOLMAXfus4GNrnp6FBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:25:13.017298Z","bundle_sha256":"5e2ddb19259ce204ed63dbff5a71c9104086f96d2e61782b811b54998b22b5ba"}}