{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6E42OCHO4D4RREU2G37X57SV7A","short_pith_number":"pith:6E42OCHO","canonical_record":{"source":{"id":"1905.05679","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-14T15:43:33Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"15af3ebfbb2b5d6db062d8164063232e7a0784beb3d23efcfc247922b8610036","abstract_canon_sha256":"553c691719dabdf9681b9f78c9442273a449a97c11bac4142dae165924571961"},"schema_version":"1.0"},"canonical_sha256":"f139a708eee0f918929a36ff7efe55f828e77902f5ca52dc3a570fec11df8acc","source":{"kind":"arxiv","id":"1905.05679","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05679","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05679v3","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05679","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"6E42OCHO4D4R","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6E42OCHO4D4RREU2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6E42OCHO","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6E42OCHO4D4RREU2G37X57SV7A","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05679","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-14T15:43:33Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"15af3ebfbb2b5d6db062d8164063232e7a0784beb3d23efcfc247922b8610036","abstract_canon_sha256":"553c691719dabdf9681b9f78c9442273a449a97c11bac4142dae165924571961"},"schema_version":"1.0"},"canonical_sha256":"f139a708eee0f918929a36ff7efe55f828e77902f5ca52dc3a570fec11df8acc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:42.185025Z","signature_b64":"nxv/qEWOm9d1fHkWxhdBC5nFv+Opzr9itZAAQ7mW/1f00ibRw207oOmmGXcJY8SNyTqOTixSirsO5Awbeu36Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f139a708eee0f918929a36ff7efe55f828e77902f5ca52dc3a570fec11df8acc","last_reissued_at":"2026-05-17T23:44:42.184552Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:42.184552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05679","source_version":3,"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-17T23:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xaNY+kUoquiREFNgiB8ixe/v1BZV30zg+Rrc6Um2H9ftbYmusgi+1bVma/sk5+V+L9pEn+IzBTCPJvsOBtYmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:10:01.258388Z"},"content_sha256":"6b660786cc2d4db8ddd37a06dde2937611fe32979968dce66d88a1dde630477e","schema_version":"1.0","event_id":"sha256:6b660786cc2d4db8ddd37a06dde2937611fe32979968dce66d88a1dde630477e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6E42OCHO4D4RREU2G37X57SV7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List-Decodable Linear Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Adam R. Klivans, Pravesh K. Kothari, Sushrut Karmalkar","submitted_at":"2019-05-14T15:43:33Z","abstract_excerpt":"We give the first polynomial-time algorithm for robust regression in the list-decodable setting where an adversary can corrupt a greater than $1/2$ fraction of examples.\n  For any $\\alpha < 1$, our algorithm takes as input a sample $\\{(x_i,y_i)\\}_{i \\leq n}$ of $n$ linear equations where $\\alpha n$ of the equations satisfy $y_i = \\langle x_i,\\ell^*\\rangle +\\zeta$ for some small noise $\\zeta$ and $(1-\\alpha)n$ of the equations are {\\em arbitrarily} chosen. It outputs a list $L$ of size $O(1/\\alpha)$ - a fixed constant - that contains an $\\ell$ that is close to $\\ell^*$.\n  Our algorithm succeeds"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05679","kind":"arxiv","version":3},"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-17T23:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i6L3ffAOqOM9LZxVlJ2p4b9isvFO/UOerBm4R8gdApFEEn5YdQtzstckrWnUfSvjzTk9uXdZ32h4hXW0ZnHfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:10:01.259037Z"},"content_sha256":"09d1331e63868c957f9fad564c188d9d409678cc4fcca4392e46266cc4eafd66","schema_version":"1.0","event_id":"sha256:09d1331e63868c957f9fad564c188d9d409678cc4fcca4392e46266cc4eafd66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6E42OCHO4D4RREU2G37X57SV7A/bundle.json","state_url":"https://pith.science/pith/6E42OCHO4D4RREU2G37X57SV7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6E42OCHO4D4RREU2G37X57SV7A/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-29T20:10:01Z","links":{"resolver":"https://pith.science/pith/6E42OCHO4D4RREU2G37X57SV7A","bundle":"https://pith.science/pith/6E42OCHO4D4RREU2G37X57SV7A/bundle.json","state":"https://pith.science/pith/6E42OCHO4D4RREU2G37X57SV7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6E42OCHO4D4RREU2G37X57SV7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6E42OCHO4D4RREU2G37X57SV7A","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":"553c691719dabdf9681b9f78c9442273a449a97c11bac4142dae165924571961","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-14T15:43:33Z","title_canon_sha256":"15af3ebfbb2b5d6db062d8164063232e7a0784beb3d23efcfc247922b8610036"},"schema_version":"1.0","source":{"id":"1905.05679","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05679","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05679v3","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05679","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"6E42OCHO4D4R","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6E42OCHO4D4RREU2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6E42OCHO","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:09d1331e63868c957f9fad564c188d9d409678cc4fcca4392e46266cc4eafd66","target":"graph","created_at":"2026-05-17T23:44:42Z","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 give the first polynomial-time algorithm for robust regression in the list-decodable setting where an adversary can corrupt a greater than $1/2$ fraction of examples.\n  For any $\\alpha < 1$, our algorithm takes as input a sample $\\{(x_i,y_i)\\}_{i \\leq n}$ of $n$ linear equations where $\\alpha n$ of the equations satisfy $y_i = \\langle x_i,\\ell^*\\rangle +\\zeta$ for some small noise $\\zeta$ and $(1-\\alpha)n$ of the equations are {\\em arbitrarily} chosen. It outputs a list $L$ of size $O(1/\\alpha)$ - a fixed constant - that contains an $\\ell$ that is close to $\\ell^*$.\n  Our algorithm succeeds","authors_text":"Adam R. Klivans, Pravesh K. Kothari, Sushrut Karmalkar","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-14T15:43:33Z","title":"List-Decodable Linear Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05679","kind":"arxiv","version":3},"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:6b660786cc2d4db8ddd37a06dde2937611fe32979968dce66d88a1dde630477e","target":"record","created_at":"2026-05-17T23:44:42Z","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":"553c691719dabdf9681b9f78c9442273a449a97c11bac4142dae165924571961","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-14T15:43:33Z","title_canon_sha256":"15af3ebfbb2b5d6db062d8164063232e7a0784beb3d23efcfc247922b8610036"},"schema_version":"1.0","source":{"id":"1905.05679","kind":"arxiv","version":3}},"canonical_sha256":"f139a708eee0f918929a36ff7efe55f828e77902f5ca52dc3a570fec11df8acc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f139a708eee0f918929a36ff7efe55f828e77902f5ca52dc3a570fec11df8acc","first_computed_at":"2026-05-17T23:44:42.184552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:42.184552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nxv/qEWOm9d1fHkWxhdBC5nFv+Opzr9itZAAQ7mW/1f00ibRw207oOmmGXcJY8SNyTqOTixSirsO5Awbeu36Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:42.185025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05679","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b660786cc2d4db8ddd37a06dde2937611fe32979968dce66d88a1dde630477e","sha256:09d1331e63868c957f9fad564c188d9d409678cc4fcca4392e46266cc4eafd66"],"state_sha256":"059a3d0eb4d1c3de0d041d120a55010baf513d276b2f2095498750a2568fcc70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1U75PdXP/V7xhWknUcLwh886BfEXUCjgAJ5OD9yES8KjMOdzFj5LckBQWKZkr+MmkTjmAljAgIUCHOk+Do7UCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T20:10:01.262313Z","bundle_sha256":"dce9fc83a531f6f4645dfa746dd50ebaf4ddb77f55f945c3c9974c39edfcfc94"}}