{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DNK5ELLHCTDZ6ECGXADNFIUJMX","short_pith_number":"pith:DNK5ELLH","schema_version":"1.0","canonical_sha256":"1b55d22d6714c79f1046b806d2a28965dc829f51ce124387e4d0a3f5dec9e7e9","source":{"kind":"arxiv","id":"2111.03654","version":2},"attestation_state":"computed","paper":{"title":"Asymptotically Good Quantum and Locally Testable Classical LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Gleb Kalachev, Pavel Panteleev","submitted_at":"2021-11-05T17:59:15Z","abstract_excerpt":"We study classical and quantum LDPC codes of constant rate obtained by the lifted product construction over non-abelian groups. We show that the obtained families of quantum LDPC codes are asymptotically good, which proves the qLDPC conjecture. Moreover, we show that the produced classical LDPC codes are also asymptotically good and locally testable with constant query and soundness parameters, which proves a well-known conjecture in the field of locally testable codes."},"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":"2111.03654","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-11-05T17:59:15Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"e701f56f5d315884ee998d11e2620c47fc9eee70bb6b2d4e3996497d76faabc7","abstract_canon_sha256":"f80bf5622d7ed39aa2ca80a34fa2875c9ca78b7b5daa117aa756e512a451f731"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:50:26.249835Z","signature_b64":"Y0cvU/1cosKvAjKBdXrnYo0mDlh3m9TuNoMYcMRqolt3SK9fcbNgogPpJ9rMYURIUgIEB0Y56RQBKGNcliklCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b55d22d6714c79f1046b806d2a28965dc829f51ce124387e4d0a3f5dec9e7e9","last_reissued_at":"2026-07-05T03:50:26.249375Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:50:26.249375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically Good Quantum and Locally Testable Classical LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Gleb Kalachev, Pavel Panteleev","submitted_at":"2021-11-05T17:59:15Z","abstract_excerpt":"We study classical and quantum LDPC codes of constant rate obtained by the lifted product construction over non-abelian groups. We show that the obtained families of quantum LDPC codes are asymptotically good, which proves the qLDPC conjecture. Moreover, we show that the produced classical LDPC codes are also asymptotically good and locally testable with constant query and soundness parameters, which proves a well-known conjecture in the field of locally testable codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.03654","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/2111.03654/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":"2111.03654","created_at":"2026-07-05T03:50:26.249431+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.03654v2","created_at":"2026-07-05T03:50:26.249431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.03654","created_at":"2026-07-05T03:50:26.249431+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNK5ELLHCTDZ","created_at":"2026-07-05T03:50:26.249431+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNK5ELLHCTDZ6ECG","created_at":"2026-07-05T03:50:26.249431+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNK5ELLH","created_at":"2026-07-05T03:50:26.249431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25011","citing_title":"Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20513","citing_title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08771","citing_title":"Algebra of Bivariate-Bicycle Surface Codes","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15348","citing_title":"Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21919","citing_title":"Algorithmic Locality via Provable Convergence in Quantum Tensor Networks","ref_index":64,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DNK5ELLHCTDZ6ECGXADNFIUJMX","json":"https://pith.science/pith/DNK5ELLHCTDZ6ECGXADNFIUJMX.json","graph_json":"https://pith.science/api/pith-number/DNK5ELLHCTDZ6ECGXADNFIUJMX/graph.json","events_json":"https://pith.science/api/pith-number/DNK5ELLHCTDZ6ECGXADNFIUJMX/events.json","paper":"https://pith.science/paper/DNK5ELLH"},"agent_actions":{"view_html":"https://pith.science/pith/DNK5ELLHCTDZ6ECGXADNFIUJMX","download_json":"https://pith.science/pith/DNK5ELLHCTDZ6ECGXADNFIUJMX.json","view_paper":"https://pith.science/paper/DNK5ELLH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.03654&json=true","fetch_graph":"https://pith.science/api/pith-number/DNK5ELLHCTDZ6ECGXADNFIUJMX/graph.json","fetch_events":"https://pith.science/api/pith-number/DNK5ELLHCTDZ6ECGXADNFIUJMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNK5ELLHCTDZ6ECGXADNFIUJMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNK5ELLHCTDZ6ECGXADNFIUJMX/action/storage_attestation","attest_author":"https://pith.science/pith/DNK5ELLHCTDZ6ECGXADNFIUJMX/action/author_attestation","sign_citation":"https://pith.science/pith/DNK5ELLHCTDZ6ECGXADNFIUJMX/action/citation_signature","submit_replication":"https://pith.science/pith/DNK5ELLHCTDZ6ECGXADNFIUJMX/action/replication_record"}},"created_at":"2026-07-05T03:50:26.249431+00:00","updated_at":"2026-07-05T03:50:26.249431+00:00"}