{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RMIZDRAQGXAFGM5T7KFA3BZY3R","short_pith_number":"pith:RMIZDRAQ","schema_version":"1.0","canonical_sha256":"8b1191c41035c05333b3fa8a0d8738dc6d82d8c08319b4bb028e75bfd785b240","source":{"kind":"arxiv","id":"1802.05733","version":1},"attestation_state":"computed","paper":{"title":"Fair Clustering Through Fairlets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Flavio Chierichetti, Ravi Kumar, Sergei Vassilvitskii, Silvio Lattanzi","submitted_at":"2018-02-15T19:52:49Z","abstract_excerpt":"We study the question of fair clustering under the {\\em disparate impact} doctrine, where each protected class must have approximately equal representation in every cluster. We formulate the fair clustering problem under both the $k$-center and the $k$-median objectives, and show that even with two protected classes the problem is challenging, as the optimum solution can violate common conventions---for instance a point may no longer be assigned to its nearest cluster center! En route we introduce the concept of fairlets, which are minimal sets that satisfy fair representation while approximat"},"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":"1802.05733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T19:52:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d50280d2af018425f6ecef5684ce698749da88479fc75821e916075f7663402a","abstract_canon_sha256":"3f31d1cec21a305114997351cf313fc9d8ce522437c59dbfbf1dbf44f7780c14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:11.214432Z","signature_b64":"tD64zyFp6yKeucajz5RPiL/sltiXfXFK0ZRRjmUNwBOLn9jVznN7GSIv8q6ZbPSK8PkQ3spcY5kcJjamg5EoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b1191c41035c05333b3fa8a0d8738dc6d82d8c08319b4bb028e75bfd785b240","last_reissued_at":"2026-05-18T00:23:11.213695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:11.213695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Clustering Through Fairlets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Flavio Chierichetti, Ravi Kumar, Sergei Vassilvitskii, Silvio Lattanzi","submitted_at":"2018-02-15T19:52:49Z","abstract_excerpt":"We study the question of fair clustering under the {\\em disparate impact} doctrine, where each protected class must have approximately equal representation in every cluster. We formulate the fair clustering problem under both the $k$-center and the $k$-median objectives, and show that even with two protected classes the problem is challenging, as the optimum solution can violate common conventions---for instance a point may no longer be assigned to its nearest cluster center! En route we introduce the concept of fairlets, which are minimal sets that satisfy fair representation while approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05733","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":""},"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":"1802.05733","created_at":"2026-05-18T00:23:11.213817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.05733v1","created_at":"2026-05-18T00:23:11.213817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05733","created_at":"2026-05-18T00:23:11.213817+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMIZDRAQGXAF","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMIZDRAQGXAFGM5T","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMIZDRAQ","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.20220","citing_title":"Alternatives to the Laplacian for Scalable Spectral Clustering with Group Fairness Constraints","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RMIZDRAQGXAFGM5T7KFA3BZY3R","json":"https://pith.science/pith/RMIZDRAQGXAFGM5T7KFA3BZY3R.json","graph_json":"https://pith.science/api/pith-number/RMIZDRAQGXAFGM5T7KFA3BZY3R/graph.json","events_json":"https://pith.science/api/pith-number/RMIZDRAQGXAFGM5T7KFA3BZY3R/events.json","paper":"https://pith.science/paper/RMIZDRAQ"},"agent_actions":{"view_html":"https://pith.science/pith/RMIZDRAQGXAFGM5T7KFA3BZY3R","download_json":"https://pith.science/pith/RMIZDRAQGXAFGM5T7KFA3BZY3R.json","view_paper":"https://pith.science/paper/RMIZDRAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.05733&json=true","fetch_graph":"https://pith.science/api/pith-number/RMIZDRAQGXAFGM5T7KFA3BZY3R/graph.json","fetch_events":"https://pith.science/api/pith-number/RMIZDRAQGXAFGM5T7KFA3BZY3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMIZDRAQGXAFGM5T7KFA3BZY3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMIZDRAQGXAFGM5T7KFA3BZY3R/action/storage_attestation","attest_author":"https://pith.science/pith/RMIZDRAQGXAFGM5T7KFA3BZY3R/action/author_attestation","sign_citation":"https://pith.science/pith/RMIZDRAQGXAFGM5T7KFA3BZY3R/action/citation_signature","submit_replication":"https://pith.science/pith/RMIZDRAQGXAFGM5T7KFA3BZY3R/action/replication_record"}},"created_at":"2026-05-18T00:23:11.213817+00:00","updated_at":"2026-05-18T00:23:11.213817+00:00"}