{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:B5OTF5NAFFJYAS3TXCTYSQWACV","short_pith_number":"pith:B5OTF5NA","schema_version":"1.0","canonical_sha256":"0f5d32f5a02953804b73b8a78942c015599a9c6f3825e2aea3fc0c18aa261b37","source":{"kind":"arxiv","id":"2601.08824","version":4},"attestation_state":"computed","paper":{"title":"Breaking the Orthogonality Barrier in Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Kenta Kasai","submitted_at":"2026-01-13T18:57:43Z","abstract_excerpt":"Classical low-density parity-check (LDPC) codes are a widely deployed and well-established technology, forming the backbone of modern communication and storage systems. It is well known that, in this classical setting, increasing the girth of the Tanner graph while maintaining regular degree distributions leads simultaneously to good belief-propagation (BP) decoding performance and large minimum distance. In the quantum setting, however, this principle does not directly apply because quantum LDPC codes must satisfy additional orthogonality constraints between their parity-check matrices. When "},"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":"2601.08824","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-01-13T18:57:43Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"73bd020172ae8f8dd2f2141874df0e7f2917bdf1b1ce24ecf9c06ecefaab0888","abstract_canon_sha256":"e6c84434b219088024011897ff3b8eb162f413c3909376abd305c68c37fad280"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:23:48.783085Z","signature_b64":"wMzB+JEd2sD7wC+aA0qYMri0RVy4bjcpnmgWC0AIEdyqSagzzNVmao5oVmDJBaM6bLd3rhiNX8aWqquPzwLzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f5d32f5a02953804b73b8a78942c015599a9c6f3825e2aea3fc0c18aa261b37","last_reissued_at":"2026-08-11T02:23:48.781203Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:23:48.781203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking the Orthogonality Barrier in Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Kenta Kasai","submitted_at":"2026-01-13T18:57:43Z","abstract_excerpt":"Classical low-density parity-check (LDPC) codes are a widely deployed and well-established technology, forming the backbone of modern communication and storage systems. It is well known that, in this classical setting, increasing the girth of the Tanner graph while maintaining regular degree distributions leads simultaneously to good belief-propagation (BP) decoding performance and large minimum distance. In the quantum setting, however, this principle does not directly apply because quantum LDPC codes must satisfy additional orthogonality constraints between their parity-check matrices. When "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.08824","kind":"arxiv","version":4},"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/2601.08824/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":"2601.08824","created_at":"2026-08-11T02:23:48.781989+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.08824v4","created_at":"2026-08-11T02:23:48.781989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.08824","created_at":"2026-08-11T02:23:48.781989+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5OTF5NAFFJY","created_at":"2026-08-11T02:23:48.781989+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5OTF5NAFFJYAS3T","created_at":"2026-08-11T02:23:48.781989+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5OTF5NA","created_at":"2026-08-11T02:23:48.781989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":13,"internal_anchor_count":13,"sample":[{"citing_arxiv_id":"2606.25011","citing_title":"Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2606.27130","citing_title":"Rate-2/3 Girth-8 (3,18)-Regular Quantum LDPC Codes from Two-Branch Finite-Field Bases and CPM Lifts","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20926","citing_title":"Learning-Based List Sequential Belief Propagation Decoding of Quantum LDPC Codes","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2606.07734","citing_title":"Exploring the landscape of compact magic-state distillation factories","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2606.05044","citing_title":"Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2606.03507","citing_title":"Full Extractors for Logical Processing in Hypergraph Product Codes","ref_index":63,"is_internal_anchor":true},{"citing_arxiv_id":"2605.23894","citing_title":"A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21204","citing_title":"PIQC: Scalable Distributed Quantum Computing via Photonic Integration of Designed Molecular Quantum Nodes","ref_index":82,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27817","citing_title":"High-Girth Regular Quantum LDPC Codes from Square-Base Hypergraph Products via CPM Lifts","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2604.08358","citing_title":"Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2604.15307","citing_title":"Heuristic Search for Minimum-Distance Upper-Bound Witnesses in Quantum APM-LDPC Codes","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2604.16209","citing_title":"Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2604.20838","citing_title":"High-Girth Regular Quantum LDPC Codes from Affine-Coset Structures","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B5OTF5NAFFJYAS3TXCTYSQWACV","json":"https://pith.science/pith/B5OTF5NAFFJYAS3TXCTYSQWACV.json","graph_json":"https://pith.science/api/pith-number/B5OTF5NAFFJYAS3TXCTYSQWACV/graph.json","events_json":"https://pith.science/api/pith-number/B5OTF5NAFFJYAS3TXCTYSQWACV/events.json","paper":"https://pith.science/paper/B5OTF5NA"},"agent_actions":{"view_html":"https://pith.science/pith/B5OTF5NAFFJYAS3TXCTYSQWACV","download_json":"https://pith.science/pith/B5OTF5NAFFJYAS3TXCTYSQWACV.json","view_paper":"https://pith.science/paper/B5OTF5NA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.08824&json=true","fetch_graph":"https://pith.science/api/pith-number/B5OTF5NAFFJYAS3TXCTYSQWACV/graph.json","fetch_events":"https://pith.science/api/pith-number/B5OTF5NAFFJYAS3TXCTYSQWACV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5OTF5NAFFJYAS3TXCTYSQWACV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5OTF5NAFFJYAS3TXCTYSQWACV/action/storage_attestation","attest_author":"https://pith.science/pith/B5OTF5NAFFJYAS3TXCTYSQWACV/action/author_attestation","sign_citation":"https://pith.science/pith/B5OTF5NAFFJYAS3TXCTYSQWACV/action/citation_signature","submit_replication":"https://pith.science/pith/B5OTF5NAFFJYAS3TXCTYSQWACV/action/replication_record"}},"created_at":"2026-08-11T02:23:48.781989+00:00","updated_at":"2026-08-11T02:23:48.781989+00:00"}