{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2R4F6NOAQNRSSLZZS2ECNAOYVK","short_pith_number":"pith:2R4F6NOA","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"},"canonical_sha256":"d4785f35c08363292f3996882681d8aaab9ba493e5a9c6265b953476c4600e77","source":{"kind":"arxiv","id":"1708.03257","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03257","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03257v1","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03257","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"pith_short_12","alias_value":"2R4F6NOAQNRS","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2R4F6NOAQNRSSLZZ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2R4F6NOA","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2R4F6NOAQNRSSLZZS2ECNAOYVK","target":"record","payload":{"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"},"canonical_sha256":"d4785f35c08363292f3996882681d8aaab9ba493e5a9c6265b953476c4600e77","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"},"source_kind":"arxiv","source_id":"1708.03257","source_version":1,"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-18T00:38:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ltTY1cYxGjuICsFI1w+mPiagFQ47LNw4/WRsYO7rc1lelm1K5upy8QbVAYfwqyVuXdR2ToBLkDNXYgw30LpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:44:05.046635Z"},"content_sha256":"1ed9500c312f2a2911da3b234cb342259e6cea1bbcc31c0535a403e8b9f6eae7","schema_version":"1.0","event_id":"sha256:1ed9500c312f2a2911da3b234cb342259e6cea1bbcc31c0535a403e8b9f6eae7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2R4F6NOAQNRSSLZZS2ECNAOYVK","target":"graph","payload":{"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"},"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-18T00:38:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4zrNpIU2vxzORJWBuTl2HF4rTiF+SalPchkghnm99hQC4VzAzvxhNDqp0C8RAx0wEfstO4tOBGwg9E+a0tRRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:44:05.047269Z"},"content_sha256":"91f96bca392c84ecfc93dd3a699a15cb2a3ff2038b4ae2dd301c99e8c308bb0e","schema_version":"1.0","event_id":"sha256:91f96bca392c84ecfc93dd3a699a15cb2a3ff2038b4ae2dd301c99e8c308bb0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK/bundle.json","state_url":"https://pith.science/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK/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-25T09:44:05Z","links":{"resolver":"https://pith.science/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK","bundle":"https://pith.science/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK/bundle.json","state":"https://pith.science/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2R4F6NOAQNRSSLZZS2ECNAOYVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2R4F6NOAQNRSSLZZS2ECNAOYVK","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":"5e2b0c4a9616d98dfaf26d191020713263a0db930c7c235bf1245a20bde8ddaf","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-10T15:31:02Z","title_canon_sha256":"dae1c5079ec7146277b8bffc101712d7082d915e62552afb55dde9a72a23b1f4"},"schema_version":"1.0","source":{"id":"1708.03257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03257","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03257v1","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03257","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"pith_short_12","alias_value":"2R4F6NOAQNRS","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2R4F6NOAQNRSSLZZ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2R4F6NOA","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:91f96bca392c84ecfc93dd3a699a15cb2a3ff2038b4ae2dd301c99e8c308bb0e","target":"graph","created_at":"2026-05-18T00:38:14Z","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":"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","authors_text":"Daniel Kane, Eric Price, Sushrut Karmalkar","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-10T15:31:02Z","title":"Robust polynomial regression up to the information theoretic limit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03257","kind":"arxiv","version":1},"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:1ed9500c312f2a2911da3b234cb342259e6cea1bbcc31c0535a403e8b9f6eae7","target":"record","created_at":"2026-05-18T00:38:14Z","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":"5e2b0c4a9616d98dfaf26d191020713263a0db930c7c235bf1245a20bde8ddaf","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-10T15:31:02Z","title_canon_sha256":"dae1c5079ec7146277b8bffc101712d7082d915e62552afb55dde9a72a23b1f4"},"schema_version":"1.0","source":{"id":"1708.03257","kind":"arxiv","version":1}},"canonical_sha256":"d4785f35c08363292f3996882681d8aaab9ba493e5a9c6265b953476c4600e77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4785f35c08363292f3996882681d8aaab9ba493e5a9c6265b953476c4600e77","first_computed_at":"2026-05-18T00:38:14.327964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:14.327964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LHBJUyGjhH02Ot7hCIRE5TrCdXynGV0kileSYneyqrVjusu+PB0+U1Qn3heh9zf2gHOnGM6OMJvAxgDb0ZFLBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:14.328616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ed9500c312f2a2911da3b234cb342259e6cea1bbcc31c0535a403e8b9f6eae7","sha256:91f96bca392c84ecfc93dd3a699a15cb2a3ff2038b4ae2dd301c99e8c308bb0e"],"state_sha256":"0ffc82581dad7eb9f2d315e3b8c98ff55a7ba9b54f77ce19fdd83f1b87402298"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dH+NEp/KQGWJQDHwBAnxTNw0q+pS6Lqnn4aG/roqgtcSSgLqD6JMVcTpCa0+6OEZsO9KoL0DD/keQTAccePDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:44:05.050514Z","bundle_sha256":"4ccda323832b23385adb7030e6aa44361afa14010dd25c58482682ce9a22c229"}}