{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:U5FTGQNYUBZ6ZEXGTKCRIQLJYR","short_pith_number":"pith:U5FTGQNY","schema_version":"1.0","canonical_sha256":"a74b3341b8a073ec92e69a85144169c46af54c60c6b29621afd5a98244f559bf","source":{"kind":"arxiv","id":"2202.00240","version":6},"attestation_state":"computed","paper":{"title":"A Criterion for Decoding on the BSC","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anup Rao, Oscar Sprumont","submitted_at":"2022-02-01T06:38:43Z","abstract_excerpt":"We present an approach to showing that a linear code is resilient to random errors. We use this approach to obtain decoding results for both transitive codes and Reed-Muller codes. We give three kinds of results about linear codes in general, and transitive linear codes in particular.\n  1) We give a tight bound on the weight distribution of every transitive linear code $C \\subseteq \\mathbb{F}_2^N$: $\\Pr_{c \\in C}[|c| = \\alpha N] \\leq 2^{-(1-h(\\alpha)) \\mathsf{dim}(C)}$.\n  2) We give a criterion that certifies that a linear code $C$ can be decoded on the binary symmetric channel. Let $K_s(x)$ d"},"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":"2202.00240","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-02-01T06:38:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d6fbdb36fd6692ac33c7352aced3e07338b0692795b0129bc312289185782978","abstract_canon_sha256":"fbadad8a201a5d8f8b199da4083402ce8655dae904af24f40fdd6c74bd75e0ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:53.942536Z","signature_b64":"yucp4Kt+Sbe56But/ptESTLXO9/vzfunH65OzY6XRU02Ifm1uWWURum2Q9xs6lwigPrlV/IggLeoe26D71nZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a74b3341b8a073ec92e69a85144169c46af54c60c6b29621afd5a98244f559bf","last_reissued_at":"2026-07-05T10:19:53.941974Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:53.941974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Criterion for Decoding on the BSC","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anup Rao, Oscar Sprumont","submitted_at":"2022-02-01T06:38:43Z","abstract_excerpt":"We present an approach to showing that a linear code is resilient to random errors. We use this approach to obtain decoding results for both transitive codes and Reed-Muller codes. We give three kinds of results about linear codes in general, and transitive linear codes in particular.\n  1) We give a tight bound on the weight distribution of every transitive linear code $C \\subseteq \\mathbb{F}_2^N$: $\\Pr_{c \\in C}[|c| = \\alpha N] \\leq 2^{-(1-h(\\alpha)) \\mathsf{dim}(C)}$.\n  2) We give a criterion that certifies that a linear code $C$ can be decoded on the binary symmetric channel. Let $K_s(x)$ d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.00240","kind":"arxiv","version":6},"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/2202.00240/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":"2202.00240","created_at":"2026-07-05T10:19:53.942078+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.00240v6","created_at":"2026-07-05T10:19:53.942078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.00240","created_at":"2026-07-05T10:19:53.942078+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5FTGQNYUBZ6","created_at":"2026-07-05T10:19:53.942078+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5FTGQNYUBZ6ZEXG","created_at":"2026-07-05T10:19:53.942078+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5FTGQNY","created_at":"2026-07-05T10:19:53.942078+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/U5FTGQNYUBZ6ZEXGTKCRIQLJYR","json":"https://pith.science/pith/U5FTGQNYUBZ6ZEXGTKCRIQLJYR.json","graph_json":"https://pith.science/api/pith-number/U5FTGQNYUBZ6ZEXGTKCRIQLJYR/graph.json","events_json":"https://pith.science/api/pith-number/U5FTGQNYUBZ6ZEXGTKCRIQLJYR/events.json","paper":"https://pith.science/paper/U5FTGQNY"},"agent_actions":{"view_html":"https://pith.science/pith/U5FTGQNYUBZ6ZEXGTKCRIQLJYR","download_json":"https://pith.science/pith/U5FTGQNYUBZ6ZEXGTKCRIQLJYR.json","view_paper":"https://pith.science/paper/U5FTGQNY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.00240&json=true","fetch_graph":"https://pith.science/api/pith-number/U5FTGQNYUBZ6ZEXGTKCRIQLJYR/graph.json","fetch_events":"https://pith.science/api/pith-number/U5FTGQNYUBZ6ZEXGTKCRIQLJYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5FTGQNYUBZ6ZEXGTKCRIQLJYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5FTGQNYUBZ6ZEXGTKCRIQLJYR/action/storage_attestation","attest_author":"https://pith.science/pith/U5FTGQNYUBZ6ZEXGTKCRIQLJYR/action/author_attestation","sign_citation":"https://pith.science/pith/U5FTGQNYUBZ6ZEXGTKCRIQLJYR/action/citation_signature","submit_replication":"https://pith.science/pith/U5FTGQNYUBZ6ZEXGTKCRIQLJYR/action/replication_record"}},"created_at":"2026-07-05T10:19:53.942078+00:00","updated_at":"2026-07-05T10:19:53.942078+00:00"}