The anatomy of a large-scale hypertextual web search engine.¶
Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems, 30(1–7), 1-7.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
Domain-specific¶
- Matrix
- Brin and Page (1998) computed it at web scale by the power method — repeatedly multiplying an estimate by \(G\) until it converges to that eigenvector — reporting that a PageRank over 26 million pages could be computed in a few hours on a medium-size workstation
This sourceThe paper stating that PageRank 'corresponds to the principal eigenvector of the normalized link matrix of the web' and is obtained by 'a simple iterative algorithm' run on the damped recursion, and reporting that 'a PageRank for 26 million web pages can be computed in a few hours on a medium size workstation'.
SupportedVerified against the source
- Brin and Page (1998) computed it at web scale by the power method — repeatedly multiplying an estimate by \(G\) until it converges to that eigenvector — reporting that a PageRank over 26 million pages could be computed in a few hours on a medium-size workstation
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Read against the text for 1 of 2 citations: 1 supported. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:c36823df00f0 · see in the full table