{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UB5EBGKTXNEYY5XSSXZMHQ7JDI","short_pith_number":"pith:UB5EBGKT","schema_version":"1.0","canonical_sha256":"a07a409953bb498c76f295f2c3c3e91a28f0c2a4c959bccbecef51797a292dcd","source":{"kind":"arxiv","id":"1611.03069","version":1},"attestation_state":"computed","paper":{"title":"NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Badih Ghazi, Elena Grigorescu, Venkata Gandikota","submitted_at":"2016-11-09T20:15:55Z","abstract_excerpt":"Establishing the complexity of {\\em Bounded Distance Decoding} for Reed-Solomon codes is a fundamental open problem in coding theory, explicitly asked by Guruswami and Vardy (IEEE Trans. Inf. Theory, 2005). The problem is motivated by the large current gap between the regime when it is NP-hard, and the regime when it is efficiently solvable (i.e., the Johnson radius).\n  We show the first NP-hardness results for asymptotically smaller decoding radii than the maximum likelihood decoding radius of Guruswami and Vardy. Specifically, for Reed-Solomon codes of length $N$ and dimension $K=O(N)$, we s"},"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":"1611.03069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-09T20:15:55Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"07715bfb8eaa1d6fe9b7fff245c2ffbd45e71e85d1850b763f5c7d972b60eb48","abstract_canon_sha256":"33ee58373634fe0d3eaea7481a564ade6c92358796de5f4bdcbca1e022c100d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:42.681779Z","signature_b64":"AxU67Gc2MYlJHmT0/q+ldW1xiG6H76SnVxrQ9OTQt8/AXkULD+GIim0sFfE0eU1tgc76S+JDGM4mwELc1FpdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a07a409953bb498c76f295f2c3c3e91a28f0c2a4c959bccbecef51797a292dcd","last_reissued_at":"2026-05-18T00:59:42.681089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:42.681089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Badih Ghazi, Elena Grigorescu, Venkata Gandikota","submitted_at":"2016-11-09T20:15:55Z","abstract_excerpt":"Establishing the complexity of {\\em Bounded Distance Decoding} for Reed-Solomon codes is a fundamental open problem in coding theory, explicitly asked by Guruswami and Vardy (IEEE Trans. Inf. Theory, 2005). The problem is motivated by the large current gap between the regime when it is NP-hard, and the regime when it is efficiently solvable (i.e., the Johnson radius).\n  We show the first NP-hardness results for asymptotically smaller decoding radii than the maximum likelihood decoding radius of Guruswami and Vardy. Specifically, for Reed-Solomon codes of length $N$ and dimension $K=O(N)$, we s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03069","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":"1611.03069","created_at":"2026-05-18T00:59:42.681189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.03069v1","created_at":"2026-05-18T00:59:42.681189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03069","created_at":"2026-05-18T00:59:42.681189+00:00"},{"alias_kind":"pith_short_12","alias_value":"UB5EBGKTXNEY","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UB5EBGKTXNEYY5XS","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UB5EBGKT","created_at":"2026-05-18T12:30:46.583412+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/UB5EBGKTXNEYY5XSSXZMHQ7JDI","json":"https://pith.science/pith/UB5EBGKTXNEYY5XSSXZMHQ7JDI.json","graph_json":"https://pith.science/api/pith-number/UB5EBGKTXNEYY5XSSXZMHQ7JDI/graph.json","events_json":"https://pith.science/api/pith-number/UB5EBGKTXNEYY5XSSXZMHQ7JDI/events.json","paper":"https://pith.science/paper/UB5EBGKT"},"agent_actions":{"view_html":"https://pith.science/pith/UB5EBGKTXNEYY5XSSXZMHQ7JDI","download_json":"https://pith.science/pith/UB5EBGKTXNEYY5XSSXZMHQ7JDI.json","view_paper":"https://pith.science/paper/UB5EBGKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.03069&json=true","fetch_graph":"https://pith.science/api/pith-number/UB5EBGKTXNEYY5XSSXZMHQ7JDI/graph.json","fetch_events":"https://pith.science/api/pith-number/UB5EBGKTXNEYY5XSSXZMHQ7JDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UB5EBGKTXNEYY5XSSXZMHQ7JDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UB5EBGKTXNEYY5XSSXZMHQ7JDI/action/storage_attestation","attest_author":"https://pith.science/pith/UB5EBGKTXNEYY5XSSXZMHQ7JDI/action/author_attestation","sign_citation":"https://pith.science/pith/UB5EBGKTXNEYY5XSSXZMHQ7JDI/action/citation_signature","submit_replication":"https://pith.science/pith/UB5EBGKTXNEYY5XSSXZMHQ7JDI/action/replication_record"}},"created_at":"2026-05-18T00:59:42.681189+00:00","updated_at":"2026-05-18T00:59:42.681189+00:00"}