{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RSDIRNJ7HPLQMGMCDIFMW4N3AV","short_pith_number":"pith:RSDIRNJ7","schema_version":"1.0","canonical_sha256":"8c8688b53f3bd70619821a0acb71bb05782bc6f38a1446a0f75a501d74892900","source":{"kind":"arxiv","id":"2510.06659","version":2},"attestation_state":"computed","paper":{"title":"Layer codes as partially self-correcting quantum memories","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Eugene Tang, Libor Caha, Shin Ho Choe, Shouzhen Gu, Zhiyang He","submitted_at":"2025-10-08T05:17:44Z","abstract_excerpt":"We investigate layer codes, a family of three-dimensional stabilizer codes that can achieve optimal scaling of code parameters and a polynomial energy barrier, as candidates for self-correcting quantum memories. First, we introduce two decoding algorithms for layer codes with provable guarantees for local stochastic and adversarial noise, respectively. We then prove that layer codes constitute partially self-correcting quantum memories which outperform previously analyzed models such as the cubic code and the welded solid code. Notably, we argue that partial self-correction without the require"},"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":"2510.06659","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-08T05:17:44Z","cross_cats_sorted":[],"title_canon_sha256":"98794f73a3b0b181a314680823b4cbf06375c091c5a2304ef3b6e7e67b15468c","abstract_canon_sha256":"2341f686099928bf1e08b2287978411a4145427e22fd39586dbb0b5c234cb6a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:17:46.710701Z","signature_b64":"wkSRcSHGrcV+0JmONn+hNkJSdJC8SjHpK66cEiwJvE2+TVDJcl5jZCOND8gMIl+jY7t+54VRqpvU9/bXu0EgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c8688b53f3bd70619821a0acb71bb05782bc6f38a1446a0f75a501d74892900","last_reissued_at":"2026-06-25T01:17:46.710272Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:17:46.710272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layer codes as partially self-correcting quantum memories","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Eugene Tang, Libor Caha, Shin Ho Choe, Shouzhen Gu, Zhiyang He","submitted_at":"2025-10-08T05:17:44Z","abstract_excerpt":"We investigate layer codes, a family of three-dimensional stabilizer codes that can achieve optimal scaling of code parameters and a polynomial energy barrier, as candidates for self-correcting quantum memories. First, we introduce two decoding algorithms for layer codes with provable guarantees for local stochastic and adversarial noise, respectively. We then prove that layer codes constitute partially self-correcting quantum memories which outperform previously analyzed models such as the cubic code and the welded solid code. Notably, we argue that partial self-correction without the require"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.06659","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/2510.06659/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":"2510.06659","created_at":"2026-06-25T01:17:46.710329+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.06659v2","created_at":"2026-06-25T01:17:46.710329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.06659","created_at":"2026-06-25T01:17:46.710329+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSDIRNJ7HPLQ","created_at":"2026-06-25T01:17:46.710329+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSDIRNJ7HPLQMGMC","created_at":"2026-06-25T01:17:46.710329+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSDIRNJ7","created_at":"2026-06-25T01:17:46.710329+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.19298","citing_title":"Translation-invariant quantum low-density parity-check codes from compactified fracton models","ref_index":58,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10943","citing_title":"A passive self-correcting quantum memory in three dimensions","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RSDIRNJ7HPLQMGMCDIFMW4N3AV","json":"https://pith.science/pith/RSDIRNJ7HPLQMGMCDIFMW4N3AV.json","graph_json":"https://pith.science/api/pith-number/RSDIRNJ7HPLQMGMCDIFMW4N3AV/graph.json","events_json":"https://pith.science/api/pith-number/RSDIRNJ7HPLQMGMCDIFMW4N3AV/events.json","paper":"https://pith.science/paper/RSDIRNJ7"},"agent_actions":{"view_html":"https://pith.science/pith/RSDIRNJ7HPLQMGMCDIFMW4N3AV","download_json":"https://pith.science/pith/RSDIRNJ7HPLQMGMCDIFMW4N3AV.json","view_paper":"https://pith.science/paper/RSDIRNJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.06659&json=true","fetch_graph":"https://pith.science/api/pith-number/RSDIRNJ7HPLQMGMCDIFMW4N3AV/graph.json","fetch_events":"https://pith.science/api/pith-number/RSDIRNJ7HPLQMGMCDIFMW4N3AV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSDIRNJ7HPLQMGMCDIFMW4N3AV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSDIRNJ7HPLQMGMCDIFMW4N3AV/action/storage_attestation","attest_author":"https://pith.science/pith/RSDIRNJ7HPLQMGMCDIFMW4N3AV/action/author_attestation","sign_citation":"https://pith.science/pith/RSDIRNJ7HPLQMGMCDIFMW4N3AV/action/citation_signature","submit_replication":"https://pith.science/pith/RSDIRNJ7HPLQMGMCDIFMW4N3AV/action/replication_record"}},"created_at":"2026-06-25T01:17:46.710329+00:00","updated_at":"2026-06-25T01:17:46.710329+00:00"}