{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GQIRPN3EQPBFYY3WPU7YPRFWNT","short_pith_number":"pith:GQIRPN3E","schema_version":"1.0","canonical_sha256":"341117b76483c25c63767d3f87c4b66cca7fefce9cf3cbfb642c7a8618375119","source":{"kind":"arxiv","id":"1805.01208","version":1},"attestation_state":"computed","paper":{"title":"Balanced k-means for Parallel Geometric Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Charilaos Tzovas, Henning Meyerhenke, Moritz von Looz","submitted_at":"2018-05-03T10:23:45Z","abstract_excerpt":"Mesh partitioning is an indispensable tool for efficient parallel numerical simulations. Its goal is to minimize communication between the processes of a simulation while achieving load balance. Established graph-based partitioning tools yield a high solution quality; however, their scalability is limited. Geometric approaches usually scale better, but their solution quality may be unsatisfactory for `non-trivial' mesh topologies.\n  In this paper, we present a scalable version of $k$-means that is adapted to yield balanced clusters. Balanced $k$-means constitutes the core of our new partitioni"},"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":"1805.01208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-03T10:23:45Z","cross_cats_sorted":[],"title_canon_sha256":"ee4787f8ea61f6298a40c712e5007efe2cd18915f7eb41de8778c894d8d4beb4","abstract_canon_sha256":"dcb2346ecee5092d752a6930089528bf50e76b6c22c8eff0ae3a80322a02c498"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:52.201945Z","signature_b64":"Vl7vnqPQuZQYFq582IcKrbuMatVD4OaZoEZdu/IX9rFJvFWtbZNMKPXk5QSi4oRhyOkm8sFHUhbLtHJI8EFODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"341117b76483c25c63767d3f87c4b66cca7fefce9cf3cbfb642c7a8618375119","last_reissued_at":"2026-05-18T00:16:52.201237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:52.201237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balanced k-means for Parallel Geometric Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Charilaos Tzovas, Henning Meyerhenke, Moritz von Looz","submitted_at":"2018-05-03T10:23:45Z","abstract_excerpt":"Mesh partitioning is an indispensable tool for efficient parallel numerical simulations. Its goal is to minimize communication between the processes of a simulation while achieving load balance. Established graph-based partitioning tools yield a high solution quality; however, their scalability is limited. Geometric approaches usually scale better, but their solution quality may be unsatisfactory for `non-trivial' mesh topologies.\n  In this paper, we present a scalable version of $k$-means that is adapted to yield balanced clusters. Balanced $k$-means constitutes the core of our new partitioni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01208","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.01208","created_at":"2026-05-18T00:16:52.201377+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.01208v1","created_at":"2026-05-18T00:16:52.201377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01208","created_at":"2026-05-18T00:16:52.201377+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQIRPN3EQPBF","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQIRPN3EQPBFYY3W","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQIRPN3E","created_at":"2026-05-18T12:32:25.280505+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/GQIRPN3EQPBFYY3WPU7YPRFWNT","json":"https://pith.science/pith/GQIRPN3EQPBFYY3WPU7YPRFWNT.json","graph_json":"https://pith.science/api/pith-number/GQIRPN3EQPBFYY3WPU7YPRFWNT/graph.json","events_json":"https://pith.science/api/pith-number/GQIRPN3EQPBFYY3WPU7YPRFWNT/events.json","paper":"https://pith.science/paper/GQIRPN3E"},"agent_actions":{"view_html":"https://pith.science/pith/GQIRPN3EQPBFYY3WPU7YPRFWNT","download_json":"https://pith.science/pith/GQIRPN3EQPBFYY3WPU7YPRFWNT.json","view_paper":"https://pith.science/paper/GQIRPN3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.01208&json=true","fetch_graph":"https://pith.science/api/pith-number/GQIRPN3EQPBFYY3WPU7YPRFWNT/graph.json","fetch_events":"https://pith.science/api/pith-number/GQIRPN3EQPBFYY3WPU7YPRFWNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQIRPN3EQPBFYY3WPU7YPRFWNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQIRPN3EQPBFYY3WPU7YPRFWNT/action/storage_attestation","attest_author":"https://pith.science/pith/GQIRPN3EQPBFYY3WPU7YPRFWNT/action/author_attestation","sign_citation":"https://pith.science/pith/GQIRPN3EQPBFYY3WPU7YPRFWNT/action/citation_signature","submit_replication":"https://pith.science/pith/GQIRPN3EQPBFYY3WPU7YPRFWNT/action/replication_record"}},"created_at":"2026-05-18T00:16:52.201377+00:00","updated_at":"2026-05-18T00:16:52.201377+00:00"}