In order to represent the answer path differently to the surrounding subgraph (so the model can differentiate them), we double the dictionary size for entities, and use one embedding representation if they are in the path and another if they are in the subgraph.
we now learn a parameter matrix R k×N where N = N W + 2N S (N S is the total number of entities and relation types).