Because of the use of a hard clustering algorithm for node sense induction (Section 2.2), in any pair of nodes {u, v} ∈ E, the node v can appear in the context of only one sense of u and vice versa.
we can omit the context disambiguation step (Section 3.2.2) by tracking the node sense identifiers produced during sense induction.