{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TGHGR2VCUMON2TZBWF7GIIOJND","short_pith_number":"pith:TGHGR2VC","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"},"canonical_sha256":"998e68eaa2a31cdd4f21b17e6421c968de8e7b875c1728e11265341d063d7755","source":{"kind":"arxiv","id":"1411.4590","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4590","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4590v1","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4590","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"TGHGR2VCUMON","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TGHGR2VCUMON2TZB","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TGHGR2VC","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TGHGR2VCUMON2TZBWF7GIIOJND","target":"record","payload":{"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"},"canonical_sha256":"998e68eaa2a31cdd4f21b17e6421c968de8e7b875c1728e11265341d063d7755","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"},"source_kind":"arxiv","source_id":"1411.4590","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:35:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xewgt0/LYmUK46oBCGo9aPSj+cpGjTH3CD67LAHuols/rv6ZoThJthvXEBbrW86+LPCgAn7f72eaD0znxTC+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:51:59.903356Z"},"content_sha256":"5ec85d874fe995d39eeacc7759c25a3ec2f04baa899b159096b5636f10158ad6","schema_version":"1.0","event_id":"sha256:5ec85d874fe995d39eeacc7759c25a3ec2f04baa899b159096b5636f10158ad6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TGHGR2VCUMON2TZBWF7GIIOJND","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:35:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQJdvZbrCMkkluSPay8HM8Is+QHmKbYpmdtniV+2LlhUqdGj1xg3EwTqs6lG86d56orsaph4HBPWlxO0/XECDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:51:59.904067Z"},"content_sha256":"bbb329eccfbd7130b1b17c4db9d1870d253503bad77e421109309e213f6d0152","schema_version":"1.0","event_id":"sha256:bbb329eccfbd7130b1b17c4db9d1870d253503bad77e421109309e213f6d0152"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TGHGR2VCUMON2TZBWF7GIIOJND/bundle.json","state_url":"https://pith.science/pith/TGHGR2VCUMON2TZBWF7GIIOJND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TGHGR2VCUMON2TZBWF7GIIOJND/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T08:51:59Z","links":{"resolver":"https://pith.science/pith/TGHGR2VCUMON2TZBWF7GIIOJND","bundle":"https://pith.science/pith/TGHGR2VCUMON2TZBWF7GIIOJND/bundle.json","state":"https://pith.science/pith/TGHGR2VCUMON2TZBWF7GIIOJND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TGHGR2VCUMON2TZBWF7GIIOJND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TGHGR2VCUMON2TZBWF7GIIOJND","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":"8f30bfea45c972bf303ecb5e92811297a9f16452bb89e8fc58bd55a348945319","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-17T19:04:27Z","title_canon_sha256":"d37a351da4e4d512f46a61b02f797b17e027ba0321f4a0bfb15b14aff8277cc6"},"schema_version":"1.0","source":{"id":"1411.4590","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4590","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4590v1","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4590","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"TGHGR2VCUMON","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TGHGR2VCUMON2TZB","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TGHGR2VC","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:bbb329eccfbd7130b1b17c4db9d1870d253503bad77e421109309e213f6d0152","target":"graph","created_at":"2026-05-18T02:35:45Z","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"},"paper":{"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","authors_text":"Amir Shpilka, Avi Wigderson, Emmanuel Abbe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-17T19:04:27Z","title":"Reed-Muller codes for random erasures and errors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4590","kind":"arxiv","version":1},"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:5ec85d874fe995d39eeacc7759c25a3ec2f04baa899b159096b5636f10158ad6","target":"record","created_at":"2026-05-18T02:35:45Z","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":"8f30bfea45c972bf303ecb5e92811297a9f16452bb89e8fc58bd55a348945319","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-17T19:04:27Z","title_canon_sha256":"d37a351da4e4d512f46a61b02f797b17e027ba0321f4a0bfb15b14aff8277cc6"},"schema_version":"1.0","source":{"id":"1411.4590","kind":"arxiv","version":1}},"canonical_sha256":"998e68eaa2a31cdd4f21b17e6421c968de8e7b875c1728e11265341d063d7755","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"998e68eaa2a31cdd4f21b17e6421c968de8e7b875c1728e11265341d063d7755","first_computed_at":"2026-05-18T02:35:45.388344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:45.388344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bJeZVnQcEO+yIsz1HjHPLAROVSgcIVMkO10E6Qb2rLBWdZR/2tUiER634oTtCDFXBh5vHPotzBNgOIkyTUhsCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:45.388727Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4590","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ec85d874fe995d39eeacc7759c25a3ec2f04baa899b159096b5636f10158ad6","sha256:bbb329eccfbd7130b1b17c4db9d1870d253503bad77e421109309e213f6d0152"],"state_sha256":"e7e14285ec4bf017c5bab542998542ef06e056352384df9aa80ad06d6a4f3d42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AU7ytYbn1wTwSIJEt+2+wzHH+5l1MiFpsM61KGKsFnv5/TWU/j64lwF5PgynTRdcJuMxTnX1zTQAdaN2bzYDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:51:59.907836Z","bundle_sha256":"1e50a7401c7fa877284fcd4fa31ff17b5ae1254fc97fd6a984ee7af938a4051d"}}