{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OVSMQ6LBT4WRM2UB3GOFN2P3NQ","short_pith_number":"pith:OVSMQ6LB","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"},"canonical_sha256":"7564c879619f2d166a81d99c56e9fb6c2caafe7c3ba7d4505c19f0e17f463a7c","source":{"kind":"arxiv","id":"1201.4206","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4206","created_at":"2026-05-18T04:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4206v1","created_at":"2026-05-18T04:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4206","created_at":"2026-05-18T04:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"OVSMQ6LBT4WR","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OVSMQ6LBT4WRM2UB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OVSMQ6LB","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OVSMQ6LBT4WRM2UB3GOFN2P3NQ","target":"record","payload":{"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"},"canonical_sha256":"7564c879619f2d166a81d99c56e9fb6c2caafe7c3ba7d4505c19f0e17f463a7c","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"},"source_kind":"arxiv","source_id":"1201.4206","source_version":1,"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-18T04:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ancSuICgN02y6Ik3PoWgrNVlWC9Z2rQCsA5SV4gP+7GM82JSBKHPW6wD1wiwjdPGvduqRXu+6iSZRNROo2xFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:55:48.999624Z"},"content_sha256":"63388f1886ebb237da5eea6ca36ee3b0f3a36d313164c5e18db811efa12403ae","schema_version":"1.0","event_id":"sha256:63388f1886ebb237da5eea6ca36ee3b0f3a36d313164c5e18db811efa12403ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OVSMQ6LBT4WRM2UB3GOFN2P3NQ","target":"graph","payload":{"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"},"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-18T04:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"doh0vb7NqM+P2VCUXQ3Y6GGXZytnGe0O/Wtj1xZItSJCBA8BcUw4ODYJSNaz1Or5mIxe+kBxvjwO1XLrmEufCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:55:49.000072Z"},"content_sha256":"f06c33cea9ef74d3bec01f18e6c49bb8239c911231b61ca5fc6be97f4644c9ea","schema_version":"1.0","event_id":"sha256:f06c33cea9ef74d3bec01f18e6c49bb8239c911231b61ca5fc6be97f4644c9ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/bundle.json","state_url":"https://pith.science/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/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-06-03T13:55:49Z","links":{"resolver":"https://pith.science/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ","bundle":"https://pith.science/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/bundle.json","state":"https://pith.science/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVSMQ6LBT4WRM2UB3GOFN2P3NQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OVSMQ6LBT4WRM2UB3GOFN2P3NQ","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":"4cbb29a2c93fbd36e32a4f47e3236a8fbfbdd7586b9484c6017e943ec73dc7e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-20T05:01:48Z","title_canon_sha256":"360b7fc7fab81efda55e70116da9125c477c3699cfb6e40ec8e86d43a7a16574"},"schema_version":"1.0","source":{"id":"1201.4206","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4206","created_at":"2026-05-18T04:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4206v1","created_at":"2026-05-18T04:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4206","created_at":"2026-05-18T04:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"OVSMQ6LBT4WR","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OVSMQ6LBT4WRM2UB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OVSMQ6LB","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:f06c33cea9ef74d3bec01f18e6c49bb8239c911231b61ca5fc6be97f4644c9ea","target":"graph","created_at":"2026-05-18T04:04:07Z","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":"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","authors_text":"Amit Kumar, Ragesh Jaiswal, Sandeep Sen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-20T05:01:48Z","title":"A simple D^2-sampling based PTAS for k-means and other Clustering Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4206","kind":"arxiv","version":1},"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:63388f1886ebb237da5eea6ca36ee3b0f3a36d313164c5e18db811efa12403ae","target":"record","created_at":"2026-05-18T04:04:07Z","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":"4cbb29a2c93fbd36e32a4f47e3236a8fbfbdd7586b9484c6017e943ec73dc7e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-20T05:01:48Z","title_canon_sha256":"360b7fc7fab81efda55e70116da9125c477c3699cfb6e40ec8e86d43a7a16574"},"schema_version":"1.0","source":{"id":"1201.4206","kind":"arxiv","version":1}},"canonical_sha256":"7564c879619f2d166a81d99c56e9fb6c2caafe7c3ba7d4505c19f0e17f463a7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7564c879619f2d166a81d99c56e9fb6c2caafe7c3ba7d4505c19f0e17f463a7c","first_computed_at":"2026-05-18T04:04:07.597837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:07.597837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2InDfvUEXF2RA5d2fQRcQT9S6N+bG2/tvYJIQdla7kYXSNhEgfnz+4UE2DQ/l49NcpnhiuBZQdUy01fa7R1+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:07.598329Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.4206","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63388f1886ebb237da5eea6ca36ee3b0f3a36d313164c5e18db811efa12403ae","sha256:f06c33cea9ef74d3bec01f18e6c49bb8239c911231b61ca5fc6be97f4644c9ea"],"state_sha256":"18b61faf9fb97a1a0727a092693d1052a58a643bf2502b6d1817b883c47131ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pdx8MoJCE7ejkfjJpD94B/+AiESRiFNvUofbX1H1VQsC4ZcwuoRpQG7B264mifu+92+7tNnLSl0+lM0f2gnhCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:55:49.002180Z","bundle_sha256":"16c3cc9fc040da8073e63d6812b67a8be75626606a811cae1b6dd833518f6254"}}