Truncated personalized PageRank (truncated PPR) is included as a graph-aware comparator in this paper's strict-parity baseline set. Starting from a seed distribution over the dense top-$m$ candidates, personalized PageRank scores are computed on the prerequisite graph and the propagation is truncated (e.g., after a bounded number of power-iteration steps or below a small score threshold) so that the score concentrates near the seeds rather than spreading across the whole graph. Under the strict-parity contract, the baseline shares the same encoder, $m/k$ budgets, split, and exact-ID matching rule as the other compared systems, so it isolates truncated-PPR diffusion as the graph policy. It sits alongside the LightRAG-style baseline as one of the two best-performing comparators on MOOC-CS under the default English MiniLM configuration.