{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PCLZMBEHCG6YQLMVGIJDMZUWF2","short_pith_number":"pith:PCLZMBEH","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"},"canonical_sha256":"789796048711bd882d9532123666962eac8cf63eb02fbd54323bd228ab099782","source":{"kind":"arxiv","id":"2607.28605","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28605","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28605v1","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28605","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"pith_short_12","alias_value":"PCLZMBEHCG6Y","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"pith_short_16","alias_value":"PCLZMBEHCG6YQLMV","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"pith_short_8","alias_value":"PCLZMBEH","created_at":"2026-07-31T01:39:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PCLZMBEHCG6YQLMVGIJDMZUWF2","target":"record","payload":{"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"},"canonical_sha256":"789796048711bd882d9532123666962eac8cf63eb02fbd54323bd228ab099782","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"},"source_kind":"arxiv","source_id":"2607.28605","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T01:39:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00jI/ZBcBX/Xp66gDzpidK5tfA40FtFEd+iG59K+RKfUVtgTgtVDJ82bbSMmV7raPO4rb72VZ8/8FVjd8L41DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T07:03:07.580382Z"},"content_sha256":"43ccbf24b2e5103a95e4943f7524a04fb53f0e47fdd57872dd6f60483e4b2d89","schema_version":"1.0","event_id":"sha256:43ccbf24b2e5103a95e4943f7524a04fb53f0e47fdd57872dd6f60483e4b2d89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PCLZMBEHCG6YQLMVGIJDMZUWF2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T01:39:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jiGAzz/rUNZ+C883hwnbxmsJZD+vdsO95bwnkFi74kCZqmn28o/yGJRII9s0SKW3jHjIF13xBXtc8I6Yva+4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T07:03:07.580961Z"},"content_sha256":"89944b2b17e44a43d7926ab2b178e1297e58b195d506ff2be7732d099c0f17cb","schema_version":"1.0","event_id":"sha256:89944b2b17e44a43d7926ab2b178e1297e58b195d506ff2be7732d099c0f17cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2/bundle.json","state_url":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-02T07:03:07Z","links":{"resolver":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2","bundle":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2/bundle.json","state":"https://pith.science/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCLZMBEHCG6YQLMVGIJDMZUWF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PCLZMBEHCG6YQLMVGIJDMZUWF2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7851345dbd4ac675c19a9a7353bf7882ea96e01caca987c68fe9e3dc72418e62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:55:34Z","title_canon_sha256":"4ea8c05cc2d1992320aa0c4bf8b58353d136bd4b38e138a55240323aeb3db979"},"schema_version":"1.0","source":{"id":"2607.28605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28605","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28605v1","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28605","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"pith_short_12","alias_value":"PCLZMBEHCG6Y","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"pith_short_16","alias_value":"PCLZMBEHCG6YQLMV","created_at":"2026-07-31T01:39:04Z"},{"alias_kind":"pith_short_8","alias_value":"PCLZMBEH","created_at":"2026-07-31T01:39:04Z"}],"graph_snapshots":[{"event_id":"sha256:89944b2b17e44a43d7926ab2b178e1297e58b195d506ff2be7732d099c0f17cb","target":"graph","created_at":"2026-07-31T01:39:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.28605/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Guo Zheng, Han Zheng, Liang Jiang, Qian Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:55:34Z","title":"Logical computation with canonical lifted product codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28605","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:43ccbf24b2e5103a95e4943f7524a04fb53f0e47fdd57872dd6f60483e4b2d89","target":"record","created_at":"2026-07-31T01:39:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7851345dbd4ac675c19a9a7353bf7882ea96e01caca987c68fe9e3dc72418e62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T17:55:34Z","title_canon_sha256":"4ea8c05cc2d1992320aa0c4bf8b58353d136bd4b38e138a55240323aeb3db979"},"schema_version":"1.0","source":{"id":"2607.28605","kind":"arxiv","version":1}},"canonical_sha256":"789796048711bd882d9532123666962eac8cf63eb02fbd54323bd228ab099782","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"789796048711bd882d9532123666962eac8cf63eb02fbd54323bd228ab099782","first_computed_at":"2026-07-31T01:39:04.871274Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:39:04.871274Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43ccbf24b2e5103a95e4943f7524a04fb53f0e47fdd57872dd6f60483e4b2d89","sha256:89944b2b17e44a43d7926ab2b178e1297e58b195d506ff2be7732d099c0f17cb"],"state_sha256":"b9b77d672036369d6021d4a0bb6de79807ef01a6f310b27293926846eceb9c8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H6nt2tTCh3RzRigzl9zJN9TCxTJA+zLG18aHXt+wsuVlEC3IlTL3aF3iIOctK9wOV7XR0WRO83+3yecX6OpFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-02T07:03:07.586391Z","bundle_sha256":"8ce103cecdc73fa68eafa784ef8f5e9047e76306f412ffcb31c292b4a89d33ab"}}