In this paper, we study the effect of side information on the recovery of a hidden community of size K inside a graph consisting of n nodes with K=o(n). We focus on side information with finite cardinality and bounded (as ...