{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3COJBQP5SXBOCGJJ52RBN6POSX","short_pith_number":"pith:3COJBQP5","schema_version":"1.0","canonical_sha256":"d89c90c1fd95c2e11929eea216f9ee95c55ba6b27782f1acef152d1c35327538","source":{"kind":"arxiv","id":"2507.21237","version":1},"attestation_state":"computed","paper":{"title":"(2,2)-GB Codes: Classification and Comparison with weight-4 Surface Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Fran\\c{c}ois Arnault, Nicolas Saussay, Philippe Gaborit","submitted_at":"2025-07-28T18:00:40Z","abstract_excerpt":"Generalized Bicycle (GB) codes offer a compelling alternative to surface codes for quantum error correction. This paper focuses on (2,2)-Generalized Bicycle codes, constructed from pairs of binary circulant matrices with two non-zero elements per row. Leveraging a lower bound on their minimum distance, we construct three novel infinite families of optimal (2,2)-GB codes with parameters [[ 2n^2, 2, n ]], [[ 4r^2, 2, 2r ]], and [[(2t + 1)^2 + 1, 2, 2t + 1 ]]. These families match the performance of Kitaev's toric code and the best 2D weight-4 surface codes, reaching known theoretical limits. In "},"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":"2507.21237","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-28T18:00:40Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"a59d4a92c4e208b0857d06c8e03662129a3c974b6a7b69950562ca4e932dbeb6","abstract_canon_sha256":"54e2817ed283d0e451af8b09e88049fdf7a7f28df0997f03af85402966842288"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:55.378331Z","signature_b64":"6ThfDD9i3D6w+VyYHdOLoK4ZQWMAsK0EkmC/rBalNDDjCUa3713bt+/WqasZnzX5+0rmW1O7mJBXuiauIVigDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d89c90c1fd95c2e11929eea216f9ee95c55ba6b27782f1acef152d1c35327538","last_reissued_at":"2026-07-05T11:44:55.377830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:55.377830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"(2,2)-GB Codes: Classification and Comparison with weight-4 Surface Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Fran\\c{c}ois Arnault, Nicolas Saussay, Philippe Gaborit","submitted_at":"2025-07-28T18:00:40Z","abstract_excerpt":"Generalized Bicycle (GB) codes offer a compelling alternative to surface codes for quantum error correction. This paper focuses on (2,2)-Generalized Bicycle codes, constructed from pairs of binary circulant matrices with two non-zero elements per row. Leveraging a lower bound on their minimum distance, we construct three novel infinite families of optimal (2,2)-GB codes with parameters [[ 2n^2, 2, n ]], [[ 4r^2, 2, 2r ]], and [[(2t + 1)^2 + 1, 2, 2t + 1 ]]. These families match the performance of Kitaev's toric code and the best 2D weight-4 surface codes, reaching known theoretical limits. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.21237","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/2507.21237/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":"2507.21237","created_at":"2026-07-05T11:44:55.377894+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.21237v1","created_at":"2026-07-05T11:44:55.377894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.21237","created_at":"2026-07-05T11:44:55.377894+00:00"},{"alias_kind":"pith_short_12","alias_value":"3COJBQP5SXBO","created_at":"2026-07-05T11:44:55.377894+00:00"},{"alias_kind":"pith_short_16","alias_value":"3COJBQP5SXBOCGJJ","created_at":"2026-07-05T11:44:55.377894+00:00"},{"alias_kind":"pith_short_8","alias_value":"3COJBQP5","created_at":"2026-07-05T11:44:55.377894+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.09115","citing_title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3COJBQP5SXBOCGJJ52RBN6POSX","json":"https://pith.science/pith/3COJBQP5SXBOCGJJ52RBN6POSX.json","graph_json":"https://pith.science/api/pith-number/3COJBQP5SXBOCGJJ52RBN6POSX/graph.json","events_json":"https://pith.science/api/pith-number/3COJBQP5SXBOCGJJ52RBN6POSX/events.json","paper":"https://pith.science/paper/3COJBQP5"},"agent_actions":{"view_html":"https://pith.science/pith/3COJBQP5SXBOCGJJ52RBN6POSX","download_json":"https://pith.science/pith/3COJBQP5SXBOCGJJ52RBN6POSX.json","view_paper":"https://pith.science/paper/3COJBQP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.21237&json=true","fetch_graph":"https://pith.science/api/pith-number/3COJBQP5SXBOCGJJ52RBN6POSX/graph.json","fetch_events":"https://pith.science/api/pith-number/3COJBQP5SXBOCGJJ52RBN6POSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3COJBQP5SXBOCGJJ52RBN6POSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3COJBQP5SXBOCGJJ52RBN6POSX/action/storage_attestation","attest_author":"https://pith.science/pith/3COJBQP5SXBOCGJJ52RBN6POSX/action/author_attestation","sign_citation":"https://pith.science/pith/3COJBQP5SXBOCGJJ52RBN6POSX/action/citation_signature","submit_replication":"https://pith.science/pith/3COJBQP5SXBOCGJJ52RBN6POSX/action/replication_record"}},"created_at":"2026-07-05T11:44:55.377894+00:00","updated_at":"2026-07-05T11:44:55.377894+00:00"}