{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SYJ7I3BOJ4TOJEIHTHJIOIMR7N","short_pith_number":"pith:SYJ7I3BO","schema_version":"1.0","canonical_sha256":"9613f46c2e4f26e4910799d2872191fb6b6213617ae0fdb6a751ff06d0d83198","source":{"kind":"arxiv","id":"2412.21171","version":4},"attestation_state":"computed","paper":{"title":"Quantum Error Correction near the Coding Theoretical Bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Daiki Komoto, Kenta Kasai","submitted_at":"2024-12-30T18:48:54Z","abstract_excerpt":"Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits. However, many impactful applications demand quantum computations with millions of logical qubits, necessitating highly scalable quantum error correction. In classical information theory, low-density parity-check (LDPC) codes can approach channel capacity efficiently. Yet, no quantum error-correcting codes with efficient decoding have been shown to approach the hashing bound - a fundamental limit on quantum capacity - despite decades of research. Here, we"},"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":"2412.21171","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-30T18:48:54Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ef9f7ebc0d2a93cbc97cdb44629a7d375f3a368e7118148a1a22d26f80a964c1","abstract_canon_sha256":"f82eae5e447ce4116ea22fc101cad931763864c423b1de517afbad43e909488f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:10.444187Z","signature_b64":"+5yeBDg7QLFoSXhrVl2k5u+6w9wwQ7Hn3CIVjoS2MHyTk4axpPvClfO+e7wSur8J1bb5IaVdJlh8Tet/vE4EBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9613f46c2e4f26e4910799d2872191fb6b6213617ae0fdb6a751ff06d0d83198","last_reissued_at":"2026-05-26T01:03:10.443238Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:10.443238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Error Correction near the Coding Theoretical Bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Daiki Komoto, Kenta Kasai","submitted_at":"2024-12-30T18:48:54Z","abstract_excerpt":"Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits. However, many impactful applications demand quantum computations with millions of logical qubits, necessitating highly scalable quantum error correction. In classical information theory, low-density parity-check (LDPC) codes can approach channel capacity efficiently. Yet, no quantum error-correcting codes with efficient decoding have been shown to approach the hashing bound - a fundamental limit on quantum capacity - despite decades of research. Here, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.21171","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/2412.21171/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":"2412.21171","created_at":"2026-05-26T01:03:10.443373+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.21171v4","created_at":"2026-05-26T01:03:10.443373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.21171","created_at":"2026-05-26T01:03:10.443373+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYJ7I3BOJ4TO","created_at":"2026-05-26T01:03:10.443373+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYJ7I3BOJ4TOJEIH","created_at":"2026-05-26T01:03:10.443373+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYJ7I3BO","created_at":"2026-05-26T01:03:10.443373+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2604.08358","citing_title":"Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2604.16209","citing_title":"Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N","json":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N.json","graph_json":"https://pith.science/api/pith-number/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/graph.json","events_json":"https://pith.science/api/pith-number/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/events.json","paper":"https://pith.science/paper/SYJ7I3BO"},"agent_actions":{"view_html":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N","download_json":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N.json","view_paper":"https://pith.science/paper/SYJ7I3BO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.21171&json=true","fetch_graph":"https://pith.science/api/pith-number/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/graph.json","fetch_events":"https://pith.science/api/pith-number/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/action/storage_attestation","attest_author":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/action/author_attestation","sign_citation":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/action/citation_signature","submit_replication":"https://pith.science/pith/SYJ7I3BOJ4TOJEIHTHJIOIMR7N/action/replication_record"}},"created_at":"2026-05-26T01:03:10.443373+00:00","updated_at":"2026-05-26T01:03:10.443373+00:00"}