{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7JG3XNKBASE7TIWEGRTVQOVS3Q","short_pith_number":"pith:7JG3XNKB","schema_version":"1.0","canonical_sha256":"fa4dbbb5410489f9a2c43467583ab2dc36b0339e4f15873fe3d4fcebbc28ee2b","source":{"kind":"arxiv","id":"2411.07182","version":1},"attestation_state":"computed","paper":{"title":"Revisiting Ensembling in One-Shot Federated Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Akash Dhasade, Anne-Marie Kermarrec, Nirupam Gupta, Rachid Guerraoui, Rafael Pinot, Rafael Pires, Rishi Sharma, Youssef Allouah","submitted_at":"2024-11-11T17:58:28Z","abstract_excerpt":"Federated learning (FL) is an appealing approach to training machine learning models without sharing raw data. However, standard FL algorithms are iterative and thus induce a significant communication cost. One-shot federated learning (OFL) trades the iterative exchange of models between clients and the server with a single round of communication, thereby saving substantially on communication costs. Not surprisingly, OFL exhibits a performance gap in terms of accuracy with respect to FL, especially under high data heterogeneity. We introduce FENS, a novel federated ensembling scheme that appro"},"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":"2411.07182","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-11T17:58:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6ee90e66570e25451e3237128d05dbb435df3e0bfae397ee23a4ec30ed29918f","abstract_canon_sha256":"26c71a8791b8a55e8a75747dcb50b5a0cf19061e72ee38b2a63fc575cb9e0283"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:58.481480Z","signature_b64":"9C1CYom6p6mfla4NtMYmdXlgwoL+hOk7vIJR8V3SDBt4HV2yfF6vgQBnqYdNgNk5e9bfbaPoZ/cHa7b36G4cAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa4dbbb5410489f9a2c43467583ab2dc36b0339e4f15873fe3d4fcebbc28ee2b","last_reissued_at":"2026-07-05T09:33:58.480998Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:58.480998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Ensembling in One-Shot Federated Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Akash Dhasade, Anne-Marie Kermarrec, Nirupam Gupta, Rachid Guerraoui, Rafael Pinot, Rafael Pires, Rishi Sharma, Youssef Allouah","submitted_at":"2024-11-11T17:58:28Z","abstract_excerpt":"Federated learning (FL) is an appealing approach to training machine learning models without sharing raw data. However, standard FL algorithms are iterative and thus induce a significant communication cost. One-shot federated learning (OFL) trades the iterative exchange of models between clients and the server with a single round of communication, thereby saving substantially on communication costs. Not surprisingly, OFL exhibits a performance gap in terms of accuracy with respect to FL, especially under high data heterogeneity. We introduce FENS, a novel federated ensembling scheme that appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.07182","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/2411.07182/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":"2411.07182","created_at":"2026-07-05T09:33:58.481051+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.07182v1","created_at":"2026-07-05T09:33:58.481051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.07182","created_at":"2026-07-05T09:33:58.481051+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JG3XNKBASE7","created_at":"2026-07-05T09:33:58.481051+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JG3XNKBASE7TIWE","created_at":"2026-07-05T09:33:58.481051+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JG3XNKB","created_at":"2026-07-05T09:33:58.481051+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00656","citing_title":"Demystifying the Optimal Fair Classifier in Multi-Class Classification","ref_index":81,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7JG3XNKBASE7TIWEGRTVQOVS3Q","json":"https://pith.science/pith/7JG3XNKBASE7TIWEGRTVQOVS3Q.json","graph_json":"https://pith.science/api/pith-number/7JG3XNKBASE7TIWEGRTVQOVS3Q/graph.json","events_json":"https://pith.science/api/pith-number/7JG3XNKBASE7TIWEGRTVQOVS3Q/events.json","paper":"https://pith.science/paper/7JG3XNKB"},"agent_actions":{"view_html":"https://pith.science/pith/7JG3XNKBASE7TIWEGRTVQOVS3Q","download_json":"https://pith.science/pith/7JG3XNKBASE7TIWEGRTVQOVS3Q.json","view_paper":"https://pith.science/paper/7JG3XNKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.07182&json=true","fetch_graph":"https://pith.science/api/pith-number/7JG3XNKBASE7TIWEGRTVQOVS3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/7JG3XNKBASE7TIWEGRTVQOVS3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JG3XNKBASE7TIWEGRTVQOVS3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JG3XNKBASE7TIWEGRTVQOVS3Q/action/storage_attestation","attest_author":"https://pith.science/pith/7JG3XNKBASE7TIWEGRTVQOVS3Q/action/author_attestation","sign_citation":"https://pith.science/pith/7JG3XNKBASE7TIWEGRTVQOVS3Q/action/citation_signature","submit_replication":"https://pith.science/pith/7JG3XNKBASE7TIWEGRTVQOVS3Q/action/replication_record"}},"created_at":"2026-07-05T09:33:58.481051+00:00","updated_at":"2026-07-05T09:33:58.481051+00:00"}