{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:U5FTGQNYUBZ6ZEXGTKCRIQLJYR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fbadad8a201a5d8f8b199da4083402ce8655dae904af24f40fdd6c74bd75e0ad","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-02-01T06:38:43Z","title_canon_sha256":"d6fbdb36fd6692ac33c7352aced3e07338b0692795b0129bc312289185782978"},"schema_version":"1.0","source":{"id":"2202.00240","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.00240","created_at":"2026-07-05T10:19:53Z"},{"alias_kind":"arxiv_version","alias_value":"2202.00240v6","created_at":"2026-07-05T10:19:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.00240","created_at":"2026-07-05T10:19:53Z"},{"alias_kind":"pith_short_12","alias_value":"U5FTGQNYUBZ6","created_at":"2026-07-05T10:19:53Z"},{"alias_kind":"pith_short_16","alias_value":"U5FTGQNYUBZ6ZEXG","created_at":"2026-07-05T10:19:53Z"},{"alias_kind":"pith_short_8","alias_value":"U5FTGQNY","created_at":"2026-07-05T10:19:53Z"}],"graph_snapshots":[{"event_id":"sha256:c7f1483cbf7a4cab9de226d5d5b7cf2bee7dfeee93b2f766ee6840cb1849e658","target":"graph","created_at":"2026-07-05T10:19:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.00240/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anup Rao, Oscar Sprumont","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-02-01T06:38:43Z","title":"A Criterion for Decoding on the BSC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.00240","kind":"arxiv","version":6},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ffbb714a987ae640a2370291d770d080c3d0bc203e8248f5497bbf463aa8bd12","target":"record","created_at":"2026-07-05T10:19:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fbadad8a201a5d8f8b199da4083402ce8655dae904af24f40fdd6c74bd75e0ad","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-02-01T06:38:43Z","title_canon_sha256":"d6fbdb36fd6692ac33c7352aced3e07338b0692795b0129bc312289185782978"},"schema_version":"1.0","source":{"id":"2202.00240","kind":"arxiv","version":6}},"canonical_sha256":"a74b3341b8a073ec92e69a85144169c46af54c60c6b29621afd5a98244f559bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a74b3341b8a073ec92e69a85144169c46af54c60c6b29621afd5a98244f559bf","first_computed_at":"2026-07-05T10:19:53.941974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:19:53.941974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yucp4Kt+Sbe56But/ptESTLXO9/vzfunH65OzY6XRU02Ifm1uWWURum2Q9xs6lwigPrlV/IggLeoe26D71nZBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:19:53.942536Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.00240","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffbb714a987ae640a2370291d770d080c3d0bc203e8248f5497bbf463aa8bd12","sha256:c7f1483cbf7a4cab9de226d5d5b7cf2bee7dfeee93b2f766ee6840cb1849e658"],"state_sha256":"14e2232081ead31898dd043c5a0549d2f7072735d1d742c67bab2679a14a5d75"}