{"as_of":"2026-08-17T02:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5911eff39885c06305358b84a9209e2f757fcd4afd249ff1c87bf5a938ae9caf","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:56:40.950381Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"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.02246/citation-record","integrity":"/paper/1908.02246/integrity","json":"/paper/1908.02246/citation-record.json","paper":"/paper/1908.02246"},"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-14T14:56:41.736695Z","title":"Communication complexity of distributed convex learning and optimization","venue":null,"work_id":"c823ed69-2812-4bf8-a172-df2fd871143e","year":2015},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.736604Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:0829c76ece0355cbc47aad316cd6dd08bd78d41444fbfdc31107d4f7bc669ddd","observation_id":"34221368-0926-40a5-ab25-89b58bb9d35e","resolution":{"observed_at":"2026-08-14T14:56:41.741995Z","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-14T14:56:40.742452Z","title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.742452Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:67f52ffc34362e3812cceac2c45e6c3f57df869739dacca34f9fd9be3bcf7b2b","observation_id":"820c034f-5b2f-40e7-af32-6d12d578d5fc","resolution":{"observed_at":"2026-08-14T14:56:40.742452Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:56:40.747968Z","title":"Mapreduce: Simplified data processing on large clusters","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.747968Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:1af3fd30148af720a00024990e3bb1fdea8128ca19bc4de36be8bb8c873c5b74","observation_id":"9ad03bcc-3478-408d-a835-7298502ba8d4","resolution":{"observed_at":"2026-08-14T14:56:40.747968Z","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-14T14:56:41.701126Z","title":"Global convergence of the heavy-ball method for convex optimization","venue":null,"work_id":"bf4ba5d8-710b-489f-b2e1-f72a903247ba","year":2015},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.753678Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:c1bf6a93ae3d6f2d9f068bb7ee0bfef69b16374389354ebd6ba3b3739dff4f7f","observation_id":"17d672ad-82ed-4340-9a96-be510b8907f1","resolution":{"observed_at":"2026-08-14T14:56:41.707241Z","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-14T14:56:41.684107Z","title":"Result analysis of the nips 2003 feature selection challenge","venue":null,"work_id":"71cd8589-531f-4d7c-943b-dca4f4dfcb5d","year":2003},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.759249Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:3fb16123e5a66dc6ccd0a4a664d64da5588b7f4f7acaa692a358be5dea766848","observation_id":"37155c8d-b0b0-45da-a07a-38dac8467972","resolution":{"observed_at":"2026-08-14T14:56:41.689375Z","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-14T14:56:41.664288Z","title":"Communication-efficient distributed dual coordinate ascent","venue":null,"work_id":"73eba8a3-42cc-4828-806c-9971d11cf359","year":2014},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.764500Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:90e354ddc805d9da87fdf04011cbd7f7a7f30f8049f4f0212bd68c4ac7d7805a","observation_id":"86828a51-f01e-4e2b-b707-ff2d213d14bf","resolution":{"observed_at":"2026-08-14T14:56:41.670348Z","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-14T14:56:41.646107Z","title":"Accelerating stochastic gradient descent using predictive variance reduction","venue":null,"work_id":"54265297-d7d8-48a4-ad01-ec3c4824f95d","year":2013},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.770877Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:c1e96319d7a25279d963c3df62d7430f2d9d1bd5fd86def4a32dc300258e0b88","observation_id":"20b708a4-1b4a-4f90-be46-ddcc269595a4","resolution":{"observed_at":"2026-08-14T14:56:41.651536Z","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-14T14:56:41.630423Z","title":"Communication-efficient distributed statistical inference","venue":null,"work_id":"6919e136-16f0-4dfb-907c-8cf77a584a39","year":2018},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.776126Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:47dee78b212ccd6c1bae62f689c93b7b1df018170d5e70e4ef75793655952614","observation_id":"91f316db-4419-473b-9539-a921cb63037b","resolution":{"observed_at":"2026-08-14T14:56:41.635587Z","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-14T14:56:41.613995Z","title":"Sgdlibrary: A matlab library for stochastic optimization algorithms","venue":null,"work_id":"9a254023-c5b7-48cd-b452-689c16482568","year":2017},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.781993Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:336cdaab2b814ca44d8c85d19bec350b9aec94951fa2e4438fb66effa1817486","observation_id":"c6d9a847-75f4-451c-a779-bca60a5bba93","resolution":{"observed_at":"2026-08-14T14:56:41.619803Z","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":"1610.02527","last_updated":"2016-10-08T13:25:15Z","snapshot_observed_at":"2026-08-15T22:33:08.717388Z","submitted_at":"2016-10-08T13:25:15Z","title":"Federated Optimization: Distributed Machine Learning for On-Device Intelligence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1610.02527","snapshot_observed_at":"2026-08-14T14:56:40.786597Z","title":"Federated optimization: Distributed machine learning for on-device intelligence","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.786597Z"},"links":{"cited_paper":"/paper/1610.02527","citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:bf0828b6f86d7d266ec50974f9731c6acf28396792e6896c8672955de6a135da","observation_id":"1b9c17ae-9a8b-4c81-b969-75b7176bf620","resolution":{"observed_at":"2026-08-14T14:56:40.786597Z","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-14T14:56:41.596589Z","title":"Distributed stochastic variance reduced gradient methods by sampling extra data with replacement","venue":null,"work_id":"41dec91f-19c9-4eed-a391-641b46e0df92","year":2017},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.791738Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:13c08c212b2552436bb36add49c8c45fdd6e7155b7899a41a8363210a9667795","observation_id":"525667de-d909-4a0f-b036-78e3d8851885","resolution":{"observed_at":"2026-08-14T14:56:41.602199Z","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-14T14:56:41.579413Z","title":"Rcv1: A new benchmark collection for text categorization research","venue":null,"work_id":"cb980c1d-27e7-4558-8ffb-7cb40b3263f2","year":2004},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.796474Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:e77a19287aae1f4f66aaf60aa69f0ab3249fb251095e2bce2d259bb28873d80e","observation_id":"c9c1cf19-6352-4398-95c6-f4d88e7a8f6e","resolution":{"observed_at":"2026-08-14T14:56:41.584477Z","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-14T14:56:41.562604Z","title":"Communication efficient distributed machine learning with the parameter server","venue":null,"work_id":"ae43aeb7-af60-4a78-a4d4-06c222de5e21","year":2014},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.800655Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:1068c2e5e4598eab0187f06ffa614947d0d7e1b775b6bf8820b653da46a22177","observation_id":"23637827-80ed-4bf6-9f2f-678f4f70dcd8","resolution":{"observed_at":"2026-08-14T14:56:41.567141Z","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-14T14:56:41.546219Z","title":"A universal catalyst for first-order optimization","venue":null,"work_id":"aa8205fb-81f9-4b4a-90d8-f5a95f321eea","year":2015},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.805369Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:e3bc958b0727da2889a53c2c8a9cebaff9851edbb6a75fc348ee0c7b953ed418","observation_id":"79d7c40e-eba4-48bc-9374-6680445216e6","resolution":{"observed_at":"2026-08-14T14:56:41.550942Z","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-14T14:56:41.531034Z","title":"Distributed inexact newton-type pursuit for non-convex sparse learning","venue":null,"work_id":"a107475b-8222-4b03-b10b-5c6f9c5144a9","year":2019},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.811042Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:dbed2d33baebb7a933942a6825b7a950805f9fe0e28ba57be901eb05ce68083b","observation_id":"557d0506-312b-4c4e-b035-8757938a0e07","resolution":{"observed_at":"2026-08-14T14:56:41.535581Z","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.10737","last_updated":"2017-12-23T02:18:06Z","snapshot_observed_at":"2026-08-14T20:19:08.170146Z","submitted_at":"2017-10-30T01:49:34Z","title":"Linearly convergent stochastic heavy ball method for minimizing generalization error","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10737","snapshot_observed_at":"2026-08-14T14:56:40.816148Z","title":"Linearly convergent stochastic heavy ball method for minimizing generalization error","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.816148Z"},"links":{"cited_paper":"/paper/1710.10737","citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:8405bdddec2c7abd2c0c1ba506d8d980091137b17701c9bb6558b2f19dea53f2","observation_id":"b834e0a7-195a-4cb3-8276-75841d77e58e","resolution":{"observed_at":"2026-08-14T14:56:40.816148Z","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-14T14:56:41.514332Z","title":"Adding vs","venue":null,"work_id":"3fe5fd44-35ae-44c2-84e7-212ccdef4f60","year":1973},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.821867Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:70a97a3e70f0f5c37e08471c54a129c95690c0a73d957d12126a27b464c101f0","observation_id":"c30cf909-9cb0-4992-a747-8278d928547c","resolution":{"observed_at":"2026-08-14T14:56:41.519843Z","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-14T14:56:41.498058Z","title":"Communication-efficient learning of deep networks from decentralized data","venue":null,"work_id":"da0e1fe8-d59b-4a64-bd9a-995ca4fb8506","year":2017},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.826848Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:51fc937a2ce44c902c63b979ba47f5bd1c64c8e6d3530339fd77be9b7308e1f1","observation_id":"d8273a01-927e-4329-853a-2f6714be9772","resolution":{"observed_at":"2026-08-14T14:56:41.503221Z","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-14T14:56:41.480950Z","title":"The landscape of empirical risk for nonconvex losses","venue":null,"work_id":"076bbc71-1313-4445-be02-ec7a4db805f3","year":2018},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.831759Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:8b823c11a5a37a9c0cd7670256f7a24e17af5ebafb47b186fc3aa937c6f4aae9","observation_id":"79be947f-26fc-4a51-8f4c-ed0dc49bf430","resolution":{"observed_at":"2026-08-14T14:56:41.487273Z","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-14T14:56:41.464431Z","title":null,"venue":null,"work_id":"f1092fe3-4186-4aa6-b972-45ac39b742cc","year":1964},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.840497Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:02c8065d6d650d190ecd0f510e57b4192a101b05949f95310413e4ef0d820ab7","observation_id":"94d28a71-67c0-4dc8-a904-5d9c21027f7b","resolution":{"observed_at":"2026-08-14T14:56:41.469568Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T14:56:41.447971Z","title":null,"venue":null,"work_id":"d9f37a2a-f9cd-468f-b2f7-2247669974b4","year":1999},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.846386Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:c12e9e973362b24385f3e17a658b521edaf5437cea90f2c949ef2f8f8390df67","observation_id":"72cc93b3-74d7-438a-ba4f-9eb814f43587","resolution":{"observed_at":"2026-08-14T14:56:41.453057Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1608.06879","last_updated":"2016-08-24T16:04:12Z","snapshot_observed_at":"2026-08-14T21:42:57.169954Z","submitted_at":"2016-08-24T16:04:12Z","title":"AIDE: Fast and Communication Efficient Distributed Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1608.06879","snapshot_observed_at":"2026-08-14T14:56:40.851676Z","title":"AIDE : Fast and communication efficient distributed optimization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.851676Z"},"links":{"cited_paper":"/paper/1608.06879","citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:118c302c1f7af2493480430f5ed292c3aae246514afe10905d51019a15568a7d","observation_id":"accc3a1c-a265-470c-82a5-c27545d04b64","resolution":{"observed_at":"2026-08-14T14:56:40.851676Z","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-14T14:56:41.432332Z","title":"Distributed coordinate descent method for learning with big data","venue":null,"work_id":"d33e81f1-381c-47ce-b924-c093689db1c7","year":2016},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.857479Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:80a0c97af585d03ffeca04f1b81587d8116fedb7630e9d8572844113a43f1a04","observation_id":"080689ef-1c07-4485-a0cd-37a6519a075e","resolution":{"observed_at":"2026-08-14T14:56:41.436724Z","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-14T14:56:41.416363Z","title":"Stochastic convex optimization","venue":null,"work_id":"d1ea4f8e-4c9e-4314-a286-478a6ad722e9","year":2009},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.862898Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:4b38a94c979b981aa1876e3f1a40c06e3be03da9253c02091286965f85d6041a","observation_id":"bfc840fc-9b4d-46da-a3a1-00a1f0edef72","resolution":{"observed_at":"2026-08-14T14:56:41.421154Z","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-14T14:56:41.399409Z","title":"Without-replacement sampling for stochastic gradient methods","venue":null,"work_id":"62d18ac0-0310-4ecb-bc99-555c0b119aca","year":2016},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.868031Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:d28976f9958dde21230ddf2987a8e3b3064652dd9d570c05b0ea26754328d410","observation_id":"f579386e-fc33-4592-9c09-43dc41713f0b","resolution":{"observed_at":"2026-08-14T14:56:41.404547Z","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-14T14:56:41.381579Z","title":"Communication-efficient distributed optimization using an approximate newton-type method","venue":null,"work_id":"a2744cbd-daa4-4803-911c-14618e1d48bb","year":2014},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.873156Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:7f50970dbe53ce31a1ec00ea4b3309736257fecbdc45e6d0254b17d023bd342d","observation_id":"328426e1-6049-46bc-8cdc-3ee574490f72","resolution":{"observed_at":"2026-08-14T14:56:41.387112Z","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-14T14:56:41.365432Z","title":"Cocoa: A general framework for communication-efficient distributed optimization","venue":null,"work_id":"7599db66-10a4-42cf-adeb-8309e78b7907","year":2018},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.878072Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:a2728929c1f09e15ed7f02828ee3b920fd024b45c5dfc62fb39ee0cae5285df7","observation_id":"cb838575-e59d-4cd4-b542-45032841675b","resolution":{"observed_at":"2026-08-14T14:56:41.370702Z","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-14T14:56:41.348162Z","title":"User-friendly tail bounds for sums of random matrices","venue":null,"work_id":"04b7cec0-d5a4-4136-a5e5-fac65d8f3f5e","year":2012},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.883588Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:8a2dbe008567fb8a3cf6511194fa11b34ce87ab1bd2c456579937ba8415535e4","observation_id":"804dfa41-00cd-4a1c-88fd-ab9c94e9e1c4","resolution":{"observed_at":"2026-08-14T14:56:41.354028Z","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-14T14:56:41.331882Z","title":"Efficient distributed learning with sparsity","venue":null,"work_id":"0d9caa0c-521b-43b9-98f5-2bf2efc23683","year":2017},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.888500Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:77489543fa75cc20ee903dcb15701431ffe558e262c77cdd099d8c3f89abcb86","observation_id":"87ec6056-e06c-4308-aeb4-87d7801391f4","resolution":{"observed_at":"2026-08-14T14:56:41.337160Z","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-14T14:56:41.313599Z","title":"Memory and communication efficient distributed stochastic optimization with minibatch prox","venue":null,"work_id":"f9c57b5c-5d85-4b89-9cb3-5a2da1bd278e","year":1919},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.893647Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:90e1df3846471af782c4435bff40e76039001de7cc44ba1b652098e605de3403","observation_id":"814ed942-a53b-4851-8185-fc1195943a67","resolution":{"observed_at":"2026-08-14T14:56:41.320364Z","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-14T14:56:41.295000Z","title":"Giant: Globally improved approximate newton method for distributed optimization","venue":null,"work_id":"0539f70a-39e9-481d-b24b-8e96faccde63","year":2018},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.899261Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:39cea2b6bc7cc7012b8f5d27c130ec66e0e0f4696ac35034ebdc1fa72552b9d4","observation_id":"b619de29-a297-4aa8-83b1-e2b20e7a75c7","resolution":{"observed_at":"2026-08-14T14:56:41.301278Z","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":"1611.02635","last_updated":"2018-03-12T04:20:12Z","snapshot_observed_at":"2026-08-16T17:37:33.467898Z","submitted_at":"2016-11-08T17:55:21Z","title":"A Lyapunov Analysis of Momentum Methods in Optimization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.02635","snapshot_observed_at":"2026-08-14T14:56:40.904449Z","title":"A lyapunov analysis of momentum methods in optimization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.904449Z"},"links":{"cited_paper":"/paper/1611.02635","citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:ec71f781233d0ec73ef86fbd400acfbbb0e0f4391a79810ca90f032d4197d655","observation_id":"560d739a-b774-4179-bb89-2bc9020c6470","resolution":{"observed_at":"2026-08-14T14:56:40.904449Z","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-14T14:56:41.278421Z","title":"Dscovr: Randomized primal-dual block coordinate algorithms for asynchronous distributed optimization","venue":null,"work_id":"6e729c4c-d22a-4db0-90f6-2008430f1d33","year":2019},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.910108Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:ec2f31709949b49412645c6a9ff34dd26d4c9015587fd0bf7435b6dbbbacd5cf","observation_id":"79abbc39-2f3f-4f4f-a8e3-34c3f0889fec","resolution":{"observed_at":"2026-08-14T14:56:41.283099Z","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-14T14:56:41.263013Z","title":"Petuum: A new platform for distributed machine learning on big data","venue":null,"work_id":"c5a6452b-ada8-4189-afc5-bfb484d4e413","year":2015},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.915757Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:3c5a1950a5fc5bb07f30e3dadb24edc6228ce7c67e7d5537c28f4e0a2e96603d","observation_id":"2ba41acd-aa31-4a0a-9e90-c694d0620d56","resolution":{"observed_at":"2026-08-14T14:56:41.268019Z","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-14T14:56:40.920748Z","title":"Xin, Patrick Wendell, Tathagata Das, Michael Armbrust, Ankur Dave, Xiangrui Meng, Josh Rosen, Shivaram Venkataraman, Michael J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.920748Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:d8cad665772bd5678e9afc48ebe74dd1554dcec21d9f0c64c254ab1d54000650","observation_id":"791bee6e-58eb-451a-a802-194ca91d52c9","resolution":{"observed_at":"2026-08-14T14:56:40.920748Z","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-14T14:56:41.245662Z","title":"Di SCO : Distributed optimization for self-concordant empirical loss","venue":null,"work_id":"87083ef3-c1cc-4fa6-950b-d29e20a03989","year":2015},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.926185Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:5beef99959fe223b640966cfa2b58f2b7ba651ef91c9ff9459e93e90835661d4","observation_id":"5f537dea-05a9-4229-aaad-cf51ac0958b2","resolution":{"observed_at":"2026-08-14T14:56:41.251531Z","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-14T14:56:41.228875Z","title":"Stochastic primal-dual coordinate method for regularized empirical risk minimization","venue":null,"work_id":"10c2b756-7c1b-4601-a2e2-f320b79cdbfa","year":2017},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.931201Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:ced3e1829c667543da0d1e8f3ea69f630ccd12741e0f80ac9f1f51a01227cda7","observation_id":"05fbca17-86a4-431c-8ce4-ad743b8a2d3c","resolution":{"observed_at":"2026-08-14T14:56:41.234159Z","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-14T14:56:41.208021Z","title":"Efficient stochastic gradient hard thresholding","venue":null,"work_id":"319b17f3-cb3b-469b-86e9-aebc4c43eee7","year":1984},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.936065Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:8ce9e482a175cf81b91fc7710363d012970987b008f1a06297aa60661ab820be","observation_id":"70759b98-91a9-4347-8524-e71af9cee26a","resolution":{"observed_at":"2026-08-14T14:56:41.216550Z","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-14T14:56:40.940747Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.940747Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:132e58264d911ae0509e86b45997ffb839f1f8ab937593d2560ae6fc7d288a9f","observation_id":"d73d5625-577a-4409-9cd0-f30822f6b67e","resolution":{"observed_at":"2026-08-14T14:56:40.940747Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:56:40.945800Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.945800Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:faaef44dcc7cd2a8610e1faa68327590df8935dd103d737039d497d5cb61b47a","observation_id":"dc33b6d5-07a9-4509-8aaa-aa891b92289b","resolution":{"observed_at":"2026-08-14T14:56:40.945800Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:56:40.950381Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-14T14:56:40.950381Z"},"links":{"citing_paper":"/paper/1908.02246"},"observation_digest":"sha256:024c94623a0c06fc8c6e8be20881e9fc9ebc99c22bcd1fc6c2a3f0184474f8c2","observation_id":"2464968b-ac44-464a-a730-145e91049784","resolution":{"observed_at":"2026-08-14T14:56:40.950381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.02246","last_updated":"2019-08-06T16:36:30Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-16T14:16:21.927442Z","submitted_at":"2019-08-06T16:36:30Z","title":"On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":41},"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 17 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:1908.02246."}