Paper Citation Record · LEDGER

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy

As of 23 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2607.16676.

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

pith.paper-citation-record.v1
2607.16676 v1

Coverage vector

measured 40 of 40 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T20:23:02.575095Z

measured 40 of 40 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+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

40 of 40 outbound references displayed

verified exact0
verified fuzzy0
unresolved40
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3875235a-1512-4cb3-bc65-5f9a27ed0069 · outbound

This paper cites Community detection and stochastic block models: Recent developments.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Community detection and stochastic block models: Recent developments

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:57.573334Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 558decab-b0c9-46ef-b6de-72dc62b1d3bd · outbound

This paper cites Achieving the KS threshold in the general stochastic block model with linearized acyclic belief propagation.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Achieving the KS threshold in the general stochastic block model with linearized acyclic belief propagation

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:57.684247Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation da6b254a-0a42-4b27-b248-08d2c2ba9842 · outbound

This paper cites Michael Steele.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Michael Steele

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:57.855737Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89ec5b67-ce95-4b91-8673-aaa605345edb · outbound

This paper cites On the bottleneck of graph neural networks and its practical implications.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy On the bottleneck of graph neural networks and its practical implications

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:58.087555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9388bbba-ef48-4188-86e5-d4a1139d2050 · outbound

This paper cites PhD thesis, University of Waterloo, 2024.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy PhD thesis, University of Waterloo, 2024

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:58.237918Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8752b667-e442-413c-b717-ab97956958ea · outbound

This paper cites Graph convolution for semi- supervised classification: Improved linear separability and out-of-distribution generalization.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Graph convolution for semi- supervised classification: Improved linear separability and out-of-distribution generalization

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:58.349148Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ae90477a-f25c-4133-a460-9cecf52bd28f · outbound

This paper cites Effects of graph convolutions in multi-layer networks.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Effects of graph convolutions in multi-layer networks

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:58.442021Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 670899dc-82cd-47fc-a8d2-167a5cb77b6d · outbound

This paper cites Optimality of Message-Passing Architectures for Sparse Graphs.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Optimality of Message-Passing Architectures for Sparse Graphs

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:58.582374Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a032106d-de0f-4ba8-803c-f4a93b0a19eb · outbound

This paper cites Recurrence of distributional limits of finite planar graphs.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Recurrence of distributional limits of finite planar graphs

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:58.674503Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c8ede66f-8d69-4c07-b194-82c1baab4b02 · outbound

This paper cites Nonbacktracking spectrum of random graphs: Community detection and nonregular Ramanujan graphs.The Annals of Probability, 46(1):1–71, 2018.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Nonbacktracking spectrum of random graphs: Community detection and nonregular Ramanujan graphs.The Annals of Probability, 46(1):1–71, 2018

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:58.734740Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6ad23c42-8359-45c7-912d-ba14adc43f65 · outbound

This paper cites Supervised community detection with line graph neural networks.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Supervised community detection with line graph neural networks

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:58.815023Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8f0f111e-238e-4028-877f-7bdc61591652 · outbound

This paper cites Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:58.893543Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4e364f3c-9dea-4f31-8b32-e30a1d3f4bd2 · outbound

This paper cites Contextual stochastic block models.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Contextual stochastic block models

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:59.014368Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cae3677d-2763-4c7b-97ff-23e1bce6dbd6 · outbound

This paper cites Schulman.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Schulman

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:59.102052Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 051581d9-9daa-45c6-9037-42fc8972fd01 · outbound

This paper cites Graph attention retrospective.Journal of Machine Learning Research, 24(246):1–52, 2023.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Graph attention retrospective.Journal of Machine Learning Research, 24(246):1–52, 2023

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:59.202930Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 77653899-ef00-4a72-9a5b-88ce8a5ec06f · outbound

This paper cites Robust reconstruction on trees is determined by the second eigenvalue.The Annals of Probability, 32(3B):2630–2649, 2004.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Robust reconstruction on trees is determined by the second eigenvalue.The Annals of Probability, 32(3B):2630–2649, 2004

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:59.282931Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bee6a2f6-e703-4f1a-91e0-f5498eac4b76 · outbound

This paper cites Global and local information in clustering labeled block models.IEEE Transactions on Information Theory, 62(10):5906– 5917, 2016.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Global and local information in clustering labeled block models.IEEE Transactions on Information Theory, 62(10):5906– 5917, 2016

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:59.292157Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3f39f648-9908-44f1-b732-4dad77cde4bb · outbound

This paper cites Not too little, not too much: A theoretical analysis of graph (over)smoothing.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Not too little, not too much: A theoretical analysis of graph (over)smoothing

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:59.404504Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e0a20d1-f865-4696-a4e0-3b54cc0a0a63 · outbound

This paper cites an unresolved cited work.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Unresolved cited work

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:59.573852Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 71b2febc-37ae-41bf-87a6-72065fe4c936 · outbound

