{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VRP6LCSE4VEV37G6PCPORMTUJH","short_pith_number":"pith:VRP6LCSE","schema_version":"1.0","canonical_sha256":"ac5fe58a44e5495dfcde789ee8b27449d8caf44c762a8e5595c097c46f48ce25","source":{"kind":"arxiv","id":"2206.06557","version":1},"attestation_state":"computed","paper":{"title":"An efficient decoder for a linear distance quantum LDPC code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Christopher A. Pattison, Eugene Tang, Shouzhen Gu","submitted_at":"2022-06-14T02:17:09Z","abstract_excerpt":"Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the efficient decodability of these codes. In this paper, we present a linear time decoder for the recent quantum Tanner codes construction of asymptotically good qLDPC codes, which can correct all errors of weight up to a constant fraction of the blocklength. Our decoder is an iterative algorithm which searches for corrections within constant-sized regions. At each step, the corrections are found by reducing a locally defined and ef"},"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":"2206.06557","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-06-14T02:17:09Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"00cfaa9f708e0dc96d2e5e486e8449a2bf1cf46efbf62b0530a71a8386b425a2","abstract_canon_sha256":"dcdab2f6a7fbb52d4986ceaa9c32a7d548fedbb23f5bfdb855fd7c46069fe64f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:43.450966Z","signature_b64":"e3VpRyX5iHOTWm7zLPZbQjxgDGLtOLiVbPKbXSQosj2I7Wb9lAh/56jVcYHw2CdEyKVTQo/e7XU0YX93qAzODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac5fe58a44e5495dfcde789ee8b27449d8caf44c762a8e5595c097c46f48ce25","last_reissued_at":"2026-07-05T04:31:43.450500Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:43.450500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient decoder for a linear distance quantum LDPC code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Christopher A. Pattison, Eugene Tang, Shouzhen Gu","submitted_at":"2022-06-14T02:17:09Z","abstract_excerpt":"Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the efficient decodability of these codes. In this paper, we present a linear time decoder for the recent quantum Tanner codes construction of asymptotically good qLDPC codes, which can correct all errors of weight up to a constant fraction of the blocklength. Our decoder is an iterative algorithm which searches for corrections within constant-sized regions. At each step, the corrections are found by reducing a locally defined and ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.06557","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.06557/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":"2206.06557","created_at":"2026-07-05T04:31:43.450562+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.06557v1","created_at":"2026-07-05T04:31:43.450562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.06557","created_at":"2026-07-05T04:31:43.450562+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRP6LCSE4VEV","created_at":"2026-07-05T04:31:43.450562+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRP6LCSE4VEV37G6","created_at":"2026-07-05T04:31:43.450562+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRP6LCSE","created_at":"2026-07-05T04:31:43.450562+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15848","citing_title":"Classifying Logical Gates in Quantum Codes via Cohomology Operations and Symmetry","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VRP6LCSE4VEV37G6PCPORMTUJH","json":"https://pith.science/pith/VRP6LCSE4VEV37G6PCPORMTUJH.json","graph_json":"https://pith.science/api/pith-number/VRP6LCSE4VEV37G6PCPORMTUJH/graph.json","events_json":"https://pith.science/api/pith-number/VRP6LCSE4VEV37G6PCPORMTUJH/events.json","paper":"https://pith.science/paper/VRP6LCSE"},"agent_actions":{"view_html":"https://pith.science/pith/VRP6LCSE4VEV37G6PCPORMTUJH","download_json":"https://pith.science/pith/VRP6LCSE4VEV37G6PCPORMTUJH.json","view_paper":"https://pith.science/paper/VRP6LCSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.06557&json=true","fetch_graph":"https://pith.science/api/pith-number/VRP6LCSE4VEV37G6PCPORMTUJH/graph.json","fetch_events":"https://pith.science/api/pith-number/VRP6LCSE4VEV37G6PCPORMTUJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRP6LCSE4VEV37G6PCPORMTUJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRP6LCSE4VEV37G6PCPORMTUJH/action/storage_attestation","attest_author":"https://pith.science/pith/VRP6LCSE4VEV37G6PCPORMTUJH/action/author_attestation","sign_citation":"https://pith.science/pith/VRP6LCSE4VEV37G6PCPORMTUJH/action/citation_signature","submit_replication":"https://pith.science/pith/VRP6LCSE4VEV37G6PCPORMTUJH/action/replication_record"}},"created_at":"2026-07-05T04:31:43.450562+00:00","updated_at":"2026-07-05T04:31:43.450562+00:00"}