{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2SJ23T6ZP3T4AEN6LZDMCR6LWT","short_pith_number":"pith:2SJ23T6Z","schema_version":"1.0","canonical_sha256":"d493adcfd97ee7c011be5e46c147cbb4c08e990ef6df6e2e8d9d1db7ddd196c3","source":{"kind":"arxiv","id":"2511.13560","version":2},"attestation_state":"computed","paper":{"title":"Sequences of Bivariate Bicycle Codes from Covering Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abhishek Rajput, Benjamin C. B. Symons, Dan E. Browne","submitted_at":"2025-11-17T16:26:15Z","abstract_excerpt":"We show that given an instance of a bivariate bicycle (BB) code, it is possible to generate an infinite sequence of new BB codes using increasingly large covering graphs of the original code's Tanner graph. When a BB code has a Tanner graph that is a $h$-fold covering of the base BB code's Tanner graph, we refer to it as a $h$-cover code. We show that for a BB code to be a $h$-cover code, its lattice parameters and defining polynomials must satisfy simple algebraic conditions relative to those of the base code. By extending the graph covering map to a chain map, we show there are induced proje"},"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":"2511.13560","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-11-17T16:26:15Z","cross_cats_sorted":[],"title_canon_sha256":"4b737285ae50ac3dacd6792fcc510e151a513ef5596f41252ed9f2aac4bf605e","abstract_canon_sha256":"75f25e3474424cd0ef4abe473eff4065ecc2cbe20c10f7f9cd97856f4efae444"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:12:49.912794Z","signature_b64":"/PNKuHL/RoeGUWE5sbqpXMxkTeUrhWcrxxq1//4ll7cIm9fpJNzVvZr0oT4yJMuZsLFS/iblikpyZLeNgHQ3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d493adcfd97ee7c011be5e46c147cbb4c08e990ef6df6e2e8d9d1db7ddd196c3","last_reissued_at":"2026-06-23T01:12:49.912163Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:12:49.912163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequences of Bivariate Bicycle Codes from Covering Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abhishek Rajput, Benjamin C. B. Symons, Dan E. Browne","submitted_at":"2025-11-17T16:26:15Z","abstract_excerpt":"We show that given an instance of a bivariate bicycle (BB) code, it is possible to generate an infinite sequence of new BB codes using increasingly large covering graphs of the original code's Tanner graph. When a BB code has a Tanner graph that is a $h$-fold covering of the base BB code's Tanner graph, we refer to it as a $h$-cover code. We show that for a BB code to be a $h$-cover code, its lattice parameters and defining polynomials must satisfy simple algebraic conditions relative to those of the base code. By extending the graph covering map to a chain map, we show there are induced proje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.13560","kind":"arxiv","version":2},"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/2511.13560/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":"2511.13560","created_at":"2026-06-23T01:12:49.912245+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.13560v2","created_at":"2026-06-23T01:12:49.912245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.13560","created_at":"2026-06-23T01:12:49.912245+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SJ23T6ZP3T4","created_at":"2026-06-23T01:12:49.912245+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SJ23T6ZP3T4AEN6","created_at":"2026-06-23T01:12:49.912245+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SJ23T6Z","created_at":"2026-06-23T01:12:49.912245+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.19298","citing_title":"Translation-invariant quantum low-density parity-check codes from compactified fracton models","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2603.28627","citing_title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2SJ23T6ZP3T4AEN6LZDMCR6LWT","json":"https://pith.science/pith/2SJ23T6ZP3T4AEN6LZDMCR6LWT.json","graph_json":"https://pith.science/api/pith-number/2SJ23T6ZP3T4AEN6LZDMCR6LWT/graph.json","events_json":"https://pith.science/api/pith-number/2SJ23T6ZP3T4AEN6LZDMCR6LWT/events.json","paper":"https://pith.science/paper/2SJ23T6Z"},"agent_actions":{"view_html":"https://pith.science/pith/2SJ23T6ZP3T4AEN6LZDMCR6LWT","download_json":"https://pith.science/pith/2SJ23T6ZP3T4AEN6LZDMCR6LWT.json","view_paper":"https://pith.science/paper/2SJ23T6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.13560&json=true","fetch_graph":"https://pith.science/api/pith-number/2SJ23T6ZP3T4AEN6LZDMCR6LWT/graph.json","fetch_events":"https://pith.science/api/pith-number/2SJ23T6ZP3T4AEN6LZDMCR6LWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SJ23T6ZP3T4AEN6LZDMCR6LWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SJ23T6ZP3T4AEN6LZDMCR6LWT/action/storage_attestation","attest_author":"https://pith.science/pith/2SJ23T6ZP3T4AEN6LZDMCR6LWT/action/author_attestation","sign_citation":"https://pith.science/pith/2SJ23T6ZP3T4AEN6LZDMCR6LWT/action/citation_signature","submit_replication":"https://pith.science/pith/2SJ23T6ZP3T4AEN6LZDMCR6LWT/action/replication_record"}},"created_at":"2026-06-23T01:12:49.912245+00:00","updated_at":"2026-06-23T01:12:49.912245+00:00"}