{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6KLCOVC63CSKDFGILCDSYSLLSO","short_pith_number":"pith:6KLCOVC6","canonical_record":{"source":{"id":"1407.3433","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-13T05:47:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fbf649a4236d215016f2fa557a39599685620458dd1f516f2a223bc03fa8cf01","abstract_canon_sha256":"c6a7c4850dc41d982ece40c2031aa182f7e2ddac646ece01259ea5686b4ae4c8"},"schema_version":"1.0"},"canonical_sha256":"f29627545ed8a4a194c858872c496b938d4364233ab1f012e9b5cac102035036","source":{"kind":"arxiv","id":"1407.3433","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3433","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3433v2","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3433","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"pith_short_12","alias_value":"6KLCOVC63CSK","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6KLCOVC63CSKDFGI","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6KLCOVC6","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6KLCOVC63CSKDFGILCDSYSLLSO","target":"record","payload":{"canonical_record":{"source":{"id":"1407.3433","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-13T05:47:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fbf649a4236d215016f2fa557a39599685620458dd1f516f2a223bc03fa8cf01","abstract_canon_sha256":"c6a7c4850dc41d982ece40c2031aa182f7e2ddac646ece01259ea5686b4ae4c8"},"schema_version":"1.0"},"canonical_sha256":"f29627545ed8a4a194c858872c496b938d4364233ab1f012e9b5cac102035036","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:23.912499Z","signature_b64":"LyHjDt8QjfREHX5JUEvhIiaXbppoJI6Ub9M51NMkVIFMhtFmH5eYzOuYLP83plv4nTY32VpkIDv1zrE+NzraBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f29627545ed8a4a194c858872c496b938d4364233ab1f012e9b5cac102035036","last_reissued_at":"2026-05-18T02:47:23.912111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:23.912111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.3433","source_version":2,"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-18T02:47:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIPAOliETb328ccM4L440gTM5SgUdlq64Q21ZXZF3H8xwhV5pCajYmIg1MwTdUkxr1j5EJqucuWJkao0ZEo6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:27:24.689218Z"},"content_sha256":"c2a15af3458cd5a9b7b9d415139c14ef16d1d9fcd78567da7f2df476576a3653","schema_version":"1.0","event_id":"sha256:c2a15af3458cd5a9b7b9d415139c14ef16d1d9fcd78567da7f2df476576a3653"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6KLCOVC63CSKDFGILCDSYSLLSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List decoding Reed-Muller codes over small fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Abhishek Bhowmick, Shachar Lovett","submitted_at":"2014-07-13T05:47:07Z","abstract_excerpt":"The list decoding problem for a code asks for the maximal radius up to which any ball of that radius contains only a constant number of codewords. The list decoding radius is not well understood even for well studied codes, like Reed-Solomon or Reed-Muller codes.\n  Fix a finite field $\\mathbb{F}$. The Reed-Muller code $\\mathrm{RM}_{\\mathbb{F}}(n,d)$ is defined by $n$-variate degree-$d$ polynomials over $\\mathbb{F}$. In this work, we study the list decoding radius of Reed-Muller codes over a constant prime field $\\mathbb{F}=\\mathbb{F}_p$, constant degree $d$ and large $n$. We show that the list"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3433","kind":"arxiv","version":2},"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-18T02:47:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMkCM+hayWQmKGOguFKV1F7q8qWLNPv0Gjfsv9oLUmDUM9p9PwDlTOgOUoeJlJtoSy9dr9jHOYvxVWop12zkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:27:24.689736Z"},"content_sha256":"4a723a844e32530b939fc97ea9d055fb41be1161b5c22d2818716535f78146ea","schema_version":"1.0","event_id":"sha256:4a723a844e32530b939fc97ea9d055fb41be1161b5c22d2818716535f78146ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KLCOVC63CSKDFGILCDSYSLLSO/bundle.json","state_url":"https://pith.science/pith/6KLCOVC63CSKDFGILCDSYSLLSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KLCOVC63CSKDFGILCDSYSLLSO/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-05-27T15:27:24Z","links":{"resolver":"https://pith.science/pith/6KLCOVC63CSKDFGILCDSYSLLSO","bundle":"https://pith.science/pith/6KLCOVC63CSKDFGILCDSYSLLSO/bundle.json","state":"https://pith.science/pith/6KLCOVC63CSKDFGILCDSYSLLSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KLCOVC63CSKDFGILCDSYSLLSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6KLCOVC63CSKDFGILCDSYSLLSO","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":"c6a7c4850dc41d982ece40c2031aa182f7e2ddac646ece01259ea5686b4ae4c8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-13T05:47:07Z","title_canon_sha256":"fbf649a4236d215016f2fa557a39599685620458dd1f516f2a223bc03fa8cf01"},"schema_version":"1.0","source":{"id":"1407.3433","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3433","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3433v2","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3433","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"pith_short_12","alias_value":"6KLCOVC63CSK","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6KLCOVC63CSKDFGI","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6KLCOVC6","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:4a723a844e32530b939fc97ea9d055fb41be1161b5c22d2818716535f78146ea","target":"graph","created_at":"2026-05-18T02:47:23Z","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":"The list decoding problem for a code asks for the maximal radius up to which any ball of that radius contains only a constant number of codewords. The list decoding radius is not well understood even for well studied codes, like Reed-Solomon or Reed-Muller codes.\n  Fix a finite field $\\mathbb{F}$. The Reed-Muller code $\\mathrm{RM}_{\\mathbb{F}}(n,d)$ is defined by $n$-variate degree-$d$ polynomials over $\\mathbb{F}$. In this work, we study the list decoding radius of Reed-Muller codes over a constant prime field $\\mathbb{F}=\\mathbb{F}_p$, constant degree $d$ and large $n$. We show that the list","authors_text":"Abhishek Bhowmick, Shachar Lovett","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-13T05:47:07Z","title":"List decoding Reed-Muller codes over small fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3433","kind":"arxiv","version":2},"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:c2a15af3458cd5a9b7b9d415139c14ef16d1d9fcd78567da7f2df476576a3653","target":"record","created_at":"2026-05-18T02:47:23Z","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":"c6a7c4850dc41d982ece40c2031aa182f7e2ddac646ece01259ea5686b4ae4c8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-13T05:47:07Z","title_canon_sha256":"fbf649a4236d215016f2fa557a39599685620458dd1f516f2a223bc03fa8cf01"},"schema_version":"1.0","source":{"id":"1407.3433","kind":"arxiv","version":2}},"canonical_sha256":"f29627545ed8a4a194c858872c496b938d4364233ab1f012e9b5cac102035036","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f29627545ed8a4a194c858872c496b938d4364233ab1f012e9b5cac102035036","first_computed_at":"2026-05-18T02:47:23.912111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:23.912111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LyHjDt8QjfREHX5JUEvhIiaXbppoJI6Ub9M51NMkVIFMhtFmH5eYzOuYLP83plv4nTY32VpkIDv1zrE+NzraBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:23.912499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3433","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2a15af3458cd5a9b7b9d415139c14ef16d1d9fcd78567da7f2df476576a3653","sha256:4a723a844e32530b939fc97ea9d055fb41be1161b5c22d2818716535f78146ea"],"state_sha256":"34d2e171c6a97e508e2179c85ace3c92c80744f0d9da3383676488107295a7c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3dvcv8EiNUNSMaex4BtSsjhq+d3fRPkKlRIOzoymw8ykaAj0FDPkK32FDCvSxL+rNWxMfCwrnXIvSqciwdTtCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:27:24.693369Z","bundle_sha256":"82fc5b2f9ccfdca58c760ef276ac53e24045c189435d2cbfe3de964c8025a703"}}