{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E7MMA7CQDURCUDX65SMVN2R6ED","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":"53b37ed56edc587de299b3c0d4b2a515184b64f03c59ba3b78b0ca8d6305dba0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-15T01:30:19Z","title_canon_sha256":"9b4d9f23e3326c2f288b95f2d6baab330be06123d3bbce1a2ac2697448c7a630"},"schema_version":"1.0","source":{"id":"1901.04628","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04628","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04628v3","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04628","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"pith_short_12","alias_value":"E7MMA7CQDURC","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E7MMA7CQDURCUDX6","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E7MMA7CQ","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:cce1e88935ef928b1f2c76c3cffa16850f5aaa9d7f8da8774316113a37f6eec4","target":"graph","created_at":"2026-05-17T23:47:26Z","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":"Hard-capacitated $k$-means (HCKM) is one of the fundamental problems remaining open in combinatorial optimization and data mining areas. In this problem, one is required to partition a given $n$-point set into $k$ disjoint clusters with known capacity so as to minimize the sum of within-cluster variances. It is known to be at least APX-hard and for which most of the work is from a meta heuristic perspective. To the best our knowledge, no constant approximation algorithm or existence proof of such an algorithm is known. As our main contribution, we propose an FPT($k$) algorithm with performance","authors_text":"Dachuan Xu, Rolf H. M\\\"ohring, Yicheng Xu, Yifei Zou, Yong Zhang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-15T01:30:19Z","title":"A constant FPT approximation algorithm for hard-capacitated k-means"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04628","kind":"arxiv","version":3},"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:64edb056826c291fc1f22b1c1a2091c9f49af96560a20c4265d164dc577ea968","target":"record","created_at":"2026-05-17T23:47:26Z","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":"53b37ed56edc587de299b3c0d4b2a515184b64f03c59ba3b78b0ca8d6305dba0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-15T01:30:19Z","title_canon_sha256":"9b4d9f23e3326c2f288b95f2d6baab330be06123d3bbce1a2ac2697448c7a630"},"schema_version":"1.0","source":{"id":"1901.04628","kind":"arxiv","version":3}},"canonical_sha256":"27d8c07c501d222a0efeec9956ea3e20f096c02d65e90706c1aaef3c7a9b1268","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27d8c07c501d222a0efeec9956ea3e20f096c02d65e90706c1aaef3c7a9b1268","first_computed_at":"2026-05-17T23:47:26.600409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:26.600409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9/W20YcbdXjuJUQeys+tecQWlMI9N/2Aiokm4+o81PJE4sqhD16mkJrheVJ3IZKbqy69gpDSiVPHvxvNqPvDDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:26.600913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.04628","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64edb056826c291fc1f22b1c1a2091c9f49af96560a20c4265d164dc577ea968","sha256:cce1e88935ef928b1f2c76c3cffa16850f5aaa9d7f8da8774316113a37f6eec4"],"state_sha256":"a8e97c1cb09254af63d840e6fab8c9f1ce637f5837c132acf90289b4173c3189"}