Pith. sign in

Paper Citation Record · LEDGER

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.04600 v1

Coverage vector

measured 52 of 52 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T10:52:31.942910Z

measured 52 of 52 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

52 of 52 outbound references displayed

  • verified exact2
  • verified fuzzy32
  • unresolved18
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation df370579-89d5-4d3a-9331-a8657481b9c2 · outbound

This paper cites an unresolved cited work.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Unresolved cited work

Reference 1

Resolution
unresolved
raw_fallback, observed 2026-08-07T10:52:32.770029Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.753444Z digest=sha256:201812f6f6e3bd6aeb670f4e0773c4eedd409b68d5f3a99307f5fc138bacf06d

Observation 6264d84f-68da-43c0-8ddf-796040335fbc · outbound

This paper cites Penalized likelihood regression for generalized linear models with non-quadratic penalties.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Penalized likelihood regression for generalized linear models with non-quadratic penalties

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.758934Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.757667Z digest=sha256:f86b48d1b6644ed9c419172fc787730b65b85518916ac2212c8cc7a8e0914842

Observation 405e098a-23cb-431d-b2d9-f35671b392ef · outbound

This paper cites C., Foster, D.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks C., Foster, D

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.747243Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.761631Z digest=sha256:7b3edc5215b8598a9307fc55f966273bb318b59eb74a4556ce8b6c654d330957

Observation f805b939-6055-4ad3-a08a-6fff66b5162e · outbound

This paper cites Stochastic gradient push for distributed deep learning.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Stochastic gradient push for distributed deep learning

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.735417Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.765675Z digest=sha256:8ccbbaf41a2ac9b5fe55232eb31b312b1bc0639078cfcd0055bb5132dbc9ef59

Observation b893a231-c30c-4b52-9bd6-0df4e85ffaa3 · outbound

This paper cites E., and Nocedal, J.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks E., and Nocedal, J

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.721833Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.769531Z digest=sha256:e5a24cf541dcf57e2aee20a22ecf0b4234206b388ed13b641ed1e37f0332f0f4

Observation 667a50b4-ac37-43de-8d5b-c90a8990c32d · outbound

This paper cites C., Hinder, O., and Sidford, A.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks C., Hinder, O., and Sidford, A

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.709587Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.773484Z digest=sha256:632c21f9bf5c6fcb14319db0c0bbc50cef0900c2e3879b97582a3678250e0bc5

Observation 75b32e95-a4d4-4e39-b132-be9230e355d8 · outbound

This paper cites C., Hinder, O., and Sidford, A.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks C., Hinder, O., and Sidford, A

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.697946Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.777409Z digest=sha256:7f4f2e8ef4242e11bf4036a1f66a5196effa692d442a3fc883b24f6b84ba8d2b

Observation 6306506c-afb7-49ed-813f-5bfaefd41edf · outbound

This paper cites and Scutari, G.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks and Scutari, G

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.686249Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.781031Z digest=sha256:743044e1a6258769d475b421d6631c04207bd839a9a242900b407b118a4ba23c

Observation 65592e1b-6e01-4b29-924c-c690bb117da6 · outbound

This paper cites S., Aguiar, A.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks S., Aguiar, A

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.675146Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.784611Z digest=sha256:f207a74fa2b17acacb6efb73c2757e67c9f5f55e13a901655a5712a678f45281

Observation 4dc08b89-fd7f-4972-a54f-646b0290d6a3 · outbound

This paper cites Deep residual learning for image recognition.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Deep residual learning for image recognition

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-07T10:52:31.788089Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T10:52:31.788089Z digest=sha256:e1c043e52a971deca793d222d9865b7657d5bd49e5becb7db5c9184bb60e9f02

Observation 13df4844-a9b6-4548-ab72-ee98b7055842 · outbound

This paper cites Optimal Complexity in Non-Convex Decentralized Learning over Time-Varying Networks.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Optimal Complexity in Non-Convex Decentralized Learning over Time-Varying Networks

