{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:T5KKDZ4KL5GHZXNLJLLNVOSJNM","short_pith_number":"pith:T5KKDZ4K","schema_version":"1.0","canonical_sha256":"9f54a1e78a5f4c7cddab4ad6daba496b0448693616c06fa4d7e66b44fa21d1bf","source":{"kind":"arxiv","id":"2405.10378","version":2},"attestation_state":"computed","paper":{"title":"A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DS","authors_text":"Ali Vakilian, Eden Chlamt\\'a\\v{c}, Mahya Jamshidian, Sayan Bandyapadhyay, Yury Makarychev, Zachary Friggstad","submitted_at":"2024-05-16T18:17:44Z","abstract_excerpt":"In this work, we study pairwise fair clustering with $\\ell \\ge 2$ groups, where for every cluster $C$ and every group $i \\in [\\ell]$, the number of points in $C$ from group $i$ must be at most $t$ times the number of points in $C$ from any other group $j \\in [\\ell]$, for a given integer $t$. To the best of our knowledge, only bi-criteria approximation and exponential-time algorithms follow for this problem from the prior work on fair clustering problems when $\\ell > 2$. In our work, focusing on the $\\ell > 2$ case, we design the first polynomial-time $O(k^2\\cdot \\ell \\cdot t)$-approximation fo"},"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":"2405.10378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-16T18:17:44Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"3c1c31078d84290700b5687c10bd9445126a6df85fa35edd41bc0e8796708412","abstract_canon_sha256":"e75423b89bca4da2ca6cfcc091ad31b346557fea0f3a427baeeb45db73c7d969"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:21:03.245453Z","signature_b64":"q+vAkYQhDe19H8di+sLJvJKVA+Gau5LOjAaQlwWKPrlCa6MRfXxe2V5ohH8zQCs2+hulCxOJ2zdox+D2jzppCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f54a1e78a5f4c7cddab4ad6daba496b0448693616c06fa4d7e66b44fa21d1bf","last_reissued_at":"2026-07-05T10:21:03.245017Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:21:03.245017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DS","authors_text":"Ali Vakilian, Eden Chlamt\\'a\\v{c}, Mahya Jamshidian, Sayan Bandyapadhyay, Yury Makarychev, Zachary Friggstad","submitted_at":"2024-05-16T18:17:44Z","abstract_excerpt":"In this work, we study pairwise fair clustering with $\\ell \\ge 2$ groups, where for every cluster $C$ and every group $i \\in [\\ell]$, the number of points in $C$ from group $i$ must be at most $t$ times the number of points in $C$ from any other group $j \\in [\\ell]$, for a given integer $t$. To the best of our knowledge, only bi-criteria approximation and exponential-time algorithms follow for this problem from the prior work on fair clustering problems when $\\ell > 2$. In our work, focusing on the $\\ell > 2$ case, we design the first polynomial-time $O(k^2\\cdot \\ell \\cdot t)$-approximation fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.10378","kind":"arxiv","version":2},"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/2405.10378/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":"2405.10378","created_at":"2026-07-05T10:21:03.245079+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.10378v2","created_at":"2026-07-05T10:21:03.245079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.10378","created_at":"2026-07-05T10:21:03.245079+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5KKDZ4KL5GH","created_at":"2026-07-05T10:21:03.245079+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5KKDZ4KL5GHZXNL","created_at":"2026-07-05T10:21:03.245079+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5KKDZ4K","created_at":"2026-07-05T10:21:03.245079+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.07674","citing_title":"Approximation Algorithms for Perfect Fair-Triangle Packing","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T5KKDZ4KL5GHZXNLJLLNVOSJNM","json":"https://pith.science/pith/T5KKDZ4KL5GHZXNLJLLNVOSJNM.json","graph_json":"https://pith.science/api/pith-number/T5KKDZ4KL5GHZXNLJLLNVOSJNM/graph.json","events_json":"https://pith.science/api/pith-number/T5KKDZ4KL5GHZXNLJLLNVOSJNM/events.json","paper":"https://pith.science/paper/T5KKDZ4K"},"agent_actions":{"view_html":"https://pith.science/pith/T5KKDZ4KL5GHZXNLJLLNVOSJNM","download_json":"https://pith.science/pith/T5KKDZ4KL5GHZXNLJLLNVOSJNM.json","view_paper":"https://pith.science/paper/T5KKDZ4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.10378&json=true","fetch_graph":"https://pith.science/api/pith-number/T5KKDZ4KL5GHZXNLJLLNVOSJNM/graph.json","fetch_events":"https://pith.science/api/pith-number/T5KKDZ4KL5GHZXNLJLLNVOSJNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5KKDZ4KL5GHZXNLJLLNVOSJNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5KKDZ4KL5GHZXNLJLLNVOSJNM/action/storage_attestation","attest_author":"https://pith.science/pith/T5KKDZ4KL5GHZXNLJLLNVOSJNM/action/author_attestation","sign_citation":"https://pith.science/pith/T5KKDZ4KL5GHZXNLJLLNVOSJNM/action/citation_signature","submit_replication":"https://pith.science/pith/T5KKDZ4KL5GHZXNLJLLNVOSJNM/action/replication_record"}},"created_at":"2026-07-05T10:21:03.245079+00:00","updated_at":"2026-07-05T10:21:03.245079+00:00"}