{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EXGUUJ6KXVJVJLFKDDSMT7SWQ7","short_pith_number":"pith:EXGUUJ6K","canonical_record":{"source":{"id":"1502.03316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-11T14:38:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e046cada523ce13e88dcfb8aceff9e6d244a746f086403c67dd2bdcbeae49d6f","abstract_canon_sha256":"d03405ee697b222d9f8f53195462f573e7567a3125549105df792688a87c13b8"},"schema_version":"1.0"},"canonical_sha256":"25cd4a27cabd5354acaa18e4c9fe5687c5b261d3891af67f8b123aafc93fade3","source":{"kind":"arxiv","id":"1502.03316","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03316","created_at":"2026-05-18T02:27:19Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03316v1","created_at":"2026-05-18T02:27:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03316","created_at":"2026-05-18T02:27:19Z"},{"alias_kind":"pith_short_12","alias_value":"EXGUUJ6KXVJV","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EXGUUJ6KXVJVJLFK","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EXGUUJ6K","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EXGUUJ6KXVJVJLFKDDSMT7SWQ7","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-11T14:38:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e046cada523ce13e88dcfb8aceff9e6d244a746f086403c67dd2bdcbeae49d6f","abstract_canon_sha256":"d03405ee697b222d9f8f53195462f573e7567a3125549105df792688a87c13b8"},"schema_version":"1.0"},"canonical_sha256":"25cd4a27cabd5354acaa18e4c9fe5687c5b261d3891af67f8b123aafc93fade3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:19.752408Z","signature_b64":"3cJTQ6xFnUyHm19GxxTwZnvAj/KcWW5zurOzAD32kC8GvmAoJVmsKZweeEA4/suSOpsoLS6HfCUpZWvXSfBMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25cd4a27cabd5354acaa18e4c9fe5687c5b261d3891af67f8b123aafc93fade3","last_reissued_at":"2026-05-18T02:27:19.751530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:19.751530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03316","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-18T02:27:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FuReGqkD0PCFmjvpR5Z/YEl5mze0ikqXJf95ZFBCr45on5rtuHfIx1Wk43mrY70B/Ovb4/nanKQHHPnqMv9mDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:30:45.690188Z"},"content_sha256":"7281d21a98ba0cb4f958f1a05241a0fc0688de8b42d925581dd3c9274ae2229b","schema_version":"1.0","event_id":"sha256:7281d21a98ba0cb4f958f1a05241a0fc0688de8b42d925581dd3c9274ae2229b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EXGUUJ6KXVJVJLFKDDSMT7SWQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Hardness of Approximation of Euclidean k-means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ali Kemal Sinop, Moses Charikar, Pranjal Awasthi, Ravishankar Krishnaswamy","submitted_at":"2015-02-11T14:38:45Z","abstract_excerpt":"The Euclidean $k$-means problem is a classical problem that has been extensively studied in the theoretical computer science, machine learning and the computational geometry communities. In this problem, we are given a set of $n$ points in Euclidean space $R^d$, and the goal is to choose $k$ centers in $R^d$ so that the sum of squared distances of each point to its nearest center is minimized. The best approximation algorithms for this problem include a polynomial time constant factor approximation for general $k$ and a $(1+\\epsilon)$-approximation which runs in time $poly(n) 2^{O(k/\\epsilon)}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03316","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-18T02:27:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBKFnOywc3HU587KH7461twRdthstRMDHPr88t3vzEJin0PZ1lScLkWVZ/cZQuSahHAS2FF1iM5LUA0dH/YqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:30:45.690555Z"},"content_sha256":"7f74de9f23483819f34b34f364fc3e3638ee82050eca5c5ef6d176f031c07e5d","schema_version":"1.0","event_id":"sha256:7f74de9f23483819f34b34f364fc3e3638ee82050eca5c5ef6d176f031c07e5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/bundle.json","state_url":"https://pith.science/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/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-01T23:30:45Z","links":{"resolver":"https://pith.science/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7","bundle":"https://pith.science/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/bundle.json","state":"https://pith.science/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXGUUJ6KXVJVJLFKDDSMT7SWQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EXGUUJ6KXVJVJLFKDDSMT7SWQ7","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":"d03405ee697b222d9f8f53195462f573e7567a3125549105df792688a87c13b8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-11T14:38:45Z","title_canon_sha256":"e046cada523ce13e88dcfb8aceff9e6d244a746f086403c67dd2bdcbeae49d6f"},"schema_version":"1.0","source":{"id":"1502.03316","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03316","created_at":"2026-05-18T02:27:19Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03316v1","created_at":"2026-05-18T02:27:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03316","created_at":"2026-05-18T02:27:19Z"},{"alias_kind":"pith_short_12","alias_value":"EXGUUJ6KXVJV","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EXGUUJ6KXVJVJLFK","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EXGUUJ6K","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:7f74de9f23483819f34b34f364fc3e3638ee82050eca5c5ef6d176f031c07e5d","target":"graph","created_at":"2026-05-18T02:27:19Z","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 Euclidean $k$-means problem is a classical problem that has been extensively studied in the theoretical computer science, machine learning and the computational geometry communities. In this problem, we are given a set of $n$ points in Euclidean space $R^d$, and the goal is to choose $k$ centers in $R^d$ so that the sum of squared distances of each point to its nearest center is minimized. The best approximation algorithms for this problem include a polynomial time constant factor approximation for general $k$ and a $(1+\\epsilon)$-approximation which runs in time $poly(n) 2^{O(k/\\epsilon)}","authors_text":"Ali Kemal Sinop, Moses Charikar, Pranjal Awasthi, Ravishankar Krishnaswamy","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-11T14:38:45Z","title":"The Hardness of Approximation of Euclidean k-means"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03316","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:7281d21a98ba0cb4f958f1a05241a0fc0688de8b42d925581dd3c9274ae2229b","target":"record","created_at":"2026-05-18T02:27:19Z","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":"d03405ee697b222d9f8f53195462f573e7567a3125549105df792688a87c13b8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-11T14:38:45Z","title_canon_sha256":"e046cada523ce13e88dcfb8aceff9e6d244a746f086403c67dd2bdcbeae49d6f"},"schema_version":"1.0","source":{"id":"1502.03316","kind":"arxiv","version":1}},"canonical_sha256":"25cd4a27cabd5354acaa18e4c9fe5687c5b261d3891af67f8b123aafc93fade3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25cd4a27cabd5354acaa18e4c9fe5687c5b261d3891af67f8b123aafc93fade3","first_computed_at":"2026-05-18T02:27:19.751530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:19.751530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3cJTQ6xFnUyHm19GxxTwZnvAj/KcWW5zurOzAD32kC8GvmAoJVmsKZweeEA4/suSOpsoLS6HfCUpZWvXSfBMDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:19.752408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03316","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7281d21a98ba0cb4f958f1a05241a0fc0688de8b42d925581dd3c9274ae2229b","sha256:7f74de9f23483819f34b34f364fc3e3638ee82050eca5c5ef6d176f031c07e5d"],"state_sha256":"796156ff93b25fae9362bd08254f25b25cfa21cbdd4cefe15a3cca6f1375b473"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uOCd98MZs6XDpiTX3dhXf5P/Hq68GMyVw1WDqsDuYRJKief6w/soN9rZfv6xQRdzWBkeagNgNkzrQmOZRP5ICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:30:45.692515Z","bundle_sha256":"b8aa9facfc9aad7a0cf1725150577168f1cedd095735863b28ee2acca1c5df05"}}