{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BFX4XA74H6C5D3SBOJGU4WDCZP","short_pith_number":"pith:BFX4XA74","schema_version":"1.0","canonical_sha256":"096fcb83fc3f85d1ee41724d4e5862cbfbfaefc8ecdca728c5b0c1909f1893d2","source":{"kind":"arxiv","id":"2207.11337","version":1},"attestation_state":"computed","paper":{"title":"Fair Range k-center","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Huy L\\^e Nguyen, Matthew Jones, Thy Nguyen","submitted_at":"2022-07-22T21:07:07Z","abstract_excerpt":"We study the problem of fairness in k-centers clustering on data with disjoint demographic groups. Specifically, this work proposes a variant of fairness which restricts each group's number of centers with both a lower bound (minority-protection) and an upper bound (restricted-domination), and provides both an offline and one-pass streaming algorithm for the problem. In the special case where the lower bound and the upper bound is the same, our offline algorithm preserves the same time complexity and approximation factor with the previous state-of-the-art. Furthermore, our one-pass streaming a"},"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":"2207.11337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-07-22T21:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"0f24b293c458670490d31f443673f34744b14daba977d9efed6ce68da703b733","abstract_canon_sha256":"3b04af9af93eb314946c6e1567bd75dd6952dfa51a5e46900e629b15223313d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:42:47.290815Z","signature_b64":"vtCaAkVhVxwTUaNVyHAkbYPEGVaRi0TMrMLrQut1Ox1uo9jy9gV23z9L6KCWP+M1Refa5hZVtwNYPV1/ImINAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"096fcb83fc3f85d1ee41724d4e5862cbfbfaefc8ecdca728c5b0c1909f1893d2","last_reissued_at":"2026-07-05T04:42:47.290435Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:42:47.290435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Range k-center","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Huy L\\^e Nguyen, Matthew Jones, Thy Nguyen","submitted_at":"2022-07-22T21:07:07Z","abstract_excerpt":"We study the problem of fairness in k-centers clustering on data with disjoint demographic groups. Specifically, this work proposes a variant of fairness which restricts each group's number of centers with both a lower bound (minority-protection) and an upper bound (restricted-domination), and provides both an offline and one-pass streaming algorithm for the problem. In the special case where the lower bound and the upper bound is the same, our offline algorithm preserves the same time complexity and approximation factor with the previous state-of-the-art. Furthermore, our one-pass streaming a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11337","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/2207.11337/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":"2207.11337","created_at":"2026-07-05T04:42:47.290494+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.11337v1","created_at":"2026-07-05T04:42:47.290494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11337","created_at":"2026-07-05T04:42:47.290494+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFX4XA74H6C5","created_at":"2026-07-05T04:42:47.290494+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFX4XA74H6C5D3SB","created_at":"2026-07-05T04:42:47.290494+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFX4XA74","created_at":"2026-07-05T04:42:47.290494+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.05476","citing_title":"FPT Approximations for Fair Sum of Radii with Outliers and General Norm Objectives","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16061","citing_title":"Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BFX4XA74H6C5D3SBOJGU4WDCZP","json":"https://pith.science/pith/BFX4XA74H6C5D3SBOJGU4WDCZP.json","graph_json":"https://pith.science/api/pith-number/BFX4XA74H6C5D3SBOJGU4WDCZP/graph.json","events_json":"https://pith.science/api/pith-number/BFX4XA74H6C5D3SBOJGU4WDCZP/events.json","paper":"https://pith.science/paper/BFX4XA74"},"agent_actions":{"view_html":"https://pith.science/pith/BFX4XA74H6C5D3SBOJGU4WDCZP","download_json":"https://pith.science/pith/BFX4XA74H6C5D3SBOJGU4WDCZP.json","view_paper":"https://pith.science/paper/BFX4XA74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.11337&json=true","fetch_graph":"https://pith.science/api/pith-number/BFX4XA74H6C5D3SBOJGU4WDCZP/graph.json","fetch_events":"https://pith.science/api/pith-number/BFX4XA74H6C5D3SBOJGU4WDCZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFX4XA74H6C5D3SBOJGU4WDCZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFX4XA74H6C5D3SBOJGU4WDCZP/action/storage_attestation","attest_author":"https://pith.science/pith/BFX4XA74H6C5D3SBOJGU4WDCZP/action/author_attestation","sign_citation":"https://pith.science/pith/BFX4XA74H6C5D3SBOJGU4WDCZP/action/citation_signature","submit_replication":"https://pith.science/pith/BFX4XA74H6C5D3SBOJGU4WDCZP/action/replication_record"}},"created_at":"2026-07-05T04:42:47.290494+00:00","updated_at":"2026-07-05T04:42:47.290494+00:00"}