{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:W366CQMV4LPQM6DD5FGT2ZIAI5","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":"11a204183421c77348459ea5fb9091a8a9dd45b0d6d709873395e759b1500a6f","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-07T09:01:41Z","title_canon_sha256":"6d77c4676612830277ca0878c465c2b40248a30baead5b158dc5c700e0aed24b"},"schema_version":"1.0","source":{"id":"1604.01925","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01925","created_at":"2026-05-17T23:46:36Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01925v4","created_at":"2026-05-17T23:46:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01925","created_at":"2026-05-17T23:46:36Z"},{"alias_kind":"pith_short_12","alias_value":"W366CQMV4LPQ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W366CQMV4LPQM6DD","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W366CQMV","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:b682c5d50dcc4437a8ada33d82d69b90bfa3523a98a22cf143f00e47d50c720d","target":"graph","created_at":"2026-05-17T23:46:36Z","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":"Reed-Muller codes are among the most important classes of locally correctable codes. Currently local decoding of Reed-Muller codes is based on decoding on lines or quadratic curves to recover one single coordinate. To recover multiple coordinates simultaneously, the naive way is to repeat the local decoding for recovery of a single coordinate. This decoding algorithm might be more expensive, i.e., require higher query complexity. In this paper, we focus on Reed-Muller codes with usual parameter regime, namely, the total degree of evaluation polynomials is $d=\\Theta({q})$, where $q$ is the code","authors_text":"Chaoping Xing, Chen Yuan, Ronald Cramer","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-07T09:01:41Z","title":"Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01925","kind":"arxiv","version":4},"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:ad6cbefcb35c49b126abf3bb180bb6774d15226ab2a028fb618e77879db379a5","target":"record","created_at":"2026-05-17T23:46:36Z","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":"11a204183421c77348459ea5fb9091a8a9dd45b0d6d709873395e759b1500a6f","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-07T09:01:41Z","title_canon_sha256":"6d77c4676612830277ca0878c465c2b40248a30baead5b158dc5c700e0aed24b"},"schema_version":"1.0","source":{"id":"1604.01925","kind":"arxiv","version":4}},"canonical_sha256":"b6fde14195e2df067863e94d3d65004769eb34b7365deb318d87c2fe9a5e7aaf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6fde14195e2df067863e94d3d65004769eb34b7365deb318d87c2fe9a5e7aaf","first_computed_at":"2026-05-17T23:46:36.625472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:36.625472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5AYHXm5Jco3NTTCKmomzLuQzCnO7ZFwhLyms/3pagWHpneu3+q/ZGmSJPEqu2bbZWpRJV6OdqRHPqRE2jUmmBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:36.626075Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01925","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad6cbefcb35c49b126abf3bb180bb6774d15226ab2a028fb618e77879db379a5","sha256:b682c5d50dcc4437a8ada33d82d69b90bfa3523a98a22cf143f00e47d50c720d"],"state_sha256":"fe9f85777a9a193f2e622ee3e1c28a2f67be661121515f49cd1dfcc0f60475bc"}