{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YUJBBED56YIJME7KDUNDVNZAVK","short_pith_number":"pith:YUJBBED5","schema_version":"1.0","canonical_sha256":"c51210907df6109613ea1d1a3ab720aab4396dc6507c9f2736c60e9e9aab6a64","source":{"kind":"arxiv","id":"1902.01896","version":2},"attestation_state":"computed","paper":{"title":"A Composable Coreset for k-Center in Doubling Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Mohammad Ghodsi, Sepideh Aghamolaei","submitted_at":"2019-02-05T20:14:33Z","abstract_excerpt":"A set of points $P$ in a metric space and a constant integer $k$ are given. The $k$-center problem finds $k$ points as centers among $P$, such that the maximum distance of any point of $P$ to their closest centers $(r)$ is minimized.\n  Doubling metrics are metric spaces in which for any $r$, a ball of radius $r$ can be covered using a constant number of balls of radius $r/2$. Fixed dimensional Euclidean spaces are doubling metrics. The lower bound on the approximation factor of $k$-center is $1.822$ in Euclidean spaces, however, $(1+\\epsilon)$-approximation algorithms with exponential dependen"},"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":"1902.01896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T20:14:33Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"770356d8888d21eabead51d83d2fcdf50716e3ee903e77bb91eb2b109fe7f708","abstract_canon_sha256":"b1335968531ebacc00e3acb21106a99c11075a1a79a73f0cdb7f4dc1a67eb07f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:50.680579Z","signature_b64":"PFRTsJmAsGS9+FvrJt57PGlhYG+8er+ESiOC6fcCBRoHulCuohJ4qv7TpvxudqYqpQ6rs5pbhbOYYK7+1kIgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c51210907df6109613ea1d1a3ab720aab4396dc6507c9f2736c60e9e9aab6a64","last_reissued_at":"2026-05-17T23:47:50.680038Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:50.680038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Composable Coreset for k-Center in Doubling Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Mohammad Ghodsi, Sepideh Aghamolaei","submitted_at":"2019-02-05T20:14:33Z","abstract_excerpt":"A set of points $P$ in a metric space and a constant integer $k$ are given. The $k$-center problem finds $k$ points as centers among $P$, such that the maximum distance of any point of $P$ to their closest centers $(r)$ is minimized.\n  Doubling metrics are metric spaces in which for any $r$, a ball of radius $r$ can be covered using a constant number of balls of radius $r/2$. Fixed dimensional Euclidean spaces are doubling metrics. The lower bound on the approximation factor of $k$-center is $1.822$ in Euclidean spaces, however, $(1+\\epsilon)$-approximation algorithms with exponential dependen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01896","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":"1902.01896","created_at":"2026-05-17T23:47:50.680125+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01896v2","created_at":"2026-05-17T23:47:50.680125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01896","created_at":"2026-05-17T23:47:50.680125+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUJBBED56YIJ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUJBBED56YIJME7K","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUJBBED5","created_at":"2026-05-18T12:33:33.725879+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/YUJBBED56YIJME7KDUNDVNZAVK","json":"https://pith.science/pith/YUJBBED56YIJME7KDUNDVNZAVK.json","graph_json":"https://pith.science/api/pith-number/YUJBBED56YIJME7KDUNDVNZAVK/graph.json","events_json":"https://pith.science/api/pith-number/YUJBBED56YIJME7KDUNDVNZAVK/events.json","paper":"https://pith.science/paper/YUJBBED5"},"agent_actions":{"view_html":"https://pith.science/pith/YUJBBED56YIJME7KDUNDVNZAVK","download_json":"https://pith.science/pith/YUJBBED56YIJME7KDUNDVNZAVK.json","view_paper":"https://pith.science/paper/YUJBBED5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01896&json=true","fetch_graph":"https://pith.science/api/pith-number/YUJBBED56YIJME7KDUNDVNZAVK/graph.json","fetch_events":"https://pith.science/api/pith-number/YUJBBED56YIJME7KDUNDVNZAVK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUJBBED56YIJME7KDUNDVNZAVK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUJBBED56YIJME7KDUNDVNZAVK/action/storage_attestation","attest_author":"https://pith.science/pith/YUJBBED56YIJME7KDUNDVNZAVK/action/author_attestation","sign_citation":"https://pith.science/pith/YUJBBED56YIJME7KDUNDVNZAVK/action/citation_signature","submit_replication":"https://pith.science/pith/YUJBBED56YIJME7KDUNDVNZAVK/action/replication_record"}},"created_at":"2026-05-17T23:47:50.680125+00:00","updated_at":"2026-05-17T23:47:50.680125+00:00"}