{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:G3WXTLIO3WIXKACD3KIFV4SJGY","short_pith_number":"pith:G3WXTLIO","schema_version":"1.0","canonical_sha256":"36ed79ad0edd91750043da905af2493620fb5a88e4e2db68262f593d6cfd5e67","source":{"kind":"arxiv","id":"2004.10386","version":2},"attestation_state":"computed","paper":{"title":"Hierarchically Fair Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Antonio Robles-Kelly, Cheng Li, Jingfeng Zhang, Mohan Kankanhalli","submitted_at":"2020-04-22T03:41:06Z","abstract_excerpt":"When the federated learning is adopted among competitive agents with siloed datasets, agents are self-interested and participate only if they are fairly rewarded. To encourage the application of federated learning, this paper employs a management strategy, i.e., more contributions should lead to more rewards. We propose a novel hierarchically fair federated learning (HFFL) framework. Under this framework, agents are rewarded in proportion to their pre-negotiated contribution levels. HFFL+ extends this to incorporate heterogeneous models. Theoretical analysis and empirical evaluation on several"},"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":"2004.10386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-22T03:41:06Z","cross_cats_sorted":["cs.AI","cs.CY","stat.ML"],"title_canon_sha256":"0903cec9c56f8ac0c68b680b875acea4aa418cd895358ab19cf510a086dd17a2","abstract_canon_sha256":"1603d3b45de366f49000d36779f6d28ce08ca1371ac246ac86b32c078fda3646"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:59:36.625670Z","signature_b64":"yMAQOm7dq1Xw5xIYNQH8C2bc0UsYs/1C9urXF/9lEFRQRmEnjGJ1zpDl4A3emo1YCFpBce9wl5DkHQZ8jeEqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36ed79ad0edd91750043da905af2493620fb5a88e4e2db68262f593d6cfd5e67","last_reissued_at":"2026-07-05T00:59:36.625194Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:59:36.625194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchically Fair Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Antonio Robles-Kelly, Cheng Li, Jingfeng Zhang, Mohan Kankanhalli","submitted_at":"2020-04-22T03:41:06Z","abstract_excerpt":"When the federated learning is adopted among competitive agents with siloed datasets, agents are self-interested and participate only if they are fairly rewarded. To encourage the application of federated learning, this paper employs a management strategy, i.e., more contributions should lead to more rewards. We propose a novel hierarchically fair federated learning (HFFL) framework. Under this framework, agents are rewarded in proportion to their pre-negotiated contribution levels. HFFL+ extends this to incorporate heterogeneous models. Theoretical analysis and empirical evaluation on several"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.10386","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/2004.10386/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":"2004.10386","created_at":"2026-07-05T00:59:36.625254+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.10386v2","created_at":"2026-07-05T00:59:36.625254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.10386","created_at":"2026-07-05T00:59:36.625254+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3WXTLIO3WIX","created_at":"2026-07-05T00:59:36.625254+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3WXTLIO3WIXKACD","created_at":"2026-07-05T00:59:36.625254+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3WXTLIO","created_at":"2026-07-05T00:59:36.625254+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.04850","citing_title":"Aequa: Fair Model Rewards in Collaborative Learning via Slimmable Networks","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G3WXTLIO3WIXKACD3KIFV4SJGY","json":"https://pith.science/pith/G3WXTLIO3WIXKACD3KIFV4SJGY.json","graph_json":"https://pith.science/api/pith-number/G3WXTLIO3WIXKACD3KIFV4SJGY/graph.json","events_json":"https://pith.science/api/pith-number/G3WXTLIO3WIXKACD3KIFV4SJGY/events.json","paper":"https://pith.science/paper/G3WXTLIO"},"agent_actions":{"view_html":"https://pith.science/pith/G3WXTLIO3WIXKACD3KIFV4SJGY","download_json":"https://pith.science/pith/G3WXTLIO3WIXKACD3KIFV4SJGY.json","view_paper":"https://pith.science/paper/G3WXTLIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.10386&json=true","fetch_graph":"https://pith.science/api/pith-number/G3WXTLIO3WIXKACD3KIFV4SJGY/graph.json","fetch_events":"https://pith.science/api/pith-number/G3WXTLIO3WIXKACD3KIFV4SJGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3WXTLIO3WIXKACD3KIFV4SJGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3WXTLIO3WIXKACD3KIFV4SJGY/action/storage_attestation","attest_author":"https://pith.science/pith/G3WXTLIO3WIXKACD3KIFV4SJGY/action/author_attestation","sign_citation":"https://pith.science/pith/G3WXTLIO3WIXKACD3KIFV4SJGY/action/citation_signature","submit_replication":"https://pith.science/pith/G3WXTLIO3WIXKACD3KIFV4SJGY/action/replication_record"}},"created_at":"2026-07-05T00:59:36.625254+00:00","updated_at":"2026-07-05T00:59:36.625254+00:00"}