{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HAFRPLF7SQEBNXUIW6GDKXVMWB","short_pith_number":"pith:HAFRPLF7","schema_version":"1.0","canonical_sha256":"380b17acbf940816de88b78c355eacb05bbba0597778237f5e9b5f58c7da513e","source":{"kind":"arxiv","id":"1505.05831","version":1},"attestation_state":"computed","paper":{"title":"Reed-Muller Codes Achieve Capacity on the Binary Erasure Channel under MAP Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eren \\c{S}a\\c{s}o\\u{g}lu, Marco Mondelli, R\\\"udiger Urbanke, Shrinivas Kudekar","submitted_at":"2015-05-21T18:41:44Z","abstract_excerpt":"We show that Reed-Muller codes achieve capacity under maximum a posteriori bit decoding for transmission over the binary erasure channel for all rates $0 < R < 1$. The proof is generic and applies to other codes with sufficient amount of symmetry as well. The main idea is to combine the following observations: (i) monotone functions experience a sharp threshold behavior, (ii) the extrinsic information transfer (EXIT) functions are monotone, (iii) Reed--Muller codes are 2-transitive and thus the EXIT functions associated with their codeword bits are all equal, and (iv) therefore the Area Theore"},"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":"1505.05831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T18:41:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac796caff7a3dc6fad9cfe2118d1028b87a5db9fb1fb352faac167c3bb64554c","abstract_canon_sha256":"943787c186c914d0cba2f3fd0f1a049ea2996a1118b049bcb0c8d91b96092f3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:53.347429Z","signature_b64":"A1xOMblWD1jTET8mfX0KybhVN3Zge3dG69FkWbesDEw03HnybCSgE8xhbztKp7nO1nSd2uu9k3uv3Cl3PhahCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"380b17acbf940816de88b78c355eacb05bbba0597778237f5e9b5f58c7da513e","last_reissued_at":"2026-05-18T02:03:53.346543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:53.346543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reed-Muller Codes Achieve Capacity on the Binary Erasure Channel under MAP Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eren \\c{S}a\\c{s}o\\u{g}lu, Marco Mondelli, R\\\"udiger Urbanke, Shrinivas Kudekar","submitted_at":"2015-05-21T18:41:44Z","abstract_excerpt":"We show that Reed-Muller codes achieve capacity under maximum a posteriori bit decoding for transmission over the binary erasure channel for all rates $0 < R < 1$. The proof is generic and applies to other codes with sufficient amount of symmetry as well. The main idea is to combine the following observations: (i) monotone functions experience a sharp threshold behavior, (ii) the extrinsic information transfer (EXIT) functions are monotone, (iii) Reed--Muller codes are 2-transitive and thus the EXIT functions associated with their codeword bits are all equal, and (iv) therefore the Area Theore"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05831","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":"1505.05831","created_at":"2026-05-18T02:03:53.346678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05831v1","created_at":"2026-05-18T02:03:53.346678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05831","created_at":"2026-05-18T02:03:53.346678+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAFRPLF7SQEB","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAFRPLF7SQEBNXUI","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAFRPLF7","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10310","citing_title":"Repairing Generalized Reed-Muller Codes","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB","json":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB.json","graph_json":"https://pith.science/api/pith-number/HAFRPLF7SQEBNXUIW6GDKXVMWB/graph.json","events_json":"https://pith.science/api/pith-number/HAFRPLF7SQEBNXUIW6GDKXVMWB/events.json","paper":"https://pith.science/paper/HAFRPLF7"},"agent_actions":{"view_html":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB","download_json":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB.json","view_paper":"https://pith.science/paper/HAFRPLF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05831&json=true","fetch_graph":"https://pith.science/api/pith-number/HAFRPLF7SQEBNXUIW6GDKXVMWB/graph.json","fetch_events":"https://pith.science/api/pith-number/HAFRPLF7SQEBNXUIW6GDKXVMWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB/action/storage_attestation","attest_author":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB/action/author_attestation","sign_citation":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB/action/citation_signature","submit_replication":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB/action/replication_record"}},"created_at":"2026-05-18T02:03:53.346678+00:00","updated_at":"2026-05-18T02:03:53.346678+00:00"}