{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/graph-regression","name":"Graph Regression","slug":"graph-regression","description_markdown":"The regression task is similar to graph classification but using different loss function and performance metric.","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":145,"papers_with_code":118,"benchmarks":23,"benchmark_tables_in_archive":23,"benchmark_tables_shown":23,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":21,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-regression-on-peptides-struct","slug":"graph-regression-on-peptides-struct","dataset":"Peptides-struct","dataset_url":"/dataset/pascalvoc-sp","rows_in_archive":39,"metrics":["MAE"],"first_row_in_archive_order":{"model":"ESA + RWSE (Edge set attention, Random Walk Structural Encoding, tuned)","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_url":"/paper/masked-attention-is-all-you-need-for-graphs","paper_date":"2024-02-16","arxiv_id":"2402.10793","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-zinc-500k","slug":"graph-regression-on-zinc-500k","dataset":"ZINC-500k","dataset_url":"/dataset/zinc","rows_in_archive":36,"metrics":["MAE"],"first_row_in_archive_order":{"model":"ESA + rings + NodeRWSE + EdgeRWSE","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_url":"/paper/masked-attention-is-all-you-need-for-graphs","paper_date":"2024-02-16","arxiv_id":"2402.10793","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-zinc","slug":"graph-regression-on-zinc","dataset":"ZINC","dataset_url":"/dataset/zinc","rows_in_archive":27,"metrics":["MAE"],"first_row_in_archive_order":{"model":"ESA + rings + NodeRWSE + EdgeRWSE","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_url":"/paper/masked-attention-is-all-you-need-for-graphs","paper_date":"2024-02-16","arxiv_id":"2402.10793","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-lipophilicity","slug":"graph-regression-on-lipophilicity","dataset":"Lipophilicity","dataset_url":null,"rows_in_archive":23,"metrics":["RMSE","R2","RMSE@80%Train"],"first_row_in_archive_order":{"model":"PNA","paper_title":"Principal Neighbourhood Aggregation for Graph Nets","paper_url":"/paper/principal-neighbourhood-aggregation-for-graph","paper_date":"2020-04-12","arxiv_id":"2004.05718","code_links":[{"title":"rusty1s/pytorch_geometric","url":"https://github.com/rusty1s/pytorch_geometric"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"Saro00/DGN","url":"https://github.com/Saro00/DGN"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/pna_conv.py"},{"title":"cvignac/SMP","url":"https://github.com/cvignac/SMP"},{"title":"asarigun/GraphMixerNetworks","url":"https://github.com/asarigun/GraphMixerNetworks"},{"title":"changminwu/expandergnn","url":"https://github.com/changminwu/expandergnn"}],"syntology":{"n":55,"n_ran":33,"n_constructed":4,"n_ran_checked":11,"n_instrument":22,"n_unverified":22,"n_honours":4,"n_violates":0,"n_no_contract":7,"n_pointer_only":48,"phrase":"33 ran (of which 4 constructed an object rather than computing a result; 11 with no instrument failure: 4 honoured, 0 violated, 7 with no contract checked; 22 where Syntology's instrument failed) · 22 unverified","sample_list":"/paper/principal-neighbourhood-aggregation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2004.05718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05718"}},"official":{"repos":["lukecavabarrett/pna"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"leaderboard":"/sota/graph-regression-on-pcqm4mv2-lsc","slug":"graph-regression-on-pcqm4mv2-lsc","dataset":"PCQM4Mv2-LSC","dataset_url":"/dataset/pcqm4mv2-lsc","rows_in_archive":20,"metrics":["Validation MAE","Test MAE"],"first_row_in_archive_order":{"model":"ESA (Edge set attention, no positional encodings)","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_url":"/paper/masked-attention-is-all-you-need-for-graphs","paper_date":"2024-02-16","arxiv_id":"2402.10793","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-zinc-full","slug":"graph-regression-on-zinc-full","dataset":"ZINC-full","dataset_url":"/dataset/zinc","rows_in_archive":19,"metrics":["Test MAE"],"first_row_in_archive_order":{"model":"ESA + rings + NodeRWSE + EdgeRWSE","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_url":"/paper/masked-attention-is-all-you-need-for-graphs","paper_date":"2024-02-16","arxiv_id":"2402.10793","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-pcqm4m-lsc","slug":"graph-regression-on-pcqm4m-lsc","dataset":"PCQM4M-LSC","dataset_url":"/dataset/ogb-lsc","rows_in_archive":11,"metrics":["Test MAE","Validation MAE"],"first_row_in_archive_order":{"model":"Graphormer","paper_title":"Do Transformers Really Perform Bad for Graph Representation?","paper_url":"/paper/do-transformers-really-perform-bad-for-graph","paper_date":"2021-06-09","arxiv_id":"2106.05234","code_links":[{"title":"microsoft/Graphormer","url":"https://github.com/microsoft/Graphormer"},{"title":"Microsoft/Graphormer","url":"https://github.com/Microsoft/Graphormer"},{"title":"dpstart/graphormer_new","url":"https://github.com/dpstart/graphormer_new"},{"title":"ytchx1999/Graphormer","url":"https://github.com/ytchx1999/Graphormer/tree/main/examples/ogb"},{"title":"yangyucheng000/University","url":"https://github.com/yangyucheng000/University/tree/main/model-2/graphormer"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-esr2","slug":"graph-regression-on-esr2","dataset":"ESR2","dataset_url":"/dataset/dockstring","rows_in_archive":9,"metrics":["R2","RMSE"],"first_row_in_archive_order":{"model":"ESA (Edge set attention, no positional encodings)","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_url":"/paper/masked-attention-is-all-you-need-for-graphs","paper_date":"2024-02-16","arxiv_id":"2402.10793","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-f2","slug":"graph-regression-on-f2","dataset":"F2","dataset_url":"/dataset/dockstring","rows_in_archive":9,"metrics":["R2","RMSE"],"first_row_in_archive_order":{"model":"ESA (Edge set attention, no positional encodings)","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_url":"/paper/masked-attention-is-all-you-need-for-graphs","paper_date":"2024-02-16","arxiv_id":"2402.10793","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-kit","slug":"graph-regression-on-kit","dataset":"KIT","dataset_url":"/dataset/dockstring","rows_in_archive":9,"metrics":["R2","RMSE"],"first_row_in_archive_order":{"model":"PNA","paper_title":"Principal Neighbourhood Aggregation for Graph Nets","paper_url":"/paper/principal-neighbourhood-aggregation-for-graph","paper_date":"2020-04-12","arxiv_id":"2004.05718","code_links":[{"title":"rusty1s/pytorch_geometric","url":"https://github.com/rusty1s/pytorch_geometric"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"Saro00/DGN","url":"https://github.com/Saro00/DGN"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/pna_conv.py"},{"title":"cvignac/SMP","url":"https://github.com/cvignac/SMP"},{"title":"asarigun/GraphMixerNetworks","url":"https://github.com/asarigun/GraphMixerNetworks"},{"title":"changminwu/expandergnn","url":"https://github.com/changminwu/expandergnn"}],"syntology":{"n":55,"n_ran":33,"n_constructed":4,"n_ran_checked":11,"n_instrument":22,"n_unverified":22,"n_honours":4,"n_violates":0,"n_no_contract":7,"n_pointer_only":48,"phrase":"33 ran (of which 4 constructed an object rather than computing a result; 11 with no instrument failure: 4 honoured, 0 violated, 7 with no contract checked; 22 where Syntology's instrument failed) · 22 unverified","sample_list":"/paper/principal-neighbourhood-aggregation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2004.05718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05718"}},"official":{"repos":["lukecavabarrett/pna"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"leaderboard":"/sota/graph-regression-on-parp1","slug":"graph-regression-on-parp1","dataset":"PARP1","dataset_url":"/dataset/dockstring","rows_in_archive":9,"metrics":["R2","RMSE"],"first_row_in_archive_order":{"model":"ESA (Edge set attention, no positional encodings)","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_url":"/paper/masked-attention-is-all-you-need-for-graphs","paper_date":"2024-02-16","arxiv_id":"2402.10793","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-pgr","slug":"graph-regression-on-pgr","dataset":"PGR","dataset_url":"/dataset/pgr","rows_in_archive":9,"metrics":["R2","RMSE"],"first_row_in_archive_order":{"model":"ESA (Edge set attention, no positional encodings)","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_url":"/paper/masked-attention-is-all-you-need-for-graphs","paper_date":"2024-02-16","arxiv_id":"2402.10793","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-zinc-100k","slug":"graph-regression-on-zinc-100k","dataset":"ZINC 100k","dataset_url":"/dataset/zinc","rows_in_archive":8,"metrics":["MAE"],"first_row_in_archive_order":{"model":"CIN-small","paper_title":"Weisfeiler and Lehman Go Cellular: CW Networks","paper_url":"/paper/weisfeiler-and-lehman-go-cellular-cw-networks","paper_date":"2021-06-23","arxiv_id":"2106.12575","code_links":[{"title":"twitter-research/cwn","url":"https://github.com/twitter-research/cwn"},{"title":"josefhoppe/cwn-random-ccs","url":"https://github.com/josefhoppe/cwn-random-ccs"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-tox21","slug":"graph-regression-on-tox21","dataset":"Tox21","dataset_url":"/dataset/tox21-1","rows_in_archive":3,"metrics":["AUC@80%Train"],"first_row_in_archive_order":{"model":"CensNet","paper_title":"CensNet: Convolution with Edge-Node Switching in Graph Neural Networks","paper_url":"/paper/censnet-convolution-with-edge-node-switching","paper_date":"2019-08-10","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-esol","slug":"graph-regression-on-esol","dataset":"ESOL","dataset_url":"/dataset/esol-scaffold","rows_in_archive":1,"metrics":["RMSE"],"first_row_in_archive_order":{"model":"ProtoW-dot","paper_title":"Optimal Transport Graph Neural Networks","paper_url":"/paper/optimal-transport-graph-neural-networks","paper_date":"2020-06-08","arxiv_id":"2006.04804","code_links":[{"title":"benatorc/OTGNN","url":"https://github.com/benatorc/OTGNN"},{"title":"jbr-ai-labs/lipophilicity-prediction","url":"https://github.com/jbr-ai-labs/lipophilicity-prediction"}],"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimal-transport-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.04804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04804"}},"official":{"repos":["benatorc/OTGNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/graph-regression-on-glasstemp","slug":"graph-regression-on-glasstemp","dataset":"GlassTemp","dataset_url":"/dataset/glasstemp","rows_in_archive":1,"metrics":["RMSE "],"first_row_in_archive_order":{"model":"GREA (GIN)","paper_title":"Graph Rationalization with Environment-based Augmentations","paper_url":"/paper/graph-rationalization-with-environment-based","paper_date":"2022-06-06","arxiv_id":"2206.02886","code_links":[{"title":"liugangcode/GREA","url":"https://github.com/liugangcode/GREA"}],"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-rationalization-with-environment-based#ran","syntology_url":"https://syntology.ai/paper/2206.02886","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02886"}},"official":{"repos":["liugangcode/GREA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/graph-regression-on-lipophilicity-1","slug":"graph-regression-on-lipophilicity-1","dataset":"Lipophilicity","dataset_url":null,"rows_in_archive":1,"metrics":["RMSE"],"first_row_in_archive_order":{"model":"GAT","paper_title":"Graph Attention Networks","paper_url":"/paper/graph-attention-networks","paper_date":"2017-10-30","arxiv_id":"1710.10903","code_links":[{"title":"labmlai/annotated_deep_learning_paper_implementations","url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gat"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/gat"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gat"},{"title":"PetarV-/GAT","url":"https://github.com/PetarV-/GAT"},{"title":"Diego999/pyGAT","url":"https://github.com/Diego999/pyGAT"},{"title":"gordicaleksa/pytorch-GAT","url":"https://github.com/gordicaleksa/pytorch-GAT"},{"title":"shenweichen/GraphNeuralNetwork","url":"https://github.com/shenweichen/GraphNeuralNetwork"},{"title":"HazyResearch/hgcn","url":"https://github.com/HazyResearch/hgcn"},{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT"},{"title":"danielegrattarola/keras-gat","url":"https://github.com/danielegrattarola/keras-gat"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"meliketoy/graph-cnn.pytorch","url":"https://github.com/meliketoy/graph-cnn.pytorch"},{"title":"mindspore-ai/models","url":"https://github.com/mindspore-ai/models/tree/master/official/gnn/gat"},{"title":"Kaimaoge/IGNNK","url":"https://github.com/Kaimaoge/IGNNK"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"arangoml/fastgraphml","url":"https://github.com/arangoml/fastgraphml"},{"title":"zhao-tong/GNNs-easy-to-use","url":"https://github.com/zhao-tong/GNNs-easy-to-use"},{"title":"davidpicard/homm","url":"https://github.com/davidpicard/homm"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric"},{"title":"snowkylin/gnn","url":"https://github.com/snowkylin/gnn"},{"title":"akash18tripathi/MAGNET-Multi-Label-Text-Classi-cation-using-Attention-based-Graph-Neural-Network","url":"https://github.com/akash18tripathi/MAGNET-Multi-Label-Text-Classi-cation-using-Attention-based-Graph-Neural-Network"},{"title":"fanzhenliu/dagad","url":"https://github.com/fanzhenliu/dagad"},{"title":"weiyangfb/PyTorchSparseGAT","url":"https://github.com/weiyangfb/PyTorchSparseGAT"},{"title":"HeapHop30/graph-attention-nets","url":"https://github.com/HeapHop30/graph-attention-nets"},{"title":"marblet/GNN_models_pytorch_geometric","url":"https://github.com/marblet/GNN_models_pytorch_geometric"},{"title":"marble0117/GNN_models_pytorch_geometric","url":"https://github.com/marble0117/GNN_models_pytorch_geometric"},{"title":"marble0117/GNN_models_pytorch","url":"https://github.com/marble0117/GNN_models_pytorch"},{"title":"zxhhh97/ABot","url":"https://github.com/zxhhh97/ABot"},{"title":"ds4dm/sGat","url":"https://github.com/ds4dm/sGat"},{"title":"ds4dm/sparse-gcn","url":"https://github.com/ds4dm/sparse-gcn"},{"title":"isotlaboratory/ml4vrp","url":"https://github.com/isotlaboratory/ml4vrp"},{"title":"marblet/gat-pytorch","url":"https://github.com/marblet/gat-pytorch"},{"title":"ydzhang-stormstout/HAT","url":"https://github.com/ydzhang-stormstout/HAT"},{"title":"gcucurull/jax-gat","url":"https://github.com/gcucurull/jax-gat"},{"title":"calciver/Graph-Attention-Networks","url":"https://github.com/calciver/Graph-Attention-Networks"},{"title":"shi27feng/transformers.satisfy","url":"https://github.com/shi27feng/transformers.satisfy"},{"title":"pengsl-lab/mssl","url":"https://github.com/pengsl-lab/mssl"},{"title":"pengsl-lab/mssl2drug","url":"https://github.com/pengsl-lab/mssl2drug"},{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"taishan1994/pytorch_gat","url":"https://github.com/taishan1994/pytorch_gat"},{"title":"wan2000/mc-mot","url":"https://github.com/wan2000/mc-mot"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"dmeoli/neuro-sat","url":"https://github.com/dmeoli/neuro-sat"},{"title":"liu6zijian/simplified-gcn-model","url":"https://github.com/liu6zijian/simplified-gcn-model"},{"title":"tatp22/pytorch-fast-GAT","url":"https://github.com/tatp22/pytorch-fast-GAT"},{"title":"noahtren/Graph-Attention-Networks-TensorFlow-2","url":"https://github.com/noahtren/Graph-Attention-Networks-TensorFlow-2"},{"title":"yururyuru00/GAT_pyG","url":"https://github.com/yururyuru00/GAT_pyG"},{"title":"qema/orca-py","url":"https://github.com/qema/orca-py"},{"title":"zhanglab-aim/cancer-net","url":"https://github.com/zhanglab-aim/cancer-net"},{"title":"gayanku/FDGATII","url":"https://github.com/gayanku/FDGATII"},{"title":"Yindong-Zhang/myGAT","url":"https://github.com/Yindong-Zhang/myGAT"},{"title":"giuseppefutia/link-prediction-code","url":"https://github.com/giuseppefutia/link-prediction-code"},{"title":"Aveek-Saha/Graph-Attention-Net","url":"https://github.com/Aveek-Saha/Graph-Attention-Net"},{"title":"BIG-S2/keras-gnm","url":"https://github.com/BIG-S2/keras-gnm"},{"title":"mlzxzhou/keras-gnm","url":"https://github.com/mlzxzhou/keras-gnm"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"abhilash1910/GraphAttentionNetworks","url":"https://github.com/abhilash1910/GraphAttentionNetworks"},{"title":"Kristof-Neys/GAT_Neo4j_DGL","url":"https://github.com/Kristof-Neys/GAT_Neo4j_DGL"},{"title":"ak24watch/Graph-Deeplearning-GAT","url":"https://github.com/ak24watch/Graph-Deeplearning-GAT"},{"title":"Negus25/GAT-Mindspore","url":"https://github.com/Negus25/GAT-Mindspore"},{"title":"ChengyuSun/gat","url":"https://github.com/ChengyuSun/gat"},{"title":"joaopedromattos/gnee","url":"https://github.com/joaopedromattos/gnee"},{"title":"mitya8128/experiments_notes","url":"https://github.com/mitya8128/experiments_notes"},{"title":"4pygmalion/GAT_tensorflow","url":"https://github.com/4pygmalion/GAT_tensorflow"},{"title":"vailatuts/SSFG-regularization","url":"https://github.com/vailatuts/SSFG-regularization"},{"title":"handasontam/GAT-with-edgewise-attention","url":"https://github.com/handasontam/GAT-with-edgewise-attention"},{"title":"Mind23-2/MindCode-4","url":"https://github.com/Mind23-2/MindCode-4/tree/main/gat"},{"title":"AngusMonroe/GAT-pytorch","url":"https://github.com/AngusMonroe/GAT-pytorch"},{"title":"fongyk/graph-attention","url":"https://github.com/fongyk/graph-attention"},{"title":"404nofound/gat","url":"https://github.com/404nofound/gat"},{"title":"ColdenChan/GAT_D","url":"https://github.com/ColdenChan/GAT_D"},{"title":"MehmetBarutcu/Streaming-Algorithm-for-Monotone-k-Submodular-Maximization-with-Cardinality-Constraints","url":"https://github.com/MehmetBarutcu/Streaming-Algorithm-for-Monotone-k-Submodular-Maximization-with-Cardinality-Constraints"},{"title":"bowu/GraphSearch","url":"https://github.com/bowu/GraphSearch"},{"title":"Messham87/COVID_GAT","url":"https://github.com/Messham87/COVID_GAT"},{"title":"zhangbo2008/GAT_network","url":"https://github.com/zhangbo2008/GAT_network"},{"title":"blueberryc/pyGAT","url":"https://github.com/blueberryc/pyGAT"},{"title":"anish-lu-yihe/SVRT-by-GAT","url":"https://github.com/anish-lu-yihe/SVRT-by-GAT"},{"title":"WantingZhao/my_GAT","url":"https://github.com/WantingZhao/my_GAT"},{"title":"dzb1998/pyGAT","url":"https://github.com/dzb1998/pyGAT"},{"title":"subercui/pyGConvAT","url":"https://github.com/subercui/pyGConvAT"},{"title":"YunseobShin/wiki_GAT","url":"https://github.com/YunseobShin/wiki_GAT"},{"title":"MindSpore-scientific-2/code-4","url":"https://github.com/MindSpore-scientific-2/code-4/tree/main/GR-HSTU"},{"title":"snownus/COOP","url":"https://github.com/snownus/COOP"},{"title":"ChengSashankh/trying-GAT","url":"https://github.com/ChengSashankh/trying-GAT"},{"title":"Anak2016/GAT","url":"https://github.com/Anak2016/GAT"},{"title":"whut2962575697/gat_sementic_segmentation","url":"https://github.com/whut2962575697/gat_sementic_segmentation"},{"title":"Anou9531/GAT","url":"https://github.com/Anou9531/GAT"},{"title":"PumpkinYing/GAT","url":"https://github.com/PumpkinYing/GAT"},{"title":"galkampel/HyperNetworks","url":"https://github.com/galkampel/HyperNetworks"},{"title":"tlmakinen/GAT-noise","url":"https://github.com/tlmakinen/GAT-noise"},{"title":"TyngJiunKuo/deep-learning-project","url":"https://github.com/TyngJiunKuo/deep-learning-project"}],"syntology":{"n":106,"n_ran":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_pointer_only":46,"phrase":"61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}},"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"leaderboard":"/sota/graph-regression-on-qm9","slug":"graph-regression-on-qm9","dataset":"QM9","dataset_url":"/dataset/qm9","rows_in_archive":1,"metrics":["Inference Time (ms)"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-qm9-del-e","slug":"graph-regression-on-qm9-del-e","dataset":"QM9: del e","dataset_url":null,"rows_in_archive":1,"metrics":["MAE"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-qm9-mu","slug":"graph-regression-on-qm9-mu","dataset":"QM9: mu","dataset_url":null,"rows_in_archive":1,"metrics":["MAE"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-qm9-uatom","slug":"graph-regression-on-qm9-uatom","dataset":"QM9: UATOM","dataset_url":null,"rows_in_archive":1,"metrics":["MAE"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-qm9-zpve","slug":"graph-regression-on-qm9-zpve","dataset":"QM9: ZPVE","dataset_url":null,"rows_in_archive":1,"metrics":["MAE"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}},{"leaderboard":"/sota/graph-regression-on-zinc-10k","slug":"graph-regression-on-zinc-10k","dataset":"ZINC 10k","dataset_url":null,"rows_in_archive":1,"metrics":["Inference Time (ms)","MAE"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}}],"datasets":[{"url":"/dataset/zinc","name":"ZINC","full_name":"ZINC","num_papers_in_archive":251},{"url":"/dataset/moleculenet","name":"MoleculeNet","full_name":"","num_papers_in_archive":240},{"url":"/dataset/pascalvoc-sp","name":"Long Range Graph Benchmark (LRGB)","full_name":"","num_papers_in_archive":76},{"url":"/dataset/qm9","name":"QM9","full_name":"","num_papers_in_archive":76},{"url":"/dataset/ogb-lsc","name":"OGB-LSC","full_name":"OGB Large-Scale Challenge","num_papers_in_archive":34},{"url":"/dataset/tox21-1","name":"Tox21","full_name":"","num_papers_in_archive":30},{"url":"/dataset/esol-scaffold","name":"ESOL (Estimated SOLubility)","full_name":"","num_papers_in_archive":25},{"url":"/dataset/md22","name":"MD22","full_name":"MD22","num_papers_in_archive":20},{"url":"/dataset/dockstring","name":"dockstring","full_name":"","num_papers_in_archive":18},{"url":"/dataset/pcqm4mv2-lsc","name":"PCQM4Mv2-LSC","full_name":"","num_papers_in_archive":17},{"url":"/dataset/o2perm","name":"$O_2$Perm","full_name":"Oxygen Permeability","num_papers_in_archive":4},{"url":"/dataset/drivaernet","name":"DrivAerNet","full_name":"A Parametric Car Dataset for Data-driven Aerodynamic Design and Graph-Based Drag Prediction","num_papers_in_archive":4},{"url":"/dataset/glasstemp","name":"GlassTemp","full_name":"Glass Transition Temperature","num_papers_in_archive":3},{"url":"/dataset/meltingtemp","name":"MeltingTemp","full_name":"Melting Temperature","num_papers_in_archive":3},{"url":"/dataset/supplygraph","name":"SupplyGraph","full_name":"SupplyGraph: A Benchmark Dataset for Supply Chain Planning using Graph Neural Networks","num_papers_in_archive":3},{"url":"/dataset/cylinder-in-crossflow","name":"Cylinder in Crossflow","full_name":"","num_papers_in_archive":2},{"url":"/dataset/gvlqa","name":"GVLQA","full_name":"Graph Vision-Language Question-Answering","num_papers_in_archive":2},{"url":"/dataset/polydensity","name":"PolyDensity","full_name":"Polymer Density","num_papers_in_archive":2},{"url":"/dataset/herg","name":"hERG","full_name":"","num_papers_in_archive":1},{"url":"/dataset/ocb","name":"OCB","full_name":"Open Circuit Benchmark","num_papers_in_archive":1},{"url":"/dataset/pem-fuel-cell-dataset","name":"PEM Fuel Cell Dataset","full_name":"Proton Exchange Membrane (PEM) Fuel Cell Dataset","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":145,"of_with_code":118,"tagged_in_all":145,"counts":{"archive_papers_tagged":145,"with_a_code_link":118,"where_syntology_ran_a_sample":64,"not_listed_spam_title":0,"listed":145,"listed_where_code_ran":64,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":56,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":56,"listed_every_run_a_failure_of_syntologys_instrument":8,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_pointer_only":46,"phrase":"61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}},"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/semi-supervised-classification-with-graph","slug":"semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","repositories_listed":55,"syntology":{"n":58,"n_ran":39,"n_constructed":13,"n_ran_checked":34,"n_instrument":5,"n_unverified":19,"n_honours":0,"n_violates":1,"n_no_contract":33,"n_pointer_only":23,"phrase":"39 ran (of which 13 constructed an object rather than computing a result; 34 with no instrument failure: 0 honoured, 1 violated, 33 with no contract checked; 5 where Syntology's instrument failed) · 19 unverified","sample_list":"/paper/semi-supervised-classification-with-graph#ran","syntology_url":"https://syntology.ai/paper/1609.02907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02907"}},"official":{"repos":["tkipf/pygcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/inductive-representation-learning-on-large","slug":"inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","arxiv_id":"1706.02216","repositories_listed":20,"syntology":{"n":5,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/inductive-representation-learning-on-large#ran","syntology_url":"https://syntology.ai/paper/1706.02216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02216"}},"official":{"repos":["williamleif/GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/neural-message-passing-for-quantum-chemistry","slug":"neural-message-passing-for-quantum-chemistry","title":"Neural Message Passing for Quantum Chemistry","date":"2017-04-04","arxiv_id":"1704.01212","repositories_listed":20,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-message-passing-for-quantum-chemistry#ran","syntology_url":"https://syntology.ai/paper/1704.01212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.01212"}},"official":{"repos":["brain-research/mpnn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/how-powerful-are-graph-neural-networks","slug":"how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","arxiv_id":"1810.00826","repositories_listed":19,"syntology":{"n":10,"n_ran":6,"n_constructed":2,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/how-powerful-are-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.00826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.00826"}},"official":{"repos":["weihua916/powerful-gnns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/benchmarking-graph-neural-networks","slug":"benchmarking-graph-neural-networks","title":"Benchmarking Graph Neural Networks","date":"2020-03-02","arxiv_id":"2003.00982","repositories_listed":15,"syntology":{"n":23,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":13,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/benchmarking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2003.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00982"}},"official":{"repos":["graphdeeplearning/benchmarking-gnns","karl-zhao/benchmarking-gnns-pyg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/how-attentive-are-graph-attention-networks","slug":"how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","arxiv_id":"2105.14491","repositories_listed":8,"syntology":{"n":16,"n_ran":11,"n_constructed":1,"n_ran_checked":10,"n_instrument":1,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/how-attentive-are-graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2105.14491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14491"}},"official":{"repos":["tech-srl/how_attentive_are_gats"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/principal-neighbourhood-aggregation-for-graph","slug":"principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","arxiv_id":"2004.05718","repositories_listed":8,"syntology":{"n":55,"n_ran":33,"n_constructed":4,"n_ran_checked":11,"n_instrument":22,"n_unverified":22,"n_honours":4,"n_violates":0,"n_no_contract":7,"n_pointer_only":48,"phrase":"33 ran (of which 4 constructed an object rather than computing a result; 11 with no instrument failure: 4 honoured, 0 violated, 7 with no contract checked; 22 where Syntology's instrument failed) · 22 unverified","sample_list":"/paper/principal-neighbourhood-aggregation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2004.05718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05718"}},"official":{"repos":["lukecavabarrett/pna"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/convolutional-networks-on-graphs-for-learning","slug":"convolutional-networks-on-graphs-for-learning","title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","date":"2015-09-30","arxiv_id":"1509.09292","repositories_listed":8,"syntology":{"n":26,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":1,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/convolutional-networks-on-graphs-for-learning#ran","syntology_url":"https://syntology.ai/paper/1509.09292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1509.09292"}},"official":{"repos":["HIPS/neural-fingerprint"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/simplifying-graph-convolutional-networks","slug":"simplifying-graph-convolutional-networks","title":"Simplifying Graph Convolutional Networks","date":"2019-02-19","arxiv_id":"1902.07153","repositories_listed":7,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simplifying-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/1902.07153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07153"}},"official":{"repos":["Tiiiger/SGC"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","slug":"ogb-lsc-a-large-scale-challenge-for-machine","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","date":"2021-03-17","arxiv_id":"2103.09430","repositories_listed":6,"syntology":null},{"url":"/paper/benchmarking-graphormer-on-large-scale","slug":"benchmarking-graphormer-on-large-scale","title":"Benchmarking Graphormer on Large-Scale Molecular Modeling Datasets","date":"2022-03-09","arxiv_id":"2203.04810","repositories_listed":5,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/benchmarking-graphormer-on-large-scale#ran","syntology_url":"https://syntology.ai/paper/2203.04810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.04810"}},"official":{"repos":["Microsoft/Graphormer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/do-transformers-really-perform-bad-for-graph","slug":"do-transformers-really-perform-bad-for-graph","title":"Do Transformers Really Perform Bad for Graph Representation?","date":"2021-06-09","arxiv_id":"2106.05234","repositories_listed":5,"syntology":null},{"url":"/paper/molecular-fingerprints-are-strong-models-for","slug":"molecular-fingerprints-are-strong-models-for","title":"Molecular Fingerprints Are Strong Models for Peptide Function Prediction","date":"2025-01-29","arxiv_id":"2501.17901","repositories_listed":4,"syntology":null},{"url":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","repositories_listed":4,"syntology":{"n":21,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":18,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 18 unverified","sample_list":"/paper/recipe-for-a-general-powerful-scalable-graph#ran","syntology_url":"https://syntology.ai/paper/2205.12454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12454"}},"official":{"repos":["rampasek/GraphGPS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/simple-and-deep-graph-convolutional-networks-1","slug":"simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","arxiv_id":"2007.02133","repositories_listed":4,"syntology":{"n":7,"n_ran":5,"n_constructed":5,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result","sample_list":"/paper/simple-and-deep-graph-convolutional-networks-1#ran","syntology_url":"https://syntology.ai/paper/2007.02133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02133"}},"official":{"repos":["chennnM/GCNII"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/geometric-deep-learning-on-graphs-and","slug":"geometric-deep-learning-on-graphs-and","title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","date":"2016-11-25","arxiv_id":"1611.08402","repositories_listed":4,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/geometric-deep-learning-on-graphs-and#ran","syntology_url":"https://syntology.ai/paper/1611.08402","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.08402"}},"official":null}},{"url":"/paper/triplet-interaction-improves-graph","slug":"triplet-interaction-improves-graph","title":"Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformers","date":"2024-02-07","arxiv_id":"2402.04538","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":1,"n_ran_checked":2,"n_instrument":8,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/triplet-interaction-improves-graph#ran","syntology_url":"https://syntology.ai/paper/2402.04538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04538"}},"official":{"repos":["shamim-hussain/tgt"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/laplacian-canonization-a-minimalist-approach-1","slug":"laplacian-canonization-a-minimalist-approach-1","title":"Laplacian Canonization: A Minimalist Approach to Sign and Basis Invariant Spectral Embedding","date":"2023-10-28","arxiv_id":"2310.18716","repositories_listed":3,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/laplacian-canonization-a-minimalist-approach-1#ran","syntology_url":"https://syntology.ai/paper/2310.18716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18716"}},"official":{"repos":["GeorgeMLP/basis-invariance-synthetic-experiment","pku-ml/laplaciancanonization","georgemlp/laplacian-canonization"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-generalization-of-vit-mlp-mixer-to-graphs","slug":"a-generalization-of-vit-mlp-mixer-to-graphs","title":"A Generalization of ViT/MLP-Mixer to Graphs","date":"2022-12-27","arxiv_id":"2212.13350","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-generalization-of-vit-mlp-mixer-to-graphs#ran","syntology_url":"https://syntology.ai/paper/2212.13350","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.13350"}},"official":{"repos":["XiaoxinHe/Graph-ViT-MLPMixer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/megan-multi-explanation-graph-attention","slug":"megan-multi-explanation-graph-attention","title":"MEGAN: Multi-Explanation Graph Attention Network","date":"2022-11-23","arxiv_id":"2211.13236","repositories_listed":3,"syntology":null},{"url":"/paper/edge-augmented-graph-transformers-global-self","slug":"edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/edge-augmented-graph-transformers-global-self#ran","syntology_url":"https://syntology.ai/paper/2108.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03348"}},"official":{"repos":["shamim-hussain/egt","shamim-hussain/egt_pytorch","shamim-hussain/egt_triangular"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-generalization-of-transformer-networks-to","slug":"a-generalization-of-transformer-networks-to","title":"A Generalization of Transformer Networks to Graphs","date":"2020-12-17","arxiv_id":"2012.09699","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-generalization-of-transformer-networks-to#ran","syntology_url":"https://syntology.ai/paper/2012.09699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.09699"}},"official":{"repos":["graphdeeplearning/graphtransformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-for-jamming-source","slug":"graph-neural-networks-for-jamming-source","title":"Graph Neural Networks for Jamming Source Localization","date":"2025-06-01","arxiv_id":"2506.03196","repositories_listed":2,"syntology":null},{"url":"/paper/gotennet-rethinking-efficient-3d-equivariant","slug":"gotennet-rethinking-efficient-3d-equivariant","title":"GotenNet: Rethinking Efficient 3D Equivariant Graph Neural Networks","date":"2025-04-24","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/neural-graph-pattern-machine","slug":"neural-graph-pattern-machine","title":"Beyond Message Passing: Neural Graph Pattern Machine","date":"2025-01-30","arxiv_id":"2501.18739","repositories_listed":2,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":4,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 2 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-graph-pattern-machine#ran","syntology_url":"https://syntology.ai/paper/2501.18739","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.18739"}},"official":{"repos":["zehong-wang/gpm"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-canonization-perspective-on-invariant-and","slug":"a-canonization-perspective-on-invariant-and","title":"A Canonicalization Perspective on Invariant and Equivariant Learning","date":"2024-05-28","arxiv_id":"2405.18378","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-canonization-perspective-on-invariant-and#ran","syntology_url":"https://syntology.ai/paper/2405.18378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18378"}},"official":{"repos":["PKU-ML/canonicalization","georgemlp/canonicalization"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/topology-informed-graph-transformer","slug":"topology-informed-graph-transformer","title":"Topology-Informed Graph Transformer","date":"2024-02-03","arxiv_id":"2402.02005","repositories_listed":2,"syntology":{"n":21,"n_ran":17,"n_constructed":0,"n_ran_checked":13,"n_instrument":4,"n_unverified":4,"n_honours":2,"n_violates":5,"n_no_contract":6,"n_pointer_only":21,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 2 honoured, 5 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/topology-informed-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2402.02005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02005"}},"official":{"repos":["leemingo/tigt"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/where-did-the-gap-go-reassessing-the-long","slug":"where-did-the-gap-go-reassessing-the-long","title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","date":"2023-09-01","arxiv_id":"2309.00367","repositories_listed":2,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":4,"n_no_contract":2,"n_pointer_only":6,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 4 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/where-did-the-gap-go-reassessing-the-long#ran","syntology_url":"https://syntology.ai/paper/2309.00367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.00367"}},"official":{"repos":["toenshoff/lrgb"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/graph-inductive-biases-in-transformers","slug":"graph-inductive-biases-in-transformers","title":"Graph Inductive Biases in Transformers without Message Passing","date":"2023-05-27","arxiv_id":"2305.17589","repositories_listed":2,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/graph-inductive-biases-in-transformers#ran","syntology_url":"https://syntology.ai/paper/2305.17589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17589"}},"official":{"repos":["liamma/grit"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-better-graph-representation-learning","slug":"towards-better-graph-representation-learning","title":"Towards Better Graph Representation Learning with Parameterized Decomposition & Filtering","date":"2023-05-10","arxiv_id":"2305.06102","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-better-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2305.06102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06102"}},"official":{"repos":["qslim/pdf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/highly-accurate-quantum-chemical-property","slug":"highly-accurate-quantum-chemical-property","title":"Highly Accurate Quantum Chemical Property Prediction with Uni-Mol+","date":"2023-03-16","arxiv_id":"2303.16982","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/highly-accurate-quantum-chemical-property#ran","syntology_url":"https://syntology.ai/paper/2303.16982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.16982"}},"official":{"repos":["dptech-corp/Uni-Mol"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/multiresolution-graph-transformers-and","slug":"multiresolution-graph-transformers-and","title":"Multiresolution Graph Transformers and Wavelet Positional Encoding for Learning Hierarchical Structures","date":"2023-02-17","arxiv_id":"2302.08647","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multiresolution-graph-transformers-and#ran","syntology_url":"https://syntology.ai/paper/2302.08647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08647"}},"official":{"repos":["hysonlab/multires-graph-transformer","vijaydwivedi75/lrgb"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pure-transformers-are-powerful-graph-learners","slug":"pure-transformers-are-powerful-graph-learners","title":"Pure Transformers are Powerful Graph Learners","date":"2022-07-06","arxiv_id":"2207.02505","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":4,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pure-transformers-are-powerful-graph-learners#ran","syntology_url":"https://syntology.ai/paper/2207.02505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02505"}},"official":{"repos":["jw9730/tokengt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/long-range-graph-benchmark","slug":"long-range-graph-benchmark","title":"Long Range Graph Benchmark","date":"2022-06-16","arxiv_id":"2206.08164","repositories_listed":2,"syntology":null},{"url":"/paper/sign-and-basis-invariant-networks-for","slug":"sign-and-basis-invariant-networks-for","title":"Sign and Basis Invariant Networks for Spectral Graph Representation Learning","date":"2022-02-25","arxiv_id":"2202.13013","repositories_listed":2,"syntology":null},{"url":"/paper/transformers-generalize-deepsets-and-can-be","slug":"transformers-generalize-deepsets-and-can-be","title":"Transformers Generalize DeepSets and Can be Extended to Graphs and Hypergraphs","date":"2021-10-27","arxiv_id":"2110.14416","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/transformers-generalize-deepsets-and-can-be#ran","syntology_url":"https://syntology.ai/paper/2110.14416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14416"}},"official":{"repos":["jw9730/hot"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/weisfeiler-and-lehman-go-cellular-cw-networks","slug":"weisfeiler-and-lehman-go-cellular-cw-networks","title":"Weisfeiler and Lehman Go Cellular: CW Networks","date":"2021-06-23","arxiv_id":"2106.12575","repositories_listed":2,"syntology":null},{"url":"/paper/directional-graph-networks-1","slug":"directional-graph-networks-1","title":"Directional Graph Networks","date":"2020-10-06","arxiv_id":"2010.02863","repositories_listed":2,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":1,"n_honours":3,"n_violates":1,"n_no_contract":7,"n_pointer_only":5,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 1 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/directional-graph-networks-1#ran","syntology_url":"https://syntology.ai/paper/2010.02863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02863"}},"official":{"repos":["Saro00/DGN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/improving-graph-neural-network-expressivity","slug":"improving-graph-neural-network-expressivity","title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","date":"2020-06-16","arxiv_id":"2006.09252","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-graph-neural-network-expressivity#ran","syntology_url":"https://syntology.ai/paper/2006.09252","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09252"}},"official":{"repos":["gbouritsas/graph-substructure-networks"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/optimal-transport-graph-neural-networks","slug":"optimal-transport-graph-neural-networks","title":"Optimal Transport Graph Neural Networks","date":"2020-06-08","arxiv_id":"2006.04804","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimal-transport-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.04804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04804"}},"official":{"repos":["benatorc/OTGNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-physics-informed-neural-network-for-wind","slug":"a-physics-informed-neural-network-for-wind","title":"A physics-informed neural network for wind turbine main bearing fatigue","date":"2020-05-05","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/physics-informed-neural-networks-for-1","slug":"physics-informed-neural-networks-for-1","title":"Physics-informed neural networks for corrosion-fatigue prognosis","date":"2019-09-22","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/molecular-property-prediction-a-multilevel","slug":"molecular-property-prediction-a-multilevel","title":"Molecular Property Prediction: A Multilevel Quantum Interactions Modeling Perspective","date":"2019-06-25","arxiv_id":"1906.11081","repositories_listed":2,"syntology":null},{"url":"/paper/provably-powerful-graph-networks","slug":"provably-powerful-graph-networks","title":"Provably Powerful Graph Networks","date":"2019-05-27","arxiv_id":"1905.11136","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/provably-powerful-graph-networks#ran","syntology_url":"https://syntology.ai/paper/1905.11136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11136"}},"official":null}},{"url":"/paper/molecular-graph-convolutions-moving-beyond","slug":"molecular-graph-convolutions-moving-beyond","title":"Molecular Graph Convolutions: Moving Beyond Fingerprints","date":"2016-03-02","arxiv_id":"1603.00856","repositories_listed":2,"syntology":null},{"url":"/paper/improving-the-effective-receptive-field-of","slug":"improving-the-effective-receptive-field-of","title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","date":"2025-05-29","arxiv_id":"2505.23185","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-the-effective-receptive-field-of#ran","syntology_url":"https://syntology.ai/paper/2505.23185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23185"}},"official":{"repos":["bgu-cs-vil/im-mpnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pre-training-graph-neural-networks-on","slug":"pre-training-graph-neural-networks-on","title":"Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck","date":"2025-02-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unlocking-the-potential-of-classic-gnns-for","slug":"unlocking-the-potential-of-classic-gnns-for","title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","date":"2025-02-13","arxiv_id":"2502.09263","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":5,"n_honours":0,"n_violates":2,"n_no_contract":1,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/unlocking-the-potential-of-classic-gnns-for#ran","syntology_url":"https://syntology.ai/paper/2502.09263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.09263"}},"official":{"repos":["LUOyk1999/GNNPlus"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-efficient-positional-encodings-with","slug":"learning-efficient-positional-encodings-with","title":"Learning Efficient Positional Encodings with Graph Neural Networks","date":"2025-02-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tangnn-a-concise-scalable-and-effective-graph","slug":"tangnn-a-concise-scalable-and-effective-graph","title":"TANGNN: a Concise, Scalable and Effective Graph Neural Networks with Top-m Attention Mechanism for Graph Representation Learning","date":"2024-11-23","arxiv_id":"2411.15458","repositories_listed":1,"syntology":null},{"url":"/paper/from-primes-to-paths-enabling-fast-multi","slug":"from-primes-to-paths-enabling-fast-multi","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","date":"2024-11-17","arxiv_id":"2411.11149","repositories_listed":1,"syntology":null},{"url":"/paper/faster-inference-time-for-gnns-using","slug":"faster-inference-time-for-gnns-using","title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","date":"2024-10-19","arxiv_id":"2410.15001","repositories_listed":1,"syntology":null},{"url":"/paper/gintrip-interpretable-temporal-graph","slug":"gintrip-interpretable-temporal-graph","title":"GINTRIP: Interpretable Temporal Graph Regression using Information bottleneck and Prototype-based method","date":"2024-09-17","arxiv_id":"2409.10996","repositories_listed":1,"syntology":null},{"url":"/paper/hyperaggregation-aggregating-over-graph-edges","slug":"hyperaggregation-aggregating-over-graph-edges","title":"HyperAggregation: Aggregating over Graph Edges with Hypernetworks","date":"2024-07-16","arxiv_id":"2407.11596","repositories_listed":1,"syntology":null},{"url":"/paper/kagnns-kolmogorov-arnold-networks-meet-graph","slug":"kagnns-kolmogorov-arnold-networks-meet-graph","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","date":"2024-06-26","arxiv_id":"2406.18380","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/kagnns-kolmogorov-arnold-networks-meet-graph#ran","syntology_url":"https://syntology.ai/paper/2406.18380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18380"}},"official":{"repos":["RomanBresson/KAGNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/next-level-message-passing-with-hierarchical","slug":"next-level-message-passing-with-hierarchical","title":"Next Level Message-Passing with Hierarchical Support Graphs","date":"2024-06-22","arxiv_id":"2406.15852","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":4,"n_no_contract":1,"n_pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 4 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/next-level-message-passing-with-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2406.15852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15852"}},"official":{"repos":["carlosinator/support-graphs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-comprehensive-graph-pooling-benchmark","slug":"a-comprehensive-graph-pooling-benchmark","title":"A Comprehensive Graph Pooling Benchmark: Effectiveness, Robustness and Generalizability","date":"2024-06-13","arxiv_id":"2406.09031","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":11,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-comprehensive-graph-pooling-benchmark#ran","syntology_url":"https://syntology.ai/paper/2406.09031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09031"}},"official":{"repos":["goose315/graph_pooling_benchmark"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/panda-expanded-width-aware-message-passing","slug":"panda-expanded-width-aware-message-passing","title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","date":"2024-06-06","arxiv_id":"2406.03671","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/panda-expanded-width-aware-message-passing#ran","syntology_url":"https://syntology.ai/paper/2406.03671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03671"}},"official":{"repos":["jeongwhanchoi/panda"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-long-range-dependencies-on-graphs","slug":"learning-long-range-dependencies-on-graphs","title":"Learning Long Range Dependencies on Graphs via Random Walks","date":"2024-06-05","arxiv_id":"2406.03386","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":8,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-long-range-dependencies-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2406.03386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03386"}},"official":{"repos":["borgwardtlab/neuralwalker"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/spatio-spectral-graph-neural-networks","slug":"spatio-spectral-graph-neural-networks","title":"Spatio-Spectral Graph Neural Networks","date":"2024-05-29","arxiv_id":"2405.19121","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/spatio-spectral-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2405.19121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19121"}},"official":{"repos":["sigeisler/s2gnn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-with-configuration","slug":"graph-neural-networks-with-configuration","title":"Graph neural networks with configuration cross-attention for tensor compilers","date":"2024-05-26","arxiv_id":"2405.16623","repositories_listed":1,"syntology":null},{"url":"/paper/ckgconv-general-graph-convolution-with","slug":"ckgconv-general-graph-convolution-with","title":"CKGConv: General Graph Convolution with Continuous Kernels","date":"2024-04-21","arxiv_id":"2404.13604","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/ckgconv-general-graph-convolution-with#ran","syntology_url":"https://syntology.ai/paper/2404.13604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13604"}},"official":{"repos":["networkslab/ckgconv"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/masked-attention-is-all-you-need-for-graphs","slug":"masked-attention-is-all-you-need-for-graphs","title":"An end-to-end attention-based approach for learning on graphs","date":"2024-02-16","arxiv_id":"2402.10793","repositories_listed":1,"syntology":null},{"url":"/paper/gaussian-process-regression-with-sliced","slug":"gaussian-process-regression-with-sliced","title":"Gaussian process regression with Sliced Wasserstein Weisfeiler-Lehman graph kernels","date":"2024-02-06","arxiv_id":"2402.03838","repositories_listed":1,"syntology":null},{"url":"/paper/improving-subgraph-gnns-via-edge-level-ego","slug":"improving-subgraph-gnns-via-edge-level-ego","title":"Improving Subgraph-GNNs via Edge-Level Ego-Network Encodings","date":"2023-12-10","arxiv_id":"2312.05905","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutions-enrich-the-self-attention","slug":"graph-convolutions-enrich-the-self-attention","title":"Graph Convolutions Enrich the Self-Attention in Transformers!","date":"2023-12-07","arxiv_id":"2312.04234","repositories_listed":1,"syntology":{"n":29,"n_ran":22,"n_constructed":0,"n_ran_checked":11,"n_instrument":11,"n_unverified":7,"n_honours":2,"n_violates":5,"n_no_contract":4,"n_pointer_only":10,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 5 violated, 4 with no contract checked; 11 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/graph-convolutions-enrich-the-self-attention#ran","syntology_url":"https://syntology.ai/paper/2312.04234","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.04234"}},"official":{"repos":["jeongwhanchoi/gfsa"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/infinite-width-graph-neural-networks-for-node","slug":"infinite-width-graph-neural-networks-for-node","title":"Infinite Width Graph Neural Networks for Node Regression/ Classification","date":"2023-10-12","arxiv_id":"2310.08176","repositories_listed":1,"syntology":null},{"url":"/paper/graph-level-representation-learning-with","slug":"graph-level-representation-learning-with","title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","date":"2023-09-27","arxiv_id":"2309.16014","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-level-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/2309.16014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16014"}},"official":{"repos":["geriskenderi/graph-jepa"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/transformers-for-capturing-multi-level-graph","slug":"transformers-for-capturing-multi-level-graph","title":"Enhancing Graph Transformers with Hierarchical Distance Structural Encoding","date":"2023-08-22","arxiv_id":"2308.11129","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/transformers-for-capturing-multi-level-graph#ran","syntology_url":"https://syntology.ai/paper/2308.11129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11129"}},"official":{"repos":["luoyk1999/hdse"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/modeling-edge-features-with-deep-bayesian","slug":"modeling-edge-features-with-deep-bayesian","title":"Modeling Edge Features with Deep Bayesian Graph Networks","date":"2023-08-17","arxiv_id":"2308.09087","repositories_listed":1,"syntology":null},{"url":"/paper/desco-towards-generalizable-and-scalable-deep","slug":"desco-towards-generalizable-and-scalable-deep","title":"DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting","date":"2023-08-16","arxiv_id":"2308.08198","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/desco-towards-generalizable-and-scalable-deep#ran","syntology_url":"https://syntology.ai/paper/2308.08198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08198"}},"official":{"repos":["fuvty/DeSCo"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-temporal-edge-regression-a-case-study","slug":"towards-temporal-edge-regression-a-case-study","title":"Towards Temporal Edge Regression: A Case Study on Agriculture Trade Between Nations","date":"2023-08-15","arxiv_id":"2308.07883","repositories_listed":1,"syntology":null},{"url":"/paper/regexplainer-generating-explanations-for","slug":"regexplainer-generating-explanations-for","title":"RegExplainer: Generating Explanations for Graph Neural Networks in Regression Tasks","date":"2023-07-15","arxiv_id":"2307.07840","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/regexplainer-generating-explanations-for#ran","syntology_url":"https://syntology.ai/paper/2307.07840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.07840"}},"official":{"repos":["jz48/regexplainer"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/substructure-aware-graph-neural-networks","slug":"substructure-aware-graph-neural-networks","title":"Substructure Aware Graph Neural Networks","date":"2023-06-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/path-neural-networks-expressive-and-accurate","slug":"path-neural-networks-expressive-and-accurate","title":"Path Neural Networks: Expressive and Accurate Graph Neural Networks","date":"2023-06-09","arxiv_id":"2306.05955","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/path-neural-networks-expressive-and-accurate#ran","syntology_url":"https://syntology.ai/paper/2306.05955","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.05955"}},"official":{"repos":["gasmichel/pathnns_expressive"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cin-enhancing-topological-message-passing","slug":"cin-enhancing-topological-message-passing","title":"CIN++: Enhancing Topological Message Passing","date":"2023-06-06","arxiv_id":"2306.03561","repositories_listed":1,"syntology":null},{"url":"/paper/extending-the-design-space-of-graph-neural-1","slug":"extending-the-design-space-of-graph-neural-1","title":"Extending the Design Space of Graph Neural Networks by Rethinking Folklore Weisfeiler-Lehman","date":"2023-06-05","arxiv_id":"2306.03266","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/extending-the-design-space-of-graph-neural-1#ran","syntology_url":"https://syntology.ai/paper/2306.03266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03266"}},"official":{"repos":["jiaruifeng/n2gnn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-probabilistic-symmetrization-for-1","slug":"learning-probabilistic-symmetrization-for-1","title":"Learning Probabilistic Symmetrization for Architecture Agnostic Equivariance","date":"2023-06-05","arxiv_id":"2306.02866","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-probabilistic-symmetrization-for-1#ran","syntology_url":"https://syntology.ai/paper/2306.02866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02866"}},"official":{"repos":["jw9730/lps"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/the-information-pathways-hypothesis","slug":"the-information-pathways-hypothesis","title":"The Information Pathways Hypothesis: Transformers are Dynamic Self-Ensembles","date":"2023-06-02","arxiv_id":"2306.01705","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-graph-imbalanced-regression","slug":"semi-supervised-graph-imbalanced-regression","title":"Semi-Supervised Graph Imbalanced Regression","date":"2023-05-20","arxiv_id":"2305.12087","repositories_listed":1,"syntology":null},{"url":"/paper/graph-propagation-transformer-for-graph","slug":"graph-propagation-transformer-for-graph","title":"Graph Propagation Transformer for Graph Representation Learning","date":"2023-05-19","arxiv_id":"2305.11424","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/graph-propagation-transformer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2305.11424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11424"}},"official":{"repos":["czczup/gptrans"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/drew-dynamically-rewired-message-passing-with","slug":"drew-dynamically-rewired-message-passing-with","title":"DRew: Dynamically Rewired Message Passing with Delay","date":"2023-05-13","arxiv_id":"2305.08018","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/drew-dynamically-rewired-message-passing-with#ran","syntology_url":"https://syntology.ai/paper/2305.08018","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.08018"}},"official":{"repos":["bengutteridge/drew"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/o-gnn-incorporating-ring-priors-into","slug":"o-gnn-incorporating-ring-priors-into","title":"O-GNN: Incorporating Ring Priors into Molecular Modeling","date":"2023-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/self-attention-in-colors-another-take-on","slug":"self-attention-in-colors-another-take-on","title":"Self-Attention in Colors: Another Take on Encoding Graph Structure in Transformers","date":"2023-04-21","arxiv_id":"2304.10933","repositories_listed":1,"syntology":null},{"url":"/paper/exphormer-sparse-transformers-for-graphs","slug":"exphormer-sparse-transformers-for-graphs","title":"Exphormer: Sparse Transformers for Graphs","date":"2023-03-10","arxiv_id":"2303.06147","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exphormer-sparse-transformers-for-graphs#ran","syntology_url":"https://syntology.ai/paper/2303.06147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.06147"}},"official":{"repos":["hamed1375/exphormer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-connection-between-mpnn-and-graph","slug":"on-the-connection-between-mpnn-and-graph","title":"On the Connection Between MPNN and Graph Transformer","date":"2023-01-27","arxiv_id":"2301.11956","repositories_listed":1,"syntology":null},{"url":"/paper/multi-mask-aggregators-for-graph-neural","slug":"multi-mask-aggregators-for-graph-neural","title":"Multi-Mask Aggregators for Graph Neural Networks","date":"2022-11-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/progrest-prototypical-graph-regression-soft","slug":"progrest-prototypical-graph-regression-soft","title":"ProGReST: Prototypical Graph Regression Soft Trees for Molecular Property Prediction","date":"2022-10-07","arxiv_id":"2210.03745","repositories_listed":1,"syntology":null},{"url":"/paper/one-transformer-can-understand-both-2d-3d","slug":"one-transformer-can-understand-both-2d-3d","title":"One Transformer Can Understand Both 2D & 3D Molecular Data","date":"2022-10-04","arxiv_id":"2210.01765","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/one-transformer-can-understand-both-2d-3d#ran","syntology_url":"https://syntology.ai/paper/2210.01765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.01765"}},"official":{"repos":["lsj2408/Transformer-M"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/second-order-global-attention-networks-for","slug":"second-order-global-attention-networks-for","title":"Second-Order Global Attention Networks for Graph Classification and Regression","date":"2022-08-27","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gem-2-next-generation-molecular-property","slug":"gem-2-next-generation-molecular-property","title":"GEM-2: Next Generation Molecular Property Prediction Network by Modeling Full-range Many-body Interactions","date":"2022-08-11","arxiv_id":"2208.05863","repositories_listed":1,"syntology":null},{"url":"/paper/graph-trees-with-attention","slug":"graph-trees-with-attention","title":"TREE-G: Decision Trees Contesting Graph Neural Networks","date":"2022-07-06","arxiv_id":"2207.02760","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-trees-with-attention#ran","syntology_url":"https://syntology.ai/paper/2207.02760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02760"}},"official":{"repos":["mayabechlerspeicher/tree-g"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-rationalization-with-environment-based","slug":"graph-rationalization-with-environment-based","title":"Graph Rationalization with Environment-based Augmentations","date":"2022-06-06","arxiv_id":"2206.02886","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-rationalization-with-environment-based#ran","syntology_url":"https://syntology.ai/paper/2206.02886","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02886"}},"official":{"repos":["liugangcode/GREA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/automatic-relation-aware-graph-network","slug":"automatic-relation-aware-graph-network","title":"Automatic Relation-aware Graph Network Proliferation","date":"2022-05-31","arxiv_id":"2205.15678","repositories_listed":1,"syntology":null},{"url":"/paper/graph-self-attention-for-learning-graph","slug":"graph-self-attention-for-learning-graph","title":"GRPE: Relative Positional Encoding for Graph Transformer","date":"2022-01-30","arxiv_id":"2201.12787","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-self-attention-for-learning-graph#ran","syntology_url":"https://syntology.ai/paper/2201.12787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12787"}},"official":{"repos":["lenscloth/grpe"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-spectral-graph-convolution-for","slug":"improving-spectral-graph-convolution-for","title":"A New Perspective on the Effects of Spectrum in Graph Neural Networks","date":"2021-12-14","arxiv_id":"2112.07160","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-spectral-graph-convolution-for#ran","syntology_url":"https://syntology.ai/paper/2112.07160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.07160"}},"official":{"repos":["qslim/gnn-spectrum"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dropgnn-random-dropouts-increase-the","slug":"dropgnn-random-dropouts-increase-the","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","date":"2021-11-11","arxiv_id":"2111.06283","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dropgnn-random-dropouts-increase-the#ran","syntology_url":"https://syntology.ai/paper/2111.06283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06283"}},"official":{"repos":["karolismart/dropgnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-with-learnable-1","slug":"graph-neural-networks-with-learnable-1","title":"Graph Neural Networks with Learnable Structural and Positional Representations","date":"2021-10-15","arxiv_id":"2110.07875","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-neural-networks-with-learnable-1#ran","syntology_url":"https://syntology.ai/paper/2110.07875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.07875"}},"official":{"repos":["vijaydwivedi75/gnn-lspe"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sogcn-second-order-graph-convolutional-1","slug":"sogcn-second-order-graph-convolutional-1","title":"SoGCN: Second-Order Graph Convolutional Networks","date":"2021-10-14","arxiv_id":"2110.07141","repositories_listed":1,"syntology":null}],"syntology_records":60,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":5,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/graph-regression-on-peptides-struct","since_archive":"/sota/graph-regression-on-peptides-struct#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/graph-regression-on-lipophilicity","since_archive":"/sota/graph-regression-on-lipophilicity#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":64,"papers_where_code_ran_first_page":"/task/graph-regression/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/task/graph-regression/papers/2","json":"/task/graph-regression/papers/2.json","rows":45},{"order":"ran","page":1,"of":1,"url":"/task/graph-regression/papers/ran/1","json":"/task/graph-regression/papers/ran/1.json","rows":64}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"4c5a255206164c1f99d09a6a9a29e5a8630f1bd2821d3ec55ab3db94bfe447f2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}