{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PCLZMBEHCG6YQLMVGIJDMZUWF2","short_pith_number":"pith:PCLZMBEH","schema_version":"1.0","canonical_sha256":"789796048711bd882d9532123666962eac8cf63eb02fbd54323bd228ab099782","source":{"kind":"arxiv","id":"2607.28605","version":1},"attestation_state":"computed","paper":{"title":"Logical computation with canonical lifted product codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guo Zheng, Han Zheng, Liang Jiang, Qian Xu","submitted_at":"2026-07-30T17:55:34Z","abstract_excerpt":"High-rate quantum low-density parity-check (qLDPC) codes encode many logical qubits with low physical-qubit overhead, but realizing efficient fault-tolerant computation on such dense encodings remains a major challenge. Generic, code-agnostic techniques such as code surgery and gate teleportation apply broadly, but are difficult to make modular, low-overhead, and fully certifiable on complex high-rate codes whose structure is left unexploited. Here we overcome these obstacles by co-designing the code together with its logical instruction set for a broad family of \\emph{canonical} lifted-produc"},"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":"2607.28605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:55:34Z","cross_cats_sorted":[],"title_canon_sha256":"4ea8c05cc2d1992320aa0c4bf8b58353d136bd4b38e138a55240323aeb3db979","abstract_canon_sha256":"7851345dbd4ac675c19a9a7353bf7882ea96e01caca987c68fe9e3dc72418e62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"789796048711bd882d9532123666962eac8cf63eb02fbd54323bd228ab099782","last_reissued_at":"2026-07-31T01:39:04.871274Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:39:04.871274Z"},"graph_snapshot":{"paper":{"title":"Logical computation with canonical lifted product codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guo Zheng, Han Zheng, Liang Jiang, Qian Xu","submitted_at":"2026-07-30T17:55:34Z","abstract_excerpt":"High-rate quantum low-density parity-check (qLDPC) codes encode many logical qubits with low physical-qubit overhead, but realizing efficient fault-tolerant computation on such dense encodings remains a major challenge. Generic, code-agnostic techniques such as code surgery and gate teleportation apply broadly, but are difficult to make modular, low-overhead, and fully certifiable on complex high-rate codes whose structure is left unexploited. Here we overcome these obstacles by co-designing the code together with its logical instruction set for a broad family of \\emph{canonical} lifted-produc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28605","kind":"arxiv","version":1},"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/2607.28605/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":"2607.28605","created_at":"2026-07-31T01:39:04.874398+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28605v1","created_at":"2026-07-31T01:39:04.874398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28605","created_at":"2026-07-31T01:39:04.874398+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCLZMBEHCG6Y","created_at":"2026-07-31T01:39:04.874398+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCLZMBEHCG6YQLMV","created_at":"2026-07-31T01:39:04.874398+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCLZMBEH","created_at":"2026-07-31T01:39:04.874398+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2","json":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2.json","graph_json":"https://pith.science/api/pith-number/PCLZMBEHCG6YQLMVGIJDMZUWF2/graph.json","events_json":"https://pith.science/api/pith-number/PCLZMBEHCG6YQLMVGIJDMZUWF2/events.json","paper":"https://pith.science/paper/PCLZMBEH"},"agent_actions":{"view_html":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2","download_json":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2.json","view_paper":"https://pith.science/paper/PCLZMBEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28605&json=true","fetch_graph":"https://pith.science/api/pith-number/PCLZMBEHCG6YQLMVGIJDMZUWF2/graph.json","fetch_events":"https://pith.science/api/pith-number/PCLZMBEHCG6YQLMVGIJDMZUWF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2/action/storage_attestation","attest_author":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2/action/author_attestation","sign_citation":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2/action/citation_signature","submit_replication":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2/action/replication_record"}},"created_at":"2026-07-31T01:39:04.874398+00:00","updated_at":"2026-07-31T01:39:04.874398+00:00"}