{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WJBSFSQKGT7HIWB7JISY33RGKZ","short_pith_number":"pith:WJBSFSQK","schema_version":"1.0","canonical_sha256":"b24322ca0a34fe74583f4a258dee265663bf0a8c024e1fd94c4d1d9efe2da5fa","source":{"kind":"arxiv","id":"1707.05170","version":2},"attestation_state":"computed","paper":{"title":"Capacitated Covering Problems in Geometric Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kasturi Varadarajan, Santanu Bhowmick, Sayan Bandyapadhyay, Tanmay Inamdar","submitted_at":"2017-07-17T14:04:17Z","abstract_excerpt":"In this article, we consider the following capacitated covering problem. We are given a set $P$ of $n$ points and a set $\\mathcal{B}$ of balls from some metric space, and a positive integer $U$ that represents the capacity of each of the balls in $\\mathcal{B}$. We would like to compute a subset $\\mathcal{B}' \\subseteq \\mathcal{B}$ of balls and assign each point in $P$ to some ball in $\\mathcal{B}$ that contains it, such that the number of points assigned to any ball is at most $U$. The objective function that we would like to minimize is the cardinality of $\\mathcal{B}$.\n  We consider this pro"},"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":"1707.05170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T14:04:17Z","cross_cats_sorted":[],"title_canon_sha256":"d1ac989c577135fb5da4e9e3c2a2d0b05e56e30171738a23d475345ec55e562a","abstract_canon_sha256":"fadcc04428c8b720904343aef3a2367c40bbf3e4a92cb46450765e84eb69610a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:15.110362Z","signature_b64":"KJTU8HPIIUbMQGrYFiU54gOM/yiwfDJohTVwSEa2Mw+Y+61mrQtAjGGGD1yL06IHt78s1Uqs8J2en9o33bFbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b24322ca0a34fe74583f4a258dee265663bf0a8c024e1fd94c4d1d9efe2da5fa","last_reissued_at":"2026-05-18T00:28:15.109761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:15.109761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacitated Covering Problems in Geometric Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kasturi Varadarajan, Santanu Bhowmick, Sayan Bandyapadhyay, Tanmay Inamdar","submitted_at":"2017-07-17T14:04:17Z","abstract_excerpt":"In this article, we consider the following capacitated covering problem. We are given a set $P$ of $n$ points and a set $\\mathcal{B}$ of balls from some metric space, and a positive integer $U$ that represents the capacity of each of the balls in $\\mathcal{B}$. We would like to compute a subset $\\mathcal{B}' \\subseteq \\mathcal{B}$ of balls and assign each point in $P$ to some ball in $\\mathcal{B}$ that contains it, such that the number of points assigned to any ball is at most $U$. The objective function that we would like to minimize is the cardinality of $\\mathcal{B}$.\n  We consider this pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05170","kind":"arxiv","version":2},"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":"1707.05170","created_at":"2026-05-18T00:28:15.109872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05170v2","created_at":"2026-05-18T00:28:15.109872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05170","created_at":"2026-05-18T00:28:15.109872+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJBSFSQKGT7H","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJBSFSQKGT7HIWB7","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJBSFSQK","created_at":"2026-05-18T12:31:53.515858+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/WJBSFSQKGT7HIWB7JISY33RGKZ","json":"https://pith.science/pith/WJBSFSQKGT7HIWB7JISY33RGKZ.json","graph_json":"https://pith.science/api/pith-number/WJBSFSQKGT7HIWB7JISY33RGKZ/graph.json","events_json":"https://pith.science/api/pith-number/WJBSFSQKGT7HIWB7JISY33RGKZ/events.json","paper":"https://pith.science/paper/WJBSFSQK"},"agent_actions":{"view_html":"https://pith.science/pith/WJBSFSQKGT7HIWB7JISY33RGKZ","download_json":"https://pith.science/pith/WJBSFSQKGT7HIWB7JISY33RGKZ.json","view_paper":"https://pith.science/paper/WJBSFSQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05170&json=true","fetch_graph":"https://pith.science/api/pith-number/WJBSFSQKGT7HIWB7JISY33RGKZ/graph.json","fetch_events":"https://pith.science/api/pith-number/WJBSFSQKGT7HIWB7JISY33RGKZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJBSFSQKGT7HIWB7JISY33RGKZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJBSFSQKGT7HIWB7JISY33RGKZ/action/storage_attestation","attest_author":"https://pith.science/pith/WJBSFSQKGT7HIWB7JISY33RGKZ/action/author_attestation","sign_citation":"https://pith.science/pith/WJBSFSQKGT7HIWB7JISY33RGKZ/action/citation_signature","submit_replication":"https://pith.science/pith/WJBSFSQKGT7HIWB7JISY33RGKZ/action/replication_record"}},"created_at":"2026-05-18T00:28:15.109872+00:00","updated_at":"2026-05-18T00:28:15.109872+00:00"}