{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RQ2YKHZFDPO7CULYDVSDQOZ7B7","short_pith_number":"pith:RQ2YKHZF","schema_version":"1.0","canonical_sha256":"8c35851f251bddf151781d64383b3f0fc7c85c0f28ffa19590d6845fdd990acc","source":{"kind":"arxiv","id":"2502.07669","version":1},"attestation_state":"computed","paper":{"title":"Coresets for Robust Clustering via Black-box Reductions to Vanilla Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianing Lou, Shaofeng H.-C. Jiang","submitted_at":"2025-02-11T16:14:53Z","abstract_excerpt":"We devise $\\epsilon$-coresets for robust $(k,z)$-Clustering with $m$ outliers through black-box reductions to vanilla case. Given an $\\epsilon$-coreset construction for vanilla clustering with size $N$, we construct coresets of size $N\\cdot \\mathrm{poly}\\log(km\\epsilon^{-1}) + O_z\\left(\\min\\{km\\epsilon^{-1}, m\\epsilon^{-2z}\\log^z(km\\epsilon^{-1}) \\}\\right)$ for various metric spaces, where $O_z$ hides $2^{O(z\\log z)}$ factors. This increases the size of the vanilla coreset by a small multiplicative factor of $\\mathrm{poly}\\log(km\\epsilon^{-1})$, and the additive term is up to a $(\\epsilon^{-1}"},"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":"2502.07669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-11T16:14:53Z","cross_cats_sorted":[],"title_canon_sha256":"3850a7e5420714cc788d3f1c6fad21f001102aa45e5f6c1d148378640387e5d6","abstract_canon_sha256":"63bce7c117d204279525cd33bf581935b5ccc5653f4216e4b7a3d8f623406ef3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:12:40.773580Z","signature_b64":"Mj/4FZ2gZRZNY5V0Qw2v4oLIedeuKSLMVhTYOyglXHuhJDYgIGmeSptBEIJw5Xt5sUxzgSxWPGvAOKV8CqBOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c35851f251bddf151781d64383b3f0fc7c85c0f28ffa19590d6845fdd990acc","last_reissued_at":"2026-07-05T10:12:40.773022Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:12:40.773022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coresets for Robust Clustering via Black-box Reductions to Vanilla Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianing Lou, Shaofeng H.-C. Jiang","submitted_at":"2025-02-11T16:14:53Z","abstract_excerpt":"We devise $\\epsilon$-coresets for robust $(k,z)$-Clustering with $m$ outliers through black-box reductions to vanilla case. Given an $\\epsilon$-coreset construction for vanilla clustering with size $N$, we construct coresets of size $N\\cdot \\mathrm{poly}\\log(km\\epsilon^{-1}) + O_z\\left(\\min\\{km\\epsilon^{-1}, m\\epsilon^{-2z}\\log^z(km\\epsilon^{-1}) \\}\\right)$ for various metric spaces, where $O_z$ hides $2^{O(z\\log z)}$ factors. This increases the size of the vanilla coreset by a small multiplicative factor of $\\mathrm{poly}\\log(km\\epsilon^{-1})$, and the additive term is up to a $(\\epsilon^{-1}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.07669","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/2502.07669/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":"2502.07669","created_at":"2026-07-05T10:12:40.773088+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.07669v1","created_at":"2026-07-05T10:12:40.773088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.07669","created_at":"2026-07-05T10:12:40.773088+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQ2YKHZFDPO7","created_at":"2026-07-05T10:12:40.773088+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQ2YKHZFDPO7CULY","created_at":"2026-07-05T10:12:40.773088+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQ2YKHZF","created_at":"2026-07-05T10:12:40.773088+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/RQ2YKHZFDPO7CULYDVSDQOZ7B7","json":"https://pith.science/pith/RQ2YKHZFDPO7CULYDVSDQOZ7B7.json","graph_json":"https://pith.science/api/pith-number/RQ2YKHZFDPO7CULYDVSDQOZ7B7/graph.json","events_json":"https://pith.science/api/pith-number/RQ2YKHZFDPO7CULYDVSDQOZ7B7/events.json","paper":"https://pith.science/paper/RQ2YKHZF"},"agent_actions":{"view_html":"https://pith.science/pith/RQ2YKHZFDPO7CULYDVSDQOZ7B7","download_json":"https://pith.science/pith/RQ2YKHZFDPO7CULYDVSDQOZ7B7.json","view_paper":"https://pith.science/paper/RQ2YKHZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.07669&json=true","fetch_graph":"https://pith.science/api/pith-number/RQ2YKHZFDPO7CULYDVSDQOZ7B7/graph.json","fetch_events":"https://pith.science/api/pith-number/RQ2YKHZFDPO7CULYDVSDQOZ7B7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQ2YKHZFDPO7CULYDVSDQOZ7B7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQ2YKHZFDPO7CULYDVSDQOZ7B7/action/storage_attestation","attest_author":"https://pith.science/pith/RQ2YKHZFDPO7CULYDVSDQOZ7B7/action/author_attestation","sign_citation":"https://pith.science/pith/RQ2YKHZFDPO7CULYDVSDQOZ7B7/action/citation_signature","submit_replication":"https://pith.science/pith/RQ2YKHZFDPO7CULYDVSDQOZ7B7/action/replication_record"}},"created_at":"2026-07-05T10:12:40.773088+00:00","updated_at":"2026-07-05T10:12:40.773088+00:00"}