{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:O3YYIBU2R2M5UI55N3XEN42OVV","short_pith_number":"pith:O3YYIBU2","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"},"canonical_sha256":"76f184069a8e99da23bd6eee46f34ead70d6c2e649c3206526e6d3787b3de9c6","source":{"kind":"arxiv","id":"2402.06730","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.06730","created_at":"2026-07-05T07:44:46Z"},{"alias_kind":"arxiv_version","alias_value":"2402.06730v1","created_at":"2026-07-05T07:44:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.06730","created_at":"2026-07-05T07:44:46Z"},{"alias_kind":"pith_short_12","alias_value":"O3YYIBU2R2M5","created_at":"2026-07-05T07:44:46Z"},{"alias_kind":"pith_short_16","alias_value":"O3YYIBU2R2M5UI55","created_at":"2026-07-05T07:44:46Z"},{"alias_kind":"pith_short_8","alias_value":"O3YYIBU2","created_at":"2026-07-05T07:44:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:O3YYIBU2R2M5UI55N3XEN42OVV","target":"record","payload":{"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"},"canonical_sha256":"76f184069a8e99da23bd6eee46f34ead70d6c2e649c3206526e6d3787b3de9c6","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"},"source_kind":"arxiv","source_id":"2402.06730","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-05T07:44:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OSJMuJT/xU3l6BGkAxcX4IXAoTCItLkk0ARwhUfJJnFkOPzNdAWoYHI70N5Nr1F2R3NoOzemLzZYm16XR4wgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T20:40:38.322053Z"},"content_sha256":"1cfd48766fc8004433e8c25d36a6dbbc698d931641726ace7a3cca4a3ab22274","schema_version":"1.0","event_id":"sha256:1cfd48766fc8004433e8c25d36a6dbbc698d931641726ace7a3cca4a3ab22274"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:O3YYIBU2R2M5UI55N3XEN42OVV","target":"graph","payload":{"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"},"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-05T07:44:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ahk32OkhSprEW2ADColZ0dT1flNn3jvbLucU2Ugx0SsHRuH70KQKA9R++ZLrbfCemGBE4FT3gOwTwQK2ZlyiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T20:40:38.322634Z"},"content_sha256":"f8fdbc9bcb81a8b1f674670d3f8961eecfb006c803091f0eeca677b8e292f626","schema_version":"1.0","event_id":"sha256:f8fdbc9bcb81a8b1f674670d3f8961eecfb006c803091f0eeca677b8e292f626"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV/bundle.json","state_url":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3YYIBU2R2M5UI55N3XEN42OVV/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-10T20:40:38Z","links":{"resolver":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV","bundle":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV/bundle.json","state":"https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3YYIBU2R2M5UI55N3XEN42OVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:O3YYIBU2R2M5UI55N3XEN42OVV","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":"2e42486dd219957b2783721b673166b4d347d8770ce872747079e7de0651234c","cross_cats_sorted":["cs.CY","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-09T19:01:48Z","title_canon_sha256":"7dc9d835a2b0997eddb581e05553b32a017c5048bbed5941c7b95f0f66d7276a"},"schema_version":"1.0","source":{"id":"2402.06730","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.06730","created_at":"2026-07-05T07:44:46Z"},{"alias_kind":"arxiv_version","alias_value":"2402.06730v1","created_at":"2026-07-05T07:44:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.06730","created_at":"2026-07-05T07:44:46Z"},{"alias_kind":"pith_short_12","alias_value":"O3YYIBU2R2M5","created_at":"2026-07-05T07:44:46Z"},{"alias_kind":"pith_short_16","alias_value":"O3YYIBU2R2M5UI55","created_at":"2026-07-05T07:44:46Z"},{"alias_kind":"pith_short_8","alias_value":"O3YYIBU2","created_at":"2026-07-05T07:44:46Z"}],"graph_snapshots":[{"event_id":"sha256:f8fdbc9bcb81a8b1f674670d3f8961eecfb006c803091f0eeca677b8e292f626","target":"graph","created_at":"2026-07-05T07:44:46Z","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/2402.06730/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alessandro Epasto, MohammadHossein Bateni, Silvio Lattanzi, Vincent Cohen-Addad","cross_cats":["cs.CY","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-09T19:01:48Z","title":"A Scalable Algorithm for Individually Fair K-means Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.06730","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:1cfd48766fc8004433e8c25d36a6dbbc698d931641726ace7a3cca4a3ab22274","target":"record","created_at":"2026-07-05T07:44:46Z","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":"2e42486dd219957b2783721b673166b4d347d8770ce872747079e7de0651234c","cross_cats_sorted":["cs.CY","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-09T19:01:48Z","title_canon_sha256":"7dc9d835a2b0997eddb581e05553b32a017c5048bbed5941c7b95f0f66d7276a"},"schema_version":"1.0","source":{"id":"2402.06730","kind":"arxiv","version":1}},"canonical_sha256":"76f184069a8e99da23bd6eee46f34ead70d6c2e649c3206526e6d3787b3de9c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76f184069a8e99da23bd6eee46f34ead70d6c2e649c3206526e6d3787b3de9c6","first_computed_at":"2026-07-05T07:44:46.609762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:44:46.609762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2nzzKjEK+Js9K8SlJirEm5DPDf+VeoheXMsTSEaF5Y8xilM3J2ZV1JCj57urjOvwpMw0LlgqcrC3u3Sx8erHCA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:44:46.610269Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.06730","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cfd48766fc8004433e8c25d36a6dbbc698d931641726ace7a3cca4a3ab22274","sha256:f8fdbc9bcb81a8b1f674670d3f8961eecfb006c803091f0eeca677b8e292f626"],"state_sha256":"84e5154a97750a01bea440be8d9afc6879d35151673329289b139ca31fb0f976"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XeNNT/cMSwqKt00bFaHFLTlzlUa2xZcnIYDBf9zXARfJSOgBT7mZs0y6z4VOOSWzyAjCn97k2mYZeH0Btn+mAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T20:40:38.326913Z","bundle_sha256":"246d27a79d1854832623277c053bb4c7fdc50d14ed9c6c1df2d0ce5df4b4a61d"}}