{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AZTIXFEUBILYABL2XAD5QDYRPL","short_pith_number":"pith:AZTIXFEU","canonical_record":{"source":{"id":"1505.05123","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T19:29:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f93b8d0b4de9e930cca4f04b674df06c4563818d9514e0681a8d30ca81b2ed22","abstract_canon_sha256":"eb4d3b92da0970ddc791b4cc9e4b7b02c3f64af7d997ca6997b9999373e823e0"},"schema_version":"1.0"},"canonical_sha256":"06668b94940a1780057ab807d80f117af92a156b0c98227f3a0a966ba4f9b080","source":{"kind":"arxiv","id":"1505.05123","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05123","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05123v2","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05123","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"AZTIXFEUBILY","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"AZTIXFEUBILYABL2","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"AZTIXFEU","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AZTIXFEUBILYABL2XAD5QDYRPL","target":"record","payload":{"canonical_record":{"source":{"id":"1505.05123","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T19:29:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f93b8d0b4de9e930cca4f04b674df06c4563818d9514e0681a8d30ca81b2ed22","abstract_canon_sha256":"eb4d3b92da0970ddc791b4cc9e4b7b02c3f64af7d997ca6997b9999373e823e0"},"schema_version":"1.0"},"canonical_sha256":"06668b94940a1780057ab807d80f117af92a156b0c98227f3a0a966ba4f9b080","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:31.102421Z","signature_b64":"fn5c/JDbDkypnTZICiZjPpeU1u2wnKrZQstqAEkDV1KElahpg1cHwqhuS2Bx1gTmBHb33ZlUeJzS6Z8HUDyNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06668b94940a1780057ab807d80f117af92a156b0c98227f3a0a966ba4f9b080","last_reissued_at":"2026-05-18T01:49:31.101997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:31.101997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.05123","source_version":2,"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:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9qigmUv6ONf3rYZSNWSX64PsOv8WJJYlxZc/KMiyNO2oqB2cZKxb3jzGMuv6ABK7Yb8T59OUkBTJwyRCiHSNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:49:16.299325Z"},"content_sha256":"10ad5a2387d0dde582e55b5ced7446075d39c5230ef78744b2efffbab68550eb","schema_version":"1.0","event_id":"sha256:10ad5a2387d0dde582e55b5ced7446075d39c5230ef78744b2efffbab68550eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AZTIXFEUBILYABL2XAD5QDYRPL","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":"Henry D. Pfister, Santhosh Kumar","submitted_at":"2015-05-19T19:29:26Z","abstract_excerpt":"This paper introduces 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, this method requires only that the codes are highly symmetric. In particular, the technique applies to any sequence of linear codes where the blocklengths are strictly increasing, the code rates converge to a number between 0 and 1, and the permutation group of each code is doubly transitive. This also provides a rare example in information theory where symmetry alone"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05123","kind":"arxiv","version":2},"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:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3t5lsF5o/jaMezw1OO7uQL8GWHvpqffffVTECMu1UKB7jco2KBtFn5BQwlKy1kHnrxasdSduMj4Woy8U68AWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:49:16.301165Z"},"content_sha256":"da9b599425a3b99242201fc16eb03d9832c18369463e17cf30f5b8f81eb93dd8","schema_version":"1.0","event_id":"sha256:da9b599425a3b99242201fc16eb03d9832c18369463e17cf30f5b8f81eb93dd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZTIXFEUBILYABL2XAD5QDYRPL/bundle.json","state_url":"https://pith.science/pith/AZTIXFEUBILYABL2XAD5QDYRPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZTIXFEUBILYABL2XAD5QDYRPL/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-27T11:49:16Z","links":{"resolver":"https://pith.science/pith/AZTIXFEUBILYABL2XAD5QDYRPL","bundle":"https://pith.science/pith/AZTIXFEUBILYABL2XAD5QDYRPL/bundle.json","state":"https://pith.science/pith/AZTIXFEUBILYABL2XAD5QDYRPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZTIXFEUBILYABL2XAD5QDYRPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AZTIXFEUBILYABL2XAD5QDYRPL","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":"eb4d3b92da0970ddc791b4cc9e4b7b02c3f64af7d997ca6997b9999373e823e0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T19:29:26Z","title_canon_sha256":"f93b8d0b4de9e930cca4f04b674df06c4563818d9514e0681a8d30ca81b2ed22"},"schema_version":"1.0","source":{"id":"1505.05123","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05123","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05123v2","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05123","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"AZTIXFEUBILY","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"AZTIXFEUBILYABL2","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"AZTIXFEU","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:da9b599425a3b99242201fc16eb03d9832c18369463e17cf30f5b8f81eb93dd8","target":"graph","created_at":"2026-05-18T01:49:31Z","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 introduces 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, this method requires only that the codes are highly symmetric. In particular, the technique applies to any sequence of linear codes where the blocklengths are strictly increasing, the code rates converge to a number between 0 and 1, and the permutation group of each code is doubly transitive. This also provides a rare example in information theory where symmetry alone","authors_text":"Henry D. Pfister, Santhosh Kumar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T19:29:26Z","title":"Reed-Muller Codes Achieve Capacity on Erasure Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05123","kind":"arxiv","version":2},"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:10ad5a2387d0dde582e55b5ced7446075d39c5230ef78744b2efffbab68550eb","target":"record","created_at":"2026-05-18T01:49:31Z","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":"eb4d3b92da0970ddc791b4cc9e4b7b02c3f64af7d997ca6997b9999373e823e0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T19:29:26Z","title_canon_sha256":"f93b8d0b4de9e930cca4f04b674df06c4563818d9514e0681a8d30ca81b2ed22"},"schema_version":"1.0","source":{"id":"1505.05123","kind":"arxiv","version":2}},"canonical_sha256":"06668b94940a1780057ab807d80f117af92a156b0c98227f3a0a966ba4f9b080","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06668b94940a1780057ab807d80f117af92a156b0c98227f3a0a966ba4f9b080","first_computed_at":"2026-05-18T01:49:31.101997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:49:31.101997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fn5c/JDbDkypnTZICiZjPpeU1u2wnKrZQstqAEkDV1KElahpg1cHwqhuS2Bx1gTmBHb33ZlUeJzS6Z8HUDyNBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:49:31.102421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05123","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10ad5a2387d0dde582e55b5ced7446075d39c5230ef78744b2efffbab68550eb","sha256:da9b599425a3b99242201fc16eb03d9832c18369463e17cf30f5b8f81eb93dd8"],"state_sha256":"5896d1b83708e9d9038c106a45b208bf5522efbec555056afb6d038f787aa860"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C8ym+1XCoiPaFxgzNNJccEEQNOX9Ewhhx00ru+uubqxwsqc4jdjUT7Na4InKnQqZSzBCJM6Q5cFzfjHyWkdaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:49:16.304612Z","bundle_sha256":"57bb171405b1d0a96540a73f220f153e4e67e2f8cf87563f0684297cefbe7179"}}