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
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
Mean-field theory for scale-free random networks
Barabási, A.-L., Albert, R., & Jeong, H. (1999) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,255
Crystal, D. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9781139164771 · Cited by 2,233
Hierarchical organization in complex networks
Ravasz, E., & Barabási, A.-L. (2003) · Physical Review E · doi:10.1103/physreve.67.026112 · Cited by 2,160
Evolution of the social network of scientific collaborations
Barabási, A. L., Jeong, H., Néda, Z., Ravasz, E., Schubert, A., & Vicsek, T. (2002) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)00736-7 · Cited by 1,972
Eysenbach, G., Powell, J., Kuss, O., & Sa, E.-R. (2002) · JAMA · doi:10.1001/jama.287.20.2691 · Cited by 1,871
Kosala, R., & Blockeel, H. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/360402.360406 · Cited by 1,438
Scale-free characteristics of random networks: the topology of the world-wide web
Barabási, A.-L., Albert, R., & Jeong, H. (2000) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(00)00018-2 · Cited by 1,408
Searching the web: The public and their queries
Spink, A., Wolfram, D., Jansen, M. B. J., & Saracevic, T. (2001) · Journal of the American Society for Information Science and Technology · doi:10.1002/1097-4571(2000)9999:9999<::aid-asi1591>3.0.co;2-r · Cited by 1,084
Predicting clicks: estimating the click-through rate for new ads
Richardson, M., Dominowska, E., & Ragno, R. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242643 · Cited by 1,049
Introduction to the Special Issue on the Web as Corpus
Kilgarriff, A., & Grefenstette, G. (2003) · Computational Linguistics · doi:10.1162/089120103322711569 · Cited by 929
The emergent properties of a dolphin social network
Lusseau, D. (2003) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rsbl.2003.0057 · Cited by 844
Citation Advantage of Open Access Articles
Eysenbach, G. (2006) · PLoS Biology · doi:10.1371/journal.pbio.0040157 · Cited by 814
How are we searching the World Wide Web? A comparison of nine search engine transaction logs
Jansen, B. J., & Spink, A. (2006) · Information Processing & Management · doi:10.1016/j.ipm.2004.10.007 · Cited by 801
Bose-Einstein Condensation in Complex Networks
Bianconi, G., & Barabási, A.-L. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5632 · Cited by 808
Efficient identification of Web communities
Flake, G. W., Lawrence, S., & Giles, C. L. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347121 · Cited by 804
Self-citationAnalyzing and modeling real-world phenomena with complex networks: a survey of applications
Costa, L. D. F., Oliveira, O. N., Travieso, G., Rodrigues, F. A., Villas Boas, P. R., Antiqueira, L., Viana, M. P., & Correa Rocha, L. E. (2011) · Advances in Physics · doi:10.1080/00018732.2011.572452 · Cited by 800
Converging Technologies for Improving Human Performance
(2003) · Springer eBooks · doi:10.1007/978-94-017-0359-8 · Cited by 794
Scale-Free Networks: Complex Webs in Nature and Technology
Caldarelli, G. (2007) · doi:10.1093/acprof:oso/9780199211517.001.0001 · Cited by 748
Gusenbauer, M. (2019) · Scientometrics · doi:10.1007/s11192-018-2958-5 · Cited by 687
Modeling the Internet's large-scale topology
Yook, S.-H., Jeong, H., & Barabási, A.-L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.172501399 · Cited by 665
Crystal, D. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511487002 · Cited by 614
Small-world properties of the Indian railway network
Sen, P., Dasgupta, S., Chatterjee, A., Sreeram, P. A., Mukherjee, G., & Manna, S. S. (2003) · Physical Review E · doi:10.1103/physreve.67.036106 · Cited by 592
The impact of the internet on cancer outcomes.
Eysenbach, G. (2003) · CA: A Cancer Journal for Clinicians · doi:10.3322/canjclin.53.6.356 · Cited by 573
Information retrieval on the web
Kobayashi, M., & Takeda, K. (2000) · ACM Computing Surveys · doi:10.1145/358923.358934 · Cited by 562
Thelwall, M. (2008) · Journal of Information Science · doi:10.1177/0165551507087238 · Cited by 518
Arasu, A., Cho, J., Garcia-Molina, H., Paepcke, A., & Raghavan, S. (2001) · ACM Transactions on Internet Technology · doi:10.1145/383034.383035 · Cited by 505
On the scale and performance of cooperative Web proxy caching
Wolman, A., Voelker, M., Sharma, N., Cardwell, N., Karlin, A., & Levy, H. M. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319153 · Cited by 496
A review of Web searching studies and a framework for future research
Jansen, B. J., & Pooch, U. (2001) · Journal of the American Society for Information Science and Technology · doi:10.1002/1097-4571(2000)9999:9999<::aid-asi1607>3.0.co;2-f · Cited by 492
Capurro, R., & Hjørland, B. (2003) · Annual Review of Information Science and Technology · doi:10.1002/aris.1440370109 · Cited by 463
Winners don't take all: Characterizing the competition for links on the web
Pennock, D. M., Flake, G. W., Lawrence, S., Glover, E. J., & Giles, C. L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.032085699 · Cited by 455
Self-citationUsing Language Models for Information Retrieval
Hiemstra, D. (2001) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.570441 · Cited by 448
The indexable web is more than 11.5 billion pages
Gulli, A., & Signorini, A. (2005) · Special interest tracks and posters of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1062745.1062789 · Cited by 412
Exploring chemical compound space with quantum-based machine learning
von Lilienfeld, O. A., Müller, K.-R., & Tkatchenko, A. (2020) · Nature Reviews Chemistry · doi:10.1038/s41570-020-0189-9 · Cited by 369
Toward a theory of network gatekeeping: A framework for exploring information control
Barzilai‐Nahon, K. (2008) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20857 · Cited by 350
Synchronizing a database to improve freshness
Cho, J., & Garcia-Molina, H. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335391 · Cited by 346
Curvature of co-links uncovers hidden thematic layers in the World Wide Web
Eckmann, J.-P., & Moses, E. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.032093399 · Cited by 346
Building efficient and effective metasearch engines
Meng, W., Yu, C., & Liu, K.-L. (2002) · ACM Computing Surveys · doi:10.1145/505282.505284 · Cited by 325
Content Analysis of the World Wide Web: Opportunities and Challenges
Weare, C., & Lin, W.-Y. (2000) · Social Science Computer Review · doi:10.1177/089443930001800304 · Cited by 306
What are the affordances of information and communication technologies?
Conole, G., & Dyke, M. (2004) · Research in Learning Technology · doi:10.3402/rlt.v12i2.11246 · Cited by 306
News cues: Information scent and cognitive heuristics
Sundar, S. S., Knobloch‐Westerwick, S., & Hastall, M. R. (2007) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20511 · Cited by 302
(1999) · Cited by 293
Brewington, B. E., & Cybenko, G. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00045-1 · Cited by 292
Data mining for hypertext: a tutorial survey
Chakrabarti, S. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/846183.846187 · Cited by 291
The Readability of Pediatric Patient Education Materials on the World Wide Web
D'Alessandro, D. M., Kingsley, P., & Johnson-West, J. (2001) · Archives of Pediatrics & Adolescent Medicine · doi:10.1001/archpedi.155.7.807 · Cited by 287
Language as an evolving word web
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.2001.1824 · Cited by 280
Feng, J., Bhargava, H. K., & Pennock, D. M. (2007) · INFORMS Journal on Computing · doi:10.1287/ijoc.1050.0135 · Cited by 278
An interactive clustering-based approach to integrating source query interfaces on the deep Web
Wu, W., Yu, C., Doan, A., & Meng, W. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007582 · Cited by 273
Internet searching and stock price crash risk: Evidence from a quasi-natural experiment
Xu, Y., Xuan, Y., & Zheng, G. (2021) · Journal of Financial Economics · doi:10.1016/j.jfineco.2021.03.003 · Cited by 269
Henzinger, M. R., Heydon, A., Mitzenmacher, M., & Najork, M. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00055-4 · Cited by 269
Topical web crawlers: Evaluating adaptive algorithms
Menczer, F., Pant, G., & Srinivasan, P. (2004) · ACM Transactions on Internet Technology · doi:10.1145/1031114.1031117 · Cited by 268
Davison, B. D. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345597 · Cited by 264
Search engine coverage bias: evidence and possible causes
Vaughan, L., & Thelwall, M. (2004) · Information Processing & Management · doi:10.1016/s0306-4573(03)00063-3 · Cited by 259
Effective page refresh policies for Web crawlers
Cho, J., & Garcia-Molina, H. (2003) · ACM Transactions on Database Systems · doi:10.1145/958942.958945 · Cited by 258
Open Access and Global Participation in Science
Evans, J. A., & Reimer, J. (2009) · Science · doi:10.1126/science.1154562 · Cited by 258
The Number of Scholarly Documents on the Public Web
Khabsa, M., & Giles, C. L. (2014) · PLoS ONE · doi:10.1371/journal.pone.0093949 · Cited by 227
Self-citationIntrona, L. D. (2007) · Ethics and Information Technology · doi:10.1007/s10676-006-9133-z · Cited by 133
Users choose to engage with more partisan news than they are exposed to on Google Search
Robertson, R. E., Green, J., Ruck, D. J., Ognyanova, K., Wilson, C., & Lazer, D. (2023) · Nature · doi:10.1038/s41586-023-06078-5 · Cited by 126
URL decay in MEDLINE—a 4-year follow-up study
Wren, J. D. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn127 · Cited by 85
Algorithmic Challenges in Web Search Engines
Henzinger, M. R. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129079 · Cited by 81
Estimating search engine index size variability: a 9-year longitudinal study
van den Bosch, A., Bogers, T., & de Kunder, M. (2016) · Scientometrics · doi:10.1007/s11192-016-1863-z · Cited by 77
Mowshowitz, A., & Kawaguchi, A. (2005) · Information Processing & Management · doi:10.1016/j.ipm.2004.05.005 · Cited by 68
The making of accessible Android applications: an empirical study on the state of the practice
Di Gregorio, M., Di Nucci, D., Palomba, F., & Vitiello, G. (2022) · Empirical Software Engineering · doi:10.1007/s10664-022-10182-x · Cited by 25
Internet Marketing adoption: factors affecting website sophistication
Tiago, M. T. B., Couto, J. P. A., Tiago, F. B., & Vieira, J. A. C. (2007) · International Journal of Electronic Customer Relationship Management · doi:10.1504/ijecrm.2007.017798 · Cited by 10
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.