{"url":"/sota/graph-classification-on-enzymes","task":{"name":"Graph Classification","url":"/task/graph-classification","note":null},"dataset":{"name":"ENZYMES","url":"/dataset/enzymes"},"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":54,"rows_with_code":48,"rows_with_paper_page":54,"rows_dated":54,"rows_using_additional_data":1},"rows":[{"rank_in_archive_order":1,"model":"ESA (Edge set attention, no positional encodings)","metrics":{"Accuracy":"79.423±1.658"},"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":2,"model":"GraphGPS","metrics":{"Accuracy":"78.667±4.625"},"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":3,"model":"GAT","metrics":{"Accuracy":"78.611±1.556"},"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":50,"n_unverified":56,"n_samples":106,"n_pointer_only_licence":43}},{"rank_in_archive_order":4,"model":"DSGCN-allfeat","metrics":{"Accuracy":"78.39"},"uses_additional_data":false,"paper_date":"2020-03-26","paper":"/paper/bridging-the-gap-between-spectral-and-spatial","paper_url":"https://arxiv.org/abs/2003.11702v1","paper_title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","code":"https://github.com/balcilar/Spectral-Designed-Graph-Convolutions","n_code_links":2,"syntology":null},{"rank_in_archive_order":5,"model":"GATv2","metrics":{"Accuracy":"77.987±2.112"},"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":6,"n_unverified":10,"n_samples":16,"n_pointer_only_licence":1}},{"rank_in_archive_order":6,"model":"TFGW SP (L=2)","metrics":{"Accuracy":"75.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":7,"model":"GCN","metrics":{"Accuracy":"73.466±4.372"},"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":31,"n_unverified":27,"n_samples":58,"n_pointer_only_licence":22}},{"rank_in_archive_order":8,"model":"Norm-GN","metrics":{"Accuracy":"73.33"},"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":9,"model":"PNA","metrics":{"Accuracy":"73.021±2.512"},"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":10,"model":"GDL-g (SP)","metrics":{"Accuracy":"71.47"},"uses_additional_data":false,"paper_date":"2021-02-12","paper":"/paper/online-graph-dictionary-learning","paper_url":"https://arxiv.org/abs/2102.06555v2","paper_title":"Online Graph Dictionary Learning","code":"https://github.com/cedricvincentcuaz/GDL","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"FGW sp","metrics":{"Accuracy":"71.00%"},"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":12,"model":"GFN","metrics":{"Accuracy":"70.17%"},"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":13,"model":"GIUNet","metrics":{"Accuracy":"70%"},"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":14,"model":"GFN-light","metrics":{"Accuracy":"69.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":15,"model":"HGP-SL","metrics":{"Accuracy":"68.79"},"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":16,"model":"GIN","metrics":{"Accuracy":"68.303±4.170"},"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":17,"model":"G_Inception","metrics":{"Accuracy":"67.50%"},"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":18,"model":"DUGNN","metrics":{"Accuracy":"67.30%"},"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":19,"model":"UGT","metrics":{"Accuracy":"67.22±3.92"},"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":5,"n_unverified":21,"n_samples":26,"n_pointer_only_licence":0}},{"rank_in_archive_order":20,"model":"GraphStar","metrics":{"Accuracy":"67.1%"},"uses_additional_data":false,"paper_date":"2019-06-21","paper":"/paper/graph-star-net-for-generalized-multi-task-1","paper_url":"https://arxiv.org/abs/1906.12330v1","paper_title":"Graph Star Net for Generalized Multi-Task Learning","code":"https://github.com/graph-star-team/graph_star","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":5,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":21,"model":"DSGCN-nodelabel","metrics":{"Accuracy":"65.13"},"uses_additional_data":false,"paper_date":"2020-03-26","paper":"/paper/bridging-the-gap-between-spectral-and-spatial","paper_url":"https://arxiv.org/abs/2003.11702v1","paper_title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","code":"https://github.com/balcilar/Spectral-Designed-Graph-Convolutions","n_code_links":2,"syntology":null},{"rank_in_archive_order":22,"model":"DropGIN","metrics":{"Accuracy":"65.128±4.117"},"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":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":23,"model":"EigenGCN-3","metrics":{"Accuracy":"65.0%"},"uses_additional_data":false,"paper_date":"2019-04-30","paper":"/paper/graph-convolutional-networks-with","paper_url":"https://arxiv.org/abs/1904.13107v2","paper_title":"Graph Convolutional Networks with EigenPooling","code":"https://github.com/alge24/eigenpooling","n_code_links":1,"syntology":null},{"rank_in_archive_order":24,"model":"S2V (with 2 DiffPool)","metrics":{"Accuracy":"63.33%"},"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":"GNN (DiffPool)","metrics":{"Accuracy":"62.53%"},"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":26,"model":"GIC","metrics":{"Accuracy":"62.50%"},"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":27,"model":"Multigraph ChebNet","metrics":{"Accuracy":"61.7%"},"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":"WEGL","metrics":{"Accuracy":"60.5"},"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":29,"model":"GIN","metrics":{"Accuracy":"59.6%"},"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":30,"model":"TREE-G","metrics":{"Accuracy":"59.6"},"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":0,"n_unverified":10,"n_samples":10,"n_pointer_only_licence":0}},{"rank_in_archive_order":31,"model":"WWL","metrics":{"Accuracy":"59.13%"},"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":0,"n_unverified":11,"n_samples":11,"n_pointer_only_licence":0}},{"rank_in_archive_order":32,"model":"GAT-GC (f-Scaled)","metrics":{"Accuracy":"58.45"},"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":"δ-2-LWL","metrics":{"Accuracy":"58.2%"},"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":34,"model":"GraphSAGE","metrics":{"Accuracy":"58.2%"},"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":35,"model":"DAGCN","metrics":{"Accuracy":"58.17%"},"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":36,"model":"Evolution of Graph Classifiers","metrics":{"Accuracy":"55.67"},"uses_additional_data":false,"paper_date":"2019-10-04","paper":"/paper/evolution-of-graph-classifiers","paper_url":"https://ieeexplore.ieee.org/abstract/document/8923110","paper_title":"Evolution of Graph Classifiers","code":"https://github.com/rohand24/GraphCNN_evolution","n_code_links":1,"syntology":null},{"rank_in_archive_order":37,"model":"CapsGNN","metrics":{"Accuracy":"54.67%"},"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":38,"model":"DGK","metrics":{"Accuracy":"53.43%"},"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":39,"model":"R-GIN + PANDA","metrics":{"Accuracy":"53.1"},"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":40,"model":"ECC (5 scores)","metrics":{"Accuracy":"52.67%"},"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":41,"model":"SPI-GCN","metrics":{"Accuracy":"50.17%"},"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},{"rank_in_archive_order":42,"model":"Fea2Fea-s2","metrics":{"Accuracy":"48.5"},"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":43,"model":"VRGC","metrics":{"Accuracy":"48.4%"},"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":44,"model":"GIN + PANDA","metrics":{"Accuracy":"46.2"},"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":45,"model":"NDP","metrics":{"Accuracy":"43.9%"},"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":46,"model":"R-GCN + PANDA","metrics":{"Accuracy":"43.9"},"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":47,"model":"SF + RFC","metrics":{"Accuracy":"43.7%"},"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":48,"model":"Local Topological Profile (LTP)","metrics":{"Accuracy":"42.5 ± 4.1","Accuracy (10-fold)":"42.5 ± 4.1"},"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":49,"model":"LDP","metrics":{"Accuracy":"35.3%"},"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":50,"model":"GCN + PANDA","metrics":{"Accuracy":"31.55"},"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":51,"model":"DEMO-Net(weight)","metrics":{"Accuracy":"27.2"},"uses_additional_data":false,"paper_date":"2019-06-05","paper":"/paper/demo-net-degree-specific-graph-neural","paper_url":"https://arxiv.org/abs/1906.02319v1","paper_title":"DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph Classification","code":"https://github.com/jwu4sml/DEMO-Net","n_code_links":1,"syntology":null},{"rank_in_archive_order":52,"model":"BC + Capsules","metrics":{"Accuracy":"27%"},"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":53,"model":"1-NMFPool","metrics":{"Accuracy":"24.1%"},"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":54,"model":"G-Tuning","metrics":{"Accuracy (10-fold)":"26.70"},"uses_additional_data":false,"paper_date":"2023-12-21","paper":"/paper/fine-tuning-graph-neural-networks-by","paper_url":"https://arxiv.org/abs/2312.13583v1","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","code":"https://github.com/zjunet/G-Tuning","n_code_links":1,"syntology":{"n_ran":13,"n_unverified":0,"n_samples":13,"n_pointer_only_licence":13}}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"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":24,"rows_with_any_sample_ran":17,"distinct_papers_with_graph_line":20,"distinct_papers_with_any_sample_ran":13,"samples_over_distinct_papers":{"n_ran":157,"n_unverified":217,"n_samples":374,"n_pointer_only_licence":137,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":179,"n_unverified":242,"n_samples":421,"n_pointer_only_licence":137,"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"}}}