{"as_of":"2026-08-08T19:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:33901643c4662d6776de3e4c3ad3138a432bdc021864fc172ff3b43a523f0128","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T05:06:21.205587Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2606.04757/citation-record","integrity":"/paper/2606.04757/integrity","json":"/paper/2606.04757/citation-record.json","paper":"/paper/2606.04757"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T05:06:21.205587Z","title":"Bartlett, Pradeep Ravikumar, and Martin J","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:170a663f81b07321b890314a98fd334f51d506338e21df6039085cb94a58cf48","observation_id":"3c8cf174-5f68-4eb2-ae9f-46d1b7fe40d1","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Stochastic gradient push for distributed deep learning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:3857393a3d0d62144a93b927f2b776b55672dc34b6bd3eb95bb9d795f01b477f","observation_id":"9836f819-85bb-4f7a-9e28-8fd51c6958cf","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Faster stochastic optimization with arbitrary delays via adaptive asynchronous mini-batching","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:31249c8afd0c19c2aae68c77d27174fe24e98c0c71c608c1372e1c45d0ccdbde","observation_id":"dd4cf71b-37d1-4a82-b146-fba25041f56b","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Randomized gossip algorithms.IEEE transactions on information theory, 52(6):2508–2530, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:dc4eab2a4cda2fc8b15bdb5c6bf4e076ed589b95e5ee78d46a1a1b9790ac6c64","observation_id":"50c7d5bb-e7e4-4690-835e-2be4d76d206d","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:6aa8e5ee0e343cbe9c37fdef464248e43d0c6a220db2e78b11efd262b29f7d32","observation_id":"d5b9ee0a-b497-44b2-8c6d-1dd9d5b1c4cf","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Optimal distributed online prediction using mini-batches.Journal of Machine Learning Research, 13(1), 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:9dd39afe362f4910f1bd047b83cd40dcced69790cda264e490a944ec9373c87d","observation_id":"e980db9c-1047-425f-9de0-d5a019679d5a","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"First-order methods of smooth convex optimization with inexact oracle.Mathematical Programming, 146(1):37–75, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:acc53570d73cb639fa0e42f91da6e553d138839b70c6121ce73464669e9cee03","observation_id":"f3e6e183-5b9c-4bd1-9cac-8e794473e0d3","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Enhancing parallelism in decentralized stochastic convex optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:76db1091dbd8399e9937f3621a52036b6b45b06e326876baa3a3a180989761b2","observation_id":"e6bfaca3-a6ac-45bc-9760-700720c025ac","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.01545","last_updated":"2023-04-20T15:22:15Z","snapshot_observed_at":"2026-08-07T21:22:45.897612Z","submitted_at":"2022-02-03T12:04:36Z","title":"Byzantine-Robust Decentralized Learning via ClippedGossip","version":2},"cited_work":{"arxiv_id":"2202.01545","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.01545","snapshot_observed_at":"2026-07-03T13:18:12.910591Z","title":"Byzantine-robust decentralized learning via self-centered clipping","venue":null,"work_id":"21fe445b-c86f-44f2-abe0-ea7f3eeaa8f7","year":2022},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"cited_paper":"/paper/2202.01545","citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:850f1fda3082ca796721416dff704754781ec3327e07e40100198342103528f6","observation_id":"63333df0-ba8a-4502-870b-9d1691c08e7d","resolution":{"observed_at":"2026-07-02T10:16:52.622553Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-28T05:06:21.205587Z","title":"Gossip-based computation of aggregate information","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:c2d6f73e889ee5ef5d7c1d3cabf3dd97c9e29ae7d6be4b199c6fa26b9646b299","observation_id":"1066b9a9-d702-43f0-8771-84d8c9d3c29b","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"A unified theory of decentralized sgd with changing topology and local updates","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:969c690b191232821ce9222781669a54e235c4cf27da27228c1da189d4ec11c0","observation_id":"37b3ba7a-91d9-4d16-ad64-2a7892c38adf","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"An improved analysis of gradient tracking for decentralized machine learning.Advances in Neural Information Processing Systems, 34: 11422–11435, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:f1c81e29c898db49d1582546fbb77647bcd2808e7723fffa72904939246d8e6f","observation_id":"c9105135-6347-4f88-98f5-666cf067e359","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Adom: accelerated decentralized optimization method for time-varying networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:ba5d331fbc2e577c1f35058d36717f2ecf18de9e16a75321f07fcd6168fee4ee","observation_id":"1764a392-d979-48f3-a48f-bd042282d1c8","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"An optimal method for stochastic composite optimization.Mathematical Programming, 133(1):365–397, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:67ba77abdb5cd482d4567104404abeeca1a967b56859149ce4f4d504ac2d01fb","observation_id":"237202df-cb53-4bae-94d3-e994f328f252","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09126","last_updated":"2021-04-05T12:06:57Z","snapshot_observed_at":"2026-08-01T15:59:12.234371Z","submitted_at":"2019-10-21T02:51:54Z","title":"Communication-Efficient Local Decentralized SGD Methods","version":5},"cited_work":{"arxiv_id":"1910.09126","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.09126","snapshot_observed_at":"2026-07-02T10:16:52.618322Z","title":"1910.09126 , archivePrefix=","venue":null,"work_id":"7973350a-c10e-46f0-bfe5-4b5d382ea674","year":1910},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"cited_paper":"/paper/1910.09126","citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:45833c5c32e1cf9892b6a516960601379508fedac9af3244ea664f744cf06d1e","observation_id":"93f02e49-f84b-4730-b15b-24815e416b5c","resolution":{"observed_at":"2026-07-02T10:16:52.620015Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-28T05:06:21.205587Z","title":"Can decentralized algorithms outperform centralized algorithms? a case study for decentralized parallel stochastic gradient descent","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:fcd60b007967c658fbbc108dc9b04e6b945747f0a5f6e3c2b4fda3d256ac7c29","observation_id":"e3cc1df5-62d3-4afb-b237-57df3d43d3a0","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Optimal complexity in decentralized training","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:b1c8b0f00809a28eeef0c6a0f32acb718609de03405dbbaf09abc88738042d46","observation_id":"2929b8ed-f004-4b4d-9ac0-c13e5aa8223c","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Distributed subgradient methods for multi-agent opti- mization.IEEE Transactions on automatic control, 54(1):48–61, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:49496a054c9922460cafd91939f436c6ea645375daed2132563c2c3c3a5bf330","observation_id":"6b5f3f13-4530-4f19-bf4c-167c73938dd5","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Achieving geometric convergence for distributed optimization over time-varying graphs.SIAM Journal on Optimization, 27(4):2597–2633, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:073e8784db7b690e64ef8af5cb30d50b2288c961ef85c057fb37fa5984b94ceb","observation_id":"c3043379-23c6-4005-833c-e7e374a44f36","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"A method for solving the convex programming problem with convergence rate o (1/k2)","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:cb61618dd899696148dec6a16ac7c51a07c1917dd904b59fd35842e032c30a8a","observation_id":"478ea710-d0d4-4147-8fa9-20944869586c","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Springer, 2 edition, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:4bc5f8b87a1ab2348f34c2ed2f910add9f2e192af6edd6729f82405536655367","observation_id":"ec248300-b65d-429a-9b70-c33c0cf83755","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Optimal distributed convex optimization on slowly time-varying graphs.IEEE Trans","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:5b61345977a03701ce2f753cd6cd7a06bdc1bd9cc67cf1ab92d5f90172ce1609","observation_id":"74b3d2ab-9927-45ad-867d-fc8f8b4bad7e","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Towards accelerated rates for distributed optimization over time-varying networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:1a98c73a6226a7795676e32228a02bc5f8ad0d59d0d59d890a8b7f5850d475cb","observation_id":"7dda9c9f-89f9-4a7d-a575-5e6e3abe2f9c","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:477cd1535c27e02b01d5f893dc7430cf61e5f1729fd9671c2e12e843ac0650b0","observation_id":"5a7a0502-a5ad-4c6b-a0fd-0bc6f5f6234c","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Communication compression for decentralized training","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:45795a50e5c92e2b39e2bda2fbf9848f00f824d253f6e259052cc4b3db784f64","observation_id":"0f39c0d5-65b3-4feb-b2dc-ce7b457ee668","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"D2: Decentralized training over decentralized data","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:ad11dfad8701c368fb1656e119024508fc907bd406a9302320926287632ae4ef","observation_id":"a8adace5-8c59-4d21-9d1a-8a5e5b191f1a","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Distributed asynchronous deterministic and stochastic gradient optimization algorithms.IEEE transactions on automatic control, 31 (9):803–812, 1986","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:0ff46072607e3283e4520886f4ae4d3f3db4e5837d451b203e75ecab6fc2109f","observation_id":"1b1dbf19-dc83-4d0c-b9d5-179296d7a052","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Optimal time complexities of parallel stochastic opti- mization methods under a fixed computation model.Advances in Neural Information Processing Systems, 36:16515–16577, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:9fce857d07ae54257c59c44cc1742488e1aa77d590395feb22c71d5024721b11","observation_id":"f1793bb2-bb2f-4231-b669-17d84e1d7a47","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Fast linear iterations for distributed averaging.Systems & Control Letters, 53(1):65–78, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:10f20d92849e418be39a91a8180393e64367a0f8aaecfcf94a0af1b97bafb810","observation_id":"d28005d2-8890-4e6a-ab93-a0412abce695","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","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-06-28T05:06:21.205587Z","title":"Accelerated primal-dual algorithms for distributed smooth convex optimization over networks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T05:06:21.205587Z"},"links":{"citing_paper":"/paper/2606.04757"},"observation_digest":"sha256:e2a723b6094bfa70609810c73598d10679be2afbe93e7cf3ec711ecfca965dea","observation_id":"a465e888-36cd-47c2-a9d0-da9f99b07f86","resolution":{"observed_at":"2026-06-28T05:06:21.205587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.04757","last_updated":"2026-06-03T11:42:01Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-06T18:37:53.344842Z","submitted_at":"2026-06-03T11:42:01Z","title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":28,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":30},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2606.04757."}