{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:2ASBVTSVHGO32LH5RI64VNI4OI","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":"fc28b889dc3788f7650b0dd70ffa0ada3dc94026e4da6e83b5db3720e3f41185","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-13T10:22:22Z","title_canon_sha256":"94d14bd1fc0339c019c748be60267e33cf0f48d1ebbd3a27e6e3394e7554b139"},"schema_version":"1.0","source":{"id":"2506.11647","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.11647","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"arxiv_version","alias_value":"2506.11647v2","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11647","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"pith_short_12","alias_value":"2ASBVTSVHGO3","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"pith_short_16","alias_value":"2ASBVTSVHGO32LH5","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"pith_short_8","alias_value":"2ASBVTSV","created_at":"2026-07-05T11:23:29Z"}],"graph_snapshots":[{"event_id":"sha256:244d947526df4b6500058b8150a8d3ac2c4a553f9133e0251d7c81559c622fba","target":"graph","created_at":"2026-07-05T11:23:29Z","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/2506.11647/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, the problem of distributed optimization is studied via a network of agents. Each agent only has access to a noisy gradient of its own objective function, and can communicate with its neighbors via a network. To handle this problem, a distributed clipped stochastic gradient descent algorithm is proposed, and the high probability convergence of the algorithm is studied. Existing works on distributed algorithms involving stochastic gradients only consider the light-tailed noises. Different from them, we study the case with heavy-tailed settings. Under mild assumptions on the graph ","authors_text":"Kaihong Lu, Long Wang, Yuchen Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.11647","kind":"arxiv","version":2},"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:5e37991ddf6fee8cfd00b043ac2139a43d2c8aa35af3a84696c6b7bc3a4793d9","target":"record","created_at":"2026-07-05T11:23:29Z","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":"fc28b889dc3788f7650b0dd70ffa0ada3dc94026e4da6e83b5db3720e3f41185","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-13T10:22:22Z","title_canon_sha256":"94d14bd1fc0339c019c748be60267e33cf0f48d1ebbd3a27e6e3394e7554b139"},"schema_version":"1.0","source":{"id":"2506.11647","kind":"arxiv","version":2}},"canonical_sha256":"d0241ace55399dbd2cfd8a3dcab51c72276696ff2b28b2af00b5377578422303","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0241ace55399dbd2cfd8a3dcab51c72276696ff2b28b2af00b5377578422303","first_computed_at":"2026-07-05T11:23:29.970705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:23:29.970705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bxf/p+7B804yX2TP80aIBbM+Wr12F376yX3AE0f9pV8Wz8NauZKWaVinPXpWeswVvO6uyLCfxwQCDZoxJ2NSBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:23:29.971187Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.11647","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e37991ddf6fee8cfd00b043ac2139a43d2c8aa35af3a84696c6b7bc3a4793d9","sha256:244d947526df4b6500058b8150a8d3ac2c4a553f9133e0251d7c81559c622fba"],"state_sha256":"53f37be8216b9d8592df3daa0726a695b21bbecf54502db72b3a2037a2c394fd"}