{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KHT7BUYJGWB7RWJ3CB4RKEY7IJ","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":"dc37ad275b165ae165c0640d374e4e826994a03d81ef9f164fa5f66075de0c70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-15T08:20:10Z","title_canon_sha256":"bbbd7b5a25ce933b7f1c770d4cd98ca542c413a2d4b7d9f643e0aafbf028d492"},"schema_version":"1.0","source":{"id":"1208.3054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3054","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3054v1","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3054","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"KHT7BUYJGWB7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KHT7BUYJGWB7RWJ3","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KHT7BUYJ","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:68062c76aa46a3d672c21c30ca2e283e7d71e65dcaf918d13a29bbac2cb10d48","target":"graph","created_at":"2026-05-18T03:48:45Z","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":"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","authors_text":"Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-15T08:20:10Z","title":"LP Rounding for k-Centers with Non-uniform Hard Capacities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3054","kind":"arxiv","version":1},"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:1ca2e97f221361698139174445a5a43df808744c9e081f09be507a0c57b9b7d2","target":"record","created_at":"2026-05-18T03:48:45Z","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":"dc37ad275b165ae165c0640d374e4e826994a03d81ef9f164fa5f66075de0c70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-15T08:20:10Z","title_canon_sha256":"bbbd7b5a25ce933b7f1c770d4cd98ca542c413a2d4b7d9f643e0aafbf028d492"},"schema_version":"1.0","source":{"id":"1208.3054","kind":"arxiv","version":1}},"canonical_sha256":"51e7f0d3093583f8d93b107915131f426df867a0da33b3163f8b66837db84345","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51e7f0d3093583f8d93b107915131f426df867a0da33b3163f8b66837db84345","first_computed_at":"2026-05-18T03:48:45.720506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:45.720506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"opyTAnJlJjJmpf0pSuvKIpJRaWr5gh0W7WpKMCtdsSmwP9o20TTcz52E6i/m5AGy8Z5lzmLozm86mAQPkANyDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:45.721385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ca2e97f221361698139174445a5a43df808744c9e081f09be507a0c57b9b7d2","sha256:68062c76aa46a3d672c21c30ca2e283e7d71e65dcaf918d13a29bbac2cb10d48"],"state_sha256":"be0df462b40af9e5899010ba0e02138ec4f02533534edaff8674ace7da33958a"}