{"url":"/sota/node-classification-on-pascalvoc-sp-1","task":{"name":"Node Classification","url":"/task/node-classification","note":null},"dataset":{"name":"PascalVOC-SP","url":"/dataset/pascal-voc"},"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":["macro F1"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"macro F1":"higher"}},"counts":{"rows":21,"rows_with_code":21,"rows_with_paper_page":21,"rows_dated":21,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"NeuralWalker","metrics":{"macro F1":"0.4912 ± 0.0042"},"uses_additional_data":false,"paper_date":"2024-06-05","paper":"/paper/learning-long-range-dependencies-on-graphs","paper_url":"https://arxiv.org/abs/2406.03386v2","paper_title":"Learning Long Range Dependencies on Graphs via Random Walks","code":"https://github.com/borgwardtlab/neuralwalker","n_code_links":1,"syntology":{"n_ran":13,"n_unverified":0,"n_samples":13,"n_pointer_only_licence":0}},{"rank_in_archive_order":2,"model":"GatedGCN-HSG","metrics":{"macro F1":"0.4604±0.0059"},"uses_additional_data":false,"paper_date":"2024-06-22","paper":"/paper/next-level-message-passing-with-hierarchical","paper_url":"https://arxiv.org/abs/2406.15852v2","paper_title":"Next Level Message-Passing with Hierarchical Support Graphs","code":"https://github.com/carlosinator/support-graphs","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":6,"n_samples":10,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"GPS-tuned","metrics":{"macro F1":"0.4440±0.0065"},"uses_additional_data":false,"paper_date":"2023-09-01","paper":"/paper/where-did-the-gap-go-reassessing-the-long","paper_url":"https://arxiv.org/abs/2309.00367v2","paper_title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","code":"https://github.com/toenshoff/lrgb","n_code_links":2,"syntology":{"n_ran":5,"n_unverified":7,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"IM-GatedGCN","metrics":{"macro F1":"0.4332 ± 0.0078"},"uses_additional_data":false,"paper_date":"2025-05-29","paper":"/paper/improving-the-effective-receptive-field-of","paper_url":"https://arxiv.org/abs/2505.23185v1","paper_title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","code":"https://github.com/bgu-cs-vil/im-mpnn","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"GatedGCN+","metrics":{"macro F1":"0.4263 ± 0.0057"},"uses_additional_data":false,"paper_date":"2025-02-13","paper":"/paper/unlocking-the-potential-of-classic-gnns-for","paper_url":"https://arxiv.org/abs/2502.09263v1","paper_title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","code":"https://github.com/LUOyk1999/GNNPlus","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":8,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"Exphormer","metrics":{"macro F1":"0.396±0.0027"},"uses_additional_data":false,"paper_date":"2023-03-10","paper":"/paper/exphormer-sparse-transformers-for-graphs","paper_url":"https://arxiv.org/abs/2303.06147v2","paper_title":"Exphormer: Sparse Transformers for Graphs","code":"https://github.com/hamed1375/exphormer","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":7,"model":"GatedGCN-tuned","metrics":{"macro F1":"0.3880±0.0040"},"uses_additional_data":false,"paper_date":"2023-09-01","paper":"/paper/where-did-the-gap-go-reassessing-the-long","paper_url":"https://arxiv.org/abs/2309.00367v2","paper_title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","code":"https://github.com/toenshoff/lrgb","n_code_links":2,"syntology":{"n_ran":5,"n_unverified":7,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"GPS","metrics":{"macro F1":"0.3748±0.0109"},"uses_additional_data":false,"paper_date":"2022-05-25","paper":"/paper/recipe-for-a-general-powerful-scalable-graph","paper_url":"https://arxiv.org/abs/2205.12454v4","paper_title":"Recipe for a General, Powerful, Scalable Graph Transformer","code":"https://github.com/rampasek/GraphGPS","n_code_links":4,"syntology":{"n_ran":3,"n_unverified":18,"n_samples":21,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"DRew-GatedGCN+LapPE","metrics":{"macro F1":"0.3314±0.0024"},"uses_additional_data":false,"paper_date":"2023-05-13","paper":"/paper/drew-dynamically-rewired-message-passing-with","paper_url":"https://arxiv.org/abs/2305.08018v2","paper_title":"DRew: Dynamically Rewired Message Passing with Delay","code":"https://github.com/bengutteridge/drew","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":7,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":10,"model":"SAN+LapPE","metrics":{"macro F1":"0.3230±0.0039"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":null},{"rank_in_archive_order":11,"model":"SAN+RWSE","metrics":{"macro F1":"0.3216±0.0027"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":null},{"rank_in_archive_order":12,"model":"GatedGCN+LapPE+virtual node","metrics":{"macro F1":"0.3103±0.0068"},"uses_additional_data":false,"paper_date":"2023-01-27","paper":"/paper/on-the-connection-between-mpnn-and-graph","paper_url":"https://arxiv.org/abs/2301.11956v4","paper_title":"On the Connection Between MPNN and Graph Transformer","code":"https://github.com/chen-cai-osu/mpnn-gt-connection","n_code_links":1,"syntology":null},{"rank_in_archive_order":13,"model":"IM-GCN","metrics":{"macro F1":"0.2929 ± 0.0058"},"uses_additional_data":false,"paper_date":"2025-05-29","paper":"/paper/improving-the-effective-receptive-field-of","paper_url":"https://arxiv.org/abs/2505.23185v1","paper_title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","code":"https://github.com/bgu-cs-vil/im-mpnn","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":14,"model":"GatedGCN","metrics":{"macro F1":"0.2873±0.0219"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":null},{"rank_in_archive_order":15,"model":"GatedGCN+LapPE","metrics":{"macro F1":"0.2860±0.0085"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":null},{"rank_in_archive_order":16,"model":"GINE-tuned","metrics":{"macro F1":"0.2718±0.0054"},"uses_additional_data":false,"paper_date":"2023-09-01","paper":"/paper/where-did-the-gap-go-reassessing-the-long","paper_url":"https://arxiv.org/abs/2309.00367v2","paper_title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","code":"https://github.com/toenshoff/lrgb","n_code_links":2,"syntology":{"n_ran":5,"n_unverified":7,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":17,"model":"Transformer+LapPE","metrics":{"macro F1":"0.2694±0.0098"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":null},{"rank_in_archive_order":18,"model":"GCN-tuned","metrics":{"macro F1":"0.2078±0.0031"},"uses_additional_data":false,"paper_date":"2023-09-01","paper":"/paper/where-did-the-gap-go-reassessing-the-long","paper_url":"https://arxiv.org/abs/2309.00367v2","paper_title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","code":"https://github.com/toenshoff/lrgb","n_code_links":2,"syntology":{"n_ran":5,"n_unverified":7,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":19,"model":"GCNII","metrics":{"macro F1":"0.1698±0.0080"},"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":20,"model":"GCN","metrics":{"macro F1":"0.1268±0.0060"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":null},{"rank_in_archive_order":21,"model":"GINE","metrics":{"macro F1":"0.1265±0.0076"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"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":13,"rows_with_any_sample_ran":13,"distinct_papers_with_graph_line":9,"distinct_papers_with_any_sample_ran":9,"samples_over_distinct_papers":{"n_ran":38,"n_unverified":48,"n_samples":86,"n_pointer_only_licence":4,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":54,"n_unverified":69,"n_samples":123,"n_pointer_only_licence":4,"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"}}}