{"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/node-classification-on-citeseer","task":{"name":"Node Classification","url":"/task/node-classification","note":null},"dataset":{"name":"Citeseer","url":"/dataset/citeseer"},"category":"Graphs","categories":["Graphs"],"category_note":null,"description":"**Node Classification** is a machine learning task in graph-based data analysis, where the goal is to assign labels to nodes in a graph based on the properties of nodes and the relationships between them.\r\n\r\n**Node Classification** models aim to predict non-existing node properties (known as the target property) based on other node properties. Typical models used for node classification consists of a large family of graph neural networks. Model performance can be measured using benchmark datasets like [Cora](/dataset/cora), [Citeseer](/dataset/citeseer), and [Pubmed](/dataset/pubmed), among others, typically using Accuracy and F1.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Fast Graph Representation Learning With PyTorch Geometric](https://arxiv.org/pdf/1903.02428v3.pdf) )</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","Training Split","Validation","1:1 Accuracy","Accuracy (%)","Inference Time (ms)"],"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","Training Split":null,"Validation":null,"1:1 Accuracy":"higher","Accuracy (%)":"higher","Inference Time (ms)":null}},"counts":{"rows":71,"rows_with_code":59,"rows_with_paper_page":71,"rows_dated":71,"rows_using_additional_data":3},"rows":[{"rank_in_archive_order":1,"model":"ACMII-Snowball-2","metrics":{"Accuracy":"82.07 ± 1.04"},"uses_additional_data":false,"paper_date":"2021-09-12","paper":"/paper/is-heterophily-a-real-nightmare-for-graph","paper_url":"https://arxiv.org/abs/2109.05641v1","paper_title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":2,"model":"ACM-GCN","metrics":{"Accuracy":"81.68 ± 0.97"},"uses_additional_data":false,"paper_date":"2021-09-12","paper":"/paper/is-heterophily-a-real-nightmare-for-graph","paper_url":"https://arxiv.org/abs/2109.05641v1","paper_title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":3,"model":"ACM-Snowball-2","metrics":{"Accuracy":"81.58 ± 1.23"},"uses_additional_data":false,"paper_date":"2021-09-12","paper":"/paper/is-heterophily-a-real-nightmare-for-graph","paper_url":"https://arxiv.org/abs/2109.05641v1","paper_title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":4,"model":"ACMII-Snowball-3","metrics":{"Accuracy":"81.56 ± 1.15"},"uses_additional_data":false,"paper_date":"2021-09-12","paper":"/paper/is-heterophily-a-real-nightmare-for-graph","paper_url":"https://arxiv.org/abs/2109.05641v1","paper_title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":5,"model":"SSP","metrics":{"Accuracy":"80.52 ± 0.14"},"uses_additional_data":false,"paper_date":"2020-08-21","paper":"/paper/optimization-of-graph-neural-networks-with","paper_url":"https://arxiv.org/abs/2008.09624v1","paper_title":"Optimization of Graph Neural Networks with Natural Gradient Descent","code":"https://github.com/russellizadi/ssp","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":6,"model":"NodeNet","metrics":{"Accuracy":"80.09%"},"uses_additional_data":false,"paper_date":"2020-06-16","paper":"/paper/nodenet-a-graph-regularised-neural-network","paper_url":"https://arxiv.org/abs/2006.09022v1","paper_title":"NodeNet: A Graph Regularised Neural Network for Node Classification","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":7,"model":"SplineCNN","metrics":{"Accuracy":"79.20%"},"uses_additional_data":false,"paper_date":"2017-11-24","paper":"/paper/splinecnn-fast-geometric-deep-learning-with","paper_url":"http://arxiv.org/abs/1711.08920v2","paper_title":"SplineCNN: Fast Geometric Deep Learning with Continuous B-Spline Kernels","code":"https://github.com/rusty1s/pytorch_geometric","n_code_links":5,"official":null,"syntology":null},{"rank_in_archive_order":8,"model":"GCN-LPA","metrics":{"Accuracy":"78.7 ± 0.6"},"uses_additional_data":false,"paper_date":"2020-02-17","paper":"/paper/unifying-graph-convolutional-neural-networks-1","paper_url":"https://arxiv.org/abs/2002.06755v1","paper_title":"Unifying Graph Convolutional Neural Networks and Label Propagation","code":"https://github.com/hwwang55/GCN-LPA","n_code_links":2,"official":null,"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":5,"n_samples":14,"n_pointer_only_licence":0,"sample_list":"/paper/unifying-graph-convolutional-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2002.06755","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06755"}}}},{"rank_in_archive_order":9,"model":"Graph-MLP + SWA","metrics":{"Accuracy":"77.99 ± 1.57%"},"uses_additional_data":false,"paper_date":"2023-06-15","paper":"/paper/the-split-matters-flat-minima-methods-for","paper_url":"https://arxiv.org/abs/2306.09121v1","paper_title":"The Split Matters: Flat Minima Methods for Improving the Performance of GNNs","code":"https://github.com/foisunt/fmms-in-gnns","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":10,"model":"CNMPGNN","metrics":{"Accuracy":"76.81±1.40"},"uses_additional_data":false,"paper_date":"2021-11-15","paper":"/paper/cn-motifs-perceptive-graph-neural-networks","paper_url":"https://ieeexplore.ieee.org/document/9606682","paper_title":"CN-Motifs Perceptive Graph Neural Networks","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":11,"model":"CGT","metrics":{"Accuracy":"76.59±0.98"},"uses_additional_data":false,"paper_date":"2023-12-28","paper":"/paper/mitigating-degree-biases-in-message-passing","paper_url":"https://arxiv.org/abs/2312.16788v1","paper_title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","code":"https://github.com/nslab-cuk/community-aware-graph-transformer","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":12,"model":"3ference","metrics":{"Accuracy":"76.33"},"uses_additional_data":false,"paper_date":"2022-04-11","paper":"/paper/inferring-from-references-with-differences","paper_url":"https://www.mdpi.com/2227-7390/10/8/1262/htm","paper_title":"Inferring from References with Differences for Semi-Supervised Node Classification on Graphs","code":"https://github.com/cf020031308/3ference","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":13,"model":"MMA","metrics":{"Accuracy":"76.30%"},"uses_additional_data":false,"paper_date":"2022-11-24","paper":"/paper/multi-mask-aggregators-for-graph-neural","paper_url":"https://openreview.net/forum?id=hZ3b8CskgC","paper_title":"Multi-Mask Aggregators for Graph Neural Networks","code":"https://github.com/asarigun/mma","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":14,"model":"AdaGCN","metrics":{"Accuracy":"76.22 ± 0.20"},"uses_additional_data":true,"paper_date":"2019-08-14","paper":"/paper/adagcn-adaboosting-graph-convolutional","paper_url":"https://arxiv.org/abs/1908.05081v3","paper_title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","code":"https://github.com/datake/AdaGCN","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":15,"model":"UGT","metrics":{"Accuracy":"76.08±2.5"},"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,"official":{"repos":["nslab-cuk/unified-graph-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]},"syntology":{"n_ran":19,"n_constructed":0,"n_ran_checked":13,"n_instrument":6,"n_unverified":7,"n_samples":26,"n_pointer_only_licence":0,"sample_list":"/paper/transitivity-preserving-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2308.09517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09517"}}}},{"rank_in_archive_order":16,"model":"PPNP","metrics":{"Accuracy":"75.83%","Validation":"YES"},"uses_additional_data":true,"paper_date":"2018-10-14","paper":"/paper/predict-then-propagate-graph-neural-networks","paper_url":"https://arxiv.org/abs/1810.05997v6","paper_title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/appnp","n_code_links":5,"official":{"repos":["klicperajo/ppnp"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":1,"n_samples":12,"n_pointer_only_licence":1,"sample_list":"/paper/predict-then-propagate-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.05997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.05997"}}}},{"rank_in_archive_order":17,"model":"CoLinkDist","metrics":{"Accuracy":"75.79%"},"uses_additional_data":false,"paper_date":"2021-06-16","paper":"/paper/distilling-self-knowledge-from-contrastive","paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","code":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py","n_code_links":2,"official":{"repos":["cf020031308/LinkDist"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1,"sample_list":"/paper/distilling-self-knowledge-from-contrastive#ran","syntology_url":"https://syntology.ai/paper/2106.08541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08541"}}}},{"rank_in_archive_order":18,"model":"CoLinkDistMLP","metrics":{"Accuracy":"75.77%"},"uses_additional_data":false,"paper_date":"2021-06-16","paper":"/paper/distilling-self-knowledge-from-contrastive","paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","code":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py","n_code_links":2,"official":{"repos":["cf020031308/LinkDist"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1,"sample_list":"/paper/distilling-self-knowledge-from-contrastive#ran","syntology_url":"https://syntology.ai/paper/2106.08541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08541"}}}},{"rank_in_archive_order":19,"model":"APPNP","metrics":{"Accuracy":"75.73%"},"uses_additional_data":true,"paper_date":"2018-10-14","paper":"/paper/predict-then-propagate-graph-neural-networks","paper_url":"https://arxiv.org/abs/1810.05997v6","paper_title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/appnp","n_code_links":5,"official":{"repos":["klicperajo/ppnp"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":1,"n_samples":12,"n_pointer_only_licence":1,"sample_list":"/paper/predict-then-propagate-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.05997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.05997"}}}},{"rank_in_archive_order":20,"model":"Cleora","metrics":{"Accuracy":"75.7"},"uses_additional_data":false,"paper_date":"2021-02-03","paper":"/paper/cleora-a-simple-strong-and-scalable-graph","paper_url":"https://arxiv.org/abs/2102.02302v1","paper_title":"Cleora: A Simple, Strong and Scalable Graph Embedding Scheme","code":"https://github.com/Synerise/cleora","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":21,"model":"PairE","metrics":{"Accuracy":"75.53"},"uses_additional_data":false,"paper_date":"2022-03-03","paper":"/paper/graph-representation-learning-beyond-node-and","paper_url":"https://arxiv.org/abs/2203.01564v1","paper_title":"Graph Representation Learning Beyond Node and Homophily","code":"https://github.com/syvail/PairE-Graph-Representation-Learning-Beyond-Node-and-Homophily","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":22,"model":"LinkDistMLP","metrics":{"Accuracy":"75.25%"},"uses_additional_data":false,"paper_date":"2021-06-16","paper":"/paper/distilling-self-knowledge-from-contrastive","paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","code":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py","n_code_links":2,"official":{"repos":["cf020031308/LinkDist"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1,"sample_list":"/paper/distilling-self-knowledge-from-contrastive#ran","syntology_url":"https://syntology.ai/paper/2106.08541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08541"}}}},{"rank_in_archive_order":23,"model":"LDS-GNN","metrics":{"Accuracy":"75.0"},"uses_additional_data":false,"paper_date":"2019-03-28","paper":"/paper/learning-discrete-structures-for-graph-neural","paper_url":"https://arxiv.org/abs/1903.11960v4","paper_title":"Learning Discrete Structures for Graph Neural Networks","code":"https://github.com/lucfra/LDS","n_code_links":2,"official":{"repos":["lucfra/LDS","lucfra/LDS-GNN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"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":2,"sample_list":"/paper/learning-discrete-structures-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1903.11960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.11960"}}}},{"rank_in_archive_order":24,"model":"LinkDist","metrics":{"Accuracy":"74.72%"},"uses_additional_data":false,"paper_date":"2021-06-16","paper":"/paper/distilling-self-knowledge-from-contrastive","paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","code":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py","n_code_links":2,"official":{"repos":["cf020031308/LinkDist"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1,"sample_list":"/paper/distilling-self-knowledge-from-contrastive#ran","syntology_url":"https://syntology.ai/paper/2106.08541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08541"}}}},{"rank_in_archive_order":25,"model":"DFNet-ATT","metrics":{"Accuracy":"74.7 ± 0.4"},"uses_additional_data":false,"paper_date":"2019-10-24","paper":"/paper/dfnets-spectral-cnns-for-graphs-with-feedback","paper_url":"https://arxiv.org/abs/1910.10866v5","paper_title":"DFNets: Spectral CNNs for Graphs with Feedback-Looped Filters","code":"https://github.com/wokas36/DFNets","n_code_links":1,"official":{"repos":["wokas36/DFNets"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"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/dfnets-spectral-cnns-for-graphs-with-feedback#ran","syntology_url":"https://syntology.ai/paper/1910.10866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10866"}}}},{"rank_in_archive_order":26,"model":"G3NN","metrics":{"Accuracy":"74.5%","Training Split":"20 per node with early stopping set","Validation":"YES"},"uses_additional_data":false,"paper_date":"2019-05-26","paper":"/paper/a-flexible-generative-framework-for-graph","paper_url":"https://arxiv.org/abs/1905.10769v2","paper_title":"A Flexible Generative Framework for Graph-based Semi-supervised Learning","code":"https://github.com/jiaqima/G3NN","n_code_links":1,"official":{"repos":["jiaqima/G3NN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/a-flexible-generative-framework-for-graph#ran","syntology_url":"https://syntology.ai/paper/1905.10769","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10769"}}}},{"rank_in_archive_order":27,"model":"DNAConv","metrics":{"Accuracy":"74.50%"},"uses_additional_data":false,"paper_date":"2019-04-09","paper":"/paper/just-jump-dynamic-neighborhood-aggregation-in","paper_url":"http://arxiv.org/abs/1904.04849v2","paper_title":"Just Jump: Dynamic Neighborhood Aggregation in Graph Neural Networks","code":"https://github.com/rusty1s/pytorch_geometric","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":28,"model":"TREE-G","metrics":{"Accuracy":"74.5"},"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":29,"model":"GResNet(LoopyNet)","metrics":{"Accuracy":"73.7%"},"uses_additional_data":false,"paper_date":"2019-09-12","paper":"/paper/gresnet-graph-residuals-for-reviving-deep","paper_url":"https://arxiv.org/abs/1909.05729v2","paper_title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","code":"https://github.com/anonymous-sourcecode/GResNet","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":30,"model":"GraphVAT","metrics":{"Accuracy":"73.7%"},"uses_additional_data":false,"paper_date":"2019-02-20","paper":"/paper/graph-adversarial-training-dynamically","paper_url":"https://arxiv.org/abs/1902.08226v2","paper_title":"Graph Adversarial Training: Dynamically Regularizing Based on Graph Structure","code":"https://github.com/fulifeng/GraphAT","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":31,"model":"SPF-GCN","metrics":{"Accuracy":"73.5%"},"uses_additional_data":false,"paper_date":"2019-07-02","paper":"/paper/structure-fusion-based-on-graph-convolutional","paper_url":"https://arxiv.org/abs/1907.02586v1","paper_title":"Structure fusion based on graph convolutional networks for semi-supervised classification","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":32,"model":"GResNet(GAT)","metrics":{"Accuracy":"73.5%"},"uses_additional_data":false,"paper_date":"2019-09-12","paper":"/paper/gresnet-graph-residuals-for-reviving-deep","paper_url":"https://arxiv.org/abs/1909.05729v2","paper_title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","code":"https://github.com/anonymous-sourcecode/GResNet","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":33,"model":"SF-GCN","metrics":{"Accuracy":"73.4%"},"uses_additional_data":false,"paper_date":"2019-07-02","paper":"/paper/structure-fusion-based-on-graph-convolutional","paper_url":"https://arxiv.org/abs/1907.02586v1","paper_title":"Structure fusion based on graph convolutional networks for semi-supervised classification","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":34,"model":"GCN (PPR Diffusion)","metrics":{"Accuracy":"73.35%"},"uses_additional_data":false,"paper_date":"2019-10-28","paper":"/paper/diffusion-improves-graph-learning-1","paper_url":"https://arxiv.org/abs/1911.05485v6","paper_title":"Diffusion Improves Graph Learning","code":"https://github.com/klicperajo/gdc","n_code_links":3,"official":{"repos":["klicperajo/gdc"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":2,"sample_list":"/paper/diffusion-improves-graph-learning-1#ran","syntology_url":"https://syntology.ai/paper/1911.05485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.05485"}}}},{"rank_in_archive_order":35,"model":"Graph U-Nets","metrics":{"Accuracy":"73.2 ± 0.5%"},"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,"official":{"repos":["HongyangGao/gunet"],"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":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_samples":4,"n_pointer_only_licence":2,"sample_list":"/paper/graph-u-nets#ran","syntology_url":"https://syntology.ai/paper/1905.05178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05178"}}}},{"rank_in_archive_order":36,"model":"GraphNAS","metrics":{"Accuracy":"73.1 ± 0.9%"},"uses_additional_data":false,"paper_date":"2019-04-22","paper":"/paper/graphnas-graph-neural-architecture-search","paper_url":"https://arxiv.org/abs/1904.09981v2","paper_title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","code":"https://github.com/GraphNAS/GraphNAS-simple","n_code_links":1,"official":{"repos":["GraphNAS/GraphNAS-simple"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]},"syntology":{"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_samples":8,"n_pointer_only_licence":0,"sample_list":"/paper/graphnas-graph-neural-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1904.09981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09981"}}}},{"rank_in_archive_order":37,"model":"LGCN sub","metrics":{"Accuracy":"73.0 ± 0.6%"},"uses_additional_data":false,"paper_date":"2018-08-12","paper":"/paper/large-scale-learnable-graph-convolutional","paper_url":"http://arxiv.org/abs/1808.03965v1","paper_title":"Large-Scale Learnable Graph Convolutional Networks","code":"https://github.com/divelab/lgcn","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":38,"model":"hpGAT","metrics":{"Accuracy":"73.0%"},"uses_additional_data":false,"paper_date":"2019-08-28","paper":"/paper/hpgat-high-order-proximity-informed-graph","paper_url":"https://doi.org/10.1109/ACCESS.2019.2938039","paper_title":"hpGAT: High-order Proximity Informed Graph Attention Network","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":39,"model":"GResNet(GCN)","metrics":{"Accuracy":"72.7%"},"uses_additional_data":false,"paper_date":"2019-09-12","paper":"/paper/gresnet-graph-residuals-for-reviving-deep","paper_url":"https://arxiv.org/abs/1909.05729v2","paper_title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","code":"https://github.com/anonymous-sourcecode/GResNet","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":40,"model":"DifNet","metrics":{"Accuracy":"72.7%"},"uses_additional_data":false,"paper_date":"2020-01-22","paper":"/paper/get-rid-of-suspended-animation-problem-deep","paper_url":"https://arxiv.org/abs/2001.07922v1","paper_title":"Get Rid of Suspended Animation Problem: Deep Diffusive Neural Network on Graph Semi-Supervised Classification","code":"https://github.com/jwzhanggy/DifNet","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":41,"model":"SDRF","metrics":{"Accuracy":"72.58±0.20"},"uses_additional_data":false,"paper_date":"2021-11-29","paper":"/paper/understanding-over-squashing-and-bottlenecks-1","paper_url":"https://arxiv.org/abs/2111.14522v3","paper_title":"Understanding over-squashing and bottlenecks on graphs via curvature","code":"https://github.com/jctops/understanding-oversquashing","n_code_links":4,"official":{"repos":["jctops/understanding-oversquashing"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_samples":5,"n_pointer_only_licence":0,"sample_list":"/paper/understanding-over-squashing-and-bottlenecks-1#ran","syntology_url":"https://syntology.ai/paper/2111.14522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.14522"}}}},{"rank_in_archive_order":42,"model":"GAT","metrics":{"Accuracy":"72.5 ± 0.7%","Training Split":"fixed 20 per node","Validation":"YES"},"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,"official":{"repos":["PetarV-/GAT"],"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":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_samples":106,"n_pointer_only_licence":46,"sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}}}},{"rank_in_archive_order":43,"model":"CT-Layer (PE)","metrics":{"Accuracy":"72.26"},"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":44,"model":"N-GCN","metrics":{"Accuracy":"72.2%"},"uses_additional_data":false,"paper_date":"2018-02-24","paper":"/paper/n-gcn-multi-scale-graph-convolution-for-semi","paper_url":"http://arxiv.org/abs/1802.08888v1","paper_title":"N-GCN: Multi-scale Graph Convolution for Semi-supervised Node Classification","code":"https://github.com/samihaija/mixhop","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":45,"model":"GRACE","metrics":{"Accuracy":"72.1 ± 0.5"},"uses_additional_data":false,"paper_date":"2020-06-07","paper":"/paper/deep-graph-contrastive-representation","paper_url":"https://arxiv.org/abs/2006.04131v2","paper_title":"Deep Graph Contrastive Representation Learning","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/grace","n_code_links":3,"official":{"repos":["CRIPAC-DIG/GRACE"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]},"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1,"sample_list":"/paper/deep-graph-contrastive-representation#ran","syntology_url":"https://syntology.ai/paper/2006.04131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04131"}}}},{"rank_in_archive_order":46,"model":"Graph InfoClust (GIC)","metrics":{"Accuracy":"71.9 ± 1.4"},"uses_additional_data":false,"paper_date":"2020-09-15","paper":"/paper/graph-infoclust-leveraging-cluster-level-node","paper_url":"https://arxiv.org/abs/2009.06946v1","paper_title":"Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning","code":"https://github.com/cmavro/Graph-InfoClust-GIC","n_code_links":2,"official":null,"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":1,"sample_list":"/paper/graph-infoclust-leveraging-cluster-level-node#ran","syntology_url":"https://syntology.ai/paper/2009.06946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.06946"}}}},{"rank_in_archive_order":47,"model":"MTGAE","metrics":{"Accuracy":"71.80%","Validation":"YES"},"uses_additional_data":false,"paper_date":"2018-11-07","paper":"/paper/multi-task-graph-autoencoders","paper_url":"http://arxiv.org/abs/1811.02798v1","paper_title":"Multi-Task Graph Autoencoders","code":"https://github.com/vuptran/graph-representation-learning","n_code_links":1,"official":{"repos":["vuptran/graph-representation-learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_samples":9,"n_pointer_only_licence":1,"sample_list":"/paper/multi-task-graph-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1811.02798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.02798"}}}},{"rank_in_archive_order":48,"model":"DGI","metrics":{"Accuracy":"71.8 ± 0.7%"},"uses_additional_data":false,"paper_date":"2018-09-27","paper":"/paper/deep-graph-infomax","paper_url":"http://arxiv.org/abs/1809.10341v2","paper_title":"Deep Graph Infomax","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/dgi","n_code_links":11,"official":{"repos":["PetarV-/DGI"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]},"syntology":{"n_ran":26,"n_constructed":11,"n_ran_checked":22,"n_instrument":4,"n_unverified":9,"n_samples":35,"n_pointer_only_licence":10,"sample_list":"/paper/deep-graph-infomax#ran","syntology_url":"https://syntology.ai/paper/1809.10341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.10341"}}}},{"rank_in_archive_order":49,"model":"GOCN","metrics":{"Accuracy":"71.8%"},"uses_additional_data":false,"paper_date":"2019-04-26","paper":"/paper/graph-optimized-convolutional-networks","paper_url":"https://arxiv.org/abs/1904.11883v2","paper_title":"Robust Graph Data Learning via Latent Graph Convolutional Representation","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":50,"model":"GLNN","metrics":{"Accuracy":"71.77± 2.01"},"uses_additional_data":false,"paper_date":"2021-10-17","paper":"/paper/graph-less-neural-networks-teaching-old-mlps-1","paper_url":"https://arxiv.org/abs/2110.08727v2","paper_title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","code":"https://github.com/snap-research/graphless-neural-networks","n_code_links":1,"official":{"repos":["snap-research/graphless-neural-networks"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_samples":8,"n_pointer_only_licence":8,"sample_list":"/paper/graph-less-neural-networks-teaching-old-mlps-1#ran","syntology_url":"https://syntology.ai/paper/2110.08727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.08727"}}}},{"rank_in_archive_order":51,"model":"GWNN","metrics":{"Accuracy":"71.7%"},"uses_additional_data":false,"paper_date":"2019-04-12","paper":"/paper/graph-wavelet-neural-network-1","paper_url":"http://arxiv.org/abs/1904.07785v1","paper_title":"Graph Wavelet Neural Network","code":"https://github.com/benedekrozemberczki/GraphWaveletNeuralNetwork","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":52,"model":"alpha-LoNGAE","metrics":{"Accuracy":"71.60%"},"uses_additional_data":false,"paper_date":"2018-02-23","paper":"/paper/learning-to-make-predictions-on-graphs-with","paper_url":"http://arxiv.org/abs/1802.08352v2","paper_title":"Learning to Make Predictions on Graphs with Autoencoders","code":"https://github.com/vuptran/graph-representation-learning","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":53,"model":"LoopyNet","metrics":{"Accuracy":"71.6%"},"uses_additional_data":false,"paper_date":"2019-09-12","paper":"/paper/gresnet-graph-residuals-for-reviving-deep","paper_url":"https://arxiv.org/abs/1909.05729v2","paper_title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","code":"https://github.com/anonymous-sourcecode/GResNet","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":54,"model":"MixHop","metrics":{"Accuracy":"71.4%","Training Split":"20 per node","Validation":"YES"},"uses_additional_data":false,"paper_date":"2019-04-30","paper":"/paper/mixhop-higher-order-graph-convolution","paper_url":"https://arxiv.org/abs/1905.00067v3","paper_title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/mixhop","n_code_links":3,"official":null,"syntology":null},{"rank_in_archive_order":55,"model":"Graph-Bert","metrics":{"Accuracy":"71.2%"},"uses_additional_data":false,"paper_date":"2020-01-15","paper":"/paper/graph-bert-only-attention-is-needed-for","paper_url":"https://arxiv.org/abs/2001.05140v2","paper_title":"Graph-Bert: Only Attention is Needed for Learning Graph Representations","code":"https://github.com/jwzhanggy/Graph-Bert","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":56,"model":"GraphStar","metrics":{"Accuracy":"71.0"},"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":57,"model":"Graphite","metrics":{"Accuracy":"71.0 ± 0.07"},"uses_additional_data":false,"paper_date":"2018-03-28","paper":"/paper/graphite-iterative-generative-modeling-of","paper_url":"https://arxiv.org/abs/1803.10459v4","paper_title":"Graphite: Iterative Generative Modeling of Graphs","code":"https://github.com/ermongroup/graphite","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":58,"model":"GCN","metrics":{"Accuracy":"70.3"},"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,"official":{"repos":["tkipf/pygcn"],"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":39,"n_constructed":13,"n_ran_checked":34,"n_instrument":5,"n_unverified":19,"n_samples":58,"n_pointer_only_licence":23,"sample_list":"/paper/semi-supervised-classification-with-graph#ran","syntology_url":"https://syntology.ai/paper/1609.02907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02907"}}}},{"rank_in_archive_order":59,"model":"APPNP","metrics":{"Accuracy":"70.0 ± 1.4"},"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,"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":60,"model":"ChebNet","metrics":{"Accuracy":"69.8%"},"uses_additional_data":false,"paper_date":"2016-06-30","paper":"/paper/convolutional-neural-networks-on-graphs-with","paper_url":"http://arxiv.org/abs/1606.09375v3","paper_title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","code":"https://github.com/mdeff/cnn_graph","n_code_links":5,"official":{"repos":["mdeff/cnn_graph"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_samples":6,"n_pointer_only_licence":2,"sample_list":"/paper/convolutional-neural-networks-on-graphs-with#ran","syntology_url":"https://syntology.ai/paper/1606.09375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.09375"}}}},{"rank_in_archive_order":61,"model":"GCN + AdaGraph (AG)","metrics":{"Accuracy":"69.7%"},"uses_additional_data":false,"paper_date":"2019-09-07","paper":"/paper/measuring-and-relieving-the-over-smoothing","paper_url":"https://arxiv.org/abs/1909.03211v2","paper_title":"Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological View","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":62,"model":"GNN RH-U","metrics":{"Accuracy":"68%"},"uses_additional_data":false,"paper_date":"2019-06-28","paper":"/paper/certifiable-robustness-and-robust-training","paper_url":"https://arxiv.org/abs/1906.12269v1","paper_title":"Certifiable Robustness and Robust Training for Graph Convolutional Networks","code":"https://github.com/danielzuegner/robust-gcn","n_code_links":1,"official":null,"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":0,"sample_list":"/paper/certifiable-robustness-and-robust-training#ran","syntology_url":"https://syntology.ai/paper/1906.12269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12269"}}}},{"rank_in_archive_order":63,"model":"CT-Layer","metrics":{"Accuracy":"66.71"},"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":64,"model":"SNoRe","metrics":{"Accuracy":"66.6"},"uses_additional_data":false,"paper_date":"2020-09-08","paper":"/paper/snore-scalable-unsupervised-learning-of","paper_url":"https://arxiv.org/abs/2009.04535v2","paper_title":"SNoRe: Scalable Unsupervised Learning of Symbolic Node Representations","code":"https://github.com/smeznar/SNoRe","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":65,"model":"Planetoid*","metrics":{"Accuracy":"64.7%"},"uses_additional_data":false,"paper_date":"2016-03-29","paper":"/paper/revisiting-semi-supervised-learning-with","paper_url":"http://arxiv.org/abs/1603.08861v2","paper_title":"Revisiting Semi-Supervised Learning with Graph Embeddings","code":"https://github.com/tkipf/gcn","n_code_links":26,"official":null,"syntology":{"n_ran":15,"n_constructed":4,"n_ran_checked":13,"n_instrument":2,"n_unverified":13,"n_samples":28,"n_pointer_only_licence":11,"sample_list":"/paper/revisiting-semi-supervised-learning-with#ran","syntology_url":"https://syntology.ai/paper/1603.08861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.08861"}}}},{"rank_in_archive_order":66,"model":"TGCL+ResNet","metrics":{"Accuracy":"61.25±1.29"},"uses_additional_data":false,"paper_date":"2021-10-26","paper":"/paper/tackling-oversmoothing-of-gnns-with-1","paper_url":"https://arxiv.org/abs/2110.13798v3","paper_title":"Deeper-GXX: Deepening Arbitrary GNNs","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":67,"model":"AttentionWalk","metrics":{"Accuracy":"51.5%"},"uses_additional_data":false,"paper_date":"2017-10-26","paper":"/paper/watch-your-step-learning-node-embeddings-via","paper_url":"http://arxiv.org/abs/1710.09599v2","paper_title":"Watch Your Step: Learning Node Embeddings via Graph Attention","code":"https://github.com/benedekrozemberczki/AttentionWalk","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":68,"model":"DANMF","metrics":{"Accuracy":"42.42%"},"uses_additional_data":false,"paper_date":"2018-10-22","paper":"/paper/deep-autoencoder-like-nonnegative-matrix","paper_url":"https://dl.acm.org/citation.cfm?id=3271697","paper_title":"Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection","code":"https://github.com/benedekrozemberczki/karateclub","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":69,"model":"TransGNN","metrics":{"1:1 Accuracy":"75.0"},"uses_additional_data":false,"paper_date":"2024-01-01","paper":"/paper/strong-transitivity-relations-and-graph","paper_url":"https://arxiv.org/abs/2401.01384v1","paper_title":"Strong Transitivity Relations and Graph Neural Networks","code":"https://github.com/yassinmihemedi/strong-transitivity-relations-and-graph-neural-network","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":70,"model":"PathNet","metrics":{"Accuracy (%)":"77.98"},"uses_additional_data":false,"paper_date":"2022-07-20","paper":"/paper/beyond-homophily-structure-aware-path","paper_url":"https://www.ijcai.org/proceedings/2022/310","paper_title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","code":"https://github.com/zjunet/PathNet","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":71,"model":"FIT-GNN","metrics":{"Inference Time (ms)":"0.0018"},"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,"official":null,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"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), 49 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,550 of the 8,888 were already full without this board, so if it was crowded out of them it is not counted), and 22 proposed a result; of those 22, 15 gave no cell that passed the extractor's own checks, 6 were rejected by the independent check, 0 await a verdict and 1 was 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":71,"metric_columns":6,"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":1550,"candidates":49,"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":22,"no_cell_passed_checks":15,"rejected_by_independent_check":6,"accepted_not_placed":0,"awaiting_verdict":0,"placed":1,"placed_entries_listed":1,"file_lines_unreadable_as_read":0,"since_line":"Since the archive (Syntology): 1 placed; 22 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":22,"shown_on_page":22,"no_cell_split":{"no_cell_passed_checks_in_ledger":15,"rows_refused_by_rule":15,"rows_no_cell_passed_checks":0},"rows":[{"arxiv_id":"2608.30394","outcome":"rejected","reason":null},{"arxiv_id":"2608.08479","outcome":"rejected","reason":null},{"arxiv_id":"2608.01160","outcome":"refused_by_rule","reason":"the model gave no value to check against the cell"},{"arxiv_id":"2607.15773","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2607.01553","outcome":"rejected","reason":null},{"arxiv_id":"2606.11898","outcome":"refused_by_rule","reason":"the value is not on the scale of the leaderboard column's archive values"},{"arxiv_id":"2605.16527","outcome":"refused_by_rule","reason":"the model gave no value to check against the cell"},{"arxiv_id":"2605.03076","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2604.19070","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2603.24291","outcome":"rejected","reason":null},{"arxiv_id":"2602.20418","outcome":"refused_by_rule","reason":"the model gave no value to check against the cell"},{"arxiv_id":"2602.07256","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2602.06557","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 model gave no value to check against the cell"},{"arxiv_id":"2601.19449","outcome":"rejected","reason":null},{"arxiv_id":"2601.02451","outcome":"refused_by_rule","reason":"the row label the model quoted is not the row's label"},{"arxiv_id":"2601.01123","outcome":"refused_by_rule","reason":"the row label the model quoted is not the row's label"},{"arxiv_id":"2511.21416","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2510.21267","outcome":"refused_by_rule","reason":"the row is an ablation variant, not the method itself"},{"arxiv_id":"2510.18825","outcome":"placed","reason":null},{"arxiv_id":"2510.16289","outcome":"rejected","reason":null},{"arxiv_id":"2508.12787","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":["Accuracy"],"entries":[{"paper":"/paper/arxiv-2510-18825","paper_title":"Unifying and Enhancing Graph Transformers via a Hierarchical Mask Framework","arxiv_id":"2510.18825","model":"M 3 Dphormer","row_label":"M 3 Dphormer","configuration":"Datasets","configuration_in_model":false,"configuration_not_shown_because":"generic_header_word","values":{"Accuracy":"77.53 ±1.56"},"date":"2025-10-21","month_from_arxiv_id":null,"where_in_paper":"Table 2, row “M 3 Dphormer”","table_label":"2","table_label_from":"the caption's own label","table_position_1based":2,"caption_head":"Table 2 : Node classification results (% ±σ ). ROC-AUC for Minesweeper;…","caption_on_page":"shown","cells":[{"column":"Accuracy","cell_text":"77.53 ±1.56","column_header":"Datasets / Citeseer","value":77.53,"table_index_0based":1,"row":17,"col":2}],"code":"8 harvested: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","samples_harvested":8,"sample_list":"/paper/arxiv-2510-18825#ran","syntology":{"syntology_url":"https://syntology.ai/paper/2510.18825","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2510.18825"}}}}]},"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":28,"rows_with_any_sample_ran":19,"rows_with_a_run_with_no_instrument_failure":17,"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":23,"rows_whose_official_repository_has_a_sample_that_ran":9,"rows_whose_official_repository_has_a_run_with_no_instrument_failure":9,"rows_community_repositories_only":3,"rows_runs_from_other_or_unrecorded_repositories":1,"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":24,"distinct_papers_with_any_sample_ran":18,"distinct_papers_with_a_run_with_no_instrument_failure":16,"samples_over_distinct_papers":{"n_ran":221,"n_constructed":56,"n_ran_checked":186,"n_instrument":35,"n_unverified":132,"n_samples":353,"n_pointer_only_licence":112,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":232,"n_constructed":56,"n_ran_checked":196,"n_instrument":36,"n_unverified":136,"n_samples":368,"n_pointer_only_licence":116,"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":"617a6ded6dc7581396702328a025791f560f6bb6fc673898e83f2095bd41fccd","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}