{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:O3YYIBU2R2M5UI55N3XEN42OVV","short_pith_number":"pith:O3YYIBU2","schema_version":"1.0","canonical_sha256":"76f184069a8e99da23bd6eee46f34ead70d6c2e649c3206526e6d3787b3de9c6","source":{"kind":"arxiv","id":"2402.06730","version":1},"attestation_state":"computed","paper":{"title":"A Scalable Algorithm for Individually Fair K-means Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CY","cs.LG"],"primary_cat":"cs.DS","authors_text":"Alessandro Epasto, MohammadHossein Bateni, Silvio Lattanzi, Vincent Cohen-Addad","submitted_at":"2024-02-09T19:01:48Z","abstract_excerpt":"We present a scalable algorithm for the individually fair ($p$, $k$)-clustering problem introduced by Jung et al. and Mahabadi et al. Given $n$ points $P$ in a metric space, let $\\delta(x)$ for $x\\in P$ be the radius of the smallest ball around $x$ containing at least $n / k$ points. A clustering is then called individually fair if it has centers within distance $\\delta(x)$ of $x$ for each $x\\in P$. While good approximation algorithms are known for this problem no efficient practical algorithms with good theoretical guarantees have been presented. We design the first fast local-search algorith"},"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":"2402.06730","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-09T19:01:48Z","cross_cats_sorted":["cs.CY","cs.LG"],"title_canon_sha256":"7dc9d835a2b0997eddb581e05553b32a017c5048bbed5941c7b95f0f66d7276a","abstract_canon_sha256":"2e42486dd219957b2783721b673166b4d347d8770ce872747079e7de0651234c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:46.610269Z","signature_b64":"2nzzKjEK+Js9K8SlJirEm5DPDf+VeoheXMsTSEaF5Y8xilM3J2ZV1JCj57urjOvwpMw0LlgqcrC3u3Sx8erHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76f184069a8e99da23bd6eee46f34ead70d6c2e649c3206526e6d3787b3de9c6","last_reissued_at":"2026-07-05T07:44:46.609762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:46.609762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Scalable Algorithm for Individually Fair K-means Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CY","cs.LG"],"primary_cat":"cs.DS","authors_text":"Alessandro Epasto, MohammadHossein Bateni, Silvio Lattanzi, Vincent Cohen-Addad","submitted_at":"2024-02-09T19:01:48Z","abstract_excerpt":"We present a scalable algorithm for the individually fair ($p$, $k$)-clustering problem introduced by Jung et al. and Mahabadi et al. Given $n$ points $P$ in a metric space, let $\\delta(x)$ for $x\\in P$ be the radius of the smallest ball around $x$ containing at least $n / k$ points. A clustering is then called individually fair if it has centers within distance $\\delta(x)$ of $x$ for each $x\\in P$. While good approximation algorithms are known for this problem no efficient practical algorithms with good theoretical guarantees have been presented. We design the first fast local-search algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.06730","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/2402.06730/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":"2402.06730","created_at":"2026-07-05T07:44:46.609836+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.06730v1","created_at":"2026-07-05T07:44:46.609836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.06730","created_at":"2026-07-05T07:44:46.609836+00:00"},{"alias_kind":"pith_short_12","alias_value":"O3YYIBU2R2M5","created_at":"2026-07-05T07:44:46.609836+00:00"},{"alias_kind":"pith_short_16","alias_value":"O3YYIBU2R2M5UI55","created_at":"2026-07-05T07:44:46.609836+00:00"},{"alias_kind":"pith_short_8","alias_value":"O3YYIBU2","created_at":"2026-07-05T07:44:46.609836+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.18028","citing_title":"KNN and K-means in Gini Prametric Spaces","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV","json":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV.json","graph_json":"https://pith.science/api/pith-number/O3YYIBU2R2M5UI55N3XEN42OVV/graph.json","events_json":"https://pith.science/api/pith-number/O3YYIBU2R2M5UI55N3XEN42OVV/events.json","paper":"https://pith.science/paper/O3YYIBU2"},"agent_actions":{"view_html":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV","download_json":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV.json","view_paper":"https://pith.science/paper/O3YYIBU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.06730&json=true","fetch_graph":"https://pith.science/api/pith-number/O3YYIBU2R2M5UI55N3XEN42OVV/graph.json","fetch_events":"https://pith.science/api/pith-number/O3YYIBU2R2M5UI55N3XEN42OVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV/action/storage_attestation","attest_author":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV/action/author_attestation","sign_citation":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV/action/citation_signature","submit_replication":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV/action/replication_record"}},"created_at":"2026-07-05T07:44:46.609836+00:00","updated_at":"2026-07-05T07:44:46.609836+00:00"}