{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:FVHFGIVIQNBK2NE353N2HSSVKL","short_pith_number":"pith:FVHFGIVI","canonical_record":{"source":{"id":"2206.08307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-16T17:10:57Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"0c4b207ebc1dabb1151a9b61abf8e64cc862cf7ab65274fac12ac6dd0f45526e","abstract_canon_sha256":"d11ef3165caae296ade649971675eb3e7e35758f8b4363ce7c7ba42676a078f5"},"schema_version":"1.0"},"canonical_sha256":"2d4e5322a88342ad349beedba3ca5552d37b1ab1081fe2bb71917c0e1cf53a1c","source":{"kind":"arxiv","id":"2206.08307","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.08307","created_at":"2026-07-05T04:32:24Z"},{"alias_kind":"arxiv_version","alias_value":"2206.08307v1","created_at":"2026-07-05T04:32:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.08307","created_at":"2026-07-05T04:32:24Z"},{"alias_kind":"pith_short_12","alias_value":"FVHFGIVIQNBK","created_at":"2026-07-05T04:32:24Z"},{"alias_kind":"pith_short_16","alias_value":"FVHFGIVIQNBK2NE3","created_at":"2026-07-05T04:32:24Z"},{"alias_kind":"pith_short_8","alias_value":"FVHFGIVI","created_at":"2026-07-05T04:32:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:FVHFGIVIQNBK2NE353N2HSSVKL","target":"record","payload":{"canonical_record":{"source":{"id":"2206.08307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-16T17:10:57Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"0c4b207ebc1dabb1151a9b61abf8e64cc862cf7ab65274fac12ac6dd0f45526e","abstract_canon_sha256":"d11ef3165caae296ade649971675eb3e7e35758f8b4363ce7c7ba42676a078f5"},"schema_version":"1.0"},"canonical_sha256":"2d4e5322a88342ad349beedba3ca5552d37b1ab1081fe2bb71917c0e1cf53a1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:32:24.276057Z","signature_b64":"XD1Yfrr1tSfKj2keeDwDtiJ595MWJp5l/yCUsrujcqEGGgM4wZKzezyXfcwboiLj84leWfwvhd8B6+Hu3mtCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d4e5322a88342ad349beedba3ca5552d37b1ab1081fe2bb71917c0e1cf53a1c","last_reissued_at":"2026-07-05T04:32:24.275578Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:32:24.275578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.08307","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:32:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Bb6nC7olGzty7Muv4dl8vDOo0J8rRGquJRJXK+APqJwR1qXiShV9HaAPIKObWaPPsY+ix7liM0P7t7KuegeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:25:07.160216Z"},"content_sha256":"8fbca2310bf5de40fff115fd7a7481f634d9b7030aa95ae874e42a5296346c75","schema_version":"1.0","event_id":"sha256:8fbca2310bf5de40fff115fd7a7481f634d9b7030aa95ae874e42a5296346c75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:FVHFGIVIQNBK2NE353N2HSSVKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharper Convergence Guarantees for Asynchronous SGD for Distributed and Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.LG","authors_text":"Anastasia Koloskova, Martin Jaggi, Sebastian U. Stich","submitted_at":"2022-06-16T17:10:57Z","abstract_excerpt":"We study the asynchronous stochastic gradient descent algorithm for distributed training over $n$ workers which have varying computation and communication frequency over time. In this algorithm, workers compute stochastic gradients in parallel at their own pace and return those to the server without any synchronization. Existing convergence rates of this algorithm for non-convex smooth objectives depend on the maximum gradient delay $\\tau_{\\max}$ and show that an $\\epsilon$-stationary point is reached after $\\mathcal{O}\\!\\left(\\sigma^2\\epsilon^{-2}+ \\tau_{\\max}\\epsilon^{-1}\\right)$ iterations,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.08307","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/2206.08307/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:32:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oAo+v7hEHD18ZNbaY7xUziAc9R/lBiS8nWqHPeNw5e/nAE0Rq6G5L94kXlJt1LoJE5lTBZkQUir15U2EP2DLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:25:07.160609Z"},"content_sha256":"aeae521ac39b87a466c1d43eadb11216112056742cce3fb459bb60c40e7cea28","schema_version":"1.0","event_id":"sha256:aeae521ac39b87a466c1d43eadb11216112056742cce3fb459bb60c40e7cea28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVHFGIVIQNBK2NE353N2HSSVKL/bundle.json","state_url":"https://pith.science/pith/FVHFGIVIQNBK2NE353N2HSSVKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVHFGIVIQNBK2NE353N2HSSVKL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T10:25:07Z","links":{"resolver":"https://pith.science/pith/FVHFGIVIQNBK2NE353N2HSSVKL","bundle":"https://pith.science/pith/FVHFGIVIQNBK2NE353N2HSSVKL/bundle.json","state":"https://pith.science/pith/FVHFGIVIQNBK2NE353N2HSSVKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVHFGIVIQNBK2NE353N2HSSVKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:FVHFGIVIQNBK2NE353N2HSSVKL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d11ef3165caae296ade649971675eb3e7e35758f8b4363ce7c7ba42676a078f5","cross_cats_sorted":["cs.DC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-16T17:10:57Z","title_canon_sha256":"0c4b207ebc1dabb1151a9b61abf8e64cc862cf7ab65274fac12ac6dd0f45526e"},"schema_version":"1.0","source":{"id":"2206.08307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.08307","created_at":"2026-07-05T04:32:24Z"},{"alias_kind":"arxiv_version","alias_value":"2206.08307v1","created_at":"2026-07-05T04:32:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.08307","created_at":"2026-07-05T04:32:24Z"},{"alias_kind":"pith_short_12","alias_value":"FVHFGIVIQNBK","created_at":"2026-07-05T04:32:24Z"},{"alias_kind":"pith_short_16","alias_value":"FVHFGIVIQNBK2NE3","created_at":"2026-07-05T04:32:24Z"},{"alias_kind":"pith_short_8","alias_value":"FVHFGIVI","created_at":"2026-07-05T04:32:24Z"}],"graph_snapshots":[{"event_id":"sha256:aeae521ac39b87a466c1d43eadb11216112056742cce3fb459bb60c40e7cea28","target":"graph","created_at":"2026-07-05T04:32:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2206.08307/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the asynchronous stochastic gradient descent algorithm for distributed training over $n$ workers which have varying computation and communication frequency over time. In this algorithm, workers compute stochastic gradients in parallel at their own pace and return those to the server without any synchronization. Existing convergence rates of this algorithm for non-convex smooth objectives depend on the maximum gradient delay $\\tau_{\\max}$ and show that an $\\epsilon$-stationary point is reached after $\\mathcal{O}\\!\\left(\\sigma^2\\epsilon^{-2}+ \\tau_{\\max}\\epsilon^{-1}\\right)$ iterations,","authors_text":"Anastasia Koloskova, Martin Jaggi, Sebastian U. Stich","cross_cats":["cs.DC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-16T17:10:57Z","title":"Sharper Convergence Guarantees for Asynchronous SGD for Distributed and Federated Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.08307","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8fbca2310bf5de40fff115fd7a7481f634d9b7030aa95ae874e42a5296346c75","target":"record","created_at":"2026-07-05T04:32:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d11ef3165caae296ade649971675eb3e7e35758f8b4363ce7c7ba42676a078f5","cross_cats_sorted":["cs.DC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-16T17:10:57Z","title_canon_sha256":"0c4b207ebc1dabb1151a9b61abf8e64cc862cf7ab65274fac12ac6dd0f45526e"},"schema_version":"1.0","source":{"id":"2206.08307","kind":"arxiv","version":1}},"canonical_sha256":"2d4e5322a88342ad349beedba3ca5552d37b1ab1081fe2bb71917c0e1cf53a1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d4e5322a88342ad349beedba3ca5552d37b1ab1081fe2bb71917c0e1cf53a1c","first_computed_at":"2026-07-05T04:32:24.275578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:32:24.275578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XD1Yfrr1tSfKj2keeDwDtiJ595MWJp5l/yCUsrujcqEGGgM4wZKzezyXfcwboiLj84leWfwvhd8B6+Hu3mtCDg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:32:24.276057Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.08307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fbca2310bf5de40fff115fd7a7481f634d9b7030aa95ae874e42a5296346c75","sha256:aeae521ac39b87a466c1d43eadb11216112056742cce3fb459bb60c40e7cea28"],"state_sha256":"17c827fa0e10dde0627d5f110276ae2cc82c9994ff0446f09c11480853bca44a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bvZTL/Vqn65YNOO59hXDsxR8z5MZg5g1paZVnMdyuHaFmw7JM+PvVB2HzR2Y9jFbmv9lNaMIztZ9/FKtvEkcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:25:07.162670Z","bundle_sha256":"20c46708208f147fa3bd9b4aa8d32591439cdb43966d6005e470def8e02c0aeb"}}