{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:N4O57HRNL67P755X7Y6C6TTUS3","short_pith_number":"pith:N4O57HRN","schema_version":"1.0","canonical_sha256":"6f1ddf9e2d5fbefff7b7fe3c2f4e7496ebfad6960f8c87f5dc5677f4d245ff91","source":{"kind":"arxiv","id":"2301.09357","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Fair Federated Learning: Adaptive Federated Adam","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Andreas Hellander, Li Ju, Salman Toor, Tianru Zhang","submitted_at":"2023-01-23T10:56:12Z","abstract_excerpt":"Federated learning is a distributed and privacy-preserving approach to train a statistical model collaboratively from decentralized data of different parties. However, when datasets of participants are not independent and identically distributed (non-IID), models trained by naive federated algorithms may be biased towards certain participants, and model performance across participants is non-uniform. This is known as the fairness problem in federated learning. In this paper, we formulate fairness-controlled federated learning as a dynamical multi-objective optimization problem to ensure fair p"},"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":"2301.09357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-23T10:56:12Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f50accbbce102edd4f5f2d30319d48880cfccc634538e8ab533ce45b8e785519","abstract_canon_sha256":"6938bf9a67d637df67d9ea2a6be4e6f652887951216973ce0d58e6729abc8724"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:34:59.942933Z","signature_b64":"4wth6ncSQgum6Dxw3LZaIlx+vBbNIbfY7daDdGbWfP2dhyzCFDbX3rRxSwOt5+1rgAAFIqjk6zk0H+dA9DnCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f1ddf9e2d5fbefff7b7fe3c2f4e7496ebfad6960f8c87f5dc5677f4d245ff91","last_reissued_at":"2026-07-05T05:34:59.942566Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:34:59.942566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Fair Federated Learning: Adaptive Federated Adam","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Andreas Hellander, Li Ju, Salman Toor, Tianru Zhang","submitted_at":"2023-01-23T10:56:12Z","abstract_excerpt":"Federated learning is a distributed and privacy-preserving approach to train a statistical model collaboratively from decentralized data of different parties. However, when datasets of participants are not independent and identically distributed (non-IID), models trained by naive federated algorithms may be biased towards certain participants, and model performance across participants is non-uniform. This is known as the fairness problem in federated learning. In this paper, we formulate fairness-controlled federated learning as a dynamical multi-objective optimization problem to ensure fair p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.09357","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/2301.09357/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":"2301.09357","created_at":"2026-07-05T05:34:59.942626+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.09357v1","created_at":"2026-07-05T05:34:59.942626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.09357","created_at":"2026-07-05T05:34:59.942626+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4O57HRNL67P","created_at":"2026-07-05T05:34:59.942626+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4O57HRNL67P755X","created_at":"2026-07-05T05:34:59.942626+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4O57HRN","created_at":"2026-07-05T05:34:59.942626+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14070","citing_title":"Towards Adaptive Asynchronous Federated Learning for Human Activity Recognition","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N4O57HRNL67P755X7Y6C6TTUS3","json":"https://pith.science/pith/N4O57HRNL67P755X7Y6C6TTUS3.json","graph_json":"https://pith.science/api/pith-number/N4O57HRNL67P755X7Y6C6TTUS3/graph.json","events_json":"https://pith.science/api/pith-number/N4O57HRNL67P755X7Y6C6TTUS3/events.json","paper":"https://pith.science/paper/N4O57HRN"},"agent_actions":{"view_html":"https://pith.science/pith/N4O57HRNL67P755X7Y6C6TTUS3","download_json":"https://pith.science/pith/N4O57HRNL67P755X7Y6C6TTUS3.json","view_paper":"https://pith.science/paper/N4O57HRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.09357&json=true","fetch_graph":"https://pith.science/api/pith-number/N4O57HRNL67P755X7Y6C6TTUS3/graph.json","fetch_events":"https://pith.science/api/pith-number/N4O57HRNL67P755X7Y6C6TTUS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4O57HRNL67P755X7Y6C6TTUS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4O57HRNL67P755X7Y6C6TTUS3/action/storage_attestation","attest_author":"https://pith.science/pith/N4O57HRNL67P755X7Y6C6TTUS3/action/author_attestation","sign_citation":"https://pith.science/pith/N4O57HRNL67P755X7Y6C6TTUS3/action/citation_signature","submit_replication":"https://pith.science/pith/N4O57HRNL67P755X7Y6C6TTUS3/action/replication_record"}},"created_at":"2026-07-05T05:34:59.942626+00:00","updated_at":"2026-07-05T05:34:59.942626+00:00"}