{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TJN2TP4BEQYIKJRJQVVUEDOBFZ","short_pith_number":"pith:TJN2TP4B","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"},"canonical_sha256":"9a5ba9bf812430852629856b420dc12e61f560fe23d96a4e8510d1098ff076fd","source":{"kind":"arxiv","id":"1308.4004","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4004","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4004v2","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4004","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"pith_short_12","alias_value":"TJN2TP4BEQYI","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TJN2TP4BEQYIKJRJ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TJN2TP4B","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TJN2TP4BEQYIKJRJQVVUEDOBFZ","target":"record","payload":{"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"},"canonical_sha256":"9a5ba9bf812430852629856b420dc12e61f560fe23d96a4e8510d1098ff076fd","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"},"source_kind":"arxiv","source_id":"1308.4004","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJltUkJpllVHXnYJl37VdJuFK80Z5e+repFxHpmIKs0QeFzLiDkNZAFmk1abe1ivezQoepMInqYnELjPqExJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:08:29.907463Z"},"content_sha256":"01a431bc800822449682e18ab6ed925a15d2db86fc5add12e49d52cb52bff843","schema_version":"1.0","event_id":"sha256:01a431bc800822449682e18ab6ed925a15d2db86fc5add12e49d52cb52bff843"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TJN2TP4BEQYIKJRJQVVUEDOBFZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q0LrVpOELtk6WlO0bdfb/pwK9IR2B155nepgS84WM3DCC7ZlB/IvuUOOFgXoaFgwGA1tZRJ8NqwsyfEkVPV3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:08:29.908036Z"},"content_sha256":"3ae72bfcf4ef7d65d719227094869beb6e3097db76364066959639d6e722e0e1","schema_version":"1.0","event_id":"sha256:3ae72bfcf4ef7d65d719227094869beb6e3097db76364066959639d6e722e0e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ/bundle.json","state_url":"https://pith.science/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T14:08:29Z","links":{"resolver":"https://pith.science/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ","bundle":"https://pith.science/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ/bundle.json","state":"https://pith.science/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJN2TP4BEQYIKJRJQVVUEDOBFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TJN2TP4BEQYIKJRJQVVUEDOBFZ","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":"3dd39eb0f81c96ce42da961957aa29c2685dbe31233dd94263cd80292592acf6","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-19T12:46:33Z","title_canon_sha256":"340237347be3f77a03db7469d817f46013be4d4f220f6ed7f4024cb48f5b199b"},"schema_version":"1.0","source":{"id":"1308.4004","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4004","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4004v2","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4004","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"pith_short_12","alias_value":"TJN2TP4BEQYI","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TJN2TP4BEQYIKJRJ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TJN2TP4B","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:3ae72bfcf4ef7d65d719227094869beb6e3097db76364066959639d6e722e0e1","target":"graph","created_at":"2026-05-18T01:10:00Z","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":"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","authors_text":"Andreas Brieden, Peter Gritzmann, Steffen Borgwardt","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-19T12:46:33Z","title":"A balanced k-means algorithm for weighted point sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4004","kind":"arxiv","version":2},"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:01a431bc800822449682e18ab6ed925a15d2db86fc5add12e49d52cb52bff843","target":"record","created_at":"2026-05-18T01:10:00Z","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":"3dd39eb0f81c96ce42da961957aa29c2685dbe31233dd94263cd80292592acf6","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-19T12:46:33Z","title_canon_sha256":"340237347be3f77a03db7469d817f46013be4d4f220f6ed7f4024cb48f5b199b"},"schema_version":"1.0","source":{"id":"1308.4004","kind":"arxiv","version":2}},"canonical_sha256":"9a5ba9bf812430852629856b420dc12e61f560fe23d96a4e8510d1098ff076fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a5ba9bf812430852629856b420dc12e61f560fe23d96a4e8510d1098ff076fd","first_computed_at":"2026-05-18T01:10:00.291926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:00.291926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G6qyRjaYHlpP6NRejY5xR+Sh5ZSs2JVwA/LLFZeZnLGKLhTdTGX1valVWeLb0A2QRd3lM2jrh4ZFQTgWLVquBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:00.292661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4004","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01a431bc800822449682e18ab6ed925a15d2db86fc5add12e49d52cb52bff843","sha256:3ae72bfcf4ef7d65d719227094869beb6e3097db76364066959639d6e722e0e1"],"state_sha256":"d41a46e34a6c39129e839e55f2767014e25ca9938c19342ce58405a142e6bc9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAu/ncUSYVHVMxvfmPPfimP+stR7uQhwuXYlFi8VshFJwkO/cyybn25g40hNcQrSEBtcawVgl+cbPuWq5SpCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T14:08:29.912298Z","bundle_sha256":"bd703c99afbb1b3cfdfd8a73afc2187dd716d703eb4ad84c533955dcdc1490e0"}}