Before revision:  We show that this combinatorial anchor selection problem is NP-hard and  consequently, develop a greedy (1-1/e) approximation . An extensive experimental evaluation covering six datasets and five state-of-the-art GNN architectures reveal that GraphReach is consistently superior and provides up to 40\% relative improvement in the predictive tasks of link prediction and pairwise node classification .
After revision:  We show that this combinatorial anchor selection problem is NP-hard and consequently, develop a greedy (1-1/e) approximation heuristic. Empirical evaluation against state-of-the-art GNN architectures reveal that GraphReach is consistently superior and provides up to 40\% relative improvement in the predictive tasks of link prediction and pairwise node classification .