{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E2CDZ5VUBDAZNVP3R3CXXTCDP4","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":"5f985928a8c6307def1b2cb9de66b35056853215be9ca1eff3add1836c1f9f5d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-08T16:39:16Z","title_canon_sha256":"f0ef37509cf7d243e3a4f3a6ea5a37119ef9c4c6980ca58b92d38bac489c0db9"},"schema_version":"1.0","source":{"id":"1901.02393","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02393","created_at":"2026-05-17T23:43:16Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02393v2","created_at":"2026-05-17T23:43:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02393","created_at":"2026-05-17T23:43:16Z"},{"alias_kind":"pith_short_12","alias_value":"E2CDZ5VUBDAZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E2CDZ5VUBDAZNVP3","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E2CDZ5VU","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:494d7a70a7a7ec99fadfc7e983df0bcd4b0236b6cd50b6c48428bab977a56283","target":"graph","created_at":"2026-05-17T23:43:16Z","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"},"paper":{"abstract_excerpt":"We study the problem of finding low-cost Fair Clusterings in data where each data point may belong to many protected groups. Our work significantly generalizes the seminal work of Chierichetti et.al. (NIPS 2017) as follows.\n  - We allow the user to specify the parameters that define fair representation. More precisely, these parameters define the maximum over- and minimum under-representation of any group in any cluster.\n  - Our clustering algorithm works on any $\\ell_p$-norm objective (e.g. $k$-means, $k$-median, and $k$-center). Indeed, our algorithm transforms any vanilla clustering solutio","authors_text":"Deeparnab Chakrabarty, Maryam Negahbani, Nicolas J. Flores, Suman K. Bera","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-08T16:39:16Z","title":"Fair Algorithms for Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02393","kind":"arxiv","version":2},"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:3ee9409a9333dac66384066c86a989fec3737fba2326f41a6a741b3e07d14243","target":"record","created_at":"2026-05-17T23:43:16Z","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":"5f985928a8c6307def1b2cb9de66b35056853215be9ca1eff3add1836c1f9f5d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-08T16:39:16Z","title_canon_sha256":"f0ef37509cf7d243e3a4f3a6ea5a37119ef9c4c6980ca58b92d38bac489c0db9"},"schema_version":"1.0","source":{"id":"1901.02393","kind":"arxiv","version":2}},"canonical_sha256":"26843cf6b408c196d5fb8ec57bcc437f393d696bffa3fc8b0aebf3b93b1df714","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26843cf6b408c196d5fb8ec57bcc437f393d696bffa3fc8b0aebf3b93b1df714","first_computed_at":"2026-05-17T23:43:16.970535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:16.970535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zFnLqh4i0cSZlpZ11Ypear6vZwvu0ZUNRpgNxqzfz3jWmmXD9uhZI8GEApzGZeRv9nSK2Y6GVtM/JzOWR8ygAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:16.971009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02393","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ee9409a9333dac66384066c86a989fec3737fba2326f41a6a741b3e07d14243","sha256:494d7a70a7a7ec99fadfc7e983df0bcd4b0236b6cd50b6c48428bab977a56283"],"state_sha256":"d375b335bfe338ca8d2e12d5e4432025cc82d86bb2280918b91941bd114cba95"}