{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:W4JKLY446Z3S4CAZIRVEF3UYU3","short_pith_number":"pith:W4JKLY44","canonical_record":{"source":{"id":"2605.29165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T23:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"3cbbb735ae05c2c4caea3a9cba4e3c7f991ffa69f9b811504a80dc522687a637","abstract_canon_sha256":"4ee12816f76d60da4a3403468435bc3c6619ab72d815e04f473a430484693028"},"schema_version":"1.0"},"canonical_sha256":"b712a5e39cf6772e0819446a42ee98a6e98ec0a684247493464258b5cfabc3b5","source":{"kind":"arxiv","id":"2605.29165","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.29165","created_at":"2026-05-29T01:05:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.29165v1","created_at":"2026-05-29T01:05:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29165","created_at":"2026-05-29T01:05:22Z"},{"alias_kind":"pith_short_12","alias_value":"W4JKLY446Z3S","created_at":"2026-05-29T01:05:22Z"},{"alias_kind":"pith_short_16","alias_value":"W4JKLY446Z3S4CAZ","created_at":"2026-05-29T01:05:22Z"},{"alias_kind":"pith_short_8","alias_value":"W4JKLY44","created_at":"2026-05-29T01:05:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:W4JKLY446Z3S4CAZIRVEF3UYU3","target":"record","payload":{"canonical_record":{"source":{"id":"2605.29165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T23:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"3cbbb735ae05c2c4caea3a9cba4e3c7f991ffa69f9b811504a80dc522687a637","abstract_canon_sha256":"4ee12816f76d60da4a3403468435bc3c6619ab72d815e04f473a430484693028"},"schema_version":"1.0"},"canonical_sha256":"b712a5e39cf6772e0819446a42ee98a6e98ec0a684247493464258b5cfabc3b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:22.022236Z","signature_b64":"0WOVRYhRlwnUOj5SfJ8atz5joExJlXW3zIG/fflYvfe0hApsvUajYBJzBe1jUb9pFtv4CcorFnv50qwxR/8WBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b712a5e39cf6772e0819446a42ee98a6e98ec0a684247493464258b5cfabc3b5","last_reissued_at":"2026-05-29T01:05:22.021434Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:22.021434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.29165","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-29T01:05:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rwhVD4bGTFlMh4+oAovWGYiSrPzcguFVjN3ypUHlnlOKCXWaG3RSxz26rQFDaTAiekJbuWbD10FHkbB57lOPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:17:23.573851Z"},"content_sha256":"12b4524e785367af6b07690cb401201dab7c5aa8436355a0bdfb2e44ae122d42","schema_version":"1.0","event_id":"sha256:12b4524e785367af6b07690cb401201dab7c5aa8436355a0bdfb2e44ae122d42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:W4JKLY446Z3S4CAZIRVEF3UYU3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Greedy Approximation for (Metric) $k$-Means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ernest van Wijland, Euiwoong Lee, Fabrizio Grandoni, Moses Charikar, Ruiquan Gao, Vincent Cohen-Addad","submitted_at":"2026-05-27T23:05:27Z","abstract_excerpt":"Clustering is a basic task in data analysis and machine learning, and the optimization of clustering objectives are well-studied optimization problems; amongst these, the $k$-Means objective is arguably the most well known. Given a collection of points in a metric space, the goal is to partition them into $k$ clusters, each with an associated center, so as to minimize the sum of squared distances of points to their cluster centers. In this paper, we present a polynomial-time $3+2\\sqrt{2}+\\epsilon<5.83$-approximation algorithm for $k$-Means in general metrics. This substantially improves on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29165","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.29165/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-29T01:05:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1PR4GuDi70SVclB8cnMqAde62FcZqLjU36OQmsp+4Uvjdf9eLB3g2k6kldqZr4zdQnof2hUlx5vU3XSP+kGWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:17:23.574239Z"},"content_sha256":"e0d51e3f8479f0599205271058babb939368fda3dc23d4b4a3e06a785b684110","schema_version":"1.0","event_id":"sha256:e0d51e3f8479f0599205271058babb939368fda3dc23d4b4a3e06a785b684110"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4JKLY446Z3S4CAZIRVEF3UYU3/bundle.json","state_url":"https://pith.science/pith/W4JKLY446Z3S4CAZIRVEF3UYU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4JKLY446Z3S4CAZIRVEF3UYU3/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-12T06:17:23Z","links":{"resolver":"https://pith.science/pith/W4JKLY446Z3S4CAZIRVEF3UYU3","bundle":"https://pith.science/pith/W4JKLY446Z3S4CAZIRVEF3UYU3/bundle.json","state":"https://pith.science/pith/W4JKLY446Z3S4CAZIRVEF3UYU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4JKLY446Z3S4CAZIRVEF3UYU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:W4JKLY446Z3S4CAZIRVEF3UYU3","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":"4ee12816f76d60da4a3403468435bc3c6619ab72d815e04f473a430484693028","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T23:05:27Z","title_canon_sha256":"3cbbb735ae05c2c4caea3a9cba4e3c7f991ffa69f9b811504a80dc522687a637"},"schema_version":"1.0","source":{"id":"2605.29165","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.29165","created_at":"2026-05-29T01:05:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.29165v1","created_at":"2026-05-29T01:05:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29165","created_at":"2026-05-29T01:05:22Z"},{"alias_kind":"pith_short_12","alias_value":"W4JKLY446Z3S","created_at":"2026-05-29T01:05:22Z"},{"alias_kind":"pith_short_16","alias_value":"W4JKLY446Z3S4CAZ","created_at":"2026-05-29T01:05:22Z"},{"alias_kind":"pith_short_8","alias_value":"W4JKLY44","created_at":"2026-05-29T01:05:22Z"}],"graph_snapshots":[{"event_id":"sha256:e0d51e3f8479f0599205271058babb939368fda3dc23d4b4a3e06a785b684110","target":"graph","created_at":"2026-05-29T01:05:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.29165/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustering is a basic task in data analysis and machine learning, and the optimization of clustering objectives are well-studied optimization problems; amongst these, the $k$-Means objective is arguably the most well known. Given a collection of points in a metric space, the goal is to partition them into $k$ clusters, each with an associated center, so as to minimize the sum of squared distances of points to their cluster centers. In this paper, we present a polynomial-time $3+2\\sqrt{2}+\\epsilon<5.83$-approximation algorithm for $k$-Means in general metrics. This substantially improves on the","authors_text":"Ernest van Wijland, Euiwoong Lee, Fabrizio Grandoni, Moses Charikar, Ruiquan Gao, Vincent Cohen-Addad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T23:05:27Z","title":"An Improved Greedy Approximation for (Metric) $k$-Means"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29165","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:12b4524e785367af6b07690cb401201dab7c5aa8436355a0bdfb2e44ae122d42","target":"record","created_at":"2026-05-29T01:05:22Z","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":"4ee12816f76d60da4a3403468435bc3c6619ab72d815e04f473a430484693028","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T23:05:27Z","title_canon_sha256":"3cbbb735ae05c2c4caea3a9cba4e3c7f991ffa69f9b811504a80dc522687a637"},"schema_version":"1.0","source":{"id":"2605.29165","kind":"arxiv","version":1}},"canonical_sha256":"b712a5e39cf6772e0819446a42ee98a6e98ec0a684247493464258b5cfabc3b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b712a5e39cf6772e0819446a42ee98a6e98ec0a684247493464258b5cfabc3b5","first_computed_at":"2026-05-29T01:05:22.021434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T01:05:22.021434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0WOVRYhRlwnUOj5SfJ8atz5joExJlXW3zIG/fflYvfe0hApsvUajYBJzBe1jUb9pFtv4CcorFnv50qwxR/8WBg==","signature_status":"signed_v1","signed_at":"2026-05-29T01:05:22.022236Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.29165","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12b4524e785367af6b07690cb401201dab7c5aa8436355a0bdfb2e44ae122d42","sha256:e0d51e3f8479f0599205271058babb939368fda3dc23d4b4a3e06a785b684110"],"state_sha256":"c30716914cea6662602c2a86f880b445ffbf41f8db764b376179cccdec32dcb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JmZsQLSdL7Uh4yfTn+53g1GxCMNvWOr9xHI/er/AGe1KIDjlwmOi/7AEs23y2z/QYLcpXVqhezBjczvn27p5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:17:23.576829Z","bundle_sha256":"108099975494900fddfd1eada2a881db7b173a45044a21ad0e7c5097814d2856"}}