{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BEM4I6BOUARGNZYYUHSITBGSIE","short_pith_number":"pith:BEM4I6BO","schema_version":"1.0","canonical_sha256":"0919c4782ea02266e718a1e48984d2411a660e61c31c1a26a3ecfb8c6db6dd4a","source":{"kind":"arxiv","id":"1809.10145","version":1},"attestation_state":"computed","paper":{"title":"Cellular-automaton decoders with provable thresholds for topological codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, John Preskill","submitted_at":"2018-09-26T18:00:00Z","abstract_excerpt":"We propose a new cellular automaton (CA), the Sweep Rule, which generalizes Toom's rule to any locally Euclidean lattice. We use the Sweep Rule to design a local decoder for the toric code in $d\\geq 3$ dimensions, the Sweep Decoder, and rigorously establish a lower bound on its performance. We also numerically estimate the Sweep Decoder threshold for the three-dimensional toric code on the cubic and body-centered cubic lattices for phenomenological phase-flip noise. Our results lead to new CA decoders with provable error-correction thresholds for other topological quantum codes including the c"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1809.10145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-09-26T18:00:00Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"1988c55caf033a2855b39ebb71132178535664b75742aeee5b4fd9272d53eea7","abstract_canon_sha256":"29a7c1a811042e6e0805f8e8cac6a476cbd8a579b7135b1d2e319c30bc06afd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:34.363591Z","signature_b64":"Dk0diShBNUaadIVVewDWJZKCoPIy83H6bod+JRloS/A5wv1bgwlh5Im2tLd4rMoWAWRcAT7JpEhLl280UKy4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0919c4782ea02266e718a1e48984d2411a660e61c31c1a26a3ecfb8c6db6dd4a","last_reissued_at":"2026-05-17T23:40:34.362799Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:34.362799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cellular-automaton decoders with provable thresholds for topological codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, John Preskill","submitted_at":"2018-09-26T18:00:00Z","abstract_excerpt":"We propose a new cellular automaton (CA), the Sweep Rule, which generalizes Toom's rule to any locally Euclidean lattice. We use the Sweep Rule to design a local decoder for the toric code in $d\\geq 3$ dimensions, the Sweep Decoder, and rigorously establish a lower bound on its performance. We also numerically estimate the Sweep Decoder threshold for the three-dimensional toric code on the cubic and body-centered cubic lattices for phenomenological phase-flip noise. Our results lead to new CA decoders with provable error-correction thresholds for other topological quantum codes including the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10145","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.10145","created_at":"2026-05-17T23:40:34.362929+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10145v1","created_at":"2026-05-17T23:40:34.362929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10145","created_at":"2026-05-17T23:40:34.362929+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEM4I6BOUARG","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEM4I6BOUARGNZYY","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEM4I6BO","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BEM4I6BOUARGNZYYUHSITBGSIE","json":"https://pith.science/pith/BEM4I6BOUARGNZYYUHSITBGSIE.json","graph_json":"https://pith.science/api/pith-number/BEM4I6BOUARGNZYYUHSITBGSIE/graph.json","events_json":"https://pith.science/api/pith-number/BEM4I6BOUARGNZYYUHSITBGSIE/events.json","paper":"https://pith.science/paper/BEM4I6BO"},"agent_actions":{"view_html":"https://pith.science/pith/BEM4I6BOUARGNZYYUHSITBGSIE","download_json":"https://pith.science/pith/BEM4I6BOUARGNZYYUHSITBGSIE.json","view_paper":"https://pith.science/paper/BEM4I6BO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10145&json=true","fetch_graph":"https://pith.science/api/pith-number/BEM4I6BOUARGNZYYUHSITBGSIE/graph.json","fetch_events":"https://pith.science/api/pith-number/BEM4I6BOUARGNZYYUHSITBGSIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEM4I6BOUARGNZYYUHSITBGSIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEM4I6BOUARGNZYYUHSITBGSIE/action/storage_attestation","attest_author":"https://pith.science/pith/BEM4I6BOUARGNZYYUHSITBGSIE/action/author_attestation","sign_citation":"https://pith.science/pith/BEM4I6BOUARGNZYYUHSITBGSIE/action/citation_signature","submit_replication":"https://pith.science/pith/BEM4I6BOUARGNZYYUHSITBGSIE/action/replication_record"}},"created_at":"2026-05-17T23:40:34.362929+00:00","updated_at":"2026-05-17T23:40:34.362929+00:00"}