{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2R4F6NOAQNRSSLZZS2ECNAOYVK","short_pith_number":"pith:2R4F6NOA","schema_version":"1.0","canonical_sha256":"d4785f35c08363292f3996882681d8aaab9ba493e5a9c6265b953476c4600e77","source":{"kind":"arxiv","id":"1708.03257","version":1},"attestation_state":"computed","paper":{"title":"Robust polynomial regression up to the information theoretic limit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Daniel Kane, Eric Price, Sushrut Karmalkar","submitted_at":"2017-08-10T15:31:02Z","abstract_excerpt":"We consider the problem of robust polynomial regression, where one receives samples $(x_i, y_i)$ that are usually within $\\sigma$ of a polynomial $y = p(x)$, but have a $\\rho$ chance of being arbitrary adversarial outliers. Previously, it was known how to efficiently estimate $p$ only when $\\rho < \\frac{1}{\\log d}$. We give an algorithm that works for the entire feasible range of $\\rho < 1/2$, while simultaneously improving other parameters of the problem. We complement our algorithm, which gives a factor 2 approximation, with impossibility results that show, for example, that a $1.09$ approxi"},"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":"1708.03257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-10T15:31:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"dae1c5079ec7146277b8bffc101712d7082d915e62552afb55dde9a72a23b1f4","abstract_canon_sha256":"5e2b0c4a9616d98dfaf26d191020713263a0db930c7c235bf1245a20bde8ddaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:14.328616Z","signature_b64":"LHBJUyGjhH02Ot7hCIRE5TrCdXynGV0kileSYneyqrVjusu+PB0+U1Qn3heh9zf2gHOnGM6OMJvAxgDb0ZFLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4785f35c08363292f3996882681d8aaab9ba493e5a9c6265b953476c4600e77","last_reissued_at":"2026-05-18T00:38:14.327964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:14.327964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust polynomial regression up to the information theoretic limit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Daniel Kane, Eric Price, Sushrut Karmalkar","submitted_at":"2017-08-10T15:31:02Z","abstract_excerpt":"We consider the problem of robust polynomial regression, where one receives samples $(x_i, y_i)$ that are usually within $\\sigma$ of a polynomial $y = p(x)$, but have a $\\rho$ chance of being arbitrary adversarial outliers. Previously, it was known how to efficiently estimate $p$ only when $\\rho < \\frac{1}{\\log d}$. We give an algorithm that works for the entire feasible range of $\\rho < 1/2$, while simultaneously improving other parameters of the problem. We complement our algorithm, which gives a factor 2 approximation, with impossibility results that show, for example, that a $1.09$ approxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03257","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":"1708.03257","created_at":"2026-05-18T00:38:14.328055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.03257v1","created_at":"2026-05-18T00:38:14.328055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03257","created_at":"2026-05-18T00:38:14.328055+00:00"},{"alias_kind":"pith_short_12","alias_value":"2R4F6NOAQNRS","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2R4F6NOAQNRSSLZZ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2R4F6NOA","created_at":"2026-05-18T12:30:55.937587+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/2R4F6NOAQNRSSLZZS2ECNAOYVK","json":"https://pith.science/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK.json","graph_json":"https://pith.science/api/pith-number/2R4F6NOAQNRSSLZZS2ECNAOYVK/graph.json","events_json":"https://pith.science/api/pith-number/2R4F6NOAQNRSSLZZS2ECNAOYVK/events.json","paper":"https://pith.science/paper/2R4F6NOA"},"agent_actions":{"view_html":"https://pith.science/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK","download_json":"https://pith.science/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK.json","view_paper":"https://pith.science/paper/2R4F6NOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.03257&json=true","fetch_graph":"https://pith.science/api/pith-number/2R4F6NOAQNRSSLZZS2ECNAOYVK/graph.json","fetch_events":"https://pith.science/api/pith-number/2R4F6NOAQNRSSLZZS2ECNAOYVK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK/action/storage_attestation","attest_author":"https://pith.science/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK/action/author_attestation","sign_citation":"https://pith.science/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK/action/citation_signature","submit_replication":"https://pith.science/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK/action/replication_record"}},"created_at":"2026-05-18T00:38:14.328055+00:00","updated_at":"2026-05-18T00:38:14.328055+00:00"}