{"url":"/sota/node-classification-on-genius","task":{"name":"Node Classification","url":"/task/node-classification","note":null},"dataset":{"name":"genius","url":"/dataset/genius"},"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","1:1 Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Accuracy":"higher","1:1 Accuracy":"higher"}},"counts":{"rows":26,"rows_with_code":26,"rows_with_paper_page":26,"rows_dated":26,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"Dual-Net GNN","metrics":{"Accuracy":"91.45±0.11"},"uses_additional_data":false,"paper_date":"2023-01-25","paper":"/paper/feature-selection-key-to-enhance-node","paper_url":"https://ietresearch.onlinelibrary.wiley.com/doi/full/10.1049/cit2.12166","paper_title":"Feature Selection: Key to Enhance Node Classification with Graph Neural Networks","code":"https://github.com/sunilkmaurya/DualNetGNN_large","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"ACM-GCN++","metrics":{"Accuracy":"91.37 ± 0.07"},"uses_additional_data":false,"paper_date":"2022-10-14","paper":"/paper/revisiting-heterophily-for-graph-neural","paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","code":"https://github.com/SitaoLuan/ACM-GNN","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":5,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"ACM-GCN+","metrics":{"Accuracy":"91.22 ± 0.13"},"uses_additional_data":false,"paper_date":"2022-10-14","paper":"/paper/revisiting-heterophily-for-graph-neural","paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","code":"https://github.com/SitaoLuan/ACM-GNN","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":5,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"ACMII-GCN+","metrics":{"Accuracy":"91.13 ± 0.09"},"uses_additional_data":false,"paper_date":"2022-10-14","paper":"/paper/revisiting-heterophily-for-graph-neural","paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","code":"https://github.com/SitaoLuan/ACM-GNN","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":5,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"ACMII-GCN++","metrics":{"Accuracy":"91.01 ± 0.18"},"uses_additional_data":false,"paper_date":"2022-10-14","paper":"/paper/revisiting-heterophily-for-graph-neural","paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","code":"https://github.com/SitaoLuan/ACM-GNN","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":5,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"GloGNN++","metrics":{"Accuracy":"90.91 ± 0.13"},"uses_additional_data":false,"paper_date":"2022-05-15","paper":"/paper/finding-global-homophily-in-graph-neural","paper_url":"https://arxiv.org/abs/2205.07308v1","paper_title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","code":"https://github.com/recklessronan/glognn","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"G^2-GraphSAGE","metrics":{"Accuracy":"90.85±0.64"},"uses_additional_data":false,"paper_date":"2022-10-02","paper":"/paper/gradient-gating-for-deep-multi-rate-learning","paper_url":"https://arxiv.org/abs/2210.00513v2","paper_title":"Gradient Gating for Deep Multi-Rate Learning on Graphs","code":"https://github.com/tk-rusch/gradientgating","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"LINKX","metrics":{"Accuracy":"90.77 ± 0.27"},"uses_additional_data":false,"paper_date":"2021-10-27","paper":"/paper/large-scale-learning-on-non-homophilous","paper_url":"https://arxiv.org/abs/2110.14446v1","paper_title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","code":"https://github.com/cuai/non-homophily-large-scale","n_code_links":5,"syntology":{"n_ran":7,"n_unverified":14,"n_samples":21,"n_pointer_only_licence":4}},{"rank_in_archive_order":9,"model":"GloGNN","metrics":{"Accuracy":"90.66 ± 0.11"},"uses_additional_data":false,"paper_date":"2022-05-15","paper":"/paper/finding-global-homophily-in-graph-neural","paper_url":"https://arxiv.org/abs/2205.07308v1","paper_title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","code":"https://github.com/recklessronan/glognn","n_code_links":1,"syntology":null},{"rank_in_archive_order":10,"model":"MixHop","metrics":{"Accuracy":"90.58 ± 0.16"},"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,"syntology":null},{"rank_in_archive_order":11,"model":"GCNII","metrics":{"Accuracy":"90.24 ± 0.09"},"uses_additional_data":false,"paper_date":"2020-07-04","paper":"/paper/simple-and-deep-graph-convolutional-networks-1","paper_url":"https://arxiv.org/abs/2007.02133v1","paper_title":"Simple and Deep Graph Convolutional Networks","code":"https://github.com/chennnM/GCNII/tree/master/PyG/ogbn-arxiv","n_code_links":4,"syntology":{"n_ran":5,"n_unverified":2,"n_samples":7,"n_pointer_only_licence":4}},{"rank_in_archive_order":12,"model":"GPRGCN","metrics":{"Accuracy":"90.05 ± 0.31"},"uses_additional_data":false,"paper_date":"2020-06-14","paper":"/paper/joint-adaptive-feature-smoothing-and-topology","paper_url":"https://arxiv.org/abs/2006.07988v6","paper_title":"Adaptive Universal Generalized PageRank Graph Neural Network","code":"https://github.com/jianhao2016/GPRGNN","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":13,"model":"GCNJK","metrics":{"Accuracy":"89.30 ± 0.19"},"uses_additional_data":false,"paper_date":"2022-05-15","paper":"/paper/finding-global-homophily-in-graph-neural","paper_url":"https://arxiv.org/abs/2205.07308v1","paper_title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","code":"https://github.com/recklessronan/glognn","n_code_links":1,"syntology":null},{"rank_in_archive_order":14,"model":"GCN","metrics":{"Accuracy":"87.42 ± 0.37"},"uses_additional_data":false,"paper_date":"2016-09-09","paper":"/paper/semi-supervised-classification-with-graph","paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn","n_code_links":55,"syntology":{"n_ran":31,"n_unverified":27,"n_samples":58,"n_pointer_only_licence":22}},{"rank_in_archive_order":15,"model":"MLP","metrics":{"Accuracy":"86.68 ± 0.09"},"uses_additional_data":false,"paper_date":"2022-05-15","paper":"/paper/finding-global-homophily-in-graph-neural","paper_url":"https://arxiv.org/abs/2205.07308v1","paper_title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","code":"https://github.com/recklessronan/glognn","n_code_links":1,"syntology":null},{"rank_in_archive_order":16,"model":"APPNP","metrics":{"Accuracy":"85.36 ± 0.62"},"uses_additional_data":false,"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,"syntology":{"n_ran":1,"n_unverified":11,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":17,"model":"C&S 2-hop","metrics":{"Accuracy":"84.94 ± 0.49"},"uses_additional_data":false,"paper_date":"2020-10-27","paper":"/paper/combining-label-propagation-and-simple-models-1","paper_url":"https://arxiv.org/abs/2010.13993v2","paper_title":"Combining Label Propagation and Simple Models Out-performs Graph Neural Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/correct_and_smooth","n_code_links":7,"syntology":{"n_ran":2,"n_unverified":3,"n_samples":5,"n_pointer_only_licence":2}},{"rank_in_archive_order":18,"model":"C&S 1-hop","metrics":{"Accuracy":"82.93 ± 0.15"},"uses_additional_data":false,"paper_date":"2020-10-27","paper":"/paper/combining-label-propagation-and-simple-models-1","paper_url":"https://arxiv.org/abs/2010.13993v2","paper_title":"Combining Label Propagation and Simple Models Out-performs Graph Neural Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/correct_and_smooth","n_code_links":7,"syntology":{"n_ran":2,"n_unverified":3,"n_samples":5,"n_pointer_only_licence":2}},{"rank_in_archive_order":19,"model":"SGC 1-hop","metrics":{"Accuracy":"82.36 ± 0.37"},"uses_additional_data":false,"paper_date":"2019-02-19","paper":"/paper/simplifying-graph-convolutional-networks","paper_url":"https://arxiv.org/abs/1902.07153v2","paper_title":"Simplifying Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sgc","n_code_links":7,"syntology":{"n_ran":3,"n_unverified":5,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":20,"model":"SGC 2-hop","metrics":{"Accuracy":"82.10 ± 0.14"},"uses_additional_data":false,"paper_date":"2019-02-19","paper":"/paper/simplifying-graph-convolutional-networks","paper_url":"https://arxiv.org/abs/1902.07153v2","paper_title":"Simplifying Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sgc","n_code_links":7,"syntology":{"n_ran":3,"n_unverified":5,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":21,"model":"LINK","metrics":{"Accuracy":"73.56 ± 0.14"},"uses_additional_data":false,"paper_date":"2021-04-03","paper":"/paper/new-benchmarks-for-learning-on-non","paper_url":"https://arxiv.org/abs/2104.01404v2","paper_title":"New Benchmarks for Learning on Non-Homophilous Graphs","code":"https://github.com/CUAI/Non-Homophily-Benchmarks","n_code_links":1,"syntology":null},{"rank_in_archive_order":22,"model":"L Prop 2-hop","metrics":{"Accuracy":"67.04 ± 0.20"},"uses_additional_data":false,"paper_date":"2021-04-03","paper":"/paper/new-benchmarks-for-learning-on-non","paper_url":"https://arxiv.org/abs/2104.01404v2","paper_title":"New Benchmarks for Learning on Non-Homophilous Graphs","code":"https://github.com/CUAI/Non-Homophily-Benchmarks","n_code_links":1,"syntology":null},{"rank_in_archive_order":23,"model":"L Prop 1-hop","metrics":{"Accuracy":"66.02 ± 0.16"},"uses_additional_data":false,"paper_date":"2021-04-03","paper":"/paper/new-benchmarks-for-learning-on-non","paper_url":"https://arxiv.org/abs/2104.01404v2","paper_title":"New Benchmarks for Learning on Non-Homophilous Graphs","code":"https://github.com/CUAI/Non-Homophily-Benchmarks","n_code_links":1,"syntology":null},{"rank_in_archive_order":24,"model":"GATJK","metrics":{"Accuracy":"56.70 ± 2.07"},"uses_additional_data":false,"paper_date":"2021-04-03","paper":"/paper/new-benchmarks-for-learning-on-non","paper_url":"https://arxiv.org/abs/2104.01404v2","paper_title":"New Benchmarks for Learning on Non-Homophilous Graphs","code":"https://github.com/CUAI/Non-Homophily-Benchmarks","n_code_links":1,"syntology":null},{"rank_in_archive_order":25,"model":"GAT","metrics":{"Accuracy":"55.80 ± 0.87"},"uses_additional_data":false,"paper_date":"2017-10-30","paper":"/paper/graph-attention-networks","paper_url":"http://arxiv.org/abs/1710.10903v3","paper_title":"Graph Attention Networks","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":93,"syntology":{"n_ran":50,"n_unverified":56,"n_samples":106,"n_pointer_only_licence":43}},{"rank_in_archive_order":26,"model":"GESN","metrics":{"1:1 Accuracy":"91.72 ± 0.08"},"uses_additional_data":false,"paper_date":"2023-05-14","paper":"/paper/addressing-heterophily-in-node-classification","paper_url":"https://arxiv.org/abs/2305.08233v2","paper_title":"Addressing Heterophily in Node Classification with Graph Echo State Networks","code":"https://github.com/dtortorella/addressing-heterophily-gesn","n_code_links":1,"syntology":null}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":15,"rows_with_any_sample_ran":13,"distinct_papers_with_graph_line":10,"distinct_papers_with_any_sample_ran":8,"samples_over_distinct_papers":{"n_ran":101,"n_unverified":128,"n_samples":229,"n_pointer_only_licence":77,"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_unverified":151,"n_samples":263,"n_pointer_only_licence":79,"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"}}}