{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YXYZ52SEOTA2D457AY2FRLQQG7","short_pith_number":"pith:YXYZ52SE","schema_version":"1.0","canonical_sha256":"c5f19eea4474c1a1f3bf063458ae1037dbef2b56588954bcca171c03f2549b0c","source":{"kind":"arxiv","id":"2309.04327","version":1},"attestation_state":"computed","paper":{"title":"A 2-Approximation Algorithm for Data-Distributed Metric k-Center","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CG","authors_text":"Mohammad Ghodsi, Sepideh Aghamolaei","submitted_at":"2023-09-08T13:46:01Z","abstract_excerpt":"In a metric space, a set of point sets of roughly the same size and an integer $k\\geq 1$ are given as the input and the goal of data-distributed $k$-center is to find a subset of size $k$ of the input points as the set of centers to minimize the maximum distance from the input points to their closest centers. Metric $k$-center is known to be NP-hard which carries to the data-distributed setting.\n  We give a $2$-approximation algorithm of $k$-center for sublinear $k$ in the data-distributed setting, which is tight. This algorithm works in several models, including the massively parallel computa"},"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":"2309.04327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-09-08T13:46:01Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1a0d037006a249c30001ad1949ac31216b14ba3661318474974d842da4beeb75","abstract_canon_sha256":"277baceaeac0fd86b3fffbd9ccd75f4f6af941a1add6106403deec9504b8226d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:48:58.258014Z","signature_b64":"Zp9iqA8/ItBqPRLV2TvF2tlUyebG8L6zkSTQXR+rSH1zzSRjFqqDXI9nLV4O+BeTzlPOzwTKR8FyeacYYQpeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5f19eea4474c1a1f3bf063458ae1037dbef2b56588954bcca171c03f2549b0c","last_reissued_at":"2026-07-05T06:48:58.257504Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:48:58.257504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 2-Approximation Algorithm for Data-Distributed Metric k-Center","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CG","authors_text":"Mohammad Ghodsi, Sepideh Aghamolaei","submitted_at":"2023-09-08T13:46:01Z","abstract_excerpt":"In a metric space, a set of point sets of roughly the same size and an integer $k\\geq 1$ are given as the input and the goal of data-distributed $k$-center is to find a subset of size $k$ of the input points as the set of centers to minimize the maximum distance from the input points to their closest centers. Metric $k$-center is known to be NP-hard which carries to the data-distributed setting.\n  We give a $2$-approximation algorithm of $k$-center for sublinear $k$ in the data-distributed setting, which is tight. This algorithm works in several models, including the massively parallel computa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.04327","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.04327/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2309.04327","created_at":"2026-07-05T06:48:58.257566+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.04327v1","created_at":"2026-07-05T06:48:58.257566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.04327","created_at":"2026-07-05T06:48:58.257566+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXYZ52SEOTA2","created_at":"2026-07-05T06:48:58.257566+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXYZ52SEOTA2D457","created_at":"2026-07-05T06:48:58.257566+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXYZ52SE","created_at":"2026-07-05T06:48:58.257566+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.16382","citing_title":"Fully Scalable MPC Algorithms for Euclidean k-Center","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YXYZ52SEOTA2D457AY2FRLQQG7","json":"https://pith.science/pith/YXYZ52SEOTA2D457AY2FRLQQG7.json","graph_json":"https://pith.science/api/pith-number/YXYZ52SEOTA2D457AY2FRLQQG7/graph.json","events_json":"https://pith.science/api/pith-number/YXYZ52SEOTA2D457AY2FRLQQG7/events.json","paper":"https://pith.science/paper/YXYZ52SE"},"agent_actions":{"view_html":"https://pith.science/pith/YXYZ52SEOTA2D457AY2FRLQQG7","download_json":"https://pith.science/pith/YXYZ52SEOTA2D457AY2FRLQQG7.json","view_paper":"https://pith.science/paper/YXYZ52SE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.04327&json=true","fetch_graph":"https://pith.science/api/pith-number/YXYZ52SEOTA2D457AY2FRLQQG7/graph.json","fetch_events":"https://pith.science/api/pith-number/YXYZ52SEOTA2D457AY2FRLQQG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXYZ52SEOTA2D457AY2FRLQQG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXYZ52SEOTA2D457AY2FRLQQG7/action/storage_attestation","attest_author":"https://pith.science/pith/YXYZ52SEOTA2D457AY2FRLQQG7/action/author_attestation","sign_citation":"https://pith.science/pith/YXYZ52SEOTA2D457AY2FRLQQG7/action/citation_signature","submit_replication":"https://pith.science/pith/YXYZ52SEOTA2D457AY2FRLQQG7/action/replication_record"}},"created_at":"2026-07-05T06:48:58.257566+00:00","updated_at":"2026-07-05T06:48:58.257566+00:00"}