{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LFSEV42Q2JQ53ANLTWZRIWQQOV","short_pith_number":"pith:LFSEV42Q","schema_version":"1.0","canonical_sha256":"59644af350d261dd81ab9db3145a10757c34a99d324c605acb689be9048df3b1","source":{"kind":"arxiv","id":"2107.09481","version":1},"attestation_state":"computed","paper":{"title":"FPT Approximation for Fair Minimum-Load Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Fedor V. Fomin, Kirill Simonov, Nidhi Purohit, Petr A. Golovach, Sayan Bandyapadhyay","submitted_at":"2021-07-20T13:34:13Z","abstract_excerpt":"In this paper, we consider the Minimum-Load $k$-Clustering/Facility Location (MLkC) problem where we are given a set $P$ of $n$ points in a metric space that we have to cluster and an integer $k$ that denotes the number of clusters. Additionally, we are given a set $F$ of cluster centers in the same metric space. The goal is to select a set $C\\subseteq F$ of $k$ centers and assign each point in $P$ to a center in $C$, such that the maximum load over all centers is minimized. Here the load of a center is the sum of the distances between it and the points assigned to it.\n  Although clustering/fa"},"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":"2107.09481","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2021-07-20T13:34:13Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"e8d43e57e5185971a23d99e2838579a22d3385c88bcee53f54e176905b087f53","abstract_canon_sha256":"3c015f684d7d52d21027937986777e111fd1f6ed6f72ab8e64f7e8024cdbc1eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:59:31.485469Z","signature_b64":"lXD3vZZTao5z2Wbwwo9e3uf7ASHahYhMA8VxnZapZ7DQlRsFOWs19fTTj/o2OL2BRDprhzt8MbhwGNq6f3QzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59644af350d261dd81ab9db3145a10757c34a99d324c605acb689be9048df3b1","last_reissued_at":"2026-07-05T02:59:31.485017Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:59:31.485017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FPT Approximation for Fair Minimum-Load Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Fedor V. Fomin, Kirill Simonov, Nidhi Purohit, Petr A. Golovach, Sayan Bandyapadhyay","submitted_at":"2021-07-20T13:34:13Z","abstract_excerpt":"In this paper, we consider the Minimum-Load $k$-Clustering/Facility Location (MLkC) problem where we are given a set $P$ of $n$ points in a metric space that we have to cluster and an integer $k$ that denotes the number of clusters. Additionally, we are given a set $F$ of cluster centers in the same metric space. The goal is to select a set $C\\subseteq F$ of $k$ centers and assign each point in $P$ to a center in $C$, such that the maximum load over all centers is minimized. Here the load of a center is the sum of the distances between it and the points assigned to it.\n  Although clustering/fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.09481","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/2107.09481/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":"2107.09481","created_at":"2026-07-05T02:59:31.485078+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.09481v1","created_at":"2026-07-05T02:59:31.485078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.09481","created_at":"2026-07-05T02:59:31.485078+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFSEV42Q2JQ5","created_at":"2026-07-05T02:59:31.485078+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFSEV42Q2JQ53ANL","created_at":"2026-07-05T02:59:31.485078+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFSEV42Q","created_at":"2026-07-05T02:59:31.485078+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/LFSEV42Q2JQ53ANLTWZRIWQQOV","json":"https://pith.science/pith/LFSEV42Q2JQ53ANLTWZRIWQQOV.json","graph_json":"https://pith.science/api/pith-number/LFSEV42Q2JQ53ANLTWZRIWQQOV/graph.json","events_json":"https://pith.science/api/pith-number/LFSEV42Q2JQ53ANLTWZRIWQQOV/events.json","paper":"https://pith.science/paper/LFSEV42Q"},"agent_actions":{"view_html":"https://pith.science/pith/LFSEV42Q2JQ53ANLTWZRIWQQOV","download_json":"https://pith.science/pith/LFSEV42Q2JQ53ANLTWZRIWQQOV.json","view_paper":"https://pith.science/paper/LFSEV42Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.09481&json=true","fetch_graph":"https://pith.science/api/pith-number/LFSEV42Q2JQ53ANLTWZRIWQQOV/graph.json","fetch_events":"https://pith.science/api/pith-number/LFSEV42Q2JQ53ANLTWZRIWQQOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFSEV42Q2JQ53ANLTWZRIWQQOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFSEV42Q2JQ53ANLTWZRIWQQOV/action/storage_attestation","attest_author":"https://pith.science/pith/LFSEV42Q2JQ53ANLTWZRIWQQOV/action/author_attestation","sign_citation":"https://pith.science/pith/LFSEV42Q2JQ53ANLTWZRIWQQOV/action/citation_signature","submit_replication":"https://pith.science/pith/LFSEV42Q2JQ53ANLTWZRIWQQOV/action/replication_record"}},"created_at":"2026-07-05T02:59:31.485078+00:00","updated_at":"2026-07-05T02:59:31.485078+00:00"}