Reference 11

Resolution
verified exact
local_arxiv, observed 2026-08-07T10:52:32.289551Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.791587Z digest=sha256:ee5f6c2b8545a278692c17dbd587ed7fcc2f2b29672923ea66c557434b2cbf3d

Observation 7107695b-5b9f-4f81-b148-15a39751633b · outbound

This paper cites Lower bounds and nearly optimal algorithms in distributed learning with communication compression.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Lower bounds and nearly optimal algorithms in distributed learning with communication compression

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.657330Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.795413Z digest=sha256:554ecf5a78796182b3f13407812348ad57bd2e96500cade49bae9101d026ef10

Observation a71f2355-6095-4eb4-ac6a-6a83ad3018c7 · outbound

This paper cites Gossip-based computation of aggregate information.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Gossip-based computation of aggregate information

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.645853Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.798645Z digest=sha256:16f72c198e90789a61a94ebbd3c8a68787ba1aa47974add067eaf405f3032701

Observation ae7e3613-f09c-4cb9-ac22-7296d56a15d1 · outbound

This paper cites A unified theory of decentralized sgd with changing topology and local updates.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks A unified theory of decentralized sgd with changing topology and local updates

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-07T10:52:31.802355Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T10:52:31.802355Z digest=sha256:ade544373d5d9c7dd92523029c4e6abb9d678c5295cd01a0dc95f9e0880b73ec

Observation 2e342c3b-da40-4297-b083-cfc7097c0b9e · outbound

This paper cites Lower bounds and optimal algorithms for smooth and strongly convex decentralized optimization over time-varying networks.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Lower bounds and optimal algorithms for smooth and strongly convex decentralized optimization over time-varying networks

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.626921Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.805898Z digest=sha256:5d4a70c2588b2cce635b866fc87f7811469798122313623672e04d7452814619

Observation 1edbc73d-d877-4e34-98dc-7f7a2cbf176b · outbound

This paper cites Decentralized asynchronous non-convex stochastic optimization on directed graphs.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Decentralized asynchronous non-convex stochastic optimization on directed graphs

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.616124Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.809580Z digest=sha256:6bb54780e396e90718a2be82cc344c7c62be2c51ceed2650a413c73f2d9e8331

Observation 997d3d45-8d23-4702-a18f-690fb71c5151 · outbound

This paper cites and Lin, Z.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks and Lin, Z

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.605614Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.813338Z digest=sha256:97aedf49fd0fea02de30c823e0a8f79b6cadca4fe73816d1a9fcf277f838c141

Observation cb015608-57e5-458c-aee4-9470d171d576 · outbound

This paper cites Row-stochastic matrices based distributed optimization algorithm with uncoordinated step-sizes.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Row-stochastic matrices based distributed optimization algorithm with uncoordinated step-sizes

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.595385Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.817075Z digest=sha256:9e1bf01e63e6af0547aa6f5541b15591003950a1e86ca488b00e3431bb207599

Observation 3545b874-e208-4e62-a108-54191479c1a2 · outbound

This paper cites an unresolved cited work.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Unresolved cited work

Reference 19

Resolution
unresolved
raw_fallback, observed 2026-08-07T10:52:32.584525Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.820607Z digest=sha256:f06fe489665a5e7fd6a17728d9b7d3d87c212b16a8325ddef7386d4f473af3b5

Observation 397b4123-b867-47eb-9b99-c00b1dd67285 · outbound

This paper cites Understanding the Influence of Digraphs on Decentralized Optimization: Effective Metrics, Lower Bound, and Optimal Algorithm.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Understanding the Influence of Digraphs on Decentralized Optimization: Effective Metrics, Lower Bound, and Optimal Algorithm

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-07T10:52:31.824412Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T10:52:31.824412Z digest=sha256:ad6dde74b5a52966a86805093907d85bd9044153e951a3b6ebaeff1a616bf1b7

Observation 2a9882a6-87c0-4688-967d-50cfca482888 · outbound

