{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3GRIUHD4XGX4I32KBJZF6OYB2W","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":"d1d5c154f2032481b39fb35b8a55a8a5abb177d425f8c7d0692c067e0862eddf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T23:29:23Z","title_canon_sha256":"7ee52e1061159c39dedf378d26920388ebbceb3c2686b7b4d3096c214a239846"},"schema_version":"1.0","source":{"id":"1703.05306","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05306","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05306v1","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05306","created_at":"2026-05-18T00:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"3GRIUHD4XGX4","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3GRIUHD4XGX4I32K","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3GRIUHD4","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:69db7e4d66ad4728d70b758884057f66f96aba671c8ae6f936281fa2710923e7","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":"Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\\log n$ and corrects most error patterns of weight up to $n(1/2-\\varepsilon)$ given that $\\varepsilon$ exceeds $n^{-1/2^{r}}.$ This improves the asymptotic bounds known for decoding RM codes with nonexponential complexity.","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-14T23:29:23Z","title":"Recursive Decoding and Its Performance for Low-Rate Reed-Muller Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05306","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:63dddddb1a2feef52cab695a491c538f75ec1baf9d184e67a4ecdff8f9439dda","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":"d1d5c154f2032481b39fb35b8a55a8a5abb177d425f8c7d0692c067e0862eddf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T23:29:23Z","title_canon_sha256":"7ee52e1061159c39dedf378d26920388ebbceb3c2686b7b4d3096c214a239846"},"schema_version":"1.0","source":{"id":"1703.05306","kind":"arxiv","version":1}},"canonical_sha256":"d9a28a1c7cb9afc46f4a0a725f3b01d5b37d4956e6a485db751f38c1e8142f3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9a28a1c7cb9afc46f4a0a725f3b01d5b37d4956e6a485db751f38c1e8142f3d","first_computed_at":"2026-05-18T00:48:34.614729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:34.614729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M/VN+1xbLRfTtInICc8fgukCrAgv01ODs6BlytW9k6PwacN9fuZjZ+4F873VHeFd6H6iI8uAZw0OSZLPDc68Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:34.615285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05306","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63dddddb1a2feef52cab695a491c538f75ec1baf9d184e67a4ecdff8f9439dda","sha256:69db7e4d66ad4728d70b758884057f66f96aba671c8ae6f936281fa2710923e7"],"state_sha256":"6218976047afbde5ebd8dc607fe26f3011c93fecfcf1a308d1229154b4ff1db1"}