{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OVSMQ6LBT4WRM2UB3GOFN2P3NQ","short_pith_number":"pith:OVSMQ6LB","schema_version":"1.0","canonical_sha256":"7564c879619f2d166a81d99c56e9fb6c2caafe7c3ba7d4505c19f0e17f463a7c","source":{"kind":"arxiv","id":"1201.4206","version":1},"attestation_state":"computed","paper":{"title":"A simple D^2-sampling based PTAS for k-means and other Clustering Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Ragesh Jaiswal, Sandeep Sen","submitted_at":"2012-01-20T05:01:48Z","abstract_excerpt":"Given a set of points $P \\subset \\mathbb{R}^d$, the $k$-means clustering problem is to find a set of $k$ {\\em centers} $C = \\{c_1,...,c_k\\}, c_i \\in \\mathbb{R}^d,$ such that the objective function $\\sum_{x \\in P} d(x,C)^2$, where $d(x,C)$ denotes the distance between $x$ and the closest center in $C$, is minimized. This is one of the most prominent objective functions that have been studied with respect to clustering.\n  $D^2$-sampling \\cite{ArthurV07} is a simple non-uniform sampling technique for choosing points from a set of points. It works as follows: given a set of points $P \\subseteq \\ma"},"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":"1201.4206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-20T05:01:48Z","cross_cats_sorted":[],"title_canon_sha256":"360b7fc7fab81efda55e70116da9125c477c3699cfb6e40ec8e86d43a7a16574","abstract_canon_sha256":"4cbb29a2c93fbd36e32a4f47e3236a8fbfbdd7586b9484c6017e943ec73dc7e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:07.598329Z","signature_b64":"2InDfvUEXF2RA5d2fQRcQT9S6N+bG2/tvYJIQdla7kYXSNhEgfnz+4UE2DQ/l49NcpnhiuBZQdUy01fa7R1+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7564c879619f2d166a81d99c56e9fb6c2caafe7c3ba7d4505c19f0e17f463a7c","last_reissued_at":"2026-05-18T04:04:07.597837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:07.597837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simple D^2-sampling based PTAS for k-means and other Clustering Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Ragesh Jaiswal, Sandeep Sen","submitted_at":"2012-01-20T05:01:48Z","abstract_excerpt":"Given a set of points $P \\subset \\mathbb{R}^d$, the $k$-means clustering problem is to find a set of $k$ {\\em centers} $C = \\{c_1,...,c_k\\}, c_i \\in \\mathbb{R}^d,$ such that the objective function $\\sum_{x \\in P} d(x,C)^2$, where $d(x,C)$ denotes the distance between $x$ and the closest center in $C$, is minimized. This is one of the most prominent objective functions that have been studied with respect to clustering.\n  $D^2$-sampling \\cite{ArthurV07} is a simple non-uniform sampling technique for choosing points from a set of points. It works as follows: given a set of points $P \\subseteq \\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4206","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.4206","created_at":"2026-05-18T04:04:07.597917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4206v1","created_at":"2026-05-18T04:04:07.597917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4206","created_at":"2026-05-18T04:04:07.597917+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVSMQ6LBT4WR","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVSMQ6LBT4WRM2UB","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVSMQ6LB","created_at":"2026-05-18T12:27:16.716162+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/OVSMQ6LBT4WRM2UB3GOFN2P3NQ","json":"https://pith.science/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ.json","graph_json":"https://pith.science/api/pith-number/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/graph.json","events_json":"https://pith.science/api/pith-number/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/events.json","paper":"https://pith.science/paper/OVSMQ6LB"},"agent_actions":{"view_html":"https://pith.science/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ","download_json":"https://pith.science/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ.json","view_paper":"https://pith.science/paper/OVSMQ6LB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4206&json=true","fetch_graph":"https://pith.science/api/pith-number/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/graph.json","fetch_events":"https://pith.science/api/pith-number/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/action/storage_attestation","attest_author":"https://pith.science/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/action/author_attestation","sign_citation":"https://pith.science/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/action/citation_signature","submit_replication":"https://pith.science/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/action/replication_record"}},"created_at":"2026-05-18T04:04:07.597917+00:00","updated_at":"2026-05-18T04:04:07.597917+00:00"}