{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3GRIUHD4XGX4I32KBJZF6OYB2W","short_pith_number":"pith:3GRIUHD4","schema_version":"1.0","canonical_sha256":"d9a28a1c7cb9afc46f4a0a725f3b01d5b37d4956e6a485db751f38c1e8142f3d","source":{"kind":"arxiv","id":"1703.05306","version":1},"attestation_state":"computed","paper":{"title":"Recursive Decoding and Its Performance for Low-Rate 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-14T23:29:23Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1703.05306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T23:29:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ee52e1061159c39dedf378d26920388ebbceb3c2686b7b4d3096c214a239846","abstract_canon_sha256":"d1d5c154f2032481b39fb35b8a55a8a5abb177d425f8c7d0692c067e0862eddf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:34.615285Z","signature_b64":"M/VN+1xbLRfTtInICc8fgukCrAgv01ODs6BlytW9k6PwacN9fuZjZ+4F873VHeFd6H6iI8uAZw0OSZLPDc68Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9a28a1c7cb9afc46f4a0a725f3b01d5b37d4956e6a485db751f38c1e8142f3d","last_reissued_at":"2026-05-18T00:48:34.614729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:34.614729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Decoding and Its Performance for Low-Rate 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-14T23:29:23Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05306","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.05306","created_at":"2026-05-18T00:48:34.614796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05306v1","created_at":"2026-05-18T00:48:34.614796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05306","created_at":"2026-05-18T00:48:34.614796+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GRIUHD4XGX4","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GRIUHD4XGX4I32K","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GRIUHD4","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3GRIUHD4XGX4I32KBJZF6OYB2W","json":"https://pith.science/pith/3GRIUHD4XGX4I32KBJZF6OYB2W.json","graph_json":"https://pith.science/api/pith-number/3GRIUHD4XGX4I32KBJZF6OYB2W/graph.json","events_json":"https://pith.science/api/pith-number/3GRIUHD4XGX4I32KBJZF6OYB2W/events.json","paper":"https://pith.science/paper/3GRIUHD4"},"agent_actions":{"view_html":"https://pith.science/pith/3GRIUHD4XGX4I32KBJZF6OYB2W","download_json":"https://pith.science/pith/3GRIUHD4XGX4I32KBJZF6OYB2W.json","view_paper":"https://pith.science/paper/3GRIUHD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05306&json=true","fetch_graph":"https://pith.science/api/pith-number/3GRIUHD4XGX4I32KBJZF6OYB2W/graph.json","fetch_events":"https://pith.science/api/pith-number/3GRIUHD4XGX4I32KBJZF6OYB2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GRIUHD4XGX4I32KBJZF6OYB2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GRIUHD4XGX4I32KBJZF6OYB2W/action/storage_attestation","attest_author":"https://pith.science/pith/3GRIUHD4XGX4I32KBJZF6OYB2W/action/author_attestation","sign_citation":"https://pith.science/pith/3GRIUHD4XGX4I32KBJZF6OYB2W/action/citation_signature","submit_replication":"https://pith.science/pith/3GRIUHD4XGX4I32KBJZF6OYB2W/action/replication_record"}},"created_at":"2026-05-18T00:48:34.614796+00:00","updated_at":"2026-05-18T00:48:34.614796+00:00"}