{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HAFRPLF7SQEBNXUIW6GDKXVMWB","short_pith_number":"pith:HAFRPLF7","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"},"canonical_sha256":"380b17acbf940816de88b78c355eacb05bbba0597778237f5e9b5f58c7da513e","source":{"kind":"arxiv","id":"1505.05831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05831","created_at":"2026-05-18T02:03:53Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05831v1","created_at":"2026-05-18T02:03:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05831","created_at":"2026-05-18T02:03:53Z"},{"alias_kind":"pith_short_12","alias_value":"HAFRPLF7SQEB","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"HAFRPLF7SQEBNXUI","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"HAFRPLF7","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HAFRPLF7SQEBNXUIW6GDKXVMWB","target":"record","payload":{"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"},"canonical_sha256":"380b17acbf940816de88b78c355eacb05bbba0597778237f5e9b5f58c7da513e","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"},"source_kind":"arxiv","source_id":"1505.05831","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:03:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+/O892/RQcirV6fqct1KEgektacZbtxnsBgC0AY7cp3xwPuAYe1zRuplikhazT1ZKU4XputuPlFpJQw/9pRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:41:01.547706Z"},"content_sha256":"5ee83a80fd8bd0e0e145251cdc1b282126cc68d2636c08cfd0236e9a213be32a","schema_version":"1.0","event_id":"sha256:5ee83a80fd8bd0e0e145251cdc1b282126cc68d2636c08cfd0236e9a213be32a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HAFRPLF7SQEBNXUIW6GDKXVMWB","target":"graph","payload":{"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"},"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:03:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OcfP4IbGqmY0uj+GivsL6FEqmrAF93FXXUdWwgbEDyPaga9ntin7fAE8tUsWzEOigZ6bwmWOMNR/zZK9uE7dCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:41:01.548463Z"},"content_sha256":"7dc8e7f3c45837aa21948399347d78cddfd43ba7122351ffb179064b5f9d654c","schema_version":"1.0","event_id":"sha256:7dc8e7f3c45837aa21948399347d78cddfd43ba7122351ffb179064b5f9d654c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB/bundle.json","state_url":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB/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-05-25T14:41:01Z","links":{"resolver":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB","bundle":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB/bundle.json","state":"https://pith.science/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAFRPLF7SQEBNXUIW6GDKXVMWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HAFRPLF7SQEBNXUIW6GDKXVMWB","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":"943787c186c914d0cba2f3fd0f1a049ea2996a1118b049bcb0c8d91b96092f3e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T18:41:44Z","title_canon_sha256":"ac796caff7a3dc6fad9cfe2118d1028b87a5db9fb1fb352faac167c3bb64554c"},"schema_version":"1.0","source":{"id":"1505.05831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05831","created_at":"2026-05-18T02:03:53Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05831v1","created_at":"2026-05-18T02:03:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05831","created_at":"2026-05-18T02:03:53Z"},{"alias_kind":"pith_short_12","alias_value":"HAFRPLF7SQEB","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"HAFRPLF7SQEBNXUI","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"HAFRPLF7","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:7dc8e7f3c45837aa21948399347d78cddfd43ba7122351ffb179064b5f9d654c","target":"graph","created_at":"2026-05-18T02:03: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"},"paper":{"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","authors_text":"Eren \\c{S}a\\c{s}o\\u{g}lu, Marco Mondelli, R\\\"udiger Urbanke, Shrinivas Kudekar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T18:41:44Z","title":"Reed-Muller Codes Achieve Capacity on the Binary Erasure Channel under MAP Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05831","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:5ee83a80fd8bd0e0e145251cdc1b282126cc68d2636c08cfd0236e9a213be32a","target":"record","created_at":"2026-05-18T02:03: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":"943787c186c914d0cba2f3fd0f1a049ea2996a1118b049bcb0c8d91b96092f3e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T18:41:44Z","title_canon_sha256":"ac796caff7a3dc6fad9cfe2118d1028b87a5db9fb1fb352faac167c3bb64554c"},"schema_version":"1.0","source":{"id":"1505.05831","kind":"arxiv","version":1}},"canonical_sha256":"380b17acbf940816de88b78c355eacb05bbba0597778237f5e9b5f58c7da513e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"380b17acbf940816de88b78c355eacb05bbba0597778237f5e9b5f58c7da513e","first_computed_at":"2026-05-18T02:03:53.346543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:53.346543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A1xOMblWD1jTET8mfX0KybhVN3Zge3dG69FkWbesDEw03HnybCSgE8xhbztKp7nO1nSd2uu9k3uv3Cl3PhahCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:53.347429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ee83a80fd8bd0e0e145251cdc1b282126cc68d2636c08cfd0236e9a213be32a","sha256:7dc8e7f3c45837aa21948399347d78cddfd43ba7122351ffb179064b5f9d654c"],"state_sha256":"d463bb8e0ca3487bc8ef9e903eb40010a1483a6fc9766170e7adfe36c6763190"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QxeMzkij2T3Mz5ihGmKORMzIFs7dCqOyyJV+/k+/0vl2b1jDYBVvwvkR5VEjVJECJLR4nReN0fiflTqyJBAlBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:41:01.552077Z","bundle_sha256":"fec811e1590aad0b0ec19867520f6d634296bd4074138e58da235f8ee1500c2b"}}