{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:QVTGYLYWPHEWC5Z5HEZQY54IHW","short_pith_number":"pith:QVTGYLYW","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"},"canonical_sha256":"85666c2f1679c961773d39330c77883d8fdf9fc5122d0411e69b09f86dce2df5","source":{"kind":"arxiv","id":"2412.10923","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:QVTGYLYWPHEWC5Z5HEZQY54IHW","target":"record","payload":{"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"},"canonical_sha256":"85666c2f1679c961773d39330c77883d8fdf9fc5122d0411e69b09f86dce2df5","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"},"source_kind":"arxiv","source_id":"2412.10923","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5WdJNriG4nmH6+zxZq2XjnkS84RADxbd2J8kwmB4FtiptuNW66zftR8Wfutq3rf8fpgtuqp9HT4EvgScWdHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:58:13.731098Z"},"content_sha256":"7aff5a1dd3f833043a3197b56bf1ba659792a5fc6a24cee02f2045852b4c7241","schema_version":"1.0","event_id":"sha256:7aff5a1dd3f833043a3197b56bf1ba659792a5fc6a24cee02f2045852b4c7241"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:QVTGYLYWPHEWC5Z5HEZQY54IHW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CobAivRcFYcC1KFgAaM39wdXR7ACfgPzNs8QEp0TgIj2y/zq2upINrPkOHMgeLKh1ONmLNdPg6Tk0VydYBRPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:58:13.731978Z"},"content_sha256":"a9df11b64ed78b5ccb830b8368846896ed4cd334871701242cd697d13148a1db","schema_version":"1.0","event_id":"sha256:a9df11b64ed78b5ccb830b8368846896ed4cd334871701242cd697d13148a1db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW/bundle.json","state_url":"https://pith.science/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T23:58:13Z","links":{"resolver":"https://pith.science/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW","bundle":"https://pith.science/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW/bundle.json","state":"https://pith.science/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QVTGYLYWPHEWC5Z5HEZQY54IHW/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AaYXaovBlMawu03sHo2VCgL9mceTMaIzwBOMg0ork7Lr27ccMDhvWdxM15LTllj3bWbN+ECb6UXxAT/2X8RaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T23:58:13.792307Z","bundle_sha256":"85cc13abd10f86a916a6b90bdaa89578c4d52c2f831b2645acfd8daba96b6747"}}