The HITS algorithm (Kleinberg, 1999) assigns two scores to each node: hub score (links to good authorities) and authority score (linked to by good hubs). Iteration: authority[v] = Σ hub[u] for all u→v; hub[u] = Σ authority[v] for all u→v, then normalize. Gold nodes are top authorities; blue nodes are top hubs. The algorithm converges to the principal eigenvectors of AᵀA and AAᵀ respectively, revealing the bipartite link structure of the web.