{"url":"/sota/graph-classification-on-proteins","task":{"name":"Graph Classification","url":"/task/graph-classification","note":null},"dataset":{"name":"PROTEINS","url":"/dataset/proteins"},"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)","Inference Time (ms)"],"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","Inference Time (ms)":"lower"}},"counts":{"rows":103,"rows_with_code":82,"rows_with_paper_page":103,"rows_dated":103,"rows_using_additional_data":1},"rows":[{"rank_in_archive_order":1,"model":"HGP-SL","metrics":{"Accuracy":"84.91"},"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":2,"model":"rLap (unsupervised)","metrics":{"Accuracy":"84.3"},"uses_additional_data":false,"paper_date":"2023-06-06","paper":"/paper/randomized-schur-complement-views-for-graph","paper_url":"https://arxiv.org/abs/2306.04004v1","paper_title":"Randomized Schur Complement Views for Graph Contrastive Learning","code":"https://github.com/kvignesh1420/rlap","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"TFGW ADJ (L=2)","metrics":{"Accuracy":"82.9"},"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":4,"model":"ESA (Edge set attention, no positional encodings)","metrics":{"Accuracy":"82.679±0.799"},"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":5,"model":"FIT-GNN","metrics":{"Accuracy":"82.1","Inference Time (ms)":"0.0016"},"uses_additional_data":false,"paper_date":"2024-10-19","paper":"/paper/faster-inference-time-for-gnns-using","paper_url":"https://arxiv.org/abs/2410.15001v2","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","code":"https://github.com/Roy-Shubhajit/FIT-GNN","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"DUGNN","metrics":{"Accuracy":"81.70%"},"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":"MEWISPool","metrics":{"Accuracy":"80.71%"},"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":8,"model":"CIN++","metrics":{"Accuracy":"80.5"},"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":9,"model":"SAEPool","metrics":{"Accuracy":"80.36%"},"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":10,"model":"MAGPool","metrics":{"Accuracy":"80.36%"},"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":11,"model":"UGT","metrics":{"Accuracy":"80.12 ±0.32"},"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":12,"model":"U2GNN (Unsupervised)","metrics":{"Accuracy":"80.01%"},"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":13,"model":"sGIN","metrics":{"Accuracy":"78.97%"},"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":14,"model":"QS-CNNs (Quantum Walk)","metrics":{"Accuracy":"78.80%"},"uses_additional_data":false,"paper_date":"2019-04-01","paper":"/paper/quantum-based-subgraph-convolutional-neural","paper_url":"https://doi.org/10.1016/j.patcog.2018.11.002","paper_title":"Quantum-based subgraph convolutional neural networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":15,"model":"WKPI-kmeans","metrics":{"Accuracy":"78.8%"},"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":16,"model":"PIN","metrics":{"Accuracy":"78.8%"},"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":17,"model":"hGANet","metrics":{"Accuracy":"78.65%"},"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":18,"model":"U2GNN","metrics":{"Accuracy":"78.53%"},"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":19,"model":"DS-CNNs (Random Walk)","metrics":{"Accuracy":"78.35%"},"uses_additional_data":false,"paper_date":"2019-04-01","paper":"/paper/quantum-based-subgraph-convolutional-neural","paper_url":"https://doi.org/10.1016/j.patcog.2018.11.002","paper_title":"Quantum-based subgraph convolutional neural networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":20,"model":"cGANet","metrics":{"Accuracy":"78.23%"},"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":21,"model":"CAN","metrics":{"Accuracy":"78.2%"},"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":0,"n_unverified":5,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":22,"model":"GANet","metrics":{"Accuracy":"77.92%"},"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":23,"model":"GraphStar","metrics":{"Accuracy":"77.90%"},"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":24,"model":"NERO","metrics":{"Accuracy":"77.89%"},"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":25,"model":"Fea2Fea-s2","metrics":{"Accuracy":"77.8%"},"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":26,"model":"DGA","metrics":{"Accuracy":"77.71%"},"uses_additional_data":false,"paper_date":"2018-11-17","paper":"/paper/discriminative-graph-autoencoder","paper_url":"https://doi.org/10.1109/ICBK.2018.00033","paper_title":"Discriminative Graph Autoencoder","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":27,"model":"Graph U-Nets","metrics":{"Accuracy":"77.68%"},"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":28,"model":"GATv2","metrics":{"Accuracy":"77.679±2.187"},"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":29,"model":"PNA","metrics":{"Accuracy":"77.679±3.281"},"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":30,"model":"GIC","metrics":{"Accuracy":"77.65%"},"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":31,"model":"GIUNet","metrics":{"Accuracy":"77.6%"},"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":32,"model":"GFN-light","metrics":{"Accuracy":"77.44%"},"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":33,"model":"SEAL-SAGE","metrics":{"Accuracy":"77.26%"},"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":34,"model":"PPGN","metrics":{"Accuracy":"77.20%"},"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":35,"model":"GraphGPS","metrics":{"Accuracy":"77.143±1.494"},"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":36,"model":"Weak-supervised ChebyNet","metrics":{"Accuracy":"77.09%"},"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":"SEG-BERT","metrics":{"Accuracy":"77.09%"},"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":38,"model":"GAT-GC (f-Scaled)","metrics":{"Accuracy":"76.81%"},"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":39,"model":"GAT","metrics":{"Accuracy":"76.786±1.670"},"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":40,"model":"Deep WL SGN(0,1,2)","metrics":{"Accuracy":"76.78%"},"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":41,"model":"EigenGCN-3","metrics":{"Accuracy":"76.60%"},"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":42,"model":"Multigraph ChebNet","metrics":{"Accuracy":"76.5%"},"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":43,"model":"WEGL","metrics":{"Accuracy":"76.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":44,"model":"2-WL-GNN","metrics":{"Accuracy":"76.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":45,"model":"GFN","metrics":{"Accuracy":"76.46%"},"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":46,"model":"Shortest-Path Kernel","metrics":{"Accuracy":"76.4%"},"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":47,"model":"GCAPS-CNN","metrics":{"Accuracy":"76.40%"},"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":48,"model":"WL-OA","metrics":{"Accuracy":"76.4%"},"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":49,"model":"MLG","metrics":{"Accuracy":"76.34%"},"uses_additional_data":false,"paper_date":"2016-03-20","paper":"/paper/the-multiscale-laplacian-graph-kernel","paper_url":"http://arxiv.org/abs/1603.06186v2","paper_title":"The Multiscale Laplacian Graph Kernel","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":50,"model":"DAGCN","metrics":{"Accuracy":"76.33%"},"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":51,"model":"CORE-SP","metrics":{"Accuracy":"76.31%"},"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":52,"model":"DropGIN","metrics":{"Accuracy":"76.3%"},"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":53,"model":"CapsGNN","metrics":{"Accuracy":"76.28%"},"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":54,"model":"DGCNN","metrics":{"Accuracy":"76.26%"},"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":55,"model":"GNN (DiffPool)","metrics":{"Accuracy":"76.25%"},"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":56,"model":"R-GIN + PANDA","metrics":{"Accuracy":"76.17"},"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":57,"model":"GCN + PANDA","metrics":{"Accuracy":"76"},"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":58,"model":"R-GCN + PANDA","metrics":{"Accuracy":"76"},"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":59,"model":"k-GNN","metrics":{"Accuracy":"75.9%"},"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":60,"model":"GIN + PANDA","metrics":{"Accuracy":"75.759"},"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":61,"model":"DGK","metrics":{"Accuracy":"75.68%"},"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":62,"model":"Graph-JEPA","metrics":{"Accuracy":"75.67%"},"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":63,"model":"TREE-G","metrics":{"Accuracy":"75.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":64,"model":"GCN","metrics":{"Accuracy":"75.536±1.622"},"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":65,"model":"GIN","metrics":{"Accuracy":"75.536±1.851"},"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":66,"model":"CT-Layer","metrics":{"Accuracy":"75.38%"},"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":67,"model":"P-WL-UC","metrics":{"Accuracy":"75.36%"},"uses_additional_data":false,"paper_date":"2019-06-09","paper":"/paper/a-persistent-weisfeilerlehman-procedure-for","paper_url":"http://proceedings.mlr.press/v97/rieck19a.html","paper_title":"A Persistent Weisfeiler–Lehman Procedure for Graph Classification","code":"https://github.com/BorgwardtLab/P-WL","n_code_links":1,"syntology":null},{"rank_in_archive_order":68,"model":"GAP-Layer (Ncut)","metrics":{"Accuracy":"75.34%"},"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":69,"model":"DiffPool","metrics":{"Accuracy":"75.1%"},"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":70,"model":"DGCNN","metrics":{"Accuracy":"75.1%"},"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":71,"model":"GMT","metrics":{"Accuracy":"75.09%"},"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":72,"model":"GAP-Layer (Rcut)","metrics":{"Accuracy":"75.03%"},"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":73,"model":"PiNet (Learned p and q)","metrics":{"Accuracy":"75%"},"uses_additional_data":false,"paper_date":"2019-05-08","paper":"/paper/pinet-a-permutation-invariant-graph-neural","paper_url":"https://arxiv.org/abs/1905.03046v1","paper_title":"PiNet: A Permutation Invariant Graph Neural Network for Graph Classification","code":"https://github.com/meltzerpete/PiNet","n_code_links":1,"syntology":null},{"rank_in_archive_order":74,"model":"DiffWire","metrics":{"Accuracy":"74.91%"},"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":75,"model":"GDL-g (SP)","metrics":{"Accuracy":"74.86"},"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":76,"model":"VRGC","metrics":{"Accuracy":"74.8%"},"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":77,"model":"LDP + distance","metrics":{"Accuracy":"74.7%"},"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":78,"model":"δ-2-LWL","metrics":{"Accuracy":"74.60%"},"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":79,"model":"FGW sp","metrics":{"Accuracy":"74.55%"},"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":80,"model":"WWL","metrics":{"Accuracy":"74.28%"},"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":81,"model":"RW","metrics":{"Accuracy":"74.22%"},"uses_additional_data":false,"paper_date":"2003-07-18","paper":"/paper/distinguishing-enzyme-structures-from-non","paper_url":"https://doi.org/10.1016/S0022-2836(03)00628-4","paper_title":"Distinguishing Enzyme Structures from Non-enzymes Without Alignments","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":82,"model":"ASAP","metrics":{"Accuracy":"74.19%"},"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":83,"model":"BC + Capsules","metrics":{"Accuracy":"74.1%"},"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":84,"model":"LDP + Labels","metrics":{"Accuracy":"73.7%"},"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":85,"model":"DiffPool","metrics":{"Accuracy":"73.7%"},"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":86,"model":"SF + RFC","metrics":{"Accuracy":"73.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},{"rank_in_archive_order":87,"model":"EdgePool w GraphSAGE","metrics":{"Accuracy":"73.5%"},"uses_additional_data":false,"paper_date":"2019-05-27","paper":"/paper/edge-contraction-pooling-for-graph-neural","paper_url":"https://arxiv.org/abs/1905.10990v1","paper_title":"Edge Contraction Pooling for Graph Neural Networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":88,"model":"Graph2Vec","metrics":{"Accuracy":"73.3%"},"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":89,"model":"graph2vec","metrics":{"Accuracy":"73.3% ± 2.05%"},"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":90,"model":"GraphSAGE","metrics":{"Accuracy":"73%"},"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":91,"model":"Function Space Pooling","metrics":{"Accuracy":"72.8%"},"uses_additional_data":false,"paper_date":"2019-05-15","paper":"/paper/function-space-pooling-for-graph","paper_url":"https://arxiv.org/abs/1905.06259v2","paper_title":"Function Space Pooling For Graph Convolutional Networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":92,"model":"Local Topological Profile (LTP)","metrics":{"Accuracy":"72.7 ± 4.2","Accuracy (10 fold)":"72.7 ± 4.2"},"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":93,"model":"LDP","metrics":{"Accuracy":"72.7%"},"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":94,"model":"EdgePool","metrics":{"Accuracy":"72.5%"},"uses_additional_data":false,"paper_date":"2019-05-27","paper":"/paper/edge-contraction-pooling-for-graph-neural","paper_url":"https://arxiv.org/abs/1905.10990v1","paper_title":"Edge Contraction Pooling for Graph Neural Networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":95,"model":"1-NMFPool","metrics":{"Accuracy":"72.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":96,"model":"SPI-GCN","metrics":{"Accuracy":"72.06%"},"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":97,"model":"SAGPool_h","metrics":{"Accuracy":"71.86%"},"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":98,"model":"GK","metrics":{"Accuracy":"71.67%"},"uses_additional_data":false,"paper_date":"2009-04-16","paper":"/paper/efficient-graphlet-kernels-for-large-graph","paper_url":"http://proceedings.mlr.press/v5/shervashidze09a.html","paper_title":"Efficient graphlet kernels for large graph comparison","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":99,"model":"ApproxRepSet","metrics":{"Accuracy":"70.74%"},"uses_additional_data":false,"paper_date":"2019-04-03","paper":"/paper/rep-the-set-neural-networks-for-learning-set","paper_url":"https://arxiv.org/abs/1904.01962v2","paper_title":"Rep the Set: Neural Networks for Learning Set Representations","code":"https://github.com/giannisnik/repset","n_code_links":1,"syntology":null},{"rank_in_archive_order":100,"model":"SAGPool_g","metrics":{"Accuracy":"70.04%"},"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":101,"model":"Eff.resistance graph  kernel","metrics":{"Accuracy":"65.7% ± 4.2%"},"uses_additional_data":false,"paper_date":"2022-06-19","paper":"/paper/0-1-deep-neural-networks-via-block-coordinate","paper_url":"https://arxiv.org/abs/2206.09379v2","paper_title":"0/1 Deep Neural Networks via Block Coordinate Descent","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":102,"model":"G-Tuning","metrics":{"Accuracy (10 fold)":"72.05"},"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}},{"rank_in_archive_order":103,"model":"GIN-0","metrics":{"Accuracy":"76,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}}],"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":33,"rows_with_any_sample_ran":24,"distinct_papers_with_graph_line":28,"distinct_papers_with_any_sample_ran":19,"samples_over_distinct_papers":{"n_ran":182,"n_unverified":233,"n_samples":415,"n_pointer_only_licence":148,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":210,"n_unverified":246,"n_samples":456,"n_pointer_only_licence":153,"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"}}}