{"url":"/sota/graph-classification-on-collab","task":{"name":"Graph Classification","url":"/task/graph-classification","note":null},"dataset":{"name":"COLLAB","url":"/dataset/collab"},"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":39,"rows_with_code":34,"rows_with_paper_page":39,"rows_dated":39,"rows_using_additional_data":1},"rows":[{"rank_in_archive_order":1,"model":"U2GNN (Unsupervised)","metrics":{"Accuracy":"95.62%"},"uses_additional_data":false,"paper_date":"2019-09-26","paper":"/paper/unsupervised-universal-self-attention-network","paper_url":"https://arxiv.org/abs/1909.11855v9","paper_title":"Universal Graph Transformer Self-Attention Networks","code":"https://github.com/daiquocnguyen/Graph-Transformer","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":2,"model":"TFGW ADJ (L=2)","metrics":{"Accuracy":"84.3%"},"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":3,"model":"DUGNN","metrics":{"Accuracy":"84.20%"},"uses_additional_data":true,"paper_date":"2019-09-22","paper":"/paper/190910086","paper_url":"https://arxiv.org/abs/1909.10086v3","paper_title":"Learning Universal Graph Neural Network Embeddings With Aid Of Transfer Learning","code":"https://github.com/vermaMachineLearning/Universal-Graph-Embedding-Neural-Network","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"G_DenseNet","metrics":{"Accuracy":"83.16%"},"uses_additional_data":false,"paper_date":"2018-07-07","paper":"/paper/when-work-matters-transforming-classical","paper_url":"http://arxiv.org/abs/1807.02653v1","paper_title":"When Work Matters: Transforming Classical Network Structures to Graph CNN","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":5,"model":"GFN","metrics":{"Accuracy":"81.50%"},"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":6,"model":"PPGN","metrics":{"Accuracy":"81.38%"},"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":0,"n_unverified":8,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":7,"model":"GFN-light","metrics":{"Accuracy":"81.34%"},"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":8,"model":"FactorGCN","metrics":{"Accuracy":"81.2%","Accuracy (10-fold)":"81.2%"},"uses_additional_data":false,"paper_date":"2020-10-12","paper":"/paper/factorizable-graph-convolutional-networks","paper_url":"https://arxiv.org/abs/2010.05421v1","paper_title":"Factorizable Graph Convolutional Networks","code":"https://github.com/ihollywhy/FactorGCN.PyTorch","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"GMT","metrics":{"Accuracy":"80.74%"},"uses_additional_data":false,"paper_date":"2021-02-23","paper":"/paper/accurate-learning-of-graph-representations-1","paper_url":"https://arxiv.org/abs/2102.11533v4","paper_title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","code":"https://github.com/JinheonBaek/GMT","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":1,"n_samples":5,"n_pointer_only_licence":5}},{"rank_in_archive_order":10,"model":"sGIN","metrics":{"Accuracy":"80.71%"},"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":11,"model":"GCN","metrics":{"Accuracy":"80.6%"},"uses_additional_data":false,"paper_date":"2019-03-06","paper":"/paper/fast-graph-representation-learning-with","paper_url":"http://arxiv.org/abs/1903.02428v3","paper_title":"Fast Graph Representation Learning with PyTorch Geometric","code":"https://github.com/rusty1s/pytorch_geometric","n_code_links":6,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"Self-supervised GraphMAE","metrics":{"Accuracy":"80.32%"},"uses_additional_data":false,"paper_date":"2022-05-22","paper":"/paper/graphmae-self-supervised-masked-graph","paper_url":"https://arxiv.org/abs/2205.10803v3","paper_title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","code":"https://github.com/thudm/graphmae","n_code_links":3,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":13,"model":"GIN-0","metrics":{"Accuracy":"80.2%"},"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":14,"model":"WEGL","metrics":{"Accuracy":"79.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":15,"model":"MEWISPool","metrics":{"Accuracy":"79.66%"},"uses_additional_data":false,"paper_date":"2021-07-03","paper":"/paper/maximum-entropy-weighted-independent-set","paper_url":"https://arxiv.org/abs/2107.01410v1","paper_title":"Maximum Entropy Weighted Independent Set Pooling for Graph Neural Networks","code":"https://github.com/mewispool/mewispool","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":16,"model":"CapsGNN","metrics":{"Accuracy":"79.62%"},"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":17,"model":"Local Topological Profile (LTP)","metrics":{"Accuracy":"79.4 ± 2.5","Accuracy (10-fold)":"79.4 ± 2.5"},"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":18,"model":"NDP","metrics":{"Accuracy":"79.1%"},"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":19,"model":"SEG-BERT","metrics":{"Accuracy":"78.42%"},"uses_additional_data":false,"paper_date":"2020-02-09","paper":"/paper/segmented-graph-bert-for-graph-instance","paper_url":"https://arxiv.org/abs/2002.03283v1","paper_title":"Segmented Graph-Bert for Graph Instance Modeling","code":"https://github.com/jwzhanggy/SEG-BERT","n_code_links":1,"syntology":null},{"rank_in_archive_order":20,"model":"U2GNN","metrics":{"Accuracy":"77.84%"},"uses_additional_data":false,"paper_date":"2019-09-26","paper":"/paper/unsupervised-universal-self-attention-network","paper_url":"https://arxiv.org/abs/1909.11855v9","paper_title":"Universal Graph Transformer Self-Attention Networks","code":"https://github.com/daiquocnguyen/Graph-Transformer","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":21,"model":"R-GIN + PANDA","metrics":{"Accuracy":"77.8%"},"uses_additional_data":false,"paper_date":"2024-06-06","paper":"/paper/panda-expanded-width-aware-message-passing","paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","code":"https://github.com/jeongwhanchoi/panda","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":22,"model":"Graph U-Nets","metrics":{"Accuracy":"77.56%"},"uses_additional_data":false,"paper_date":"2019-05-11","paper":"/paper/graph-u-nets","paper_url":"https://arxiv.org/abs/1905.05178v1","paper_title":"Graph U-Nets","code":"https://github.com/HongyangGao/gunet","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":1,"n_samples":4,"n_pointer_only_licence":2}},{"rank_in_archive_order":23,"model":"hGANet","metrics":{"Accuracy":"77.48%"},"uses_additional_data":false,"paper_date":"2019-07-05","paper":"/paper/graph-representation-learning-via-hard-and","paper_url":"https://arxiv.org/abs/1907.04652v1","paper_title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hardgat","n_code_links":1,"syntology":null},{"rank_in_archive_order":24,"model":"GNN (DiffPool)","metrics":{"Accuracy":"75.48%"},"uses_additional_data":false,"paper_date":"2018-06-22","paper":"/paper/hierarchical-graph-representation-learning","paper_url":"http://arxiv.org/abs/1806.08804v4","paper_title":"Hierarchical Graph Representation Learning with Differentiable Pooling","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/diffpool","n_code_links":14,"syntology":{"n_ran":1,"n_unverified":19,"n_samples":20,"n_pointer_only_licence":0}},{"rank_in_archive_order":25,"model":"GIN + PANDA","metrics":{"Accuracy":"75.11%"},"uses_additional_data":false,"paper_date":"2024-06-06","paper":"/paper/panda-expanded-width-aware-message-passing","paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","code":"https://github.com/jeongwhanchoi/panda","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":26,"model":"GraphSAGE","metrics":{"Accuracy":"73.9%"},"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":27,"model":"DGCNN","metrics":{"Accuracy":"73.76%"},"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":28,"model":"DGK","metrics":{"Accuracy":"73.09%"},"uses_additional_data":false,"paper_date":"2015-08-10","paper":"/paper/deep-graph-kernels","paper_url":"https://www.semanticscholar.org/paper/Deep-Graph-Kernels-Yanardag-Vishwanathan/8ccd0adb1a00358ede79f1d9bdcce472dc1cb8d4","paper_title":"Deep Graph Kernels","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":29,"model":"DiffWire","metrics":{"Accuracy":"72.24%"},"uses_additional_data":false,"paper_date":"2022-06-15","paper":"/paper/diffwire-inductive-graph-rewiring-via-the","paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","code":"https://github.com/ellisalicante/GraphRewiring-Tutorial","n_code_links":2,"syntology":null},{"rank_in_archive_order":30,"model":"2D CNN","metrics":{"Accuracy":"71.76%"},"uses_additional_data":false,"paper_date":"2017-07-29","paper":"/paper/graph-classification-with-2d-convolutional","paper_url":"https://arxiv.org/abs/1708.02218v4","paper_title":"Graph Classification with 2D Convolutional Neural Networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":31,"model":"R-GCN + PANDA","metrics":{"Accuracy":"71.4%"},"uses_additional_data":false,"paper_date":"2024-06-06","paper":"/paper/panda-expanded-width-aware-message-passing","paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","code":"https://github.com/jeongwhanchoi/panda","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":32,"model":"CT-Layer","metrics":{"Accuracy":"69.87%"},"uses_additional_data":false,"paper_date":"2022-06-15","paper":"/paper/diffwire-inductive-graph-rewiring-via-the","paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","code":"https://github.com/ellisalicante/GraphRewiring-Tutorial","n_code_links":2,"syntology":null},{"rank_in_archive_order":33,"model":"DGCNN (sum)","metrics":{"Accuracy":"69.45%"},"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":34,"model":"GCN + PANDA","metrics":{"Accuracy":"68.4%"},"uses_additional_data":false,"paper_date":"2024-06-06","paper":"/paper/panda-expanded-width-aware-message-passing","paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","code":"https://github.com/jeongwhanchoi/panda","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":35,"model":"DGCNN","metrics":{"Accuracy":"68.34%"},"uses_additional_data":false,"paper_date":"2017-12-10","paper":"/paper/dgcnn-disordered-graph-convolutional-neural","paper_url":"http://arxiv.org/abs/1712.03563v1","paper_title":"DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":36,"model":"Weak-supervised ChebyNet","metrics":{"Accuracy":"66.97%"},"uses_additional_data":false,"paper_date":"2019-05-08","paper":"/paper/understanding-attention-in-graph-neural","paper_url":"https://arxiv.org/abs/1905.02850v3","paper_title":"Understanding Attention and Generalization in Graph Neural Networks","code":"https://github.com/bknyaz/graph_nn","n_code_links":2,"syntology":null},{"rank_in_archive_order":37,"model":"GAP-Layer (Ncut)","metrics":{"Accuracy":"65.89%"},"uses_additional_data":false,"paper_date":"2022-06-15","paper":"/paper/diffwire-inductive-graph-rewiring-via-the","paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","code":"https://github.com/ellisalicante/GraphRewiring-Tutorial","n_code_links":2,"syntology":null},{"rank_in_archive_order":38,"model":"1-NMFPool","metrics":{"Accuracy":"65.0%"},"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":39,"model":"GAP-Layer (Rcut)","metrics":{"Accuracy":"64.47%"},"uses_additional_data":false,"paper_date":"2022-06-15","paper":"/paper/diffwire-inductive-graph-rewiring-via-the","paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","code":"https://github.com/ellisalicante/GraphRewiring-Tutorial","n_code_links":2,"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,264 of the 9,581 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":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+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":16,"rows_with_any_sample_ran":14,"distinct_papers_with_graph_line":12,"distinct_papers_with_any_sample_ran":10,"samples_over_distinct_papers":{"n_ran":29,"n_unverified":41,"n_samples":70,"n_pointer_only_licence":18,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":54,"n_unverified":47,"n_samples":101,"n_pointer_only_licence":18,"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"}}}