Paper Citation Record · LEDGER

Low-Congestion Shortcut and Graph Parameters

As of 16 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:1908.09473.

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

pith.paper-citation-record.v1
1908.09473 v1

Coverage vector

measured 33 of 33 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T11:25:33.438881Z

measured 33 of 33 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+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

33 of 33 outbound references displayed

verified exact13
verified fuzzy4
unresolved12
parse uncertain0
malformed identifier3
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 10f876d0-ba36-434c-92d5-b530bca9bd98 · outbound

This paper cites an unresolved cited work.

Low-Congestion Shortcut and Graph Parameters Unresolved cited work

Reference 1

Resolution: verified exact; doi, observed 2026-08-14T11:25:33.640238Z

Source-reported events for the cited work

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

Observation ae149e88-71a4-481b-a33d-d0db697b6e70 · outbound

This paper cites Networkdecomposition and locality in distributed computation.

Low-Congestion Shortcut and Graph Parameters Networkdecomposition and locality in distributed computation

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-14T11:25:33.294140Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 70b30ed8-0fed-443c-889b-6244198add98 · outbound

This paper cites Corneil and Udi Rotics.

Low-Congestion Shortcut and Graph Parameters Corneil and Udi Rotics

Reference 3

Resolution: verified exact; doi, observed 2026-08-14T11:25:33.628905Z

Source-reported events for the cited work

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

Observation 3f8cce42-6b9c-4b82-9e55-10303df1d277 · outbound

This paper cites Upper bounds to the clique width of graphs.Discrete Applied Mathematics, pages 77–114, 2000.doi:10.1016/S0166-218X(99)00184-5.

Low-Congestion Shortcut and Graph Parameters Upper bounds to the clique width of graphs.Discrete Applied Mathematics, pages 77–114, 2000.doi:10.1016/S0166-218X(99)00184-5

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-14T11:25:33.304320Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7bce360e-6288-44a9-a70a-2805c046dddd · outbound

This paper cites Distributed approximation: a survey.

Low-Congestion Shortcut and Graph Parameters Distributed approximation: a survey

Reference 5

Resolution: metadata mismatch; raw_fallback, observed 2026-08-14T11:25:34.230931Z

Source-reported events for the cited work

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

Observation 792cd544-112f-4921-b848-c7ef7498e974 · outbound

This paper cites An unconditional lower bound on the time-approximation trade-oﬀ for the distributed minimumspanningtreeproblem.

Low-Congestion Shortcut and Graph Parameters An unconditional lower bound on the time-approximation trade-oﬀ for the distributed minimumspanningtreeproblem

Reference 6

Resolution: malformed identifier; raw_fallback, observed 2026-08-14T11:25:34.379639Z

Source-reported events for the cited work

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

Observation 9d947403-7237-4967-80b8-bbdcefbed0ee · outbound

This paper cites Gallager, Pierre A.

Low-Congestion Shortcut and Graph Parameters Gallager, Pierre A

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-14T11:25:33.318912Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 387d12ee-cc71-457b-865c-dbf85787a0a4 · outbound

This paper cites Garay, Shay Kutten, and David Peleg.

Low-Congestion Shortcut and Graph Parameters Garay, Shay Kutten, and David Peleg

Reference 8

Resolution: malformed identifier; raw_fallback, observed 2026-08-14T11:25:34.365070Z

Source-reported events for the cited work

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

Observation 9b1b4983-d98e-4166-bbbc-500a8b770517 · outbound

This paper cites The intersection graphs of subtrees in trees are exactly the chordal graphs.Journal of Combinatorial Theory, Series B, pages 47–56, 1974.doi:10.1016/0095-8956(74)90094-X.

Low-Congestion Shortcut and Graph Parameters The intersection graphs of subtrees in trees are exactly the chordal graphs.Journal of Combinatorial Theory, Series B, pages 47–56, 1974.doi:10.1016/0095-8956(74)90094-X

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-14T11:25:33.327987Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b16c3e9-96f5-4644-86de-cdebce191708 · outbound

This paper cites Near-optimal scheduling of distributed algorithms.

Low-Congestion Shortcut and Graph Parameters Near-optimal scheduling of distributed algorithms

Reference 10

