{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BUOGN5VEAJBIJQEDGQAM6NZAQ7","short_pith_number":"pith:BUOGN5VE","canonical_record":{"source":{"id":"1601.04689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T20:50:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f93b8d0b4de9e930cca4f04b674df06c4563818d9514e0681a8d30ca81b2ed22","abstract_canon_sha256":"f70b4b49b1e19f54fa4c816a766c6f436225bb561ad29a3f1f5e577a77b8642d"},"schema_version":"1.0"},"canonical_sha256":"0d1c66f6a4024284c0833400cf372087d2ca255914a497cd7417b97f68ebd94a","source":{"kind":"arxiv","id":"1601.04689","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04689","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04689v1","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04689","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"BUOGN5VEAJBI","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BUOGN5VEAJBIJQED","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BUOGN5VE","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BUOGN5VEAJBIJQEDGQAM6NZAQ7","target":"record","payload":{"canonical_record":{"source":{"id":"1601.04689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T20:50:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f93b8d0b4de9e930cca4f04b674df06c4563818d9514e0681a8d30ca81b2ed22","abstract_canon_sha256":"f70b4b49b1e19f54fa4c816a766c6f436225bb561ad29a3f1f5e577a77b8642d"},"schema_version":"1.0"},"canonical_sha256":"0d1c66f6a4024284c0833400cf372087d2ca255914a497cd7417b97f68ebd94a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:44.432353Z","signature_b64":"2jBaxQdjMHK70rEg5IvBZ18+rzOpxHHLRxXVoE18SdlKxcgpgzMcYBDiOZKySibijicy6fa7hK9n6FIVCfq7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d1c66f6a4024284c0833400cf372087d2ca255914a497cd7417b97f68ebd94a","last_reissued_at":"2026-05-18T01:22:44.431877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:44.431877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.04689","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-18T01:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GgYGLa191pKcaE5GFyuuc986JJKbiHF5m+NIzD6ckHbhSiotR3+vZJt3w/a/YOlNjTV7a0hR2c98B0h2WviLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:08:03.047244Z"},"content_sha256":"293b89b2ee0ded2540218211df6c621972d068c07582343c7888e66a5d9a303f","schema_version":"1.0","event_id":"sha256:293b89b2ee0ded2540218211df6c621972d068c07582343c7888e66a5d9a303f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BUOGN5VEAJBIJQEDGQAM6NZAQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reed-Muller Codes Achieve Capacity on Erasure Channels","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, Henry D. Pfister, Marco Mondelli, R\\\"udiger Urbanke, Santhosh Kumar, Shrinivas Kudekar","submitted_at":"2016-01-18T20:50:08Z","abstract_excerpt":"We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes our method exploits code symmetry. In particular, the technique applies to any sequence of linear codes where the blocklengths are strictly increasing, the code rates converge, and the permutation group of each code is doubly transitive. In other words, we show that symmetry alone implies near-optimal performance.\n  An important consequence of this result is that a sequence of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04689","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-18T01:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fkw7Jnv8j6kBwarUkU6bHkzyENUZUPTq5zjcGzV3vRG7WiS/CCQOzdeYPGTVvP7LxyFD14Swgadnc6st37hrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:08:03.047925Z"},"content_sha256":"8226fc2f2d2c3b19cda28b613813b2f4ebf4f9910e173b5dbfba712db297b429","schema_version":"1.0","event_id":"sha256:8226fc2f2d2c3b19cda28b613813b2f4ebf4f9910e173b5dbfba712db297b429"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BUOGN5VEAJBIJQEDGQAM6NZAQ7/bundle.json","state_url":"https://pith.science/pith/BUOGN5VEAJBIJQEDGQAM6NZAQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BUOGN5VEAJBIJQEDGQAM6NZAQ7/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-26T04:08:03Z","links":{"resolver":"https://pith.science/pith/BUOGN5VEAJBIJQEDGQAM6NZAQ7","bundle":"https://pith.science/pith/BUOGN5VEAJBIJQEDGQAM6NZAQ7/bundle.json","state":"https://pith.science/pith/BUOGN5VEAJBIJQEDGQAM6NZAQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BUOGN5VEAJBIJQEDGQAM6NZAQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BUOGN5VEAJBIJQEDGQAM6NZAQ7","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":"f70b4b49b1e19f54fa4c816a766c6f436225bb561ad29a3f1f5e577a77b8642d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T20:50:08Z","title_canon_sha256":"f93b8d0b4de9e930cca4f04b674df06c4563818d9514e0681a8d30ca81b2ed22"},"schema_version":"1.0","source":{"id":"1601.04689","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04689","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04689v1","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04689","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"BUOGN5VEAJBI","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BUOGN5VEAJBIJQED","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BUOGN5VE","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:8226fc2f2d2c3b19cda28b613813b2f4ebf4f9910e173b5dbfba712db297b429","target":"graph","created_at":"2026-05-18T01:22:44Z","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 introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes our method exploits code symmetry. In particular, the technique applies to any sequence of linear codes where the blocklengths are strictly increasing, the code rates converge, and the permutation group of each code is doubly transitive. In other words, we show that symmetry alone implies near-optimal performance.\n  An important consequence of this result is that a sequence of ","authors_text":"Eren \\c{S}a\\c{s}o\\u{g}lu, Henry D. Pfister, Marco Mondelli, R\\\"udiger Urbanke, Santhosh Kumar, Shrinivas Kudekar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T20:50:08Z","title":"Reed-Muller Codes Achieve Capacity on Erasure Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04689","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:293b89b2ee0ded2540218211df6c621972d068c07582343c7888e66a5d9a303f","target":"record","created_at":"2026-05-18T01:22:44Z","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":"f70b4b49b1e19f54fa4c816a766c6f436225bb561ad29a3f1f5e577a77b8642d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T20:50:08Z","title_canon_sha256":"f93b8d0b4de9e930cca4f04b674df06c4563818d9514e0681a8d30ca81b2ed22"},"schema_version":"1.0","source":{"id":"1601.04689","kind":"arxiv","version":1}},"canonical_sha256":"0d1c66f6a4024284c0833400cf372087d2ca255914a497cd7417b97f68ebd94a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d1c66f6a4024284c0833400cf372087d2ca255914a497cd7417b97f68ebd94a","first_computed_at":"2026-05-18T01:22:44.431877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:44.431877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2jBaxQdjMHK70rEg5IvBZ18+rzOpxHHLRxXVoE18SdlKxcgpgzMcYBDiOZKySibijicy6fa7hK9n6FIVCfq7Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:44.432353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04689","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:293b89b2ee0ded2540218211df6c621972d068c07582343c7888e66a5d9a303f","sha256:8226fc2f2d2c3b19cda28b613813b2f4ebf4f9910e173b5dbfba712db297b429"],"state_sha256":"34730859fe018624290e52a1e36c2e9764b559dc93621c9a23a94d16a0cd5742"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xJYTPy9RoZMRTQAZjBmj8tTr8MYij8DbOHp7o/wLhdJ5ntgcCUOW6yVKICcm7CTEe2fXEvJT67R3iCocVcRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:08:03.051759Z","bundle_sha256":"4ef46cd4c9fb3855e686dcaca96d1a592e2609492f01d62fe1ce982dddfef629"}}