{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HNJQV3UMAFWCP2C2QIGEEX5N3N","short_pith_number":"pith:HNJQV3UM","schema_version":"1.0","canonical_sha256":"3b530aee8c016c27e85a820c425faddb70d9a250213d39cb62d6fe9c27519e48","source":{"kind":"arxiv","id":"1804.10827","version":3},"attestation_state":"computed","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{"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.10827","created_at":"2026-05-17T23:52:44.034581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10827v3","created_at":"2026-05-17T23:52:44.034581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10827","created_at":"2026-05-17T23:52:44.034581+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNJQV3UMAFWC","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNJQV3UMAFWCP2C2","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNJQV3UM","created_at":"2026-05-18T12:32:28.185984+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/HNJQV3UMAFWCP2C2QIGEEX5N3N","json":"https://pith.science/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N.json","graph_json":"https://pith.science/api/pith-number/HNJQV3UMAFWCP2C2QIGEEX5N3N/graph.json","events_json":"https://pith.science/api/pith-number/HNJQV3UMAFWCP2C2QIGEEX5N3N/events.json","paper":"https://pith.science/paper/HNJQV3UM"},"agent_actions":{"view_html":"https://pith.science/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N","download_json":"https://pith.science/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N.json","view_paper":"https://pith.science/paper/HNJQV3UM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10827&json=true","fetch_graph":"https://pith.science/api/pith-number/HNJQV3UMAFWCP2C2QIGEEX5N3N/graph.json","fetch_events":"https://pith.science/api/pith-number/HNJQV3UMAFWCP2C2QIGEEX5N3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N/action/storage_attestation","attest_author":"https://pith.science/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N/action/author_attestation","sign_citation":"https://pith.science/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N/action/citation_signature","submit_replication":"https://pith.science/pith/HNJQV3UMAFWCP2C2QIGEEX5N3N/action/replication_record"}},"created_at":"2026-05-17T23:52:44.034581+00:00","updated_at":"2026-05-17T23:52:44.034581+00:00"}