This paper cites A nesterov-like gradient tracking algorithm for distributed optimization over directed networks.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks A nesterov-like gradient tracking algorithm for distributed optimization over directed networks

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.573011Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.828239Z digest=sha256:aab8977ac19f4ac05e1c08ad4e9b52947de9683514de589e736aa77fc263b0ba

Observation 6c497ace-5d8a-4643-b8be-d987b9a1b2a7 · outbound

This paper cites and De Sa, C.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks and De Sa, C

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.561697Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.831925Z digest=sha256:63782107a63a0be4575c2b6aae0d7c5909198f2236100ed2c053a448e125ea81

Observation b162e78b-67ad-4c52-bf06-36210d3090b8 · outbound

This paper cites an unresolved cited work.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Unresolved cited work

Reference 23

Resolution
unresolved
raw_fallback, observed 2026-08-07T10:52:32.551720Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.835507Z digest=sha256:31859d463a751b62221fa249b45a1361ea2a50b4803f16f61f6219c05c058fa6

Observation d419be40-abf3-4995-bf11-41a019f75381 · outbound

This paper cites and Olshevsky, A.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks and Olshevsky, A

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.541119Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.839032Z digest=sha256:1ca450bb0fe735f434b1c3b39a67974b79fc58ba4b5daf8a5b4323ab29a5e8f8

Observation 619b1273-cb5c-47f2-b031-c964fd723004 · outbound

This paper cites Achieving geometric convergence for distributed optimization over time-varying graphs.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Achieving geometric convergence for distributed optimization over time-varying graphs

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-07T10:52:31.842647Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T10:52:31.842647Z digest=sha256:6ed4340d11a40c874eb078e5b9ef1f3c1c740d233171438543b77b78c35c681f

Observation e2d35a6f-d544-4048-9296-211aaf40d364 · outbound

This paper cites Achieving geometric convergence for distributed optimization over time-varying graphs.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Achieving geometric convergence for distributed optimization over time-varying graphs

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.530949Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.846254Z digest=sha256:da601b7e38c679db5e5102b77870a0911f4ea018489f43f30a21f1cf7b56bd3a

Observation f4c8f43a-7da6-4658-91be-2815343049c0 · outbound

This paper cites an unresolved cited work.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Unresolved cited work

Reference 27

Resolution
unresolved
raw_fallback, observed 2026-08-07T10:52:32.520271Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.849634Z digest=sha256:2bd1fd45fad151b855483a9a3ad7a02a571ce90282de40fc0bcf616bd9084e60

Observation d67350bb-f195-4a74-9f4e-c97697b2797b · outbound

This paper cites and Olshevsky, A.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks and Olshevsky, A

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-07T10:52:31.853398Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T10:52:31.853398Z digest=sha256:87035fd6a1cf051e214698458943e7e06c76cf61a2e1096509588d019b55c123

Observation d94f2abb-2796-4eb6-8f33-6c0ed280a144 · outbound

This paper cites Zur theorie der matrices.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Zur theorie der matrices

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-07T10:52:31.856760Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T10:52:31.856760Z digest=sha256:e199febaea235d0a04cf77639f193e86052e4f5c467241afc9f3030578da6061

Observation 87afc534-c97f-458d-83ff-a3dd92f875aa · outbound

This paper cites and Li, N.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks and Li, N

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.509137Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.860569Z digest=sha256:131fc23ecaa2605e6786846b9d688abc8fc6b4bac7ee60cac44c1f1b916bb393

Observation 82423cbe-5537-4bda-b4fc-5570dadd1927 · outbound

This paper cites I., Xin, R., Kar, S., and Khan, U.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks I., Xin, R., Kar, S., and Khan, U

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.498441Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.864182Z digest=sha256:0c1189f48cf6c9286e6c7b164cf8c32a7573c5defd38f4185eea15ff1862ae79

Observation f893e4fc-eaa2-455e-98f8-0b4951cbbd3d · outbound

This paper cites an unresolved cited work.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Unresolved cited work

