{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CMPAQQEXLGKRZI5FD3GMCEIFZD","short_pith_number":"pith:CMPAQQEX","schema_version":"1.0","canonical_sha256":"131e08409759951ca3a51eccc11105c8eb7c6169d40729006ab9cf3a00bbb6c5","source":{"kind":"arxiv","id":"2504.14683","version":2},"attestation_state":"computed","paper":{"title":"Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sayan Bandyapadhyay, Sina Bagheri Nezhad, Tianzhi Chen","submitted_at":"2025-04-20T17:19:03Z","abstract_excerpt":"In a seminal work, Chierichetti et al. introduced the $(t,k)$-fair clustering problem: Given a set of red points and a set of blue points in a metric space, a clustering is called fair if the number of red points in each cluster is at most $t$ times and at least $1/t$ times the number of blue points in that cluster. The goal is to compute a fair clustering with at most $k$ clusters that optimizes certain objective function. Considering this problem, they designed a polynomial-time $O(1)$- and $O(t)$-approximation for the $k$-center and the $k$-median objective, respectively. Recently, Carta et"},"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":"2504.14683","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-20T17:19:03Z","cross_cats_sorted":[],"title_canon_sha256":"fcdba4733cfd36e4a00abd9006cfd216e4fe0f6dc84acec4043be6c99ebb020f","abstract_canon_sha256":"f4a702744710baedb8abbed84a94cdb64efe2f471cb573b72baf585acf62359c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:46:42.385794Z","signature_b64":"RcFnl9nqxk17rLHOMuLJ/Gc2vYt4+lCo1+pX7oS4xTCakw0b/DTGOOIvBzdBcZozbusf5TgI/GBPMdpz2+W1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"131e08409759951ca3a51eccc11105c8eb7c6169d40729006ab9cf3a00bbb6c5","last_reissued_at":"2026-07-05T11:46:42.385323Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:46:42.385323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sayan Bandyapadhyay, Sina Bagheri Nezhad, Tianzhi Chen","submitted_at":"2025-04-20T17:19:03Z","abstract_excerpt":"In a seminal work, Chierichetti et al. introduced the $(t,k)$-fair clustering problem: Given a set of red points and a set of blue points in a metric space, a clustering is called fair if the number of red points in each cluster is at most $t$ times and at least $1/t$ times the number of blue points in that cluster. The goal is to compute a fair clustering with at most $k$ clusters that optimizes certain objective function. Considering this problem, they designed a polynomial-time $O(1)$- and $O(t)$-approximation for the $k$-center and the $k$-median objective, respectively. Recently, Carta et"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.14683","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/2504.14683/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":"2504.14683","created_at":"2026-07-05T11:46:42.385383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.14683v2","created_at":"2026-07-05T11:46:42.385383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.14683","created_at":"2026-07-05T11:46:42.385383+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMPAQQEXLGKR","created_at":"2026-07-05T11:46:42.385383+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMPAQQEXLGKRZI5F","created_at":"2026-07-05T11:46:42.385383+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMPAQQEX","created_at":"2026-07-05T11:46:42.385383+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.13191","citing_title":"FPT Constant Approximation Algorithms for Colorful Sum of Radii","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CMPAQQEXLGKRZI5FD3GMCEIFZD","json":"https://pith.science/pith/CMPAQQEXLGKRZI5FD3GMCEIFZD.json","graph_json":"https://pith.science/api/pith-number/CMPAQQEXLGKRZI5FD3GMCEIFZD/graph.json","events_json":"https://pith.science/api/pith-number/CMPAQQEXLGKRZI5FD3GMCEIFZD/events.json","paper":"https://pith.science/paper/CMPAQQEX"},"agent_actions":{"view_html":"https://pith.science/pith/CMPAQQEXLGKRZI5FD3GMCEIFZD","download_json":"https://pith.science/pith/CMPAQQEXLGKRZI5FD3GMCEIFZD.json","view_paper":"https://pith.science/paper/CMPAQQEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.14683&json=true","fetch_graph":"https://pith.science/api/pith-number/CMPAQQEXLGKRZI5FD3GMCEIFZD/graph.json","fetch_events":"https://pith.science/api/pith-number/CMPAQQEXLGKRZI5FD3GMCEIFZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMPAQQEXLGKRZI5FD3GMCEIFZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMPAQQEXLGKRZI5FD3GMCEIFZD/action/storage_attestation","attest_author":"https://pith.science/pith/CMPAQQEXLGKRZI5FD3GMCEIFZD/action/author_attestation","sign_citation":"https://pith.science/pith/CMPAQQEXLGKRZI5FD3GMCEIFZD/action/citation_signature","submit_replication":"https://pith.science/pith/CMPAQQEXLGKRZI5FD3GMCEIFZD/action/replication_record"}},"created_at":"2026-07-05T11:46:42.385383+00:00","updated_at":"2026-07-05T11:46:42.385383+00:00"}