{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EHX4NZJXZGENU6HLJZ4MMNARMV","short_pith_number":"pith:EHX4NZJX","canonical_record":{"source":{"id":"1603.08976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-29T21:41:55Z","cross_cats_sorted":["cs.AI","cs.CG"],"title_canon_sha256":"6e8322f121ed3d67e5a437878da299f220fdba9e093c5a43211f8abd271397de","abstract_canon_sha256":"304998a2466d86653392ecd9943a48f99bc114f18edf63ff39e2b84be0eef208"},"schema_version":"1.0"},"canonical_sha256":"21efc6e537c988da78eb4e78c63411657786b750d472ae803c734eee4909bf0e","source":{"kind":"arxiv","id":"1603.08976","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08976","created_at":"2026-05-18T00:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08976v2","created_at":"2026-05-18T00:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08976","created_at":"2026-05-18T00:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"EHX4NZJXZGEN","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EHX4NZJXZGENU6HL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EHX4NZJX","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EHX4NZJXZGENU6HLJZ4MMNARMV","target":"record","payload":{"canonical_record":{"source":{"id":"1603.08976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-29T21:41:55Z","cross_cats_sorted":["cs.AI","cs.CG"],"title_canon_sha256":"6e8322f121ed3d67e5a437878da299f220fdba9e093c5a43211f8abd271397de","abstract_canon_sha256":"304998a2466d86653392ecd9943a48f99bc114f18edf63ff39e2b84be0eef208"},"schema_version":"1.0"},"canonical_sha256":"21efc6e537c988da78eb4e78c63411657786b750d472ae803c734eee4909bf0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:08.400517Z","signature_b64":"LOwHLb0013wRTYg1mti+1ThkFxOgJRPrGgcvSK3zmyn3X5EVsXfZgzkS+AlClyWR0ivgkSfIFhPb1+CmOk6cDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21efc6e537c988da78eb4e78c63411657786b750d472ae803c734eee4909bf0e","last_reissued_at":"2026-05-18T00:53:08.400119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:08.400119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.08976","source_version":2,"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:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sjz9ppglSbGa+tbdtbM0jTC0DmM4OuC/H0cvTOYTZJCBbx+SEjT/U/IloIqSeZy9aAXe/TiMiwM/O6Kq04wpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:51:05.213923Z"},"content_sha256":"56935f59139c70cef94406bb74c833e570728a5e6bf8f058bd0935fad8096188","schema_version":"1.0","event_id":"sha256:56935f59139c70cef94406bb74c833e570728a5e6bf8f058bd0935fad8096188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EHX4NZJXZGENU6HLJZ4MMNARMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Search Yields a PTAS for k-Means in Doubling Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CG"],"primary_cat":"cs.DS","authors_text":"Mohammad R. Salavatipour, Mohsen Rezapour, Zachary Friggstad","submitted_at":"2016-03-29T21:41:55Z","abstract_excerpt":"The most well known and ubiquitous clustering problem encountered in nearly every branch of science is undoubtedly $k$-means: given a set of data points and a parameter $k$, select $k$ centres and partition the data points into $k$ clusters around these centres so that the sum of squares of distances of the points to their cluster centre is minimized. Typically these data points lie $\\mathbb{R}^d$ for some $d\\geq 2$.\n $k$-means and the first algorithms for it were introduced in the 1950's. Since then, hundreds of papers have studied this problem and many algorithms have been proposed for it. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08976","kind":"arxiv","version":2},"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:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZ7C4ZbFdSer5yoZwdxz7nOSG34cIVXhk6inOC2KFOPAKmylmBkQZgfyIwtp3FTuU/UShlNTtsoOdvHjvbkKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:51:05.214520Z"},"content_sha256":"401c7632c61c567e806b46f1e7755252b3de8d864f214e9a5f31364ca4543868","schema_version":"1.0","event_id":"sha256:401c7632c61c567e806b46f1e7755252b3de8d864f214e9a5f31364ca4543868"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHX4NZJXZGENU6HLJZ4MMNARMV/bundle.json","state_url":"https://pith.science/pith/EHX4NZJXZGENU6HLJZ4MMNARMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHX4NZJXZGENU6HLJZ4MMNARMV/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-27T19:51:05Z","links":{"resolver":"https://pith.science/pith/EHX4NZJXZGENU6HLJZ4MMNARMV","bundle":"https://pith.science/pith/EHX4NZJXZGENU6HLJZ4MMNARMV/bundle.json","state":"https://pith.science/pith/EHX4NZJXZGENU6HLJZ4MMNARMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHX4NZJXZGENU6HLJZ4MMNARMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EHX4NZJXZGENU6HLJZ4MMNARMV","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":"304998a2466d86653392ecd9943a48f99bc114f18edf63ff39e2b84be0eef208","cross_cats_sorted":["cs.AI","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-29T21:41:55Z","title_canon_sha256":"6e8322f121ed3d67e5a437878da299f220fdba9e093c5a43211f8abd271397de"},"schema_version":"1.0","source":{"id":"1603.08976","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08976","created_at":"2026-05-18T00:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08976v2","created_at":"2026-05-18T00:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08976","created_at":"2026-05-18T00:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"EHX4NZJXZGEN","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EHX4NZJXZGENU6HL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EHX4NZJX","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:401c7632c61c567e806b46f1e7755252b3de8d864f214e9a5f31364ca4543868","target":"graph","created_at":"2026-05-18T00:53:08Z","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":"The most well known and ubiquitous clustering problem encountered in nearly every branch of science is undoubtedly $k$-means: given a set of data points and a parameter $k$, select $k$ centres and partition the data points into $k$ clusters around these centres so that the sum of squares of distances of the points to their cluster centre is minimized. Typically these data points lie $\\mathbb{R}^d$ for some $d\\geq 2$.\n $k$-means and the first algorithms for it were introduced in the 1950's. Since then, hundreds of papers have studied this problem and many algorithms have been proposed for it. T","authors_text":"Mohammad R. Salavatipour, Mohsen Rezapour, Zachary Friggstad","cross_cats":["cs.AI","cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-29T21:41:55Z","title":"Local Search Yields a PTAS for k-Means in Doubling Metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08976","kind":"arxiv","version":2},"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:56935f59139c70cef94406bb74c833e570728a5e6bf8f058bd0935fad8096188","target":"record","created_at":"2026-05-18T00:53:08Z","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":"304998a2466d86653392ecd9943a48f99bc114f18edf63ff39e2b84be0eef208","cross_cats_sorted":["cs.AI","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-29T21:41:55Z","title_canon_sha256":"6e8322f121ed3d67e5a437878da299f220fdba9e093c5a43211f8abd271397de"},"schema_version":"1.0","source":{"id":"1603.08976","kind":"arxiv","version":2}},"canonical_sha256":"21efc6e537c988da78eb4e78c63411657786b750d472ae803c734eee4909bf0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21efc6e537c988da78eb4e78c63411657786b750d472ae803c734eee4909bf0e","first_computed_at":"2026-05-18T00:53:08.400119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:08.400119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LOwHLb0013wRTYg1mti+1ThkFxOgJRPrGgcvSK3zmyn3X5EVsXfZgzkS+AlClyWR0ivgkSfIFhPb1+CmOk6cDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:08.400517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08976","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56935f59139c70cef94406bb74c833e570728a5e6bf8f058bd0935fad8096188","sha256:401c7632c61c567e806b46f1e7755252b3de8d864f214e9a5f31364ca4543868"],"state_sha256":"f20671069edc68eb7837ddac07a9010e312754ca914a32f14c30708ff4bedd96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5W1Xz4EdIvPOzFkTELJ3NaKTHXgkQv4H+f/FBZTaUOYwbASPLqzVTVWWRVOO9eI2t8BZKgXOnE0C9TSmE4RBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:51:05.217665Z","bundle_sha256":"1b8e7c062614fa89d784f65467b58308f47b642c71e59ca11590a018f7a157cc"}}