{"as_of":"2026-08-16T06:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c89525122973cab5bd3d69ec45448c6344ca846622da79ac7cae4266f6fa7fa2","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:47:24.860546Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.06693/citation-record","integrity":"/paper/1908.06693/integrity","json":"/paper/1908.06693/citation-record.json","paper":"/paper/1908.06693"},"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-14T12:47:25.508833Z","title":"Scaling distributed ma chine learning with the parameter server,","venue":null,"work_id":"c8e7ca6e-2e34-4f22-bde9-1427c307dbc3","year":2014},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.701565Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:e01385edf7ed4c4f3a0badef8ef2eddbd0ad3fc789047eba8c8a9bb314840efc","observation_id":"dec812ee-b7a2-43ca-b7bf-fcd62f91cb11","resolution":{"observed_at":"2026-08-14T12:47:25.515622Z","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-14T12:47:25.485483Z","title":"A comparison of distributed machine learning platforms,","venue":null,"work_id":"b17450fd-7b8b-4f22-82e6-c8787c891051","year":2017},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.707897Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:b0fb85663d14e26e238e91ea35ea175012f05032ba093056e5527a7af40f52d3","observation_id":"63dd8017-4892-4e6e-9f23-c2b48faadd4d","resolution":{"observed_at":"2026-08-14T12:47:25.493230Z","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-14T12:47:25.462186Z","title":"An adaptive synchronous parallel strategy for distributed ma chine learning,","venue":null,"work_id":"ed26922d-c77d-4578-8b23-b3904b096ffc","year":2018},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.712763Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:2ad4bbdc82f6789a0fc9044cd88df7ac4b3b2953f37fb2d67b003f670c81c2d8","observation_id":"839db03d-f7b5-47cb-9056-82b9377685e7","resolution":{"observed_at":"2026-08-14T12:47:25.467926Z","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-14T12:47:25.440141Z","title":"Communicati on efﬁcient distributed machine learning with the parameter s erver,","venue":null,"work_id":"d61fdcc8-237b-472f-88ab-0996b2579386","year":2014},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.718064Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:c2f08c3537dd682b5ff1a06c77bd0595a1421a43edd34bcc926a2911f55c7f4b","observation_id":"df53c4ab-afc3-447f-938e-e823878066b0","resolution":{"observed_at":"2026-08-14T12:47:25.449062Z","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-14T12:47:25.417841Z","title":"Federated learning: Strategies for improving co mmunication efﬁciency,","venue":null,"work_id":"d25e0a02-7975-4742-87f7-a1957d365521","year":2016},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.723002Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:86785ad98e6a1df7783de7aa9a74ce71df4fa907c28d286a2be00f565eb8431f","observation_id":"286d8a8d-0780-4265-bab8-b96e1ba8e99f","resolution":{"observed_at":"2026-08-14T12:47:25.424953Z","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-14T12:47:25.399608Z","title":"Communication-efﬁcient learning of deep networks from de centralized data,","venue":null,"work_id":"cde5c2eb-c0df-4f9c-830f-97af7b4ab99e","year":2017},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.728299Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:e7ca0d1bd7c25924ffa919aacbd05ac2c83e3181de9646711cf6b9a02ca06129","observation_id":"f2961df8-4653-42d2-b85c-b21100caf28f","resolution":{"observed_at":"2026-08-14T12:47:25.406249Z","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-14T12:47:25.381752Z","title":"Optimization meth ods for large- scale machine learning,","venue":null,"work_id":"accbdfaa-951f-4f61-b065-25e148c9341f","year":2018},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.733621Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:8ec174a0192985716e2f0b5ee1295045b87234276ae50d88ec67ba6d08907b6c","observation_id":"b17307a0-3a7c-49cd-a43e-3048a875b249","resolution":{"observed_at":"2026-08-14T12:47:25.387933Z","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-14T12:47:25.359804Z","title":"An approximate dual subgradient a lgorithm for multi-agent non-convex optimization,","venue":null,"work_id":"9e88afd5-4526-4941-95bb-2a3ec846a454","year":2013},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.738246Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:a8e861f222cc2664e7395fbf02603977affbd846b20bea2adb426845937a404c","observation_id":"23b9f998-fff6-4c91-9a82-8a3440538600","resolution":{"observed_at":"2026-08-14T12:47:25.367160Z","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-14T12:47:25.341646Z","title":"Nestt: A non convex primal-dual splitting method for distributed and stochast ic optimization,","venue":null,"work_id":"b3625ddc-865d-41e7-ab1d-353accd56900","year":2016},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.743035Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:58a9502cee0bf564f35e3ffae418899a8b5e2971cc4bf13fb7f0d6ce667b7e0e","observation_id":"6b5d95c7-6bcd-4d13-b554-33f07893cc52","resolution":{"observed_at":"2026-08-14T12:47:25.347747Z","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-14T12:47:25.319756Z","title":"Prox-PDA: The p roximal primal-dual algorithm for fast distributed nonconvex opti mization and learning over networks,","venue":null,"work_id":"1e6d9c70-d67b-492d-aab9-72c99efd73e9","year":2017},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.747747Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:e0ff3cdd2f8606a1d215aa99a3ecc7f7b8750bfe6e6ec7ddad6baceb4ede44cf","observation_id":"94a1d146-39b3-46d4-b9c8-24529bd802d2","resolution":{"observed_at":"2026-08-14T12:47:25.325946Z","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-14T12:47:25.295676Z","title":"On the converg ence of a distributed augmented lagrangian method for nonconvex opt imization,","venue":null,"work_id":"f8480c00-c8a5-4632-991d-69fdbff2f722","year":2017},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.752531Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:a26366c929275b95d04a1b0b795ac3e6b2ec9f77720209db93cd118809401c09","observation_id":"f5be19c1-d509-4b28-b513-d612ab77b6dc","resolution":{"observed_at":"2026-08-14T12:47:25.303689Z","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-14T12:47:25.273285Z","title":"Paralle l and distributed methods for constrained nonconvex optimizationpart i: The ory,","venue":null,"work_id":"f516bd84-d08b-4de2-8045-62215525fe74","year":1929},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.757707Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:efc8798ea7388f47677c7be7e199150c21b2f3c2c4faf871b11960b3b372d745","observation_id":"6cfbdfab-9e7c-41a7-81cb-0883d133c027","resolution":{"observed_at":"2026-08-14T12:47:25.280038Z","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-14T12:47:25.253294Z","title":"NEXT: In-network nonconv ex optimiza- tion,","venue":null,"work_id":"40ca079e-bfba-4bf2-a9ee-fb805bcd657b","year":2016},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.762524Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:ac521291df17c055e2178fd19bcc025f741bb5e47725be84edca78fe6de8b21f","observation_id":"c5f40666-7490-4f19-ba6d-10b30f440e43","resolution":{"observed_at":"2026-08-14T12:47:25.259453Z","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-14T12:47:25.230144Z","title":"A distributed, asynchronous, and incrementa l algorithm for nonconvex optimization: An ADMM approach,","venue":null,"work_id":"6e710ea8-656a-474b-be81-1f709159716b","year":2018},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.767672Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:5819288f8310071256fac5a41ba52539c32bb61ebb4c0846dddbb1f3ff081998","observation_id":"ff85442f-42a4-4efb-b185-f81e16cdb1a9","resolution":{"observed_at":"2026-08-14T12:47:25.236467Z","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-14T12:47:25.211174Z","title":"A case for nonconvex dis tributed optimization in large-scale power systems,","venue":null,"work_id":"67710f15-9402-43b2-ad56-5c18da448306","year":2017},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.772460Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:0df1042361bf68fc2e7d430ba732ff26656ebcea58360e910ea4d0e9ad761c9a","observation_id":"d7c0fd39-84f5-4a19-b86c-b36d8310dea7","resolution":{"observed_at":"2026-08-14T12:47:25.217021Z","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-14T12:47:25.194522Z","title":"Convergence analys is of alternating direction method of multipliers for a family of nonconvex problems,","venue":null,"work_id":"2be41432-a473-4d9f-a5dc-7bf17cb48432","year":2016},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.777068Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:42f67220bf25d2d5c00b28804286c8d44e81b6e9e8a2fa4afd6060288e417387","observation_id":"3444dcbb-d2aa-407d-a084-ed74254b68d9","resolution":{"observed_at":"2026-08-14T12:47:25.199931Z","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-14T12:47:25.177112Z","title":"On nonconvex decentralized gradien t descent,","venue":null,"work_id":"559f3a18-7e33-4a80-a155-3b0d44b272c9","year":2018},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.781667Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:60ddf37f34d3ac31793cf08ef94cb5144b2218a4bc6b50031aa658dc66b961a5","observation_id":"fcd50acb-e073-424f-84cf-480fdeb754d4","resolution":{"observed_at":"2026-08-14T12:47:25.183247Z","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-14T12:47:25.160475Z","title":"Zone: Zeroth ord er nonconvex multi-agent optimization over networks,","venue":null,"work_id":"c913cdf6-7cd1-4866-9371-110e348af99c","year":2019},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.786750Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:2b9e2b31a753734c2bcf545257333971368b4ef9f6e91e8f4de4635ed7b29ce2","observation_id":"e157d28d-08ca-4303-ae3b-62eebde358ee","resolution":{"observed_at":"2026-08-14T12:47:25.166081Z","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-14T12:47:25.143368Z","title":"Stochastic gradient-push for strongly convex functions on time-varying directed graphs,","venue":null,"work_id":"e062d2c0-226c-4ff9-97c6-b923087f5032","year":2016},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.791725Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:5a77044d8f06ae3ee94487e2346ada972285e8c5f8b6bab6b12c8ac8c6011b13","observation_id":"eacd49cb-d441-4dd9-b186-a731a914928c","resolution":{"observed_at":"2026-08-14T12:47:25.149086Z","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-14T12:47:25.126162Z","title":"Conver gence rates for distributed stochastic optimization over random netwo rks,","venue":null,"work_id":"cf4c64d2-e57b-410d-a149-cd51cba69928","year":2018},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.796682Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:c161b0fbc33da9710cdb22c3b4520558ee9509243d4e2684e9617efb8ee3e6fb","observation_id":"cce131a5-5fbb-48d3-af4b-4037139112ad","resolution":{"observed_at":"2026-08-14T12:47:25.131811Z","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-14T12:47:25.110709Z","title":"SUCAG : Stochastic unbiased curvature-aided gradient method for distributed optimization,","venue":null,"work_id":"39d2f308-210b-41e5-a12b-cee80d730870","year":2018},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.801198Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:819edc0483f53dd90209b115d6f36ffe6b6401fc2ace338233c30f6f46818734","observation_id":"322cef45-0a1d-40ea-ac1f-db37f8c0efae","resolution":{"observed_at":"2026-08-14T12:47:25.115744Z","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":"1805.11454","last_updated":"2020-03-10T13:15:33Z","snapshot_observed_at":"2026-08-14T19:10:54.981867Z","submitted_at":"2018-05-25T23:34:48Z","title":"Distributed Stochastic Gradient Tracking Methods","version":5},"cited_work":{"arxiv_id":"1805.11454","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.11454","snapshot_observed_at":"2026-08-14T12:47:24.950263Z","title":"Distributed Stochastic Gradient Tracking Methods","venue":"math.OC","work_id":"0b73d6f1-134f-4509-912b-f7e971f43a57","year":2018},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.805630Z"},"links":{"cited_paper":"/paper/1805.11454","citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:1abf33b8adf25533b67772beb56a732ea6bf0269c0d89e749537a65d2df5f9a0","observation_id":"418054d7-1035-473e-a2be-dd02c2114b94","resolution":{"observed_at":"2026-08-14T12:47:24.959834Z","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-14T12:47:25.094203Z","title":"Non-convex distributed opt imization,","venue":null,"work_id":"2cedd029-f60d-4f0e-a595-b96672cd919d","year":2017},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.810343Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:6bc4b13189c744133ea5ec443b21430369e862c0d488d5b10c5a45e84ebca959","observation_id":"5ae23765-81ea-4e76-a125-cf5523de118e","resolution":{"observed_at":"2026-08-14T12:47:25.099759Z","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-14T12:47:25.077189Z","title":"Convergence of a multi-a gent projected stochastic gradient algorithm for non-convex optimizatio n,","venue":null,"work_id":"33b19ed2-d222-48ff-aa4c-16a1dd35e022","year":2013},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.815021Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:8a6089e063187223a8847a106291f6ac4a2dac3979ac6072d86082448b47c86f","observation_id":"08aeebb8-60bb-4901-9970-fcdd7468d126","resolution":{"observed_at":"2026-08-14T12:47:25.083171Z","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-14T12:47:25.057010Z","title":"Khalil, Nonlinear Systems","venue":null,"work_id":"d7959188-2e93-499d-83ba-1f00e407f601","year":2002},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.819507Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:8587d93fc22595e2bb5a3cc4e1ba420d154675a2666b92724a449da2ca12cf41","observation_id":"24b9b23b-f77e-4206-8dd4-735c8732bb51","resolution":{"observed_at":"2026-08-14T12:47:25.062622Z","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-14T12:47:24.824456Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.824456Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:eb215f1af0ac009986cec453f8c4c53caf4751d02f5692c8f4db6c950a7973e8","observation_id":"4eb2f1f0-4f99-4748-8e6a-a8abb2f52070","resolution":{"observed_at":"2026-08-14T12:47:24.824456Z","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-14T12:47:25.023718Z","title":"Distributed subgradient me thods for multi- agent optimization,","venue":null,"work_id":"abbb5393-a837-4f2b-8a17-bf9385c0c364","year":2009},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.828916Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:e3b2fa3e73dd1a22d027e97c3acd24dc1f8ecc43fc18de1022faf3ccac3d0c0d","observation_id":"a2406bf3-7a44-4a00-9c93-fd1374cd4af8","resolution":{"observed_at":"2026-08-14T12:47:25.030322Z","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":"1710.07406","last_updated":"2017-10-20T03:34:56Z","snapshot_observed_at":"2026-08-14T20:21:59.319940Z","submitted_at":"2017-10-20T03:34:56Z","title":"First-order Methods Almost Always Avoid Saddle Points","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.07406","snapshot_observed_at":"2026-08-14T12:47:24.833526Z","title":"First-order methods almost always avoid saddle p oints,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.833526Z"},"links":{"cited_paper":"/paper/1710.07406","citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:18fccb4386def8812833e00442752642359cc8448e9181bd24a9fb98b73e55bb","observation_id":"27484ef9-3f47-4fb7-8b89-b2a93a6833dc","resolution":{"observed_at":"2026-08-14T12:47:24.833526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.00247","last_updated":"2019-06-04T12:23:24Z","snapshot_observed_at":"2026-08-14T17:22:30.779148Z","submitted_at":"2019-02-01T09:35:27Z","title":"Sharp Analysis for Nonconvex SGD Escaping from Saddle Points","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.00247","snapshot_observed_at":"2026-08-14T12:47:24.838188Z","title":"Sharp analysis for noncon vex sgd escaping from saddle points,","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.838188Z"},"links":{"cited_paper":"/paper/1902.00247","citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:10008b94623873ad1b53700fdb884daec423f79e88abb99ac58927dce394c205","observation_id":"49d102a4-b65b-4379-a2b8-83c6bdf50fcc","resolution":{"observed_at":"2026-08-14T12:47:24.838188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.04811","last_updated":"2019-09-04T03:26:59Z","snapshot_observed_at":"2026-08-16T03:16:43.775672Z","submitted_at":"2019-02-13T09:44:02Z","title":"On Nonconvex Optimization for Machine Learning: Gradients, Stochasticity, and Saddle Points","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.04811","snapshot_observed_at":"2026-08-14T12:47:24.843115Z","title":"Stochastic gradient descent escapes saddle points efﬁciently,","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.843115Z"},"links":{"cited_paper":"/paper/1902.04811","citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:176f968feb4aa9e3c6c1702a2366efa7ecdde8713f287c2f5486cbf085b3f67a","observation_id":"0ba4b784-de7f-4123-84e1-5d03894fab8a","resolution":{"observed_at":"2026-08-14T12:47:24.843115Z","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-14T12:47:25.007207Z","title":"Bishop, Pattern Recognition and Machine Learning , ser","venue":null,"work_id":"33846865-fb99-4f7e-aa5f-8f24410a01e0","year":2016},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.847844Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:d07158dd42d51163a4d317bb3e800921e140969db4745f9beb92cc30bd5cc540","observation_id":"988aaa21-bc86-4ad0-8702-e02bf55da4d0","resolution":{"observed_at":"2026-08-14T12:47:25.012433Z","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-14T12:47:24.990262Z","title":"Distributed linear param eter estimation: Asymptotically efﬁcient adaptive strategies,","venue":null,"work_id":"6b5de631-62be-4dfb-8952-de4f3f2fd444","year":2013},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.852916Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:83b08dcb683f6b09b4dd7b7c72e1dd174b9d863c5260e9deeb717ad3cf8406fa","observation_id":"fa592bd4-cdbd-415c-9542-72fd14353dcc","resolution":{"observed_at":"2026-08-14T12:47:24.995543Z","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-14T12:47:24.973716Z","title":"A convergence theorem for n on negative almost supermartingales and some applications","venue":null,"work_id":"5de3481d-0c83-460d-8670-9f651ec1d8c3","year":1971},"citing_paper":{"arxiv_id":"1908.06693","last_updated":"2019-08-19T11:08:37Z","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:24.860546Z"},"links":{"citing_paper":"/paper/1908.06693"},"observation_digest":"sha256:7bc25aa0f6c3e00946334881467895b5efe500564f649eff32d9b1865551d27d","observation_id":"43ca3445-83fc-422d-b98b-63e805c4258d","resolution":{"observed_at":"2026-08-14T12:47:24.978947Z","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":"1908.06693","last_updated":"2019-08-19T11:08:37Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T12:34:49.345336Z","submitted_at":"2019-08-19T11:08:37Z","title":"Distributed Stochastic Gradient Method for Non-Convex Problems with Applications in Supervised Learning"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":28},"total_outbound_references":33},"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 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:1908.06693."}