{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NWYRORGOPJQXGIALFLEWHBTVJO","short_pith_number":"pith:NWYRORGO","schema_version":"1.0","canonical_sha256":"6db11744ce7a6173200b2ac96386754ba9dcd9f99f42e39a4f1b6d5c089d9b5d","source":{"kind":"arxiv","id":"2405.16218","version":2},"attestation_state":"computed","paper":{"title":"On the Optimal Time Complexities in Decentralized Stochastic Asynchronous Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Tyurin, Peter Richt\\'arik","submitted_at":"2024-05-25T13:04:21Z","abstract_excerpt":"We consider the decentralized stochastic asynchronous optimization setup, where many workers asynchronously calculate stochastic gradients and asynchronously communicate with each other using edges in a multigraph. For both homogeneous and heterogeneous setups, we prove new time complexity lower bounds under the assumption that computation and communication speeds are bounded. We develop a new nearly optimal method, Fragile SGD, and a new optimal method, Amelie SGD, that converge under arbitrary heterogeneous computation and communication speeds and match our lower bounds (up to a logarithmic "},"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":"2405.16218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-25T13:04:21Z","cross_cats_sorted":[],"title_canon_sha256":"73f137879df4297578b2a48160e6d2782c4c3f424fad56379a7beb99aa117cd5","abstract_canon_sha256":"aa81e819636f5c0f69c79876a506e9094ece256513bbc2df5a735671378f4bdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:14.903469Z","signature_b64":"9s8mHLtnyOssqU9PD4GEtA8p1wRcpyV+6Jz/WTZo28p7FI7RyQWXn872/gx807QVHR4XaEL19tvEfsn2NtgOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6db11744ce7a6173200b2ac96386754ba9dcd9f99f42e39a4f1b6d5c089d9b5d","last_reissued_at":"2026-07-05T09:30:14.902993Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:14.902993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Optimal Time Complexities in Decentralized Stochastic Asynchronous Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Tyurin, Peter Richt\\'arik","submitted_at":"2024-05-25T13:04:21Z","abstract_excerpt":"We consider the decentralized stochastic asynchronous optimization setup, where many workers asynchronously calculate stochastic gradients and asynchronously communicate with each other using edges in a multigraph. For both homogeneous and heterogeneous setups, we prove new time complexity lower bounds under the assumption that computation and communication speeds are bounded. We develop a new nearly optimal method, Fragile SGD, and a new optimal method, Amelie SGD, that converge under arbitrary heterogeneous computation and communication speeds and match our lower bounds (up to a logarithmic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16218","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/2405.16218/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":"2405.16218","created_at":"2026-07-05T09:30:14.903049+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.16218v2","created_at":"2026-07-05T09:30:14.903049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16218","created_at":"2026-07-05T09:30:14.903049+00:00"},{"alias_kind":"pith_short_12","alias_value":"NWYRORGOPJQX","created_at":"2026-07-05T09:30:14.903049+00:00"},{"alias_kind":"pith_short_16","alias_value":"NWYRORGOPJQXGIAL","created_at":"2026-07-05T09:30:14.903049+00:00"},{"alias_kind":"pith_short_8","alias_value":"NWYRORGO","created_at":"2026-07-05T09:30:14.903049+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NWYRORGOPJQXGIALFLEWHBTVJO","json":"https://pith.science/pith/NWYRORGOPJQXGIALFLEWHBTVJO.json","graph_json":"https://pith.science/api/pith-number/NWYRORGOPJQXGIALFLEWHBTVJO/graph.json","events_json":"https://pith.science/api/pith-number/NWYRORGOPJQXGIALFLEWHBTVJO/events.json","paper":"https://pith.science/paper/NWYRORGO"},"agent_actions":{"view_html":"https://pith.science/pith/NWYRORGOPJQXGIALFLEWHBTVJO","download_json":"https://pith.science/pith/NWYRORGOPJQXGIALFLEWHBTVJO.json","view_paper":"https://pith.science/paper/NWYRORGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.16218&json=true","fetch_graph":"https://pith.science/api/pith-number/NWYRORGOPJQXGIALFLEWHBTVJO/graph.json","fetch_events":"https://pith.science/api/pith-number/NWYRORGOPJQXGIALFLEWHBTVJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NWYRORGOPJQXGIALFLEWHBTVJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NWYRORGOPJQXGIALFLEWHBTVJO/action/storage_attestation","attest_author":"https://pith.science/pith/NWYRORGOPJQXGIALFLEWHBTVJO/action/author_attestation","sign_citation":"https://pith.science/pith/NWYRORGOPJQXGIALFLEWHBTVJO/action/citation_signature","submit_replication":"https://pith.science/pith/NWYRORGOPJQXGIALFLEWHBTVJO/action/replication_record"}},"created_at":"2026-07-05T09:30:14.903049+00:00","updated_at":"2026-07-05T09:30:14.903049+00:00"}