Reference 32

Resolution
unresolved
raw_fallback, observed 2026-08-07T10:52:32.487111Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.867729Z digest=sha256:f862764cc649a90e91ae869088a2934cb4bcebf14eb4a24597cd3270d219fc82

Observation 4085b012-4f2b-4e7c-a10e-39937712a7ca · outbound

This paper cites T., and Massouli \'e , L.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks T., and Massouli \'e , L

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.475969Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.871391Z digest=sha256:77f77a42ad4a9592a0f38fa985d8531832bd5ed202213a55bf76041ecc38c72d

Observation 4d231bac-c17a-47d9-a647-14ce24e00563 · outbound

This paper cites an unresolved cited work.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Unresolved cited work

Reference 34

Resolution
unresolved
raw_fallback, observed 2026-08-07T10:52:32.465428Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.875137Z digest=sha256:d8cc5efeac47ff37b40dc87a369c06ca84166538160fb77fd42852c11e38b316

Observation 0e2d8862-5c5c-4279-b60b-eea48fb63e3c · outbound

This paper cites and Hong, M.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks and Hong, M

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.454615Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.878563Z digest=sha256:b2f4676837e97687705e415c9f4e66a59f596a5111b38ab42501b8e34aa42ce7

Observation 7a9519ff-d9b0-4375-92b0-d5daa5a483a0 · outbound

This paper cites I., Lawlor, S., and Rabbat, M.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks I., Lawlor, S., and Rabbat, M

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.444165Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.882506Z digest=sha256:4e9256afde5192fe96ce9290e61a20f2959e01569e06cde05693642b35c19379

Observation 7ba51bc9-c1b5-4966-a182-a4ab902c4ed8 · outbound

This paper cites and Khan, U.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks and Khan, U

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.433268Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.885949Z digest=sha256:230e8089b9fa32fb7474f14fb2afcca384daf05f4ef24b895ec4fdeb740e5571

Observation a32be0b0-9308-4139-860f-b68a42086a3b · outbound

This paper cites an unresolved cited work.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Unresolved cited work

Reference 38

Resolution
unresolved
raw_fallback, observed 2026-08-07T10:52:32.422679Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.889195Z digest=sha256:ebf34d535d39fef2a08a4d1572963dbac62b5890c16a9a96449a33a62fb1dd79

Observation 185c2555-59cf-49d9-badb-ff1f5ae6ec10 · outbound

This paper cites an unresolved cited work.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Unresolved cited work

Reference 39

Resolution
unresolved
raw_fallback, observed 2026-08-07T10:52:32.411601Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.893739Z digest=sha256:3ac01189c21dd3810165908656cc47ad9e862bf7f8e9d888d05f41ed8fcd4216

Observation d2e01865-339f-49d7-82a6-6030e1831f51 · outbound

This paper cites K., Khan, U.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks K., Khan, U

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.400053Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.897148Z digest=sha256:13a970a53e5e35d8fddccce5c5971c9ebf1ad222fd6d2f6f24009c7a80625b0f

Observation dc46c4be-9999-49c9-a29d-edacdf0fd986 · outbound

This paper cites Frost—fast row-stochastic optimization with uncoordinated step-sizes.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Frost—fast row-stochastic optimization with uncoordinated step-sizes

Reference 41

Resolution
verified exact
doi, observed 2026-08-07T10:52:31.979893Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.900719Z digest=sha256:3c74fc53b60a4c1448dc3d2a7d47abe3b4cd2b60ccef360b16e422bb9e170dea

Observation 46aecf0d-3b1b-432b-8952-46647b6d4dc1 · outbound

This paper cites An improved convergence analysis for decentralized online stochastic non-convex optimization.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks An improved convergence analysis for decentralized online stochastic non-convex optimization

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-07T10:52:31.904445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T10:52:31.904445Z digest=sha256:2ca699915ca043bb2bc4ad6ecdcdac850bb7130573c8e18747b2bc0b2884a674

