{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QVTGYLYWPHEWC5Z5HEZQY54IHW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fa97f9930ade9a5f4b1266a1d1ecb2f4d5a0c0c0f5f21c268f67f163624af316","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-14T18:16:46Z","title_canon_sha256":"3e6e4b417637062fee8d2bba0e1e48f38d9c4c17af7c1bf1f2f874aee42c2592"},"schema_version":"1.0","source":{"id":"2412.10923","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.10923","created_at":"2026-07-05T09:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"2412.10923v1","created_at":"2026-07-05T09:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.10923","created_at":"2026-07-05T09:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"QVTGYLYWPHEW","created_at":"2026-07-05T09:49:24Z"},{"alias_kind":"pith_short_16","alias_value":"QVTGYLYWPHEWC5Z5","created_at":"2026-07-05T09:49:24Z"},{"alias_kind":"pith_short_8","alias_value":"QVTGYLYW","created_at":"2026-07-05T09:49:24Z"}],"graph_snapshots":[{"event_id":"sha256:a9df11b64ed78b5ccb830b8368846896ed4cd334871701242cd697d13148a1db","target":"graph","created_at":"2026-07-05T09:49:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.10923/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anirban Dasgupta, Binita Maity, Shrutimoy Das","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-14T18:16:46Z","title":"Linear Programming based Approximation to Individually Fair k-Clustering with Outliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.10923","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7aff5a1dd3f833043a3197b56bf1ba659792a5fc6a24cee02f2045852b4c7241","target":"record","created_at":"2026-07-05T09:49:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fa97f9930ade9a5f4b1266a1d1ecb2f4d5a0c0c0f5f21c268f67f163624af316","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-14T18:16:46Z","title_canon_sha256":"3e6e4b417637062fee8d2bba0e1e48f38d9c4c17af7c1bf1f2f874aee42c2592"},"schema_version":"1.0","source":{"id":"2412.10923","kind":"arxiv","version":1}},"canonical_sha256":"85666c2f1679c961773d39330c77883d8fdf9fc5122d0411e69b09f86dce2df5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85666c2f1679c961773d39330c77883d8fdf9fc5122d0411e69b09f86dce2df5","first_computed_at":"2026-07-05T09:49:24.526156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:49:24.526156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DeWmOE2L+TfyxUoEGO2VfLhFu3CDOSOwSeFvHJZ70CPHL0JGy4/AdqNLmEqdZDXBrra5VBoLtzK9DB3OZ5k5CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:49:24.526631Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.10923","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7aff5a1dd3f833043a3197b56bf1ba659792a5fc6a24cee02f2045852b4c7241","sha256:a9df11b64ed78b5ccb830b8368846896ed4cd334871701242cd697d13148a1db"],"state_sha256":"ed1b3c18f6730c91668d99dfc9073b2fe5bbcf7aaf3224d51e7e7140a2f09f21"}