{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TGHGR2VCUMON2TZBWF7GIIOJND","short_pith_number":"pith:TGHGR2VC","schema_version":"1.0","canonical_sha256":"998e68eaa2a31cdd4f21b17e6421c968de8e7b875c1728e11265341d063d7755","source":{"kind":"arxiv","id":"1411.4590","version":1},"attestation_state":"computed","paper":{"title":"Reed-Muller codes for random erasures and errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Shpilka, Avi Wigderson, Emmanuel Abbe","submitted_at":"2014-11-17T19:04:27Z","abstract_excerpt":"This paper studies the parameters for which Reed-Muller (RM) codes over $GF(2)$ can correct random erasures and random errors with high probability, and in particular when can they achieve capacity for these two classical channels. Necessarily, the paper also studies properties of evaluations of multi-variate $GF(2)$ polynomials on random sets of inputs.\n  For erasures, we prove that RM codes achieve capacity both for very high rate and very low rate regimes. For errors, we prove that RM codes achieve capacity for very low rate regimes, and for very high rates, we show that they can uniquely 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":"1411.4590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-17T19:04:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d37a351da4e4d512f46a61b02f797b17e027ba0321f4a0bfb15b14aff8277cc6","abstract_canon_sha256":"8f30bfea45c972bf303ecb5e92811297a9f16452bb89e8fc58bd55a348945319"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:45.388727Z","signature_b64":"bJeZVnQcEO+yIsz1HjHPLAROVSgcIVMkO10E6Qb2rLBWdZR/2tUiER634oTtCDFXBh5vHPotzBNgOIkyTUhsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"998e68eaa2a31cdd4f21b17e6421c968de8e7b875c1728e11265341d063d7755","last_reissued_at":"2026-05-18T02:35:45.388344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:45.388344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reed-Muller codes for random erasures and errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Shpilka, Avi Wigderson, Emmanuel Abbe","submitted_at":"2014-11-17T19:04:27Z","abstract_excerpt":"This paper studies the parameters for which Reed-Muller (RM) codes over $GF(2)$ can correct random erasures and random errors with high probability, and in particular when can they achieve capacity for these two classical channels. Necessarily, the paper also studies properties of evaluations of multi-variate $GF(2)$ polynomials on random sets of inputs.\n  For erasures, we prove that RM codes achieve capacity both for very high rate and very low rate regimes. For errors, we prove that RM codes achieve capacity for very low rate regimes, and for very high rates, we show that they can uniquely d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4590","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":""},"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":"1411.4590","created_at":"2026-05-18T02:35:45.388400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4590v1","created_at":"2026-05-18T02:35:45.388400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4590","created_at":"2026-05-18T02:35:45.388400+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGHGR2VCUMON","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGHGR2VCUMON2TZB","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGHGR2VC","created_at":"2026-05-18T12:28:49.207871+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/TGHGR2VCUMON2TZBWF7GIIOJND","json":"https://pith.science/pith/TGHGR2VCUMON2TZBWF7GIIOJND.json","graph_json":"https://pith.science/api/pith-number/TGHGR2VCUMON2TZBWF7GIIOJND/graph.json","events_json":"https://pith.science/api/pith-number/TGHGR2VCUMON2TZBWF7GIIOJND/events.json","paper":"https://pith.science/paper/TGHGR2VC"},"agent_actions":{"view_html":"https://pith.science/pith/TGHGR2VCUMON2TZBWF7GIIOJND","download_json":"https://pith.science/pith/TGHGR2VCUMON2TZBWF7GIIOJND.json","view_paper":"https://pith.science/paper/TGHGR2VC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4590&json=true","fetch_graph":"https://pith.science/api/pith-number/TGHGR2VCUMON2TZBWF7GIIOJND/graph.json","fetch_events":"https://pith.science/api/pith-number/TGHGR2VCUMON2TZBWF7GIIOJND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGHGR2VCUMON2TZBWF7GIIOJND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGHGR2VCUMON2TZBWF7GIIOJND/action/storage_attestation","attest_author":"https://pith.science/pith/TGHGR2VCUMON2TZBWF7GIIOJND/action/author_attestation","sign_citation":"https://pith.science/pith/TGHGR2VCUMON2TZBWF7GIIOJND/action/citation_signature","submit_replication":"https://pith.science/pith/TGHGR2VCUMON2TZBWF7GIIOJND/action/replication_record"}},"created_at":"2026-05-18T02:35:45.388400+00:00","updated_at":"2026-05-18T02:35:45.388400+00:00"}