{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TZBBWBWGEM4UECOXZQZO3HT2ZA","short_pith_number":"pith:TZBBWBWG","schema_version":"1.0","canonical_sha256":"9e421b06c623394209d7cc32ed9e7ac8352c921e35c0f1dfbf1264fd1b6fa4ae","source":{"kind":"arxiv","id":"2401.07583","version":1},"attestation_state":"computed","paper":{"title":"Small Quantum Codes from Algebraic Extensions of Generalized Bicycle Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Fedor \\v{S}imkovic IV, Francisco Revson Fernandes Pereira, Martin Leib, Nikolaos Koukoulekidis","submitted_at":"2024-01-15T10:38:13Z","abstract_excerpt":"Quantum error correction is rapidly seeing first experimental implementations, but there is a significant gap between asymptotically optimal error-correcting codes and codes that are experimentally feasible. Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance. In this work, motivated by current small-scale experimental quantum processing units, we devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes. We introduce a code cons"},"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":"2401.07583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-01-15T10:38:13Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d57bd8040d50097da9b1aa2e7fcb920044a2d8aaa55bd3aac71ab1d187451bf4","abstract_canon_sha256":"e04f8b1715d6e81813f74cc7518f2013bbc0d538e3dd368a510de856cec1c82c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:33:39.616043Z","signature_b64":"99/Op5RSy8c0rMQm5x3wq9ZoDHf3VLEo76xau5gLVAifLcvoA7IHM2HAaqt6hqssds77BZYP2ncmolOfV/ZgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e421b06c623394209d7cc32ed9e7ac8352c921e35c0f1dfbf1264fd1b6fa4ae","last_reissued_at":"2026-07-05T07:33:39.615571Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:33:39.615571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small Quantum Codes from Algebraic Extensions of Generalized Bicycle Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Fedor \\v{S}imkovic IV, Francisco Revson Fernandes Pereira, Martin Leib, Nikolaos Koukoulekidis","submitted_at":"2024-01-15T10:38:13Z","abstract_excerpt":"Quantum error correction is rapidly seeing first experimental implementations, but there is a significant gap between asymptotically optimal error-correcting codes and codes that are experimentally feasible. Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance. In this work, motivated by current small-scale experimental quantum processing units, we devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes. We introduce a code cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07583","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/2401.07583/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":"2401.07583","created_at":"2026-07-05T07:33:39.615637+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.07583v1","created_at":"2026-07-05T07:33:39.615637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07583","created_at":"2026-07-05T07:33:39.615637+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZBBWBWGEM4U","created_at":"2026-07-05T07:33:39.615637+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZBBWBWGEM4UECOX","created_at":"2026-07-05T07:33:39.615637+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZBBWBWG","created_at":"2026-07-05T07:33:39.615637+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.01892","citing_title":"Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TZBBWBWGEM4UECOXZQZO3HT2ZA","json":"https://pith.science/pith/TZBBWBWGEM4UECOXZQZO3HT2ZA.json","graph_json":"https://pith.science/api/pith-number/TZBBWBWGEM4UECOXZQZO3HT2ZA/graph.json","events_json":"https://pith.science/api/pith-number/TZBBWBWGEM4UECOXZQZO3HT2ZA/events.json","paper":"https://pith.science/paper/TZBBWBWG"},"agent_actions":{"view_html":"https://pith.science/pith/TZBBWBWGEM4UECOXZQZO3HT2ZA","download_json":"https://pith.science/pith/TZBBWBWGEM4UECOXZQZO3HT2ZA.json","view_paper":"https://pith.science/paper/TZBBWBWG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.07583&json=true","fetch_graph":"https://pith.science/api/pith-number/TZBBWBWGEM4UECOXZQZO3HT2ZA/graph.json","fetch_events":"https://pith.science/api/pith-number/TZBBWBWGEM4UECOXZQZO3HT2ZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZBBWBWGEM4UECOXZQZO3HT2ZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZBBWBWGEM4UECOXZQZO3HT2ZA/action/storage_attestation","attest_author":"https://pith.science/pith/TZBBWBWGEM4UECOXZQZO3HT2ZA/action/author_attestation","sign_citation":"https://pith.science/pith/TZBBWBWGEM4UECOXZQZO3HT2ZA/action/citation_signature","submit_replication":"https://pith.science/pith/TZBBWBWGEM4UECOXZQZO3HT2ZA/action/replication_record"}},"created_at":"2026-07-05T07:33:39.615637+00:00","updated_at":"2026-07-05T07:33:39.615637+00:00"}