Observation 442c0ea6-9f7c-4935-97e7-4f1353d3dad3 · outbound

This paper cites C., and Xie, L.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks C., and Xie, L

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.389759Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.908174Z digest=sha256:a90712669f5fb08853b3529dc5574a771a7abc3741774a3612c7a1019e4eed16

Observation 94907c14-464a-49f3-8ce7-621b8493f7e0 · outbound

This paper cites Achieving linear speedup with partial worker participation in non-iid federated learning.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Achieving linear speedup with partial worker participation in non-iid federated learning

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.378968Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.911806Z digest=sha256:f8ac18327bef3ac7a10c7cf85888ba7fb0a680ea7649f8ba7e07bb3f951ec797

Observation ee6edc2e-b626-4057-89a3-881b8c2e7fcf · outbound

This paper cites an unresolved cited work.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Unresolved cited work

Reference 45

Resolution
unresolved
raw_fallback, observed 2026-08-07T10:52:32.367450Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.915629Z digest=sha256:2caafd54e6ec99dc8cd27ffd7f15ff7a7d2ebd7a70a3cdaf6acaa77b43b9b633

Observation 4e48644f-187c-4c0f-a66a-c0519d8ca434 · outbound

This paper cites Robust Federated Learning with Connectivity Failures: A Semi-Decentralized Framework with Collaborative Relaying.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Robust Federated Learning with Connectivity Failures: A Semi-Decentralized Framework with Collaborative Relaying

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-07T10:52:31.919195Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T10:52:31.919195Z digest=sha256:d27e0b24b12c323628907920f90d30eeb6226f9858c822997ea46fb27d0f552c

Observation c26573b1-12f3-4be9-bec6-f978ff9d5e1a · outbound

This paper cites Exponential graph is provably efficient for decentralized deep training.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Exponential graph is provably efficient for decentralized deep training

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.355782Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.923252Z digest=sha256:0bebe2c86d229d06f55e96f5443b88083a5b6ff6b927cba0de26494d286b7407

Observation bdb4c40f-cbb0-48a0-8284-772b73e31353 · outbound

This paper cites On the linear speedup analysis of communication efficient momentum sgd for distributed non-convex optimization.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks On the linear speedup analysis of communication efficient momentum sgd for distributed non-convex optimization

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.344470Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.927275Z digest=sha256:2d55b256016308942c723fcf1f64c7f84380fa3e5aeb81659fc674c3e29ebcca

Observation 0777803e-2226-47f4-85eb-0f306cf04ffa · outbound

This paper cites Decentlam: Decentralized momentum sgd for large-batch deep training.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Decentlam: Decentralized momentum sgd for large-batch deep training

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.331991Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.930752Z digest=sha256:4108c29975394a9169031daa6dfee360874ca6ee0b047a12084d15dbd9216926

Observation 035390a0-6936-4ad2-b383-8c66ce5ba166 · outbound

This paper cites Revisiting optimal convergence rate for smooth and non-convex stochastic decentralized optimization.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks Revisiting optimal convergence rate for smooth and non-convex stochastic decentralized optimization

Reference 50

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.319646Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.934688Z digest=sha256:c6ed7201f38bb0d38fc687c612fc25cf8d0e5c5510e3677420163f150eaf7de9

Observation 8dad5757-864a-434c-bf72-d72b61de6a75 · outbound

This paper cites and Yin, W.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks and Yin, W

Reference 51

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T10:52:32.308008Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.938053Z digest=sha256:c2876e02da9157730fa2056abaa855885d2b62e350e9bad51b34e068cae97734

Observation 334cf450-f56d-46c0-8cc1-86addf040e91 · outbound

This paper cites write newline.

Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks write newline

Reference 52

Resolution
unresolved
no resolver link, observed 2026-08-07T10:52:31.942910Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T10:52:31.942910Z digest=sha256:0a01c9e4eff42db89db3a0cbe6659c327e033b55c16a7bd2edcc49e680a974fd

Pith citing papers

No inbound Pith citation observations are available.