{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IUALEICS47PLUSAOQ2GSDQZF7H","short_pith_number":"pith:IUALEICS","schema_version":"1.0","canonical_sha256":"4500b22052e7deba480e868d21c325f9d61be70e4dc2ef8c9394a1f2c0eedead","source":{"kind":"arxiv","id":"1507.02222","version":3},"attestation_state":"computed","paper":{"title":"Approximate Clustering via Metric Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"cs.CG","authors_text":"Kasturi Varadarajan, Sayan Bandyapadhyay","submitted_at":"2015-07-08T17:08:13Z","abstract_excerpt":"In this paper we consider two metric covering/clustering problems - \\textit{Minimum Cost Covering Problem} (MCC) and $k$-clustering. In the MCC problem, we are given two point sets $X$ (clients) and $Y$ (servers), and a metric on $X \\cup Y$. We would like to cover the clients by balls centered at the servers. The objective function to minimize is the sum of the $\\alpha$-th power of the radii of the balls. Here $\\alpha \\geq 1$ is a parameter of the problem (but not of a problem instance). MCC is closely related to the $k$-clustering problem. The main difference between $k$-clustering and MCC is"},"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":"1507.02222","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-07-08T17:08:13Z","cross_cats_sorted":["cs.DS","math.PR"],"title_canon_sha256":"801f42eec25ddbf7e0cb29dbc79987767514820b890db4b6b813d6533f2e9b02","abstract_canon_sha256":"3e4965a62940e97003bc2639c84ecd0d3734b3587011c24104f82ea2a40df6da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:20.421008Z","signature_b64":"YmWZrH6UMCJTiBsu9lqgq7TKSuYJHhXuyz2xy9WLSE+arvm7QEuzsWNFTUn34rIzSG68WrqAtg7JVIkhMpvEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4500b22052e7deba480e868d21c325f9d61be70e4dc2ef8c9394a1f2c0eedead","last_reissued_at":"2026-05-18T01:03:20.420394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:20.420394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Clustering via Metric Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"cs.CG","authors_text":"Kasturi Varadarajan, Sayan Bandyapadhyay","submitted_at":"2015-07-08T17:08:13Z","abstract_excerpt":"In this paper we consider two metric covering/clustering problems - \\textit{Minimum Cost Covering Problem} (MCC) and $k$-clustering. In the MCC problem, we are given two point sets $X$ (clients) and $Y$ (servers), and a metric on $X \\cup Y$. We would like to cover the clients by balls centered at the servers. The objective function to minimize is the sum of the $\\alpha$-th power of the radii of the balls. Here $\\alpha \\geq 1$ is a parameter of the problem (but not of a problem instance). MCC is closely related to the $k$-clustering problem. The main difference between $k$-clustering and MCC is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02222","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":"1507.02222","created_at":"2026-05-18T01:03:20.420467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02222v3","created_at":"2026-05-18T01:03:20.420467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02222","created_at":"2026-05-18T01:03:20.420467+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUALEICS47PL","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUALEICS47PLUSAO","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUALEICS","created_at":"2026-05-18T12:29:25.134429+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/IUALEICS47PLUSAOQ2GSDQZF7H","json":"https://pith.science/pith/IUALEICS47PLUSAOQ2GSDQZF7H.json","graph_json":"https://pith.science/api/pith-number/IUALEICS47PLUSAOQ2GSDQZF7H/graph.json","events_json":"https://pith.science/api/pith-number/IUALEICS47PLUSAOQ2GSDQZF7H/events.json","paper":"https://pith.science/paper/IUALEICS"},"agent_actions":{"view_html":"https://pith.science/pith/IUALEICS47PLUSAOQ2GSDQZF7H","download_json":"https://pith.science/pith/IUALEICS47PLUSAOQ2GSDQZF7H.json","view_paper":"https://pith.science/paper/IUALEICS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02222&json=true","fetch_graph":"https://pith.science/api/pith-number/IUALEICS47PLUSAOQ2GSDQZF7H/graph.json","fetch_events":"https://pith.science/api/pith-number/IUALEICS47PLUSAOQ2GSDQZF7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUALEICS47PLUSAOQ2GSDQZF7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUALEICS47PLUSAOQ2GSDQZF7H/action/storage_attestation","attest_author":"https://pith.science/pith/IUALEICS47PLUSAOQ2GSDQZF7H/action/author_attestation","sign_citation":"https://pith.science/pith/IUALEICS47PLUSAOQ2GSDQZF7H/action/citation_signature","submit_replication":"https://pith.science/pith/IUALEICS47PLUSAOQ2GSDQZF7H/action/replication_record"}},"created_at":"2026-05-18T01:03:20.420467+00:00","updated_at":"2026-05-18T01:03:20.420467+00:00"}