This paper cites Kipf and Max Welling.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Kipf and Max Welling

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:59.688083Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a954df65-f151-415c-b243-a0f5ab591db1 · outbound

This paper cites Spectral redemption in clustering sparse networks.Proceedings of the National Academy of Sciences, 110(52):20935–20940, 2013.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Spectral redemption in clustering sparse networks.Proceedings of the National Academy of Sciences, 110(52):20935–20940, 2013

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:59.805500Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 24e283ea-4e4b-4ca7-83f2-c36e0293fa03 · outbound

This paper cites Deeper insights into graph convolutional networks for semi-supervised learning.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Deeper insights into graph convolutional networks for semi-supervised learning

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T20:22:59.891570Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 03dc7ae3-646a-4944-b12e-347cc45f206d · outbound

This paper cites What graph neural networks cannot learn: Depth vs width.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy What graph neural networks cannot learn: Depth vs width

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:00.013686Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 537d1972-1953-4295-a739-51c3c44d7236 · outbound

This paper cites Contextual stochastic block model: Sharp thresholds and contiguity.Journal of Machine Learning Research, 24(54):1–34, 2023.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Contextual stochastic block model: Sharp thresholds and contiguity.Journal of Machine Learning Research, 24(54):1–34, 2023

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:00.185919Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8325ee49-e13d-4a7c-9e79-afcc532ac26c · outbound

This paper cites Community detection thresholds and the weak Ramanujan property.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Community detection thresholds and the weak Ramanujan property

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:00.308200Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 851846b3-dac4-405c-ae62-44fe51f9d636 · outbound

This paper cites Reconstruction on trees and spin glass transition.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Reconstruction on trees and spin glass transition

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:00.455108Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7d8f33d2-90a9-4cd6-90b9-61b061544669 · outbound

This paper cites Reconstruction on trees: Beating the second eigenvalue.The Annals of Applied Probability, 11(1):285–300, 2001.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Reconstruction on trees: Beating the second eigenvalue.The Annals of Applied Probability, 11(1):285–300, 2001

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:00.622856Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4ef2d08-78dd-4845-9d24-02e22b6e5832 · outbound

This paper cites Information flow on trees.The Annals of Applied Probability, 13(3):817–844, 2003.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Information flow on trees.The Annals of Applied Probability, 13(3):817–844, 2003

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:00.732224Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7d512a8c-c59a-4593-96e0-221bdab5364f · outbound

This paper cites Reconstruction and estimation in the planted partition model.Probability Theory and Related Fields, 162(3-4):431–461, 2015.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Reconstruction and estimation in the planted partition model.Probability Theory and Related Fields, 162(3-4):431–461, 2015

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:00.848522Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6a187ef4-9d16-410f-aba6-0145cb1d6dbc · outbound

This paper cites A proof of the block model threshold conjecture.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy A proof of the block model threshold conjecture

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:00.976779Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d418a0a-84ea-4751-8e18-d9c0f26eba57 · outbound

This paper cites Graph neural networks exponentially lose expressive power for node classification.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Graph neural networks exponentially lose expressive power for node classification

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:01.087860Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c6d14665-de44-4d94-b656-0fc65954cb58 · outbound

This paper cites Petrov.Limit Theorems of Probability Theory: Sequences of Independent Random Variables, volume 4 ofOxford Studies in Probability.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Petrov.Limit Theorems of Probability Theory: Sequences of Independent Random Variables, volume 4 ofOxford Studies in Probability

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:01.179890Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20455be6-4343-46bc-880c-639a99820e74 · outbound

This paper cites Graph attention networks.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Graph attention networks

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:01.326549Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b4a99c5e-763c-4bc1-a462-e7eea1b080ad · outbound

This paper cites Analysis of corrected graph convolutions.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Analysis of corrected graph convolutions

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:01.430093Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 247f3b98-c402-48f5-98ed-322325ff0433 · outbound

This paper cites A non-asymptotic analysis of oversmoothing in graph neural networks.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy A non-asymptotic analysis of oversmoothing in graph neural networks

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:01.586615Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5304e848-e28f-4c96-b89d-8175de8e380c · outbound

This paper cites an unresolved cited work.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Unresolved cited work

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:01.835097Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23c2da27-0e9a-4908-982e-5d6563197575 · outbound

This paper cites an unresolved cited work.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Unresolved cited work

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:02.005476Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2320fd75-f164-413b-9eff-ceee7e289415 · outbound

This paper cites an unresolved cited work.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Unresolved cited work

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:02.220098Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 310672a7-1136-489c-819f-1b08ec25a0b0 · outbound

This paper cites an unresolved cited work.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Unresolved cited work

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:02.428250Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 28c28688-2761-436e-a4b3-cbdcb8ec51f8 · outbound

This paper cites an unresolved cited work.

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy Unresolved cited work

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-01T20:23:02.575095Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.