{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AT3DUYJTPW64YSYK4SJ4QNHLAW","short_pith_number":"pith:AT3DUYJT","schema_version":"1.0","canonical_sha256":"04f63a61337dbdcc4b0ae493c834eb05a10900775ec8d37a1f9cf6edd1b05fdc","source":{"kind":"arxiv","id":"2502.19406","version":3},"attestation_state":"computed","paper":{"title":"Single-shot and two-shot decoding with generalized bicycle codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hsiang-Ku Lin, Leonid P. Pryadko, Pak Kau Lim, Xingrui Liu","submitted_at":"2025-02-26T18:54:19Z","abstract_excerpt":"Generalized-bicycle (GB) and more general two-block group-algebra (2BGA) quantum error-correcting codes have naturally redundant minimum-weight stabilizer generators. To use this redundancy, we constructed a large number of ``planar'' 2BGA codes over abelian groups with one and two generators, with each block row of weight 3, relatively large dimensions, distances, and maximum syndrome distance $d_{\\rm S}=3$. We simulated the performance of three such codes under phenomenological noise and standard circuit noise, using sliding window sequential decoding protocol covering $T\\ge 1$ measurement r"},"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":"2502.19406","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-26T18:54:19Z","cross_cats_sorted":[],"title_canon_sha256":"527fd9229b9e0f511db7d48734e8f0baafb1cea6e642263f375f8a86145cdd92","abstract_canon_sha256":"c3edc7ba8775c6561e00d6c876d8cf189d4242647582df96fa8f66911f9803bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:07.457291Z","signature_b64":"wYXEaMJDFEtqRBkxS+F/xEynRMfCHuhJNSbj0TJTi95KJ+3skSYHQlq5JQuwrSlo3VvBPw68eQSGyQBef1dUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04f63a61337dbdcc4b0ae493c834eb05a10900775ec8d37a1f9cf6edd1b05fdc","last_reissued_at":"2026-07-05T11:49:07.456830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:07.456830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single-shot and two-shot decoding with generalized bicycle codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hsiang-Ku Lin, Leonid P. Pryadko, Pak Kau Lim, Xingrui Liu","submitted_at":"2025-02-26T18:54:19Z","abstract_excerpt":"Generalized-bicycle (GB) and more general two-block group-algebra (2BGA) quantum error-correcting codes have naturally redundant minimum-weight stabilizer generators. To use this redundancy, we constructed a large number of ``planar'' 2BGA codes over abelian groups with one and two generators, with each block row of weight 3, relatively large dimensions, distances, and maximum syndrome distance $d_{\\rm S}=3$. We simulated the performance of three such codes under phenomenological noise and standard circuit noise, using sliding window sequential decoding protocol covering $T\\ge 1$ measurement r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.19406","kind":"arxiv","version":3},"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/2502.19406/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":"2502.19406","created_at":"2026-07-05T11:49:07.456887+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.19406v3","created_at":"2026-07-05T11:49:07.456887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.19406","created_at":"2026-07-05T11:49:07.456887+00:00"},{"alias_kind":"pith_short_12","alias_value":"AT3DUYJTPW64","created_at":"2026-07-05T11:49:07.456887+00:00"},{"alias_kind":"pith_short_16","alias_value":"AT3DUYJTPW64YSYK","created_at":"2026-07-05T11:49:07.456887+00:00"},{"alias_kind":"pith_short_8","alias_value":"AT3DUYJT","created_at":"2026-07-05T11:49:07.456887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03951","citing_title":"Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor","ref_index":77,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":159,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04151","citing_title":"Topological subsystem bivariate bicycle codes with four-qubit check operators","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AT3DUYJTPW64YSYK4SJ4QNHLAW","json":"https://pith.science/pith/AT3DUYJTPW64YSYK4SJ4QNHLAW.json","graph_json":"https://pith.science/api/pith-number/AT3DUYJTPW64YSYK4SJ4QNHLAW/graph.json","events_json":"https://pith.science/api/pith-number/AT3DUYJTPW64YSYK4SJ4QNHLAW/events.json","paper":"https://pith.science/paper/AT3DUYJT"},"agent_actions":{"view_html":"https://pith.science/pith/AT3DUYJTPW64YSYK4SJ4QNHLAW","download_json":"https://pith.science/pith/AT3DUYJTPW64YSYK4SJ4QNHLAW.json","view_paper":"https://pith.science/paper/AT3DUYJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.19406&json=true","fetch_graph":"https://pith.science/api/pith-number/AT3DUYJTPW64YSYK4SJ4QNHLAW/graph.json","fetch_events":"https://pith.science/api/pith-number/AT3DUYJTPW64YSYK4SJ4QNHLAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AT3DUYJTPW64YSYK4SJ4QNHLAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AT3DUYJTPW64YSYK4SJ4QNHLAW/action/storage_attestation","attest_author":"https://pith.science/pith/AT3DUYJTPW64YSYK4SJ4QNHLAW/action/author_attestation","sign_citation":"https://pith.science/pith/AT3DUYJTPW64YSYK4SJ4QNHLAW/action/citation_signature","submit_replication":"https://pith.science/pith/AT3DUYJTPW64YSYK4SJ4QNHLAW/action/replication_record"}},"created_at":"2026-07-05T11:49:07.456887+00:00","updated_at":"2026-07-05T11:49:07.456887+00:00"}