2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/165256We prove that HITS, to "get right" h of the top k ranked nodes of an N>=2k node graph, can require h^(Omega(N h/k)) iterations (i.e. a substantial Omega(N h log(h)/k) matrix multiplications even with a "squaring trick"). Our proof requires no algebraic tools and is entirely self-contained.5 pages, 1 figure. Keywords: algorithm analysis, information retrieval, rank convergenceData Structures and AlgorithmsInformation RetrievalF.2.2; H.3.3text