{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:F3BWYS6INJLRHYSJ54OV5ZXCFL","short_pith_number":"pith:F3BWYS6I","schema_version":"1.0","canonical_sha256":"2ec36c4bc86a5713e249ef1d5ee6e22ac9de9895fcbc1658371dfe65fec27ae4","source":{"kind":"arxiv","id":"2212.14467","version":1},"attestation_state":"computed","paper":{"title":"Cluster-level Group Representativity Fairness in $k$-means Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CY"],"primary_cat":"cs.LG","authors_text":"Deepak P, Muiris MacCarthaigh, Stanley Simoes","submitted_at":"2022-12-29T22:02:28Z","abstract_excerpt":"There has been much interest recently in developing fair clustering algorithms that seek to do justice to the representation of groups defined along sensitive attributes such as race and gender. We observe that clustering algorithms could generate clusters such that different groups are disadvantaged within different clusters. We develop a clustering algorithm, building upon the centroid clustering paradigm pioneered by classical algorithms such as $k$-means, where we focus on mitigating the unfairness experienced by the most-disadvantaged group within each cluster. Our method uses an iterativ"},"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":"2212.14467","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-12-29T22:02:28Z","cross_cats_sorted":["cs.CY"],"title_canon_sha256":"78e27ac19123554b5aad3fe905bc1e4703205733521b98b4d98c3f88b3a663d0","abstract_canon_sha256":"ba61324f60060d3cf40491e17e4c1a231d164fad004854b1938a5c0cf237b849"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:29:10.562484Z","signature_b64":"+RKi2Kh7JFg/ceGRV2eV8BDIbk4DlCWi5tyUwsMQwAGB0grhcRg+49K9+l+bzAaQkrAonZ1jf1MogmxEWF5cBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ec36c4bc86a5713e249ef1d5ee6e22ac9de9895fcbc1658371dfe65fec27ae4","last_reissued_at":"2026-07-05T05:29:10.562141Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:29:10.562141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cluster-level Group Representativity Fairness in $k$-means Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CY"],"primary_cat":"cs.LG","authors_text":"Deepak P, Muiris MacCarthaigh, Stanley Simoes","submitted_at":"2022-12-29T22:02:28Z","abstract_excerpt":"There has been much interest recently in developing fair clustering algorithms that seek to do justice to the representation of groups defined along sensitive attributes such as race and gender. We observe that clustering algorithms could generate clusters such that different groups are disadvantaged within different clusters. We develop a clustering algorithm, building upon the centroid clustering paradigm pioneered by classical algorithms such as $k$-means, where we focus on mitigating the unfairness experienced by the most-disadvantaged group within each cluster. Our method uses an iterativ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.14467","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/2212.14467/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2212.14467","created_at":"2026-07-05T05:29:10.562195+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.14467v1","created_at":"2026-07-05T05:29:10.562195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.14467","created_at":"2026-07-05T05:29:10.562195+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3BWYS6INJLR","created_at":"2026-07-05T05:29:10.562195+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3BWYS6INJLRHYSJ","created_at":"2026-07-05T05:29:10.562195+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3BWYS6I","created_at":"2026-07-05T05:29:10.562195+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F3BWYS6INJLRHYSJ54OV5ZXCFL","json":"https://pith.science/pith/F3BWYS6INJLRHYSJ54OV5ZXCFL.json","graph_json":"https://pith.science/api/pith-number/F3BWYS6INJLRHYSJ54OV5ZXCFL/graph.json","events_json":"https://pith.science/api/pith-number/F3BWYS6INJLRHYSJ54OV5ZXCFL/events.json","paper":"https://pith.science/paper/F3BWYS6I"},"agent_actions":{"view_html":"https://pith.science/pith/F3BWYS6INJLRHYSJ54OV5ZXCFL","download_json":"https://pith.science/pith/F3BWYS6INJLRHYSJ54OV5ZXCFL.json","view_paper":"https://pith.science/paper/F3BWYS6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.14467&json=true","fetch_graph":"https://pith.science/api/pith-number/F3BWYS6INJLRHYSJ54OV5ZXCFL/graph.json","fetch_events":"https://pith.science/api/pith-number/F3BWYS6INJLRHYSJ54OV5ZXCFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3BWYS6INJLRHYSJ54OV5ZXCFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3BWYS6INJLRHYSJ54OV5ZXCFL/action/storage_attestation","attest_author":"https://pith.science/pith/F3BWYS6INJLRHYSJ54OV5ZXCFL/action/author_attestation","sign_citation":"https://pith.science/pith/F3BWYS6INJLRHYSJ54OV5ZXCFL/action/citation_signature","submit_replication":"https://pith.science/pith/F3BWYS6INJLRHYSJ54OV5ZXCFL/action/replication_record"}},"created_at":"2026-07-05T05:29:10.562195+00:00","updated_at":"2026-07-05T05:29:10.562195+00:00"}