{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4M6M7IXDYL5OA2GUEW2YJTNIE4","short_pith_number":"pith:4M6M7IXD","schema_version":"1.0","canonical_sha256":"e33ccfa2e3c2fae068d425b584cda827367b62ff0b2325191516c0472c7fdc21","source":{"kind":"arxiv","id":"2507.14089","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Vincent Cohen-Addad, Zahra Parsaeian","submitted_at":"2025-07-18T17:13:36Z","abstract_excerpt":"In this paper, we present an efficient massively parallel approximation algorithm for the $k$-means problem. Specifically, we provide an MPC algorithm that computes a constant-factor approximation to an arbitrary $k$-means instance in $O(\\log\\log n \\cdot \\log\\log\\log n)$ rounds. The algorithm uses $O(n^\\sigma)$ bits of memory per machine, where $\\sigma > 0$ is a constant that can be made arbitrarily small. The global memory usage is $O(n^{1+\\varepsilon})$ bits for an arbitrarily small constant $\\varepsilon > 0$, and is thus only slightly superlinear. Recently, Czumaj, Gao, Jiang, Krauthgamer, "},"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":"2507.14089","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-18T17:13:36Z","cross_cats_sorted":[],"title_canon_sha256":"f24ff0bf540a8d3eb6d40a1518eae7662838e00bef3b661c19a875fc0052d19a","abstract_canon_sha256":"a6af7326c9296c259f626e47a0919fa3fdf321c3bc7446b2a8a585f7c973d6c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:28.584968Z","signature_b64":"Pe+cUhkI5rTbFDUCP42UcrDx64N3idwjV2GLrlEJwt3DQex7VCZUJ9j4sRXzpDQPnoGgtfdmxp9eu7x8y8GQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e33ccfa2e3c2fae068d425b584cda827367b62ff0b2325191516c0472c7fdc21","last_reissued_at":"2026-07-05T11:39:28.584465Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:28.584465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Vincent Cohen-Addad, Zahra Parsaeian","submitted_at":"2025-07-18T17:13:36Z","abstract_excerpt":"In this paper, we present an efficient massively parallel approximation algorithm for the $k$-means problem. Specifically, we provide an MPC algorithm that computes a constant-factor approximation to an arbitrary $k$-means instance in $O(\\log\\log n \\cdot \\log\\log\\log n)$ rounds. The algorithm uses $O(n^\\sigma)$ bits of memory per machine, where $\\sigma > 0$ is a constant that can be made arbitrarily small. The global memory usage is $O(n^{1+\\varepsilon})$ bits for an arbitrarily small constant $\\varepsilon > 0$, and is thus only slightly superlinear. Recently, Czumaj, Gao, Jiang, Krauthgamer, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.14089","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/2507.14089/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.14089","created_at":"2026-07-05T11:39:28.584521+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.14089v1","created_at":"2026-07-05T11:39:28.584521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.14089","created_at":"2026-07-05T11:39:28.584521+00:00"},{"alias_kind":"pith_short_12","alias_value":"4M6M7IXDYL5O","created_at":"2026-07-05T11:39:28.584521+00:00"},{"alias_kind":"pith_short_16","alias_value":"4M6M7IXDYL5OA2GU","created_at":"2026-07-05T11:39:28.584521+00:00"},{"alias_kind":"pith_short_8","alias_value":"4M6M7IXD","created_at":"2026-07-05T11:39:28.584521+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/4M6M7IXDYL5OA2GUEW2YJTNIE4","json":"https://pith.science/pith/4M6M7IXDYL5OA2GUEW2YJTNIE4.json","graph_json":"https://pith.science/api/pith-number/4M6M7IXDYL5OA2GUEW2YJTNIE4/graph.json","events_json":"https://pith.science/api/pith-number/4M6M7IXDYL5OA2GUEW2YJTNIE4/events.json","paper":"https://pith.science/paper/4M6M7IXD"},"agent_actions":{"view_html":"https://pith.science/pith/4M6M7IXDYL5OA2GUEW2YJTNIE4","download_json":"https://pith.science/pith/4M6M7IXDYL5OA2GUEW2YJTNIE4.json","view_paper":"https://pith.science/paper/4M6M7IXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.14089&json=true","fetch_graph":"https://pith.science/api/pith-number/4M6M7IXDYL5OA2GUEW2YJTNIE4/graph.json","fetch_events":"https://pith.science/api/pith-number/4M6M7IXDYL5OA2GUEW2YJTNIE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4M6M7IXDYL5OA2GUEW2YJTNIE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4M6M7IXDYL5OA2GUEW2YJTNIE4/action/storage_attestation","attest_author":"https://pith.science/pith/4M6M7IXDYL5OA2GUEW2YJTNIE4/action/author_attestation","sign_citation":"https://pith.science/pith/4M6M7IXDYL5OA2GUEW2YJTNIE4/action/citation_signature","submit_replication":"https://pith.science/pith/4M6M7IXDYL5OA2GUEW2YJTNIE4/action/replication_record"}},"created_at":"2026-07-05T11:39:28.584521+00:00","updated_at":"2026-07-05T11:39:28.584521+00:00"}