{"url":"/task/graph-classification","name":"Graph Classification","slug":"graph-classification","description_markdown":"**Graph Classification** is a task that involves classifying a graph-structured data into different classes or categories. Graphs are a powerful way to represent relationships and interactions between different entities, and graph classification can be applied to a wide range of applications, such as social network analysis, bioinformatics, and recommendation systems. In graph classification, the input is a graph, and the goal is to learn a classifier that can accurately predict the class of the graph.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Hierarchical Graph Pooling with Structure Learning](https://github.com/cszhangzhen/HGP-SL) )</span>","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":927,"papers_with_code":483,"benchmarks":73,"benchmark_tables_in_archive":73,"benchmark_tables_shown":73,"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":54,"subtasks":3,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/graph-classification-on-proteins","slug":"graph-classification-on-proteins","dataset":"PROTEINS","dataset_url":"/dataset/proteins","rows_in_archive":103,"metrics":["Accuracy","Accuracy (10 fold)","Inference Time (ms)"],"first_row_in_archive_order":{"model":"HGP-SL","paper_title":"Hierarchical Graph Pooling with Structure Learning","paper_url":"/paper/hierarchical-graph-pooling-with-structure","paper_date":"2019-11-14","arxiv_id":"1911.05954","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hgp_sl"},{"title":"cszhangzhen/HGP-SL","url":"https://github.com/cszhangzhen/HGP-SL"},{"title":"gsl-benchmark/gslb","url":"https://github.com/gsl-benchmark/gslb"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-mutag","slug":"graph-classification-on-mutag","dataset":"MUTAG","dataset_url":"/dataset/mutag","rows_in_archive":74,"metrics":["Accuracy","Accuracy (10-fold)","Mean Accuracy","Accuracy (10 fold)"],"first_row_in_archive_order":{"model":"Evolution of Graph Classifiers","paper_title":"Evolution of Graph Classifiers","paper_url":"/paper/evolution-of-graph-classifiers","paper_date":"2019-10-04","arxiv_id":null,"code_links":[{"title":"rohand24/GraphCNN_evolution","url":"https://github.com/rohand24/GraphCNN_evolution"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-nci1","slug":"graph-classification-on-nci1","dataset":"NCI1","dataset_url":"/dataset/nci1","rows_in_archive":69,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"TFGW ADJ (L=2)","paper_title":"Template based Graph Neural Network with Optimal Transport Distances","paper_url":"/paper/template-based-graph-neural-network-with","paper_date":"2022-05-31","arxiv_id":"2205.15733","code_links":[{"title":"cedricvincentcuaz/TFGW","url":"https://github.com/cedricvincentcuaz/TFGW"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-enzymes","slug":"graph-classification-on-enzymes","dataset":"ENZYMES","dataset_url":"/dataset/enzymes","rows_in_archive":54,"metrics":["Accuracy","Accuracy (10-fold)"],"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-classification-on-dd","slug":"graph-classification-on-dd","dataset":"D&D","dataset_url":null,"rows_in_archive":53,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_url":"/paper/unsupervised-universal-self-attention-network","paper_date":"2019-09-26","arxiv_id":"1909.11855","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-imdb-b","slug":"graph-classification-on-imdb-b","dataset":"IMDb-B","dataset_url":"/dataset/imdb-binary","rows_in_archive":51,"metrics":["Accuracy","Accuracy (10-fold)","Rand index"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_url":"/paper/unsupervised-universal-self-attention-network","paper_date":"2019-09-26","arxiv_id":"1909.11855","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-peptides-func","slug":"graph-classification-on-peptides-func","dataset":"Peptides-func","dataset_url":"/dataset/pascalvoc-sp","rows_in_archive":44,"metrics":["AP"],"first_row_in_archive_order":{"model":"ESA + RWSE (Edge set attention, Random Walk Structural Encoding, + validation set)","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-classification-on-collab","slug":"graph-classification-on-collab","dataset":"COLLAB","dataset_url":"/dataset/collab","rows_in_archive":39,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_url":"/paper/unsupervised-universal-self-attention-network","paper_date":"2019-09-26","arxiv_id":"1909.11855","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-nci109","slug":"graph-classification-on-nci109","dataset":"NCI109","dataset_url":"/dataset/nci109","rows_in_archive":38,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"WKPI-kcenters","paper_title":"Learning metrics for persistence-based summaries and applications for graph classification","paper_url":"/paper/learning-metrics-for-persistence-based-2","paper_date":"2019-04-27","arxiv_id":"1904.12189","code_links":[{"title":"topology474/WKPI","url":"https://github.com/topology474/WKPI"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-ptc","slug":"graph-classification-on-ptc","dataset":"PTC","dataset_url":"/dataset/ptc","rows_in_archive":37,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_url":"/paper/unsupervised-universal-self-attention-network","paper_date":"2019-09-26","arxiv_id":"1909.11855","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-imdb-m","slug":"graph-classification-on-imdb-m","dataset":"IMDb-M","dataset_url":"/dataset/imdb-multi","rows_in_archive":36,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_url":"/paper/unsupervised-universal-self-attention-network","paper_date":"2019-09-26","arxiv_id":"1909.11855","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-cifar10-100k","slug":"graph-classification-on-cifar10-100k","dataset":"CIFAR10 100k","dataset_url":"/dataset/cifar-10","rows_in_archive":20,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"NeuralWalker","paper_title":"Learning Long Range Dependencies on Graphs via Random Walks","paper_url":"/paper/learning-long-range-dependencies-on-graphs","paper_date":"2024-06-05","arxiv_id":"2406.03386","code_links":[{"title":"borgwardtlab/neuralwalker","url":"https://github.com/borgwardtlab/neuralwalker"}],"syntology":{"n":13,"n_ran":13,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-mnist","slug":"graph-classification-on-mnist","dataset":"MNIST","dataset_url":"/dataset/mnist","rows_in_archive":13,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"ESA (Edge set attention, no positional encodings, 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-classification-on-reddit-b","slug":"graph-classification-on-reddit-b","dataset":"REDDIT-B","dataset_url":"/dataset/reddit","rows_in_archive":12,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"CRaWl","paper_title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","paper_url":"/paper/graph-learning-with-1d-convolutions-on-random","paper_date":"2021-02-17","arxiv_id":"2102.08786","code_links":[{"title":"toenshoff/CRaWl","url":"https://github.com/toenshoff/CRaWl"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-reddit-binary","slug":"graph-classification-on-reddit-binary","dataset":"REDDIT-BINARY","dataset_url":"/dataset/reddit-binary","rows_in_archive":9,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"R-GIN + PANDA","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","paper_url":"/paper/panda-expanded-width-aware-message-passing","paper_date":"2024-06-06","arxiv_id":"2406.03671","code_links":[{"title":"jeongwhanchoi/panda","url":"https://github.com/jeongwhanchoi/panda"}],"syntology":{"n":9,"n_ran":7,"n_unverified":2,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-imdb-binary","slug":"graph-classification-on-imdb-binary","dataset":"IMDB-BINARY","dataset_url":"/dataset/imdb-binary","rows_in_archive":8,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"Local Topological Profile (LTP)","paper_title":"Strengthening structural baselines for graph classification using Local Topological Profile","paper_url":"/paper/strengthening-structural-baselines-for-graph","paper_date":"2023-05-01","arxiv_id":"2305.00724","code_links":[{"title":"j-adamczyk/ltp","url":"https://github.com/j-adamczyk/ltp"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-re-m5k","slug":"graph-classification-on-re-m5k","dataset":"RE-M5K","dataset_url":null,"rows_in_archive":8,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GIN-0","paper_title":"How Powerful are Graph Neural Networks?","paper_url":"/paper/how-powerful-are-graph-neural-networks","paper_date":"2018-10-01","arxiv_id":"1810.00826","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gin"},{"title":"weihua916/powerful-gnns","url":"https://github.com/weihua916/powerful-gnns"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"calciver/Graph-Isomorphism-Networks","url":"https://github.com/calciver/Graph-Isomorphism-Networks"},{"title":"yuwvandy/g2gnn","url":"https://github.com/yuwvandy/g2gnn"},{"title":"PurdueMINDS/RelationalPooling","url":"https://github.com/PurdueMINDS/RelationalPooling"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/gin_conv.py"},{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"},{"title":"egyptdj/graph-neural-mapping","url":"https://github.com/egyptdj/graph-neural-mapping"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"pfnet-research/treewidth-prediction","url":"https://github.com/pfnet-research/treewidth-prediction"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"zhliping/Deep-Learning","url":"https://github.com/zhliping/Deep-Learning"},{"title":"k4my4r/ECG-Classification","url":"https://github.com/k4my4r/ECG-Classification"},{"title":"igorsterner/commute-opt-gnn","url":"https://github.com/igorsterner/commute-opt-gnn"},{"title":"mfmceneaney/Lambda-GNNs","url":"https://github.com/mfmceneaney/Lambda-GNNs"},{"title":"willy-b/tiny-GIN-for-ogbg-molhiv","url":"https://github.com/willy-b/tiny-GIN-for-ogbg-molhiv"}],"syntology":{"n":10,"n_ran":3,"n_unverified":7,"n_pointer_only":5}}},{"leaderboard":"/sota/graph-classification-on-upfd-gos","slug":"graph-classification-on-upfd-gos","dataset":"UPFD-GOS","dataset_url":"/dataset/upfd-gos","rows_in_archive":8,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"UPFD-SAGE","paper_title":"User Preference-aware Fake News Detection","paper_url":"/paper/user-preference-aware-fake-news-detection","paper_date":"2021-04-25","arxiv_id":"2104.12259","code_links":[{"title":"safe-graph/GNN-FakeNews","url":"https://github.com/safe-graph/GNN-FakeNews"},{"title":"code-implementation1/Code9","url":"https://github.com/code-implementation1/Code9/tree/main/gat"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-upfd-pol","slug":"graph-classification-on-upfd-pol","dataset":"UPFD-POL","dataset_url":"/dataset/upfd-pol","rows_in_archive":8,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"HGFND","paper_title":"Nothing Stands Alone: Relational Fake News Detection with Hypergraph Neural Networks","paper_url":"/paper/nothing-stands-alone-relational-fake-news-2","paper_date":"2022-12-24","arxiv_id":"2212.12621","code_links":[{"title":"ujeong1/IEEEBigdata22_HGFND","url":"https://github.com/ujeong1/IEEEBigdata22_HGFND"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-bp-fmri-97","slug":"graph-classification-on-bp-fmri-97","dataset":"BP-fMRI-97","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy","F1"],"first_row_in_archive_order":{"model":"IsoNN","paper_title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","paper_url":"/paper/isonn-isomorphic-neural-network-for-graph","paper_date":"2019-07-22","arxiv_id":"1907.09495","code_links":[{"title":"linmengsysu/IsoNN","url":"https://github.com/linmengsysu/IsoNN"},{"title":"jwzhanggy/isocapsnet","url":"https://github.com/jwzhanggy/isocapsnet"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-hiv-fmri-77","slug":"graph-classification-on-hiv-fmri-77","dataset":"HIV-fMRI-77","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy","F1"],"first_row_in_archive_order":{"model":"IsoNN","paper_title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","paper_url":"/paper/isonn-isomorphic-neural-network-for-graph","paper_date":"2019-07-22","arxiv_id":"1907.09495","code_links":[{"title":"linmengsysu/IsoNN","url":"https://github.com/linmengsysu/IsoNN"},{"title":"jwzhanggy/isocapsnet","url":"https://github.com/jwzhanggy/isocapsnet"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-frankenstein","slug":"graph-classification-on-frankenstein","dataset":"FRANKENSTEIN","dataset_url":null,"rows_in_archive":6,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GWL_WL","paper_title":"Graph Invariant Kernels","paper_url":"/paper/graph-invariant-kernels","paper_date":"2015-07-25","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-hiv-dti-77","slug":"graph-classification-on-hiv-dti-77","dataset":"HIV-DTI-77","dataset_url":null,"rows_in_archive":6,"metrics":["Accuracy","F1"],"first_row_in_archive_order":{"model":"IsoNN","paper_title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","paper_url":"/paper/isonn-isomorphic-neural-network-for-graph","paper_date":"2019-07-22","arxiv_id":"1907.09495","code_links":[{"title":"linmengsysu/IsoNN","url":"https://github.com/linmengsysu/IsoNN"},{"title":"jwzhanggy/isocapsnet","url":"https://github.com/jwzhanggy/isocapsnet"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-re-m12k","slug":"graph-classification-on-re-m12k","dataset":"RE-M12K","dataset_url":null,"rows_in_archive":6,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GFN-light","paper_title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","paper_url":"/paper/dissecting-graph-neural-networks-on-graph","paper_date":"2019-05-11","arxiv_id":"1905.04579","code_links":[{"title":"chentingpc/gfn","url":"https://github.com/chentingpc/gfn"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-hiv-dataset","slug":"graph-classification-on-hiv-dataset","dataset":"HIV dataset","dataset_url":"/dataset/qm9-charge-densities-and-energies-calculated","rows_in_archive":5,"metrics":["ROC-AUC","Accuracy"],"first_row_in_archive_order":{"model":"CIN++","paper_title":"CIN++: Enhancing Topological Message Passing","paper_url":"/paper/cin-enhancing-topological-message-passing","paper_date":"2023-06-06","arxiv_id":"2306.03561","code_links":[{"title":"twitter-research/cwn","url":"https://github.com/twitter-research/cwn"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-mutagenicity","slug":"graph-classification-on-mutagenicity","dataset":"Mutagenicity","dataset_url":"/dataset/mutagenicity","rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"TREE-G","paper_title":"TREE-G: Decision Trees Contesting Graph Neural Networks","paper_url":"/paper/graph-trees-with-attention","paper_date":"2022-07-06","arxiv_id":"2207.02760","code_links":[{"title":"mayabechlerspeicher/tree-g","url":"https://github.com/mayabechlerspeicher/tree-g"}],"syntology":{"n":10,"n_ran":0,"n_unverified":10,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-neuron-average","slug":"graph-classification-on-neuron-average","dataset":"NEURON-Average","dataset_url":null,"rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"WKPI-kcenters","paper_title":"Learning metrics for persistence-based summaries and applications for graph classification","paper_url":"/paper/learning-metrics-for-persistence-based-2","paper_date":"2019-04-27","arxiv_id":"1904.12189","code_links":[{"title":"topology474/WKPI","url":"https://github.com/topology474/WKPI"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-neuron-binary","slug":"graph-classification-on-neuron-binary","dataset":"NEURON-BINARY","dataset_url":null,"rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"WKPI-kmeans","paper_title":"Learning metrics for persistence-based summaries and applications for graph classification","paper_url":"/paper/learning-metrics-for-persistence-based-2","paper_date":"2019-04-27","arxiv_id":"1904.12189","code_links":[{"title":"topology474/WKPI","url":"https://github.com/topology474/WKPI"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-neuron-multi","slug":"graph-classification-on-neuron-multi","dataset":"NEURON-MULTI","dataset_url":null,"rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"WKPI-kcenters","paper_title":"Learning metrics for persistence-based summaries and applications for graph classification","paper_url":"/paper/learning-metrics-for-persistence-based-2","paper_date":"2019-04-27","arxiv_id":"1904.12189","code_links":[{"title":"topology474/WKPI","url":"https://github.com/topology474/WKPI"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-malnet-tiny","slug":"graph-classification-on-malnet-tiny","dataset":"MalNet-Tiny","dataset_url":"/dataset/malnet","rows_in_archive":4,"metrics":["Accuracy","MCC"],"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-classification-on-bbbp","slug":"graph-classification-on-bbbp","dataset":"BBBP","dataset_url":"/dataset/bbbp-scaffold","rows_in_archive":3,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"G-Tuning","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","paper_url":"/paper/fine-tuning-graph-neural-networks-by","paper_date":"2023-12-21","arxiv_id":"2312.13583","code_links":[{"title":"zjunet/G-Tuning","url":"https://github.com/zjunet/G-Tuning"}],"syntology":{"n":13,"n_ran":13,"n_unverified":0,"n_pointer_only":13}}},{"leaderboard":"/sota/graph-classification-on-cox2","slug":"graph-classification-on-cox2","dataset":"COX2","dataset_url":null,"rows_in_archive":3,"metrics":["Accuracy(10-fold)"],"first_row_in_archive_order":{"model":"GIN-0","paper_title":"How Powerful are Graph Neural Networks?","paper_url":"/paper/how-powerful-are-graph-neural-networks","paper_date":"2018-10-01","arxiv_id":"1810.00826","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gin"},{"title":"weihua916/powerful-gnns","url":"https://github.com/weihua916/powerful-gnns"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"calciver/Graph-Isomorphism-Networks","url":"https://github.com/calciver/Graph-Isomorphism-Networks"},{"title":"yuwvandy/g2gnn","url":"https://github.com/yuwvandy/g2gnn"},{"title":"PurdueMINDS/RelationalPooling","url":"https://github.com/PurdueMINDS/RelationalPooling"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/gin_conv.py"},{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"},{"title":"egyptdj/graph-neural-mapping","url":"https://github.com/egyptdj/graph-neural-mapping"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"pfnet-research/treewidth-prediction","url":"https://github.com/pfnet-research/treewidth-prediction"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"zhliping/Deep-Learning","url":"https://github.com/zhliping/Deep-Learning"},{"title":"k4my4r/ECG-Classification","url":"https://github.com/k4my4r/ECG-Classification"},{"title":"igorsterner/commute-opt-gnn","url":"https://github.com/igorsterner/commute-opt-gnn"},{"title":"mfmceneaney/Lambda-GNNs","url":"https://github.com/mfmceneaney/Lambda-GNNs"},{"title":"willy-b/tiny-GIN-for-ogbg-molhiv","url":"https://github.com/willy-b/tiny-GIN-for-ogbg-molhiv"}],"syntology":{"n":10,"n_ran":3,"n_unverified":7,"n_pointer_only":5}}},{"leaderboard":"/sota/graph-classification-on-hiv","slug":"graph-classification-on-hiv","dataset":"HIV","dataset_url":"/dataset/qm9-charge-densities-and-energies-calculated","rows_in_archive":3,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"GTOT-Tuning","paper_title":"Fine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transport","paper_url":"/paper/fine-tuning-graph-neural-networks-via-graph","paper_date":"2022-03-20","arxiv_id":"2203.10453","code_links":[{"title":"youjibiying/gtot-tuning","url":"https://github.com/youjibiying/gtot-tuning"}],"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-reddit-multi-12k","slug":"graph-classification-on-reddit-multi-12k","dataset":"REDDIT-MULTI-12K","dataset_url":"/dataset/reddit","rows_in_archive":3,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GNN (DiffPool)","paper_title":"Hierarchical Graph Representation Learning with Differentiable Pooling","paper_url":"/paper/hierarchical-graph-representation-learning","paper_date":"2018-06-22","arxiv_id":"1806.08804","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/diffpool"},{"title":"RexYing/diffpool","url":"https://github.com/RexYing/diffpool"},{"title":"RexYing/graph-pooling","url":"https://github.com/RexYing/graph-pooling"},{"title":"AaltoPML/Rethinking-pooling-in-GNNs","url":"https://github.com/AaltoPML/Rethinking-pooling-in-GNNs"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"VoVAllen/diffpool","url":"https://github.com/VoVAllen/diffpool"},{"title":"Tioz90/GCN","url":"https://github.com/Tioz90/GCN"},{"title":"Tioz90/DiffPool","url":"https://github.com/Tioz90/DiffPool"},{"title":"basiralab/reproduciblefedgnn","url":"https://github.com/basiralab/reproduciblefedgnn"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"chappers/graph-differential-pooling","url":"https://github.com/chappers/graph-differential-pooling"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"PasqualeAuriemma/GCN-DIFFPOOL","url":"https://github.com/PasqualeAuriemma/GCN-DIFFPOOL"},{"title":"cedric_sanders/masterarbeit","url":"https://gitlab.com/cedric_sanders/masterarbeit"}],"syntology":{"n":20,"n_ran":1,"n_unverified":19,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-synthetic-dynamic","slug":"graph-classification-on-synthetic-dynamic","dataset":"Synthetic Dynamic Networks","dataset_url":"/dataset/synthetic-dynamic-networks","rows_in_archive":3,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Time-cohort Dynamic Features + Static Features","paper_title":"Learning the mechanisms of network growth","paper_url":"/paper/learning-the-mechanisms-of-network-growth","paper_date":"2024-03-31","arxiv_id":"2404.00793","code_links":[{"title":"LourensT/DynamicNetworkSimulation","url":"https://github.com/LourensT/DynamicNetworkSimulation"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-tox21","slug":"graph-classification-on-tox21","dataset":"Tox21","dataset_url":"/dataset/tox21-1","rows_in_archive":3,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"GMT","paper_title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","paper_url":"/paper/accurate-learning-of-graph-representations-1","paper_date":"2021-02-23","arxiv_id":"2102.11533","code_links":[{"title":"JinheonBaek/GMT","url":"https://github.com/JinheonBaek/GMT"}],"syntology":{"n":5,"n_ran":4,"n_unverified":1,"n_pointer_only":5}}},{"leaderboard":"/sota/graph-classification-on-toxcast","slug":"graph-classification-on-toxcast","dataset":"ToxCast","dataset_url":"/dataset/toxcast-scaffold","rows_in_archive":3,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"GMT","paper_title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","paper_url":"/paper/accurate-learning-of-graph-representations-1","paper_date":"2021-02-23","arxiv_id":"2102.11533","code_links":[{"title":"JinheonBaek/GMT","url":"https://github.com/JinheonBaek/GMT"}],"syntology":{"n":5,"n_ran":4,"n_unverified":1,"n_pointer_only":5}}},{"leaderboard":"/sota/graph-classification-on-aids","slug":"graph-classification-on-aids","dataset":"AIDS","dataset_url":"/dataset/aids","rows_in_archive":2,"metrics":["Accuracy","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-classification-on-bace","slug":"graph-classification-on-bace","dataset":"BACE","dataset_url":"/dataset/bace-scaffold","rows_in_archive":2,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"G-Tuning","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","paper_url":"/paper/fine-tuning-graph-neural-networks-by","paper_date":"2023-12-21","arxiv_id":"2312.13583","code_links":[{"title":"zjunet/G-Tuning","url":"https://github.com/zjunet/G-Tuning"}],"syntology":{"n":13,"n_ran":13,"n_unverified":0,"n_pointer_only":13}}},{"leaderboard":"/sota/graph-classification-on-clintox","slug":"graph-classification-on-clintox","dataset":"clintox","dataset_url":"/dataset/clintox","rows_in_archive":2,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"G-Tuning","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","paper_url":"/paper/fine-tuning-graph-neural-networks-by","paper_date":"2023-12-21","arxiv_id":"2312.13583","code_links":[{"title":"zjunet/G-Tuning","url":"https://github.com/zjunet/G-Tuning"}],"syntology":{"n":13,"n_ran":13,"n_unverified":0,"n_pointer_only":13}}},{"leaderboard":"/sota/graph-classification-on-ipc-grounded","slug":"graph-classification-on-ipc-grounded","dataset":"IPC-grounded","dataset_url":"/dataset/ipc-grounded","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GG-NN","paper_title":"Gated Graph Sequence Neural Networks","paper_url":"/paper/gated-graph-sequence-neural-networks","paper_date":"2015-11-17","arxiv_id":"1511.05493","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ggnn"},{"title":"Microsoft/gated-graph-neural-network-samples","url":"https://github.com/Microsoft/gated-graph-neural-network-samples"},{"title":"chingyaoc/ggnn.pytorch","url":"https://github.com/chingyaoc/ggnn.pytorch"},{"title":"JamesChuanggg/ggnn.pytorch","url":"https://github.com/JamesChuanggg/ggnn.pytorch"},{"title":"yujiali/ggnn","url":"https://github.com/yujiali/ggnn"},{"title":"messi-q/gnnscvuldetector","url":"https://github.com/messi-q/gnnscvuldetector"},{"title":"Microsoft/graph-partition-neural-network-samples","url":"https://github.com/Microsoft/graph-partition-neural-network-samples"},{"title":"bdqnghi/bi-tbcnn","url":"https://github.com/bdqnghi/bi-tbcnn"},{"title":"entslscheia/GGNN_Reasoning","url":"https://github.com/entslscheia/GGNN_Reasoning"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/gated_graph_conv.py"},{"title":"aszot/ggnn","url":"https://github.com/aszot/ggnn"},{"title":"vntchain/gnnscvuldetector","url":"https://github.com/vntchain/gnnscvuldetector"},{"title":"fau-is/grm","url":"https://github.com/fau-is/grm"}],"syntology":{"n":12,"n_ran":0,"n_unverified":12,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-ipc-lifted","slug":"graph-classification-on-ipc-lifted","dataset":"IPC-lifted","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CNN","paper_title":"IPC: A Benchmark Data Set for Learning with Graph-Structured Data","paper_url":"/paper/ipc-a-benchmark-data-set-for-learning-with","paper_date":"2019-05-15","arxiv_id":"1905.06393","code_links":[{"title":"IBM/IPC-graph-data","url":"https://github.com/IBM/IPC-graph-data"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-muv","slug":"graph-classification-on-muv","dataset":"MUV","dataset_url":"/dataset/muv","rows_in_archive":2,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"GTOT-Tuning","paper_title":"Fine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transport","paper_url":"/paper/fine-tuning-graph-neural-networks-via-graph","paper_date":"2022-03-20","arxiv_id":"2203.10453","code_links":[{"title":"youjibiying/gtot-tuning","url":"https://github.com/youjibiying/gtot-tuning"}],"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-sider","slug":"graph-classification-on-sider","dataset":"SIDER","dataset_url":"/dataset/sider","rows_in_archive":2,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"GTOT-Tuning","paper_title":"Fine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transport","paper_url":"/paper/fine-tuning-graph-neural-networks-via-graph","paper_date":"2022-03-20","arxiv_id":"2203.10453","code_links":[{"title":"youjibiying/gtot-tuning","url":"https://github.com/youjibiying/gtot-tuning"}],"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-classification-on-20news","slug":"graph-classification-on-20news","dataset":"20NEWS","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"sKNN-LDS","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_url":"/paper/neighborhood-enlargement-in-graph-neural","paper_date":"2019-05-21","arxiv_id":"1905.08509","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-5pt-bench-easy","slug":"graph-classification-on-5pt-bench-easy","dataset":"5pt. Bench-Easy","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NDP","paper_title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","paper_url":"/paper/hierarchical-representation-learning-in-graph","paper_date":"2019-10-24","arxiv_id":"1910.11436","code_links":[{"title":"danielegrattarola/decimation-pooling","url":"https://github.com/danielegrattarola/decimation-pooling"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}}},{"leaderboard":"/sota/graph-classification-on-adni","slug":"graph-classification-on-adni","dataset":"ADNI","dataset_url":"/dataset/adni","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NeuroPath","paper_title":"NeuroPath: A Neural Pathway Transformer for Joining the Dots of Human Connectomes","paper_url":"/paper/neuropath-a-neural-pathway-transformer-for","paper_date":"2024-09-26","arxiv_id":"2409.17510","code_links":[{"title":"Chrisa142857/neuro_detour","url":"https://github.com/Chrisa142857/neuro_detour"}],"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}}},{"leaderboard":"/sota/graph-classification-on-bench-hard","slug":"graph-classification-on-bench-hard","dataset":"Bench-hard","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NDP","paper_title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","paper_url":"/paper/hierarchical-representation-learning-in-graph","paper_date":"2019-10-24","arxiv_id":"1910.11436","code_links":[{"title":"danielegrattarola/decimation-pooling","url":"https://github.com/danielegrattarola/decimation-pooling"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}}},{"leaderboard":"/sota/graph-classification-on-bzr","slug":"graph-classification-on-bzr","dataset":"BZR","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GDL-g (ADJ)","paper_title":"Online Graph Dictionary Learning","paper_url":"/paper/online-graph-dictionary-learning","paper_date":"2021-02-12","arxiv_id":"2102.06555","code_links":[{"title":"cedricvincentcuaz/GDL","url":"https://github.com/cedricvincentcuaz/GDL"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-cancer","slug":"graph-classification-on-cancer","dataset":"Cancer","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"sKNN-LDS","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_url":"/paper/neighborhood-enlargement-in-graph-neural","paper_date":"2019-05-21","arxiv_id":"1905.08509","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-cifar-10","slug":"graph-classification-on-cifar-10","dataset":"CIFAR-10","dataset_url":"/dataset/cifar-10","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CKGCN","paper_title":"CKGConv: General Graph Convolution with Continuous Kernels","paper_url":"/paper/ckgconv-general-graph-convolution-with","paper_date":"2024-04-21","arxiv_id":"2404.13604","code_links":[{"title":"networkslab/ckgconv","url":"https://github.com/networkslab/ckgconv"}],"syntology":{"n":11,"n_ran":8,"n_unverified":3,"n_pointer_only":11}}},{"leaderboard":"/sota/graph-classification-on-citeseer","slug":"graph-classification-on-citeseer","dataset":"Citeseer","dataset_url":"/dataset/citeseer","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"sKNN-LDS","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_url":"/paper/neighborhood-enlargement-in-graph-neural","paper_date":"2019-05-21","arxiv_id":"1905.08509","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-coil-rag","slug":"graph-classification-on-coil-rag","dataset":"COIL-RAG","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SPI-GCN","paper_title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","paper_url":"/paper/spi-gcn-a-simple-permutation-invariant-graph","paper_date":"2019-04-08","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-cora","slug":"graph-classification-on-cora","dataset":"Cora","dataset_url":"/dataset/cora","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"sKNN-LDS","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_url":"/paper/neighborhood-enlargement-in-graph-neural","paper_date":"2019-05-21","arxiv_id":"1905.08509","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-csl","slug":"graph-classification-on-csl","dataset":"CSL","dataset_url":"/dataset/csl","rows_in_archive":1,"metrics":["Acc"],"first_row_in_archive_order":{"model":"CIN","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-classification-on-digits","slug":"graph-classification-on-digits","dataset":"Digits","dataset_url":"/dataset/digits","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"sKNN-LDS","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_url":"/paper/neighborhood-enlargement-in-graph-neural","paper_date":"2019-05-21","arxiv_id":"1905.08509","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-hcp-aging","slug":"graph-classification-on-hcp-aging","dataset":"HCP Aging","dataset_url":"/dataset/hcp-aging","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NeuroPath","paper_title":"NeuroPath: A Neural Pathway Transformer for Joining the Dots of Human Connectomes","paper_url":"/paper/neuropath-a-neural-pathway-transformer-for","paper_date":"2024-09-26","arxiv_id":"2409.17510","code_links":[{"title":"Chrisa142857/neuro_detour","url":"https://github.com/Chrisa142857/neuro_detour"}],"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}}},{"leaderboard":"/sota/graph-classification-on-hiv-fmri-77-1","slug":"graph-classification-on-hiv-fmri-77-1","dataset":"HIV-fMRI-77","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy","F1"],"first_row_in_archive_order":{"model":"IsoNN","paper_title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","paper_url":"/paper/isonn-isomorphic-neural-network-for-graph","paper_date":"2019-07-22","arxiv_id":"1907.09495","code_links":[{"title":"linmengsysu/IsoNN","url":"https://github.com/linmengsysu/IsoNN"},{"title":"jwzhanggy/isocapsnet","url":"https://github.com/jwzhanggy/isocapsnet"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-hydrides","slug":"graph-classification-on-hydrides","dataset":"HYDRIDES","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SPI-GCN","paper_title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","paper_url":"/paper/spi-gcn-a-simple-permutation-invariant-graph","paper_date":"2019-04-08","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-imdb-multi","slug":"graph-classification-on-imdb-multi","dataset":"IMDB-MULTI","dataset_url":"/dataset/imdb-multi","rows_in_archive":1,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"Local Topological Profile (LTP)","paper_title":"Strengthening structural baselines for graph classification using Local Topological Profile","paper_url":"/paper/strengthening-structural-baselines-for-graph","paper_date":"2023-05-01","arxiv_id":"2305.00724","code_links":[{"title":"j-adamczyk/ltp","url":"https://github.com/j-adamczyk/ltp"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-msrc-21-per-class","slug":"graph-classification-on-msrc-21-per-class","dataset":"MSRC-21 (per-class)","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy (10 fold)"],"first_row_in_archive_order":{"model":"G-Tuning","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","paper_url":"/paper/fine-tuning-graph-neural-networks-by","paper_date":"2023-12-21","arxiv_id":"2312.13583","code_links":[{"title":"zjunet/G-Tuning","url":"https://github.com/zjunet/G-Tuning"}],"syntology":{"n":13,"n_ran":13,"n_unverified":0,"n_pointer_only":13}}},{"leaderboard":"/sota/graph-classification-on-nc1","slug":"graph-classification-on-nc1","dataset":"NC1","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"EigenGCN-3","paper_title":"Graph Convolutional Networks with EigenPooling","paper_url":"/paper/graph-convolutional-networks-with","paper_date":"2019-04-30","arxiv_id":"1904.13107","code_links":[{"title":"alge24/eigenpooling","url":"https://github.com/alge24/eigenpooling"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-nci-123","slug":"graph-classification-on-nci-123","dataset":"NCI-123","dataset_url":"/dataset/nci1","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GAM","paper_title":"Graph Classification using Structural Attention","paper_url":"/paper/graph-classification-using-structural","paper_date":"2018-07-19","arxiv_id":null,"code_links":[{"title":"benedekrozemberczki/GAM","url":"https://github.com/benedekrozemberczki/GAM"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-nci-83","slug":"graph-classification-on-nci-83","dataset":"NCI-83","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GAM","paper_title":"Graph Classification using Structural Attention","paper_url":"/paper/graph-classification-using-structural","paper_date":"2018-07-19","arxiv_id":null,"code_links":[{"title":"benedekrozemberczki/GAM","url":"https://github.com/benedekrozemberczki/GAM"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-nci33","slug":"graph-classification-on-nci33","dataset":"NCI33","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GAM","paper_title":"Graph Classification using Structural Attention","paper_url":"/paper/graph-classification-using-structural","paper_date":"2018-07-19","arxiv_id":null,"code_links":[{"title":"benedekrozemberczki/GAM","url":"https://github.com/benedekrozemberczki/GAM"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-oasis","slug":"graph-classification-on-oasis","dataset":"OASIS","dataset_url":"/dataset/oasis","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NeuroPath","paper_title":"NeuroPath: A Neural Pathway Transformer for Joining the Dots of Human Connectomes","paper_url":"/paper/neuropath-a-neural-pathway-transformer-for","paper_date":"2024-09-26","arxiv_id":"2409.17510","code_links":[{"title":"Chrisa142857/neuro_detour","url":"https://github.com/Chrisa142857/neuro_detour"}],"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}}},{"leaderboard":"/sota/graph-classification-on-pubmed","slug":"graph-classification-on-pubmed","dataset":"Pubmed","dataset_url":"/dataset/pubmed","rows_in_archive":1,"metrics":["Test Accuracy"],"first_row_in_archive_order":{"model":"Fea2Fea-s3","paper_title":"Fea2Fea: Exploring Structural Feature Correlations via Graph Neural Networks","paper_url":"/paper/fea2fea-exploring-structural-feature","paper_date":"2021-06-24","arxiv_id":"2106.13061","code_links":[{"title":"JIAQING-XIE/Fea2Fea","url":"https://github.com/JIAQING-XIE/Fea2Fea"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-reddit-12k","slug":"graph-classification-on-reddit-12k","dataset":"REDDIT-12K","dataset_url":"/dataset/reddit-12k","rows_in_archive":1,"metrics":["Accuracy (10 fold)"],"first_row_in_archive_order":{"model":"G-Tuning","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","paper_url":"/paper/fine-tuning-graph-neural-networks-by","paper_date":"2023-12-21","arxiv_id":"2312.13583","code_links":[{"title":"zjunet/G-Tuning","url":"https://github.com/zjunet/G-Tuning"}],"syntology":{"n":13,"n_ran":13,"n_unverified":0,"n_pointer_only":13}}},{"leaderboard":"/sota/graph-classification-on-reddit-multi-5k","slug":"graph-classification-on-reddit-multi-5k","dataset":"REDDIT-MULTI-5k","dataset_url":"/dataset/reddit-5k","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphSAGE","paper_title":"A Fair Comparison of Graph Neural Networks for Graph Classification","paper_url":"/paper/a-fair-comparison-of-graph-neural-networks-1","paper_date":"2019-12-20","arxiv_id":"1912.09893","code_links":[{"title":"diningphil/gnn-comparison","url":"https://github.com/diningphil/gnn-comparison"},{"title":"diningphil/CGMM","url":"https://github.com/diningphil/CGMM"},{"title":"FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks","url":"https://github.com/FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks"},{"title":"diningphil/icgmm","url":"https://github.com/diningphil/icgmm"},{"title":"toinesayan/node-classification-and-label-dependencies","url":"https://github.com/toinesayan/node-classification-and-label-dependencies"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-synthie","slug":"graph-classification-on-synthie","dataset":"SYNTHIE","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SPI-GCN","paper_title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","paper_url":"/paper/spi-gcn-a-simple-permutation-invariant-graph","paper_date":"2019-04-08","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-uk-biobank-brain-mri","slug":"graph-classification-on-uk-biobank-brain-mri","dataset":"UK Biobank Brain MRI","dataset_url":"/dataset/uk-biobank-brain-mri","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NeuroPath","paper_title":"NeuroPath: A Neural Pathway Transformer for Joining the Dots of Human Connectomes","paper_url":"/paper/neuropath-a-neural-pathway-transformer-for","paper_date":"2024-09-26","arxiv_id":"2409.17510","code_links":[{"title":"Chrisa142857/neuro_detour","url":"https://github.com/Chrisa142857/neuro_detour"}],"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}}},{"leaderboard":"/sota/graph-classification-on-web","slug":"graph-classification-on-web","dataset":"Web","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"UGraphEmb-F","paper_title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","paper_url":"/paper/unsupervised-inductive-whole-graph-embedding","paper_date":"2019-04-01","arxiv_id":"1904.01098","code_links":[{"title":"yunshengb/UGraphEmb","url":"https://github.com/yunshengb/UGraphEmb"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-wine","slug":"graph-classification-on-wine","dataset":"Wine","dataset_url":"/dataset/wine","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"sKNN-LDS","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_url":"/paper/neighborhood-enlargement-in-graph-neural","paper_date":"2019-05-21","arxiv_id":"1905.08509","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"syntology":null}}],"datasets":[{"url":"/dataset/cifar-10","name":"CIFAR-10","full_name":"CIFAR-10","num_papers_in_archive":16145},{"url":"/dataset/mnist","name":"MNIST","full_name":"","num_papers_in_archive":7651},{"url":"/dataset/pubmed","name":"Pubmed","full_name":"","num_papers_in_archive":1236},{"url":"/dataset/ogb","name":"OGB","full_name":"Open Graph Benchmark","num_papers_in_archive":1000},{"url":"/dataset/reddit","name":"Reddit","full_name":"","num_papers_in_archive":699},{"url":"/dataset/cora","name":"Cora","full_name":"","num_papers_in_archive":602},{"url":"/dataset/citeseer","name":"Citeseer","full_name":"","num_papers_in_archive":381},{"url":"/dataset/proteins","name":"PROTEINS","full_name":"","num_papers_in_archive":371},{"url":"/dataset/imdb-binary","name":"IMDB-BINARY","full_name":"","num_papers_in_archive":326},{"url":"/dataset/mutag","name":"MUTAG","full_name":"","num_papers_in_archive":274},{"url":"/dataset/nci1","name":"NCI1","full_name":"","num_papers_in_archive":260},{"url":"/dataset/collab","name":"COLLAB","full_name":"","num_papers_in_archive":259},{"url":"/dataset/imdb-multi","name":"IMDB-MULTI","full_name":"","num_papers_in_archive":243},{"url":"/dataset/enzymes","name":"ENZYMES","full_name":"","num_papers_in_archive":202},{"url":"/dataset/reddit-binary","name":"REDDIT-BINARY","full_name":"","num_papers_in_archive":150},{"url":"/dataset/ptc","name":"PTC","full_name":"Predictive Toxicology Challenge","num_papers_in_archive":111},{"url":"/dataset/nci109","name":"NCI109","full_name":"NCI109","num_papers_in_archive":96},{"url":"/dataset/reddit-5k","name":"REDDIT-5K","full_name":"REDDIT-MULTI-5K","num_papers_in_archive":78},{"url":"/dataset/pascalvoc-sp","name":"Long Range Graph Benchmark (LRGB)","full_name":"","num_papers_in_archive":76},{"url":"/dataset/aids","name":"AIDS","full_name":"AIDS","num_papers_in_archive":67},{"url":"/dataset/ba-2motifs","name":"BA-2motifs","full_name":"","num_papers_in_archive":48},{"url":"/dataset/csl","name":"CSL","full_name":"","num_papers_in_archive":34},{"url":"/dataset/tox21-1","name":"Tox21","full_name":"","num_papers_in_archive":30},{"url":"/dataset/adni","name":"ADNI","full_name":"Alzheimer's Disease NeuroImaging Initiative","num_papers_in_archive":28},{"url":"/dataset/bbbp-scaffold","name":"BBBP (Blood-Brain Barrier Penetration)","full_name":"","num_papers_in_archive":28},{"url":"/dataset/oasis","name":"OASIS","full_name":"Open Annotations of Single Image Surfaces","num_papers_in_archive":28},{"url":"/dataset/reddit-12k","name":"REDDIT-12K","full_name":"","num_papers_in_archive":24},{"url":"/dataset/bace-scaffold","name":"BACE (β-secretase enzyme)","full_name":"","num_papers_in_archive":22},{"url":"/dataset/digits","name":"Digits","full_name":"Optical Recognition of Handwritten Digits","num_papers_in_archive":21},{"url":"/dataset/qm9-charge-densities-and-energies-calculated","name":"HIV (Human Immunodeficiency Virus)","full_name":"","num_papers_in_archive":20},{"url":"/dataset/clintox","name":"clintox","full_name":"","num_papers_in_archive":19},{"url":"/dataset/sider","name":"SIDER","full_name":"SIDER","num_papers_in_archive":19},{"url":"/dataset/malnet","name":"MalNet","full_name":"","num_papers_in_archive":17},{"url":"/dataset/toxcast-scaffold","name":"ToxCast (Toxicity Forecaster)","full_name":"","num_papers_in_archive":15},{"url":"/dataset/linux","name":"Linux","full_name":"Linux Program Dependence Graphs","num_papers_in_archive":14},{"url":"/dataset/mutagenicity","name":"Mutagenicity","full_name":null,"num_papers_in_archive":13},{"url":"/dataset/upfd","name":"UPFD","full_name":"User Preference-aware Fake News Detection","num_papers_in_archive":13},{"url":"/dataset/muv","name":"MUV","full_name":"","num_papers_in_archive":12},{"url":"/dataset/wine","name":"Wine","full_name":"Wine Data Set","num_papers_in_archive":11},{"url":"/dataset/upfd-gos","name":"UPFD-GOS","full_name":"User Preference-aware Fake News Detection","num_papers_in_archive":3},{"url":"/dataset/apistox","name":"ApisTox","full_name":"","num_papers_in_archive":2},{"url":"/dataset/eth-exchange","name":"Eth-Exchange","full_name":"Exchange in Ethereum","num_papers_in_archive":2},{"url":"/dataset/gvlqa","name":"GVLQA","full_name":"Graph Vision-Language Question-Answering","num_papers_in_archive":2},{"url":"/dataset/hcp-aging","name":"HCP Aging","full_name":"Lifespan Human Connectome Project Aging","num_papers_in_archive":2},{"url":"/dataset/ipc-grounded","name":"IPC-grounded","full_name":"","num_papers_in_archive":2},{"url":"/dataset/uk-biobank-brain-mri","name":"UK Biobank Brain MRI","full_name":"UK Biobank Data - Brain MRI","num_papers_in_archive":2},{"url":"/dataset/upfd-pol","name":"UPFD-POL","full_name":"User Preference-aware Fake News Detection","num_papers_in_archive":2},{"url":"/dataset/aids-antiviral-screen","name":"AIDS Antiviral Screen","full_name":"AIDS Antiviral Screen","num_papers_in_archive":1},{"url":"/dataset/b-xaic","name":"B-XAIC","full_name":"","num_papers_in_archive":1},{"url":"/dataset/color-connectivity","name":"Color-connectivity","full_name":"","num_papers_in_archive":1},{"url":"/dataset/eth-ico","name":"Eth-ICO","full_name":"ICO-wallets in Ethereum","num_papers_in_archive":1},{"url":"/dataset/eth-mining","name":"Eth-Mining","full_name":"Mining in Ethereum","num_papers_in_archive":1},{"url":"/dataset/spot-10","name":"SPOT-10","full_name":"Animal Pattern Benchmark Dataset for Machine Learning Algorithms","num_papers_in_archive":1},{"url":"/dataset/synthetic-dynamic-networks","name":"Synthetic Dynamic Networks","full_name":"from Aging, Fitness Preferential Attachment mechanisms","num_papers_in_archive":1}],"subtasks":[{"url":"/task/crystal-system-classification","name":"Crystal system classification"},{"url":"/task/isomorphism-testing","name":"Isomorphism Testing"},{"url":"/task/space-group-classification","name":"Space group classification"}],"parent_tasks":[{"url":"/task/classification-1","name":"Classification"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":483,"tagged_in_all":927,"items":[{"url":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":50,"n_unverified":56,"n_pointer_only":43}},{"url":"/paper/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":31,"n_unverified":27,"n_pointer_only":22}},{"url":"/paper/modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","repositories_listed":27,"syntology":{"n":32,"n_ran":10,"n_unverified":22,"n_pointer_only":15}},{"url":"/paper/imagenet-classification-with-deep","title":"ImageNet Classification with Deep Convolutional Neural Networks","date":"2012-12-01","arxiv_id":null,"repositories_listed":23,"syntology":null},{"url":"/paper/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_unverified":2,"n_pointer_only":5}},{"url":"/paper/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":3,"n_unverified":7,"n_pointer_only":5}},{"url":"/paper/lightgcn-simplifying-and-powering-graph","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","date":"2020-02-06","arxiv_id":"2002.02126","repositories_listed":18,"syntology":{"n":7,"n_ran":2,"n_unverified":5,"n_pointer_only":2}},{"url":"/paper/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":1,"n_unverified":22,"n_pointer_only":0}},{"url":"/paper/hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","arxiv_id":"1806.08804","repositories_listed":14,"syntology":{"n":20,"n_ran":1,"n_unverified":19,"n_pointer_only":0}},{"url":"/paper/gated-graph-sequence-neural-networks","title":"Gated Graph Sequence Neural Networks","date":"2015-11-17","arxiv_id":"1511.05493","repositories_listed":13,"syntology":{"n":12,"n_ran":0,"n_unverified":12,"n_pointer_only":0}},{"url":"/paper/gnn-explainer-a-tool-for-post-hoc-explanation","title":"GNNExplainer: Generating Explanations for Graph Neural Networks","date":"2019-03-10","arxiv_id":"1903.03894","repositories_listed":12,"syntology":{"n":22,"n_ran":1,"n_unverified":21,"n_pointer_only":0}},{"url":"/paper/pre-training-graph-neural-networks","title":"Strategies for Pre-training Graph Neural Networks","date":"2019-05-29","arxiv_id":"1905.12265","repositories_listed":11,"syntology":{"n":14,"n_ran":10,"n_unverified":4,"n_pointer_only":2}},{"url":"/paper/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":6,"n_unverified":10,"n_pointer_only":1}},{"url":"/paper/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_unverified":22,"n_pointer_only":48}},{"url":"/paper/fast-graph-representation-learning-with","title":"Fast Graph Representation Learning with PyTorch Geometric","date":"2019-03-06","arxiv_id":"1903.02428","repositories_listed":6,"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":2}},{"url":"/paper/structural-deep-network-embedding","title":"Structural Deep Network Embedding","date":"2016-06-01","arxiv_id":null,"repositories_listed":6,"syntology":null},{"url":"/paper/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/contrastive-multi-view-representation","title":"Contrastive Multi-View Representation Learning on Graphs","date":"2020-06-10","arxiv_id":"2006.05582","repositories_listed":5,"syntology":{"n":22,"n_ran":16,"n_unverified":6,"n_pointer_only":9}},{"url":"/paper/a-fair-comparison-of-graph-neural-networks-1","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","date":"2019-12-20","arxiv_id":"1912.09893","repositories_listed":5,"syntology":null},{"url":"/paper/infograph-unsupervised-and-semi-supervised","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","date":"2019-07-31","arxiv_id":"1908.01000","repositories_listed":5,"syntology":null},{"url":"/paper/splinecnn-fast-geometric-deep-learning-with","title":"SplineCNN: Fast Geometric Deep Learning with Continuous B-Spline Kernels","date":"2017-11-24","arxiv_id":"1711.08920","repositories_listed":5,"syntology":null},{"url":"/paper/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/energy-transformer","title":"Energy Transformer","date":"2023-02-14","arxiv_id":"2302.07253","repositories_listed":4,"syntology":{"n":13,"n_ran":8,"n_unverified":5,"n_pointer_only":3}},{"url":"/paper/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_unverified":18,"n_pointer_only":0}},{"url":"/paper/parameterized-explainer-for-graph-neural","title":"Parameterized Explainer for Graph Neural Network","date":"2020-11-09","arxiv_id":"2011.04573","repositories_listed":4,"syntology":{"n":8,"n_ran":3,"n_unverified":5,"n_pointer_only":8}},{"url":"/paper/detecting-relevant-feature-interactions-for","title":"Detecting Beneficial Feature Interactions for Recommender Systems","date":"2020-08-02","arxiv_id":"2008.00404","repositories_listed":4,"syntology":null},{"url":"/paper/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_unverified":2,"n_pointer_only":4}},{"url":"/paper/gcc-graph-contrastive-coding-for-graph-neural","title":"GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training","date":"2020-06-17","arxiv_id":"2006.09963","repositories_listed":4,"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/composition-based-multi-relational-graph","title":"Composition-based Multi-Relational Graph Convolutional Networks","date":"2019-11-08","arxiv_id":"1911.03082","repositories_listed":4,"syntology":{"n":6,"n_ran":2,"n_unverified":4,"n_pointer_only":3}}],"syntology_records":22,"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"},"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-09-24T18:15:14+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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"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"}}