{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QVTGYLYWPHEWC5Z5HEZQY54IHW","short_pith_number":"pith:QVTGYLYW","schema_version":"1.0","canonical_sha256":"85666c2f1679c961773d39330c77883d8fdf9fc5122d0411e69b09f86dce2df5","source":{"kind":"arxiv","id":"2412.10923","version":1},"attestation_state":"computed","paper":{"title":"Linear Programming based Approximation to Individually Fair k-Clustering with Outliers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anirban Dasgupta, Binita Maity, Shrutimoy Das","submitted_at":"2024-12-14T18:16:46Z","abstract_excerpt":"Individual fairness guarantees are often desirable properties to have, but they become hard to formalize when the dataset contains outliers. Here, we investigate the problem of developing an individually fair $k$-means clustering algorithm for datasets that contain outliers. That is, given $n$ points and $k$ centers, we want that for each point which is not an outlier, there must be a center within the $\\frac{n}{k}$ nearest neighbours of the given point. While a few of the recent works have looked into individually fair clustering, this is the first work that explores this problem in the prese"},"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":"2412.10923","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-14T18:16:46Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"3e6e4b417637062fee8d2bba0e1e48f38d9c4c17af7c1bf1f2f874aee42c2592","abstract_canon_sha256":"fa97f9930ade9a5f4b1266a1d1ecb2f4d5a0c0c0f5f21c268f67f163624af316"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:49:24.526631Z","signature_b64":"DeWmOE2L+TfyxUoEGO2VfLhFu3CDOSOwSeFvHJZ70CPHL0JGy4/AdqNLmEqdZDXBrra5VBoLtzK9DB3OZ5k5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85666c2f1679c961773d39330c77883d8fdf9fc5122d0411e69b09f86dce2df5","last_reissued_at":"2026-07-05T09:49:24.526156Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:49:24.526156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Programming based Approximation to Individually Fair k-Clustering with Outliers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anirban Dasgupta, Binita Maity, Shrutimoy Das","submitted_at":"2024-12-14T18:16:46Z","abstract_excerpt":"Individual fairness guarantees are often desirable properties to have, but they become hard to formalize when the dataset contains outliers. Here, we investigate the problem of developing an individually fair $k$-means clustering algorithm for datasets that contain outliers. That is, given $n$ points and $k$ centers, we want that for each point which is not an outlier, there must be a center within the $\\frac{n}{k}$ nearest neighbours of the given point. While a few of the recent works have looked into individually fair clustering, this is the first work that explores this problem in the prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.10923","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/2412.10923/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":"2412.10923","created_at":"2026-07-05T09:49:24.526219+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.10923v1","created_at":"2026-07-05T09:49:24.526219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.10923","created_at":"2026-07-05T09:49:24.526219+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVTGYLYWPHEW","created_at":"2026-07-05T09:49:24.526219+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVTGYLYWPHEWC5Z5","created_at":"2026-07-05T09:49:24.526219+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVTGYLYW","created_at":"2026-07-05T09:49:24.526219+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/QVTGYLYWPHEWC5Z5HEZQY54IHW","json":"https://pith.science/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW.json","graph_json":"https://pith.science/api/pith-number/QVTGYLYWPHEWC5Z5HEZQY54IHW/graph.json","events_json":"https://pith.science/api/pith-number/QVTGYLYWPHEWC5Z5HEZQY54IHW/events.json","paper":"https://pith.science/paper/QVTGYLYW"},"agent_actions":{"view_html":"https://pith.science/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW","download_json":"https://pith.science/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW.json","view_paper":"https://pith.science/paper/QVTGYLYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.10923&json=true","fetch_graph":"https://pith.science/api/pith-number/QVTGYLYWPHEWC5Z5HEZQY54IHW/graph.json","fetch_events":"https://pith.science/api/pith-number/QVTGYLYWPHEWC5Z5HEZQY54IHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW/action/storage_attestation","attest_author":"https://pith.science/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW/action/author_attestation","sign_citation":"https://pith.science/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW/action/citation_signature","submit_replication":"https://pith.science/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW/action/replication_record"}},"created_at":"2026-07-05T09:49:24.526219+00:00","updated_at":"2026-07-05T09:49:24.526219+00:00"}