We can view embedding multirelational graphs as a reconstruction task. Given the embeddings $z_u$ and $z_v$ of two nodes, our goal is to reconstruct the relationship between these nodes. The complication—compared to the setting of the previous chapter—is that we now have to deal with the presence of multiple different types of edges.