{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OFUEUKU3SYOKVHZFJU4H5EAQSA","short_pith_number":"pith:OFUEUKU3","schema_version":"1.0","canonical_sha256":"71684a2a9b961caa9f254d387e9010902e0da0d07df5ec5a2fbe7660d58572fb","source":{"kind":"arxiv","id":"2606.27130","version":1},"attestation_state":"computed","paper":{"title":"Rate-2/3 Girth-8 (3,18)-Regular Quantum LDPC Codes from Two-Branch Finite-Field Bases and CPM Lifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Kenta Kasai, Koki Okada","submitted_at":"2026-06-25T15:08:16Z","abstract_excerpt":"We construct a rate-$2/3$ quantum low-density parity-check (LDPC) code from a $(3,18)$-regular two-branch finite-field base and a circulant-permutation-matrix (CPM) lift of degree $P=101$. The resulting code is a Calderbank-Shor-Steane (CSS) code with parameters $[[34542,23032,d\\le 310]]$. We do not regard this upper bound as an estimate of the true minimum distance; rather, $d\\le310$ is the tightest upper bound currently obtained from structural lifts and decoder-produced logical errors. The construction has row weight 18 and column weight 3, and the Tanner graphs of $H_X$ and $H_Z$ separatel"},"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":"2606.27130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-25T15:08:16Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8a0c634f068f6f354db766725faecfa946dcf49c8ecec699fccbd8532e8de12b","abstract_canon_sha256":"90afedf0c3337d94b7cb7fd8d2f26d224eb845d840f383464d7912d4cc5cade0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:16:10.388146Z","signature_b64":"YWI+34D2rsTHTSPFsEXkJO2O6i4PP+0soO6fW62PTXQg2r+fD6m20nl8qNRWxv5Ly1qQvkTVUOPf05x/raqpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71684a2a9b961caa9f254d387e9010902e0da0d07df5ec5a2fbe7660d58572fb","last_reissued_at":"2026-06-26T01:16:10.387691Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:16:10.387691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-2/3 Girth-8 (3,18)-Regular Quantum LDPC Codes from Two-Branch Finite-Field Bases and CPM Lifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Kenta Kasai, Koki Okada","submitted_at":"2026-06-25T15:08:16Z","abstract_excerpt":"We construct a rate-$2/3$ quantum low-density parity-check (LDPC) code from a $(3,18)$-regular two-branch finite-field base and a circulant-permutation-matrix (CPM) lift of degree $P=101$. The resulting code is a Calderbank-Shor-Steane (CSS) code with parameters $[[34542,23032,d\\le 310]]$. We do not regard this upper bound as an estimate of the true minimum distance; rather, $d\\le310$ is the tightest upper bound currently obtained from structural lifts and decoder-produced logical errors. The construction has row weight 18 and column weight 3, and the Tanner graphs of $H_X$ and $H_Z$ separatel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.27130","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/2606.27130/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":"2606.27130","created_at":"2026-06-26T01:16:10.387759+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.27130v1","created_at":"2026-06-26T01:16:10.387759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27130","created_at":"2026-06-26T01:16:10.387759+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFUEUKU3SYOK","created_at":"2026-06-26T01:16:10.387759+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFUEUKU3SYOKVHZF","created_at":"2026-06-26T01:16:10.387759+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFUEUKU3","created_at":"2026-06-26T01:16:10.387759+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/OFUEUKU3SYOKVHZFJU4H5EAQSA","json":"https://pith.science/pith/OFUEUKU3SYOKVHZFJU4H5EAQSA.json","graph_json":"https://pith.science/api/pith-number/OFUEUKU3SYOKVHZFJU4H5EAQSA/graph.json","events_json":"https://pith.science/api/pith-number/OFUEUKU3SYOKVHZFJU4H5EAQSA/events.json","paper":"https://pith.science/paper/OFUEUKU3"},"agent_actions":{"view_html":"https://pith.science/pith/OFUEUKU3SYOKVHZFJU4H5EAQSA","download_json":"https://pith.science/pith/OFUEUKU3SYOKVHZFJU4H5EAQSA.json","view_paper":"https://pith.science/paper/OFUEUKU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.27130&json=true","fetch_graph":"https://pith.science/api/pith-number/OFUEUKU3SYOKVHZFJU4H5EAQSA/graph.json","fetch_events":"https://pith.science/api/pith-number/OFUEUKU3SYOKVHZFJU4H5EAQSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFUEUKU3SYOKVHZFJU4H5EAQSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFUEUKU3SYOKVHZFJU4H5EAQSA/action/storage_attestation","attest_author":"https://pith.science/pith/OFUEUKU3SYOKVHZFJU4H5EAQSA/action/author_attestation","sign_citation":"https://pith.science/pith/OFUEUKU3SYOKVHZFJU4H5EAQSA/action/citation_signature","submit_replication":"https://pith.science/pith/OFUEUKU3SYOKVHZFJU4H5EAQSA/action/replication_record"}},"created_at":"2026-06-26T01:16:10.387759+00:00","updated_at":"2026-06-26T01:16:10.387759+00:00"}