{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HE2FG5E23VVE4X2W32KZAWNCRW","short_pith_number":"pith:HE2FG5E2","schema_version":"1.0","canonical_sha256":"393453749add6a4e5f56de959059a28da53f836ae22d026aefbc58bdfa9bb65f","source":{"kind":"arxiv","id":"1511.07488","version":1},"attestation_state":"computed","paper":{"title":"Decoding Reed-Muller codes over product sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"cs.CC","authors_text":"John Kim, Swastik Kopparty","submitted_at":"2015-11-23T22:11:19Z","abstract_excerpt":"We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can achieve this only if the set $S$ has some very special algebraic structure, or if the degree $d$ is significantly smaller than $|S|$. We also give a near-linear time randomized algorithm, which is based on tools from list-decoding, to decode these codes from nearly half their minimum distance, provided $d < (1-\\epsilon)|S|$ for constant $\\epsilon > 0$.\n  Ou"},"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":"1511.07488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-23T22:11:19Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"129ed47d1673bbdd593f6737b8284c6eb6e1ef45924d4d7d16e61cb0c6a6058b","abstract_canon_sha256":"0e03416031e488e303ffd90392c7a7086c4cb2fd27dbb570d1ee2e8a9eec9c0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:04.664791Z","signature_b64":"587x+hMCxEM+TUuHFuz2+B2hajT/zIyIH4LxKjSL8K3Gq5I7B36gRr7kG+v/SqWcO4LzbmselqTrcbsYIiEbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"393453749add6a4e5f56de959059a28da53f836ae22d026aefbc58bdfa9bb65f","last_reissued_at":"2026-05-18T01:26:04.664328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:04.664328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding Reed-Muller codes over product sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"cs.CC","authors_text":"John Kim, Swastik Kopparty","submitted_at":"2015-11-23T22:11:19Z","abstract_excerpt":"We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can achieve this only if the set $S$ has some very special algebraic structure, or if the degree $d$ is significantly smaller than $|S|$. We also give a near-linear time randomized algorithm, which is based on tools from list-decoding, to decode these codes from nearly half their minimum distance, provided $d < (1-\\epsilon)|S|$ for constant $\\epsilon > 0$.\n  Ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07488","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":"1511.07488","created_at":"2026-05-18T01:26:04.664403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07488v1","created_at":"2026-05-18T01:26:04.664403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07488","created_at":"2026-05-18T01:26:04.664403+00:00"},{"alias_kind":"pith_short_12","alias_value":"HE2FG5E23VVE","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HE2FG5E23VVE4X2W","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HE2FG5E2","created_at":"2026-05-18T12:29:25.134429+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/HE2FG5E23VVE4X2W32KZAWNCRW","json":"https://pith.science/pith/HE2FG5E23VVE4X2W32KZAWNCRW.json","graph_json":"https://pith.science/api/pith-number/HE2FG5E23VVE4X2W32KZAWNCRW/graph.json","events_json":"https://pith.science/api/pith-number/HE2FG5E23VVE4X2W32KZAWNCRW/events.json","paper":"https://pith.science/paper/HE2FG5E2"},"agent_actions":{"view_html":"https://pith.science/pith/HE2FG5E23VVE4X2W32KZAWNCRW","download_json":"https://pith.science/pith/HE2FG5E23VVE4X2W32KZAWNCRW.json","view_paper":"https://pith.science/paper/HE2FG5E2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07488&json=true","fetch_graph":"https://pith.science/api/pith-number/HE2FG5E23VVE4X2W32KZAWNCRW/graph.json","fetch_events":"https://pith.science/api/pith-number/HE2FG5E23VVE4X2W32KZAWNCRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HE2FG5E23VVE4X2W32KZAWNCRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HE2FG5E23VVE4X2W32KZAWNCRW/action/storage_attestation","attest_author":"https://pith.science/pith/HE2FG5E23VVE4X2W32KZAWNCRW/action/author_attestation","sign_citation":"https://pith.science/pith/HE2FG5E23VVE4X2W32KZAWNCRW/action/citation_signature","submit_replication":"https://pith.science/pith/HE2FG5E23VVE4X2W32KZAWNCRW/action/replication_record"}},"created_at":"2026-05-18T01:26:04.664403+00:00","updated_at":"2026-05-18T01:26:04.664403+00:00"}