{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HNJQV3UMAFWCP2C2QIGEEX5N3N","short_pith_number":"pith:HNJQV3UM","canonical_record":{"source":{"id":"1804.10827","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-28T16:17:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"505544c5f396182571074e7f85d934f7949d973a0d0aacfe45fa5db9e4cd65b8","abstract_canon_sha256":"7ec211770b81f9dfe59bf4e523752b8ea2c98693fcbeac1ed4cf1b76bec72300"},"schema_version":"1.0"},"canonical_sha256":"3b530aee8c016c27e85a820c425faddb70d9a250213d39cb62d6fe9c27519e48","source":{"kind":"arxiv","id":"1804.10827","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10827","created_at":"2026-05-17T23:52:44Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10827v3","created_at":"2026-05-17T23:52:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10827","created_at":"2026-05-17T23:52:44Z"},{"alias_kind":"pith_short_12","alias_value":"HNJQV3UMAFWC","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HNJQV3UMAFWCP2C2","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HNJQV3UM","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HNJQV3UMAFWCP2C2QIGEEX5N3N","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10827","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-28T16:17:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"505544c5f396182571074e7f85d934f7949d973a0d0aacfe45fa5db9e4cd65b8","abstract_canon_sha256":"7ec211770b81f9dfe59bf4e523752b8ea2c98693fcbeac1ed4cf1b76bec72300"},"schema_version":"1.0"},"canonical_sha256":"3b530aee8c016c27e85a820c425faddb70d9a250213d39cb62d6fe9c27519e48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:44.035134Z","signature_b64":"8PdITUhAYz25rdaKF/jC+cVZzMwXBmPzmMVrYrMUa/QLvn/DqiehmI8+4WY8b/F7na/elPDlkMCKm02xRVcgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b530aee8c016c27e85a820c425faddb70d9a250213d39cb62d6fe9c27519e48","last_reissued_at":"2026-05-17T23:52:44.034490Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:44.034490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10827","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:52:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Mf3ljtMy3/m/d5wRgJneKjrv2waDG0dYftqL4i042amRPov5E78OH7h7qgoFlFBOjQy6W/byAY248JKdkBrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T09:06:06.177805Z"},"content_sha256":"6a404b4a5f8b072abfcfbf7a24b000cf60d2c55f35ff07d28c4c625070ba6a4b","schema_version":"1.0","event_id":"sha256:6a404b4a5f8b072abfcfbf7a24b000cf60d2c55f35ff07d28c4c625070ba6a4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HNJQV3UMAFWCP2C2QIGEEX5N3N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Euclidean $k$-Means Clustering with $\\alpha$-Center Proximity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Amit Deshpande, Anand Louis, Apoorv Vikram Singh","submitted_at":"2018-04-28T16:17:15Z","abstract_excerpt":"$k$-means clustering is NP-hard in the worst case but previous work has shown efficient algorithms assuming the optimal $k$-means clusters are \\emph{stable} under additive or multiplicative perturbation of data. This has two caveats. First, we do not know how to efficiently verify this property of optimal solutions that are NP-hard to compute in the first place. Second, the stability assumptions required for polynomial time $k$-means algorithms are often unreasonable when compared to the ground-truth clusters in real-world data. A consequence of multiplicative perturbation resilience is \\emph{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10827","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:52:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8UR96pbRGJt5mWlxf1GDJHN0iyCHBNHJEepM8BBDQoktFVKAHqVxev1Hkbw/DUiwdeH4XbdziZfPeKAzGxnkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T09:06:06.178518Z"},"content_sha256":"0f89f3cec56468a9ce68d6c5349e7e21dba1fc2a4f41f189185e0d04c2a55c5c","schema_version":"1.0","event_id":"sha256:0f89f3cec56468a9ce68d6c5349e7e21dba1fc2a4f41f189185e0d04c2a55c5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N/bundle.json","state_url":"https://pith.science/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N/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-24T09:06:06Z","links":{"resolver":"https://pith.science/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N","bundle":"https://pith.science/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N/bundle.json","state":"https://pith.science/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HNJQV3UMAFWCP2C2QIGEEX5N3N","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":"7ec211770b81f9dfe59bf4e523752b8ea2c98693fcbeac1ed4cf1b76bec72300","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-28T16:17:15Z","title_canon_sha256":"505544c5f396182571074e7f85d934f7949d973a0d0aacfe45fa5db9e4cd65b8"},"schema_version":"1.0","source":{"id":"1804.10827","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10827","created_at":"2026-05-17T23:52:44Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10827v3","created_at":"2026-05-17T23:52:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10827","created_at":"2026-05-17T23:52:44Z"},{"alias_kind":"pith_short_12","alias_value":"HNJQV3UMAFWC","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HNJQV3UMAFWCP2C2","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HNJQV3UM","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:0f89f3cec56468a9ce68d6c5349e7e21dba1fc2a4f41f189185e0d04c2a55c5c","target":"graph","created_at":"2026-05-17T23:52:44Z","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":"$k$-means clustering is NP-hard in the worst case but previous work has shown efficient algorithms assuming the optimal $k$-means clusters are \\emph{stable} under additive or multiplicative perturbation of data. This has two caveats. First, we do not know how to efficiently verify this property of optimal solutions that are NP-hard to compute in the first place. Second, the stability assumptions required for polynomial time $k$-means algorithms are often unreasonable when compared to the ground-truth clusters in real-world data. A consequence of multiplicative perturbation resilience is \\emph{","authors_text":"Amit Deshpande, Anand Louis, Apoorv Vikram Singh","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-28T16:17:15Z","title":"On Euclidean $k$-Means Clustering with $\\alpha$-Center Proximity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10827","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:6a404b4a5f8b072abfcfbf7a24b000cf60d2c55f35ff07d28c4c625070ba6a4b","target":"record","created_at":"2026-05-17T23:52:44Z","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":"7ec211770b81f9dfe59bf4e523752b8ea2c98693fcbeac1ed4cf1b76bec72300","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-28T16:17:15Z","title_canon_sha256":"505544c5f396182571074e7f85d934f7949d973a0d0aacfe45fa5db9e4cd65b8"},"schema_version":"1.0","source":{"id":"1804.10827","kind":"arxiv","version":3}},"canonical_sha256":"3b530aee8c016c27e85a820c425faddb70d9a250213d39cb62d6fe9c27519e48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b530aee8c016c27e85a820c425faddb70d9a250213d39cb62d6fe9c27519e48","first_computed_at":"2026-05-17T23:52:44.034490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:44.034490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8PdITUhAYz25rdaKF/jC+cVZzMwXBmPzmMVrYrMUa/QLvn/DqiehmI8+4WY8b/F7na/elPDlkMCKm02xRVcgCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:44.035134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10827","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a404b4a5f8b072abfcfbf7a24b000cf60d2c55f35ff07d28c4c625070ba6a4b","sha256:0f89f3cec56468a9ce68d6c5349e7e21dba1fc2a4f41f189185e0d04c2a55c5c"],"state_sha256":"5faf8833b37ca6faf33ea19f5cb7f92d6bcf31042cd45a5dc046928c641728d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NFQJj5856XEWUfKdoB3CdR0bHjf5WANgWhCwA+AzEZLtVvPkMaizsOYxAtIyxb/yTSXeJSLJfotuQquTB6h5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T09:06:06.181494Z","bundle_sha256":"2a1c1ad3a0912779f6d4b676512088bb1a6030948b10cda9a32043208d207bbb"}}