{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4M6M7IXDYL5OA2GUEW2YJTNIE4","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":"a6af7326c9296c259f626e47a0919fa3fdf321c3bc7446b2a8a585f7c973d6c1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-18T17:13:36Z","title_canon_sha256":"f24ff0bf540a8d3eb6d40a1518eae7662838e00bef3b661c19a875fc0052d19a"},"schema_version":"1.0","source":{"id":"2507.14089","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.14089","created_at":"2026-07-05T11:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"2507.14089v1","created_at":"2026-07-05T11:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.14089","created_at":"2026-07-05T11:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"4M6M7IXDYL5O","created_at":"2026-07-05T11:39:28Z"},{"alias_kind":"pith_short_16","alias_value":"4M6M7IXDYL5OA2GU","created_at":"2026-07-05T11:39:28Z"},{"alias_kind":"pith_short_8","alias_value":"4M6M7IXD","created_at":"2026-07-05T11:39:28Z"}],"graph_snapshots":[{"event_id":"sha256:4d74691c5f54d40b0fdeef18bec657466ca66e5a9ffb50adc0a5d5d48afb6cb8","target":"graph","created_at":"2026-07-05T11:39:28Z","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/2507.14089/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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, ","authors_text":"Fabian Kuhn, Vincent Cohen-Addad, Zahra Parsaeian","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-18T17:13:36Z","title":"An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.14089","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:488e3f03de7ebc5205c11378f52af5df48e12fb91dc2dacae7b18847a8821084","target":"record","created_at":"2026-07-05T11:39:28Z","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":"a6af7326c9296c259f626e47a0919fa3fdf321c3bc7446b2a8a585f7c973d6c1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-18T17:13:36Z","title_canon_sha256":"f24ff0bf540a8d3eb6d40a1518eae7662838e00bef3b661c19a875fc0052d19a"},"schema_version":"1.0","source":{"id":"2507.14089","kind":"arxiv","version":1}},"canonical_sha256":"e33ccfa2e3c2fae068d425b584cda827367b62ff0b2325191516c0472c7fdc21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e33ccfa2e3c2fae068d425b584cda827367b62ff0b2325191516c0472c7fdc21","first_computed_at":"2026-07-05T11:39:28.584465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:39:28.584465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pe+cUhkI5rTbFDUCP42UcrDx64N3idwjV2GLrlEJwt3DQex7VCZUJ9j4sRXzpDQPnoGgtfdmxp9eu7x8y8GQBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:39:28.584968Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.14089","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:488e3f03de7ebc5205c11378f52af5df48e12fb91dc2dacae7b18847a8821084","sha256:4d74691c5f54d40b0fdeef18bec657466ca66e5a9ffb50adc0a5d5d48afb6cb8"],"state_sha256":"af7683f118dd6a71d582d8550603bea42ef40c19b99fa62eb92d4dd28ec7fb0c"}