{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JW6KMNEEZ4CU7ZJGF3TB3WIJYE","short_pith_number":"pith:JW6KMNEE","schema_version":"1.0","canonical_sha256":"4dbca63484cf054fe5262ee61dd909c13127712c6ea099e65ad98362e4d86a8f","source":{"kind":"arxiv","id":"2507.11260","version":2},"attestation_state":"computed","paper":{"title":"Towards Tight Robust Coresets for $k$-Medians Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"cs.DS","authors_text":"Lingxiao Huang, Xuan Wu, Yi Li, Zhenyu Jiang","submitted_at":"2025-07-15T12:33:19Z","abstract_excerpt":"This paper considers coresets for the robust $k$-medians problem with $m$ outliers, and new constructions in various metric spaces are obtained. Specifically, for metric spaces with a bounded VC or doubling dimension $d$, the coreset size is $O(m) + \\tilde{O}(kd\\varepsilon^{-2})$, which is optimal up to logarithmic factors. For Euclidean spaces, the coreset size is $O(m\\varepsilon^{-1}) + \\tilde{O}(\\min\\{k^{4/3}\\varepsilon^{-2}, k\\varepsilon^{-3}\\})$, improving upon a recent result by Jiang and Lou (ICALP 2025). These results also extend to robust $(k,z)$-clustering, yielding, for VC and doubl"},"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":"2507.11260","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-15T12:33:19Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"762f4dc890de16548359b8b4744117b883845575c00a0abd47cdf4a4483a1d2b","abstract_canon_sha256":"de8a83739acdeac8d0dccf651ff664c1a815ef079534bbb427bc911abef2f66d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:10.894783Z","signature_b64":"3vduViPOaECVTrH0PtH+8INJv2FEeHBpvFxzb6GD6lekAokHtf/KOZuJRfdT+e99uqFyY8gxGGBXH9rF8McuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dbca63484cf054fe5262ee61dd909c13127712c6ea099e65ad98362e4d86a8f","last_reissued_at":"2026-06-12T01:09:10.893681Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:10.893681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Tight Robust Coresets for $k$-Medians Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"cs.DS","authors_text":"Lingxiao Huang, Xuan Wu, Yi Li, Zhenyu Jiang","submitted_at":"2025-07-15T12:33:19Z","abstract_excerpt":"This paper considers coresets for the robust $k$-medians problem with $m$ outliers, and new constructions in various metric spaces are obtained. Specifically, for metric spaces with a bounded VC or doubling dimension $d$, the coreset size is $O(m) + \\tilde{O}(kd\\varepsilon^{-2})$, which is optimal up to logarithmic factors. For Euclidean spaces, the coreset size is $O(m\\varepsilon^{-1}) + \\tilde{O}(\\min\\{k^{4/3}\\varepsilon^{-2}, k\\varepsilon^{-3}\\})$, improving upon a recent result by Jiang and Lou (ICALP 2025). These results also extend to robust $(k,z)$-clustering, yielding, for VC and doubl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11260","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.11260/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":"2507.11260","created_at":"2026-06-12T01:09:10.893787+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.11260v2","created_at":"2026-06-12T01:09:10.893787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11260","created_at":"2026-06-12T01:09:10.893787+00:00"},{"alias_kind":"pith_short_12","alias_value":"JW6KMNEEZ4CU","created_at":"2026-06-12T01:09:10.893787+00:00"},{"alias_kind":"pith_short_16","alias_value":"JW6KMNEEZ4CU7ZJG","created_at":"2026-06-12T01:09:10.893787+00:00"},{"alias_kind":"pith_short_8","alias_value":"JW6KMNEE","created_at":"2026-06-12T01:09:10.893787+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/JW6KMNEEZ4CU7ZJGF3TB3WIJYE","json":"https://pith.science/pith/JW6KMNEEZ4CU7ZJGF3TB3WIJYE.json","graph_json":"https://pith.science/api/pith-number/JW6KMNEEZ4CU7ZJGF3TB3WIJYE/graph.json","events_json":"https://pith.science/api/pith-number/JW6KMNEEZ4CU7ZJGF3TB3WIJYE/events.json","paper":"https://pith.science/paper/JW6KMNEE"},"agent_actions":{"view_html":"https://pith.science/pith/JW6KMNEEZ4CU7ZJGF3TB3WIJYE","download_json":"https://pith.science/pith/JW6KMNEEZ4CU7ZJGF3TB3WIJYE.json","view_paper":"https://pith.science/paper/JW6KMNEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.11260&json=true","fetch_graph":"https://pith.science/api/pith-number/JW6KMNEEZ4CU7ZJGF3TB3WIJYE/graph.json","fetch_events":"https://pith.science/api/pith-number/JW6KMNEEZ4CU7ZJGF3TB3WIJYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JW6KMNEEZ4CU7ZJGF3TB3WIJYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JW6KMNEEZ4CU7ZJGF3TB3WIJYE/action/storage_attestation","attest_author":"https://pith.science/pith/JW6KMNEEZ4CU7ZJGF3TB3WIJYE/action/author_attestation","sign_citation":"https://pith.science/pith/JW6KMNEEZ4CU7ZJGF3TB3WIJYE/action/citation_signature","submit_replication":"https://pith.science/pith/JW6KMNEEZ4CU7ZJGF3TB3WIJYE/action/replication_record"}},"created_at":"2026-06-12T01:09:10.893787+00:00","updated_at":"2026-06-12T01:09:10.893787+00:00"}