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.
Despite quick progress in the last few years, recent studies have shown that modern graph neural networks can still fail at very simple tasks, like detecting small cycles. This hints at the fact that current networks fail to catch information about the local structure, which is problematic if the downstream task heavily relies on graph substructure analysis, as in the context of chemistry. We propose a very simple correction to the now standard GIN convolution that enables the network to detect small cycles with nearly no cost in terms of computation time and number of parameters. Tested on real life molecule property datasets, our model consistently improves performance on large multi-tasked datasets over all baselines, both globally and on a per-task setting.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2011.15069")
get_code_for_paper("2011.15069")
have("2011.15069")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2011.15069.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2011.15069)
Connect an agent — have() is free.