{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IUALEICS47PLUSAOQ2GSDQZF7H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3e4965a62940e97003bc2639c84ecd0d3734b3587011c24104f82ea2a40df6da","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-07-08T17:08:13Z","title_canon_sha256":"801f42eec25ddbf7e0cb29dbc79987767514820b890db4b6b813d6533f2e9b02"},"schema_version":"1.0","source":{"id":"1507.02222","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02222","created_at":"2026-05-18T01:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02222v3","created_at":"2026-05-18T01:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02222","created_at":"2026-05-18T01:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"IUALEICS47PL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IUALEICS47PLUSAO","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IUALEICS","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:9044b3bb777a280a97623e1febf119989ee6db80cc0bd0694636d872c1740780","target":"graph","created_at":"2026-05-18T01:03:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Kasturi Varadarajan, Sayan Bandyapadhyay","cross_cats":["cs.DS","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-07-08T17:08:13Z","title":"Approximate Clustering via Metric Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02222","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3d6d1458eb55ba6a2246650ea4fc9e1cde51c713a4982aee46b0427528e53c20","target":"record","created_at":"2026-05-18T01:03:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3e4965a62940e97003bc2639c84ecd0d3734b3587011c24104f82ea2a40df6da","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-07-08T17:08:13Z","title_canon_sha256":"801f42eec25ddbf7e0cb29dbc79987767514820b890db4b6b813d6533f2e9b02"},"schema_version":"1.0","source":{"id":"1507.02222","kind":"arxiv","version":3}},"canonical_sha256":"4500b22052e7deba480e868d21c325f9d61be70e4dc2ef8c9394a1f2c0eedead","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4500b22052e7deba480e868d21c325f9d61be70e4dc2ef8c9394a1f2c0eedead","first_computed_at":"2026-05-18T01:03:20.420394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:20.420394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YmWZrH6UMCJTiBsu9lqgq7TKSuYJHhXuyz2xy9WLSE+arvm7QEuzsWNFTUn34rIzSG68WrqAtg7JVIkhMpvEDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:20.421008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02222","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d6d1458eb55ba6a2246650ea4fc9e1cde51c713a4982aee46b0427528e53c20","sha256:9044b3bb777a280a97623e1febf119989ee6db80cc0bd0694636d872c1740780"],"state_sha256":"b43f39ff5629b8151af236a780bfbe60639f7059f3e9647a945e4d0e3a79a6e4"}