Great article- really liked the clear explanation of how nodes are mapped to a vector space. Curious to learn more about how Jaccard similarities are implemented as well. Does mapping nodes to a vector space allow any optimizations in the locality of the underlying storage? e.g. improving cache hits or reducing reads?