{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KAZUW2ZUDKAVDE7P4Q6DLKZTF6","short_pith_number":"pith:KAZUW2ZU","schema_version":"1.0","canonical_sha256":"50334b6b341a815193efe43c35ab332fa7dbdf62a93f4ed2ca8bb042fc17ae27","source":{"kind":"arxiv","id":"1905.10497","version":2},"attestation_state":"computed","paper":{"title":"Fair Resource Allocation in Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ahmad Beirami, Maziar Sanjabi, Tian Li, Virginia Smith","submitted_at":"2019-05-25T01:47:41Z","abstract_excerpt":"Federated learning involves training statistical models in massive, heterogeneous networks. Naively minimizing an aggregate loss function in such a network may disproportionately advantage or disadvantage some of the devices. In this work, we propose q-Fair Federated Learning (q-FFL), a novel optimization objective inspired by fair resource allocation in wireless networks that encourages a more fair (specifically, a more uniform) accuracy distribution across devices in federated networks. To solve q-FFL, we devise a communication-efficient method, q-FedAvg, that is suited to federated networks"},"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":"1905.10497","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-25T01:47:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"59c574ab5530aa37b9071337ab9da3821685ee4e78ab4a795ebcae46c7403f89","abstract_canon_sha256":"e02f77ef6edecbd8e7179551542211850617a8b17ecf9f39c99940ac819c65f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:55.475852Z","signature_b64":"RpW7vy2riY/YhNj9iYqAg7BocI2fVoOwYYBQrkg3HF0Iup3YYy8vkNpe8BUu5Gvt+24rY4Nx3+NScVDSNNxkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50334b6b341a815193efe43c35ab332fa7dbdf62a93f4ed2ca8bb042fc17ae27","last_reissued_at":"2026-07-05T00:40:55.475390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:55.475390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Resource Allocation in Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ahmad Beirami, Maziar Sanjabi, Tian Li, Virginia Smith","submitted_at":"2019-05-25T01:47:41Z","abstract_excerpt":"Federated learning involves training statistical models in massive, heterogeneous networks. Naively minimizing an aggregate loss function in such a network may disproportionately advantage or disadvantage some of the devices. In this work, we propose q-Fair Federated Learning (q-FFL), a novel optimization objective inspired by fair resource allocation in wireless networks that encourages a more fair (specifically, a more uniform) accuracy distribution across devices in federated networks. To solve q-FFL, we devise a communication-efficient method, q-FedAvg, that is suited to federated networks"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10497","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/1905.10497/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":"1905.10497","created_at":"2026-07-05T00:40:55.475449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10497v2","created_at":"2026-07-05T00:40:55.475449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10497","created_at":"2026-07-05T00:40:55.475449+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAZUW2ZUDKAV","created_at":"2026-07-05T00:40:55.475449+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAZUW2ZUDKAVDE7P","created_at":"2026-07-05T00:40:55.475449+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAZUW2ZU","created_at":"2026-07-05T00:40:55.475449+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10250","citing_title":"Multi-Level Analyzation of Imbalance to Resolve Non-IID-Ness in Federated Learning","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10124","citing_title":"FedSteer: Taming Extreme Gradient Staleness in Federated Learning with Corrective Projections and Caching","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09869","citing_title":"QSplitFL: Capability Aware Deep Q-Learning for Optimal Split Point Selection in Split Federated Learning","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07621","citing_title":"HASA: Subnet Allocation for Compute-Constrained Model-Heterogeneous Federated Learning","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2503.16251","citing_title":"RESFL: An Uncertainty-Aware Framework for Responsible Federated Learning by Balancing Privacy, Fairness and Utility","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2003.00295","citing_title":"Adaptive Federated Optimization","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2510.04772","citing_title":"Federated Learning for Surgical Vision in Appendicitis Classification: Results of the FedSurg EndoVis 2024 Challenge","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2510.26841","citing_title":"FedPF: Accurate Target Privacy Preserving Federated Learning Balancing Fairness and Utility","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2512.12022","citing_title":"DFedReweighting: A Unified Framework for Objective-Oriented Reweighting in Decentralized Federated Learning","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22885","citing_title":"Federated Cross-Modal Retrieval with Missing Modalities via Semantic Routing and Adapter Personalization","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KAZUW2ZUDKAVDE7P4Q6DLKZTF6","json":"https://pith.science/pith/KAZUW2ZUDKAVDE7P4Q6DLKZTF6.json","graph_json":"https://pith.science/api/pith-number/KAZUW2ZUDKAVDE7P4Q6DLKZTF6/graph.json","events_json":"https://pith.science/api/pith-number/KAZUW2ZUDKAVDE7P4Q6DLKZTF6/events.json","paper":"https://pith.science/paper/KAZUW2ZU"},"agent_actions":{"view_html":"https://pith.science/pith/KAZUW2ZUDKAVDE7P4Q6DLKZTF6","download_json":"https://pith.science/pith/KAZUW2ZUDKAVDE7P4Q6DLKZTF6.json","view_paper":"https://pith.science/paper/KAZUW2ZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10497&json=true","fetch_graph":"https://pith.science/api/pith-number/KAZUW2ZUDKAVDE7P4Q6DLKZTF6/graph.json","fetch_events":"https://pith.science/api/pith-number/KAZUW2ZUDKAVDE7P4Q6DLKZTF6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAZUW2ZUDKAVDE7P4Q6DLKZTF6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAZUW2ZUDKAVDE7P4Q6DLKZTF6/action/storage_attestation","attest_author":"https://pith.science/pith/KAZUW2ZUDKAVDE7P4Q6DLKZTF6/action/author_attestation","sign_citation":"https://pith.science/pith/KAZUW2ZUDKAVDE7P4Q6DLKZTF6/action/citation_signature","submit_replication":"https://pith.science/pith/KAZUW2ZUDKAVDE7P4Q6DLKZTF6/action/replication_record"}},"created_at":"2026-07-05T00:40:55.475449+00:00","updated_at":"2026-07-05T00:40:55.475449+00:00"}