{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ITCGC6ISFKPQGKNHNGSDDLMNFV","short_pith_number":"pith:ITCGC6IS","schema_version":"1.0","canonical_sha256":"44c46179122a9f0329a769a431ad8d2d6a270b2f971e196f740daa15cfcf8499","source":{"kind":"arxiv","id":"2608.09347","version":1},"attestation_state":"computed","paper":{"title":"Binary code rate bounds via classical--quantum channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Omar Alrabiah, Venkatesan Guruswami","submitted_at":"2026-08-10T09:25:40Z","abstract_excerpt":"We derive the four principal asymptotic rate-distance tradeoffs for binary codes---Plotkin, Elias--Bassalygo, and the two McEliece--Rodemich--Rumsey--Welch (MRRW) bounds---from one theorem, the ``pretty good criterion.'' If the bit error rate under the pretty good measurement (PGM)---the quantum analog of posterior sampling---of a binary-input output-symmetric classical--quantum (cq) channel lies below $\\delta$, then every length-$n$ binary code, linear or nonlinear, of relative distance $\\delta$ has rate at most the channel's capacity, up to an $O(n^{-1/2})$ correction. Rate--distance bounds "},"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":"2608.09347","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-08-10T09:25:40Z","cross_cats_sorted":["math.CO","math.IT","quant-ph"],"title_canon_sha256":"bf7b0518ca8c058bd35459f86edd4432cba2e1648f6f3bd2031e84a63a09b07b","abstract_canon_sha256":"e4cea1ffa1ba2749443500db3f87c5e75da321e375194cd29d5b33c3b83268b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:22:23.980179Z","signature_b64":"61GQ7lHSdiHK65g1ryYaStJSRBSV+nY6XIj6mQAhUar75D3p41OgO3i5bzfHkgV6DwoCe1y1oyXdrOc5z9gDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44c46179122a9f0329a769a431ad8d2d6a270b2f971e196f740daa15cfcf8499","last_reissued_at":"2026-08-11T02:22:23.978753Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:22:23.978753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary code rate bounds via classical--quantum channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Omar Alrabiah, Venkatesan Guruswami","submitted_at":"2026-08-10T09:25:40Z","abstract_excerpt":"We derive the four principal asymptotic rate-distance tradeoffs for binary codes---Plotkin, Elias--Bassalygo, and the two McEliece--Rodemich--Rumsey--Welch (MRRW) bounds---from one theorem, the ``pretty good criterion.'' If the bit error rate under the pretty good measurement (PGM)---the quantum analog of posterior sampling---of a binary-input output-symmetric classical--quantum (cq) channel lies below $\\delta$, then every length-$n$ binary code, linear or nonlinear, of relative distance $\\delta$ has rate at most the channel's capacity, up to an $O(n^{-1/2})$ correction. Rate--distance bounds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09347","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/2608.09347/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":"2608.09347","created_at":"2026-08-11T02:22:23.979315+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.09347v1","created_at":"2026-08-11T02:22:23.979315+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09347","created_at":"2026-08-11T02:22:23.979315+00:00"},{"alias_kind":"pith_short_12","alias_value":"ITCGC6ISFKPQ","created_at":"2026-08-11T02:22:23.979315+00:00"},{"alias_kind":"pith_short_16","alias_value":"ITCGC6ISFKPQGKNH","created_at":"2026-08-11T02:22:23.979315+00:00"},{"alias_kind":"pith_short_8","alias_value":"ITCGC6IS","created_at":"2026-08-11T02:22:23.979315+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ITCGC6ISFKPQGKNHNGSDDLMNFV","json":"https://pith.science/pith/ITCGC6ISFKPQGKNHNGSDDLMNFV.json","graph_json":"https://pith.science/api/pith-number/ITCGC6ISFKPQGKNHNGSDDLMNFV/graph.json","events_json":"https://pith.science/api/pith-number/ITCGC6ISFKPQGKNHNGSDDLMNFV/events.json","paper":"https://pith.science/paper/ITCGC6IS"},"agent_actions":{"view_html":"https://pith.science/pith/ITCGC6ISFKPQGKNHNGSDDLMNFV","download_json":"https://pith.science/pith/ITCGC6ISFKPQGKNHNGSDDLMNFV.json","view_paper":"https://pith.science/paper/ITCGC6IS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.09347&json=true","fetch_graph":"https://pith.science/api/pith-number/ITCGC6ISFKPQGKNHNGSDDLMNFV/graph.json","fetch_events":"https://pith.science/api/pith-number/ITCGC6ISFKPQGKNHNGSDDLMNFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ITCGC6ISFKPQGKNHNGSDDLMNFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ITCGC6ISFKPQGKNHNGSDDLMNFV/action/storage_attestation","attest_author":"https://pith.science/pith/ITCGC6ISFKPQGKNHNGSDDLMNFV/action/author_attestation","sign_citation":"https://pith.science/pith/ITCGC6ISFKPQGKNHNGSDDLMNFV/action/citation_signature","submit_replication":"https://pith.science/pith/ITCGC6ISFKPQGKNHNGSDDLMNFV/action/replication_record"}},"created_at":"2026-08-11T02:22:23.979315+00:00","updated_at":"2026-08-11T02:22:23.979315+00:00"}