{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GWCFVSQEOKS3U4PX7P4L3J4CH5","short_pith_number":"pith:GWCFVSQE","schema_version":"1.0","canonical_sha256":"35845aca0472a5ba71f7fbf8bda7823f60dafe85c247e47f13bd2a18684606e1","source":{"kind":"arxiv","id":"2412.19803","version":3},"attestation_state":"computed","paper":{"title":"A local automaton for the 2D toric code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.stat-mech","cond-mat.str-el","math.PR","nlin.CG"],"primary_cat":"quant-ph","authors_text":"Ethan Lake, Margarita Davydova, Shankar Balasubramanian","submitted_at":"2024-12-27T18:59:57Z","abstract_excerpt":"We construct a local decoder for the 2D toric code using ideas from the hierarchical classical cellular automata of Tsirelson and G\\'acs. Our decoder is a circuit of strictly local quantum operations preserving a logical state for exponential time in the presence of circuit-level noise without the need for non-local classical computation or communication. Our construction is not translation invariant in spacetime, but can be made time-translation invariant in 3D with stacks of 2D toric codes. This solves the open problem of constructing a local topological quantum memory below four dimensions."},"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":"2412.19803","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-27T18:59:57Z","cross_cats_sorted":["cond-mat.stat-mech","cond-mat.str-el","math.PR","nlin.CG"],"title_canon_sha256":"11632af4b2ca469ef5600a3ee6849e7e1763ab62e27e159b5ca49ee2d2114008","abstract_canon_sha256":"8a0a7259e41c585e6c9a7c30e4d33811e65ab0ab98209c36c1ac3dcbf4baf893"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:10.402896Z","signature_b64":"ebBUQdOF5RD2otbX2zwHH7HyyD6mKBYrQQ5eEK7GC3TzXlrAioqXsComr+VCxpXA9R5Xlb19WHOPdmt1F9gFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35845aca0472a5ba71f7fbf8bda7823f60dafe85c247e47f13bd2a18684606e1","last_reissued_at":"2026-05-26T01:03:10.401944Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:10.401944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A local automaton for the 2D toric code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.stat-mech","cond-mat.str-el","math.PR","nlin.CG"],"primary_cat":"quant-ph","authors_text":"Ethan Lake, Margarita Davydova, Shankar Balasubramanian","submitted_at":"2024-12-27T18:59:57Z","abstract_excerpt":"We construct a local decoder for the 2D toric code using ideas from the hierarchical classical cellular automata of Tsirelson and G\\'acs. Our decoder is a circuit of strictly local quantum operations preserving a logical state for exponential time in the presence of circuit-level noise without the need for non-local classical computation or communication. Our construction is not translation invariant in spacetime, but can be made time-translation invariant in 3D with stacks of 2D toric codes. This solves the open problem of constructing a local topological quantum memory below four dimensions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19803","kind":"arxiv","version":3},"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/2412.19803/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.19803","created_at":"2026-05-26T01:03:10.402061+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.19803v3","created_at":"2026-05-26T01:03:10.402061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19803","created_at":"2026-05-26T01:03:10.402061+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWCFVSQEOKS3","created_at":"2026-05-26T01:03:10.402061+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWCFVSQEOKS3U4PX","created_at":"2026-05-26T01:03:10.402061+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWCFVSQE","created_at":"2026-05-26T01:03:10.402061+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2601.20818","citing_title":"Quantum Memory and Autonomous Computation in Two Dimensions","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2604.21866","citing_title":"High-performance cellular automaton decoders for quantum repetition and toric code","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GWCFVSQEOKS3U4PX7P4L3J4CH5","json":"https://pith.science/pith/GWCFVSQEOKS3U4PX7P4L3J4CH5.json","graph_json":"https://pith.science/api/pith-number/GWCFVSQEOKS3U4PX7P4L3J4CH5/graph.json","events_json":"https://pith.science/api/pith-number/GWCFVSQEOKS3U4PX7P4L3J4CH5/events.json","paper":"https://pith.science/paper/GWCFVSQE"},"agent_actions":{"view_html":"https://pith.science/pith/GWCFVSQEOKS3U4PX7P4L3J4CH5","download_json":"https://pith.science/pith/GWCFVSQEOKS3U4PX7P4L3J4CH5.json","view_paper":"https://pith.science/paper/GWCFVSQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.19803&json=true","fetch_graph":"https://pith.science/api/pith-number/GWCFVSQEOKS3U4PX7P4L3J4CH5/graph.json","fetch_events":"https://pith.science/api/pith-number/GWCFVSQEOKS3U4PX7P4L3J4CH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWCFVSQEOKS3U4PX7P4L3J4CH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWCFVSQEOKS3U4PX7P4L3J4CH5/action/storage_attestation","attest_author":"https://pith.science/pith/GWCFVSQEOKS3U4PX7P4L3J4CH5/action/author_attestation","sign_citation":"https://pith.science/pith/GWCFVSQEOKS3U4PX7P4L3J4CH5/action/citation_signature","submit_replication":"https://pith.science/pith/GWCFVSQEOKS3U4PX7P4L3J4CH5/action/replication_record"}},"created_at":"2026-05-26T01:03:10.402061+00:00","updated_at":"2026-05-26T01:03:10.402061+00:00"}