diff --git a/src/scala/com/twitter/graph/batch/job/tweepcred/README b/src/scala/com/twitter/graph/batch/job/tweepcred/README
index 55ef3b093..98d7b9da9 100644
--- a/src/scala/com/twitter/graph/batch/job/tweepcred/README
+++ b/src/scala/com/twitter/graph/batch/job/tweepcred/README
@@ -12,7 +12,7 @@ The implementation of the PageRank algorithm in Tweepcred is based on the Hadoop
 
 The preparation stage involves constructing the graph of Twitter users and their interactions, and initializing each user's PageRank score to a default value. This stage is implemented in the PreparePageRankData class.
 
-The iteration stage involves repeatedly calculating and updating the PageRank scores of each user until convergence is reached. This stage is implemented in the UpdatePageRank class, which is run multiple times until the algorithm converges.
+The iteration stage involves repeatedly calculating and updating the PageRank scores of each user until convergence is reached. This stage is implemented in the WeightedPageRank class, which is run multiple times until the algorithm converges.
 
 The Tweepcred PageRank implementation also includes a number of optimizations to improve performance and reduce memory usage. These optimizations include block compression, lazy loading, and in-memory caching.