{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N4NIE4AUQACGTG5LPSZT2MMHFH","short_pith_number":"pith:N4NIE4AU","schema_version":"1.0","canonical_sha256":"6f1a8270148004699bab7cb33d318729dd076ceb98ffbce6661c3e24faf13f81","source":{"kind":"arxiv","id":"1702.07435","version":1},"attestation_state":"computed","paper":{"title":"Capacitated Center Problems with Two-Sided Bounds and Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hu Ding, Jian Li, Lingxiao Huang, Lunjia Hu","submitted_at":"2017-02-24T01:28:11Z","abstract_excerpt":"In recent years, the capacitated center problems have attracted a lot of research interest. Given a set of vertices $V$, we want to find a subset of vertices $S$, called centers, such that the maximum cluster radius is minimized. Moreover, each center in $S$ should satisfy some capacity constraint, which could be an upper or lower bound on the number of vertices it can serve. Capacitated $k$-center problems with one-sided bounds (upper or lower) have been well studied in previous work, and a constant factor approximation was obtained.\n  We are the first to study the capacitated center problem "},"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":"1702.07435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T01:28:11Z","cross_cats_sorted":[],"title_canon_sha256":"ef73a081b7a44c30d7feabb0a7dc5dc9685858b498d8b6e9596e0919178b5f25","abstract_canon_sha256":"7247da9c9baca284ce081c8ab66d81df03c4f453fb8b210c33db1fc2af8e0bc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:03.370616Z","signature_b64":"/iBYVjWtVtJk/QD6npCf+zNc9XKDQrboV2n/DctEyf17yOEn+17KnWzu8rJFabG1rjvTOq6+Sd798ZTYnBZsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f1a8270148004699bab7cb33d318729dd076ceb98ffbce6661c3e24faf13f81","last_reissued_at":"2026-05-18T00:50:03.369886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:03.369886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacitated Center Problems with Two-Sided Bounds and Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hu Ding, Jian Li, Lingxiao Huang, Lunjia Hu","submitted_at":"2017-02-24T01:28:11Z","abstract_excerpt":"In recent years, the capacitated center problems have attracted a lot of research interest. Given a set of vertices $V$, we want to find a subset of vertices $S$, called centers, such that the maximum cluster radius is minimized. Moreover, each center in $S$ should satisfy some capacity constraint, which could be an upper or lower bound on the number of vertices it can serve. Capacitated $k$-center problems with one-sided bounds (upper or lower) have been well studied in previous work, and a constant factor approximation was obtained.\n  We are the first to study the capacitated center problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07435","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":"1702.07435","created_at":"2026-05-18T00:50:03.370002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07435v1","created_at":"2026-05-18T00:50:03.370002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07435","created_at":"2026-05-18T00:50:03.370002+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4NIE4AUQACG","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4NIE4AUQACGTG5L","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4NIE4AU","created_at":"2026-05-18T12:31:31.346846+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/N4NIE4AUQACGTG5LPSZT2MMHFH","json":"https://pith.science/pith/N4NIE4AUQACGTG5LPSZT2MMHFH.json","graph_json":"https://pith.science/api/pith-number/N4NIE4AUQACGTG5LPSZT2MMHFH/graph.json","events_json":"https://pith.science/api/pith-number/N4NIE4AUQACGTG5LPSZT2MMHFH/events.json","paper":"https://pith.science/paper/N4NIE4AU"},"agent_actions":{"view_html":"https://pith.science/pith/N4NIE4AUQACGTG5LPSZT2MMHFH","download_json":"https://pith.science/pith/N4NIE4AUQACGTG5LPSZT2MMHFH.json","view_paper":"https://pith.science/paper/N4NIE4AU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07435&json=true","fetch_graph":"https://pith.science/api/pith-number/N4NIE4AUQACGTG5LPSZT2MMHFH/graph.json","fetch_events":"https://pith.science/api/pith-number/N4NIE4AUQACGTG5LPSZT2MMHFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4NIE4AUQACGTG5LPSZT2MMHFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4NIE4AUQACGTG5LPSZT2MMHFH/action/storage_attestation","attest_author":"https://pith.science/pith/N4NIE4AUQACGTG5LPSZT2MMHFH/action/author_attestation","sign_citation":"https://pith.science/pith/N4NIE4AUQACGTG5LPSZT2MMHFH/action/citation_signature","submit_replication":"https://pith.science/pith/N4NIE4AUQACGTG5LPSZT2MMHFH/action/replication_record"}},"created_at":"2026-05-18T00:50:03.370002+00:00","updated_at":"2026-05-18T00:50:03.370002+00:00"}