Resolution: malformed identifier; no resolver link, observed 2026-08-14T11:25:33.332162Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2c4c95c7-210a-4a6a-afa6-73246e4269db · outbound

This paper cites DistributedalgorithmsforplanarnetworksII:low-congestion shortcuts, mst, and min-cut.

Low-Congestion Shortcut and Graph Parameters DistributedalgorithmsforplanarnetworksII:low-congestion shortcuts, mst, and min-cut

Reference 11

Resolution: verified exact; doi, observed 2026-08-14T11:25:33.602837Z

Source-reported events for the cited work

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

Observation f1c09c25-ee67-4df1-a77c-e37088acf362 · outbound

This paper cites Distributed MST and broadcast with fewer messages, and faster gossiping.

Low-Congestion Shortcut and Graph Parameters Distributed MST and broadcast with fewer messages, and faster gossiping

Reference 12

Resolution: verified exact; doi, observed 2026-08-14T11:25:33.590560Z

Source-reported events for the cited work

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

Observation c213c383-9062-4b7d-a737-24efaf0f8ce9 · outbound

This paper cites DistributedMSTandroutinginalmostmixingtime.

Low-Congestion Shortcut and Graph Parameters DistributedMSTandroutinginalmostmixingtime

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:25:34.349506Z

Source-reported events for the cited work

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

Observation 2a7982e4-4a2a-419f-8eea-2587f49c400a · outbound

This paper cites New distributed algorithms in almost mixing time via transformations from parallel algorithms.

Low-Congestion Shortcut and Graph Parameters New distributed algorithms in almost mixing time via transformations from parallel algorithms

Reference 14

Resolution: verified exact; doi, observed 2026-08-14T11:25:33.578702Z

Source-reported events for the cited work

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

Observation 78463dbb-6839-4535-b003-134c247ef8b6 · outbound

This paper cites Time-messagetrade-oﬀsindistributedalgorithms.

Low-Congestion Shortcut and Graph Parameters Time-messagetrade-oﬀsindistributedalgorithms

Reference 15

Resolution: verified exact; doi, observed 2026-08-14T11:25:33.565270Z

Source-reported events for the cited work

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

Observation 7af9051d-6329-40ec-8141-6463bab13ab1 · outbound

This paper cites Low-congestion shortcuts without embedding.

Low-Congestion Shortcut and Graph Parameters Low-congestion shortcuts without embedding

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-14T11:25:33.366828Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d47aa4f9-5414-4863-9888-74f2ead68587 · outbound

This paper cites an unresolved cited work.

Low-Congestion Shortcut and Graph Parameters Unresolved cited work

Reference 18

Resolution: verified exact; doi, observed 2026-08-14T11:25:33.551717Z

Source-reported events for the cited work

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

Observation ba573342-ae29-4517-b337-1f9e6627e628 · outbound

This paper cites Faster distributed shortest path approximations via shortcuts.

Low-Congestion Shortcut and Graph Parameters Faster distributed shortest path approximations via shortcuts

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:25:34.336877Z

Source-reported events for the cited work

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

Observation 0ff60a0d-27ce-4ed8-9bc7-d70deabafe4c · outbound

This paper cites Minorexcludednetworkfamiliesadmitfastdistributed algorithms.

Low-Congestion Shortcut and Graph Parameters Minorexcludednetworkfamiliesadmitfastdistributed algorithms

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-14T11:25:33.387463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cbe871cc-4fec-46c3-bdb4-d9e49f771876 · outbound

This paper cites MSTin O(1)roundsofcongestedclique.

Low-Congestion Shortcut and Graph Parameters MSTin O(1)roundsofcongestedclique

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:25:34.323343Z

Source-reported events for the cited work

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

Observation f4b26f64-74b6-44b0-ac86-d78485b98a34 · outbound

This paper cites Fastdistributedconstructionofsmall k-dominatingsetsandapplications.

Low-Congestion Shortcut and Graph Parameters Fastdistributedconstructionofsmall k-dominatingsetsandapplications

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-14T11:25:33.402490Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d16ec17-5189-4c3c-a503-c3dfaf32f53f · outbound

This paper cites Distributed Treewidth Computation and Courcelle's Theorem in the CONGEST Model.

