Reference change · event page

2017 , journal =

Published notice on a work cited in the Pith corpus. Exact quotes below. No model judges whether any citation was load-bearing.

This page records that a citing paper's bibliography includes a work with a published notice. It is not a judgment on the citing paper.

Correction Crossref 6 open · 6 total · 0 disputed

DOI: 10.1016/j.physrep.2017.07.007
Notice DOI: 10.1016/j.physrep.2020.02.005
Event date: 2020-02-28
Machine twin: JSON

01Notices on this DOI

Correction Crossref · 2020-02-28
Correction Crossref · 2018-06-18

02One-hop citing occurrences

Correction Open

Ultrametric Graphons and Hierarchical Community Networks: Spectral Theory and Applications

ref [21] · 2605.13423 · notice #6918 · dispute

Raw extraction · citation context

Understanding the limits of detectability is of both theoretical and practical importance, as it determines the regime in which algorithms can be expected to recover the underlying community structure [8, 9, 17]. Random walks on graphs are of great use in different areas of science. From measuring centrality in networks [18-20] to diffusive and spreading processes [21], they are a fundamental tool for analysis. Their behaviour is deeply influenced by the underlying network structure, in particular, by the presence of community organization at multiple scales. On the other hand, a rigorous graphon-theoretic framework that captures multi-scale hierarchical structure and its spectral consequences for dynamical processes has not been fully developed.

Parser render (TeX stripped for reading; raw above is the evidence)

Understanding the limits of detectability is of both theoretical and practical importance, as it determines the regime in which algorithms can be expected to recover the underlying community structure [8, 9, 17]. Random walks on graphs are of great use in different areas of science. From measuring centrality in networks [18-20] to diffusive and spreading processes [21], they are a fundamental tool for analysis. Their behaviour is deeply influenced by the underlying network structure, in particular, by the presence of community organization at multiple scales. On the other hand, a rigorous graphon-theoretic framework that captures multi-scale hierarchical structure and its spectral consequences for dynamical processes has not been fully developed

Correction Open

Betweenness Central Nodes Under Uncertainty: An Absorbing Markov Chain Approach

ref [65] · 2605.14743 · notice #6919 · dispute

Raw extraction · bibliography line

Masuda, Naoki and Porter, Mason A. and Lambiotte, Renaud , year=. Random walks and diffusion on networks , volume=. doi:https://doi.org/10.1016/j.physrep.2017.07.007 , journal=

Parser render (TeX stripped for reading; raw above is the evidence)

Masuda, Naoki and Porter, Mason A. and Lambiotte, Renaud, year=. Random walks and diffusion on networks, volume=. doi:https://doi.org/10.1016/j.physrep.2017.07.007, journal=

Correction Open

Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation

ref [256] · 2606.22429 · notice #6920 · dispute

Raw extraction · bibliography line

Random Walks and Diffusion on Networks , author =. 2017 , journal =. doi:10.1016/j.physrep.2017.07.007 , urldate =

Parser render (TeX stripped for reading; raw above is the evidence)

Random Walks and Diffusion on Networks, author =. 2017, journal =. doi:10.1016/j.physrep.2017.07.007, urldate =

Correction Open

Ultrametric Graphons and Hierarchical Community Networks: Spectral Theory and Applications

ref [21] · 2605.13423 · notice #5897 · dispute

Raw extraction · citation context

Understanding the limits of detectability is of both theoretical and practical importance, as it determines the regime in which algorithms can be expected to recover the underlying community structure [8, 9, 17]. Random walks on graphs are of great use in different areas of science. From measuring centrality in networks [18-20] to diffusive and spreading processes [21], they are a fundamental tool for analysis. Their behaviour is deeply influenced by the underlying network structure, in particular, by the presence of community organization at multiple scales. On the other hand, a rigorous graphon-theoretic framework that captures multi-scale hierarchical structure and its spectral consequences for dynamical processes has not been fully developed.

Parser render (TeX stripped for reading; raw above is the evidence)

Correction Open

Betweenness Central Nodes Under Uncertainty: An Absorbing Markov Chain Approach

ref [65] · 2605.14743 · notice #5898 · dispute

Raw extraction · bibliography line

Masuda, Naoki and Porter, Mason A. and Lambiotte, Renaud , year=. Random walks and diffusion on networks , volume=. doi:https://doi.org/10.1016/j.physrep.2017.07.007 , journal=

Parser render (TeX stripped for reading; raw above is the evidence)

Masuda, Naoki and Porter, Mason A. and Lambiotte, Renaud, year=. Random walks and diffusion on networks, volume=. doi:https://doi.org/10.1016/j.physrep.2017.07.007, journal=

Correction Open

Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation

ref [256] · 2606.22429 · notice #5899 · dispute

Raw extraction · bibliography line

Random Walks and Diffusion on Networks , author =. 2017 , journal =. doi:10.1016/j.physrep.2017.07.007 , urldate =

Parser render (TeX stripped for reading; raw above is the evidence)

Random Walks and Diffusion on Networks, author =. 2017, journal =. doi:10.1016/j.physrep.2017.07.007, urldate =

Status lifecycle on notices: open → disputed → (response attached on the notice page). Repaired counts matter as much as open counts. There is no “safe,” “invalid,” or “resolved” badge.