{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Y7WTMR2FU4UZYGWOBIFS2U3DNB","short_pith_number":"pith:Y7WTMR2F","canonical_record":{"source":{"id":"1601.06908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T07:13:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d5b9ca771b0e61c0fe8d748d83a5a5d32f32004fb17910ab25dd00e668c52de7","abstract_canon_sha256":"41203b0ea27960181560f060a5084607d8ac5fdaea818e21efc379a143fb48ec"},"schema_version":"1.0"},"canonical_sha256":"c7ed364745a7299c1ace0a0b2d5363685149f76875b87bad5a05db2c9f33060d","source":{"kind":"arxiv","id":"1601.06908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06908","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06908v1","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06908","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"Y7WTMR2FU4UZ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Y7WTMR2FU4UZYGWO","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Y7WTMR2F","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Y7WTMR2FU4UZYGWOBIFS2U3DNB","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T07:13:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d5b9ca771b0e61c0fe8d748d83a5a5d32f32004fb17910ab25dd00e668c52de7","abstract_canon_sha256":"41203b0ea27960181560f060a5084607d8ac5fdaea818e21efc379a143fb48ec"},"schema_version":"1.0"},"canonical_sha256":"c7ed364745a7299c1ace0a0b2d5363685149f76875b87bad5a05db2c9f33060d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:59.551684Z","signature_b64":"k6c97tkaqKVnmyBvskamdr88IhJB8lPTk47vIa4vjAAxUbOzI9/OlcgVg3wXARQjOzBGLvzze3XCEhYdnNyECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7ed364745a7299c1ace0a0b2d5363685149f76875b87bad5a05db2c9f33060d","last_reissued_at":"2026-05-18T01:21:59.551090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:59.551090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06908","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:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00VCstPP7wNaqy6JFYCmYX7fUKQe6aathzK7cm8LWxieV3VZQY71zJWwBcob4wzMHjD2a0j0Wn7PQH4GH2fsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:20:52.183829Z"},"content_sha256":"448d614450acc9787605f75afb630864d03067b360601dd2928046f28e1b2586","schema_version":"1.0","event_id":"sha256:448d614450acc9787605f75afb630864d03067b360601dd2928046f28e1b2586"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Y7WTMR2FU4UZYGWOBIFS2U3DNB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhanced Recursive Reed-Muller Erasure Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Soro, Jerome Lacan, Mathieu Cunche, Valentin Savin, Vincent Roca","submitted_at":"2016-01-26T07:13:00Z","abstract_excerpt":"Recent work have shown that Reed-Muller (RM) codes achieve the erasure channel capacity. However, this performance is obtained with maximum-likelihood decoding which can be costly for practical applications. In this paper, we propose an encoding/decoding scheme for Reed-Muller codes on the packet erasure channel based on Plotkin construction. We present several improvements over the generic decoding. They allow, for a light cost, to compete with maximum-likelihood decoding performance, especially on high-rate codes, while significantly outperforming it in terms of speed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06908","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:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5xzE9OjCGvdxsKooAI84GfkU4+leiq9OkbPQi3MESvYCjQTuTtba2hQU8h5pk3DfPxt+Nx5Ts1Qz5cmEqKvKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:20:52.184284Z"},"content_sha256":"06f68f5ec3c3d1ad39c738160bbe360ba703c107cfd041d54e76f9f95938349d","schema_version":"1.0","event_id":"sha256:06f68f5ec3c3d1ad39c738160bbe360ba703c107cfd041d54e76f9f95938349d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y7WTMR2FU4UZYGWOBIFS2U3DNB/bundle.json","state_url":"https://pith.science/pith/Y7WTMR2FU4UZYGWOBIFS2U3DNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y7WTMR2FU4UZYGWOBIFS2U3DNB/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-26T21:20:52Z","links":{"resolver":"https://pith.science/pith/Y7WTMR2FU4UZYGWOBIFS2U3DNB","bundle":"https://pith.science/pith/Y7WTMR2FU4UZYGWOBIFS2U3DNB/bundle.json","state":"https://pith.science/pith/Y7WTMR2FU4UZYGWOBIFS2U3DNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y7WTMR2FU4UZYGWOBIFS2U3DNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Y7WTMR2FU4UZYGWOBIFS2U3DNB","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":"41203b0ea27960181560f060a5084607d8ac5fdaea818e21efc379a143fb48ec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T07:13:00Z","title_canon_sha256":"d5b9ca771b0e61c0fe8d748d83a5a5d32f32004fb17910ab25dd00e668c52de7"},"schema_version":"1.0","source":{"id":"1601.06908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06908","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06908v1","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06908","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"Y7WTMR2FU4UZ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Y7WTMR2FU4UZYGWO","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Y7WTMR2F","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:06f68f5ec3c3d1ad39c738160bbe360ba703c107cfd041d54e76f9f95938349d","target":"graph","created_at":"2026-05-18T01:21:59Z","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":"Recent work have shown that Reed-Muller (RM) codes achieve the erasure channel capacity. However, this performance is obtained with maximum-likelihood decoding which can be costly for practical applications. In this paper, we propose an encoding/decoding scheme for Reed-Muller codes on the packet erasure channel based on Plotkin construction. We present several improvements over the generic decoding. They allow, for a light cost, to compete with maximum-likelihood decoding performance, especially on high-rate codes, while significantly outperforming it in terms of speed.","authors_text":"Alexandre Soro, Jerome Lacan, Mathieu Cunche, Valentin Savin, Vincent Roca","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T07:13:00Z","title":"Enhanced Recursive Reed-Muller Erasure Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06908","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:448d614450acc9787605f75afb630864d03067b360601dd2928046f28e1b2586","target":"record","created_at":"2026-05-18T01:21:59Z","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":"41203b0ea27960181560f060a5084607d8ac5fdaea818e21efc379a143fb48ec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T07:13:00Z","title_canon_sha256":"d5b9ca771b0e61c0fe8d748d83a5a5d32f32004fb17910ab25dd00e668c52de7"},"schema_version":"1.0","source":{"id":"1601.06908","kind":"arxiv","version":1}},"canonical_sha256":"c7ed364745a7299c1ace0a0b2d5363685149f76875b87bad5a05db2c9f33060d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7ed364745a7299c1ace0a0b2d5363685149f76875b87bad5a05db2c9f33060d","first_computed_at":"2026-05-18T01:21:59.551090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:59.551090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k6c97tkaqKVnmyBvskamdr88IhJB8lPTk47vIa4vjAAxUbOzI9/OlcgVg3wXARQjOzBGLvzze3XCEhYdnNyECg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:59.551684Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:448d614450acc9787605f75afb630864d03067b360601dd2928046f28e1b2586","sha256:06f68f5ec3c3d1ad39c738160bbe360ba703c107cfd041d54e76f9f95938349d"],"state_sha256":"cf4831dfd8f6a9aa2e73f0f438fd475c027c500637a26a102a85c74657265b40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYYI+NXQRADidjW92fTa+rrE6ePmjRj/g7cFOoWltVA/uP44OkDD4PnMu+jLd4zY+OqA1ZkZYmax4Pix5M7oAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:20:52.186487Z","bundle_sha256":"f129f93c4532418d917be394eb12d8b8bc3b903606ae54f9de96bc923ac55b85"}}