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-07T06:34:17.273281+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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.753444Z digest=sha256:7b5f54da044b62cfbda75b4edacffef79f98acbb23d7e0ba9a9096d34f305a0d

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.765675Z digest=sha256:01095c251285badcd0ab6d984e1b3f07afb83275e3718ed9a0c3b35a70c3dcd4

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.773484Z digest=sha256:796095266bc04b2e45bcbaa01c4798243f2f7baa54daaa7412ab70d0b2524c48

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.777409Z digest=sha256:0836055b6d3e63dee5a28bc0bda84fd91b8afee31340d25f3440d3574b6c2028

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.795413Z digest=sha256:70e4265c16de611b5dfa9eeb448d15940c2186444833e626414809200efa540f

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.798645Z digest=sha256:719193f7b3e613ee7760f18d11fc271203c79bdee47465ddface9c60f4dd9120

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.805898Z digest=sha256:50805fe686ec9681b43ddf6d2aa0bf15766519b8583af402ad9fe73344886059

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.817075Z digest=sha256:840b8ef2f437f3382752cb87c1e35a3293ffdd35dc67f73b062d8be5897fa6d6

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.831925Z digest=sha256:525d35910234e15e360aa8e007bc7f98bf7b016e8ff5f21dd740330d961a033e

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.835507Z digest=sha256:870b21194fcec5072b6c86a7f1f8a8000a934e0b0d93d9d90f364aa660d9ba3a

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.839032Z digest=sha256:371d9e90a9ed50c57d43ccddda8a0ffe49bd380bf272a6fb54de52abedea2384

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.849634Z digest=sha256:71939ec09b01e65620d12abc22b5ec8e6da349fd0a952ed894f845d2c60c1f4d

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.871391Z digest=sha256:213103e8a0c449d10235d9ff577a7446741c766a6f26d544b6d1ceaa8d2ddf47

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.882506Z digest=sha256:3833702a617c83d7a5aa5ac2f65492c05167904b799b03d876fcb1180ab5c1eb

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.885949Z digest=sha256:11bf417e3f26c678ce77d2e22e86a1d53dfee90b945eb3f154e75906b8dce41c

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.893739Z digest=sha256:759b1b7b4b33ba89025bcca1604c4c31c62c4b938bc879816b8f05070610bd3b

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.897148Z digest=sha256:6c0020b03b463df3d002e4d91d9983f2c11638d1a35a9990c58ddd86998232ae

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.900719Z digest=sha256:01bc8e3cbb888e951a19b01471d387bbe7cf2d5c6ccb7a4f6243a61490ae08ce

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.923252Z digest=sha256:851cd757c75d7744b9692925d04f5ff313b2a471acc69762e67fb9915582ed12

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.927275Z digest=sha256:1daa0fc37cbce8e49abd04d34b4e84e28644dea95b1f956db19d4dbb99570d74

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T10:52:31.930752Z digest=sha256:1b27b675e37f5a914627e3336fe1fe06752c24ff9aa80e7fde1170ff97bb75e8

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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.