It is empirically observed that contextualized word types can assume very few (most often, one) POS tags.
along with graph smoothness terms, they apply a penalty that encourages distributions to be close to uniform, the premise being that it would maximize the entropy of the distribution for a vertex that is far away or disconnected from a labeled vertex.