The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Accessibility of information on the web
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Growth dynamics of the World-Wide Web
Huberman, B. A., & Adamic, L. A. (1999) · Nature · doi:10.1038/43604 · Cited by 863
Digital libraries and autonomous citation indexing
Lawrence, S., Lee Giles, C., & Bollacker, K. (1999) · Computer · doi:10.1109/2.769447 · Cited by 607
Self-citationThe Dublin Core: A Simple Content Description Model for Electronic Resources
Weibel, S. L. (1997) · Bulletin of the American Society for Information Science and Technology · doi:10.1002/bult.70 · Cited by 152
Research works printed but not linked: 2
- Lawrence, S. & Giles, C. L. Science 280, 98–100 (1998).
- Selberg, E. & Etzioni, O. IEEE Expert 11-14, Jan.-Feb. (1997). · doi:10.1109/64.577468
Cited by
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
“Networks with a very large number of nodes can have a rather small diameter; for example the diameter of the www, with over 800 million nodes [20], is around 19 [3], while social networks with over six billion individuals are believed to have a diameter of around six [21].”
BackgroundDiameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Metadata
- Authors
- Lawrence, S., & Giles, C. L.
- Venue
- Nature
- Published
- 1999-07-08
- Volume
- 400
- Issue
- 6740
- Pages
- 107-107
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W1659541576
- Cited by
- 1,349
- References
- 3
- FWCI
- 370.75
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.