{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MXSUMCGJLB5J4JLS7CMITNERHU","short_pith_number":"pith:MXSUMCGJ","schema_version":"1.0","canonical_sha256":"65e54608c9587a9e2572f89889b4913d00cbc9d180ddf5123e00696027bd43e3","source":{"kind":"arxiv","id":"2605.20346","version":1},"attestation_state":"computed","paper":{"title":"Forced Gap Post-Selection for Quantum LDPC Codes and their Operations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Wills, Isaac Chuang, Theodore J. Yoder","submitted_at":"2026-05-19T18:03:20Z","abstract_excerpt":"We develop a simple and general post-selection strategy for high-rate quantum codes that is transferrable across decoders. After an initial baseline run, the decoder is re-run once per logical observable, and forced in these latter runs to provide a solution where the given observable has the complementary outcome. Shots are rejected that find logically complementary solutions with similar likelihoods compared to the baseline. Using the Relay-BP decoder, we benchmark the strategy on the $72$-qubit and $144$-qubit bivariate bicycle codes, as well as surgery gadgets for the latter. In comparison"},"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":"2605.20346","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-19T18:03:20Z","cross_cats_sorted":[],"title_canon_sha256":"196eca48f9aca5493bd8bd895de075606e1ae39ab2bb6639e263919549a682a0","abstract_canon_sha256":"fc36800f5c854f99cad71f3ddd9254abdf351fbd0b1c9bce34481d2e71783282"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:34.331161Z","signature_b64":"bST2FbDnXtlZfD2egvdJVLnu1zaqaW6kUZ6BiTFo0qyDH0xYA1RUXbdEGTmEmKNU36pfaPEJEK9TtsvuA2CRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65e54608c9587a9e2572f89889b4913d00cbc9d180ddf5123e00696027bd43e3","last_reissued_at":"2026-05-21T01:04:34.330435Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:34.330435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forced Gap Post-Selection for Quantum LDPC Codes and their Operations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Wills, Isaac Chuang, Theodore J. Yoder","submitted_at":"2026-05-19T18:03:20Z","abstract_excerpt":"We develop a simple and general post-selection strategy for high-rate quantum codes that is transferrable across decoders. After an initial baseline run, the decoder is re-run once per logical observable, and forced in these latter runs to provide a solution where the given observable has the complementary outcome. Shots are rejected that find logically complementary solutions with similar likelihoods compared to the baseline. Using the Relay-BP decoder, we benchmark the strategy on the $72$-qubit and $144$-qubit bivariate bicycle codes, as well as surgery gadgets for the latter. In comparison"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20346","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/2605.20346/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":"2605.20346","created_at":"2026-05-21T01:04:34.330529+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20346v1","created_at":"2026-05-21T01:04:34.330529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20346","created_at":"2026-05-21T01:04:34.330529+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXSUMCGJLB5J","created_at":"2026-05-21T01:04:34.330529+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXSUMCGJLB5J4JLS","created_at":"2026-05-21T01:04:34.330529+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXSUMCGJ","created_at":"2026-05-21T01:04:34.330529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.21898","citing_title":"Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MXSUMCGJLB5J4JLS7CMITNERHU","json":"https://pith.science/pith/MXSUMCGJLB5J4JLS7CMITNERHU.json","graph_json":"https://pith.science/api/pith-number/MXSUMCGJLB5J4JLS7CMITNERHU/graph.json","events_json":"https://pith.science/api/pith-number/MXSUMCGJLB5J4JLS7CMITNERHU/events.json","paper":"https://pith.science/paper/MXSUMCGJ"},"agent_actions":{"view_html":"https://pith.science/pith/MXSUMCGJLB5J4JLS7CMITNERHU","download_json":"https://pith.science/pith/MXSUMCGJLB5J4JLS7CMITNERHU.json","view_paper":"https://pith.science/paper/MXSUMCGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20346&json=true","fetch_graph":"https://pith.science/api/pith-number/MXSUMCGJLB5J4JLS7CMITNERHU/graph.json","fetch_events":"https://pith.science/api/pith-number/MXSUMCGJLB5J4JLS7CMITNERHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXSUMCGJLB5J4JLS7CMITNERHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXSUMCGJLB5J4JLS7CMITNERHU/action/storage_attestation","attest_author":"https://pith.science/pith/MXSUMCGJLB5J4JLS7CMITNERHU/action/author_attestation","sign_citation":"https://pith.science/pith/MXSUMCGJLB5J4JLS7CMITNERHU/action/citation_signature","submit_replication":"https://pith.science/pith/MXSUMCGJLB5J4JLS7CMITNERHU/action/replication_record"}},"created_at":"2026-05-21T01:04:34.330529+00:00","updated_at":"2026-05-21T01:04:34.330529+00:00"}