{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/sota/graph-classification-on-mutag","task":{"name":"Graph Classification","url":"/task/graph-classification","note":null},"dataset":{"name":"MUTAG","url":"/dataset/mutag"},"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)","Mean Accuracy","Accuracy (10 fold)"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction; the tokens 'score' and 'time' are not used on this page); null = not inferred, chart draws points only","by_metric":{"Accuracy":"higher","Accuracy (10-fold)":"higher","Mean Accuracy":"higher","Accuracy (10 fold)":"higher"}},"counts":{"rows":74,"rows_with_code":65,"rows_with_paper_page":74,"rows_dated":74,"rows_using_additional_data":5},"rows":[{"rank_in_archive_order":1,"model":"Evolution of Graph Classifiers","metrics":{"Accuracy":"100.00%","Accuracy (10-fold)":"100"},"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,"official":null,"syntology":null},{"rank_in_archive_order":2,"model":"MEWISPool","metrics":{"Accuracy":"96.66%"},"uses_additional_data":false,"paper_date":"2021-07-03","paper":"/paper/maximum-entropy-weighted-independent-set","paper_url":"https://arxiv.org/abs/2107.01410v1","paper_title":"Maximum Entropy Weighted Independent Set Pooling for Graph Neural Networks","code":"https://github.com/mewispool/mewispool","n_code_links":1,"official":{"repos":["mewispool/mewispool"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/maximum-entropy-weighted-independent-set#ran","syntology_url":"https://syntology.ai/paper/2107.01410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01410"}}}},{"rank_in_archive_order":3,"model":"TFGW ADJ (L=2)","metrics":{"Accuracy":"96.4%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":4,"model":"GIUNet","metrics":{"Accuracy":"95.7%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":5,"model":"G_Inception","metrics":{"Accuracy":"95.00%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":6,"model":"GIC","metrics":{"Accuracy":"94.44%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":7,"model":"CIN++","metrics":{"Accuracy":"94.4%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":8,"model":"sGIN","metrics":{"Accuracy":"94.14%"},"uses_additional_data":true,"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,"official":null,"syntology":null},{"rank_in_archive_order":9,"model":"CAN","metrics":{"Accuracy":"94.1%"},"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,"official":{"repos":["lrnzgiusti/can"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_samples":5,"n_pointer_only_licence":0,"sample_list":"/paper/cell-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2209.08179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08179"}}}},{"rank_in_archive_order":10,"model":"Deep WL SGN(0,1,2)","metrics":{"Accuracy":"93.68%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":11,"model":"QS-CNNs (Quantum Walk)","metrics":{"Accuracy":"93.13%","Accuracy (10-fold)":"93.13"},"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,"official":null,"syntology":null},{"rank_in_archive_order":12,"model":"PATCHY-SAN","metrics":{"Accuracy":"92.63%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":13,"model":"DDGK","metrics":{"Accuracy":"91.58%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":14,"model":"Graph-JEPA","metrics":{"Accuracy":"91.25%"},"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,"official":{"repos":["geriskenderi/graph-jepa"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":1,"n_samples":11,"n_pointer_only_licence":4,"sample_list":"/paper/graph-level-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/2309.16014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16014"}}}},{"rank_in_archive_order":15,"model":"GraphStar","metrics":{"Accuracy":"91.2%"},"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,"official":null,"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_samples":6,"n_pointer_only_licence":1,"sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}}}},{"rank_in_archive_order":16,"model":"TREE-G","metrics":{"Accuracy":"91.1%"},"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,"official":{"repos":["mayabechlerspeicher/tree-g"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_samples":10,"n_pointer_only_licence":0,"sample_list":"/paper/graph-trees-with-attention#ran","syntology_url":"https://syntology.ai/paper/2207.02760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02760"}}}},{"rank_in_archive_order":17,"model":"SEG-BERT","metrics":{"Accuracy":"90.85%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":18,"model":"GFN","metrics":{"Accuracy":"90.84%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":19,"model":"PPGN","metrics":{"Accuracy":"90.55%"},"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,"official":null,"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_samples":8,"n_pointer_only_licence":0,"sample_list":"/paper/provably-powerful-graph-networks#ran","syntology_url":"https://syntology.ai/paper/1905.11136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11136"}}}},{"rank_in_archive_order":20,"model":"GAT-GC (f-Scaled)","metrics":{"Accuracy":"90.44%"},"uses_additional_data":true,"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,"official":{"repos":["zetayue/CPA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/improving-attention-mechanism-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1907.02204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02204"}}}},{"rank_in_archive_order":21,"model":"DropGIN","metrics":{"Accuracy":"90.4%"},"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,"official":{"repos":["karolismart/dropgnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":0,"sample_list":"/paper/dropgnn-random-dropouts-increase-the#ran","syntology_url":"https://syntology.ai/paper/2111.06283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06283"}}}},{"rank_in_archive_order":22,"model":"LDP","metrics":{"Accuracy":"90.1%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":23,"model":"R-GCN + PANDA","metrics":{"Accuracy":"90.05%"},"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,"official":{"repos":["jeongwhanchoi/panda"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"syntology":{"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":3,"sample_list":"/paper/panda-expanded-width-aware-message-passing#ran","syntology_url":"https://syntology.ai/paper/2406.03671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03671"}}}},{"rank_in_archive_order":24,"model":"hGANet","metrics":{"Accuracy":"90.00%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":25,"model":"U2GNN","metrics":{"Accuracy":"89.97%"},"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,"official":{"repos":["daiquocnguyen/Graph-Transformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":0,"sample_list":"/paper/unsupervised-universal-self-attention-network#ran","syntology_url":"https://syntology.ai/paper/1909.11855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11855"}}}},{"rank_in_archive_order":26,"model":"FactorGCN","metrics":{"Accuracy":"89.9%","Accuracy (10-fold)":"89.9%"},"uses_additional_data":false,"paper_date":"2020-10-12","paper":"/paper/factorizable-graph-convolutional-networks","paper_url":"https://arxiv.org/abs/2010.05421v1","paper_title":"Factorizable Graph Convolutional Networks","code":"https://github.com/ihollywhy/FactorGCN.PyTorch","n_code_links":1,"official":{"repos":["ihollywhy/FactorGCN.PyTorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0,"sample_list":"/paper/factorizable-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2010.05421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05421"}}}},{"rank_in_archive_order":27,"model":"GFN-light","metrics":{"Accuracy":"89.89%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":28,"model":"GIN-0","metrics":{"Accuracy":"89.4%"},"uses_additional_data":true,"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,"official":{"repos":["weihua916/powerful-gnns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"syntology":{"n_ran":6,"n_constructed":2,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_samples":10,"n_pointer_only_licence":5,"sample_list":"/paper/how-powerful-are-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.00826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.00826"}}}},{"rank_in_archive_order":29,"model":"Multigraph ChebNet","metrics":{"Accuracy":"89.1%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":30,"model":"InfoGraph","metrics":{"Accuracy":"89.01%"},"uses_additional_data":false,"paper_date":"2019-07-31","paper":"/paper/infograph-unsupervised-and-semi-supervised","paper_url":"https://arxiv.org/abs/1908.01000v3","paper_title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/infograph","n_code_links":5,"official":null,"syntology":null},{"rank_in_archive_order":31,"model":"PSCN","metrics":{"Accuracy":"88.95%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":32,"model":"BC + Capsules","metrics":{"Accuracy":"88.9%"},"uses_additional_data":false,"paper_date":"2019-02-22","paper":"/paper/capsule-neural-networks-for-graph","paper_url":"http://arxiv.org/abs/1902.08399v1","paper_title":"Capsule Neural Networks for Graph Classification using Explicit Tensorial Graph Representations","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":33,"model":"edGNN (max)","metrics":{"Accuracy":"88.8%"},"uses_additional_data":false,"paper_date":"2019-04-18","paper":"/paper/edgnn-a-simple-and-powerful-gnn-for-directed","paper_url":"https://arxiv.org/abs/1904.08745v2","paper_title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs","code":"https://github.com/guillaumejaume/edGNN","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":34,"model":"GIN + PANDA","metrics":{"Accuracy":"88.75%"},"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,"official":{"repos":["jeongwhanchoi/panda"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"syntology":{"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":3,"sample_list":"/paper/panda-expanded-width-aware-message-passing#ran","syntology_url":"https://syntology.ai/paper/2406.03671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03671"}}}},{"rank_in_archive_order":35,"model":"NERO","metrics":{"Accuracy":"88.68%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":36,"model":"Path up to length h","metrics":{"Accuracy":"88.47%"},"uses_additional_data":false,"paper_date":"2019-03-01","paper":"/paper/graph-kernels-based-on-linear-patterns","paper_url":"https://hal-normandie-univ.archives-ouvertes.fr/hal-02053946/","paper_title":"Graph Kernels Based on Linear Patterns: Theoretical and Experimental Comparisons","code":"https://github.com/jajupmochi/graphkit-learn","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":37,"model":"U2GNN (Unsupervised)","metrics":{"Accuracy":"88.47%"},"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,"official":{"repos":["daiquocnguyen/Graph-Transformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":0,"sample_list":"/paper/unsupervised-universal-self-attention-network#ran","syntology_url":"https://syntology.ai/paper/1909.11855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11855"}}}},{"rank_in_archive_order":38,"model":"FGW wl h=4 sp","metrics":{"Accuracy":"88.42%"},"uses_additional_data":false,"paper_date":"2018-05-23","paper":"/paper/optimal-transport-for-structured-data-with","paper_url":"https://arxiv.org/abs/1805.09114v3","paper_title":"Optimal Transport for structured data with application on graphs","code":"https://github.com/rflamary/POT","n_code_links":2,"official":null,"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3,"sample_list":"/paper/optimal-transport-for-structured-data-with#ran","syntology_url":"https://syntology.ai/paper/1805.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09114"}}}},{"rank_in_archive_order":39,"model":"SF + RFC","metrics":{"Accuracy":"88.4%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":40,"model":"ECC (5 scores)","metrics":{"Accuracy":"88.33%"},"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,"official":{"repos":["mys007/ecc"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0,"sample_list":"/paper/dynamic-edge-conditioned-filters-in#ran","syntology_url":"https://syntology.ai/paper/1704.02901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.02901"}}}},{"rank_in_archive_order":41,"model":"WEGL","metrics":{"Accuracy":"88.3%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":42,"model":"R-GIN + PANDA","metrics":{"Accuracy":"88.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,"official":{"repos":["jeongwhanchoi/panda"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"syntology":{"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":3,"sample_list":"/paper/panda-expanded-width-aware-message-passing#ran","syntology_url":"https://syntology.ai/paper/2406.03671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03671"}}}},{"rank_in_archive_order":43,"model":"AWE","metrics":{"Accuracy":"87.87%"},"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,"official":{"repos":["nd7141/AWE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":0,"sample_list":"/paper/anonymous-walk-embeddings#ran","syntology_url":"https://syntology.ai/paper/1805.11921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11921"}}}},{"rank_in_archive_order":44,"model":"Graphlet Kernel","metrics":{"Accuracy":"87.7%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":45,"model":"CT-Layer","metrics":{"Accuracy":"87.58%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":46,"model":"WKPI-kcenters","metrics":{"Accuracy":"87.5%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":47,"model":"DGK","metrics":{"Accuracy":"87.44%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":48,"model":"WWL","metrics":{"Accuracy":"87.27%"},"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,"official":{"repos":["BorgwardtLab/WWL"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]},"syntology":{"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":6,"n_samples":11,"n_pointer_only_licence":0,"sample_list":"/paper/wasserstein-weisfeiler-lehman-graph-kernels#ran","syntology_url":"https://syntology.ai/paper/1906.01277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01277"}}}},{"rank_in_archive_order":49,"model":"DAGCN","metrics":{"Accuracy":"87.22%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":50,"model":"GDL-g (SP)","metrics":{"Accuracy":"87.09%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":51,"model":"edGNN (avg)","metrics":{"Accuracy":"86.9%"},"uses_additional_data":false,"paper_date":"2019-04-18","paper":"/paper/edgnn-a-simple-and-powerful-gnn-for-directed","paper_url":"https://arxiv.org/abs/1904.08745v2","paper_title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs","code":"https://github.com/guillaumejaume/edGNN","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":52,"model":"GAP-Layer (Rcut)","metrics":{"Accuracy":"86.9%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":53,"model":"GAP-Layer (Ncut)","metrics":{"Accuracy":"86.9%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":54,"model":"CapsGNN","metrics":{"Accuracy":"86.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,"official":null,"syntology":null},{"rank_in_archive_order":55,"model":"FGW wl h=2 sp","metrics":{"Accuracy":"86.42%"},"uses_additional_data":false,"paper_date":"2018-05-23","paper":"/paper/optimal-transport-for-structured-data-with","paper_url":"https://arxiv.org/abs/1805.09114v3","paper_title":"Optimal Transport for structured data with application on graphs","code":"https://github.com/rflamary/POT","n_code_links":2,"official":null,"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3,"sample_list":"/paper/optimal-transport-for-structured-data-with#ran","syntology_url":"https://syntology.ai/paper/1805.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09114"}}}},{"rank_in_archive_order":56,"model":"ApproxRepSet","metrics":{"Accuracy":"86.33%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":57,"model":"VRGC","metrics":{"Accuracy":"86.3%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":58,"model":"k-GNN","metrics":{"Accuracy":"86.1%"},"uses_additional_data":false,"paper_date":"2018-10-04","paper":"/paper/weisfeiler-and-leman-go-neural-higher-order","paper_url":"https://arxiv.org/abs/1810.02244v5","paper_title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","code":"https://github.com/chrsmrrs/k-gnn","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":59,"model":"DGCNN","metrics":{"Accuracy":"85.83%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":60,"model":"GCN + PANDA","metrics":{"Accuracy":"85.75%"},"uses_additional_data":true,"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,"official":{"repos":["jeongwhanchoi/panda"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"syntology":{"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":3,"sample_list":"/paper/panda-expanded-width-aware-message-passing#ran","syntology_url":"https://syntology.ai/paper/2406.03671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03671"}}}},{"rank_in_archive_order":61,"model":"GIN-0","metrics":{"Accuracy":"85.7%"},"uses_additional_data":true,"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,"official":{"repos":["rusty1s/pytorch_geometric"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0,"sample_list":"/paper/fast-graph-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/1903.02428","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.02428"}}}},{"rank_in_archive_order":62,"model":"NDP","metrics":{"Accuracy":"84.7%"},"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,"official":{"repos":["danielegrattarola/decimation-pooling"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1,"sample_list":"/paper/hierarchical-representation-learning-in-graph#ran","syntology_url":"https://syntology.ai/paper/1910.11436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11436"}}}},{"rank_in_archive_order":63,"model":"Propagation kernels (pk)","metrics":{"Accuracy":"84.5%"},"uses_additional_data":false,"paper_date":"2019-02-01","paper":"/paper/propagation-kernels-efficient-graph-kernels","paper_url":"https://doi.org/10.1007/s10994-015-5517-9","paper_title":"Propagation kernels: efficient graph kernels from propagated information","code":"https://github.com/marionmari/propagation_kernels","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":64,"model":"WL-OA","metrics":{"Accuracy":"84.5%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":65,"model":"SPI-GCN","metrics":{"Accuracy":"84.40%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":66,"model":"GMT","metrics":{"Accuracy":"83.44%"},"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,"official":{"repos":["JinheonBaek/GMT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_samples":5,"n_pointer_only_licence":5,"sample_list":"/paper/accurate-learning-of-graph-representations-1#ran","syntology_url":"https://syntology.ai/paper/2102.11533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11533"}}}},{"rank_in_archive_order":67,"model":"Function Space Pooling","metrics":{"Accuracy":"83.3%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":68,"model":"Function Space Pooling","metrics":{"Accuracy":"83.3%"},"uses_additional_data":false,"paper_date":"2019-07-22","paper":"/paper/isonn-isomorphic-neural-network-for-graph","paper_url":"https://arxiv.org/abs/1907.09495v2","paper_title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","code":"https://github.com/linmengsysu/IsoNN","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":69,"model":"FGW raw sp","metrics":{"Accuracy":"83.26%"},"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,"official":null,"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3,"sample_list":"/paper/optimal-transport-for-structured-data-with#ran","syntology_url":"https://syntology.ai/paper/1805.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09114"}}}},{"rank_in_archive_order":70,"model":"graph2vec","metrics":{"Accuracy":"83.15% ± 9.25%"},"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,"official":null,"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/graph2vec-learning-distributed#ran","syntology_url":"https://syntology.ai/paper/1707.05005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.05005"}}}},{"rank_in_archive_order":71,"model":"EigenGCN-3","metrics":{"Accuracy":"79.5%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":72,"model":"GDL-g (ADJ)","metrics":{"Accuracy":"58.45%"},"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,"official":null,"syntology":null},{"rank_in_archive_order":73,"model":"P-WL-C","metrics":{"Mean Accuracy":"90.51"},"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,"official":null,"syntology":null},{"rank_in_archive_order":74,"model":"G-Tuning","metrics":{"Accuracy (10 fold)":"86.14"},"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,"official":{"repos":["zjunet/G-Tuning"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":0,"n_samples":13,"n_pointer_only_licence":13,"sample_list":"/paper/fine-tuning-graph-neural-networks-by#ran","syntology_url":"https://syntology.ai/paper/2312.13583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13583"}}}}],"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,"adjudicator":"Claude Opus 5.5","adjudicator_from":"groundwork/59_code_with_papers/LB_EXTRACTOR_PREREG.md (not recorded in lb_measurement.json; the file's frozen_commit, measured_on and counts equal the run the pre-registration records)","adjudicator_sensitivity":[69,70],"adjudicator_specificity":[101,103],"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication by a model (adjudicator) of accepted entries on a held-out split of archive papers, rules frozen before the test; adjudicator_sensitivity and adjudicator_specificity are its own controls as [judged right, of]; it was not measured on the newer papers placed here","measurement_sentence":"Measured before publishing, on held-out archive papers: the extractor was given 883 of them and produced output for 881 (the other 2 had no title and were excluded before any model call, so they are not part of this measurement). A model adjudicator (Claude Opus 5.5), blind to which entries were real, judged 108 of 110 accepted entries correct on those held-out archive papers; its own controls: 69 of 70 archive-confirmed entries judged true, 101 of 103 corrupted copies judged false. It was not measured on the newer papers whose results are placed on this site.","coverage":{"sentence":"Syntology has checked 8,886 of the 18,637 papers on this site that are newer than the archive (for 3,717 of them no archive leaderboard matched the paper's tables, so there was nothing further to check); 733 were read and have nothing to place (arXiv has no HTML version of the paper, or that version has no tables), 41 could not be read (the extractor's reply could not be parsed), and results from the other 8,977 appear after they are checked.","complete":false,"papers_newer_than_archive":18637,"papers_checked":8886,"papers_checked_no_leaderboard_matched":3717,"papers_read_nothing_to_place":733,"papers_could_not_be_read":41,"papers_could_not_be_read_by_status":{"unparseable":41},"papers_extracted_not_yet_verified":0,"boards_without_verdict":3,"papers_not_yet_extracted":8975},"board_status":{"sentence":"Of the 8,888 newer papers whose tables Syntology has read (8,886 checked in full and 2 with a leaderboard still awaiting a verdict), 15 had this board among the leaderboards the extractor considered for their tables (it keeps at most 10 boards per paper and 4 per dataset; the lists of 1,584 of the 8,888 were already full without this board, so if it was crowded out of them it is not counted), and 10 proposed a result; of those 10, 8 gave no cell that passed the extractor's own checks, 2 were rejected by the independent check, 0 await a verdict and 0 were placed.","note":"papers, from the extractor's own records, over the newer papers whose tables were read; proposed = no_cell_passed_checks + rejected_by_independent_check + accepted_not_placed + awaiting_verdict + placed; counts, never a rate","eligible":true,"eligible_note":"false when the extractor never considers this board: it loads only boards with archive rows and at least one metric column (lb_extract.py Boards), so no newer paper can be proposed here; archive_rows and metric_columns say which","archive_rows":74,"metric_columns":4,"papers_read":8888,"papers_read_checked":8886,"papers_read_awaiting_verdict":2,"papers_read_verified":8888,"papers_read_not_yet_verified":0,"papers_read_at_candidate_cap":1596,"papers_read_list_full_without_this_board":1584,"candidates":15,"candidates_capped_note":"candidates = papers that had this board among the leaderboards the extractor considered for their tables; the extractor keeps at most 10 per paper and 4 per dataset, so a board crowded out of a paper's list is not counted and candidates is a floor; papers_read_list_full_without_this_board counts the read papers whose list did not hold this board and had reached 10, or held 4 boards of this board's dataset (the only papers that could have crowded it out); papers_read_at_candidate_cap counts, over every board, the papers whose list reached 10","proposed":10,"no_cell_passed_checks":8,"rejected_by_independent_check":2,"accepted_not_placed":0,"awaiting_verdict":0,"placed":0,"placed_entries_listed":0,"file_lines_unreadable_as_read":0,"since_line":"Since the archive (Syntology): none placed; 10 newer papers judged to report on this board so far"},"judged_to_report":{"heading":"Newer papers whose tables Claude Sonnet 4.5 judged to report on this benchmark (a model's judgement, not a result; newest first by arXiv id)","judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"a_record_without_a_model":false,"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here","order":"newest first by arXiv id (the identifier's order, not a rank)","outcomes":{"placed":"placed","no_cell_passed_checks":"no cell passed the extractor's checks","refused_by_rule":"refused by a rule","rejected":"rejected by the independent check","accepted_not_placed":"accepted by the independent check but not placed by this site","awaiting":"awaiting a verdict"},"reason_note":"for refused_by_rule, the rules' plain words for the reason codes the record gives (never the quoted or the actual cell text); null for every other outcome","total":10,"shown_on_page":10,"no_cell_split":{"no_cell_passed_checks_in_ledger":8,"rows_refused_by_rule":8,"rows_no_cell_passed_checks":0},"rows":[{"arxiv_id":"2607.01553","outcome":"rejected","reason":null},{"arxiv_id":"2606.21333","outcome":"refused_by_rule","reason":"the row is an ablation variant, not the method itself"},{"arxiv_id":"2606.15207","outcome":"refused_by_rule","reason":"the model gave no value to check against the cell"},{"arxiv_id":"2605.14884","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at; the model pointed at a header row"},{"arxiv_id":"2605.00725","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2603.24131","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2601.22943","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2601.20815","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2601.01123","outcome":"rejected","reason":null},{"arxiv_id":"2510.03690","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"}]},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per row: of M harvested code samples from that row's paper, n_ran executed on a synthesized fixture (n_ran = n_ran_checked + n_instrument; n_instrument counts failures of Syntology's instrument, not of the code); the other M - n_ran 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).","key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"rows_with_graph_line":27,"rows_with_any_sample_ran":25,"rows_with_a_run_with_no_instrument_failure":24,"official":{"state_rule":"the archive's official repositories have samples for this paper that ran: 'official (archive's flag): N ran' (N counts them, instrument failures included); they have samples, none ran: 'official: harvested, nothing ran'; they have no sample for this paper and another sample ran: 'community repositories only' when every sample that ran came from a repository the archive lists for the paper but neither marks official nor records as mentioned in it, or one Syntology harvested outside the archive's links, else 'official: no sample here; runs from other or unrecorded repositories' (a repository named in the paper or found in its text by Syntology, or no repository recorded); otherwise 'official: harvested for another paper' or 'official: not harvested'. Absent when the archive marks no repository official. Official is the archive's is_official flag, not an authorship verdict","flag":"the archive's is_official flag for the paper's code link; not a verdict on who wrote the code","rows_with_an_archive_official_repository":21,"rows_whose_official_repository_has_a_sample_that_ran":18,"rows_whose_official_repository_has_a_run_with_no_instrument_failure":18,"rows_community_repositories_only":1,"rows_runs_from_other_or_unrecorded_repositories":0,"note":"rows[].official, per row with a graph line: repos (marked official in the archive), state, n_ran and n_unverified (samples from those repositories), and ran_from_kinds (the kinds of repository the paper's samples that ran came from; 'unlocated' is no repository recorded)"},"filters":{"ran_modes":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"the page's filters hide rows and never renumber them; they read the Ran cell's counts, the same figures rows[].syntology and rows[].official carry"},"row_route":"rows[].syntology carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","distinct_papers_with_graph_line":21,"distinct_papers_with_any_sample_ran":19,"distinct_papers_with_a_run_with_no_instrument_failure":18,"samples_over_distinct_papers":{"n_ran":81,"n_constructed":7,"n_ran_checked":62,"n_instrument":19,"n_unverified":32,"n_samples":113,"n_pointer_only_licence":39,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":112,"n_constructed":7,"n_ran_checked":77,"n_instrument":35,"n_unverified":38,"n_samples":150,"n_pointer_only_licence":54,"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"}},"record_sha256":"fa1edf953015b916cc1ed4df1f7b1dc54ffc6053a752aabba9aced97b708f882","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}