{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:U3FAUDXIH26DSJVZQGDRWTDGDX","short_pith_number":"pith:U3FAUDXI","schema_version":"1.0","canonical_sha256":"a6ca0a0ee83ebc3926b981871b4c661dd201b356b66e54ed30af27159df61306","source":{"kind":"arxiv","id":"2211.01549","version":2},"attestation_state":"computed","paper":{"title":"Client Selection in Federated Learning: Principles, Challenges, and Opportunities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ge Gao, Huanle Zhang, Lei Fu, Mi Zhang, Xin Liu","submitted_at":"2022-11-03T01:51:14Z","abstract_excerpt":"As a privacy-preserving paradigm for training Machine Learning (ML) models, Federated Learning (FL) has received tremendous attention from both industry and academia. In a typical FL scenario, clients exhibit significant heterogeneity in terms of data distribution and hardware configurations. Thus, randomly sampling clients in each training round may not fully exploit the local updates from heterogeneous clients, resulting in lower model accuracy, slower convergence rate, degraded fairness, etc. To tackle the FL client heterogeneity problem, various client selection algorithms have been develo"},"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":"2211.01549","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-03T01:51:14Z","cross_cats_sorted":[],"title_canon_sha256":"465ac7799e64537d83a74844df5aab385dcb538c75cb03b598bc94ce474284a3","abstract_canon_sha256":"d053271c6dab293f57e968aa5bc69d4e9ff3d8021c8ea9c890610b29c679be9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:34:46.185467Z","signature_b64":"Tixv/JVu5+UqhVZEyPUjnRWzCGRRVGKtm1ZjZZ2WHbMQWPfpcSfgWtoKjaI+ksj7cEZqOx3KZhZ4Ll/6+4bFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6ca0a0ee83ebc3926b981871b4c661dd201b356b66e54ed30af27159df61306","last_reissued_at":"2026-07-05T06:34:46.184988Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:34:46.184988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Client Selection in Federated Learning: Principles, Challenges, and Opportunities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ge Gao, Huanle Zhang, Lei Fu, Mi Zhang, Xin Liu","submitted_at":"2022-11-03T01:51:14Z","abstract_excerpt":"As a privacy-preserving paradigm for training Machine Learning (ML) models, Federated Learning (FL) has received tremendous attention from both industry and academia. In a typical FL scenario, clients exhibit significant heterogeneity in terms of data distribution and hardware configurations. Thus, randomly sampling clients in each training round may not fully exploit the local updates from heterogeneous clients, resulting in lower model accuracy, slower convergence rate, degraded fairness, etc. To tackle the FL client heterogeneity problem, various client selection algorithms have been develo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01549","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/2211.01549/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":"2211.01549","created_at":"2026-07-05T06:34:46.185046+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.01549v2","created_at":"2026-07-05T06:34:46.185046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01549","created_at":"2026-07-05T06:34:46.185046+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3FAUDXIH26D","created_at":"2026-07-05T06:34:46.185046+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3FAUDXIH26DSJVZ","created_at":"2026-07-05T06:34:46.185046+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3FAUDXI","created_at":"2026-07-05T06:34:46.185046+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12754","citing_title":"AFBS:Buffer Gradient Selection in Semi-asynchronous Federated Learning","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U3FAUDXIH26DSJVZQGDRWTDGDX","json":"https://pith.science/pith/U3FAUDXIH26DSJVZQGDRWTDGDX.json","graph_json":"https://pith.science/api/pith-number/U3FAUDXIH26DSJVZQGDRWTDGDX/graph.json","events_json":"https://pith.science/api/pith-number/U3FAUDXIH26DSJVZQGDRWTDGDX/events.json","paper":"https://pith.science/paper/U3FAUDXI"},"agent_actions":{"view_html":"https://pith.science/pith/U3FAUDXIH26DSJVZQGDRWTDGDX","download_json":"https://pith.science/pith/U3FAUDXIH26DSJVZQGDRWTDGDX.json","view_paper":"https://pith.science/paper/U3FAUDXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.01549&json=true","fetch_graph":"https://pith.science/api/pith-number/U3FAUDXIH26DSJVZQGDRWTDGDX/graph.json","fetch_events":"https://pith.science/api/pith-number/U3FAUDXIH26DSJVZQGDRWTDGDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3FAUDXIH26DSJVZQGDRWTDGDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3FAUDXIH26DSJVZQGDRWTDGDX/action/storage_attestation","attest_author":"https://pith.science/pith/U3FAUDXIH26DSJVZQGDRWTDGDX/action/author_attestation","sign_citation":"https://pith.science/pith/U3FAUDXIH26DSJVZQGDRWTDGDX/action/citation_signature","submit_replication":"https://pith.science/pith/U3FAUDXIH26DSJVZQGDRWTDGDX/action/replication_record"}},"created_at":"2026-07-05T06:34:46.185046+00:00","updated_at":"2026-07-05T06:34:46.185046+00:00"}