{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SM7L7YT6VC6ILBZEITBUVPLO7Y","short_pith_number":"pith:SM7L7YT6","canonical_record":{"source":{"id":"1703.05303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:25:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b840ff8d28ad44ebae3fc26854e129593d6120724d52504e07dbd83fef3bed6e","abstract_canon_sha256":"3f7ebb3812628066854ca78a973d3e58394561db47d91580c06f9252dd4fef71"},"schema_version":"1.0"},"canonical_sha256":"933ebfe27ea8bc85872444c34abd6efe10e3f11ab5ede2be3c65f150909d28a3","source":{"kind":"arxiv","id":"1703.05303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05303","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05303v1","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05303","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"SM7L7YT6VC6I","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SM7L7YT6VC6ILBZE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SM7L7YT6","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SM7L7YT6VC6ILBZEITBUVPLO7Y","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:25:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b840ff8d28ad44ebae3fc26854e129593d6120724d52504e07dbd83fef3bed6e","abstract_canon_sha256":"3f7ebb3812628066854ca78a973d3e58394561db47d91580c06f9252dd4fef71"},"schema_version":"1.0"},"canonical_sha256":"933ebfe27ea8bc85872444c34abd6efe10e3f11ab5ede2be3c65f150909d28a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:34.637277Z","signature_b64":"00gA3YTbcpSQHE5HMvez4ApQ2NXTnbez/mWxMEn+zbEuz+9cZLvjMKwULgJCdngYWqv8CLZr44mA9vH1+eFxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"933ebfe27ea8bc85872444c34abd6efe10e3f11ab5ede2be3c65f150909d28a3","last_reissued_at":"2026-05-18T00:48:34.636677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:34.636677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05303","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-18T00:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71G/not+xPcRzziYysLtyVSTGxXM/Y3zye+bSlHktQOmDSQwe5hayFnD6b9YKQ9jFjVECtz0VqHNxoSp+8ZDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:40:23.885764Z"},"content_sha256":"b37eabec4fb9902167031dab838a7e6a2fbf0a01f70293d2ae4c0f946cee8cd3","schema_version":"1.0","event_id":"sha256:b37eabec4fb9902167031dab838a7e6a2fbf0a01f70293d2ae4c0f946cee8cd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SM7L7YT6VC6ILBZEITBUVPLO7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive decoding of Reed-Muller codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ilya Dumer","submitted_at":"2017-03-14T22:25:18Z","abstract_excerpt":"New soft- and hard decision decoding algorithms are presented for general Reed-Muller codes $\\left\\{\\genfrac{}{}{0pt}{}{m}{r}\\right\\} $ of length $2^{m}$ and distance $2^{m-r}$. We use Plotkin $(u,u+v)$ construction and decompose code $\\left\\{\\genfrac{}{}{0pt}{}{m}{r}\\right\\} $ onto subblocks $u\\in\\left\\{\\genfrac{}{}{0pt}{}{m-1}{r}\\right\\} $ and $v\\in\\left\\{\\genfrac{}{}{0pt}{}{m-1}{r-1}\\right\\} .$ In decoding, we first try to find a subblock $v$ from the better protected code and then proceed with the block $u$. The likelihoods of the received symbols are recalculated in a way similar to belie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05303","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-18T00:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nbIoHI/jsm4IhHqwM85PwqEVlpheJtmHj6Ct84hLTmHx6kNPlhosJPkKedbDXtF84vFbWTK/g16EuvXC4lAECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:40:23.886144Z"},"content_sha256":"b0d8b518f143d17d7d3ba08950af2945e42e078177568b741a77f2e8c94c961b","schema_version":"1.0","event_id":"sha256:b0d8b518f143d17d7d3ba08950af2945e42e078177568b741a77f2e8c94c961b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SM7L7YT6VC6ILBZEITBUVPLO7Y/bundle.json","state_url":"https://pith.science/pith/SM7L7YT6VC6ILBZEITBUVPLO7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SM7L7YT6VC6ILBZEITBUVPLO7Y/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-06-11T19:40:23Z","links":{"resolver":"https://pith.science/pith/SM7L7YT6VC6ILBZEITBUVPLO7Y","bundle":"https://pith.science/pith/SM7L7YT6VC6ILBZEITBUVPLO7Y/bundle.json","state":"https://pith.science/pith/SM7L7YT6VC6ILBZEITBUVPLO7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SM7L7YT6VC6ILBZEITBUVPLO7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SM7L7YT6VC6ILBZEITBUVPLO7Y","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":"3f7ebb3812628066854ca78a973d3e58394561db47d91580c06f9252dd4fef71","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:25:18Z","title_canon_sha256":"b840ff8d28ad44ebae3fc26854e129593d6120724d52504e07dbd83fef3bed6e"},"schema_version":"1.0","source":{"id":"1703.05303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05303","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05303v1","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05303","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"SM7L7YT6VC6I","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SM7L7YT6VC6ILBZE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SM7L7YT6","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:b0d8b518f143d17d7d3ba08950af2945e42e078177568b741a77f2e8c94c961b","target":"graph","created_at":"2026-05-18T00:48:34Z","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":"New soft- and hard decision decoding algorithms are presented for general Reed-Muller codes $\\left\\{\\genfrac{}{}{0pt}{}{m}{r}\\right\\} $ of length $2^{m}$ and distance $2^{m-r}$. We use Plotkin $(u,u+v)$ construction and decompose code $\\left\\{\\genfrac{}{}{0pt}{}{m}{r}\\right\\} $ onto subblocks $u\\in\\left\\{\\genfrac{}{}{0pt}{}{m-1}{r}\\right\\} $ and $v\\in\\left\\{\\genfrac{}{}{0pt}{}{m-1}{r-1}\\right\\} .$ In decoding, we first try to find a subblock $v$ from the better protected code and then proceed with the block $u$. The likelihoods of the received symbols are recalculated in a way similar to belie","authors_text":"Ilya Dumer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:25:18Z","title":"Recursive decoding of Reed-Muller codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05303","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:b37eabec4fb9902167031dab838a7e6a2fbf0a01f70293d2ae4c0f946cee8cd3","target":"record","created_at":"2026-05-18T00:48:34Z","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":"3f7ebb3812628066854ca78a973d3e58394561db47d91580c06f9252dd4fef71","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:25:18Z","title_canon_sha256":"b840ff8d28ad44ebae3fc26854e129593d6120724d52504e07dbd83fef3bed6e"},"schema_version":"1.0","source":{"id":"1703.05303","kind":"arxiv","version":1}},"canonical_sha256":"933ebfe27ea8bc85872444c34abd6efe10e3f11ab5ede2be3c65f150909d28a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"933ebfe27ea8bc85872444c34abd6efe10e3f11ab5ede2be3c65f150909d28a3","first_computed_at":"2026-05-18T00:48:34.636677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:34.636677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"00gA3YTbcpSQHE5HMvez4ApQ2NXTnbez/mWxMEn+zbEuz+9cZLvjMKwULgJCdngYWqv8CLZr44mA9vH1+eFxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:34.637277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b37eabec4fb9902167031dab838a7e6a2fbf0a01f70293d2ae4c0f946cee8cd3","sha256:b0d8b518f143d17d7d3ba08950af2945e42e078177568b741a77f2e8c94c961b"],"state_sha256":"99a7a48cbf929c286f11ba24c5698b34bd1fa80a86ceb19971f55dc791c6ecae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYwK/D9oeeqNFrOwz6Qw2ZmHChMwO5m25LnvmkzQ8xicr3GInA82BDvqbtgnqn2mb6AymeEwdAQebII8ZJ44DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T19:40:23.888380Z","bundle_sha256":"dc64c5a39ff46bcc4ad6b0b8580c0ae6a648a8db2e97b3d36fe091dcf8c39e35"}}