We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Current GNN architectures use a vertex neighborhood aggregation scheme, which limits their discriminative power to that of the 1-dimensional Weisfeiler-Lehman (WL) graph isomorphism test. Here, we propose a novel graph convolution operator that is based on the 2-dimensional WL test. We formally show that the resulting 2-WL-GNN architecture is more discriminative than existing GNN approaches. This theoretical result is complemented by experimental studies using synthetic and real data. On multiple common graph classification benchmarks, we demonstrate that the proposed model is competitive with state-of-the-art graph kernels and GNNs.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2007.00346")
get_code_for_paper("2007.00346")
have("2007.00346")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2007.00346.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2007.00346)
Connect an agent — have() is free.