{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:G4ZJ7OOBDELAXZOCEYX5T73QBV","short_pith_number":"pith:G4ZJ7OOB","schema_version":"1.0","canonical_sha256":"37329fb9c119160be5c2262fd9ff700d5c72b8cb26384e0510a1e35ad3665f29","source":{"kind":"arxiv","id":"2308.15520","version":2},"attestation_state":"computed","paper":{"title":"Distance-preserving stabilizer measurements in hypergraph product codes","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Argyris Giannisis Manes, Jahan Claes","submitted_at":"2023-08-29T18:00:00Z","abstract_excerpt":"Unlike the surface code, quantum low-density parity-check (QLDPC) codes can have a finite encoding rate, potentially lowering the error correction overhead. However, finite-rate QLDPC codes have nonlocal stabilizers, making it difficult to design stabilizer measurement circuits that are low-depth and do not decrease the effective distance. Here, we demonstrate that a popular family of finite-rate QLDPC codes, hypergraph product codes, has the convenient property of distance-robustness: any stabilizer measurement circuit preserves the effective distance. In particular, we prove the depth-optima"},"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":"2308.15520","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-29T18:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"74a1e65d7427ae94e567a1baaf93f846574db207c315d39dfbc1e7c6bfbdfd74","abstract_canon_sha256":"2d3698856ede9c72852c4d5498588f1061a1cff6101c03d678063542b8483b32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:38.337252Z","signature_b64":"W9IKjRKaBLR5X9svfV+NzjagqVlBpVyPED/j27RH9wSAefwQgUME88hW7lLLWMEQJv6/0GEnJwvY5lZzQfeRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37329fb9c119160be5c2262fd9ff700d5c72b8cb26384e0510a1e35ad3665f29","last_reissued_at":"2026-07-05T10:07:38.336776Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:38.336776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance-preserving stabilizer measurements in hypergraph product codes","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Argyris Giannisis Manes, Jahan Claes","submitted_at":"2023-08-29T18:00:00Z","abstract_excerpt":"Unlike the surface code, quantum low-density parity-check (QLDPC) codes can have a finite encoding rate, potentially lowering the error correction overhead. However, finite-rate QLDPC codes have nonlocal stabilizers, making it difficult to design stabilizer measurement circuits that are low-depth and do not decrease the effective distance. Here, we demonstrate that a popular family of finite-rate QLDPC codes, hypergraph product codes, has the convenient property of distance-robustness: any stabilizer measurement circuit preserves the effective distance. In particular, we prove the depth-optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15520","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/2308.15520/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":"2308.15520","created_at":"2026-07-05T10:07:38.336832+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.15520v2","created_at":"2026-07-05T10:07:38.336832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15520","created_at":"2026-07-05T10:07:38.336832+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4ZJ7OOBDELA","created_at":"2026-07-05T10:07:38.336832+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4ZJ7OOBDELAXZOC","created_at":"2026-07-05T10:07:38.336832+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4ZJ7OOB","created_at":"2026-07-05T10:07:38.336832+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.24739","citing_title":"CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling","ref_index":63,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G4ZJ7OOBDELAXZOCEYX5T73QBV","json":"https://pith.science/pith/G4ZJ7OOBDELAXZOCEYX5T73QBV.json","graph_json":"https://pith.science/api/pith-number/G4ZJ7OOBDELAXZOCEYX5T73QBV/graph.json","events_json":"https://pith.science/api/pith-number/G4ZJ7OOBDELAXZOCEYX5T73QBV/events.json","paper":"https://pith.science/paper/G4ZJ7OOB"},"agent_actions":{"view_html":"https://pith.science/pith/G4ZJ7OOBDELAXZOCEYX5T73QBV","download_json":"https://pith.science/pith/G4ZJ7OOBDELAXZOCEYX5T73QBV.json","view_paper":"https://pith.science/paper/G4ZJ7OOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.15520&json=true","fetch_graph":"https://pith.science/api/pith-number/G4ZJ7OOBDELAXZOCEYX5T73QBV/graph.json","fetch_events":"https://pith.science/api/pith-number/G4ZJ7OOBDELAXZOCEYX5T73QBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4ZJ7OOBDELAXZOCEYX5T73QBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4ZJ7OOBDELAXZOCEYX5T73QBV/action/storage_attestation","attest_author":"https://pith.science/pith/G4ZJ7OOBDELAXZOCEYX5T73QBV/action/author_attestation","sign_citation":"https://pith.science/pith/G4ZJ7OOBDELAXZOCEYX5T73QBV/action/citation_signature","submit_replication":"https://pith.science/pith/G4ZJ7OOBDELAXZOCEYX5T73QBV/action/replication_record"}},"created_at":"2026-07-05T10:07:38.336832+00:00","updated_at":"2026-07-05T10:07:38.336832+00:00"}