{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PZZ3GXOU2MAL657DJMMWPQ24VZ","short_pith_number":"pith:PZZ3GXOU","schema_version":"1.0","canonical_sha256":"7e73b35dd4d300bf77e34b1967c35cae6d78411fac6bbd7a9a4860ab7fa11b29","source":{"kind":"arxiv","id":"2602.22770","version":2},"attestation_state":"computed","paper":{"title":"A matching decoder for bivariate bicycle codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benjamin J. Brown, Dominic J. Williamson, Kaavya Sahay","submitted_at":"2026-02-26T09:00:20Z","abstract_excerpt":"The discovery of new quantum error-correcting codes that encode several logical qubits into relatively few physical qubits motivates the development of efficient and accurate methods of decoding these systems. Here, we adopt the minimum-weight perfect matching algorithm, a subroutine invaluable to decoding topological codes, to decode bivariate bicycle codes. Using the equivalence of bivariate bicycle codes to copies of the toric code, we propose a method we call the `cylinder trick' to rapidly find a correction using matching on code symmetries. We benchmark our decoder on the gross code fami"},"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":"2602.22770","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-02-26T09:00:20Z","cross_cats_sorted":[],"title_canon_sha256":"331876e2ba814b40e62e72681632b209b806cdf8811db9a091fbc9025fb78a8a","abstract_canon_sha256":"08bb276dc82f60c3591c2536ad9ac387785d32af52437b7709f96a9ba16e1519"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:08:40.169549Z","signature_b64":"q2oum3qQMUfgFqStt5ESHJrVx0nrcW3ebHAMVM9I+bPxOKpgHaGrCNN7xNPb6TQW6FjiHI/0fX9yJVr5cE77CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e73b35dd4d300bf77e34b1967c35cae6d78411fac6bbd7a9a4860ab7fa11b29","last_reissued_at":"2026-06-09T02:08:40.168226Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:08:40.168226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A matching decoder for bivariate bicycle codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benjamin J. Brown, Dominic J. Williamson, Kaavya Sahay","submitted_at":"2026-02-26T09:00:20Z","abstract_excerpt":"The discovery of new quantum error-correcting codes that encode several logical qubits into relatively few physical qubits motivates the development of efficient and accurate methods of decoding these systems. Here, we adopt the minimum-weight perfect matching algorithm, a subroutine invaluable to decoding topological codes, to decode bivariate bicycle codes. Using the equivalence of bivariate bicycle codes to copies of the toric code, we propose a method we call the `cylinder trick' to rapidly find a correction using matching on code symmetries. We benchmark our decoder on the gross code fami"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.22770","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/2602.22770/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":"2602.22770","created_at":"2026-06-09T02:08:40.168505+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.22770v2","created_at":"2026-06-09T02:08:40.168505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.22770","created_at":"2026-06-09T02:08:40.168505+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZZ3GXOU2MAL","created_at":"2026-06-09T02:08:40.168505+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZZ3GXOU2MAL657D","created_at":"2026-06-09T02:08:40.168505+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZZ3GXOU","created_at":"2026-06-09T02:08:40.168505+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":73,"is_internal_anchor":true},{"citing_arxiv_id":"2604.01040","citing_title":"Geometry-induced correlated noise in qLDPC syndrome extraction","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PZZ3GXOU2MAL657DJMMWPQ24VZ","json":"https://pith.science/pith/PZZ3GXOU2MAL657DJMMWPQ24VZ.json","graph_json":"https://pith.science/api/pith-number/PZZ3GXOU2MAL657DJMMWPQ24VZ/graph.json","events_json":"https://pith.science/api/pith-number/PZZ3GXOU2MAL657DJMMWPQ24VZ/events.json","paper":"https://pith.science/paper/PZZ3GXOU"},"agent_actions":{"view_html":"https://pith.science/pith/PZZ3GXOU2MAL657DJMMWPQ24VZ","download_json":"https://pith.science/pith/PZZ3GXOU2MAL657DJMMWPQ24VZ.json","view_paper":"https://pith.science/paper/PZZ3GXOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.22770&json=true","fetch_graph":"https://pith.science/api/pith-number/PZZ3GXOU2MAL657DJMMWPQ24VZ/graph.json","fetch_events":"https://pith.science/api/pith-number/PZZ3GXOU2MAL657DJMMWPQ24VZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZZ3GXOU2MAL657DJMMWPQ24VZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZZ3GXOU2MAL657DJMMWPQ24VZ/action/storage_attestation","attest_author":"https://pith.science/pith/PZZ3GXOU2MAL657DJMMWPQ24VZ/action/author_attestation","sign_citation":"https://pith.science/pith/PZZ3GXOU2MAL657DJMMWPQ24VZ/action/citation_signature","submit_replication":"https://pith.science/pith/PZZ3GXOU2MAL657DJMMWPQ24VZ/action/replication_record"}},"created_at":"2026-06-09T02:08:40.168505+00:00","updated_at":"2026-06-09T02:08:40.168505+00:00"}