{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GR5OPA3NYB2B2CKDIKNTPBUTKP","short_pith_number":"pith:GR5OPA3N","schema_version":"1.0","canonical_sha256":"347ae7836dc0741d0943429b37869353f68e4b8276588757f5161285a84f0581","source":{"kind":"arxiv","id":"2206.11210","version":1},"attestation_state":"computed","paper":{"title":"Constant-Factor Approximation Algorithms for Socially Fair $k$-Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DS","authors_text":"Mehrdad Ghadiri, Mohit Singh, Santosh S. Vempala","submitted_at":"2022-06-22T16:57:17Z","abstract_excerpt":"We study approximation algorithms for the socially fair $(\\ell_p, k)$-clustering problem with $m$ groups, whose special cases include the socially fair $k$-median ($p=1$) and socially fair $k$-means ($p=2$) problems. We present (1) a polynomial-time $(5+2\\sqrt{6})^p$-approximation with at most $k+m$ centers (2) a $(5+2\\sqrt{6}+\\epsilon)^p$-approximation with $k$ centers in time $n^{2^{O(p)}\\cdot m^2}$, and (3) a $(15+6\\sqrt{6})^p$ approximation with $k$ centers in time $k^{m}\\cdot\\text{poly}(n)$. The first result is obtained via a refinement of the iterative rounding method using a sequence of"},"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":"2206.11210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-06-22T16:57:17Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"7276b139734f463b4b358ab4dbe838513bdd73f23c993dea1d787af236948a3f","abstract_canon_sha256":"ea18e0824590065a2199e807a2c688e01a8acb159df08b13c123de64e0bee267"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:10.105975Z","signature_b64":"fQ4kq3eCj08kIE1+X3a2/b2+CsfmxevxwWxm7Lu6i+HF6mUJqEJkVyGG31G3ZB0wzRkcPy+zvNEpFvN2RTJrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"347ae7836dc0741d0943429b37869353f68e4b8276588757f5161285a84f0581","last_reissued_at":"2026-07-05T04:34:10.105546Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:10.105546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant-Factor Approximation Algorithms for Socially Fair $k$-Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DS","authors_text":"Mehrdad Ghadiri, Mohit Singh, Santosh S. Vempala","submitted_at":"2022-06-22T16:57:17Z","abstract_excerpt":"We study approximation algorithms for the socially fair $(\\ell_p, k)$-clustering problem with $m$ groups, whose special cases include the socially fair $k$-median ($p=1$) and socially fair $k$-means ($p=2$) problems. We present (1) a polynomial-time $(5+2\\sqrt{6})^p$-approximation with at most $k+m$ centers (2) a $(5+2\\sqrt{6}+\\epsilon)^p$-approximation with $k$ centers in time $n^{2^{O(p)}\\cdot m^2}$, and (3) a $(15+6\\sqrt{6})^p$ approximation with $k$ centers in time $k^{m}\\cdot\\text{poly}(n)$. The first result is obtained via a refinement of the iterative rounding method using a sequence of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.11210","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/2206.11210/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":"2206.11210","created_at":"2026-07-05T04:34:10.105614+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.11210v1","created_at":"2026-07-05T04:34:10.105614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.11210","created_at":"2026-07-05T04:34:10.105614+00:00"},{"alias_kind":"pith_short_12","alias_value":"GR5OPA3NYB2B","created_at":"2026-07-05T04:34:10.105614+00:00"},{"alias_kind":"pith_short_16","alias_value":"GR5OPA3NYB2B2CKD","created_at":"2026-07-05T04:34:10.105614+00:00"},{"alias_kind":"pith_short_8","alias_value":"GR5OPA3N","created_at":"2026-07-05T04:34:10.105614+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06656","citing_title":"Why Global LLM Leaderboards Are Misleading: Small Portfolios for Heterogeneous Supervised ML","ref_index":228,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GR5OPA3NYB2B2CKDIKNTPBUTKP","json":"https://pith.science/pith/GR5OPA3NYB2B2CKDIKNTPBUTKP.json","graph_json":"https://pith.science/api/pith-number/GR5OPA3NYB2B2CKDIKNTPBUTKP/graph.json","events_json":"https://pith.science/api/pith-number/GR5OPA3NYB2B2CKDIKNTPBUTKP/events.json","paper":"https://pith.science/paper/GR5OPA3N"},"agent_actions":{"view_html":"https://pith.science/pith/GR5OPA3NYB2B2CKDIKNTPBUTKP","download_json":"https://pith.science/pith/GR5OPA3NYB2B2CKDIKNTPBUTKP.json","view_paper":"https://pith.science/paper/GR5OPA3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.11210&json=true","fetch_graph":"https://pith.science/api/pith-number/GR5OPA3NYB2B2CKDIKNTPBUTKP/graph.json","fetch_events":"https://pith.science/api/pith-number/GR5OPA3NYB2B2CKDIKNTPBUTKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GR5OPA3NYB2B2CKDIKNTPBUTKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GR5OPA3NYB2B2CKDIKNTPBUTKP/action/storage_attestation","attest_author":"https://pith.science/pith/GR5OPA3NYB2B2CKDIKNTPBUTKP/action/author_attestation","sign_citation":"https://pith.science/pith/GR5OPA3NYB2B2CKDIKNTPBUTKP/action/citation_signature","submit_replication":"https://pith.science/pith/GR5OPA3NYB2B2CKDIKNTPBUTKP/action/replication_record"}},"created_at":"2026-07-05T04:34:10.105614+00:00","updated_at":"2026-07-05T04:34:10.105614+00:00"}