To address this complication, we augment our decoder to make it multirelational. Instead of only taking a pair of node embeddings as input, we now define the decoder as accepting a pair of node embeddings as well as a relation type. We can then interpret the output of this decoder as the likelihood that the edge exists in the graph.