{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HP3TTTTIH6XZPK5XZ4O6E6QMU6","short_pith_number":"pith:HP3TTTTI","canonical_record":{"source":{"id":"1703.05304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:31:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b2881cf1376552c8576cb3551c63ba6d2eb81998ff3fd957913d0c5429511d6c","abstract_canon_sha256":"5c4f6a21f781e0f21a47e08d58c5d067272b81f7aeffcd3a154603607ba9f2f4"},"schema_version":"1.0"},"canonical_sha256":"3bf739ce683faf97abb7cf1de27a0ca787a55fcfd1530972a20dc2e10ce2ae41","source":{"kind":"arxiv","id":"1703.05304","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05304","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05304v1","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05304","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"HP3TTTTIH6XZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HP3TTTTIH6XZPK5X","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HP3TTTTI","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HP3TTTTIH6XZPK5XZ4O6E6QMU6","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:31:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b2881cf1376552c8576cb3551c63ba6d2eb81998ff3fd957913d0c5429511d6c","abstract_canon_sha256":"5c4f6a21f781e0f21a47e08d58c5d067272b81f7aeffcd3a154603607ba9f2f4"},"schema_version":"1.0"},"canonical_sha256":"3bf739ce683faf97abb7cf1de27a0ca787a55fcfd1530972a20dc2e10ce2ae41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:34.629890Z","signature_b64":"hR3IFnjLNfOC1RmxYK6ljR+PxRGjTGOpYf6fP8/i5zxFL3HcRRncR2Sx6XOOkyRUsA4/oxNfURQmDEUBb1lRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bf739ce683faf97abb7cf1de27a0ca787a55fcfd1530972a20dc2e10ce2ae41","last_reissued_at":"2026-05-18T00:48:34.629418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:34.629418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05304","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":"0MUxlDYbOkZOgRdnKsWO+w/h/e4Iwz+myuD8VvHxdHuY4j+LcAbEtdJsonbxUOGFvXEPOql8MJYi67EeBDYkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T18:30:13.631393Z"},"content_sha256":"0eb197a95f4116c839c5125aa04526fb79ae4f6571f796b0f9d22242fcafcf40","schema_version":"1.0","event_id":"sha256:0eb197a95f4116c839c5125aa04526fb79ae4f6571f796b0f9d22242fcafcf40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HP3TTTTIH6XZPK5XZ4O6E6QMU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive List Decoding for 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, Kirill Shabunov","submitted_at":"2017-03-14T22:31:41Z","abstract_excerpt":"We consider recursive decoding for Reed-Muller (RM) codes and their subcodes. Two new recursive techniques are described. We analyze asymptotic properties of these algorithms and show that they substantially outperform other decoding algorithms with nonexponential complexity known for RM codes. Decoding performance is further enhanced by using intermediate code lists and permutation procedures. For moderate lengths up to 512, near-optimum decoding with feasible complexity is obtained."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05304","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":"FUE1RGPbPehzE/Caa7s/BCajRVEBd9iV7S7VaB67uTU4ggCNLj23a2mrB3ysN9a5tPQwVn72Tb1ypxQXFL+LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T18:30:13.632136Z"},"content_sha256":"0177d43e572723a92241c88ca82c984af3a7ac5e1836f493b657b6a0ffcd7d12","schema_version":"1.0","event_id":"sha256:0177d43e572723a92241c88ca82c984af3a7ac5e1836f493b657b6a0ffcd7d12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HP3TTTTIH6XZPK5XZ4O6E6QMU6/bundle.json","state_url":"https://pith.science/pith/HP3TTTTIH6XZPK5XZ4O6E6QMU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HP3TTTTIH6XZPK5XZ4O6E6QMU6/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-11T18:30:13Z","links":{"resolver":"https://pith.science/pith/HP3TTTTIH6XZPK5XZ4O6E6QMU6","bundle":"https://pith.science/pith/HP3TTTTIH6XZPK5XZ4O6E6QMU6/bundle.json","state":"https://pith.science/pith/HP3TTTTIH6XZPK5XZ4O6E6QMU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HP3TTTTIH6XZPK5XZ4O6E6QMU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HP3TTTTIH6XZPK5XZ4O6E6QMU6","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":"5c4f6a21f781e0f21a47e08d58c5d067272b81f7aeffcd3a154603607ba9f2f4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:31:41Z","title_canon_sha256":"b2881cf1376552c8576cb3551c63ba6d2eb81998ff3fd957913d0c5429511d6c"},"schema_version":"1.0","source":{"id":"1703.05304","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05304","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05304v1","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05304","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"HP3TTTTIH6XZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HP3TTTTIH6XZPK5X","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HP3TTTTI","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:0177d43e572723a92241c88ca82c984af3a7ac5e1836f493b657b6a0ffcd7d12","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":"We consider recursive decoding for Reed-Muller (RM) codes and their subcodes. Two new recursive techniques are described. We analyze asymptotic properties of these algorithms and show that they substantially outperform other decoding algorithms with nonexponential complexity known for RM codes. Decoding performance is further enhanced by using intermediate code lists and permutation procedures. For moderate lengths up to 512, near-optimum decoding with feasible complexity is obtained.","authors_text":"Ilya Dumer, Kirill Shabunov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:31:41Z","title":"Recursive List Decoding for Reed-Muller Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05304","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:0eb197a95f4116c839c5125aa04526fb79ae4f6571f796b0f9d22242fcafcf40","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":"5c4f6a21f781e0f21a47e08d58c5d067272b81f7aeffcd3a154603607ba9f2f4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T22:31:41Z","title_canon_sha256":"b2881cf1376552c8576cb3551c63ba6d2eb81998ff3fd957913d0c5429511d6c"},"schema_version":"1.0","source":{"id":"1703.05304","kind":"arxiv","version":1}},"canonical_sha256":"3bf739ce683faf97abb7cf1de27a0ca787a55fcfd1530972a20dc2e10ce2ae41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bf739ce683faf97abb7cf1de27a0ca787a55fcfd1530972a20dc2e10ce2ae41","first_computed_at":"2026-05-18T00:48:34.629418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:34.629418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hR3IFnjLNfOC1RmxYK6ljR+PxRGjTGOpYf6fP8/i5zxFL3HcRRncR2Sx6XOOkyRUsA4/oxNfURQmDEUBb1lRBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:34.629890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05304","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0eb197a95f4116c839c5125aa04526fb79ae4f6571f796b0f9d22242fcafcf40","sha256:0177d43e572723a92241c88ca82c984af3a7ac5e1836f493b657b6a0ffcd7d12"],"state_sha256":"f13ae8e537313e0d85ab75b8673e1c44a89569acdf77c2b009d28a088add89be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMqgX2b5gvFL1NPv2D6ooeR+r2IW9B/HNdFoxwqUFTJC/pTXCBvXNFl8BH++YxHkkHM9WmD4jf4eid10I5nhBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T18:30:13.636989Z","bundle_sha256":"68f7c6169d888836d6b84e09ecc896a62a930ae2b0cb1f34abec82bcc7bafbca"}}