{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CB35L3TBSR4APXQLAOQR6T2PG4","short_pith_number":"pith:CB35L3TB","schema_version":"1.0","canonical_sha256":"1077d5ee61947807de0b03a11f4f4f3727adcd6588ec9759d2e97a4c15f1f62a","source":{"kind":"arxiv","id":"2411.03202","version":3},"attestation_state":"computed","paper":{"title":"Architectures for Heterogeneous Quantum Error Correction Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ali Javadi-Abhari, Andrew W. Cross, Ang Li, Charles Guinn, Chenxu Liu, Kun Liu, Samuel Stein, Shifan Xu, Theodore J. Yoder, Yongshan Ding, Yufei Ding, Zeyuan Zhou","submitted_at":"2024-11-05T15:49:02Z","abstract_excerpt":"Quantum Error Correction (QEC) is essential for future quantum computers due to its ability to exponentially suppress physical errors. The surface code is a leading error-correcting code candidate because of its local topological structure, experimentally achievable thresholds, and support for universal gate operations with magic states. However, its physical overhead scales quadratically with number of correctable errors. Conversely, quantum low-density parity-check (qLDPC) codes offer superior scaling but lack, on their own, a clear path to universal logical computation. Therefore, it is bec"},"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":"2411.03202","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-05T15:49:02Z","cross_cats_sorted":[],"title_canon_sha256":"89f205b570e20fba07942cbc956545c771f410f296e09912b7a43e0e59fa5e84","abstract_canon_sha256":"dde8d637c96a39d55269a3eea7ef19e7293158a9f2435eda3e6d147e55beb687"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:40.425389Z","signature_b64":"Tbse78851AwYtlL+6KG5RBLJjxkjeh2QtMV4BRPfGSn6icsY6G7R2/dMeflHFecv8QrRDO9UAdl5/unYO5xLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1077d5ee61947807de0b03a11f4f4f3727adcd6588ec9759d2e97a4c15f1f62a","last_reissued_at":"2026-07-05T09:33:40.424892Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:40.424892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Architectures for Heterogeneous Quantum Error Correction Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ali Javadi-Abhari, Andrew W. Cross, Ang Li, Charles Guinn, Chenxu Liu, Kun Liu, Samuel Stein, Shifan Xu, Theodore J. Yoder, Yongshan Ding, Yufei Ding, Zeyuan Zhou","submitted_at":"2024-11-05T15:49:02Z","abstract_excerpt":"Quantum Error Correction (QEC) is essential for future quantum computers due to its ability to exponentially suppress physical errors. The surface code is a leading error-correcting code candidate because of its local topological structure, experimentally achievable thresholds, and support for universal gate operations with magic states. However, its physical overhead scales quadratically with number of correctable errors. Conversely, quantum low-density parity-check (qLDPC) codes offer superior scaling but lack, on their own, a clear path to universal logical computation. Therefore, it is bec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03202","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/2411.03202/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":"2411.03202","created_at":"2026-07-05T09:33:40.424951+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.03202v3","created_at":"2026-07-05T09:33:40.424951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03202","created_at":"2026-07-05T09:33:40.424951+00:00"},{"alias_kind":"pith_short_12","alias_value":"CB35L3TBSR4A","created_at":"2026-07-05T09:33:40.424951+00:00"},{"alias_kind":"pith_short_16","alias_value":"CB35L3TBSR4APXQL","created_at":"2026-07-05T09:33:40.424951+00:00"},{"alias_kind":"pith_short_8","alias_value":"CB35L3TB","created_at":"2026-07-05T09:33:40.424951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2406.17995","citing_title":"Managing Classical Processing Requirements for Quantum Error Correction","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2601.10964","citing_title":"Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01149","citing_title":"ADaPT: Adaptive-window Decoding for Practical fault-Tolerance","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20013","citing_title":"Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06319","citing_title":"Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting","ref_index":82,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CB35L3TBSR4APXQLAOQR6T2PG4","json":"https://pith.science/pith/CB35L3TBSR4APXQLAOQR6T2PG4.json","graph_json":"https://pith.science/api/pith-number/CB35L3TBSR4APXQLAOQR6T2PG4/graph.json","events_json":"https://pith.science/api/pith-number/CB35L3TBSR4APXQLAOQR6T2PG4/events.json","paper":"https://pith.science/paper/CB35L3TB"},"agent_actions":{"view_html":"https://pith.science/pith/CB35L3TBSR4APXQLAOQR6T2PG4","download_json":"https://pith.science/pith/CB35L3TBSR4APXQLAOQR6T2PG4.json","view_paper":"https://pith.science/paper/CB35L3TB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.03202&json=true","fetch_graph":"https://pith.science/api/pith-number/CB35L3TBSR4APXQLAOQR6T2PG4/graph.json","fetch_events":"https://pith.science/api/pith-number/CB35L3TBSR4APXQLAOQR6T2PG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CB35L3TBSR4APXQLAOQR6T2PG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CB35L3TBSR4APXQLAOQR6T2PG4/action/storage_attestation","attest_author":"https://pith.science/pith/CB35L3TBSR4APXQLAOQR6T2PG4/action/author_attestation","sign_citation":"https://pith.science/pith/CB35L3TBSR4APXQLAOQR6T2PG4/action/citation_signature","submit_replication":"https://pith.science/pith/CB35L3TBSR4APXQLAOQR6T2PG4/action/replication_record"}},"created_at":"2026-07-05T09:33:40.424951+00:00","updated_at":"2026-07-05T09:33:40.424951+00:00"}