{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NNZM4WOXK2EQTCQQQ75ZJCQF76","short_pith_number":"pith:NNZM4WOX","schema_version":"1.0","canonical_sha256":"6b72ce59d75689098a1087fb948a05ffa69b6ab03e2f0162ea2affc8c1369896","source":{"kind":"arxiv","id":"2203.17216","version":1},"attestation_state":"computed","paper":{"title":"Distance bounds for generalized bicycle codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Leonid P. Pryadko, Renyu Wang","submitted_at":"2022-03-31T17:43:34Z","abstract_excerpt":"Generalized bicycle (GB) codes is a class of quantum error-correcting codes constructed from a pair of binary circulant matrices. Unlike for other simple quantum code ans\\\"atze, unrestricted GB codes may have linear distance scaling. In addition, low-density parity-check GB codes have a naturally overcomplete set of low-weight stabilizer generators, which is expected to improve their performance in the presence of syndrome measurement errors. For such GB codes with a given maximum generator weight $w$, we constructed upper distance bounds by mapping them to codes local in $D\\le w-1$ dimensions"},"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":"2203.17216","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2022-03-31T17:43:34Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"1ffefb83a5ec845b2bc830a8eda08203150e1535589416da3ad3c52539b5aed4","abstract_canon_sha256":"4a433d27f3e6aafccb8adb59319502976a927da868c8e936020ec99b5e445c58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:10:32.502825Z","signature_b64":"yW9amLUdZO8LKwr6kjn5QVDTuPZhhLC52XWKVB9YrCGXQAMBKFn1KigZssxjXAYziuxE67JkbnQWin8yc3eDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b72ce59d75689098a1087fb948a05ffa69b6ab03e2f0162ea2affc8c1369896","last_reissued_at":"2026-07-05T04:10:32.502258Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:10:32.502258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance bounds for generalized bicycle codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Leonid P. Pryadko, Renyu Wang","submitted_at":"2022-03-31T17:43:34Z","abstract_excerpt":"Generalized bicycle (GB) codes is a class of quantum error-correcting codes constructed from a pair of binary circulant matrices. Unlike for other simple quantum code ans\\\"atze, unrestricted GB codes may have linear distance scaling. In addition, low-density parity-check GB codes have a naturally overcomplete set of low-weight stabilizer generators, which is expected to improve their performance in the presence of syndrome measurement errors. For such GB codes with a given maximum generator weight $w$, we constructed upper distance bounds by mapping them to codes local in $D\\le w-1$ dimensions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.17216","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/2203.17216/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":"2203.17216","created_at":"2026-07-05T04:10:32.502333+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.17216v1","created_at":"2026-07-05T04:10:32.502333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.17216","created_at":"2026-07-05T04:10:32.502333+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNZM4WOXK2EQ","created_at":"2026-07-05T04:10:32.502333+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNZM4WOXK2EQTCQQ","created_at":"2026-07-05T04:10:32.502333+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNZM4WOX","created_at":"2026-07-05T04:10:32.502333+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05044","citing_title":"Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19298","citing_title":"Translation-invariant quantum low-density parity-check codes from compactified fracton models","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03218","citing_title":"Edge-Based Anisotropic Decoding for Generalized Bicycle Codes","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NNZM4WOXK2EQTCQQQ75ZJCQF76","json":"https://pith.science/pith/NNZM4WOXK2EQTCQQQ75ZJCQF76.json","graph_json":"https://pith.science/api/pith-number/NNZM4WOXK2EQTCQQQ75ZJCQF76/graph.json","events_json":"https://pith.science/api/pith-number/NNZM4WOXK2EQTCQQQ75ZJCQF76/events.json","paper":"https://pith.science/paper/NNZM4WOX"},"agent_actions":{"view_html":"https://pith.science/pith/NNZM4WOXK2EQTCQQQ75ZJCQF76","download_json":"https://pith.science/pith/NNZM4WOXK2EQTCQQQ75ZJCQF76.json","view_paper":"https://pith.science/paper/NNZM4WOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.17216&json=true","fetch_graph":"https://pith.science/api/pith-number/NNZM4WOXK2EQTCQQQ75ZJCQF76/graph.json","fetch_events":"https://pith.science/api/pith-number/NNZM4WOXK2EQTCQQQ75ZJCQF76/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNZM4WOXK2EQTCQQQ75ZJCQF76/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNZM4WOXK2EQTCQQQ75ZJCQF76/action/storage_attestation","attest_author":"https://pith.science/pith/NNZM4WOXK2EQTCQQQ75ZJCQF76/action/author_attestation","sign_citation":"https://pith.science/pith/NNZM4WOXK2EQTCQQQ75ZJCQF76/action/citation_signature","submit_replication":"https://pith.science/pith/NNZM4WOXK2EQTCQQQ75ZJCQF76/action/replication_record"}},"created_at":"2026-07-05T04:10:32.502333+00:00","updated_at":"2026-07-05T04:10:32.502333+00:00"}