{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:6MKJAXBBM37UR7RL4WPJAFRT7C","short_pith_number":"pith:6MKJAXBB","schema_version":"1.0","canonical_sha256":"f314905c2166ff48fe2be59e901633f8ab26aa0675d91e1caf5873aae60e37a3","source":{"kind":"arxiv","id":"2205.13797","version":2},"attestation_state":"computed","paper":{"title":"AsyncFedED: Asynchronous Federated Learning with Euclidean Distance based Adaptive Weight Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Jiming Chen, Qianqian Yang, Qiyuan Wang, Shibo He, Zhiguo Shi","submitted_at":"2022-05-27T07:18:11Z","abstract_excerpt":"In an asynchronous federated learning framework, the server updates the global model once it receives an update from a client instead of waiting for all the updates to arrive as in the synchronous setting. This allows heterogeneous devices with varied computing power to train the local models without pausing, thereby speeding up the training process. However, it introduces the stale model problem, where the newly arrived update was calculated based on a set of stale weights that are older than the current global model, which may hurt the convergence of the model. In this paper, we present an a"},"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":"2205.13797","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-27T07:18:11Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"87cec20b7a25f13039eb60e9e8fa7204a095b5282fd7dffa03fd8686a37cfa0b","abstract_canon_sha256":"5b23f98ae70f04340e77ac8fc7c9e1b1e3df8a50cb38859a6072c87c86c90793"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:29:34.495648Z","signature_b64":"AG2drHXNVuCZEGYHBpMXpu0LY3m/my1Y5KuWfFE6w9zUxnUdvdMXMXE+jjKFA5wtdobXD+Dwc8hP9gS4iJ1GDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f314905c2166ff48fe2be59e901633f8ab26aa0675d91e1caf5873aae60e37a3","last_reissued_at":"2026-07-05T04:29:34.495156Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:29:34.495156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AsyncFedED: Asynchronous Federated Learning with Euclidean Distance based Adaptive Weight Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Jiming Chen, Qianqian Yang, Qiyuan Wang, Shibo He, Zhiguo Shi","submitted_at":"2022-05-27T07:18:11Z","abstract_excerpt":"In an asynchronous federated learning framework, the server updates the global model once it receives an update from a client instead of waiting for all the updates to arrive as in the synchronous setting. This allows heterogeneous devices with varied computing power to train the local models without pausing, thereby speeding up the training process. However, it introduces the stale model problem, where the newly arrived update was calculated based on a set of stale weights that are older than the current global model, which may hurt the convergence of the model. In this paper, we present an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.13797","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/2205.13797/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":"2205.13797","created_at":"2026-07-05T04:29:34.495227+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.13797v2","created_at":"2026-07-05T04:29:34.495227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.13797","created_at":"2026-07-05T04:29:34.495227+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MKJAXBBM37U","created_at":"2026-07-05T04:29:34.495227+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MKJAXBBM37UR7RL","created_at":"2026-07-05T04:29:34.495227+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MKJAXBB","created_at":"2026-07-05T04:29:34.495227+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.05372","citing_title":"Breaking the Capacity Bottleneck in Model-Heterogeneous Federated Learning via Gradual Model Restoration","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13434","citing_title":"Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity","ref_index":154,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6MKJAXBBM37UR7RL4WPJAFRT7C","json":"https://pith.science/pith/6MKJAXBBM37UR7RL4WPJAFRT7C.json","graph_json":"https://pith.science/api/pith-number/6MKJAXBBM37UR7RL4WPJAFRT7C/graph.json","events_json":"https://pith.science/api/pith-number/6MKJAXBBM37UR7RL4WPJAFRT7C/events.json","paper":"https://pith.science/paper/6MKJAXBB"},"agent_actions":{"view_html":"https://pith.science/pith/6MKJAXBBM37UR7RL4WPJAFRT7C","download_json":"https://pith.science/pith/6MKJAXBBM37UR7RL4WPJAFRT7C.json","view_paper":"https://pith.science/paper/6MKJAXBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.13797&json=true","fetch_graph":"https://pith.science/api/pith-number/6MKJAXBBM37UR7RL4WPJAFRT7C/graph.json","fetch_events":"https://pith.science/api/pith-number/6MKJAXBBM37UR7RL4WPJAFRT7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MKJAXBBM37UR7RL4WPJAFRT7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MKJAXBBM37UR7RL4WPJAFRT7C/action/storage_attestation","attest_author":"https://pith.science/pith/6MKJAXBBM37UR7RL4WPJAFRT7C/action/author_attestation","sign_citation":"https://pith.science/pith/6MKJAXBBM37UR7RL4WPJAFRT7C/action/citation_signature","submit_replication":"https://pith.science/pith/6MKJAXBBM37UR7RL4WPJAFRT7C/action/replication_record"}},"created_at":"2026-07-05T04:29:34.495227+00:00","updated_at":"2026-07-05T04:29:34.495227+00:00"}