{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HXH5KQE3XMVZCXBIKTCE766W37","short_pith_number":"pith:HXH5KQE3","schema_version":"1.0","canonical_sha256":"3dcfd5409bbb2b915c2854c44ffbd6dfff41fb3e9dab5f991ecbbbcfe7930a96","source":{"kind":"arxiv","id":"2302.12811","version":1},"attestation_state":"computed","paper":{"title":"$k$-Center Clustering with Outliers in the MPC and Streaming Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Leyla Biabani, Mark de Berg, Morteza Monemizadeh","submitted_at":"2023-02-24T18:46:27Z","abstract_excerpt":"Given a point set $P \\subseteq X$ of size $n$ in a metric space $(X,dist)$ of doubling dimension $d$ and two parameters $k \\in N$ and $z \\in N$, the $k$-center problem with $z$ outliers asks to return a set $C^\\ast \\subseteq X$ of $k$ centers such that the maximum distance of all but $z$ points of $P$ to their nearest center in $C^\\ast$ is minimized. An $(\\epsilon,k,z)$-coreset for this problem is a weighted point set $P^*$ such that an optimal solution for the $k$-center problem with $z$ outliers on $P^*$ gives a $(1\\pm\\epsilon)$-approximation for the $k$-center problem with $z$ outliers on $"},"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":"2302.12811","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-24T18:46:27Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"52a471ded66b73144a11faaef91b886e5c0ac093697d1313193fde8312ba7878","abstract_canon_sha256":"c9667ac67cad1a2dd51821b06a4d252509c1609a03764a42306aa29096defc2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:21.355498Z","signature_b64":"SXaZZU1wwfOmgDz0603PDW1cRiagk95BBoC/Yio6QWiH1YOxzonEz25sB8KpHAuoZiCabBkN6/zSxhAkiyTvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dcfd5409bbb2b915c2854c44ffbd6dfff41fb3e9dab5f991ecbbbcfe7930a96","last_reissued_at":"2026-07-05T05:45:21.355146Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:21.355146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$k$-Center Clustering with Outliers in the MPC and Streaming Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Leyla Biabani, Mark de Berg, Morteza Monemizadeh","submitted_at":"2023-02-24T18:46:27Z","abstract_excerpt":"Given a point set $P \\subseteq X$ of size $n$ in a metric space $(X,dist)$ of doubling dimension $d$ and two parameters $k \\in N$ and $z \\in N$, the $k$-center problem with $z$ outliers asks to return a set $C^\\ast \\subseteq X$ of $k$ centers such that the maximum distance of all but $z$ points of $P$ to their nearest center in $C^\\ast$ is minimized. An $(\\epsilon,k,z)$-coreset for this problem is a weighted point set $P^*$ such that an optimal solution for the $k$-center problem with $z$ outliers on $P^*$ gives a $(1\\pm\\epsilon)$-approximation for the $k$-center problem with $z$ outliers on $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.12811","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/2302.12811/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":"2302.12811","created_at":"2026-07-05T05:45:21.355205+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.12811v1","created_at":"2026-07-05T05:45:21.355205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.12811","created_at":"2026-07-05T05:45:21.355205+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXH5KQE3XMVZ","created_at":"2026-07-05T05:45:21.355205+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXH5KQE3XMVZCXBI","created_at":"2026-07-05T05:45:21.355205+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXH5KQE3","created_at":"2026-07-05T05:45:21.355205+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":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HXH5KQE3XMVZCXBIKTCE766W37","json":"https://pith.science/pith/HXH5KQE3XMVZCXBIKTCE766W37.json","graph_json":"https://pith.science/api/pith-number/HXH5KQE3XMVZCXBIKTCE766W37/graph.json","events_json":"https://pith.science/api/pith-number/HXH5KQE3XMVZCXBIKTCE766W37/events.json","paper":"https://pith.science/paper/HXH5KQE3"},"agent_actions":{"view_html":"https://pith.science/pith/HXH5KQE3XMVZCXBIKTCE766W37","download_json":"https://pith.science/pith/HXH5KQE3XMVZCXBIKTCE766W37.json","view_paper":"https://pith.science/paper/HXH5KQE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.12811&json=true","fetch_graph":"https://pith.science/api/pith-number/HXH5KQE3XMVZCXBIKTCE766W37/graph.json","fetch_events":"https://pith.science/api/pith-number/HXH5KQE3XMVZCXBIKTCE766W37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXH5KQE3XMVZCXBIKTCE766W37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXH5KQE3XMVZCXBIKTCE766W37/action/storage_attestation","attest_author":"https://pith.science/pith/HXH5KQE3XMVZCXBIKTCE766W37/action/author_attestation","sign_citation":"https://pith.science/pith/HXH5KQE3XMVZCXBIKTCE766W37/action/citation_signature","submit_replication":"https://pith.science/pith/HXH5KQE3XMVZCXBIKTCE766W37/action/replication_record"}},"created_at":"2026-07-05T05:45:21.355205+00:00","updated_at":"2026-07-05T05:45:21.355205+00:00"}