This task is implemented in the graph as a query, where we let the query distribution be uniform over the given seeds (and zero elsewhere).
our goal is to find target nodes that are related to the query nodes over the relation r =similar-to, or, coordinate-term.