{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KHT7BUYJGWB7RWJ3CB4RKEY7IJ","short_pith_number":"pith:KHT7BUYJ","schema_version":"1.0","canonical_sha256":"51e7f0d3093583f8d93b107915131f426df867a0da33b3163f8b66837db84345","source":{"kind":"arxiv","id":"1208.3054","version":1},"attestation_state":"computed","paper":{"title":"LP Rounding for k-Centers with Non-uniform Hard Capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller","submitted_at":"2012-08-15T08:20:10Z","abstract_excerpt":"In this paper we consider a generalization of the classical k-center problem with capacities. Our goal is to select k centers in a graph, and assign each node to a nearby center, so that we respect the capacity constraints on centers. The objective is to minimize the maximum distance a node has to travel to get to its assigned center. This problem is NP-hard, even when centers have no capacity restrictions and optimal factor 2 approximation algorithms are known. With capacities, when all centers have identical capacities, a 6 approximation is known with no better lower bounds than for the infi"},"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":"1208.3054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-15T08:20:10Z","cross_cats_sorted":[],"title_canon_sha256":"bbbd7b5a25ce933b7f1c770d4cd98ca542c413a2d4b7d9f643e0aafbf028d492","abstract_canon_sha256":"dc37ad275b165ae165c0640d374e4e826994a03d81ef9f164fa5f66075de0c70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:45.721385Z","signature_b64":"opyTAnJlJjJmpf0pSuvKIpJRaWr5gh0W7WpKMCtdsSmwP9o20TTcz52E6i/m5AGy8Z5lzmLozm86mAQPkANyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51e7f0d3093583f8d93b107915131f426df867a0da33b3163f8b66837db84345","last_reissued_at":"2026-05-18T03:48:45.720506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:45.720506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LP Rounding for k-Centers with Non-uniform Hard Capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller","submitted_at":"2012-08-15T08:20:10Z","abstract_excerpt":"In this paper we consider a generalization of the classical k-center problem with capacities. Our goal is to select k centers in a graph, and assign each node to a nearby center, so that we respect the capacity constraints on centers. The objective is to minimize the maximum distance a node has to travel to get to its assigned center. This problem is NP-hard, even when centers have no capacity restrictions and optimal factor 2 approximation algorithms are known. With capacities, when all centers have identical capacities, a 6 approximation is known with no better lower bounds than for the infi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3054","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":"1208.3054","created_at":"2026-05-18T03:48:45.720657+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.3054v1","created_at":"2026-05-18T03:48:45.720657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3054","created_at":"2026-05-18T03:48:45.720657+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHT7BUYJGWB7","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHT7BUYJGWB7RWJ3","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHT7BUYJ","created_at":"2026-05-18T12:27:11.947152+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/KHT7BUYJGWB7RWJ3CB4RKEY7IJ","json":"https://pith.science/pith/KHT7BUYJGWB7RWJ3CB4RKEY7IJ.json","graph_json":"https://pith.science/api/pith-number/KHT7BUYJGWB7RWJ3CB4RKEY7IJ/graph.json","events_json":"https://pith.science/api/pith-number/KHT7BUYJGWB7RWJ3CB4RKEY7IJ/events.json","paper":"https://pith.science/paper/KHT7BUYJ"},"agent_actions":{"view_html":"https://pith.science/pith/KHT7BUYJGWB7RWJ3CB4RKEY7IJ","download_json":"https://pith.science/pith/KHT7BUYJGWB7RWJ3CB4RKEY7IJ.json","view_paper":"https://pith.science/paper/KHT7BUYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.3054&json=true","fetch_graph":"https://pith.science/api/pith-number/KHT7BUYJGWB7RWJ3CB4RKEY7IJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KHT7BUYJGWB7RWJ3CB4RKEY7IJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHT7BUYJGWB7RWJ3CB4RKEY7IJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHT7BUYJGWB7RWJ3CB4RKEY7IJ/action/storage_attestation","attest_author":"https://pith.science/pith/KHT7BUYJGWB7RWJ3CB4RKEY7IJ/action/author_attestation","sign_citation":"https://pith.science/pith/KHT7BUYJGWB7RWJ3CB4RKEY7IJ/action/citation_signature","submit_replication":"https://pith.science/pith/KHT7BUYJGWB7RWJ3CB4RKEY7IJ/action/replication_record"}},"created_at":"2026-05-18T03:48:45.720657+00:00","updated_at":"2026-05-18T03:48:45.720657+00:00"}