{"as_of":"2026-08-16T23:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f977399843730f5df9d29b2cffb7bfdf8fcf3e17f6b14c9aae490f2d882c3c2e","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:15:01.553238Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T13:25:34.934769Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T13:16:35.038381Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.11647","snapshot_observed_at":"2026-08-04T13:25:34.934769Z","title":"High probability convergence of distributed clipped stochastic gradient descent with heavy-tailed noise,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.01377","last_updated":"2026-06-02T08:11:16Z","snapshot_observed_at":"2026-08-06T12:50:41.925411Z","submitted_at":"2025-10-01T19:06:11Z","title":"DeMuon: A Decentralized Muon for Matrix Optimization over Graphs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T13:25:34.934769Z"},"links":{"cited_paper":"/paper/2506.11647","citing_paper":"/paper/2510.01377"},"observation_digest":"sha256:d9826dc09f18f086459c4db16bf5dfcae9e6285d4c4463f4d0c86134ac75a582","observation_id":"94739c9a-cb15-4adf-8f40-bac5985b5e61","resolution":{"observed_at":"2026-08-04T13:25:34.934769Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"cited_work":{"arxiv_id":"2506.11647","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.11647","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","venue":null,"work_id":"7cd3dc34-cbbe-4f48-9b1b-78ccf5b25928","year":2025},"citing_paper":{"arxiv_id":"2510.06141","last_updated":"2026-05-21T09:57:40Z","snapshot_observed_at":"2026-08-15T03:40:44.399710Z","submitted_at":"2025-10-07T17:15:08Z","title":"High-Probability Convergence Guarantees of Decentralized SGD","version":5},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-05-18T08:45:22.688243Z"},"links":{"cited_paper":"/paper/2506.11647","citing_paper":"/paper/2510.06141"},"observation_digest":"sha256:165767fe9d87a264f2930c707ec57ad1399fb3586f44fea3897d0e890f6570a9","observation_id":"41d4b4f2-ca32-42d1-aed8-385b0a5510d4","resolution":{"observed_at":"2026-05-18T08:46:07.865839Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"cited_work":{"arxiv_id":"2506.11647","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.11647","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","venue":null,"work_id":"7cd3dc34-cbbe-4f48-9b1b-78ccf5b25928","year":2025},"citing_paper":{"arxiv_id":"2510.06141","last_updated":"2026-05-21T09:57:40Z","snapshot_observed_at":"2026-08-15T03:40:44.399710Z","submitted_at":"2025-10-07T17:15:08Z","title":"High-Probability Convergence Guarantees of Decentralized SGD","version":6},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-05-22T13:14:57.263058Z"},"links":{"cited_paper":"/paper/2506.11647","citing_paper":"/paper/2510.06141"},"observation_digest":"sha256:ce85d5262dffce8c18f910ad56d8095f6445e4b80c45b901f0e72de94c23e662","observation_id":"88d49083-6c25-41bb-ac29-ea5ab0b97e6f","resolution":{"observed_at":"2026-05-22T13:16:35.042217Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.11647/citation-record","integrity":"/paper/2506.11647/integrity","json":"/paper/2506.11647/citation-record.json","paper":"/paper/2506.11647"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.235923Z","title":"Distributed subgradient methods for multi-agent optimiza- tion,","venue":null,"work_id":"da22fba2-7901-447c-886d-b7a83fbd6fbb","year":2009},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.363593Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:e7c6ec77b4bfa2eca2928ed1e8762423c60a4040ba82405592f033d36bfdcf35","observation_id":"8aba1cd0-ac79-4581-9524-e00cfef9b15f","resolution":{"observed_at":"2026-08-07T04:15:02.240619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.221802Z","title":"A new approach to consensus problems in discrete-time multiagent 18 systems with time-delays,","venue":null,"work_id":"1629cfb7-30ff-4dd5-9353-0edf3ba9a09e","year":2007},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.369527Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:9e534b7315bd563a3509b7493ad31df294e917583e4398198115111d9683a62f","observation_id":"7b3426f4-ff69-4314-8077-ae9eb8033be4","resolution":{"observed_at":"2026-08-07T04:15:02.226564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.207722Z","title":"Controllability of multi-agent systems based on agreement protocols,","venue":null,"work_id":"a3a65a60-9c12-4834-8a5b-ccbefd22049e","year":2009},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.374300Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:868cd0b89ace0835076f838862b9a503862d7b8cbf478ea0fd3f34322c0c88d6","observation_id":"9fab57a5-4da6-4e84-805e-32893016db90","resolution":{"observed_at":"2026-08-07T04:15:02.212097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.193777Z","title":"Finite-time consensus problems for networks of dynamic agents,","venue":null,"work_id":"3c558c90-e5f0-42e2-99b4-d28658e1a429","year":2010},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.379117Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:8bb401e8302e98e30c6e9410d3762bd9838707f4bd0a50c0038a8b58ca6d83e3","observation_id":"54cd9b08-7e43-4e42-a945-904494a1ee80","resolution":{"observed_at":"2026-08-07T04:15:02.198388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.179360Z","title":"Distributed optimization over time-varying directed graphs,","venue":null,"work_id":"5ac1a0d1-a7f9-448d-98f0-6f9b33db8c02","year":2015},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.384147Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:ce3535ac1550fc8fd196411d2868e72cfc460f3be3032c22171733983d3892f5","observation_id":"f58c1d9b-e155-4f82-99f6-ba9f67b16a3a","resolution":{"observed_at":"2026-08-07T04:15:02.184194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.165042Z","title":"Distributed continuous-time convex optimization with time- varying cost functions,","venue":null,"work_id":"5a0fb13a-b9ad-4608-b4ec-a10aeb024610","year":2017},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.388947Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:1c9a2d9ff36c8e088f8b69633921c3b7492b8940f01abc4fbb53196980fb0fb9","observation_id":"c8b83c1b-97d6-4fea-8ec4-b688c0f05832","resolution":{"observed_at":"2026-08-07T04:15:02.170125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.150716Z","title":"Large-scale distributed dedicated- and non-dedicated smart city sensing systems,","venue":null,"work_id":"356bc110-0567-4b5c-a94a-f8df53af50fe","year":2017},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.394977Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:815e0172d8e5de92202f855000faadf9189c09b05946e7cac90daf5eec0b5efd","observation_id":"281b1a73-9bce-44c8-9185-ff97b9df80ed","resolution":{"observed_at":"2026-08-07T04:15:02.155339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.136419Z","title":"Zhu and S","venue":null,"work_id":"dbd48544-b29e-4f51-9f67-98b36a91886a","year":2015},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.400435Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:16ddfab5156173abf4fa2b4eaca3c6883b1f533d7a58256d8eb9db3bfd327266","observation_id":"f98879c5-7c0b-40c1-ba51-be67872cb793","resolution":{"observed_at":"2026-08-07T04:15:02.140926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.121849Z","title":"Initialization-free distributed fixed-time convergent algorithms for optimal resource allocation,","venue":null,"work_id":"eb2d7b68-dfe4-45ee-a577-91df68f913c5","year":2022},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.404859Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:275033670f0a3e3bbd3ef5e6e26809ab9c6311f0559d24b285fc32ffb962e6ef","observation_id":"9b9949e0-0b85-466e-bff9-8b221e6a85c8","resolution":{"observed_at":"2026-08-07T04:15:02.126538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.107437Z","title":"Wireless sensor networks for environmental monitoring: The sensorscope experience,","venue":null,"work_id":"cb66253f-cabd-44c1-846b-e64d95ffdc03","year":2008},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.409549Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:ce81cbfa8d6ca4767cec4020fb073d3c22e4daba0d171aacb7007bc655078923","observation_id":"d21338b8-26f4-4f2b-bc9d-f670c8016f54","resolution":{"observed_at":"2026-08-07T04:15:02.112349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.091007Z","title":"Network topology and communication- computation tradeoffs in decentralized optimization,","venue":null,"work_id":"08e2c7f4-ca82-4cae-b0ee-e8d716c46cb5","year":2018},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.413934Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:61bd207ce7e316c6a443c30efb0526511eae11beceff3cfcc4a836ad0b70714c","observation_id":"e01df233-a14f-448c-9eae-786e429641eb","resolution":{"observed_at":"2026-08-07T04:15:02.096572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.075991Z","title":"A general framework for decentralized opti- mization with first-order methods,","venue":null,"work_id":"165b5aab-b669-43a7-a554-8c083fd4dc87","year":2020},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.418844Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:ec891a2a0e19bcd9b9e88067a388bb962b2db3dea61bba3244de866879c4e499","observation_id":"daec4f9a-a64c-43ee-bfdd-018cd266d177","resolution":{"observed_at":"2026-08-07T04:15:02.080616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.060524Z","title":"Asymptotic network independence in dis- tributed stochastic optimization for machine learning: Examining distributed and central- ized stochastic gradient descent,","venue":null,"work_id":"626da577-dbc7-416b-a27f-1acc39946da1","year":2020},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.423841Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:1e50c5c844c3f961999f839a6dbd3ed6066693af1e921c4f23f2b160ee3c6d8c","observation_id":"607712fa-1541-4f41-b9d8-d7a44ba49e9e","resolution":{"observed_at":"2026-08-07T04:15:02.066102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.045731Z","title":"Gradient-tracking-based distributed optimization with guaranteed optimality under noisy information sharing,","venue":null,"work_id":"6b65e8dc-04b9-4600-a5bc-c6d416cc2b5d","year":2023},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.428549Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:4918c716ccb40f9dc3405553ea3e8ff38c88356821460113302739a3e9e207c6","observation_id":"534b99da-4305-493d-9f45-58dab91f8828","resolution":{"observed_at":"2026-08-07T04:15:02.050619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.031153Z","title":"Event-triggered distributed stochastic mirror descent for convex optimization,","venue":null,"work_id":"3a17a795-08c0-4a1c-afe3-38d49f43b6f5","year":2022},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.433557Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:01044988c7916ee0ef035ac4123d8fad214e84189981f20c711e9f02e03d60ad","observation_id":"68f37e39-36e2-476e-ab7c-4391ed233083","resolution":{"observed_at":"2026-08-07T04:15:02.035883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.439171Z","title":"High-probability convergence bounds for non- convex stochastic gradient descent,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.439171Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:3e52811f7ba5af3f77e8a28e8fd3863ce9bdbee005f4c838b4f110d0db12bcc5","observation_id":"eb8abdca-5ef5-4537-ac04-6be312cd4bfa","resolution":{"observed_at":"2026-08-07T04:15:01.439171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.02000","last_updated":"2023-11-03T15:55:53Z","snapshot_observed_at":"2026-08-16T14:46:10.796001Z","submitted_at":"2023-11-03T15:55:53Z","title":"High Probability Convergence of Adam Under Unbounded Gradients and Affine Variance Noise","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.02000","snapshot_observed_at":"2026-08-07T04:15:01.443520Z","title":"High probability convergence of adam under unbounded gradients and affine variance noise,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.443520Z"},"links":{"cited_paper":"/paper/2311.02000","citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:0f8be85d5550c9e37aee3c38a9cbcc3859856c87b7eba6ec1ca9089e9c875803","observation_id":"31fb552f-07d7-416f-a8d0-c557f8c30f16","resolution":{"observed_at":"2026-08-07T04:15:01.443520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.016645Z","title":"High probability conver- gence of stochastic gradient methods,","venue":null,"work_id":"b810e376-6063-435e-9d07-96f5a5e722b0","year":2023},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.448448Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:19226b79f471db874a39b1eb8165c46d2765c9e9f0efdb146e982f7ae1345da8","observation_id":"9cdb571f-8c90-41c7-a2f5-c92c2889c97e","resolution":{"observed_at":"2026-08-07T04:15:02.021398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:02.001637Z","title":"Convergence in high probability of distributed stochastic gradient descent algorithms,","venue":null,"work_id":"4f6e785f-7d05-49f7-a83e-fd099dd3a32e","year":2023},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.453206Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:c9845ad2b4d0057550b1abe2882f0383b031ab5270b92077705338e22b461745","observation_id":"86e69ce8-f407-485d-b263-da99670a7a33","resolution":{"observed_at":"2026-08-07T04:15:02.006350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.987185Z","title":"Distributed (atc) gradient descent for high dimension sparse regression,","venue":null,"work_id":"aa71b508-eb05-4c45-9bf4-a62b890805b2","year":2023},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.458332Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:c42d4ec1274a953d34c4b7f5736336e5a9eef8d9c0d4992fea3e4b444ca9c77d","observation_id":"1a197036-a4d7-405f-9a13-82a85befc603","resolution":{"observed_at":"2026-08-07T04:15:01.992290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.972028Z","title":"L´evy flights in evolutionary ecology,","venue":null,"work_id":"852ba8c2-d8bf-4c3d-a868-bd9bfedc6ed2","year":2012},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.462954Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:d794aa23d3c4a97631f409ec42f8b1f986ca63db2e19c1c4cce09837dd51a1a3","observation_id":"c5d5e75e-c158-4201-8f7a-9a9ea12d1ab8","resolution":{"observed_at":"2026-08-07T04:15:01.976584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.956592Z","title":"Generalized wiener filtering with fractional power spectro- grams,","venue":null,"work_id":"ae91c5b8-0b5d-4930-acba-31d376229320","year":2015},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.467230Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:e104d78c4f46aa4a4c59c4a61ee49594b611d8f3e4d0d990b5bc57517ad366c7","observation_id":"34e34e32-21c7-4e16-99ec-cf3f9cfdb46d","resolution":{"observed_at":"2026-08-07T04:15:01.961623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.941993Z","title":"Fractals and scaling in finance,","venue":null,"work_id":"d27fc777-7e01-4276-9190-9d060a2bb369","year":1997},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.471857Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:3c1353ccdd079cef044c4f5228aa6e011043bde74d8444393decab4993d6a915","observation_id":"2700a2f7-077e-4501-8a43-a3dfddd2ccb6","resolution":{"observed_at":"2026-08-07T04:15:01.947024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.926887Z","title":"A tail-index analysis of stochastic gradi- ent noise in deep neural networks,","venue":null,"work_id":"eb912afd-b7dd-4cbf-9c27-a33b29c17f3c","year":2019},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.477846Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:a41b85d7e5b966194cebd813341f885d270d4129766a5c5367440bc4aebad33a","observation_id":"7d5167ee-4247-46f4-87d1-7e10bac7790d","resolution":{"observed_at":"2026-08-07T04:15:01.931583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.911912Z","title":"On the difficulty of training recurrent neural networks,","venue":null,"work_id":"bdc3c174-2360-4c6e-a318-f712acaff81a","year":2013},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.482865Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:5c56a771fd72cfb9fd0fcc6a79ad485ca380f4b31557c002ea84d0d7120cb51a","observation_id":"af07adbb-924b-4393-91f5-7b7a1aa8c4b9","resolution":{"observed_at":"2026-08-07T04:15:01.916789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.896020Z","title":"Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: A generic algorithmic framework,","venue":null,"work_id":"3320d40e-d78a-40f7-a4e3-0d6a22933964","year":2012},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.488354Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:7bef168c16cc48ea9b6eaf610264a61d07e2f099b10938e3165e319c93f0c7dd","observation_id":"f66f735e-1d8e-4db2-ba97-ce691638a65b","resolution":{"observed_at":"2026-08-07T04:15:01.901086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.880073Z","title":"An ac- celerated method for decentralized distributed stochastic optimization over time-varying graphs,","venue":null,"work_id":"bf793abf-608b-4eac-a48b-80a7fc2c4d59","year":2021},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.493012Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:97e3b58eed9114e581ce67ac2fce258f005cb73a48fa4a9829d6b150948aad0e","observation_id":"4008a803-ac36-480d-a53f-0d07eb6857fd","resolution":{"observed_at":"2026-08-07T04:15:01.886051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.05437","last_updated":"2023-04-03T17:18:48Z","snapshot_observed_at":"2026-08-16T22:28:42.353623Z","submitted_at":"2023-02-10T18:54:51Z","title":"High Probability Convergence of Clipped-SGD Under Heavy-tailed Noise","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.05437","snapshot_observed_at":"2026-08-07T04:15:01.497885Z","title":"High probability convergence of clipped-sgd under heavy-tailed noise,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.497885Z"},"links":{"cited_paper":"/paper/2302.05437","citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:3c4a22f6c36375fcc333c2db8b390f8d0b3d5c129a3bc9c28d095bc5954c182b","observation_id":"0bb79662-e9f8-4eed-8c6e-e79c9323d158","resolution":{"observed_at":"2026-08-07T04:15:01.497885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.865091Z","title":"High-probability bounds for stochastic optimization and varia- tional inequalities: the case of unbounded variance,","venue":null,"work_id":"3c0046a1-e16e-417a-95bd-8c6f1110eab4","year":2023},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.502969Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:c5389df85abed075d59188751943519840e6db356d308816874dae94b9284cc8","observation_id":"83adfd2a-3a63-442b-b3d3-7870a9b9298f","resolution":{"observed_at":"2026-08-07T04:15:01.870002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.849726Z","title":"High-probability convergence for composite and distributed stochastic minimization and variational inequalities with heavy-tailed noise,","venue":null,"work_id":"0813f365-5446-401b-9978-078d897d0bf8","year":2024},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.507676Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:9d68c556ebfda194c0071bf6d5bb86d0b30684beb781dca2f4684487a5a40210","observation_id":"05813027-46ac-4298-8bc5-f13d42b3f0db","resolution":{"observed_at":"2026-08-07T04:15:01.854585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.834213Z","title":"Distributed online optimization in dynamic environ- ments using mirror descent,","venue":null,"work_id":"d0899dc2-c2b8-4485-b87e-f176876e3413","year":2018},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.512161Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:9d604a340c9308d049c84bde5796c48baa9c916b3e7d86175b35aa5922ce90eb","observation_id":"ee049291-4f25-4222-904d-cc4431e18a9e","resolution":{"observed_at":"2026-08-07T04:15:01.839213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.01119","last_updated":"2023-04-04T17:27:53Z","snapshot_observed_at":"2026-08-16T15:43:09.178759Z","submitted_at":"2023-04-03T16:34:11Z","title":"Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tails","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.01119","snapshot_observed_at":"2026-08-07T04:15:01.516951Z","title":"Improved convergence in high probability of clipped gradient methods with heavy tails,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.516951Z"},"links":{"cited_paper":"/paper/2304.01119","citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:fa49b689f9f795bd1ce252b02a960cecea8b786eca04ff90ac993ac330049e5c","observation_id":"caa17b06-7462-47d7-9c44-36eb67061e40","resolution":{"observed_at":"2026-08-07T04:15:01.516951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.09896","last_updated":"2023-05-17T02:13:18Z","snapshot_observed_at":"2026-08-16T15:32:29.666693Z","submitted_at":"2023-05-17T02:13:18Z","title":"Convergence and Privacy of Decentralized Nonconvex Optimization with Gradient Clipping and Communication Compression","version":1},"cited_work":{"arxiv_id":"2305.09896","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.09896","snapshot_observed_at":"2026-08-07T04:15:01.589781Z","title":"Convergence and Privacy of Decentralized Nonconvex Optimization with Gradient Clipping and Communication Compression","venue":"cs.LG","work_id":"c5f92577-d45e-403c-904d-a15ab98e19a5","year":2023},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.521787Z"},"links":{"cited_paper":"/paper/2305.09896","citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:6d772b8126c06a7af22d6982226308d67d38c3458d960da99bb319115fbbc286","observation_id":"f0075f76-2954-4b3d-a63b-11b23da3408b","resolution":{"observed_at":"2026-08-07T04:15:01.598132Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.819112Z","title":"Problem complexity and method efficiency in opti- mization,","venue":null,"work_id":"d9bcb579-0e14-4270-8836-15bd60a3eed7","year":1983},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.526649Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:00fd3eb384871f27ae0f60f44846c5561fcf192ecfdcfa9ba249303f8efad86c","observation_id":"6b506689-ef80-461e-bba6-61e142221d53","resolution":{"observed_at":"2026-08-07T04:15:01.824149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.802420Z","title":"Why are adaptive methods good for attention models?","venue":null,"work_id":"1a178dbf-22e9-4233-a4a0-7875ff06ef42","year":2020},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.531027Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:2ca3fc2cd2cf65e98ce88ef305292173e2400fd214a1977b6f82d3dfb326db8f","observation_id":"6e7fa612-f723-4248-be88-419798c806dc","resolution":{"observed_at":"2026-08-07T04:15:01.807692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.786010Z","title":"Asynchronous consensus in continuous-time multi-agent systems with switching topology and time-varying delays,","venue":null,"work_id":"96466005-a20f-475b-8b4e-487242a0b2c0","year":2008},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.535797Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:db34ece9fa04cf37380cafb560c4c9b587043b7677f5509a4068ee0b695fe497","observation_id":"6867699b-0b72-4496-bf6f-52edfed74bf4","resolution":{"observed_at":"2026-08-07T04:15:01.790886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.769827Z","title":"Group consensus in multi-agent systems with switching topologies,","venue":null,"work_id":"8111f182-1171-40cb-ac90-391d15fa4895","year":2009},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.540149Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:50f46036c427302694cdb4797d68143b7af570cc11afb44d6de986fd368f7a9d","observation_id":"4f73c731-c6f5-4662-a302-4aeb6434d9de","resolution":{"observed_at":"2026-08-07T04:15:01.774753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.754066Z","title":"A new class of distributed optimiza- tion algorithms: Application to regression of distributed data,","venue":null,"work_id":"51f98b16-a1b1-4a76-a01e-41269b93cbb2","year":2012},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.544320Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:fe0b39629fcd866a9aa5380b5eb8204cc4b4eaacedf2880f2c7ec455df2de35d","observation_id":"b60c584a-1273-431d-beb1-ac3e88f364e7","resolution":{"observed_at":"2026-08-07T04:15:01.759209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.738224Z","title":"On the difficulty of training recurrent neural networks,","venue":null,"work_id":"c3604fa0-2a62-44fb-b8e7-810a5b14acae","year":2013},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.548926Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:289435144fd67bf8bc2df09d35a925998c99e3db00d43c0ed959d55be88f8021","observation_id":"1322ebc0-9463-444a-9302-f947a6546b42","resolution":{"observed_at":"2026-08-07T04:15:01.743334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:15:01.722837Z","title":"Stochastic optimization with heavy-tailed noise via accelerated gradient clipping,","venue":null,"work_id":"66cad753-0d81-4a88-bd91-6783fcfe3489","year":2020},"citing_paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:01.553238Z"},"links":{"citing_paper":"/paper/2506.11647"},"observation_digest":"sha256:54b8b8e5bebd5ea7c41c46db271c1d94dee8620cac61c97cf3469904abe38ea3","observation_id":"857fc0c8-a18c-4b82-87c0-531ddc8e534c","resolution":{"observed_at":"2026-08-07T04:15:01.728039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.11647","last_updated":"2025-06-18T14:43:58Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T03:27:07.460592Z","submitted_at":"2025-06-13T10:22:22Z","title":"High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":35},"total_outbound_references":40},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 3 inbound Pith citation observations for arXiv:2506.11647."}