{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MWRKAAB42HHMCFQ4LXR6HID3E7","short_pith_number":"pith:MWRKAAB4","canonical_record":{"source":{"id":"1711.11247","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-30T06:23:52Z","cross_cats_sorted":[],"title_canon_sha256":"e2e8b20b32da9a4e6328fc6563c0a74eb8b29ecb41e19a86306564c98d5ba9cd","abstract_canon_sha256":"7dab7942fdd83788b71939be89a72820d945ecb2fd2b8c25bfc9c66b2ad3de22"},"schema_version":"1.0"},"canonical_sha256":"65a2a0003cd1cec1161c5de3e3a07b27d98fba3c48976ea05ba9e46dee4bbb38","source":{"kind":"arxiv","id":"1711.11247","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11247","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11247v3","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11247","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"MWRKAAB42HHM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MWRKAAB42HHMCFQ4","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MWRKAAB4","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MWRKAAB42HHMCFQ4LXR6HID3E7","target":"record","payload":{"canonical_record":{"source":{"id":"1711.11247","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-30T06:23:52Z","cross_cats_sorted":[],"title_canon_sha256":"e2e8b20b32da9a4e6328fc6563c0a74eb8b29ecb41e19a86306564c98d5ba9cd","abstract_canon_sha256":"7dab7942fdd83788b71939be89a72820d945ecb2fd2b8c25bfc9c66b2ad3de22"},"schema_version":"1.0"},"canonical_sha256":"65a2a0003cd1cec1161c5de3e3a07b27d98fba3c48976ea05ba9e46dee4bbb38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:18.192728Z","signature_b64":"dLnpF0buDWen/VvpFJiiFMZCzWt30vJU0nHvTQGgLhufg2y1b3T05OaUcvTcrqnybk3AAbM62UK/IbP1v57fDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65a2a0003cd1cec1161c5de3e3a07b27d98fba3c48976ea05ba9e46dee4bbb38","last_reissued_at":"2026-05-18T00:07:18.192009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:18.192009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.11247","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-18T00:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TgC+taalCcth5gv5lwM9LjYvsCTITs0e7sXgFn8ll140jRpfUxmoJaUWawVRzc/DN0m9u4Cd89wErQsMFFwcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T07:45:39.938375Z"},"content_sha256":"f6c6c99b86bb667ed0fafedea01690d274abbd39d2fdb9380ef08c543765a362","schema_version":"1.0","event_id":"sha256:f6c6c99b86bb667ed0fafedea01690d274abbd39d2fdb9380ef08c543765a362"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MWRKAAB42HHMCFQ4LXR6HID3E7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provably noise-robust, regularised $k$-means clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Shai Ben-David, Shrinu Kushagra, Yaoliang Yu","submitted_at":"2017-11-30T06:23:52Z","abstract_excerpt":"We consider the problem of clustering in the presence of noise. That is, when on top of cluster structure, the data also contains a subset of \\emph{unstructured} points. Our goal is to detect the clusters despite the presence of many unstructured points. Any algorithm that achieves this goal is noise-robust. We consider a regularisation method which converts any center-based clustering objective into a noise-robust one. We focus on the $k$-means objective and we prove that the regularised version of $k$-means is NP-Hard even for $k=1$. We consider two algorithms based on the convex (sdp and lp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11247","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-18T00:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FSGrchu7y0Fi1CYAQpN1rkMc8rNCmlLe0hLD54bHXtKX5KCSKy4gqa+PP56ifTEqfOuImmDY4NaBZRZ2ZUb8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T07:45:39.939033Z"},"content_sha256":"6c3e5d023bdfd4e377c94f4cd895731b519272a34b7a4f0240f17bb120751e93","schema_version":"1.0","event_id":"sha256:6c3e5d023bdfd4e377c94f4cd895731b519272a34b7a4f0240f17bb120751e93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWRKAAB42HHMCFQ4LXR6HID3E7/bundle.json","state_url":"https://pith.science/pith/MWRKAAB42HHMCFQ4LXR6HID3E7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWRKAAB42HHMCFQ4LXR6HID3E7/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-07-08T07:45:39Z","links":{"resolver":"https://pith.science/pith/MWRKAAB42HHMCFQ4LXR6HID3E7","bundle":"https://pith.science/pith/MWRKAAB42HHMCFQ4LXR6HID3E7/bundle.json","state":"https://pith.science/pith/MWRKAAB42HHMCFQ4LXR6HID3E7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWRKAAB42HHMCFQ4LXR6HID3E7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MWRKAAB42HHMCFQ4LXR6HID3E7","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":"7dab7942fdd83788b71939be89a72820d945ecb2fd2b8c25bfc9c66b2ad3de22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-30T06:23:52Z","title_canon_sha256":"e2e8b20b32da9a4e6328fc6563c0a74eb8b29ecb41e19a86306564c98d5ba9cd"},"schema_version":"1.0","source":{"id":"1711.11247","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11247","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11247v3","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11247","created_at":"2026-05-18T00:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"MWRKAAB42HHM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MWRKAAB42HHMCFQ4","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MWRKAAB4","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:6c3e5d023bdfd4e377c94f4cd895731b519272a34b7a4f0240f17bb120751e93","target":"graph","created_at":"2026-05-18T00:07:18Z","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 clustering in the presence of noise. That is, when on top of cluster structure, the data also contains a subset of \\emph{unstructured} points. Our goal is to detect the clusters despite the presence of many unstructured points. Any algorithm that achieves this goal is noise-robust. We consider a regularisation method which converts any center-based clustering objective into a noise-robust one. We focus on the $k$-means objective and we prove that the regularised version of $k$-means is NP-Hard even for $k=1$. We consider two algorithms based on the convex (sdp and lp","authors_text":"Shai Ben-David, Shrinu Kushagra, Yaoliang Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-30T06:23:52Z","title":"Provably noise-robust, regularised $k$-means clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11247","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:f6c6c99b86bb667ed0fafedea01690d274abbd39d2fdb9380ef08c543765a362","target":"record","created_at":"2026-05-18T00:07:18Z","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":"7dab7942fdd83788b71939be89a72820d945ecb2fd2b8c25bfc9c66b2ad3de22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-30T06:23:52Z","title_canon_sha256":"e2e8b20b32da9a4e6328fc6563c0a74eb8b29ecb41e19a86306564c98d5ba9cd"},"schema_version":"1.0","source":{"id":"1711.11247","kind":"arxiv","version":3}},"canonical_sha256":"65a2a0003cd1cec1161c5de3e3a07b27d98fba3c48976ea05ba9e46dee4bbb38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65a2a0003cd1cec1161c5de3e3a07b27d98fba3c48976ea05ba9e46dee4bbb38","first_computed_at":"2026-05-18T00:07:18.192009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:18.192009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dLnpF0buDWen/VvpFJiiFMZCzWt30vJU0nHvTQGgLhufg2y1b3T05OaUcvTcrqnybk3AAbM62UK/IbP1v57fDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:18.192728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.11247","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6c6c99b86bb667ed0fafedea01690d274abbd39d2fdb9380ef08c543765a362","sha256:6c3e5d023bdfd4e377c94f4cd895731b519272a34b7a4f0240f17bb120751e93"],"state_sha256":"cfe790e05e0597e0cdc9bdc7d337026b7767940d9cf1cfed5d2257aec0983cea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jiwkKyOsFNPklULc9EuDoM0co+BRA7rP6qsE3r1oXGcq6mYSXfEJIJplM/tFwkJ0/ITg7LyzjVx1+TatKDRmDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T07:45:39.942178Z","bundle_sha256":"9fe94827fdf0d83f40a0b0b3a41511648ce03fdbfe2067c6b663ba2955aa6eaf"}}