{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2OOI2WJIOUHCEJRG6O52WKHL63","short_pith_number":"pith:2OOI2WJI","schema_version":"1.0","canonical_sha256":"d39c8d5928750e222626f3bbab28ebf6c39b078f290aeea5489c269a499737c5","source":{"kind":"arxiv","id":"2202.13641","version":3},"attestation_state":"computed","paper":{"title":"Quantum Tanner codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Anthony Leverrier, Gilles Z\\'emor","submitted_at":"2022-02-28T09:35:31Z","abstract_excerpt":"Tanner codes are long error correcting codes obtained from short codes and a graph, with bits on the edges and parity-check constraints from the short codes enforced at the vertices of the graph. Combining good short codes together with a spectral expander graph yields the celebrated expander codes of Sipser and Spielman, which are asymptotically good classical LDPC codes.\n  In this work we apply this prescription to the left-right Cayley complex that lies at the heart of the recent construction of a $c^3$ locally testable code by Dinur et al. Specifically, we view this complex as two graphs t"},"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":"2202.13641","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-02-28T09:35:31Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"212edfd4c409c074fcaa18fbcc645e5d8b413786cb22b2f34a1b45998f6766d9","abstract_canon_sha256":"8dc50589e75b47e2a73ccd959bfca7924ac970d653aa390bec5d7fbc60b14eb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:58:02.872763Z","signature_b64":"j+GxK3jYxRNrLcDjSg5g10k1sKXRW0c7LpRqDzdTqKm3bZEcV4NVpgNcZ9tRMGAu26zOakZA1L8Qa3V7XmJrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d39c8d5928750e222626f3bbab28ebf6c39b078f290aeea5489c269a499737c5","last_reissued_at":"2026-07-05T04:58:02.872308Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:58:02.872308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Tanner codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Anthony Leverrier, Gilles Z\\'emor","submitted_at":"2022-02-28T09:35:31Z","abstract_excerpt":"Tanner codes are long error correcting codes obtained from short codes and a graph, with bits on the edges and parity-check constraints from the short codes enforced at the vertices of the graph. Combining good short codes together with a spectral expander graph yields the celebrated expander codes of Sipser and Spielman, which are asymptotically good classical LDPC codes.\n  In this work we apply this prescription to the left-right Cayley complex that lies at the heart of the recent construction of a $c^3$ locally testable code by Dinur et al. Specifically, we view this complex as two graphs t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.13641","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/2202.13641/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":"2202.13641","created_at":"2026-07-05T04:58:02.872380+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.13641v3","created_at":"2026-07-05T04:58:02.872380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.13641","created_at":"2026-07-05T04:58:02.872380+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OOI2WJIOUHC","created_at":"2026-07-05T04:58:02.872380+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OOI2WJIOUHCEJRG","created_at":"2026-07-05T04:58:02.872380+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OOI2WJI","created_at":"2026-07-05T04:58:02.872380+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26090","citing_title":"Fast mixing of all-to-all quantum systems at high temperatures","ref_index":136,"is_internal_anchor":false},{"citing_arxiv_id":"2606.25011","citing_title":"Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20513","citing_title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28490","citing_title":"The subthreshold issue of fusion-based quantum computing","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2406.14445","citing_title":"High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15348","citing_title":"Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21919","citing_title":"Algorithmic Locality via Provable Convergence in Quantum Tensor Networks","ref_index":63,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2OOI2WJIOUHCEJRG6O52WKHL63","json":"https://pith.science/pith/2OOI2WJIOUHCEJRG6O52WKHL63.json","graph_json":"https://pith.science/api/pith-number/2OOI2WJIOUHCEJRG6O52WKHL63/graph.json","events_json":"https://pith.science/api/pith-number/2OOI2WJIOUHCEJRG6O52WKHL63/events.json","paper":"https://pith.science/paper/2OOI2WJI"},"agent_actions":{"view_html":"https://pith.science/pith/2OOI2WJIOUHCEJRG6O52WKHL63","download_json":"https://pith.science/pith/2OOI2WJIOUHCEJRG6O52WKHL63.json","view_paper":"https://pith.science/paper/2OOI2WJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.13641&json=true","fetch_graph":"https://pith.science/api/pith-number/2OOI2WJIOUHCEJRG6O52WKHL63/graph.json","fetch_events":"https://pith.science/api/pith-number/2OOI2WJIOUHCEJRG6O52WKHL63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OOI2WJIOUHCEJRG6O52WKHL63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OOI2WJIOUHCEJRG6O52WKHL63/action/storage_attestation","attest_author":"https://pith.science/pith/2OOI2WJIOUHCEJRG6O52WKHL63/action/author_attestation","sign_citation":"https://pith.science/pith/2OOI2WJIOUHCEJRG6O52WKHL63/action/citation_signature","submit_replication":"https://pith.science/pith/2OOI2WJIOUHCEJRG6O52WKHL63/action/replication_record"}},"created_at":"2026-07-05T04:58:02.872380+00:00","updated_at":"2026-07-05T04:58:02.872380+00:00"}