{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:HZG35IM6FEU36AMDOSVRYMAQEU","short_pith_number":"pith:HZG35IM6","schema_version":"1.0","canonical_sha256":"3e4dbea19e2929bf018374ab1c3010253053527edd434dc4f692d539294d3a37","source":{"kind":"arxiv","id":"2007.02315","version":1},"attestation_state":"computed","paper":{"title":"Multi-Armed Bandit Based Client Scheduling for Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Hongbo Zhu, Howard H. Yang, Kun Guo, Tony Q. S. Quek, Wanli Wen, Wenchao Xia","submitted_at":"2020-07-05T12:32:32Z","abstract_excerpt":"By exploiting the computing power and local data of distributed clients, federated learning (FL) features ubiquitous properties such as reduction of communication overhead and preserving data privacy. In each communication round of FL, the clients update local models based on their own data and upload their local updates via wireless channels. However, latency caused by hundreds to thousands of communication rounds remains a bottleneck in FL. To minimize the training latency, this work provides a multi-armed bandit-based framework for online client scheduling (CS) in FL without knowing wireles"},"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":"2007.02315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-05T12:32:32Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"f382702abe570867464427b10b315725a0fc6aff30f6115e6c6ee7f5fc376346","abstract_canon_sha256":"18b14d8315666d1b656eb9dae82a0627fb3207c68bd3b03807424bb919989abc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:20:19.997888Z","signature_b64":"HZIOoLN37V9ox3ecwYcbBYGGYuuLCowRyEY/CN+Cg1RWj7R1IpApb/9IaMxRm0gOXuj8qwLKee7h6Kg+RMgvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e4dbea19e2929bf018374ab1c3010253053527edd434dc4f692d539294d3a37","last_reissued_at":"2026-07-05T01:20:19.997464Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:20:19.997464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Armed Bandit Based Client Scheduling for Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Hongbo Zhu, Howard H. Yang, Kun Guo, Tony Q. S. Quek, Wanli Wen, Wenchao Xia","submitted_at":"2020-07-05T12:32:32Z","abstract_excerpt":"By exploiting the computing power and local data of distributed clients, federated learning (FL) features ubiquitous properties such as reduction of communication overhead and preserving data privacy. In each communication round of FL, the clients update local models based on their own data and upload their local updates via wireless channels. However, latency caused by hundreds to thousands of communication rounds remains a bottleneck in FL. To minimize the training latency, this work provides a multi-armed bandit-based framework for online client scheduling (CS) in FL without knowing wireles"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02315","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/2007.02315/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":"2007.02315","created_at":"2026-07-05T01:20:19.997522+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.02315v1","created_at":"2026-07-05T01:20:19.997522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02315","created_at":"2026-07-05T01:20:19.997522+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZG35IM6FEU3","created_at":"2026-07-05T01:20:19.997522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZG35IM6FEU36AMD","created_at":"2026-07-05T01:20:19.997522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZG35IM6","created_at":"2026-07-05T01:20:19.997522+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/HZG35IM6FEU36AMDOSVRYMAQEU","json":"https://pith.science/pith/HZG35IM6FEU36AMDOSVRYMAQEU.json","graph_json":"https://pith.science/api/pith-number/HZG35IM6FEU36AMDOSVRYMAQEU/graph.json","events_json":"https://pith.science/api/pith-number/HZG35IM6FEU36AMDOSVRYMAQEU/events.json","paper":"https://pith.science/paper/HZG35IM6"},"agent_actions":{"view_html":"https://pith.science/pith/HZG35IM6FEU36AMDOSVRYMAQEU","download_json":"https://pith.science/pith/HZG35IM6FEU36AMDOSVRYMAQEU.json","view_paper":"https://pith.science/paper/HZG35IM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.02315&json=true","fetch_graph":"https://pith.science/api/pith-number/HZG35IM6FEU36AMDOSVRYMAQEU/graph.json","fetch_events":"https://pith.science/api/pith-number/HZG35IM6FEU36AMDOSVRYMAQEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZG35IM6FEU36AMDOSVRYMAQEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZG35IM6FEU36AMDOSVRYMAQEU/action/storage_attestation","attest_author":"https://pith.science/pith/HZG35IM6FEU36AMDOSVRYMAQEU/action/author_attestation","sign_citation":"https://pith.science/pith/HZG35IM6FEU36AMDOSVRYMAQEU/action/citation_signature","submit_replication":"https://pith.science/pith/HZG35IM6FEU36AMDOSVRYMAQEU/action/replication_record"}},"created_at":"2026-07-05T01:20:19.997522+00:00","updated_at":"2026-07-05T01:20:19.997522+00:00"}