{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZW6QQJA4VMEKK3HZB7VL7WRIHU","short_pith_number":"pith:ZW6QQJA4","schema_version":"1.0","canonical_sha256":"cdbd08241cab08a56cf90feabfda283d147969c519936979a75fb549a96a5117","source":{"kind":"arxiv","id":"1704.02515","version":1},"attestation_state":"computed","paper":{"title":"Balanced $k$-Center Clustering When $k$ Is A Constant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hu Ding","submitted_at":"2017-04-08T17:30:26Z","abstract_excerpt":"The problem of constrained $k$-center clustering has attracted significant attention in the past decades. In this paper, we study balanced $k$-center cluster where the size of each cluster is constrained by the given lower and upper bounds. The problem is motivated by the applications in processing and analyzing large-scale data in high dimension. We provide a simple nearly linear time $4$-approximation algorithm when the number of clusters $k$ is assumed to be a constant. Comparing with existing method, our algorithm improves the approximation ratio and significantly reduces the time complexi"},"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":"1704.02515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-08T17:30:26Z","cross_cats_sorted":[],"title_canon_sha256":"e703ced153ba498bb0c79af42eff1d978b03622f3ef1052f9ca7de1b46682583","abstract_canon_sha256":"e7ff9cf27edd951911f4cf3dcea3f9d5bec302db3fd4aefe123736b56955919e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:45.263617Z","signature_b64":"v7Ghuykkog5APou057W2LS/SPO8gBcTxuNXPBw+BK55nNL8QTKLXFjX+Ldc3v23oi2jzzJ49R4s4tyDjzWa2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdbd08241cab08a56cf90feabfda283d147969c519936979a75fb549a96a5117","last_reissued_at":"2026-05-18T00:46:45.262896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:45.262896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balanced $k$-Center Clustering When $k$ Is A Constant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hu Ding","submitted_at":"2017-04-08T17:30:26Z","abstract_excerpt":"The problem of constrained $k$-center clustering has attracted significant attention in the past decades. In this paper, we study balanced $k$-center cluster where the size of each cluster is constrained by the given lower and upper bounds. The problem is motivated by the applications in processing and analyzing large-scale data in high dimension. We provide a simple nearly linear time $4$-approximation algorithm when the number of clusters $k$ is assumed to be a constant. Comparing with existing method, our algorithm improves the approximation ratio and significantly reduces the time complexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02515","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":"1704.02515","created_at":"2026-05-18T00:46:45.263008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02515v1","created_at":"2026-05-18T00:46:45.263008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02515","created_at":"2026-05-18T00:46:45.263008+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZW6QQJA4VMEK","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZW6QQJA4VMEKK3HZ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZW6QQJA4","created_at":"2026-05-18T12:31:59.375834+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/ZW6QQJA4VMEKK3HZB7VL7WRIHU","json":"https://pith.science/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU.json","graph_json":"https://pith.science/api/pith-number/ZW6QQJA4VMEKK3HZB7VL7WRIHU/graph.json","events_json":"https://pith.science/api/pith-number/ZW6QQJA4VMEKK3HZB7VL7WRIHU/events.json","paper":"https://pith.science/paper/ZW6QQJA4"},"agent_actions":{"view_html":"https://pith.science/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU","download_json":"https://pith.science/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU.json","view_paper":"https://pith.science/paper/ZW6QQJA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02515&json=true","fetch_graph":"https://pith.science/api/pith-number/ZW6QQJA4VMEKK3HZB7VL7WRIHU/graph.json","fetch_events":"https://pith.science/api/pith-number/ZW6QQJA4VMEKK3HZB7VL7WRIHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU/action/storage_attestation","attest_author":"https://pith.science/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU/action/author_attestation","sign_citation":"https://pith.science/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU/action/citation_signature","submit_replication":"https://pith.science/pith/ZW6QQJA4VMEKK3HZB7VL7WRIHU/action/replication_record"}},"created_at":"2026-05-18T00:46:45.263008+00:00","updated_at":"2026-05-18T00:46:45.263008+00:00"}