{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:T3UTLKWI6WO3XLPXE5626MGFMH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f6c1cba1f6b0a796308208d241e5fa85ce301ba8f22d4bde736cbc52b60fff54","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T22:52:01Z","title_canon_sha256":"e05b3e3f67066f86f1f796a8e24cf6464a4be98dc4289759e591529cefcc4f91"},"schema_version":"1.0","source":{"id":"2605.14173","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14173","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14173v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14173","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"T3UTLKWI6WO3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"T3UTLKWI6WO3XLPX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"T3UTLKWI","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:a06ac6d361771fd2e28aa48252ba02bd11ec9acb2d0bdb30cfa7bc3273d5ef46","target":"graph","created_at":"2026-05-17T23:39:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We provide an explicit algebraic characterization of the logical coset spaces by constructing a basis for the logical quotient space, yielding a complete parametrization of logical operators. Leveraging this structure, we derive upper bounds on the minimum distance by relating structured logical representatives to cycle-density properties of associated circulant matrices."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The Frobenius relation applied to the defining polynomials preserves the sparsity, the quantum CSS structure, and the low-density parity-check property of the original generalized bicycle codes."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Univariate bicycle codes give an explicit basis for logical operators and distance upper bounds in a restricted class of quantum LDPC codes while matching the performance of less constrained generalized and bivariate bicycle codes in simulations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Univariate bicycle codes reduce quantum LDPC design to a single polynomial while providing an explicit basis for logical operators and upper bounds on distance."}],"snapshot_sha256":"81f6e24c47d83f2d532146eb686afc542b800bcdfc3fcce75319efe9574bb9fd"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b19d5ceb99460290159104bddd8349c0cad2d7c53de31c142a8fa2de01d00b3d"},"paper":{"abstract_excerpt":"We introduce univariate bicycle (UB) codes, a structured subclass of generalized bicycle (GB) quantum low-density parity-check (LDPC) codes obtained via a Frobenius relation. This construction reduces the code design space from a two-polynomial search in GB codes to a single-polynomial search, while preserving sparsity. We provide an explicit algebraic characterization of the logical coset spaces by constructing a basis for the logical quotient space, yielding a complete parametrization of logical operators. Leveraging this structure, we derive upper bounds on the minimum distance by relating ","authors_text":"Hessam Mahdavifar, Sheida Rabeti","cross_cats":["math.IT"],"headline":"Univariate bicycle codes reduce quantum LDPC design to a single polynomial while providing an explicit basis for logical operators and upper bounds on distance.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T22:52:01Z","title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds"},"references":{"count":23,"internal_anchors":2,"resolved_work":23,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"R. Gallager, “Low-density parity-check codes,”IRE Transactions on information theory, vol. 8, no. 1, pp. 21–28, 1962","work_id":"e4fcd8e9-c455-415e-b63f-fd5aa6f9b259","year":1962},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Fifteen years of quantum LDPC coding and improved decoding strategies,","work_id":"6d1032ff-1fa0-4f30-a96d-e26cb7c65ad3","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Quantum low-density parity- check codes,","work_id":"fcccd828-c25e-4fb1-8187-d0d9eab61fdd","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Quantum low-density parity-check codes","work_id":"309b64a3-ed84-4a6b-ab00-a1b9d6ac53d0","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Quantum kronecker sum-product low- density parity-check codes with finite rate,","work_id":"68a35ce6-e9e0-4c98-9de2-94e71277ffbe","year":2013}],"snapshot_sha256":"d8be7a1a2792c08f6d0e30f054f60247afc68d47bc404f2f0f2ce67577156d77"},"source":{"id":"2605.14173","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:38:44.733724Z","id":"ba6d3c44-009a-4cf7-af4c-d6a336d0b903","model_set":{"reader":"grok-4.3"},"one_line_summary":"Univariate bicycle codes give an explicit basis for logical operators and distance upper bounds in a restricted class of quantum LDPC codes while matching the performance of less constrained generalized and bivariate bicycle codes in simulations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Univariate bicycle codes reduce quantum LDPC design to a single polynomial while providing an explicit basis for logical operators and upper bounds on distance.","strongest_claim":"We provide an explicit algebraic characterization of the logical coset spaces by constructing a basis for the logical quotient space, yielding a complete parametrization of logical operators. Leveraging this structure, we derive upper bounds on the minimum distance by relating structured logical representatives to cycle-density properties of associated circulant matrices.","weakest_assumption":"The Frobenius relation applied to the defining polynomials preserves the sparsity, the quantum CSS structure, and the low-density parity-check property of the original generalized bicycle codes."}},"verdict_id":"ba6d3c44-009a-4cf7-af4c-d6a336d0b903"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a4684aa26285e5cc6d19b849ba7238f98ee76c437983a3544e3928acb6d5fd66","target":"record","created_at":"2026-05-17T23:39:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f6c1cba1f6b0a796308208d241e5fa85ce301ba8f22d4bde736cbc52b60fff54","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T22:52:01Z","title_canon_sha256":"e05b3e3f67066f86f1f796a8e24cf6464a4be98dc4289759e591529cefcc4f91"},"schema_version":"1.0","source":{"id":"2605.14173","kind":"arxiv","version":1}},"canonical_sha256":"9ee935aac8f59dbbadf7277daf30c561c4bb74b07d19a500396ba91d5c250575","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ee935aac8f59dbbadf7277daf30c561c4bb74b07d19a500396ba91d5c250575","first_computed_at":"2026-05-17T23:39:11.332228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:11.332228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TqxCcqbgU2bWf8vfNlM820c8dwU4ase4rxtK2AvKr8Ukf+HL+n45DBsfHVkjUgbkqAI/8eNgFcDQERDSLQwhBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:11.332713Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14173","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4684aa26285e5cc6d19b849ba7238f98ee76c437983a3544e3928acb6d5fd66","sha256:a06ac6d361771fd2e28aa48252ba02bd11ec9acb2d0bdb30cfa7bc3273d5ef46"],"state_sha256":"1419cfb53a806aa480cd77583bf3f82f5c18a332e9785967d5efed5c35137de6"}