{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3T4KFDX6P6Z5RBI7VOR4DGQIGJ","short_pith_number":"pith:3T4KFDX6","schema_version":"1.0","canonical_sha256":"dcf8a28efe7fb3d8851faba3c19a083253e02854fa65d822a4c70cda10c88f0d","source":{"kind":"arxiv","id":"2410.23273","version":1},"attestation_state":"computed","paper":{"title":"Proportional Fairness in Non-Centroid Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.LG","authors_text":"Evi Micha, Ioannis Caragiannis, Nisarg Shah","submitted_at":"2024-10-30T17:53:49Z","abstract_excerpt":"We revisit the recently developed framework of proportionally fair clustering, where the goal is to provide group fairness guarantees that become stronger for groups of data points (agents) that are large and cohesive. Prior work applies this framework to centroid clustering, where the loss of an agent is its distance to the centroid assigned to its cluster. We expand the framework to non-centroid clustering, where the loss of an agent is a function of the other agents in its cluster, by adapting two proportional fairness criteria -- the core and its relaxation, fully justified representation "},"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":"2410.23273","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-30T17:53:49Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"cda64e0c80f8b839f3a136152888cbe6a2517cce727ea3cb9b8ddd6b4a3108aa","abstract_canon_sha256":"357b34f7f297d55d657fd2c83c315cb77192c97c96bb5b5731fb454280d97c80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:28:43.122287Z","signature_b64":"1RARt0nf+mFJD8dojA/ZPp2Zl1rZFwGRIzexGYkrteYPV9AjNFtaPLuip0CM/JD/KBgagv7JWtQkPdqESBjTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcf8a28efe7fb3d8851faba3c19a083253e02854fa65d822a4c70cda10c88f0d","last_reissued_at":"2026-07-05T09:28:43.121941Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:28:43.121941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proportional Fairness in Non-Centroid Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.LG","authors_text":"Evi Micha, Ioannis Caragiannis, Nisarg Shah","submitted_at":"2024-10-30T17:53:49Z","abstract_excerpt":"We revisit the recently developed framework of proportionally fair clustering, where the goal is to provide group fairness guarantees that become stronger for groups of data points (agents) that are large and cohesive. Prior work applies this framework to centroid clustering, where the loss of an agent is its distance to the centroid assigned to its cluster. We expand the framework to non-centroid clustering, where the loss of an agent is a function of the other agents in its cluster, by adapting two proportional fairness criteria -- the core and its relaxation, fully justified representation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23273","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/2410.23273/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":"2410.23273","created_at":"2026-07-05T09:28:43.121996+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.23273v1","created_at":"2026-07-05T09:28:43.121996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23273","created_at":"2026-07-05T09:28:43.121996+00:00"},{"alias_kind":"pith_short_12","alias_value":"3T4KFDX6P6Z5","created_at":"2026-07-05T09:28:43.121996+00:00"},{"alias_kind":"pith_short_16","alias_value":"3T4KFDX6P6Z5RBI7","created_at":"2026-07-05T09:28:43.121996+00:00"},{"alias_kind":"pith_short_8","alias_value":"3T4KFDX6","created_at":"2026-07-05T09:28:43.121996+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/3T4KFDX6P6Z5RBI7VOR4DGQIGJ","json":"https://pith.science/pith/3T4KFDX6P6Z5RBI7VOR4DGQIGJ.json","graph_json":"https://pith.science/api/pith-number/3T4KFDX6P6Z5RBI7VOR4DGQIGJ/graph.json","events_json":"https://pith.science/api/pith-number/3T4KFDX6P6Z5RBI7VOR4DGQIGJ/events.json","paper":"https://pith.science/paper/3T4KFDX6"},"agent_actions":{"view_html":"https://pith.science/pith/3T4KFDX6P6Z5RBI7VOR4DGQIGJ","download_json":"https://pith.science/pith/3T4KFDX6P6Z5RBI7VOR4DGQIGJ.json","view_paper":"https://pith.science/paper/3T4KFDX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.23273&json=true","fetch_graph":"https://pith.science/api/pith-number/3T4KFDX6P6Z5RBI7VOR4DGQIGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3T4KFDX6P6Z5RBI7VOR4DGQIGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3T4KFDX6P6Z5RBI7VOR4DGQIGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3T4KFDX6P6Z5RBI7VOR4DGQIGJ/action/storage_attestation","attest_author":"https://pith.science/pith/3T4KFDX6P6Z5RBI7VOR4DGQIGJ/action/author_attestation","sign_citation":"https://pith.science/pith/3T4KFDX6P6Z5RBI7VOR4DGQIGJ/action/citation_signature","submit_replication":"https://pith.science/pith/3T4KFDX6P6Z5RBI7VOR4DGQIGJ/action/replication_record"}},"created_at":"2026-07-05T09:28:43.121996+00:00","updated_at":"2026-07-05T09:28:43.121996+00:00"}