{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EVLKGQEK76UUZYY5QA5DKCXHAR","short_pith_number":"pith:EVLKGQEK","schema_version":"1.0","canonical_sha256":"2556a3408affa94ce31d803a350ae70443007f437867c9878240193f58830485","source":{"kind":"arxiv","id":"1611.07414","version":1},"attestation_state":"computed","paper":{"title":"The Heterogeneous Capacitated $k$-Center Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Deeparnab Chakrabarty, Ravishankar Krishnaswamy","submitted_at":"2016-11-22T16:57:49Z","abstract_excerpt":"In this paper we initiate the study of the heterogeneous capacitated $k$-center problem: given a metric space $X = (F \\cup C, d)$, and a collection of capacities. The goal is to open each capacity at a unique facility location in $F$, and also to assign clients to facilities so that the number of clients assigned to any facility is at most the capacity installed; the objective is then to minimize the maximum distance between a client and its assigned facility. If all the capacities $c_i$'s are identical, the problem becomes the well-studied uniform capacitated $k$-center problem for which cons"},"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":"1611.07414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-22T16:57:49Z","cross_cats_sorted":[],"title_canon_sha256":"162934102b2b89be06fa1ac50c762d2f8cd2c271f73c8028470a950a26e6b264","abstract_canon_sha256":"4239b60fa68bc233a136a2d82457741c76002730df91b69589230f7598b57496"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:20.181383Z","signature_b64":"mjIM6gVM0xEVq/j+T7cXOQEk2FLLGZOzaj7YUoGzd1pYPNiyiN/JJBU6sM8BqelK/MEJIimWg/lbVRd9KkKOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2556a3408affa94ce31d803a350ae70443007f437867c9878240193f58830485","last_reissued_at":"2026-05-18T00:57:20.180840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:20.180840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Heterogeneous Capacitated $k$-Center Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Deeparnab Chakrabarty, Ravishankar Krishnaswamy","submitted_at":"2016-11-22T16:57:49Z","abstract_excerpt":"In this paper we initiate the study of the heterogeneous capacitated $k$-center problem: given a metric space $X = (F \\cup C, d)$, and a collection of capacities. The goal is to open each capacity at a unique facility location in $F$, and also to assign clients to facilities so that the number of clients assigned to any facility is at most the capacity installed; the objective is then to minimize the maximum distance between a client and its assigned facility. If all the capacities $c_i$'s are identical, the problem becomes the well-studied uniform capacitated $k$-center problem for which cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07414","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":"1611.07414","created_at":"2026-05-18T00:57:20.180930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07414v1","created_at":"2026-05-18T00:57:20.180930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07414","created_at":"2026-05-18T00:57:20.180930+00:00"},{"alias_kind":"pith_short_12","alias_value":"EVLKGQEK76UU","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"EVLKGQEK76UUZYY5","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"EVLKGQEK","created_at":"2026-05-18T12:30:15.759754+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/EVLKGQEK76UUZYY5QA5DKCXHAR","json":"https://pith.science/pith/EVLKGQEK76UUZYY5QA5DKCXHAR.json","graph_json":"https://pith.science/api/pith-number/EVLKGQEK76UUZYY5QA5DKCXHAR/graph.json","events_json":"https://pith.science/api/pith-number/EVLKGQEK76UUZYY5QA5DKCXHAR/events.json","paper":"https://pith.science/paper/EVLKGQEK"},"agent_actions":{"view_html":"https://pith.science/pith/EVLKGQEK76UUZYY5QA5DKCXHAR","download_json":"https://pith.science/pith/EVLKGQEK76UUZYY5QA5DKCXHAR.json","view_paper":"https://pith.science/paper/EVLKGQEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07414&json=true","fetch_graph":"https://pith.science/api/pith-number/EVLKGQEK76UUZYY5QA5DKCXHAR/graph.json","fetch_events":"https://pith.science/api/pith-number/EVLKGQEK76UUZYY5QA5DKCXHAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EVLKGQEK76UUZYY5QA5DKCXHAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EVLKGQEK76UUZYY5QA5DKCXHAR/action/storage_attestation","attest_author":"https://pith.science/pith/EVLKGQEK76UUZYY5QA5DKCXHAR/action/author_attestation","sign_citation":"https://pith.science/pith/EVLKGQEK76UUZYY5QA5DKCXHAR/action/citation_signature","submit_replication":"https://pith.science/pith/EVLKGQEK76UUZYY5QA5DKCXHAR/action/replication_record"}},"created_at":"2026-05-18T00:57:20.180930+00:00","updated_at":"2026-05-18T00:57:20.180930+00:00"}