{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TJN2TP4BEQYIKJRJQVVUEDOBFZ","short_pith_number":"pith:TJN2TP4B","schema_version":"1.0","canonical_sha256":"9a5ba9bf812430852629856b420dc12e61f560fe23d96a4e8510d1098ff076fd","source":{"kind":"arxiv","id":"1308.4004","version":2},"attestation_state":"computed","paper":{"title":"A balanced k-means algorithm for weighted point sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Andreas Brieden, Peter Gritzmann, Steffen Borgwardt","submitted_at":"2013-08-19T12:46:33Z","abstract_excerpt":"The classical $k$-means algorithm for partitioning $n$ points in $\\mathbb{R}^d$ into $k$ clusters is one of the most popular and widely spread clustering methods. The need to respect prescribed lower bounds on the cluster sizes has been observed in many scientific and business applications.\n  In this paper, we present and analyze a generalization of $k$-means that is capable of handling weighted point sets and prescribed lower and upper bounds on the cluster sizes. We call it weight-balanced $k$-means. The key difference to existing models lies in the ability to handle the combination of weigh"},"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":"1308.4004","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-19T12:46:33Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"340237347be3f77a03db7469d817f46013be4d4f220f6ed7f4024cb48f5b199b","abstract_canon_sha256":"3dd39eb0f81c96ce42da961957aa29c2685dbe31233dd94263cd80292592acf6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:00.292661Z","signature_b64":"G6qyRjaYHlpP6NRejY5xR+Sh5ZSs2JVwA/LLFZeZnLGKLhTdTGX1valVWeLb0A2QRd3lM2jrh4ZFQTgWLVquBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a5ba9bf812430852629856b420dc12e61f560fe23d96a4e8510d1098ff076fd","last_reissued_at":"2026-05-18T01:10:00.291926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:00.291926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A balanced k-means algorithm for weighted point sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Andreas Brieden, Peter Gritzmann, Steffen Borgwardt","submitted_at":"2013-08-19T12:46:33Z","abstract_excerpt":"The classical $k$-means algorithm for partitioning $n$ points in $\\mathbb{R}^d$ into $k$ clusters is one of the most popular and widely spread clustering methods. The need to respect prescribed lower bounds on the cluster sizes has been observed in many scientific and business applications.\n  In this paper, we present and analyze a generalization of $k$-means that is capable of handling weighted point sets and prescribed lower and upper bounds on the cluster sizes. We call it weight-balanced $k$-means. The key difference to existing models lies in the ability to handle the combination of weigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4004","kind":"arxiv","version":2},"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":"1308.4004","created_at":"2026-05-18T01:10:00.292067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4004v2","created_at":"2026-05-18T01:10:00.292067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4004","created_at":"2026-05-18T01:10:00.292067+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJN2TP4BEQYI","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJN2TP4BEQYIKJRJ","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJN2TP4B","created_at":"2026-05-18T12:28:02.375192+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/TJN2TP4BEQYIKJRJQVVUEDOBFZ","json":"https://pith.science/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ.json","graph_json":"https://pith.science/api/pith-number/TJN2TP4BEQYIKJRJQVVUEDOBFZ/graph.json","events_json":"https://pith.science/api/pith-number/TJN2TP4BEQYIKJRJQVVUEDOBFZ/events.json","paper":"https://pith.science/paper/TJN2TP4B"},"agent_actions":{"view_html":"https://pith.science/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ","download_json":"https://pith.science/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ.json","view_paper":"https://pith.science/paper/TJN2TP4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4004&json=true","fetch_graph":"https://pith.science/api/pith-number/TJN2TP4BEQYIKJRJQVVUEDOBFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/TJN2TP4BEQYIKJRJQVVUEDOBFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ/action/storage_attestation","attest_author":"https://pith.science/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ/action/author_attestation","sign_citation":"https://pith.science/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ/action/citation_signature","submit_replication":"https://pith.science/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ/action/replication_record"}},"created_at":"2026-05-18T01:10:00.292067+00:00","updated_at":"2026-05-18T01:10:00.292067+00:00"}