{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MNRPKD72MRLISQU7R6NSB4B6DW","short_pith_number":"pith:MNRPKD72","schema_version":"1.0","canonical_sha256":"6362f50ffa645689429f8f9b20f03e1da91a43b86d586d417427e3a68922a0d7","source":{"kind":"arxiv","id":"1602.04152","version":3},"attestation_state":"computed","paper":{"title":"On Metric Multi-Covering Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Kasturi Varadarajan, Santanu Bhowmick, Tanmay Inamdar","submitted_at":"2016-02-12T18:34:57Z","abstract_excerpt":"In the metric multi-cover problem (MMC), we are given two point sets $Y$ (servers) and $X$ (clients) in an arbitrary metric space $(X \\cup Y, d)$, a positive integer $k$ that represents the coverage demand of each client, and a constant $\\alpha \\geq 1$. Each server can have a single ball of arbitrary radius centered on it. Each client $x \\in X$ needs to be covered by at least $k$ such balls centered on servers. The objective function that we wish to minimize is the sum of the $\\alpha$-th powers of the radii of the balls.\n  In this article, we consider the MMC problem as well as some non-trivia"},"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":"1602.04152","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-12T18:34:57Z","cross_cats_sorted":[],"title_canon_sha256":"79ec418c04f687cdd7287c08c8995e3b7fefb155f5ae27a98f720084dea9feb7","abstract_canon_sha256":"10bba7ee66a6452cbad5ee2f01657d24aded5d3dba12049033c3bd4200dce16c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:40.399080Z","signature_b64":"87VXNJhkx3MkVxiROx5VzxD/G80UNKgMS8QmjtXgeOogHtJ3tEotwjAIvDUlx6IS5SRFQw75/aaSF89PaZ+WAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6362f50ffa645689429f8f9b20f03e1da91a43b86d586d417427e3a68922a0d7","last_reissued_at":"2026-05-18T00:50:40.398335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:40.398335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Metric Multi-Covering Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Kasturi Varadarajan, Santanu Bhowmick, Tanmay Inamdar","submitted_at":"2016-02-12T18:34:57Z","abstract_excerpt":"In the metric multi-cover problem (MMC), we are given two point sets $Y$ (servers) and $X$ (clients) in an arbitrary metric space $(X \\cup Y, d)$, a positive integer $k$ that represents the coverage demand of each client, and a constant $\\alpha \\geq 1$. Each server can have a single ball of arbitrary radius centered on it. Each client $x \\in X$ needs to be covered by at least $k$ such balls centered on servers. The objective function that we wish to minimize is the sum of the $\\alpha$-th powers of the radii of the balls.\n  In this article, we consider the MMC problem as well as some non-trivia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04152","kind":"arxiv","version":3},"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":"1602.04152","created_at":"2026-05-18T00:50:40.398441+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04152v3","created_at":"2026-05-18T00:50:40.398441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04152","created_at":"2026-05-18T00:50:40.398441+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNRPKD72MRLI","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNRPKD72MRLISQU7","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNRPKD72","created_at":"2026-05-18T12:30:32.724797+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/MNRPKD72MRLISQU7R6NSB4B6DW","json":"https://pith.science/pith/MNRPKD72MRLISQU7R6NSB4B6DW.json","graph_json":"https://pith.science/api/pith-number/MNRPKD72MRLISQU7R6NSB4B6DW/graph.json","events_json":"https://pith.science/api/pith-number/MNRPKD72MRLISQU7R6NSB4B6DW/events.json","paper":"https://pith.science/paper/MNRPKD72"},"agent_actions":{"view_html":"https://pith.science/pith/MNRPKD72MRLISQU7R6NSB4B6DW","download_json":"https://pith.science/pith/MNRPKD72MRLISQU7R6NSB4B6DW.json","view_paper":"https://pith.science/paper/MNRPKD72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04152&json=true","fetch_graph":"https://pith.science/api/pith-number/MNRPKD72MRLISQU7R6NSB4B6DW/graph.json","fetch_events":"https://pith.science/api/pith-number/MNRPKD72MRLISQU7R6NSB4B6DW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNRPKD72MRLISQU7R6NSB4B6DW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNRPKD72MRLISQU7R6NSB4B6DW/action/storage_attestation","attest_author":"https://pith.science/pith/MNRPKD72MRLISQU7R6NSB4B6DW/action/author_attestation","sign_citation":"https://pith.science/pith/MNRPKD72MRLISQU7R6NSB4B6DW/action/citation_signature","submit_replication":"https://pith.science/pith/MNRPKD72MRLISQU7R6NSB4B6DW/action/replication_record"}},"created_at":"2026-05-18T00:50:40.398441+00:00","updated_at":"2026-05-18T00:50:40.398441+00:00"}