{"as_of":"2026-08-08T03:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:847b13e2066d10166668c71f65bb8555743b074ba585eb5595b5eddb691b53c6","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:52:31.942910Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.04600/citation-record","integrity":"/paper/2506.04600/integrity","json":"/paper/2506.04600/citation-record.json","paper":"/paper/2506.04600"},"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-07T10:52:32.766445Z","title":null,"venue":null,"work_id":"8be1b5ff-d8b0-4602-9cde-453101c2e7aa","year":2022},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.753444Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:7b5f54da044b62cfbda75b4edacffef79f98acbb23d7e0ba9a9096d34f305a0d","observation_id":"df370579-89d5-4d3a-9331-a8657481b9c2","resolution":{"observed_at":"2026-08-07T10:52:32.770029Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.755014Z","title":"Penalized likelihood regression for generalized linear models with non-quadratic penalties","venue":null,"work_id":"5e39a3af-988d-4a3b-998e-0647b85ec00f","year":2011},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.757667Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:6909efb616fc048849eee7172c873945127c9834a4f290b46fc3ecfc68627560","observation_id":"6264d84f-68da-43c0-8ddf-796040335fbc","resolution":{"observed_at":"2026-08-07T10:52:32.758934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.743431Z","title":"C., Foster, D","venue":null,"work_id":"e58c772a-a363-4da5-b287-175cac7fb100","year":2019},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.761631Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:a859baa346d309125011c78a4e65797f38c0a67c017207a39592a59db426f215","observation_id":"405e098a-23cb-431d-b2d9-f35671b392ef","resolution":{"observed_at":"2026-08-07T10:52:32.747243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.731029Z","title":"Stochastic gradient push for distributed deep learning","venue":null,"work_id":"96cd02e5-119f-4dfe-90b6-58be99135190","year":2019},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.765675Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:01095c251285badcd0ab6d984e1b3f07afb83275e3718ed9a0c3b35a70c3dcd4","observation_id":"f805b939-6055-4ad3-a08a-6fff66b5162e","resolution":{"observed_at":"2026-08-07T10:52:32.735417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.717683Z","title":"E., and Nocedal, J","venue":null,"work_id":"413efb18-b316-4c65-ac34-e133525044f0","year":2018},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.769531Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:bcf881f6d8bc3f92e8aa3b8d95bfe59bf6ca8385826e42138bbee0282732b6aa","observation_id":"b893a231-c30c-4b52-9bd6-0df4e85ffaa3","resolution":{"observed_at":"2026-08-07T10:52:32.721833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.705858Z","title":"C., Hinder, O., and Sidford, A","venue":null,"work_id":"8c85ba57-22b6-436c-8054-ed9e90b7fd5b","year":2020},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.773484Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:796095266bc04b2e45bcbaa01c4798243f2f7baa54daaa7412ab70d0b2524c48","observation_id":"667a50b4-ac37-43de-8d5b-c90a8990c32d","resolution":{"observed_at":"2026-08-07T10:52:32.709587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.694032Z","title":"C., Hinder, O., and Sidford, A","venue":null,"work_id":"ebdeb8a8-27f5-427f-95e7-67ff4dd1fd8a","year":2021},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.777409Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:0836055b6d3e63dee5a28bc0bda84fd91b8afee31340d25f3440d3574b6c2028","observation_id":"75b32e95-a4d4-4e39-b132-be9230e355d8","resolution":{"observed_at":"2026-08-07T10:52:32.697946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.682242Z","title":"and Scutari, G","venue":null,"work_id":"5e944a58-ac6f-4377-bbfe-28154b5479d2","year":2016},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.781031Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:f7c16d649c8e1200f6db6a83c845f1aa01d58db511a4416b14ed136387073e7b","observation_id":"6306506c-afb7-49ed-813f-5bfaefd41edf","resolution":{"observed_at":"2026-08-07T10:52:32.686249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.670654Z","title":"S., Aguiar, A","venue":null,"work_id":"d9f10c19-f952-4186-b265-abbaa85de0e1","year":2023},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.784611Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:58393348ca31a5145b8b9ab64ac089a4afa751d2adbd89b88ddf22f5f21a69f2","observation_id":"65592e1b-6e01-4b29-924c-c690bb117da6","resolution":{"observed_at":"2026-08-07T10:52:32.675146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:31.788089Z","title":"Deep residual learning for image recognition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.788089Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:e1c043e52a971deca793d222d9865b7657d5bd49e5becb7db5c9184bb60e9f02","observation_id":"4dc08b89-fd7f-4972-a54f-646b0290d6a3","resolution":{"observed_at":"2026-08-07T10:52:31.788089Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.00533","last_updated":"2022-11-01T15:37:54Z","snapshot_observed_at":"2026-08-05T04:07:10.894135Z","submitted_at":"2022-11-01T15:37:54Z","title":"Optimal Complexity in Non-Convex Decentralized Learning over Time-Varying Networks","version":1},"cited_work":{"arxiv_id":"2211.00533","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.00533","snapshot_observed_at":"2026-08-07T10:52:32.284297Z","title":"Optimal Complexity in Non-Convex Decentralized Learning over Time-Varying Networks","venue":"cs.LG","work_id":"eb9fd03d-dc28-4d96-879a-a8f5e33b5da7","year":2022},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.791587Z"},"links":{"cited_paper":"/paper/2211.00533","citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:d66523914d33cacafe16b56f2b039c5472a90cba5cc94e6a5c38e447ad28b30e","observation_id":"13df4844-a9b6-4548-ab72-ee98b7055842","resolution":{"observed_at":"2026-08-07T10:52:32.289551Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.653403Z","title":"Lower bounds and nearly optimal algorithms in distributed learning with communication compression","venue":null,"work_id":"bb1909a2-3ac0-4cae-ab78-7e9960165e5a","year":2022},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.795413Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:70e4265c16de611b5dfa9eeb448d15940c2186444833e626414809200efa540f","observation_id":"7107695b-5b9f-4f81-b148-15a39751633b","resolution":{"observed_at":"2026-08-07T10:52:32.657330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.640964Z","title":"Gossip-based computation of aggregate information","venue":null,"work_id":"80c18238-3c71-4fc2-945f-6d353c60121e","year":2003},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.798645Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:719193f7b3e613ee7760f18d11fc271203c79bdee47465ddface9c60f4dd9120","observation_id":"a71f2355-6095-4eb4-ac6a-6a83ad3018c7","resolution":{"observed_at":"2026-08-07T10:52:32.645853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:31.802355Z","title":"A unified theory of decentralized sgd with changing topology and local updates","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.802355Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:ade544373d5d9c7dd92523029c4e6abb9d678c5295cd01a0dc95f9e0880b73ec","observation_id":"ae7e3613-f09c-4cb9-ac22-7296d56a15d1","resolution":{"observed_at":"2026-08-07T10:52:31.802355Z","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-07T10:52:32.622897Z","title":"Lower bounds and optimal algorithms for smooth and strongly convex decentralized optimization over time-varying networks","venue":null,"work_id":"2b494687-f70c-4ed3-a840-fbb314290e74","year":2021},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.805898Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:50805fe686ec9681b43ddf6d2aa0bf15766519b8583af402ad9fe73344886059","observation_id":"2e342c3b-da40-4297-b083-cfc7097c0b9e","resolution":{"observed_at":"2026-08-07T10:52:32.626921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.612542Z","title":"Decentralized asynchronous non-convex stochastic optimization on directed graphs","venue":null,"work_id":"32b0c1d2-b4e5-4750-9427-9ffc8bf86743","year":2023},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.809580Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:d10537cd21f21bbe2e2aa39d06748f5f4948fa829f0481d836c030d6c447370b","observation_id":"1edbc73d-d877-4e34-98dc-7f7a2cbf176b","resolution":{"observed_at":"2026-08-07T10:52:32.616124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.601958Z","title":"and Lin, Z","venue":null,"work_id":"6d804b6d-97d3-44a3-8a71-ff11b5e03851","year":2024},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.813338Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:fe149d753a668ed2727aae840bb8fad2dcfee0fd58d6e1c029b3e55f5518fcb7","observation_id":"997d3d45-8d23-4702-a18f-690fb71c5151","resolution":{"observed_at":"2026-08-07T10:52:32.605614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.591741Z","title":"Row-stochastic matrices based distributed optimization algorithm with uncoordinated step-sizes","venue":null,"work_id":"6e4a458c-288b-4f93-b2a1-3e3bbf91a047","year":2019},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.817075Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:840b8ef2f437f3382752cb87c1e35a3293ffdd35dc67f73b062d8be5897fa6d6","observation_id":"cb015608-57e5-458c-aee4-9470d171d576","resolution":{"observed_at":"2026-08-07T10:52:32.595385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.580360Z","title":null,"venue":null,"work_id":"78768b67-c399-4f23-af2b-631bb4f99a5c","year":2024},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.820607Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:c25a2931444c6794ad74b3b5dcd4a2cf04c007d6a7c1504f026537dff0a53e62","observation_id":"3545b874-e208-4e62-a108-54191479c1a2","resolution":{"observed_at":"2026-08-07T10:52:32.584525Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04928","last_updated":"2024-04-27T17:27:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T09:44:28Z","title":"Understanding the Influence of Digraphs on Decentralized Optimization: Effective Metrics, Lower Bound, and Optimal Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04928","snapshot_observed_at":"2026-08-07T10:52:31.824412Z","title":"Towards better understanding the influence of directed networks on decentralized stochastic optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.824412Z"},"links":{"cited_paper":"/paper/2312.04928","citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:ad6dde74b5a52966a86805093907d85bd9044153e951a3b6ebaeff1a616bf1b7","observation_id":"397b4123-b867-47eb-9b99-c00b1dd67285","resolution":{"observed_at":"2026-08-07T10:52:31.824412Z","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-07T10:52:32.568539Z","title":"A nesterov-like gradient tracking algorithm for distributed optimization over directed networks","venue":null,"work_id":"13dd52b3-a9db-49a0-9757-d2a8cb767efe","year":2020},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.828239Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:ba3fc8272d1fe8b7cd00c2cb60e26f02fe502486213af1cc72a05a13a6f1dbf7","observation_id":"2a9882a6-87c0-4688-967d-50cfca482888","resolution":{"observed_at":"2026-08-07T10:52:32.573011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.558270Z","title":"and De Sa, C","venue":null,"work_id":"e1308bf5-232c-47dd-b887-ab46cdeda8db","year":2021},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.831925Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:525d35910234e15e360aa8e007bc7f98bf7b016e8ff5f21dd740330d961a033e","observation_id":"6c497ace-5d8a-4643-b8be-d987b9a1b2a7","resolution":{"observed_at":"2026-08-07T10:52:32.561697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.548074Z","title":null,"venue":null,"work_id":"5e8dc029-745f-4013-8227-e86a0709d93c","year":2016},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.835507Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:870b21194fcec5072b6c86a7f1f8a8000a934e0b0d93d9d90f364aa660d9ba3a","observation_id":"b162e78b-67ad-4c52-bf06-36210d3090b8","resolution":{"observed_at":"2026-08-07T10:52:32.551720Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.537519Z","title":"and Olshevsky, A","venue":null,"work_id":"fcac9e81-9986-448c-9b68-be5ea374c92d","year":2014},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.839032Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:371d9e90a9ed50c57d43ccddda8a0ffe49bd380bf272a6fb54de52abedea2384","observation_id":"d419be40-abf3-4995-bf11-41a019f75381","resolution":{"observed_at":"2026-08-07T10:52:32.541119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:31.842647Z","title":"Achieving geometric convergence for distributed optimization over time-varying graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.842647Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:6ed4340d11a40c874eb078e5b9ef1f3c1c740d233171438543b77b78c35c681f","observation_id":"619b1273-cb5c-47f2-b031-c964fd723004","resolution":{"observed_at":"2026-08-07T10:52:31.842647Z","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-07T10:52:32.527112Z","title":"Achieving geometric convergence for distributed optimization over time-varying graphs","venue":null,"work_id":"afc55ddc-c448-46c9-b0ae-62f2f99eaadc","year":2017},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.846254Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:82692eb82659732ae17ea4ed42feaabc17e55223cca528890c9b91794647989e","observation_id":"e2d35a6f-d544-4048-9296-211aaf40d364","resolution":{"observed_at":"2026-08-07T10:52:32.530949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.516009Z","title":null,"venue":null,"work_id":"a3e4329c-2dc8-41c2-b067-ed1a7227b223","year":2018},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.849634Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:71939ec09b01e65620d12abc22b5ec8e6da349fd0a952ed894f845d2c60c1f4d","observation_id":"f4c8f43a-7da6-4658-91be-2815343049c0","resolution":{"observed_at":"2026-08-07T10:52:32.520271Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:31.853398Z","title":"and Olshevsky, A","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.853398Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:87035fd6a1cf051e214698458943e7e06c76cf61a2e1096509588d019b55c123","observation_id":"d67350bb-f195-4a74-9f4e-c97697b2797b","resolution":{"observed_at":"2026-08-07T10:52:31.853398Z","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-07T10:52:31.856760Z","title":"Zur theorie der matrices","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.856760Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:e199febaea235d0a04cf77639f193e86052e4f5c467241afc9f3030578da6061","observation_id":"d94f2abb-2796-4eb6-8f33-6c0ed280a144","resolution":{"observed_at":"2026-08-07T10:52:31.856760Z","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-07T10:52:32.505603Z","title":"and Li, N","venue":null,"work_id":"da295d5b-7f99-431a-8fde-9c73cad46f8b","year":2017},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.860569Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:da89fea218724479f31d63cbba158fcacbee1abc1fe972b9e4fb413468dde853","observation_id":"87afc534-c97f-458d-83ff-a3dd92f875aa","resolution":{"observed_at":"2026-08-07T10:52:32.509137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.493826Z","title":"I., Xin, R., Kar, S., and Khan, U","venue":null,"work_id":"cb270ba2-3f61-40cb-bf75-7b92bf86d5a2","year":2020},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.864182Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:52c64bf8634d64564b5e6a147da8531e737f92011f55d6a37e23fdb8a40666ad","observation_id":"82423cbe-5537-4bda-b4fc-5570dadd1927","resolution":{"observed_at":"2026-08-07T10:52:32.498441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.483556Z","title":null,"venue":null,"work_id":"e1029b24-1d6e-4e85-8ebe-a03dce919b0a","year":2014},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.867729Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:6da638b541887161c50bd29e547b924ae20e92bbe1a5cfc307f0841ba30686a1","observation_id":"f893e4fc-eaa2-455e-98f8-0b4951cbbd3d","resolution":{"observed_at":"2026-08-07T10:52:32.487111Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.472437Z","title":"T., and Massouli \\'e , L","venue":null,"work_id":"6eaf00fe-51d3-4d1b-98c9-00bbf652e687","year":2017},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.871391Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:213103e8a0c449d10235d9ff577a7446741c766a6f26d544b6d1ceaa8d2ddf47","observation_id":"4085b012-4f2b-4e7c-a10e-39937712a7ca","resolution":{"observed_at":"2026-08-07T10:52:32.475969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.461784Z","title":null,"venue":null,"work_id":"8fb60d10-7c5f-4a07-a3c3-252f370715e8","year":2018},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.875137Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:42a24ad5e6f7f9f216b2795548f539fb1868ca344f6c552fa4aa17d8f632403d","observation_id":"4d231bac-c17a-47d9-a647-14ce24e00563","resolution":{"observed_at":"2026-08-07T10:52:32.465428Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.450953Z","title":"and Hong, M","venue":null,"work_id":"d58aa003-c686-49c3-89e3-db16545fdf5a","year":2019},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.878563Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:f955ed391146f9831f698a333b3fe98b46539799494b677632dc7ae73d7ed33c","observation_id":"0e2d8862-5c5c-4279-b60b-eea48fb63e3c","resolution":{"observed_at":"2026-08-07T10:52:32.454615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.440080Z","title":"I., Lawlor, S., and Rabbat, M","venue":null,"work_id":"9997a6c4-afb8-4d22-a54b-201081f421ba","year":2012},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.882506Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:3833702a617c83d7a5aa5ac2f65492c05167904b799b03d876fcb1180ab5c1eb","observation_id":"7a9519ff-d9b0-4375-92b0-d5daa5a483a0","resolution":{"observed_at":"2026-08-07T10:52:32.444165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.429519Z","title":"and Khan, U","venue":null,"work_id":"c84213c1-8a7f-4e70-bd5a-fccb9e0cdce0","year":2017},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.885949Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:11bf417e3f26c678ce77d2e22e86a1d53dfee90b945eb3f154e75906b8dce41c","observation_id":"7ba51bc9-c1b5-4966-a182-a4ab902c4ed8","resolution":{"observed_at":"2026-08-07T10:52:32.433268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.418910Z","title":null,"venue":null,"work_id":"117efe82-ff8c-42a0-a8bb-da4c38324a50","year":2017},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.889195Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:53b80aec296ea044a2ff091ab1f1fdfc242d7650fbd768d76a508fea40f4eeec","observation_id":"a32be0b0-9308-4139-860f-b68a42086a3b","resolution":{"observed_at":"2026-08-07T10:52:32.422679Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.407639Z","title":null,"venue":null,"work_id":"1e8dcdab-cd99-413b-a64d-b63ff92dbdfd","year":2019},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.893739Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:759b1b7b4b33ba89025bcca1604c4c31c62c4b938bc879816b8f05070610bd3b","observation_id":"185c2555-59cf-49d9-badb-ff1f5ae6ec10","resolution":{"observed_at":"2026-08-07T10:52:32.411601Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.396580Z","title":"K., Khan, U","venue":null,"work_id":"6ddec9be-31d6-4ef0-afd0-abd41271cc41","year":2019},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.897148Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:6c0020b03b463df3d002e4d91d9983f2c11638d1a35a9990c58ddd86998232ae","observation_id":"d2e01865-339f-49d7-82a6-6030e1831f51","resolution":{"observed_at":"2026-08-07T10:52:32.400053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1186/s13634-018-0596-y","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:52:31.973435Z","title":"Frost—fast row-stochastic optimization with uncoordinated step-sizes","venue":null,"work_id":"255aaafa-bd90-4fbc-8c4f-8259faa27283","year":2019},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.900719Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:01bc8e3cbb888e951a19b01471d387bbe7cf2d5c6ccb7a4f6243a61490ae08ce","observation_id":"dc46c4be-9999-49c9-a29d-edacdf0fd986","resolution":{"observed_at":"2026-08-07T10:52:31.979893Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:31.904445Z","title":"An improved convergence analysis for decentralized online stochastic non-convex optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.904445Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:2ca699915ca043bb2bc4ad6ecdcdac850bb7130573c8e18747b2bc0b2884a674","observation_id":"46aecf0d-3b1b-432b-8952-46647b6d4dc1","resolution":{"observed_at":"2026-08-07T10:52:31.904445Z","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-07T10:52:32.386099Z","title":"C., and Xie, L","venue":null,"work_id":"1c67f501-f36e-4667-b5fe-0d00fe0614b1","year":2015},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.908174Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:0285fa01b2ca85f3d444d78fad2a36e9596d8cb02ad0e021a387ae00800673df","observation_id":"442c0ea6-9f7c-4935-97e7-4f1353d3dad3","resolution":{"observed_at":"2026-08-07T10:52:32.389759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.375198Z","title":"Achieving linear speedup with partial worker participation in non-iid federated learning","venue":null,"work_id":"85114164-da71-4323-b973-2234e9aadd41","year":2021},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.911806Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:6b630617281e86454b9c055a0d28f48f9984f222332fc4a110dfd1827baac9eb","observation_id":"94907c14-464a-49f3-8ce7-621b8493f7e0","resolution":{"observed_at":"2026-08-07T10:52:32.378968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.363451Z","title":null,"venue":null,"work_id":"a5665223-d0d1-43bc-b98a-740732cce84a","year":2019},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.915629Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:e18e42e5a7dcb424d3e139dc09a8d9349f0b739da8962c123beee8a59e905478","observation_id":"ee6edc2e-b626-4057-89a3-881b8c2e7fcf","resolution":{"observed_at":"2026-08-07T10:52:32.367450Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.11850","last_updated":"2022-10-21T01:00:26Z","snapshot_observed_at":"2026-08-02T20:57:11.165200Z","submitted_at":"2022-02-24T01:06:42Z","title":"Robust Federated Learning with Connectivity Failures: A Semi-Decentralized Framework with Collaborative Relaying","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.11850","snapshot_observed_at":"2026-08-07T10:52:31.919195Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.919195Z"},"links":{"cited_paper":"/paper/2202.11850","citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:d27e0b24b12c323628907920f90d30eeb6226f9858c822997ea46fb27d0f552c","observation_id":"4e48644f-187c-4c0f-a66a-c0519d8ca434","resolution":{"observed_at":"2026-08-07T10:52:31.919195Z","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-07T10:52:32.351942Z","title":"Exponential graph is provably efficient for decentralized deep training","venue":null,"work_id":"81f3c4a1-41be-48c9-a75c-66cfa7dcd173","year":2021},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.923252Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:851cd757c75d7744b9692925d04f5ff313b2a471acc69762e67fb9915582ed12","observation_id":"c26573b1-12f3-4be9-bec6-f978ff9d5e1a","resolution":{"observed_at":"2026-08-07T10:52:32.355782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.339552Z","title":"On the linear speedup analysis of communication efficient momentum sgd for distributed non-convex optimization","venue":null,"work_id":"380edc47-ea4f-4e14-9d02-baf95f0e73a2","year":2019},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.927275Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:1daa0fc37cbce8e49abd04d34b4e84e28644dea95b1f956db19d4dbb99570d74","observation_id":"bdb4c40f-cbb0-48a0-8284-772b73e31353","resolution":{"observed_at":"2026-08-07T10:52:32.344470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.327322Z","title":"Decentlam: Decentralized momentum sgd for large-batch deep training","venue":null,"work_id":"3cef1ddb-d0b4-44bb-aac7-319fb95edb34","year":2021},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.930752Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:1b27b675e37f5a914627e3336fe1fe06752c24ff9aa80e7fde1170ff97bb75e8","observation_id":"0777803e-2226-47f4-85eb-0f306cf04ffa","resolution":{"observed_at":"2026-08-07T10:52:32.331991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.315981Z","title":"Revisiting optimal convergence rate for smooth and non-convex stochastic decentralized optimization","venue":null,"work_id":"7b185035-c9fb-46df-bd18-ed90dd2b047f","year":2022},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.934688Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:b9a73c88a9cc94d0901f6174c6c3160dcbd798e1d56dfccf6f33b48a0c3cb77e","observation_id":"035390a0-6936-4ad2-b383-8c66ce5ba166","resolution":{"observed_at":"2026-08-07T10:52:32.319646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:32.303985Z","title":"and Yin, W","venue":null,"work_id":"ff3234e9-52b0-4ce0-b091-543b3286df77","year":2017},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.938053Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:f4642dc0e7db7eb65581bc1aace840905d0bd72011bfbf3aa37d32464dcb3328","observation_id":"8dad5757-864a-434c-bf72-d72b61de6a75","resolution":{"observed_at":"2026-08-07T10:52:32.308008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:52:31.942910Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:31.942910Z"},"links":{"citing_paper":"/paper/2506.04600"},"observation_digest":"sha256:0a01c9e4eff42db89db3a0cbe6659c327e033b55c16a7bd2edcc49e680a974fd","observation_id":"334cf450-f56d-46c0-8cc1-86addf040e91","resolution":{"observed_at":"2026-08-07T10:52:31.942910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.04600","last_updated":"2025-06-05T03:37:41Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T10:35:47.188742Z","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":2,"verified_fuzzy":32},"total_outbound_references":52},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2506.04600."}