{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:E7MMA7CQDURCUDX65SMVN2R6ED","short_pith_number":"pith:E7MMA7CQ","schema_version":"1.0","canonical_sha256":"27d8c07c501d222a0efeec9956ea3e20f096c02d65e90706c1aaef3c7a9b1268","source":{"kind":"arxiv","id":"1901.04628","version":3},"attestation_state":"computed","paper":{"title":"A constant FPT approximation algorithm for hard-capacitated k-means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Dachuan Xu, Rolf H. M\\\"ohring, Yicheng Xu, Yifei Zou, Yong Zhang","submitted_at":"2019-01-15T01:30:19Z","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"},"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":"1901.04628","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-15T01:30:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9b4d9f23e3326c2f288b95f2d6baab330be06123d3bbce1a2ac2697448c7a630","abstract_canon_sha256":"53b37ed56edc587de299b3c0d4b2a515184b64f03c59ba3b78b0ca8d6305dba0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:26.600913Z","signature_b64":"9/W20YcbdXjuJUQeys+tecQWlMI9N/2Aiokm4+o81PJE4sqhD16mkJrheVJ3IZKbqy69gpDSiVPHvxvNqPvDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d8c07c501d222a0efeec9956ea3e20f096c02d65e90706c1aaef3c7a9b1268","last_reissued_at":"2026-05-17T23:47:26.600409Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:26.600409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A constant FPT approximation algorithm for hard-capacitated k-means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Dachuan Xu, Rolf H. M\\\"ohring, Yicheng Xu, Yifei Zou, Yong Zhang","submitted_at":"2019-01-15T01:30:19Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04628","kind":"arxiv","version":3},"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":"1901.04628","created_at":"2026-05-17T23:47:26.600491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.04628v3","created_at":"2026-05-17T23:47:26.600491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04628","created_at":"2026-05-17T23:47:26.600491+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7MMA7CQDURC","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7MMA7CQDURCUDX6","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7MMA7CQ","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2512.04614","citing_title":"On Tight FPT Time Approximation Algorithms for k-Clustering Problems","ref_index":59,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E7MMA7CQDURCUDX65SMVN2R6ED","json":"https://pith.science/pith/E7MMA7CQDURCUDX65SMVN2R6ED.json","graph_json":"https://pith.science/api/pith-number/E7MMA7CQDURCUDX65SMVN2R6ED/graph.json","events_json":"https://pith.science/api/pith-number/E7MMA7CQDURCUDX65SMVN2R6ED/events.json","paper":"https://pith.science/paper/E7MMA7CQ"},"agent_actions":{"view_html":"https://pith.science/pith/E7MMA7CQDURCUDX65SMVN2R6ED","download_json":"https://pith.science/pith/E7MMA7CQDURCUDX65SMVN2R6ED.json","view_paper":"https://pith.science/paper/E7MMA7CQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.04628&json=true","fetch_graph":"https://pith.science/api/pith-number/E7MMA7CQDURCUDX65SMVN2R6ED/graph.json","fetch_events":"https://pith.science/api/pith-number/E7MMA7CQDURCUDX65SMVN2R6ED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7MMA7CQDURCUDX65SMVN2R6ED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7MMA7CQDURCUDX65SMVN2R6ED/action/storage_attestation","attest_author":"https://pith.science/pith/E7MMA7CQDURCUDX65SMVN2R6ED/action/author_attestation","sign_citation":"https://pith.science/pith/E7MMA7CQDURCUDX65SMVN2R6ED/action/citation_signature","submit_replication":"https://pith.science/pith/E7MMA7CQDURCUDX65SMVN2R6ED/action/replication_record"}},"created_at":"2026-05-17T23:47:26.600491+00:00","updated_at":"2026-05-17T23:47:26.600491+00:00"}