Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings