{"url":"/sota/graph-classification-on-nci1","task":{"name":"Graph Classification","url":"/task/graph-classification","note":null},"dataset":{"name":"NCI1","url":"/dataset/nci1"},"category":"Graphs","categories":["Graphs"],"category_note":null,"description":"**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>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Accuracy","Accuracy (10-fold)"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Accuracy":"higher","Accuracy (10-fold)":"higher"}},"counts":{"rows":69,"rows_with_code":60,"rows_with_paper_page":69,"rows_dated":69,"rows_using_additional_data":1},"rows":[{"rank_in_archive_order":1,"model":"TFGW ADJ (L=2)","metrics":{"Accuracy":"88.1%"},"uses_additional_data":false,"paper_date":"2022-05-31","paper":"/paper/template-based-graph-neural-network-with","paper_url":"https://arxiv.org/abs/2205.15733v1","paper_title":"Template based Graph Neural Network with Optimal Transport Distances","code":"https://github.com/cedricvincentcuaz/TFGW","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"ESA (Edge set attention, no positional encodings)","metrics":{"Accuracy":"87.835±0.644"},"uses_additional_data":false,"paper_date":"2024-02-16","paper":"/paper/masked-attention-is-all-you-need-for-graphs","paper_url":"https://arxiv.org/abs/2402.10793v2","paper_title":"An end-to-end attention-based approach for learning on graphs","code":"https://github.com/davidbuterez/edge-set-attention","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"WKPI-kmeans","metrics":{"Accuracy":"87.2%"},"uses_additional_data":false,"paper_date":"2019-04-27","paper":"/paper/learning-metrics-for-persistence-based-2","paper_url":"https://arxiv.org/abs/1904.12189v2","paper_title":"Learning metrics for persistence-based summaries and applications for graph classification","code":"https://github.com/topology474/WKPI","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"FGW wl h=4 sp","metrics":{"Accuracy":"86.42%"},"uses_additional_data":false,"paper_date":"2018-05-23","paper":"/paper/optimal-transport-for-structured-data-with","paper_url":"https://arxiv.org/abs/1805.09114v3","paper_title":"Optimal Transport for structured data with application on graphs","code":"https://github.com/rflamary/POT","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":5,"model":"WL-OA Kernel","metrics":{"Accuracy":"86.1%"},"uses_additional_data":false,"paper_date":"2018-10-04","paper":"/paper/weisfeiler-and-leman-go-neural-higher-order","paper_url":"https://arxiv.org/abs/1810.02244v5","paper_title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","code":"https://github.com/chrsmrrs/k-gnn","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"WL-OA","metrics":{"Accuracy":"86.1%"},"uses_additional_data":false,"paper_date":"2016-06-03","paper":"/paper/on-valid-optimal-assignment-kernels-and","paper_url":"http://arxiv.org/abs/1606.01141v3","paper_title":"On Valid Optimal Assignment Kernels and Applications to Graph Classification","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":7,"model":"FGW wl h=2 sp","metrics":{"Accuracy":"85.82%"},"uses_additional_data":false,"paper_date":"2018-05-23","paper":"/paper/optimal-transport-for-structured-data-with","paper_url":"https://arxiv.org/abs/1805.09114v3","paper_title":"Optimal Transport for structured data with application on graphs","code":"https://github.com/rflamary/POT","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":8,"model":"WWL","metrics":{"Accuracy":"85.75%"},"uses_additional_data":false,"paper_date":"2019-06-04","paper":"/paper/wasserstein-weisfeiler-lehman-graph-kernels","paper_url":"https://arxiv.org/abs/1906.01277v2","paper_title":"Wasserstein Weisfeiler-Lehman Graph Kernels","code":"https://github.com/BorgwardtLab/WWL","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":10,"n_samples":11,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"δ-2-LWL","metrics":{"Accuracy":"85.5%"},"uses_additional_data":false,"paper_date":"2019-04-02","paper":"/paper/towards-a-practical-k-dimensional-weisfeiler","paper_url":"https://arxiv.org/abs/1904.01543v3","paper_title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","code":"https://github.com/chrsmrrs/sparsewl","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":10,"model":"DUGNN","metrics":{"Accuracy":"85.50%"},"uses_additional_data":true,"paper_date":"2017-08-17","paper":"/paper/learning-universal-adversarial-perturbations","paper_url":"http://arxiv.org/abs/1708.05207v3","paper_title":"Learning Universal Adversarial Perturbations with Generative Models","code":"https://github.com/jhayes14/UAN","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"CIN++","metrics":{"Accuracy":"85.3%"},"uses_additional_data":false,"paper_date":"2023-06-06","paper":"/paper/cin-enhancing-topological-message-passing","paper_url":"https://arxiv.org/abs/2306.03561v1","paper_title":"CIN++: Enhancing Topological Message Passing","code":"https://github.com/twitter-research/cwn","n_code_links":1,"syntology":null},{"rank_in_archive_order":12,"model":"CORE-WL","metrics":{"Accuracy":"85.12%"},"uses_additional_data":false,"paper_date":"2019-04-27","paper":"/paper/graph-kernels-a-survey","paper_url":"https://arxiv.org/abs/1904.12218v2","paper_title":"Graph Kernels: A Survey","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":13,"model":"GraphGPS","metrics":{"Accuracy":"85.110±1.423"},"uses_additional_data":false,"paper_date":"2022-05-25","paper":"/paper/recipe-for-a-general-powerful-scalable-graph","paper_url":"https://arxiv.org/abs/2205.12454v4","paper_title":"Recipe for a General, Powerful, Scalable Graph Transformer","code":"https://github.com/rampasek/GraphGPS","n_code_links":4,"syntology":{"n_ran":3,"n_unverified":18,"n_samples":21,"n_pointer_only_licence":0}},{"rank_in_archive_order":14,"model":"GAT","metrics":{"Accuracy":"85.109±1.107"},"uses_additional_data":false,"paper_date":"2017-10-30","paper":"/paper/graph-attention-networks","paper_url":"http://arxiv.org/abs/1710.10903v3","paper_title":"Graph Attention Networks","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":93,"syntology":{"n_ran":51,"n_unverified":55,"n_samples":106,"n_pointer_only_licence":43}},{"rank_in_archive_order":15,"model":"PIN","metrics":{"Accuracy":"85.1%"},"uses_additional_data":false,"paper_date":"2023-08-13","paper":"/paper/generalizing-topological-graph-neural","paper_url":"https://arxiv.org/abs/2308.06838v6","paper_title":"Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":16,"model":"PNA","metrics":{"Accuracy":"84.964±1.391"},"uses_additional_data":false,"paper_date":"2020-04-12","paper":"/paper/principal-neighbourhood-aggregation-for-graph","paper_url":"https://arxiv.org/abs/2004.05718v5","paper_title":"Principal Neighbourhood Aggregation for Graph Nets","code":"https://github.com/rusty1s/pytorch_geometric","n_code_links":8,"syntology":{"n_ran":33,"n_unverified":22,"n_samples":55,"n_pointer_only_licence":48}},{"rank_in_archive_order":17,"model":"Norm-GN","metrics":{"Accuracy":"84.87%"},"uses_additional_data":false,"paper_date":"2021-12-14","paper":"/paper/improving-spectral-graph-convolution-for","paper_url":"https://arxiv.org/abs/2112.07160v2","paper_title":"A New Perspective on the Effects of Spectrum in Graph Neural Networks","code":"https://github.com/qslim/gnn-spectrum","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":18,"model":"GIN","metrics":{"Accuracy":"84.818±0.936"},"uses_additional_data":false,"paper_date":"2018-10-01","paper":"/paper/how-powerful-are-graph-neural-networks","paper_url":"http://arxiv.org/abs/1810.00826v3","paper_title":"How Powerful are Graph Neural Networks?","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin","n_code_links":19,"syntology":{"n_ran":3,"n_unverified":7,"n_samples":10,"n_pointer_only_licence":5}},{"rank_in_archive_order":19,"model":"Propagation kernels (pk)","metrics":{"Accuracy":"84.5%"},"uses_additional_data":false,"paper_date":"2019-02-01","paper":"/paper/propagation-kernels-efficient-graph-kernels","paper_url":"https://doi.org/10.1007/s10994-015-5517-9","paper_title":"Propagation kernels: efficient graph kernels from propagated information","code":"https://github.com/marionmari/propagation_kernels","n_code_links":1,"syntology":null},{"rank_in_archive_order":20,"model":"CAN","metrics":{"Accuracy":"84.5%"},"uses_additional_data":false,"paper_date":"2022-09-16","paper":"/paper/cell-attention-networks","paper_url":"https://arxiv.org/abs/2209.08179v1","paper_title":"Cell Attention Networks","code":"https://github.com/lrnzgiusti/can","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":3,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":21,"model":"DropGIN","metrics":{"Accuracy":"84.331±1.564"},"uses_additional_data":false,"paper_date":"2021-11-11","paper":"/paper/dropgnn-random-dropouts-increase-the","paper_url":"https://arxiv.org/abs/2111.06283v1","paper_title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","code":"https://github.com/karolismart/dropgnn","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":22,"model":"GCN","metrics":{"Accuracy":"84.185±0.644"},"uses_additional_data":false,"paper_date":"2016-09-09","paper":"/paper/semi-supervised-classification-with-graph","paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn","n_code_links":55,"syntology":{"n_ran":32,"n_unverified":26,"n_samples":58,"n_pointer_only_licence":22}},{"rank_in_archive_order":23,"model":"GIC","metrics":{"Accuracy":"84.08%"},"uses_additional_data":false,"paper_date":"2018-11-11","paper":"/paper/gaussian-induced-convolution-for-graphs","paper_url":"http://arxiv.org/abs/1811.04393v1","paper_title":"Gaussian-Induced Convolution for Graphs","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":24,"model":"sGIN","metrics":{"Accuracy":"83.85%"},"uses_additional_data":false,"paper_date":"2019-05-21","paper":"/paper/neighborhood-enlargement-in-graph-neural","paper_url":"https://arxiv.org/abs/1905.08509v4","paper_title":"Mutual Information Maximization in Graph Neural Networks","code":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1","n_code_links":2,"syntology":null},{"rank_in_archive_order":25,"model":"ECC (5 scores)","metrics":{"Accuracy":"83.8%"},"uses_additional_data":false,"paper_date":"2017-04-10","paper":"/paper/dynamic-edge-conditioned-filters-in","paper_url":"http://arxiv.org/abs/1704.02901v3","paper_title":"Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs","code":"https://github.com/rusty1s/pytorch_cluster","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":26,"model":"GFN","metrics":{"Accuracy":"83.65%"},"uses_additional_data":false,"paper_date":"2019-05-11","paper":"/paper/dissecting-graph-neural-networks-on-graph","paper_url":"https://arxiv.org/abs/1905.04579v3","paper_title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","code":"https://github.com/chentingpc/gfn","n_code_links":1,"syntology":null},{"rank_in_archive_order":27,"model":"Multigraph ChebNet","metrics":{"Accuracy":"83.4%"},"uses_additional_data":false,"paper_date":"2018-11-23","paper":"/paper/spectral-multigraph-networks-for-discovering","paper_url":"http://arxiv.org/abs/1811.09595v1","paper_title":"Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules","code":"https://github.com/bknyaz/graph_nn","n_code_links":1,"syntology":null},{"rank_in_archive_order":28,"model":"PPGN","metrics":{"Accuracy":"83.19%"},"uses_additional_data":false,"paper_date":"2019-05-27","paper":"/paper/provably-powerful-graph-networks","paper_url":"https://arxiv.org/abs/1905.11136v4","paper_title":"Provably Powerful Graph Networks","code":"https://github.com/hadarser/ProvablyPowerfulGraphNetworks_torch","n_code_links":2,"syntology":{"n_ran":2,"n_unverified":6,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":29,"model":"GCAPS-CNN","metrics":{"Accuracy":"82.72%"},"uses_additional_data":false,"paper_date":"2018-05-21","paper":"/paper/graph-capsule-convolutional-neural-networks","paper_url":"http://arxiv.org/abs/1805.08090v4","paper_title":"Graph Capsule Convolutional Neural Networks","code":"https://github.com/vermaMachineLearning/Graph-Capsule-CNN-Networks","n_code_links":1,"syntology":null},{"rank_in_archive_order":30,"model":"GIN-0","metrics":{"Accuracy":"82.7%"},"uses_additional_data":false,"paper_date":"2018-10-01","paper":"/paper/how-powerful-are-graph-neural-networks","paper_url":"http://arxiv.org/abs/1810.00826v3","paper_title":"How Powerful are Graph Neural Networks?","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin","n_code_links":19,"syntology":{"n_ran":3,"n_unverified":7,"n_samples":10,"n_pointer_only_licence":5}},{"rank_in_archive_order":31,"model":"GATv2","metrics":{"Accuracy":"82.384±1.700"},"uses_additional_data":false,"paper_date":"2021-05-30","paper":"/paper/how-attentive-are-graph-attention-networks","paper_url":"https://arxiv.org/abs/2105.14491v3","paper_title":"How Attentive are Graph Attention Networks?","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":8,"syntology":{"n_ran":11,"n_unverified":5,"n_samples":16,"n_pointer_only_licence":1}},{"rank_in_archive_order":32,"model":"GAT-GC (f-Scaled)","metrics":{"Accuracy":"82.28%"},"uses_additional_data":false,"paper_date":"2019-07-04","paper":"/paper/improving-attention-mechanism-in-graph-neural","paper_url":"https://arxiv.org/abs/1907.02204v4","paper_title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","code":"https://github.com/zetayue/CPA","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":33,"model":"DAGCN","metrics":{"Accuracy":"81.68%"},"uses_additional_data":false,"paper_date":"2019-04-04","paper":"/paper/dagcn-dual-attention-graph-convolutional","paper_url":"http://arxiv.org/abs/1904.02278v1","paper_title":"DAGCN: Dual Attention Graph Convolutional Networks","code":"https://github.com/dawenzi123/DAGCN","n_code_links":1,"syntology":null},{"rank_in_archive_order":34,"model":"NERO","metrics":{"Accuracy":"81.63%"},"uses_additional_data":false,"paper_date":"2021-06-09","paper":"/paper/relation-order-histograms-as-a-network","paper_url":"https://link.springer.com/chapter/10.1007/978-3-030-77964-1_18","paper_title":"Relation order histograms as a network embedding tool","code":"https://github.com/Prpht/NERO","n_code_links":1,"syntology":null},{"rank_in_archive_order":35,"model":"GFN-light","metrics":{"Accuracy":"81.43%"},"uses_additional_data":false,"paper_date":"2019-05-11","paper":"/paper/dissecting-graph-neural-networks-on-graph","paper_url":"https://arxiv.org/abs/1905.04579v3","paper_title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","code":"https://github.com/chentingpc/gfn","n_code_links":1,"syntology":null},{"rank_in_archive_order":36,"model":"VRGC","metrics":{"Accuracy":"80.7%"},"uses_additional_data":false,"paper_date":"2019-02-07","paper":"/paper/graph-classification-with-recurrent","paper_url":"https://arxiv.org/abs/1902.02721v4","paper_title":"Variational Recurrent Neural Networks for Graph Classification","code":"https://github.com/edouardpineau/Variational-Recurrent-Neural-Networks-for-Graph-Classification","n_code_links":1,"syntology":null},{"rank_in_archive_order":37,"model":"GIUNet","metrics":{"Accuracy":"80.2%"},"uses_additional_data":false,"paper_date":"2023-08-23","paper":"/paper/graph-isomorphism-unet","paper_url":"https://www.sciencedirect.com/science/article/abs/pii/S0957417423017827#preview-section-abstract","paper_title":"Graph isomorphism UNet","code":"https://github.com/aramiracle/GIUNet","n_code_links":1,"syntology":null},{"rank_in_archive_order":38,"model":"GIN","metrics":{"Accuracy":"80%"},"uses_additional_data":false,"paper_date":"2019-12-20","paper":"/paper/a-fair-comparison-of-graph-neural-networks-1","paper_url":"https://arxiv.org/abs/1912.09893v3","paper_title":"A Fair Comparison of Graph Neural Networks for Graph Classification","code":"https://github.com/diningphil/gnn-comparison","n_code_links":5,"syntology":null},{"rank_in_archive_order":39,"model":"S-CGIB","metrics":{"Accuracy":"79.75±0.82"},"uses_additional_data":false,"paper_date":"2025-02-20","paper":"/paper/pre-training-graph-neural-networks-on","paper_url":"https://arxiv.org/abs/2412.15589","paper_title":"Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck","code":"https://github.com/NSLab-CUK/S-CGIB","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":2,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":40,"model":"HGP-SL","metrics":{"Accuracy":"78.45%"},"uses_additional_data":false,"paper_date":"2019-11-14","paper":"/paper/hierarchical-graph-pooling-with-structure","paper_url":"https://arxiv.org/abs/1911.05954v3","paper_title":"Hierarchical Graph Pooling with Structure Learning","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hgp_sl","n_code_links":3,"syntology":null},{"rank_in_archive_order":41,"model":"CapsGNN","metrics":{"Accuracy":"78.35%"},"uses_additional_data":false,"paper_date":"2019-05-01","paper":"/paper/capsule-graph-neural-network","paper_url":"https://openreview.net/forum?id=Byl8BnRcYm","paper_title":"Capsule Graph Neural Network","code":"https://github.com/benedekrozemberczki/CapsGNN","n_code_links":1,"syntology":null},{"rank_in_archive_order":42,"model":"UGT","metrics":{"Accuracy":"77.55 ±0.16%"},"uses_additional_data":false,"paper_date":"2023-08-18","paper":"/paper/transitivity-preserving-graph-representation","paper_url":"https://arxiv.org/abs/2308.09517v1","paper_title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","code":"https://github.com/nslab-cuk/unified-graph-transformer","n_code_links":3,"syntology":{"n_ran":10,"n_unverified":16,"n_samples":26,"n_pointer_only_licence":0}},{"rank_in_archive_order":43,"model":"Local Topological Profile (LTP)","metrics":{"Accuracy":"77.1 ± 3.7","Accuracy (10-fold)":"77.1 ± 3.7"},"uses_additional_data":false,"paper_date":"2023-05-01","paper":"/paper/strengthening-structural-baselines-for-graph","paper_url":"https://arxiv.org/abs/2305.00724v1","paper_title":"Strengthening structural baselines for graph classification using Local Topological Profile","code":"https://github.com/j-adamczyk/ltp","n_code_links":1,"syntology":null},{"rank_in_archive_order":44,"model":"Graphormer","metrics":{"Accuracy":"77.032±1.393"},"uses_additional_data":false,"paper_date":"2021-06-09","paper":"/paper/do-transformers-really-perform-bad-for-graph","paper_url":"https://arxiv.org/abs/2106.05234v5","paper_title":"Do Transformers Really Perform Bad for Graph Representation?","code":"https://github.com/microsoft/Graphormer","n_code_links":5,"syntology":null},{"rank_in_archive_order":45,"model":"WEGL","metrics":{"Accuracy":"76.8%"},"uses_additional_data":false,"paper_date":"2020-06-16","paper":"/paper/wasserstein-embedding-for-graph-learning","paper_url":"https://arxiv.org/abs/2006.09430v2","paper_title":"Wasserstein Embedding for Graph Learning","code":"https://github.com/navid-naderi/WEGL","n_code_links":1,"syntology":null},{"rank_in_archive_order":46,"model":"TokenGT","metrics":{"Accuracy":"76.740±2.054"},"uses_additional_data":false,"paper_date":"2022-07-06","paper":"/paper/pure-transformers-are-powerful-graph-learners","paper_url":"https://arxiv.org/abs/2207.02505v2","paper_title":"Pure Transformers are Powerful Graph Learners","code":"https://github.com/jw9730/tokengt","n_code_links":2,"syntology":{"n_ran":7,"n_unverified":0,"n_samples":7,"n_pointer_only_licence":7}},{"rank_in_archive_order":47,"model":"DGCNN","metrics":{"Accuracy":"76.4%"},"uses_additional_data":false,"paper_date":"2019-12-20","paper":"/paper/a-fair-comparison-of-graph-neural-networks-1","paper_url":"https://arxiv.org/abs/1912.09893v3","paper_title":"A Fair Comparison of Graph Neural Networks for Graph Classification","code":"https://github.com/diningphil/gnn-comparison","n_code_links":5,"syntology":null},{"rank_in_archive_order":48,"model":"PSCN","metrics":{"Accuracy":"76.34%"},"uses_additional_data":false,"paper_date":"2016-05-17","paper":"/paper/learning-convolutional-neural-networks-for","paper_url":"http://arxiv.org/abs/1605.05273v4","paper_title":"Learning Convolutional Neural Networks for Graphs","code":"https://github.com/tvayer/PSCN","n_code_links":2,"syntology":null},{"rank_in_archive_order":49,"model":"k-GNN","metrics":{"Accuracy":"76.2%"},"uses_additional_data":false,"paper_date":"2018-10-04","paper":"/paper/weisfeiler-and-leman-go-neural-higher-order","paper_url":"https://arxiv.org/abs/1810.02244v5","paper_title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","code":"https://github.com/chrsmrrs/k-gnn","n_code_links":1,"syntology":null},{"rank_in_archive_order":50,"model":"TREE-G","metrics":{"Accuracy":"75.9%"},"uses_additional_data":false,"paper_date":"2022-07-06","paper":"/paper/graph-trees-with-attention","paper_url":"https://arxiv.org/abs/2207.02760v5","paper_title":"TREE-G: Decision Trees Contesting Graph Neural Networks","code":"https://github.com/mayabechlerspeicher/tree-g","n_code_links":1,"syntology":{"n_ran":9,"n_unverified":1,"n_samples":10,"n_pointer_only_licence":0}},{"rank_in_archive_order":51,"model":"SF + RFC","metrics":{"Accuracy":"75.2%"},"uses_additional_data":false,"paper_date":"2018-10-22","paper":"/paper/a-simple-baseline-algorithm-for-graph","paper_url":"http://arxiv.org/abs/1810.09155v2","paper_title":"A Simple Baseline Algorithm for Graph Classification","code":"https://github.com/benedekrozemberczki/karateclub","n_code_links":3,"syntology":null},{"rank_in_archive_order":52,"model":"Fea2Fea-s3","metrics":{"Accuracy":"74.9%"},"uses_additional_data":false,"paper_date":"2021-06-24","paper":"/paper/fea2fea-exploring-structural-feature","paper_url":"https://arxiv.org/abs/2106.13061v4","paper_title":"Fea2Fea: Exploring Structural Feature Correlations via Graph Neural Networks","code":"https://github.com/JIAQING-XIE/Fea2Fea","n_code_links":1,"syntology":null},{"rank_in_archive_order":53,"model":"SAEPool_g","metrics":{"Accuracy":"74.48%"},"uses_additional_data":false,"paper_date":"2022-04-06","paper":"/paper/relational-reasoning-over-spatial-temporal","paper_url":"https://ieeexplore.ieee.org/abstract/document/9750933","paper_title":"Relational Reasoning Over Spatial-Temporal Graphs for Video Summarization","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":54,"model":"SAGPool_g","metrics":{"Accuracy":"74.06%"},"uses_additional_data":false,"paper_date":"2019-04-17","paper":"/paper/self-attention-graph-pooling","paper_url":"https://arxiv.org/abs/1904.08082v4","paper_title":"Self-Attention Graph Pooling","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sagpool","n_code_links":3,"syntology":null},{"rank_in_archive_order":55,"model":"NDP","metrics":{"Accuracy":"73.5%"},"uses_additional_data":false,"paper_date":"2019-10-24","paper":"/paper/hierarchical-representation-learning-in-graph","paper_url":"https://arxiv.org/abs/1910.11436v3","paper_title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","code":"https://github.com/danielegrattarola/decimation-pooling","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":56,"model":"2-WL-GNN","metrics":{"Accuracy":"73.5"},"uses_additional_data":false,"paper_date":"2020-07-01","paper":"/paper/a-novel-higher-order-weisfeiler-lehman-graph","paper_url":"https://arxiv.org/abs/2007.00346v2","paper_title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","code":"https://github.com/Cortys/master-thesis","n_code_links":1,"syntology":null},{"rank_in_archive_order":57,"model":"graph2vec","metrics":{"Accuracy":"73.22% ± 1.81%"},"uses_additional_data":false,"paper_date":"2017-07-17","paper":"/paper/graph2vec-learning-distributed","paper_url":"http://arxiv.org/abs/1707.05005v1","paper_title":"graph2vec: Learning Distributed Representations of Graphs","code":"https://github.com/benedekrozemberczki/karateclub","n_code_links":6,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":58,"model":"LDP","metrics":{"Accuracy":"73.0%"},"uses_additional_data":false,"paper_date":"2018-11-08","paper":"/paper/a-simple-yet-effective-baseline-for-non","paper_url":"https://arxiv.org/abs/1811.03508v3","paper_title":"A simple yet effective baseline for non-attributed graph classification","code":"https://github.com/benedekrozemberczki/karateclub","n_code_links":2,"syntology":null},{"rank_in_archive_order":59,"model":"FGW raw sp","metrics":{"Accuracy":"72.82%"},"uses_additional_data":false,"paper_date":"2018-05-23","paper":"/paper/optimal-transport-for-structured-data-with","paper_url":"https://arxiv.org/abs/1805.09114v3","paper_title":"Optimal Transport for structured data with application on graphs","code":"https://github.com/rflamary/POT","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":60,"model":"MAGPool","metrics":{"Accuracy":"72.32%"},"uses_additional_data":false,"paper_date":"2024-03-04","paper":"/paper/multi-hop-attention-based-graph-pooling-a","paper_url":"https://ieeexplore.ieee.org/document/10454077","paper_title":"Multi-hop Attention-based Graph Pooling: A Personalized PageRank Perspective","code":"https://github.com/p-haddadian/MAGPool","n_code_links":1,"syntology":null},{"rank_in_archive_order":61,"model":"ASAP","metrics":{"Accuracy":"71.48"},"uses_additional_data":false,"paper_date":"2019-11-18","paper":"/paper/asap-adaptive-structure-aware-pooling-for","paper_url":"https://arxiv.org/abs/1911.07979v3","paper_title":"ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representations","code":"https://github.com/malllabiisc/ASAP","n_code_links":1,"syntology":null},{"rank_in_archive_order":62,"model":"Deep WL SGN(0,1,2)","metrics":{"Accuracy":"70.26%"},"uses_additional_data":false,"paper_date":"2019-03-21","paper":"/paper/subgraph-networks-with-application-to","paper_url":"https://arxiv.org/abs/1903.09022v3","paper_title":"Subgraph Networks with Application to Structural Feature Space Expansion","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":63,"model":"DGCNN (sum)","metrics":{"Accuracy":"69.00%"},"uses_additional_data":false,"paper_date":"2018-04-29","paper":"/paper/an-end-to-end-deep-learning-architecture-for","paper_url":"https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/viewPaper/17146","paper_title":"An End-to-End Deep Learning Architecture for Graph Classification","code":"https://github.com/muhanzhang/DGCNN","n_code_links":2,"syntology":null},{"rank_in_archive_order":64,"model":"DDGK","metrics":{"Accuracy":"68.1%"},"uses_additional_data":false,"paper_date":"2019-04-21","paper":"/paper/ddgk-learning-graph-representations-for-deep","paper_url":"http://arxiv.org/abs/1904.09671v1","paper_title":"DDGK: Learning Graph Representations for Deep Divergence Graph Kernels","code":"https://github.com/google-research/google-research/tree/master/graph_embedding/ddgk","n_code_links":1,"syntology":null},{"rank_in_archive_order":65,"model":"GAM","metrics":{"Accuracy":"67.71%"},"uses_additional_data":false,"paper_date":"2018-07-19","paper":"/paper/graph-classification-using-structural","paper_url":"https://www.kdd.org/kdd2018/accepted-papers/view/graph-classification-using-structural-attention","paper_title":"Graph Classification using Structural Attention","code":"https://github.com/benedekrozemberczki/GAM","n_code_links":1,"syntology":null},{"rank_in_archive_order":66,"model":"SAGPool_h","metrics":{"Accuracy":"67.45%"},"uses_additional_data":false,"paper_date":"2019-04-17","paper":"/paper/self-attention-graph-pooling","paper_url":"https://arxiv.org/abs/1904.08082v4","paper_title":"Self-Attention Graph Pooling","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sagpool","n_code_links":3,"syntology":null},{"rank_in_archive_order":67,"model":"1-NMFPool","metrics":{"Accuracy":"66.2%"},"uses_additional_data":false,"paper_date":"2019-09-07","paper":"/paper/a-non-negative-factorization-approach-to-node","paper_url":"https://arxiv.org/abs/1909.03287v1","paper_title":"A Non-Negative Factorization approach to node pooling in Graph Convolutional Neural Networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":68,"model":"BC + Capsules","metrics":{"Accuracy":"65.9%"},"uses_additional_data":false,"paper_date":"2019-02-22","paper":"/paper/capsule-neural-networks-for-graph","paper_url":"http://arxiv.org/abs/1902.08399v1","paper_title":"Capsule Neural Networks for Graph Classification using Explicit Tensorial Graph Representations","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":69,"model":"SPI-GCN","metrics":{"Accuracy":"64.11%"},"uses_additional_data":false,"paper_date":"2019-04-08","paper":"/paper/spi-gcn-a-simple-permutation-invariant-graph","paper_url":"https://hal.archives-ouvertes.fr/hal-02093451/","paper_title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","code":null,"n_code_links":0,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,885 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":["Accuracy"],"entries":[{"paper":"/paper/arxiv-2607-01553","paper_title":"X-LogSMask: Expand Transformer for Graph-Structured Data","arxiv_id":"2607.01553","model":"Trans. with X-LogSMask (ours)","row_label":"Trans. with X-LogSMask (ours)","configuration":"Acc.","configuration_in_model":false,"configuration_not_shown_because":"names_the_metric","values":{"Accuracy":"82.24"},"date":"2026-07-02","month_from_arxiv_id":null,"where_in_paper":"Table 6, row “Trans. with X-LogSMask (ours)”","table_label":"6","table_label_from":"the caption's own label","table_position_1based":6,"caption_head":"Table 6: Experimental results on graph-level tasks. The top 1 st and 2^{nd} are…","cells":[{"column":"Accuracy","cell_text":"82.24","column_header":"NCI1 / Acc.","value":82.24,"table_index_0based":5,"row":16,"col":1}],"code":"1 of 1 ran"},{"paper":"/paper/arxiv-2604-17548","paper_title":"Contraction and Hourglass Persistence for Learning on Graphs, Simplices, and Cells","arxiv_id":"2604.17548","model":"NCI1 · GIN · Ours","row_label":"NCI1","configuration":"GIN · Ours","configuration_in_model":true,"configuration_not_shown_because":null,"values":{"Accuracy":"81.51"},"date":"2026-04-19","month_from_arxiv_id":null,"where_in_paper":"Table 2, row “NCI1”","table_label":"2","table_label_from":"the caption's own label","table_position_1based":2,"caption_head":"Table 2: Accuracy (%) with GIN and GCN backbones. […] score per row is in bold…","cells":[{"column":"Accuracy","cell_text":"81.51","column_header":"GIN / Ours","value":81.51,"table_index_0based":1,"row":5,"col":3}],"code":"2 of 4 ran"}]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":24,"rows_with_any_sample_ran":20,"distinct_papers_with_graph_line":21,"distinct_papers_with_any_sample_ran":17,"samples_over_distinct_papers":{"n_ran":174,"n_unverified":178,"n_samples":352,"n_pointer_only_licence":133,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":183,"n_unverified":185,"n_samples":368,"n_pointer_only_licence":144,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}