{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QKXGNEKH4ZMTWW4KR43KVOZNKT","short_pith_number":"pith:QKXGNEKH","schema_version":"1.0","canonical_sha256":"82ae669147e6593b5b8a8f36aabb2d54e08e52def9dab19ecd88309fc1d48901","source":{"kind":"arxiv","id":"2607.12948","version":1},"attestation_state":"computed","paper":{"title":"Logical Entangling with Phantom Codes in Hypergraph Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ge Bai, Keming He, Xin Wang, Zetong Li, Ziao Tang","submitted_at":"2026-07-14T16:35:36Z","abstract_excerpt":"Logical entangling gates are a major source of physical spacetime overhead in fault-tolerant quantum computation. Phantom codes reduce this cost by implementing every ordered in-block logical CNOT through physical qubit permutations and Pauli-frame updates. Whether this mechanism can coexist with the low-weight stabilizer structure of qLDPC codes is a central question for low-overhead fault-tolerant architectures. We give a deterministic answer within binary CSS hypergraph product (HGP) codes. Up to natural equivalences, the simplex-repetition family is the unique HGP family satisfying the pha"},"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.12948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-14T16:35:36Z","cross_cats_sorted":[],"title_canon_sha256":"7fea7ae37a8bbc78c2bf98759aa23349f4830de24928a607fc60fcc95714590b","abstract_canon_sha256":"0bd32f9ff91cef3cfb9541dace9aba5e1aa3402d174b7d0cb57652b2799ad3a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-15T01:22:26.810152Z","signature_b64":"g8y9eYWsRO5+HjkQre+PLFOeYO96Jt8A4QHURFiYLyKMFIypk4RVy1L1TNWR7reKCXxAjTM2zZw3YSS3EspEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82ae669147e6593b5b8a8f36aabb2d54e08e52def9dab19ecd88309fc1d48901","last_reissued_at":"2026-07-15T01:22:26.809357Z","signature_status":"signed_v1","first_computed_at":"2026-07-15T01:22:26.809357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logical Entangling with Phantom Codes in Hypergraph Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ge Bai, Keming He, Xin Wang, Zetong Li, Ziao Tang","submitted_at":"2026-07-14T16:35:36Z","abstract_excerpt":"Logical entangling gates are a major source of physical spacetime overhead in fault-tolerant quantum computation. Phantom codes reduce this cost by implementing every ordered in-block logical CNOT through physical qubit permutations and Pauli-frame updates. Whether this mechanism can coexist with the low-weight stabilizer structure of qLDPC codes is a central question for low-overhead fault-tolerant architectures. We give a deterministic answer within binary CSS hypergraph product (HGP) codes. Up to natural equivalences, the simplex-repetition family is the unique HGP family satisfying the pha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.12948","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.12948/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.12948","created_at":"2026-07-15T01:22:26.809779+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.12948v1","created_at":"2026-07-15T01:22:26.809779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.12948","created_at":"2026-07-15T01:22:26.809779+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKXGNEKH4ZMT","created_at":"2026-07-15T01:22:26.809779+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKXGNEKH4ZMTWW4K","created_at":"2026-07-15T01:22:26.809779+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKXGNEKH","created_at":"2026-07-15T01:22:26.809779+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/QKXGNEKH4ZMTWW4KR43KVOZNKT","json":"https://pith.science/pith/QKXGNEKH4ZMTWW4KR43KVOZNKT.json","graph_json":"https://pith.science/api/pith-number/QKXGNEKH4ZMTWW4KR43KVOZNKT/graph.json","events_json":"https://pith.science/api/pith-number/QKXGNEKH4ZMTWW4KR43KVOZNKT/events.json","paper":"https://pith.science/paper/QKXGNEKH"},"agent_actions":{"view_html":"https://pith.science/pith/QKXGNEKH4ZMTWW4KR43KVOZNKT","download_json":"https://pith.science/pith/QKXGNEKH4ZMTWW4KR43KVOZNKT.json","view_paper":"https://pith.science/paper/QKXGNEKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.12948&json=true","fetch_graph":"https://pith.science/api/pith-number/QKXGNEKH4ZMTWW4KR43KVOZNKT/graph.json","fetch_events":"https://pith.science/api/pith-number/QKXGNEKH4ZMTWW4KR43KVOZNKT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKXGNEKH4ZMTWW4KR43KVOZNKT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKXGNEKH4ZMTWW4KR43KVOZNKT/action/storage_attestation","attest_author":"https://pith.science/pith/QKXGNEKH4ZMTWW4KR43KVOZNKT/action/author_attestation","sign_citation":"https://pith.science/pith/QKXGNEKH4ZMTWW4KR43KVOZNKT/action/citation_signature","submit_replication":"https://pith.science/pith/QKXGNEKH4ZMTWW4KR43KVOZNKT/action/replication_record"}},"created_at":"2026-07-15T01:22:26.809779+00:00","updated_at":"2026-07-15T01:22:26.809779+00:00"}