{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YW75WPBJFY25PTIUFSUXXBADXR","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":"14a7c6c061e43dcac78c51ff8e956fd7d80704b229866192191d5a74aeb598c2","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-10T06:44:08Z","title_canon_sha256":"720b4ac77a4a628feef1c7cc54b1980211957f415f8cdb94eff27ebf79775d04"},"schema_version":"1.0","source":{"id":"2501.05748","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.05748","created_at":"2026-07-05T10:19:57Z"},{"alias_kind":"arxiv_version","alias_value":"2501.05748v2","created_at":"2026-07-05T10:19:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05748","created_at":"2026-07-05T10:19:57Z"},{"alias_kind":"pith_short_12","alias_value":"YW75WPBJFY25","created_at":"2026-07-05T10:19:57Z"},{"alias_kind":"pith_short_16","alias_value":"YW75WPBJFY25PTIU","created_at":"2026-07-05T10:19:57Z"},{"alias_kind":"pith_short_8","alias_value":"YW75WPBJ","created_at":"2026-07-05T10:19:57Z"}],"graph_snapshots":[{"event_id":"sha256:3277cbaaa6cac0038d8b081b1d68d2263bfebcd2f70170df61666b9abbb33dd9","target":"graph","created_at":"2026-07-05T10:19:57Z","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/2501.05748/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide a general framework for bounding the block error threshold of a linear code $C\\subseteq \\mathbb{F}_2^N$ over the erasure channel in terms of its bit error threshold. Our approach relies on understanding the minimum support weight of any $r$-dimensional subcode of $C$, for all small values of $r$. As a proof of concept, we use our machinery to obtain a new proof of the celebrated result that Reed-Muller codes achieve capacity on the erasure channel with respect to block error probability.","authors_text":"Gilles Z\\'emor, Henry D. Pfister, Oscar Sprumont","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-10T06:44:08Z","title":"From Bit to Block: Decoding on Erasure Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.05748","kind":"arxiv","version":2},"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:62a05269a73d422d8b2ff0694ae7363b6cd4a04ea700bad803436e8502accb11","target":"record","created_at":"2026-07-05T10:19:57Z","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":"14a7c6c061e43dcac78c51ff8e956fd7d80704b229866192191d5a74aeb598c2","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-10T06:44:08Z","title_canon_sha256":"720b4ac77a4a628feef1c7cc54b1980211957f415f8cdb94eff27ebf79775d04"},"schema_version":"1.0","source":{"id":"2501.05748","kind":"arxiv","version":2}},"canonical_sha256":"c5bfdb3c292e35d7cd142ca97b8403bc43d130988e3e6e6ce43180959ba27d08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5bfdb3c292e35d7cd142ca97b8403bc43d130988e3e6e6ce43180959ba27d08","first_computed_at":"2026-07-05T10:19:57.054594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:19:57.054594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V1YkBtU7cKdJvSLJ+6dm35LIJkC4YVngVtp86sE9trTlyGgynGAL5GSdfNrXd4VPSpiHN17ea1p5NRAnM5VBAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:19:57.055105Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.05748","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62a05269a73d422d8b2ff0694ae7363b6cd4a04ea700bad803436e8502accb11","sha256:3277cbaaa6cac0038d8b081b1d68d2263bfebcd2f70170df61666b9abbb33dd9"],"state_sha256":"75acb34d212bbfbb5aac2220062e3c96b32d11eb83b9dfecd620b44de24ec3e2"}