Low-Congestion Shortcut and Graph Parameters Distributed Treewidth Computation and Courcelle's Theorem in the CONGEST Model

Reference 23

Resolution: verified exact; local_arxiv, observed 2026-08-14T11:25:33.803054Z

Source-reported events for the cited work

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

Observation 5fea6dd1-e62f-449b-a811-d1e6aecc44bf · outbound

This paper cites an unresolved cited work.

Low-Congestion Shortcut and Graph Parameters Unresolved cited work

Reference 24

Resolution: verified exact; doi, observed 2026-08-14T11:25:33.524166Z

Source-reported events for the cited work

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

Observation 0f96f627-46a9-4d0c-8d8f-29843796b66d · outbound

This paper cites Filling logarithmic gaps in distributed complexity for global problems.

Low-Congestion Shortcut and Graph Parameters Filling logarithmic gaps in distributed complexity for global problems

Reference 25

Resolution: verified exact; doi, observed 2026-08-14T11:25:33.496806Z

Source-reported events for the cited work

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

Observation 163ce8a4-30f4-41f1-b229-a77f20a98aaa · outbound

This paper cites Intersection Graphs: An Introduction.

Low-Congestion Shortcut and Graph Parameters Intersection Graphs: An Introduction

Reference 26

Resolution: verified exact; local_arxiv, observed 2026-08-14T11:25:33.784843Z

Source-reported events for the cited work

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

Observation 8830879f-30d4-4454-9b56-d39813623da4 · outbound

This paper cites Distributed MST for constant diameter graphs.

Low-Congestion Shortcut and Graph Parameters Distributed MST for constant diameter graphs

Reference 27

Resolution: verified exact; doi, observed 2026-08-14T11:25:33.510757Z

Source-reported events for the cited work

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

Observation 17043dc5-1f8c-4fec-a823-f5cccaad8669 · outbound

This paper cites The distributed minimum spanning tree problem.Bulletin of the European Association for Theoretical Computer Science (EATCS), 2018.

Low-Congestion Shortcut and Graph Parameters The distributed minimum spanning tree problem.Bulletin of the European Association for Theoretical Computer Science (EATCS), 2018

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:25:34.310276Z

Source-reported events for the cited work

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

Observation a4d67999-0efe-4fa5-9a90-5bed05a582c0 · outbound

This paper cites A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction.SIAM Journal on Computing, pages 1427–1442, 2000.

Low-Congestion Shortcut and Graph Parameters A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction.SIAM Journal on Computing, pages 1427–1442, 2000

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-14T11:25:33.431173Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c9908ff4-1ad3-4efc-9885-34aa87124457 · outbound

This paper cites Atime-andmessage-optimaldistributed algorithm for minimum spanning trees.

Low-Congestion Shortcut and Graph Parameters Atime-andmessage-optimaldistributed algorithm for minimum spanning trees

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-14T11:25:33.423659Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b74b08af-8ef6-4466-a276-c49db5e65987 · outbound

This paper cites Newhashfunctionsandtheiruseinauthenticationandsetequality.

Low-Congestion Shortcut and Graph Parameters Newhashfunctionsandtheiruseinauthenticationandsetequality

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-14T11:25:33.438881Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4c30ef31-743a-4c67-bf82-40a8bc0b3921 · outbound

This paper cites In Proceedings of the 43th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 363–372, 2011.doi:10.1145/1993636.1993686.

Low-Congestion Shortcut and Graph Parameters In Proceedings of the 43th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 363–372, 2011.doi:10.1145/1993636.1993686

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-14T11:25:33.435237Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e791d084-0ef3-4ea0-8d72-081bbbb82c31 · outbound

This paper cites an unresolved cited work.

Low-Congestion Shortcut and Graph Parameters Unresolved cited work

Reference 2017

Resolution: unresolved; no resolver link, observed 2026-08-14T11:25:33.349676Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53448055-efaf-48ac-9bf0-d26857a82d6a · outbound

This paper cites an unresolved cited work.

Low-Congestion Shortcut and Graph Parameters Unresolved cited work

Reference 2018

Resolution: verified exact; doi, observed 2026-08-14T11:25:33.539279Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.