{"url":"/sota/graph-classification-on-dd","task":{"name":"Graph Classification","url":"/task/graph-classification","note":null},"dataset":{"name":"D&D","url":null},"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"],"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"}},"counts":{"rows":53,"rows_with_code":49,"rows_with_paper_page":53,"rows_dated":53,"rows_using_additional_data":2},"rows":[{"rank_in_archive_order":1,"model":"U2GNN (Unsupervised)","metrics":{"Accuracy":"95.67%"},"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":"MEWISPool","metrics":{"Accuracy":"84.33%"},"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":3,"model":"ESA (Edge set attention, no positional encodings)","metrics":{"Accuracy":"83.529±1.743"},"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":4,"model":"DDGK","metrics":{"Accuracy":"83.14%"},"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":5,"model":"Graph U-Nets","metrics":{"Accuracy":"82.43%"},"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":6,"model":"DUGNN","metrics":{"Accuracy":"82.40%"},"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":7,"model":"S2V (with 2 DiffPool)","metrics":{"Accuracy":"82.07%"},"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":8,"model":"WKPI-kmeans","metrics":{"Accuracy":"82.0%"},"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":9,"model":"hGANet","metrics":{"Accuracy":"81.71%"},"uses_additional_data":true,"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":10,"model":"HGP-SL","metrics":{"Accuracy":"80.96%"},"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":11,"model":"SEAL-SAGE","metrics":{"Accuracy":"80.88%"},"uses_additional_data":false,"paper_date":"2019-04-10","paper":"/paper/semi-supervised-graph-classification-a","paper_url":"http://arxiv.org/abs/1904.05003v1","paper_title":"Semi-Supervised Graph Classification: A Hierarchical Graph Perspective","code":"https://github.com/benedekrozemberczki/SEAL-CI","n_code_links":1,"syntology":null},{"rank_in_archive_order":12,"model":"GNN (DiffPool)","metrics":{"Accuracy":"80.64%"},"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":13,"model":"NERO","metrics":{"Accuracy":"80.45%"},"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":14,"model":"U2GNN","metrics":{"Accuracy":"80.23%"},"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":15,"model":"MAGPool","metrics":{"Accuracy":"79.83%"},"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":16,"model":"WWL","metrics":{"Accuracy":"79.69%"},"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":17,"model":"GraphStar","metrics":{"Accuracy":"79.60%"},"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":18,"model":"DGCNN","metrics":{"Accuracy":"79.37%"},"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":19,"model":"PNA","metrics":{"Accuracy":"78.992±4.407"},"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":20,"model":"Propagation kernels (pk)","metrics":{"Accuracy":"78.8%"},"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":21,"model":"GFN","metrics":{"Accuracy":"78.78%"},"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":22,"model":"DGCNN (sum)","metrics":{"Accuracy":"78.72%"},"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":23,"model":"GMT","metrics":{"Accuracy":"78.72%"},"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":24,"model":"Graph-JEPA","metrics":{"Accuracy":"78.64%"},"uses_additional_data":false,"paper_date":"2023-09-27","paper":"/paper/graph-level-representation-learning-with","paper_url":"https://arxiv.org/abs/2309.16014v3","paper_title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","code":"https://github.com/geriskenderi/graph-jepa","n_code_links":1,"syntology":{"n_ran":10,"n_unverified":1,"n_samples":11,"n_pointer_only_licence":0}},{"rank_in_archive_order":25,"model":"GFN-light","metrics":{"Accuracy":"78.62%"},"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":26,"model":"EigenGCN-3","metrics":{"Accuracy":"78.6%"},"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":27,"model":"WEGL","metrics":{"Accuracy":"78.6%"},"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":28,"model":"Weak-supervised ChebyNet","metrics":{"Accuracy":"78.36%"},"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":29,"model":"DropGIN","metrics":{"Accuracy":"78.151±3.711"},"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":30,"model":"GCN","metrics":{"Accuracy":"78.151±3.465"},"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":31,"model":"GCAPS-CNN","metrics":{"Accuracy":"77.62%"},"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":32,"model":"LDP + distance","metrics":{"Accuracy":"77.5%"},"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":33,"model":"GIN","metrics":{"Accuracy":"77.311±2.223"},"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":34,"model":"DGCNN","metrics":{"Accuracy":"77.21%"},"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":35,"model":"ASAP","metrics":{"Accuracy":"76.87"},"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":36,"model":"DGCNN","metrics":{"Accuracy":"76.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":37,"model":"SAGPool_h","metrics":{"Accuracy":"76.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":38,"model":"PSCN","metrics":{"Accuracy":"76.27%"},"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":39,"model":"TREE-G","metrics":{"Accuracy":"76.2%"},"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":40,"model":"SAGPool_g","metrics":{"Accuracy":"76.19%"},"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":41,"model":"1-NMFPool","metrics":{"Accuracy":"76.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":42,"model":"GATv2","metrics":{"Accuracy":"75.966±2.191"},"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":43,"model":"LDP","metrics":{"Accuracy":"75.5%"},"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":44,"model":"2-WL-GNN","metrics":{"Accuracy":"75.4"},"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":45,"model":"CapsGNN","metrics":{"Accuracy":"75.38%"},"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":46,"model":"BC + Capsules","metrics":{"Accuracy":"74.86%"},"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":47,"model":"ECC (5 scores)","metrics":{"Accuracy":"74.1%"},"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":48,"model":"TokenGT","metrics":{"Accuracy":"73.950±3.361"},"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":49,"model":"DGK","metrics":{"Accuracy":"73.50%"},"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":50,"model":"GAT","metrics":{"Accuracy":"73.109±3.413"},"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":51,"model":"NDP","metrics":{"Accuracy":"72%"},"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":52,"model":"AWE","metrics":{"Accuracy":"71.51%"},"uses_additional_data":false,"paper_date":"2018-05-30","paper":"/paper/anonymous-walk-embeddings","paper_url":"http://arxiv.org/abs/1805.11921v3","paper_title":"Anonymous Walk Embeddings","code":"https://github.com/nd7141/AWE","n_code_links":2,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":53,"model":"SF + RFC","metrics":{"Accuracy":"24.6%"},"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}],"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":21,"rows_with_any_sample_ran":17,"distinct_papers_with_graph_line":19,"distinct_papers_with_any_sample_ran":15,"samples_over_distinct_papers":{"n_ran":158,"n_unverified":176,"n_samples":334,"n_pointer_only_licence":136,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":163,"n_unverified":195,"n_samples":358,"n_pointer_only_licence":136,"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"}}}