{"url":"/task/node-classification","name":"Node Classification","slug":"node-classification","description_markdown":"**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>","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":1860,"papers_with_code":991,"benchmarks":138,"benchmark_tables_in_archive":138,"benchmark_tables_shown":138,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":75,"subtasks":5,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/node-classification-on-cora","slug":"node-classification-on-cora","dataset":"Cora","dataset_url":"/dataset/cora","rows_in_archive":73,"metrics":["Accuracy","Training Split","Validation","1:1 Accuracy","Inference Time (ms)"],"first_row_in_archive_order":{"model":"SSP","paper_title":"Optimization of Graph Neural Networks with Natural Gradient Descent","paper_url":"/paper/optimization-of-graph-neural-networks-with","paper_date":"2020-08-21","arxiv_id":"2008.09624","code_links":[{"title":"russellizadi/ssp","url":"https://github.com/russellizadi/ssp"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer","slug":"node-classification-on-citeseer","dataset":"Citeseer","dataset_url":"/dataset/citeseer","rows_in_archive":71,"metrics":["Accuracy","Training Split","Validation","1:1 Accuracy","Accuracy (%)","Inference Time (ms)"],"first_row_in_archive_order":{"model":"ACMII-Snowball-2","paper_title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","paper_url":"/paper/is-heterophily-a-real-nightmare-for-graph","paper_date":"2021-09-12","arxiv_id":"2109.05641","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed","slug":"node-classification-on-pubmed","dataset":"Pubmed","dataset_url":"/dataset/pubmed","rows_in_archive":70,"metrics":["Accuracy","Training Split","F1","Validation","Accuracy (%)","F1-Score","Inference Time (ms)"],"first_row_in_archive_order":{"model":"NCGCN","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-wisconsin","slug":"node-classification-on-wisconsin","dataset":"Wisconsin","dataset_url":"/dataset/webkb","rows_in_archive":63,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"5-HiGCN","paper_title":"Higher-order Graph Convolutional Network with Flower-Petals Laplacians on Simplicial Complexes","paper_url":"/paper/higher-order-graph-convolutional-network-with","paper_date":"2023-09-22","arxiv_id":"2309.12971","code_links":[{"title":"yiminghh/higcn","url":"https://github.com/yiminghh/higcn"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}}},{"leaderboard":"/sota/node-classification-on-actor","slug":"node-classification-on-actor","dataset":"Actor","dataset_url":null,"rows_in_archive":62,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCSAGE","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-texas","slug":"node-classification-on-texas","dataset":"Texas","dataset_url":"/dataset/webkb","rows_in_archive":62,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"RDGNN-S","paper_title":"Graph Neural Reaction Diffusion Models","paper_url":"/paper/graph-neural-reaction-diffusion-models","paper_date":"2024-06-16","arxiv_id":"2406.10871","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-chameleon","slug":"node-classification-on-chameleon","dataset":"Chameleon","dataset_url":null,"rows_in_archive":61,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"DJ-GNN","paper_title":"Diffusion-Jump GNNs: Homophiliation via Learnable Metric Filters","paper_url":"/paper/diffusion-jump-gnns-homophiliation-via","paper_date":"2023-06-29","arxiv_id":"2306.16976","code_links":[{"title":"AhmedBegggaUA/TFM","url":"https://github.com/AhmedBegggaUA/TFM"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}}},{"leaderboard":"/sota/node-classification-on-cornell","slug":"node-classification-on-cornell","dataset":"Cornell","dataset_url":"/dataset/cornell","rows_in_archive":60,"metrics":["Accuracy","Accuracy (%)"],"first_row_in_archive_order":{"model":"RDGNN-I","paper_title":"Graph Neural Reaction Diffusion Models","paper_url":"/paper/graph-neural-reaction-diffusion-models","paper_date":"2024-06-16","arxiv_id":"2406.10871","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-squirrel","slug":"node-classification-on-squirrel","dataset":"Squirrel","dataset_url":"/dataset/wiki-squirrel","rows_in_archive":59,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"FaberNet","paper_title":"HoloNets: Spectral Convolutions do extend to Directed Graphs","paper_url":"/paper/holonets-spectral-convolutions-do-extend-to","paper_date":"2023-10-03","arxiv_id":"2310.02232","code_links":[{"title":"ChristianKoke/HoloNets","url":"https://github.com/ChristianKoke/HoloNets"}],"syntology":{"n":5,"n_ran":4,"n_unverified":1,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-citeseer-with-public","slug":"node-classification-on-citeseer-with-public","dataset":"CiteSeer with Public Split: fixed 20 nodes per class","dataset_url":"/dataset/citeseer","rows_in_archive":40,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"OGC","paper_title":"From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited","paper_url":"/paper/from-cluster-assumption-to-graph-convolution","paper_date":"2023-09-24","arxiv_id":"2309.13599","code_links":[{"title":"zhengwang100/ogc_ggcm","url":"https://github.com/zhengwang100/ogc_ggcm"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-chameleon-60-20-20","slug":"node-classification-on-chameleon-60-20-20","dataset":"Chameleon (60%/20%/20% random splits)","dataset_url":null,"rows_in_archive":38,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"GNNDLD","paper_title":"GNNDLD: Graph Neural Network with Directional Label Distribution","paper_url":"/paper/gnndld-graph-neural-network-with-directional","paper_date":"2024-02-26","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-film-60-20-20-random","slug":"node-classification-on-film-60-20-20-random","dataset":"Film (60%/20%/20% random splits)","dataset_url":"/dataset/film-60-20-20-random-splits","rows_in_archive":37,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"GNNDLD","paper_title":"GNNDLD: Graph Neural Network with Directional Label Distribution","paper_url":"/paper/gnndld-graph-neural-network-with-directional","paper_date":"2024-02-26","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-60-20-20-random","slug":"node-classification-on-pubmed-60-20-20-random","dataset":"PubMed (60%/20%/20% random splits)","dataset_url":"/dataset/pubmed-60-20-20-random-splits","rows_in_archive":37,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"GNNDLD","paper_title":"GNNDLD: Graph Neural Network with Directional Label Distribution","paper_url":"/paper/gnndld-graph-neural-network-with-directional","paper_date":"2024-02-26","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-with-public","slug":"node-classification-on-pubmed-with-public","dataset":"PubMed with Public Split: fixed 20 nodes per class","dataset_url":"/dataset/pubmed","rows_in_archive":37,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"OGC","paper_title":"From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited","paper_url":"/paper/from-cluster-assumption-to-graph-convolution","paper_date":"2023-09-24","arxiv_id":"2309.13599","code_links":[{"title":"zhengwang100/ogc_ggcm","url":"https://github.com/zhengwang100/ogc_ggcm"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-squirrel-60-20-20","slug":"node-classification-on-squirrel-60-20-20","dataset":"Squirrel (60%/20%/20% random splits)","dataset_url":"/dataset/squirrel-60-20-20-random-splits","rows_in_archive":37,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"GNNDLD","paper_title":"GNNDLD: Graph Neural Network with Directional Label Distribution","paper_url":"/paper/gnndld-graph-neural-network-with-directional","paper_date":"2024-02-26","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cora-with-public-split","slug":"node-classification-on-cora-with-public-split","dataset":"Cora with Public Split: fixed 20 nodes per class","dataset_url":"/dataset/cora","rows_in_archive":36,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"OGC","paper_title":"From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited","paper_url":"/paper/from-cluster-assumption-to-graph-convolution","paper_date":"2023-09-24","arxiv_id":"2309.13599","code_links":[{"title":"zhengwang100/ogc_ggcm","url":"https://github.com/zhengwang100/ogc_ggcm"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cornell-60-20-20","slug":"node-classification-on-cornell-60-20-20","dataset":"Cornell (60%/20%/20% random splits)","dataset_url":"/dataset/cornell-60-20-20-random-splits","rows_in_archive":36,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACMII-GCN","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_url":"/paper/revisiting-heterophily-for-graph-neural","paper_date":"2022-10-14","arxiv_id":"2210.07606","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"syntology":{"n":7,"n_ran":2,"n_unverified":5,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-texas-60-20-20-random","slug":"node-classification-on-texas-60-20-20-random","dataset":"Texas (60%/20%/20% random splits)","dataset_url":null,"rows_in_archive":36,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACM-GCN++","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_url":"/paper/revisiting-heterophily-for-graph-neural","paper_date":"2022-10-14","arxiv_id":"2210.07606","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"syntology":{"n":7,"n_ran":2,"n_unverified":5,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-wisconsin-60-20-20","slug":"node-classification-on-wisconsin-60-20-20","dataset":"Wisconsin (60%/20%/20% random splits)","dataset_url":null,"rows_in_archive":35,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACM-GCN++","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_url":"/paper/revisiting-heterophily-for-graph-neural","paper_date":"2022-10-14","arxiv_id":"2210.07606","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"syntology":{"n":7,"n_ran":2,"n_unverified":5,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-citeseer-60-20-20","slug":"node-classification-on-citeseer-60-20-20","dataset":"CiteSeer (60%/20%/20% random splits)","dataset_url":null,"rows_in_archive":33,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"GNNDLD","paper_title":"GNNDLD: Graph Neural Network with Directional Label Distribution","paper_url":"/paper/gnndld-graph-neural-network-with-directional","paper_date":"2024-02-26","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cora-60-20-20-random","slug":"node-classification-on-cora-60-20-20-random","dataset":"Cora (60%/20%/20% random splits)","dataset_url":null,"rows_in_archive":33,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"GNNDLD","paper_title":"GNNDLD: Graph Neural Network with Directional Label Distribution","paper_url":"/paper/gnndld-graph-neural-network-with-directional","paper_date":"2024-02-26","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-penn94","slug":"node-classification-on-penn94","dataset":"Penn94","dataset_url":"/dataset/penn94","rows_in_archive":32,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Dual-Net GNN","paper_title":"Feature Selection: Key to Enhance Node Classification with Graph Neural Networks","paper_url":"/paper/feature-selection-key-to-enhance-node","paper_date":"2023-01-25","arxiv_id":null,"code_links":[{"title":"sunilkmaurya/DualNetGNN_large","url":"https://github.com/sunilkmaurya/DualNetGNN_large"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer-48-32-20","slug":"node-classification-on-citeseer-48-32-20","dataset":"Citeseer (48%/32%/20% fixed splits)","dataset_url":"/dataset/citeseer-48-32-20-fixed-splits","rows_in_archive":26,"metrics":["1:1 Accuracy","Accuracy"],"first_row_in_archive_order":{"model":"Geom-GCN","paper_title":"Geom-GCN: Geometric Graph Convolutional Networks","paper_url":"/paper/geom-gcn-geometric-graph-convolutional-1","paper_date":"2020-02-13","arxiv_id":"2002.05287","code_links":[{"title":"bingzhewei/geom-gcn","url":"https://github.com/bingzhewei/geom-gcn"},{"title":"graphdml-uiuc-jlu/geom-gcn","url":"https://github.com/graphdml-uiuc-jlu/geom-gcn"},{"title":"alexfanjn/geomgcn_pyg","url":"https://github.com/alexfanjn/geomgcn_pyg"},{"title":"KAIDI3270/Geom_GCN_pytorch_implementation","url":"https://github.com/KAIDI3270/Geom_GCN_pytorch_implementation"}],"syntology":{"n":7,"n_ran":7,"n_unverified":0,"n_pointer_only":7}}},{"leaderboard":"/sota/node-classification-on-cora-48-32-20-fixed","slug":"node-classification-on-cora-48-32-20-fixed","dataset":"Cora (48%/32%/20% fixed splits)","dataset_url":"/dataset/cora-48-32-20-fixed-splits","rows_in_archive":26,"metrics":["1:1 Accuracy","Accuracy"],"first_row_in_archive_order":{"model":"NLGAT","paper_title":"Non-Local Graph Neural Networks","paper_url":"/paper/non-local-graph-neural-networks","paper_date":"2020-05-29","arxiv_id":"2005.14612","code_links":[{"title":"divelab/Non-Local-GNN","url":"https://github.com/divelab/Non-Local-GNN"}],"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":3}}},{"leaderboard":"/sota/node-classification-on-genius","slug":"node-classification-on-genius","dataset":"genius","dataset_url":"/dataset/genius","rows_in_archive":26,"metrics":["Accuracy","1:1 Accuracy"],"first_row_in_archive_order":{"model":"Dual-Net GNN","paper_title":"Feature Selection: Key to Enhance Node Classification with Graph Neural Networks","paper_url":"/paper/feature-selection-key-to-enhance-node","paper_date":"2023-01-25","arxiv_id":null,"code_links":[{"title":"sunilkmaurya/DualNetGNN_large","url":"https://github.com/sunilkmaurya/DualNetGNN_large"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-48-32-20-fixed","slug":"node-classification-on-pubmed-48-32-20-fixed","dataset":"PubMed (48%/32%/20% fixed splits)","dataset_url":"/dataset/pubmed-48-32-20-fixed-splits","rows_in_archive":26,"metrics":["1:1 Accuracy","Accuracy"],"first_row_in_archive_order":{"model":"GCNII","paper_title":"Simple and Deep Graph Convolutional Networks","paper_url":"/paper/simple-and-deep-graph-convolutional-networks-1","paper_date":"2020-07-04","arxiv_id":"2007.02133","code_links":[{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII/tree/master/PyG/ogbn-arxiv"},{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII"},{"title":"zhanglab-aim/cancer-net","url":"https://github.com/zhanglab-aim/cancer-net"},{"title":"tyxxzjpdez/GCNII-DropGroups","url":"https://github.com/tyxxzjpdez/GCNII-DropGroups"}],"syntology":{"n":7,"n_ran":5,"n_unverified":2,"n_pointer_only":4}}},{"leaderboard":"/sota/node-classification-on-coauthor-cs","slug":"node-classification-on-coauthor-cs","dataset":"Coauthor CS","dataset_url":null,"rows_in_archive":24,"metrics":["Accuracy","Inference Time (ms)"],"first_row_in_archive_order":{"model":"NCGCN","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-ppi","slug":"node-classification-on-ppi","dataset":"PPI","dataset_url":"/dataset/ppi","rows_in_archive":24,"metrics":["F1","Micro-F1","Micro F1","Macro-F1"],"first_row_in_archive_order":{"model":"g2-MLP","paper_title":"A Proposal of Multi-Layer Perceptron with Graph Gating Unit for Graph Representation Learning and its Application to Surrogate Model for FEM","paper_url":"/paper/a-proposal-of-multi-layer-perceptron-with","paper_date":"2022-07-11","arxiv_id":null,"code_links":[{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pascalvoc-sp-1","slug":"node-classification-on-pascalvoc-sp-1","dataset":"PascalVOC-SP","dataset_url":"/dataset/pascal-voc","rows_in_archive":21,"metrics":["macro F1"],"first_row_in_archive_order":{"model":"NeuralWalker","paper_title":"Learning Long Range Dependencies on Graphs via Random Walks","paper_url":"/paper/learning-long-range-dependencies-on-graphs","paper_date":"2024-06-05","arxiv_id":"2406.03386","code_links":[{"title":"borgwardtlab/neuralwalker","url":"https://github.com/borgwardtlab/neuralwalker"}],"syntology":{"n":13,"n_ran":13,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-coco-sp","slug":"node-classification-on-coco-sp","dataset":"COCO-SP","dataset_url":"/dataset/pascalvoc-sp","rows_in_archive":19,"metrics":["macro F1"],"first_row_in_archive_order":{"model":"NeuralWalker","paper_title":"Learning Long Range Dependencies on Graphs via Random Walks","paper_url":"/paper/learning-long-range-dependencies-on-graphs","paper_date":"2024-06-05","arxiv_id":"2406.03386","code_links":[{"title":"borgwardtlab/neuralwalker","url":"https://github.com/borgwardtlab/neuralwalker"}],"syntology":{"n":13,"n_ran":13,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-reddit","slug":"node-classification-on-reddit","dataset":"Reddit","dataset_url":"/dataset/reddit","rows_in_archive":16,"metrics":["Accuracy","Micro-F1"],"first_row_in_archive_order":{"model":"BNS-GCN","paper_title":"BNS-GCN: Efficient Full-Graph Training of Graph Convolutional Networks with Partition-Parallelism and Random Boundary Node Sampling","paper_url":"/paper/bns-gcn-efficient-full-graph-training-of","paper_date":"2022-03-21","arxiv_id":"2203.10983","code_links":[{"title":"gatech-eic/bns-gcn","url":"https://github.com/gatech-eic/bns-gcn"},{"title":"RICE-EIC/BNS-GCN","url":"https://github.com/RICE-EIC/BNS-GCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cora-05","slug":"node-classification-on-cora-05","dataset":"Cora (0.5%)","dataset_url":"/dataset/cora","rows_in_archive":15,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-ind_APPNP","paper_title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","paper_url":"/paper/extract-the-knowledge-of-graph-neural","paper_date":"2021-03-04","arxiv_id":"2103.02885","code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}],"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}}},{"leaderboard":"/sota/node-classification-on-cora-1","slug":"node-classification-on-cora-1","dataset":"Cora (1%)","dataset_url":"/dataset/cora","rows_in_archive":15,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-ind-APPNP","paper_title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","paper_url":"/paper/extract-the-knowledge-of-graph-neural","paper_date":"2021-03-04","arxiv_id":"2103.02885","code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}],"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}}},{"leaderboard":"/sota/node-classification-on-cora-3","slug":"node-classification-on-cora-3","dataset":"Cora (3%)","dataset_url":"/dataset/cora","rows_in_archive":15,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-tra-GCNII","paper_title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","paper_url":"/paper/extract-the-knowledge-of-graph-neural","paper_date":"2021-03-04","arxiv_id":"2103.02885","code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}],"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}}},{"leaderboard":"/sota/node-classification-on-amz-photo","slug":"node-classification-on-amz-photo","dataset":"AMZ Photo","dataset_url":null,"rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCSAGE","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer-05","slug":"node-classification-on-citeseer-05","dataset":"CiteSeer (0.5%)","dataset_url":"/dataset/citeseer","rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"MT-GCN","paper_title":"Mutual Teaching for Graph Convolutional Networks","paper_url":"/paper/mutual-teaching-for-graph-convolutional","paper_date":"2020-09-02","arxiv_id":"2009.00952","code_links":[{"title":"kunzhan/MTGCN","url":"https://github.com/kunzhan/MTGCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer-1","slug":"node-classification-on-citeseer-1","dataset":"CiteSeer (1%)","dataset_url":"/dataset/citeseer","rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"VCHN","paper_title":"View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes","paper_url":"/paper/view-consistent-heterogeneous-network-on","paper_date":"2022-03-17","arxiv_id":null,"code_links":[{"title":"kunzhan/VCHN","url":"https://github.com/kunzhan/VCHN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-coauthor-physics","slug":"node-classification-on-coauthor-physics","dataset":"Coauthor Physics","dataset_url":null,"rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCSAGE","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-003","slug":"node-classification-on-pubmed-003","dataset":"PubMed (0.03%)","dataset_url":"/dataset/pubmed","rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"VCHN","paper_title":"View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes","paper_url":"/paper/view-consistent-heterogeneous-network-on","paper_date":"2022-03-17","arxiv_id":null,"code_links":[{"title":"kunzhan/VCHN","url":"https://github.com/kunzhan/VCHN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-005","slug":"node-classification-on-pubmed-005","dataset":"PubMed (0.05%)","dataset_url":"/dataset/pubmed","rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"VCHN","paper_title":"View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes","paper_url":"/paper/view-consistent-heterogeneous-network-on","paper_date":"2022-03-17","arxiv_id":null,"code_links":[{"title":"kunzhan/VCHN","url":"https://github.com/kunzhan/VCHN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-01","slug":"node-classification-on-pubmed-01","dataset":"PubMed (0.1%)","dataset_url":"/dataset/pubmed","rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Truncated Krylov","paper_title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","paper_url":"/paper/break-the-ceiling-stronger-multi-scale-deep","paper_date":"2019-06-05","arxiv_id":"1906.02174","code_links":[{"title":"PwnerHarry/Stronger_GCN","url":"https://github.com/PwnerHarry/Stronger_GCN"}],"syntology":{"n":9,"n_ran":1,"n_unverified":8,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-amazon-computers-1","slug":"node-classification-on-amazon-computers-1","dataset":"Amazon Computers","dataset_url":null,"rows_in_archive":12,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GAT","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","paper_url":"/paper/classic-gnns-are-strong-baselines-reassessing","paper_date":"2024-06-13","arxiv_id":"2406.08993","code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}],"syntology":{"n":9,"n_ran":2,"n_unverified":7,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-arxiv-year","slug":"node-classification-on-arxiv-year","dataset":"arXiv-year","dataset_url":null,"rows_in_archive":12,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"MRS-Dir-GNN","paper_title":"Preventing Representational Rank Collapse in MPNNs by Splitting the Computational Graph","paper_url":"/paper/preventing-representational-rank-collapse-in","paper_date":"2024-09-17","arxiv_id":"2409.11504","code_links":[{"title":"roth-andreas/splitting-computational-graphs","url":"https://github.com/roth-andreas/splitting-computational-graphs"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cluster","slug":"node-classification-on-cluster","dataset":"CLUSTER","dataset_url":"/dataset/cluster","rows_in_archive":12,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GRIT","paper_title":"Graph Inductive Biases in Transformers without Message Passing","paper_url":"/paper/graph-inductive-biases-in-transformers","paper_date":"2023-05-27","arxiv_id":"2305.17589","code_links":[{"title":"liamma/grit","url":"https://github.com/liamma/grit"},{"title":"linusbao/MoSE","url":"https://github.com/linusbao/MoSE"}],"syntology":{"n":12,"n_ran":6,"n_unverified":6,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-amazon-photo-1","slug":"node-classification-on-amazon-photo-1","dataset":"Amazon Photo","dataset_url":"/dataset/amazon-photo","rows_in_archive":11,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphSAGE","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","paper_url":"/paper/classic-gnns-are-strong-baselines-reassessing","paper_date":"2024-06-13","arxiv_id":"2406.08993","code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}],"syntology":{"n":9,"n_ran":2,"n_unverified":7,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-pattern","slug":"node-classification-on-pattern","dataset":"PATTERN","dataset_url":"/dataset/pattern","rows_in_archive":11,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CKGCN","paper_title":"CKGConv: General Graph Convolution with Continuous Kernels","paper_url":"/paper/ckgconv-general-graph-convolution-with","paper_date":"2024-04-21","arxiv_id":"2404.13604","code_links":[{"title":"networkslab/ckgconv","url":"https://github.com/networkslab/ckgconv"}],"syntology":{"n":11,"n_ran":8,"n_unverified":3,"n_pointer_only":11}}},{"leaderboard":"/sota/node-classification-on-cora-fixed-20-node-per","slug":"node-classification-on-cora-fixed-20-node-per","dataset":"Cora: fixed 20 node per class","dataset_url":"/dataset/cora","rows_in_archive":9,"metrics":["Accuracy","Micro F1"],"first_row_in_archive_order":{"model":"DSGCN","paper_title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","paper_url":"/paper/bridging-the-gap-between-spectral-and-spatial","paper_date":"2020-03-26","arxiv_id":"2003.11702","code_links":[{"title":"balcilar/Spectral-Designed-Graph-Convolutions","url":"https://github.com/balcilar/Spectral-Designed-Graph-Convolutions"},{"title":"sidneyarcidiacono/UnderstandingGCNs","url":"https://github.com/sidneyarcidiacono/UnderstandingGCNs"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cora-full-supervised","slug":"node-classification-on-cora-full-supervised","dataset":"Cora Full-supervised","dataset_url":"/dataset/cora","rows_in_archive":9,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GCNII","paper_title":"Simple and Deep Graph Convolutional Networks","paper_url":"/paper/simple-and-deep-graph-convolutional-networks-1","paper_date":"2020-07-04","arxiv_id":"2007.02133","code_links":[{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII/tree/master/PyG/ogbn-arxiv"},{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII"},{"title":"zhanglab-aim/cancer-net","url":"https://github.com/zhanglab-aim/cancer-net"},{"title":"tyxxzjpdez/GCNII-DropGroups","url":"https://github.com/tyxxzjpdez/GCNII-DropGroups"}],"syntology":{"n":7,"n_ran":5,"n_unverified":2,"n_pointer_only":4}}},{"leaderboard":"/sota/node-classification-on-pattern-100k","slug":"node-classification-on-pattern-100k","dataset":"PATTERN 100k","dataset_url":null,"rows_in_archive":9,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"EGT","paper_title":"Global Self-Attention as a Replacement for Graph Convolution","paper_url":"/paper/edge-augmented-graph-transformers-global-self","paper_date":"2021-08-07","arxiv_id":"2108.03348","code_links":[{"title":"shamim-hussain/egt_pytorch","url":"https://github.com/shamim-hussain/egt_pytorch"},{"title":"shamim-hussain/egt","url":"https://github.com/shamim-hussain/egt"},{"title":"shamim-hussain/egt_triangular","url":"https://github.com/shamim-hussain/egt_triangular"}],"syntology":{"n":4,"n_ran":0,"n_unverified":4,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-yelpchi","slug":"node-classification-on-yelpchi","dataset":"Yelp-Fraud","dataset_url":"/dataset/yelpchi","rows_in_archive":9,"metrics":["AUC-ROC"],"first_row_in_archive_order":{"model":"LEX-GNN","paper_title":"LEX-GNN: Label-Exploring Graph Neural Network for Accurate Fraud Detection","paper_url":"/paper/lex-gnn-label-exploring-graph-neural-network","paper_date":"2024-10-21","arxiv_id":null,"code_links":[{"title":"wdhyun/LEX-GNN","url":"https://github.com/wdhyun/LEX-GNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-am","slug":"node-classification-on-am","dataset":"AM","dataset_url":null,"rows_in_archive":8,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"BoP","paper_title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","paper_url":"/paper/from-primes-to-paths-enabling-fast-multi","paper_date":"2024-11-17","arxiv_id":"2411.11149","code_links":[{"title":"kbogas/PAM_BoP","url":"https://github.com/kbogas/PAM_BoP"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-facebook","slug":"node-classification-on-facebook","dataset":"Facebook","dataset_url":null,"rows_in_archive":8,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GNNMoE(GCN-like P)","paper_title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","paper_url":"/paper/mixture-of-experts-meets-decoupled-message","paper_date":"2024-12-11","arxiv_id":"2412.08193","code_links":[{"title":"GISec-Team/GNNMoE","url":"https://github.com/GISec-Team/GNNMoE"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-flickr","slug":"node-classification-on-flickr","dataset":"Flickr","dataset_url":"/dataset/flickr30k","rows_in_archive":8,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GCN+GAugM (Zhao et al., 2021)","paper_title":"Data Augmentation for Graph Neural Networks","paper_url":"/paper/data-augmentation-for-graph-neural-networks","paper_date":"2020-06-11","arxiv_id":"2006.06830","code_links":[{"title":"zhao-tong/GAug","url":"https://github.com/zhao-tong/GAug"},{"title":"andyjzhao/wsdm23-gsr","url":"https://github.com/andyjzhao/wsdm23-gsr"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-aifb","slug":"node-classification-on-aifb","dataset":"AIFB","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"R-GCN","paper_title":"Modeling Relational Data with Graph Convolutional Networks","paper_url":"/paper/modeling-relational-data-with-graph","paper_date":"2017-03-17","arxiv_id":"1703.06103","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/rgcn"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/rgcn-hetero"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/rgcn"},{"title":"tkipf/gae","url":"https://github.com/tkipf/gae"},{"title":"Microsoft/gated-graph-neural-network-samples","url":"https://github.com/Microsoft/gated-graph-neural-network-samples"},{"title":"tkipf/relational-gcn","url":"https://github.com/tkipf/relational-gcn"},{"title":"MichSchli/RelationPrediction","url":"https://github.com/MichSchli/RelationPrediction"},{"title":"INK-USC/RE-Net","url":"https://github.com/INK-USC/RE-Net"},{"title":"INK-USC/MHGRN","url":"https://github.com/INK-USC/MHGRN"},{"title":"shijx12/kqapro_baselines","url":"https://github.com/shijx12/kqapro_baselines"},{"title":"thiviyanT/torch-rgcn","url":"https://github.com/thiviyanT/torch-rgcn"},{"title":"berlincho/RGCN-pytorch","url":"https://github.com/berlincho/RGCN-pytorch"},{"title":"masakicktashiro/rgcn_pytorch_implementation","url":"https://github.com/masakicktashiro/rgcn_pytorch_implementation"},{"title":"dglai/wsdm2022-challenge","url":"https://github.com/dglai/wsdm2022-challenge"},{"title":"predict-idlab/RR-GCN","url":"https://github.com/predict-idlab/RR-GCN"},{"title":"giuseppefutia/semi","url":"https://github.com/giuseppefutia/semi"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"anilakash/indkgc","url":"https://github.com/anilakash/indkgc"},{"title":"toooooodo/rgcn-linkprediction","url":"https://github.com/toooooodo/rgcn-linkprediction"},{"title":"JiabenLi/rgcn_paddlepaddle","url":"https://github.com/JiabenLi/rgcn_paddlepaddle"},{"title":"kracr/document-level-relation-extraction","url":"https://github.com/kracr/document-level-relation-extraction"},{"title":"susurrant/flow-imputation","url":"https://github.com/susurrant/flow-imputation"},{"title":"susurrant/spatial-interaction-modeling","url":"https://github.com/susurrant/spatial-interaction-modeling"},{"title":"parkererickson/crunchBaseGraph","url":"https://github.com/parkererickson/crunchBaseGraph"},{"title":"chalothon/Graph-Convolutional-Networks-for-Relational-Link-Prediction","url":"https://github.com/chalothon/Graph-Convolutional-Networks-for-Relational-Link-Prediction"},{"title":"QustKcz/relational-GCN","url":"https://github.com/QustKcz/relational-GCN"},{"title":"yangyucheng000/Papers","url":"https://github.com/yangyucheng000/Papers/tree/main/MindSpore-Retrieval-augmented"}],"syntology":{"n":32,"n_ran":10,"n_unverified":22,"n_pointer_only":15}}},{"leaderboard":"/sota/node-classification-on-amz-comp","slug":"node-classification-on-amz-comp","dataset":"AMZ Comp","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"HH-GCN","paper_title":"Half-Hop: A graph upsampling approach for slowing down message passing","paper_url":"/paper/half-hop-a-graph-upsampling-approach-for","paper_date":"2023-08-17","arxiv_id":"2308.09198","code_links":[{"title":"nerdslab/halfhop","url":"https://github.com/nerdslab/halfhop"}],"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-bgs","slug":"node-classification-on-bgs","dataset":"BGS","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SCENE","paper_title":"SCENE: Reasoning about Traffic Scenes using Heterogeneous Graph Neural Networks","paper_url":"/paper/scene-reasoning-about-traffic-scenes-using","paper_date":"2023-01-09","arxiv_id":"2301.03512","code_links":[{"title":"schmidt-ju/scene","url":"https://github.com/schmidt-ju/scene"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-brazil-air-traffic","slug":"node-classification-on-brazil-air-traffic","dataset":"Brazil Air-Traffic","dataset_url":"/dataset/brazil-air-traffic","rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"UGT","paper_title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","paper_url":"/paper/transitivity-preserving-graph-representation","paper_date":"2023-08-18","arxiv_id":"2308.09517","code_links":[{"title":"nslab-cuk/unified-graph-transformer","url":"https://github.com/nslab-cuk/unified-graph-transformer"},{"title":"nslab-cuk/community-aware-graph-transformer","url":"https://github.com/nslab-cuk/community-aware-graph-transformer"},{"title":"nslab-cuk/literalkg","url":"https://github.com/nslab-cuk/literalkg"}],"syntology":{"n":26,"n_ran":5,"n_unverified":21,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-citeseer-full","slug":"node-classification-on-citeseer-full","dataset":"Citeseer Full-supervised","dataset_url":"/dataset/citeseer","rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"IncepGCN+DropEdge","paper_title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","paper_url":"/paper/the-truly-deep-graph-convolutional-networks","paper_date":"2019-07-25","arxiv_id":"1907.10903","code_links":[{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT"},{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT/tree/master/graphsaint/open_graph_benchmark"},{"title":"DropEdge/DropEdge","url":"https://github.com/DropEdge/DropEdge"},{"title":"chr26195/pmlp","url":"https://github.com/chr26195/pmlp"},{"title":"zjunet/dropmessage","url":"https://github.com/zjunet/dropmessage"},{"title":"luckytiger123/dropmessage","url":"https://github.com/luckytiger123/dropmessage"},{"title":"sandl99/KGraph","url":"https://github.com/sandl99/KGraph"}],"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-europe-air-traffic","slug":"node-classification-on-europe-air-traffic","dataset":"Europe Air-Traffic","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"UGT","paper_title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","paper_url":"/paper/transitivity-preserving-graph-representation","paper_date":"2023-08-18","arxiv_id":"2308.09517","code_links":[{"title":"nslab-cuk/unified-graph-transformer","url":"https://github.com/nslab-cuk/unified-graph-transformer"},{"title":"nslab-cuk/community-aware-graph-transformer","url":"https://github.com/nslab-cuk/community-aware-graph-transformer"},{"title":"nslab-cuk/literalkg","url":"https://github.com/nslab-cuk/literalkg"}],"syntology":{"n":26,"n_ran":5,"n_unverified":21,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-pokec","slug":"node-classification-on-pokec","dataset":"pokec","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NeuralWalker","paper_title":"Learning Long Range Dependencies on Graphs via Random Walks","paper_url":"/paper/learning-long-range-dependencies-on-graphs","paper_date":"2024-06-05","arxiv_id":"2406.03386","code_links":[{"title":"borgwardtlab/neuralwalker","url":"https://github.com/borgwardtlab/neuralwalker"}],"syntology":{"n":13,"n_ran":13,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-pubmed-full-supervised","slug":"node-classification-on-pubmed-full-supervised","dataset":"Pubmed Full-supervised","dataset_url":"/dataset/pubmed","rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphSAGE+DropEdge","paper_title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","paper_url":"/paper/the-truly-deep-graph-convolutional-networks","paper_date":"2019-07-25","arxiv_id":"1907.10903","code_links":[{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT"},{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT/tree/master/graphsaint/open_graph_benchmark"},{"title":"DropEdge/DropEdge","url":"https://github.com/DropEdge/DropEdge"},{"title":"chr26195/pmlp","url":"https://github.com/chr26195/pmlp"},{"title":"zjunet/dropmessage","url":"https://github.com/zjunet/dropmessage"},{"title":"luckytiger123/dropmessage","url":"https://github.com/luckytiger123/dropmessage"},{"title":"sandl99/KGraph","url":"https://github.com/sandl99/KGraph"}],"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-roman-empire","slug":"node-classification-on-roman-empire","dataset":"roman-empire","dataset_url":"/dataset/roman-empire","rows_in_archive":7,"metrics":["Accuracy (% )"],"first_row_in_archive_order":{"model":"Polynormer","paper_title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","paper_url":"/paper/polynormer-polynomial-expressive-graph","paper_date":"2024-03-02","arxiv_id":"2403.01232","code_links":[{"title":"cornell-zhang/Polynormer","url":"https://github.com/cornell-zhang/Polynormer/tree/master/large_graph_exp"},{"title":"cornell-zhang/polynormer","url":"https://github.com/cornell-zhang/polynormer"}],"syntology":{"n":8,"n_ran":5,"n_unverified":3,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-usa-air-traffic","slug":"node-classification-on-usa-air-traffic","dataset":"USA Air-Traffic","dataset_url":"/dataset/usa-air-traffic","rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"UGT","paper_title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","paper_url":"/paper/transitivity-preserving-graph-representation","paper_date":"2023-08-18","arxiv_id":"2308.09517","code_links":[{"title":"nslab-cuk/unified-graph-transformer","url":"https://github.com/nslab-cuk/unified-graph-transformer"},{"title":"nslab-cuk/community-aware-graph-transformer","url":"https://github.com/nslab-cuk/community-aware-graph-transformer"},{"title":"nslab-cuk/literalkg","url":"https://github.com/nslab-cuk/literalkg"}],"syntology":{"n":26,"n_ran":5,"n_unverified":21,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-amazon-fraud","slug":"node-classification-on-amazon-fraud","dataset":"Amazon-Fraud","dataset_url":"/dataset/amazon-fraud","rows_in_archive":6,"metrics":["AUC-ROC"],"first_row_in_archive_order":{"model":"LEX-GNN","paper_title":"LEX-GNN: Label-Exploring Graph Neural Network for Accurate Fraud Detection","paper_url":"/paper/lex-gnn-label-exploring-graph-neural-network","paper_date":"2024-10-21","arxiv_id":null,"code_links":[{"title":"wdhyun/LEX-GNN","url":"https://github.com/wdhyun/LEX-GNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-blogcatalog-1","slug":"node-classification-on-blogcatalog-1","dataset":"BlogCatalog","dataset_url":null,"rows_in_archive":6,"metrics":["Accuracy","Macro-F1"],"first_row_in_archive_order":{"model":"ISNE","paper_title":"Unsupervised Graph Representation Learning with Inductive Shallow Node Embedding","paper_url":"/paper/unsupervised-graph-representation-learning","paper_date":"2024-07-12","arxiv_id":null,"code_links":[{"title":"ricsi98/inductive-shallow-node-embedding","url":"https://github.com/ricsi98/inductive-shallow-node-embedding"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-dblp","slug":"node-classification-on-dblp","dataset":"DBLP","dataset_url":"/dataset/dblp","rows_in_archive":6,"metrics":["Accuracy","Micro F1","Inference Time (ms)","Macro F1"],"first_row_in_archive_order":{"model":"GRACE","paper_title":"Deep Graph Contrastive Representation Learning","paper_url":"/paper/deep-graph-contrastive-representation","paper_date":"2020-06-07","arxiv_id":"2006.04131","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/grace"},{"title":"CRIPAC-DIG/GRACE","url":"https://github.com/CRIPAC-DIG/GRACE"},{"title":"ycremar/DIG-SSL","url":"https://github.com/ycremar/DIG-SSL"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}}},{"leaderboard":"/sota/node-classification-on-mutag","slug":"node-classification-on-mutag","dataset":"MUTAG","dataset_url":"/dataset/mutag","rows_in_archive":6,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"BoP","paper_title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","paper_url":"/paper/from-primes-to-paths-enabling-fast-multi","paper_date":"2024-11-17","arxiv_id":"2411.11149","code_links":[{"title":"kbogas/PAM_BoP","url":"https://github.com/kbogas/PAM_BoP"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-wiki-cs","slug":"node-classification-on-wiki-cs","dataset":"Wiki-CS","dataset_url":"/dataset/wiki-cs","rows_in_archive":6,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CGT","paper_title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","paper_url":"/paper/mitigating-degree-biases-in-message-passing","paper_date":"2023-12-28","arxiv_id":"2312.16788","code_links":[{"title":"nslab-cuk/community-aware-graph-transformer","url":"https://github.com/nslab-cuk/community-aware-graph-transformer"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-wiki-vote","slug":"node-classification-on-wiki-vote","dataset":"Wiki-Vote","dataset_url":null,"rows_in_archive":6,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"DEMO-Net(weight)","paper_title":"DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph Classification","paper_url":"/paper/demo-net-degree-specific-graph-neural","paper_date":"2019-06-05","arxiv_id":"1906.02319","code_links":[{"title":"jwu4sml/DEMO-Net","url":"https://github.com/jwu4sml/DEMO-Net"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-wikipedia","slug":"node-classification-on-wikipedia","dataset":"Wikipedia","dataset_url":null,"rows_in_archive":6,"metrics":["Macro-F1","Accuracy"],"first_row_in_archive_order":{"model":"GraphGAN","paper_title":"GraphGAN: Graph Representation Learning with Generative Adversarial Nets","paper_url":"/paper/graphgan-graph-representation-learning-with","paper_date":"2017-11-22","arxiv_id":"1711.08267","code_links":[{"title":"hwwang55/GraphGAN","url":"https://github.com/hwwang55/GraphGAN"},{"title":"liutongyang/GraphGAN-pytorch","url":"https://github.com/liutongyang/GraphGAN-pytorch"},{"title":"shuo-git/GraphGAN","url":"https://github.com/shuo-git/GraphGAN"},{"title":"hyunjin72/GraphGAN-PyTorch","url":"https://github.com/hyunjin72/GraphGAN-PyTorch"},{"title":"liuxinkai94/Graph-embedding","url":"https://github.com/liuxinkai94/Graph-embedding"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-amz-computers","slug":"node-classification-on-amz-computers","dataset":"AMZ Computers","dataset_url":"/dataset/amz-computers","rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCGCN","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-blogcatalog","slug":"node-classification-on-blogcatalog","dataset":"Eximtradedata","dataset_url":null,"rows_in_archive":5,"metrics":["Accuracy","Macro-F1","Macro F1","Micro F1"],"first_row_in_archive_order":{"model":"Struc2vec","paper_title":"struc2vec: Learning Node Representations from Structural Identity","paper_url":"/paper/struc2vec-learning-node-representations-from","paper_date":"2017-04-11","arxiv_id":"1704.03165","code_links":[{"title":"shenweichen/GraphEmbedding","url":"https://github.com/shenweichen/GraphEmbedding"},{"title":"leoribeiro/struc2vec","url":"https://github.com/leoribeiro/struc2vec"},{"title":"snap-stanford/graphwave","url":"https://github.com/snap-stanford/graphwave"},{"title":"liuxinkai94/Graph-embedding","url":"https://github.com/liuxinkai94/Graph-embedding"},{"title":"zehong-wang/subgraph-pooling","url":"https://github.com/zehong-wang/subgraph-pooling"}],"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-cora-full","slug":"node-classification-on-cora-full","dataset":"Cora Full","dataset_url":null,"rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCSAGE","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-log-angeles","slug":"node-classification-on-log-angeles","dataset":"Log Angeles","dataset_url":"/dataset/city-networks","rows_in_archive":5,"metrics":["Average Top-1 Accuracy"],"first_row_in_archive_order":{"model":"IM-GCN","paper_title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","paper_url":"/paper/improving-the-effective-receptive-field-of","paper_date":"2025-05-29","arxiv_id":"2505.23185","code_links":[{"title":"bgu-cs-vil/im-mpnn","url":"https://github.com/bgu-cs-vil/im-mpnn"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-london","slug":"node-classification-on-london","dataset":"London","dataset_url":"/dataset/city-networks","rows_in_archive":5,"metrics":["Average Top-1 Accuracy"],"first_row_in_archive_order":{"model":"IM-GCN","paper_title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","paper_url":"/paper/improving-the-effective-receptive-field-of","paper_date":"2025-05-29","arxiv_id":"2505.23185","code_links":[{"title":"bgu-cs-vil/im-mpnn","url":"https://github.com/bgu-cs-vil/im-mpnn"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-paris","slug":"node-classification-on-paris","dataset":"Paris","dataset_url":"/dataset/city-networks","rows_in_archive":5,"metrics":["Average Top-1 Accuracy"],"first_row_in_archive_order":{"model":"IM-GCN","paper_title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","paper_url":"/paper/improving-the-effective-receptive-field-of","paper_date":"2025-05-29","arxiv_id":"2505.23185","code_links":[{"title":"bgu-cs-vil/im-mpnn","url":"https://github.com/bgu-cs-vil/im-mpnn"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-placenta","slug":"node-classification-on-placenta","dataset":"Placenta","dataset_url":"/dataset/placenta","rows_in_archive":5,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"GraphSAGE","paper_title":"A New Graph Node Classification Benchmark: Learning Structure from Histology Cell Graphs","paper_url":"/paper/a-new-graph-node-classification-benchmark","paper_date":"2022-11-11","arxiv_id":"2211.06292","code_links":[{"title":"nellaker-group/placenta","url":"https://github.com/nellaker-group/placenta"}],"syntology":{"n":3,"n_ran":0,"n_unverified":3,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-shanghai","slug":"node-classification-on-shanghai","dataset":"Shanghai","dataset_url":"/dataset/city-networks","rows_in_archive":5,"metrics":["Average Top-1 Accuracy"],"first_row_in_archive_order":{"model":"IM-GCN","paper_title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","paper_url":"/paper/improving-the-effective-receptive-field-of","paper_date":"2025-05-29","arxiv_id":"2505.23185","code_links":[{"title":"bgu-cs-vil/im-mpnn","url":"https://github.com/bgu-cs-vil/im-mpnn"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-amazon-ratings","slug":"node-classification-on-amazon-ratings","dataset":"amazon-ratings","dataset_url":"/dataset/amazon-ratings","rows_in_archive":4,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"GAT","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","paper_url":"/paper/classic-gnns-are-strong-baselines-reassessing","paper_date":"2024-06-13","arxiv_id":"2406.08993","code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}],"syntology":{"n":9,"n_ran":2,"n_unverified":7,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-ava","slug":"node-classification-on-ava","dataset":"AVA","dataset_url":"/dataset/ava","rows_in_archive":4,"metrics":["mAP"],"first_row_in_archive_order":{"model":"ASDNet [ASDNet_ICCV2021]","paper_title":"Learning Long-Term Spatial-Temporal Graphs for Active Speaker Detection","paper_url":"/paper/learning-long-term-spatial-temporal-graphs","paper_date":"2022-07-15","arxiv_id":"2207.07783","code_links":[{"title":"sra2/spell","url":"https://github.com/sra2/spell"},{"title":"kylemin/SPELL","url":"https://github.com/kylemin/SPELL"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-chameleon-48-32-20","slug":"node-classification-on-chameleon-48-32-20","dataset":"Chameleon (48%/32%/20% fixed splits)","dataset_url":"/dataset/chameleon-48-32-20-fixed-splits","rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GREAD-BS","paper_title":"GREAD: Graph Neural Reaction-Diffusion Networks","paper_url":"/paper/gread-graph-neural-reaction-diffusion","paper_date":"2022-11-25","arxiv_id":"2211.14208","code_links":[{"title":"jeongwhanchoi/gread","url":"https://github.com/jeongwhanchoi/gread"}],"syntology":{"n":10,"n_ran":3,"n_unverified":7,"n_pointer_only":3}}},{"leaderboard":"/sota/node-classification-on-cora-full-with-public","slug":"node-classification-on-cora-full-with-public","dataset":"Cora Full with Public Split","dataset_url":null,"rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CoLinkDist","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_url":"/paper/distilling-self-knowledge-from-contrastive","paper_date":"2021-06-16","arxiv_id":"2106.08541","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}}},{"leaderboard":"/sota/node-classification-on-mag-scholar-c","slug":"node-classification-on-mag-scholar-c","dataset":"MAG-scholar-C","dataset_url":"/dataset/mag-scholar-c-1","rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"FastGCN","paper_title":"GRAND+: Scalable Graph Random Neural Networks","paper_url":"/paper/grand-scalable-graph-random-neural-networks","paper_date":"2022-03-12","arxiv_id":"2203.06389","code_links":[{"title":"wzfhaha/grand-plus","url":"https://github.com/wzfhaha/grand-plus"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-mag240m-lsc","slug":"node-classification-on-mag240m-lsc","dataset":"MAG240M-LSC","dataset_url":"/dataset/ogb-lsc","rows_in_archive":4,"metrics":["Test Accuracy","Validation Accuracy"],"first_row_in_archive_order":{"model":"R-GraphSAGE (NS)","paper_title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","paper_url":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","paper_date":"2021-03-17","arxiv_id":"2103.09430","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ogb_lsc"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb"},{"title":"graphcore/ogb-lsc-pcqm4mv2","url":"https://github.com/graphcore/ogb-lsc-pcqm4mv2"},{"title":"shamim-hussain/egt","url":"https://github.com/shamim-hussain/egt"},{"title":"graphcore/distributed-kge-poplar","url":"https://github.com/graphcore/distributed-kge-poplar"},{"title":"lars-research/3d-pgt","url":"https://github.com/lars-research/3d-pgt"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-minesweeper","slug":"node-classification-on-minesweeper","dataset":"minesweeper","dataset_url":"/dataset/minesweeper","rows_in_archive":4,"metrics":["AUCROC"],"first_row_in_archive_order":{"model":"GCN","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","paper_url":"/paper/classic-gnns-are-strong-baselines-reassessing","paper_date":"2024-06-13","arxiv_id":"2406.08993","code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}],"syntology":{"n":9,"n_ran":2,"n_unverified":7,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-mumin-large","slug":"node-classification-on-mumin-large","dataset":"MuMiN-large","dataset_url":"/dataset/mumin-large","rows_in_archive":4,"metrics":["Claim Classification Macro-F1","Tweet Classification Macro-F1"],"first_row_in_archive_order":{"model":"HeteroGraphSAGE","paper_title":"MuMiN: A Large-Scale Multilingual Multimodal Fact-Checked Misinformation Social Network Dataset","paper_url":"/paper/mumin-a-large-scale-multilingual-multimodal","paper_date":"2022-02-23","arxiv_id":"2202.11684","code_links":[{"title":"MuMiN-dataset/mumin-build","url":"https://github.com/MuMiN-dataset/mumin-build"},{"title":"MuMiN-dataset/mumin-baseline","url":"https://github.com/MuMiN-dataset/mumin-baseline"},{"title":"MuMiN-dataset/mumin-trawl","url":"https://github.com/MuMiN-dataset/mumin-trawl"}],"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-mumin-medium","slug":"node-classification-on-mumin-medium","dataset":"MuMiN-medium","dataset_url":"/dataset/mumin-medium","rows_in_archive":4,"metrics":["Claim Classification Macro-F1","Tweet Classification Macro-F1"],"first_row_in_archive_order":{"model":"HeteroGraphSAGE","paper_title":"MuMiN: A Large-Scale Multilingual Multimodal Fact-Checked Misinformation Social Network Dataset","paper_url":"/paper/mumin-a-large-scale-multilingual-multimodal","paper_date":"2022-02-23","arxiv_id":"2202.11684","code_links":[{"title":"MuMiN-dataset/mumin-build","url":"https://github.com/MuMiN-dataset/mumin-build"},{"title":"MuMiN-dataset/mumin-baseline","url":"https://github.com/MuMiN-dataset/mumin-baseline"},{"title":"MuMiN-dataset/mumin-trawl","url":"https://github.com/MuMiN-dataset/mumin-trawl"}],"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-mumin-small","slug":"node-classification-on-mumin-small","dataset":"MuMiN-small","dataset_url":"/dataset/mumin-small","rows_in_archive":4,"metrics":["Claim Classification Macro-F1","Tweet Classification Macro-F1"],"first_row_in_archive_order":{"model":"LaBSE","paper_title":"MuMiN: A Large-Scale Multilingual Multimodal Fact-Checked Misinformation Social Network Dataset","paper_url":"/paper/mumin-a-large-scale-multilingual-multimodal","paper_date":"2022-02-23","arxiv_id":"2202.11684","code_links":[{"title":"MuMiN-dataset/mumin-build","url":"https://github.com/MuMiN-dataset/mumin-build"},{"title":"MuMiN-dataset/mumin-baseline","url":"https://github.com/MuMiN-dataset/mumin-baseline"},{"title":"MuMiN-dataset/mumin-trawl","url":"https://github.com/MuMiN-dataset/mumin-trawl"}],"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-nell","slug":"node-classification-on-nell","dataset":"NELL","dataset_url":"/dataset/nell","rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"DFNet-ATT","paper_title":"DFNets: Spectral CNNs for Graphs with Feedback-Looped Filters","paper_url":"/paper/dfnets-spectral-cnns-for-graphs-with-feedback","paper_date":"2019-10-24","arxiv_id":"1910.10866","code_links":[{"title":"wokas36/DFNets","url":"https://github.com/wokas36/DFNets"}],"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-squirrel-48-32-20","slug":"node-classification-on-squirrel-48-32-20","dataset":"Squirrel (48%/32%/20% fixed splits)","dataset_url":"/dataset/squirrel-48-32-20-fixed-splits","rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GREAD-BS","paper_title":"GREAD: Graph Neural Reaction-Diffusion Networks","paper_url":"/paper/gread-graph-neural-reaction-diffusion","paper_date":"2022-11-25","arxiv_id":"2211.14208","code_links":[{"title":"jeongwhanchoi/gread","url":"https://github.com/jeongwhanchoi/gread"}],"syntology":{"n":10,"n_ran":3,"n_unverified":7,"n_pointer_only":3}}},{"leaderboard":"/sota/node-classification-on-tolokers","slug":"node-classification-on-tolokers","dataset":"tolokers","dataset_url":"/dataset/tolokers","rows_in_archive":4,"metrics":["AUCROC"],"first_row_in_archive_order":{"model":"Polynormer","paper_title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","paper_url":"/paper/polynormer-polynomial-expressive-graph","paper_date":"2024-03-02","arxiv_id":"2403.01232","code_links":[{"title":"cornell-zhang/Polynormer","url":"https://github.com/cornell-zhang/Polynormer/tree/master/large_graph_exp"},{"title":"cornell-zhang/polynormer","url":"https://github.com/cornell-zhang/polynormer"}],"syntology":{"n":8,"n_ran":5,"n_unverified":3,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-cornell-48-32-20-fixed","slug":"node-classification-on-cornell-48-32-20-fixed","dataset":"Cornell (48%/32%/20% fixed splits)","dataset_url":"/dataset/cornell-48-32-20-fixed-splits","rows_in_archive":3,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GREAD-AC","paper_title":"GREAD: Graph Neural Reaction-Diffusion Networks","paper_url":"/paper/gread-graph-neural-reaction-diffusion","paper_date":"2022-11-25","arxiv_id":"2211.14208","code_links":[{"title":"jeongwhanchoi/gread","url":"https://github.com/jeongwhanchoi/gread"}],"syntology":{"n":10,"n_ran":3,"n_unverified":7,"n_pointer_only":3}}},{"leaderboard":"/sota/node-classification-on-ms-academic","slug":"node-classification-on-ms-academic","dataset":"MS ACADEMIC","dataset_url":null,"rows_in_archive":3,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"APPNP","paper_title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","paper_url":"/paper/predict-then-propagate-graph-neural-networks","paper_date":"2018-10-14","arxiv_id":"1810.05997","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/appnp"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/appnp"},{"title":"benedekrozemberczki/APPNP","url":"https://github.com/benedekrozemberczki/APPNP"},{"title":"klicperajo/ppnp","url":"https://github.com/klicperajo/ppnp"},{"title":"mahequn001/graphlearning","url":"https://github.com/mahequn001/graphlearning/tree/master/model_zoo/appnp"}],"syntology":{"n":12,"n_ran":1,"n_unverified":11,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-questions","slug":"node-classification-on-questions","dataset":"questions","dataset_url":"/dataset/questions","rows_in_archive":3,"metrics":["AUCROC"],"first_row_in_archive_order":{"model":"NID","paper_title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","paper_url":"/paper/structure-aware-semantic-node-identifiers-for","paper_date":"2024-05-26","arxiv_id":"2405.16435","code_links":[{"title":"LUOyk1999/NodeID","url":"https://github.com/LUOyk1999/NodeID"}],"syntology":{"n":13,"n_ran":10,"n_unverified":3,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-amplus","slug":"node-classification-on-amplus","dataset":"AMPLUS","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"RR-GCN-PPV","paper_title":"R-GCN: The R Could Stand for Random","paper_url":"/paper/r-gcn-the-r-could-stand-for-random","paper_date":"2022-03-04","arxiv_id":"2203.02424","code_links":[{"title":"predict-idlab/RR-GCN","url":"https://github.com/predict-idlab/RR-GCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-chameleon-60-20-20-1","slug":"node-classification-on-chameleon-60-20-20-1","dataset":"Chameleon(60%/20%/20% random splits)","dataset_url":"/dataset/chameleon-60-20-20-random-splits-1","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCSAGE","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer-fixed-20-node","slug":"node-classification-on-citeseer-fixed-20-node","dataset":"Citeseer: fixed 20 node per class","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SDSS-GAT","paper_title":"Multi-task Self-distillation for Graph-based Semi-Supervised Learning","paper_url":"/paper/multi-task-self-distillation-for-graph-based","paper_date":"2021-12-02","arxiv_id":"2112.01174","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-coauthor-phy","slug":"node-classification-on-coauthor-phy","dataset":"Coauthor Phy","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GCN-LPA","paper_title":"Unifying Graph Convolutional Neural Networks and Label Propagation","paper_url":"/paper/unifying-graph-convolutional-neural-networks-1","paper_date":"2020-02-17","arxiv_id":"2002.06755","code_links":[{"title":"hwwang55/GCN-LPA","url":"https://github.com/hwwang55/GCN-LPA"},{"title":"achalagarwal/gcn-lpa","url":"https://github.com/achalagarwal/gcn-lpa"}],"syntology":{"n":14,"n_ran":2,"n_unverified":12,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-cora-fixed-10-node-per","slug":"node-classification-on-cora-fixed-10-node-per","dataset":"Cora: fixed 10 node per class","dataset_url":"/dataset/cora","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-tra-GCNII","paper_title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","paper_url":"/paper/extract-the-knowledge-of-graph-neural","paper_date":"2021-03-04","arxiv_id":"2103.02885","code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}],"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}}},{"leaderboard":"/sota/node-classification-on-cora-fixed-5-node-per","slug":"node-classification-on-cora-fixed-5-node-per","dataset":"Cora: fixed 5 node per class","dataset_url":"/dataset/cora","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-tra-APPNP","paper_title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","paper_url":"/paper/extract-the-knowledge-of-graph-neural","paper_date":"2021-03-04","arxiv_id":"2103.02885","code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}],"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}}},{"leaderboard":"/sota/node-classification-on-crocodile","slug":"node-classification-on-crocodile","dataset":"Crocodile","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"LW-GCN","paper_title":"Label-Wise Graph Convolutional Network for Heterophilic Graphs","paper_url":"/paper/label-wise-message-passing-graph-neural","paper_date":"2021-10-15","arxiv_id":"2110.08128","code_links":[{"title":"enyandai/lwgcn","url":"https://github.com/enyandai/lwgcn"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-deezer-romania","slug":"node-classification-on-deezer-romania","dataset":"Deezer Romania","dataset_url":null,"rows_in_archive":2,"metrics":["Micro-F1"],"first_row_in_archive_order":{"model":"PairE","paper_title":"Graph Representation Learning Beyond Node and Homophily","paper_url":"/paper/graph-representation-learning-beyond-node-and","paper_date":"2022-03-03","arxiv_id":"2203.01564","code_links":[{"title":"syvail/PairE-Graph-Representation-Learning-Beyond-Node-and-Homophily","url":"https://github.com/syvail/PairE-Graph-Representation-Learning-Beyond-Node-and-Homophily"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-dmg777k","slug":"node-classification-on-dmg777k","dataset":"DMG777K","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"RR-GCN-PPV","paper_title":"R-GCN: The R Could Stand for Random","paper_url":"/paper/r-gcn-the-r-could-stand-for-random","paper_date":"2022-03-04","arxiv_id":"2203.02424","code_links":[{"title":"predict-idlab/RR-GCN","url":"https://github.com/predict-idlab/RR-GCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-dmgfull","slug":"node-classification-on-dmgfull","dataset":"DMGFULL","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"RR-GCN-PPV","paper_title":"R-GCN: The R Could Stand for Random","paper_url":"/paper/r-gcn-the-r-could-stand-for-random","paper_date":"2022-03-04","arxiv_id":"2203.02424","code_links":[{"title":"predict-idlab/RR-GCN","url":"https://github.com/predict-idlab/RR-GCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-mdgenre","slug":"node-classification-on-mdgenre","dataset":"MDGENRE","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"R-GCN","paper_title":"R-GCN: The R Could Stand for Random","paper_url":"/paper/r-gcn-the-r-could-stand-for-random","paper_date":"2022-03-04","arxiv_id":"2203.02424","code_links":[{"title":"predict-idlab/RR-GCN","url":"https://github.com/predict-idlab/RR-GCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-squirrel-60-20-20-1","slug":"node-classification-on-squirrel-60-20-20-1","dataset":"Squirrel(60%/20%/20% random splits)","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCSAGE","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-telegram-directed-1","slug":"node-classification-on-telegram-directed-1","dataset":"Telegram (Directed Graph label rate 60%)","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"ScaleNet","paper_title":"Scale Invariance of Graph Neural Networks","paper_url":"/paper/scale-invariance-of-graph-neural-networks","paper_date":"2024-11-28","arxiv_id":"2411.19392","code_links":[{"title":"qin87/scalenet","url":"https://github.com/qin87/scalenet"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-texas-48-32-20-fixed","slug":"node-classification-on-texas-48-32-20-fixed","dataset":"Texas (48%/32%/20% fixed splits)","dataset_url":"/dataset/texas-48-32-20-fixed-splits","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GREAD-F","paper_title":"GREAD: Graph Neural Reaction-Diffusion Networks","paper_url":"/paper/gread-graph-neural-reaction-diffusion","paper_date":"2022-11-25","arxiv_id":"2211.14208","code_links":[{"title":"jeongwhanchoi/gread","url":"https://github.com/jeongwhanchoi/gread"}],"syntology":{"n":10,"n_ran":3,"n_unverified":7,"n_pointer_only":3}}},{"leaderboard":"/sota/node-classification-on-twitch-gamers","slug":"node-classification-on-twitch-gamers","dataset":"twitch-gamers","dataset_url":"/dataset/twitch-gamers","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Dual-Net GNN","paper_title":"Feature Selection: Key to Enhance Node Classification with Graph Neural Networks","paper_url":"/paper/feature-selection-key-to-enhance-node","paper_date":"2023-01-25","arxiv_id":null,"code_links":[{"title":"sunilkmaurya/DualNetGNN_large","url":"https://github.com/sunilkmaurya/DualNetGNN_large"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-wiki","slug":"node-classification-on-wiki","dataset":"Wiki","dataset_url":"/dataset/wiki","rows_in_archive":2,"metrics":["AUC","Macro F1","Micro F1"],"first_row_in_archive_order":{"model":"DANMF","paper_title":"Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection","paper_url":"/paper/deep-autoencoder-like-nonnegative-matrix","paper_date":"2018-10-22","arxiv_id":null,"code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/DANMF","url":"https://github.com/benedekrozemberczki/DANMF"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-wiki-1","slug":"node-classification-on-wiki-1","dataset":"wiki","dataset_url":"/dataset/wiki","rows_in_archive":2,"metrics":["ACCURACY"],"first_row_in_archive_order":{"model":"A2DUG","paper_title":"A Simple and Scalable Graph Neural Network for Large Directed Graphs","paper_url":"/paper/why-using-either-aggregated-features-or","paper_date":"2023-06-14","arxiv_id":"2306.08274","code_links":[{"title":"seijimaekawa/a2dug","url":"https://github.com/seijimaekawa/a2dug"}],"syntology":{"n":13,"n_ran":3,"n_unverified":10,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-wisconsin-48-32-20","slug":"node-classification-on-wisconsin-48-32-20","dataset":"Wisconsin (48%/32%/20% fixed splits)","dataset_url":"/dataset/wisconsin-48-32-20-fixed-splits","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GREAD-BS","paper_title":"GREAD: Graph Neural Reaction-Diffusion Networks","paper_url":"/paper/gread-graph-neural-reaction-diffusion","paper_date":"2022-11-25","arxiv_id":"2211.14208","code_links":[{"title":"jeongwhanchoi/gread","url":"https://github.com/jeongwhanchoi/gread"}],"syntology":{"n":10,"n_ran":3,"n_unverified":7,"n_pointer_only":3}}},{"leaderboard":"/sota/node-classification-on-youtube","slug":"node-classification-on-youtube","dataset":"YouTube","dataset_url":null,"rows_in_archive":2,"metrics":["Macro-F1@2%","Micro-F1@2%","runtime (s)"],"first_row_in_archive_order":{"model":"LINE","paper_title":"GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding","paper_url":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid","paper_date":"2019-03-02","arxiv_id":"1903.00757","code_links":[{"title":"DeepGraphLearning/graphvite","url":"https://github.com/DeepGraphLearning/graphvite"}],"syntology":{"n":7,"n_ran":0,"n_unverified":7,"n_pointer_only":0}}},{"leaderboard":"/sota/node-classification-on-20news","slug":"node-classification-on-20news","dataset":"20NEWS","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraRep","paper_title":"GraRep: Learning Graph Representations with Global Structural Information","paper_url":"/paper/grarep-learning-graph-representations-with","paper_date":"2015-10-17","arxiv_id":null,"code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GraRep","url":"https://github.com/benedekrozemberczki/GraRep"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-amazon2m","slug":"node-classification-on-amazon2m","dataset":"Amazon2M","dataset_url":null,"rows_in_archive":1,"metrics":["F1"],"first_row_in_archive_order":{"model":"Cluster-GCN","paper_title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","paper_url":"/paper/cluster-gcn-an-efficient-algorithm-for","paper_date":"2019-05-20","arxiv_id":"1905.07953","code_links":[{"title":"google-research/google-research","url":"https://github.com/google-research/google-research"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/cluster_gcn"},{"title":"benedekrozemberczki/ClusterGCN","url":"https://github.com/benedekrozemberczki/ClusterGCN"},{"title":"qitianwu/nodeformer","url":"https://github.com/qitianwu/nodeformer"},{"title":"NIRVANALAN/ClusterGCN_google-reseach","url":"https://github.com/NIRVANALAN/ClusterGCN_google-reseach"},{"title":"zhengjingwei/cluster_GCN","url":"https://github.com/zhengjingwei/cluster_GCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-amz-computers-fixed-20","slug":"node-classification-on-amz-computers-fixed-20","dataset":"AMZ Computers: fixed 20 node per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SDSS-GCN","paper_title":"Multi-task Self-distillation for Graph-based Semi-Supervised Learning","paper_url":"/paper/multi-task-self-distillation-for-graph-based","paper_date":"2021-12-02","arxiv_id":"2112.01174","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-bgp","slug":"node-classification-on-bgp","dataset":"BGP","dataset_url":"/dataset/bgp","rows_in_archive":1,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"PathNet","paper_title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","paper_url":"/paper/beyond-homophily-structure-aware-path","paper_date":"2022-07-20","arxiv_id":null,"code_links":[{"title":"zjunet/PathNet","url":"https://github.com/zjunet/PathNet"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-bitcoin-alpha","slug":"node-classification-on-bitcoin-alpha","dataset":"Bitcoin-Alpha","dataset_url":null,"rows_in_archive":1,"metrics":["F1-score"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_url":"/paper/graphmix-regularized-training-of-graph-neural","paper_date":"2019-09-25","arxiv_id":"1909.11715","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-bitcoin-otc","slug":"node-classification-on-bitcoin-otc","dataset":"Bitcoin-OTC","dataset_url":null,"rows_in_archive":1,"metrics":["F1-score"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_url":"/paper/graphmix-regularized-training-of-graph-neural","paper_date":"2019-09-25","arxiv_id":"1909.11715","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-celltypegraph","slug":"node-classification-on-celltypegraph","dataset":"CellTypeGraph Benchmark","dataset_url":"/dataset/celltypegraph-benchmark","rows_in_archive":1,"metrics":["Top-1 accuracy","class-average Accuracy"],"first_row_in_archive_order":{"model":"plantcelltype-EdgeDeeperGCN","paper_title":"CellTypeGraph: A New Geometric Computer Vision Benchmark","paper_url":"/paper/celltypegraph-a-new-geometric-computer-vision","paper_date":"2022-05-17","arxiv_id":"2205.08166","code_links":[{"title":"hci-unihd/celltype-graph-benchmark","url":"https://github.com/hci-unihd/celltype-graph-benchmark"},{"title":"hci-unihd/plant-celltype","url":"https://github.com/hci-unihd/plant-celltype"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer-5-nodes-per","slug":"node-classification-on-citeseer-5-nodes-per","dataset":"CiteSeer: 5 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer-random","slug":"node-classification-on-citeseer-random","dataset":"Citeseer random partition","dataset_url":"/dataset/citeseer","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_url":"/paper/graphmix-regularized-training-of-graph-neural","paper_date":"2019-09-25","arxiv_id":"1909.11715","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer-with-public-1","slug":"node-classification-on-citeseer-with-public-1","dataset":"CiteSeer with Public Split: fixed 5 nodes per class","dataset_url":"/dataset/citeseer","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_url":"/paper/graphmix-regularized-training-of-graph-neural","paper_date":"2019-09-25","arxiv_id":"1909.11715","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cora-5-nodes-per-class","slug":"node-classification-on-cora-5-nodes-per-class","dataset":"Cora: 5 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cora-fixed-20-nodes","slug":"node-classification-on-cora-fixed-20-nodes","dataset":"Cora: fixed 20 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SDSS-GCN","paper_title":"Multi-task Self-distillation for Graph-based Semi-Supervised Learning","paper_url":"/paper/multi-task-self-distillation-for-graph-based","paper_date":"2021-12-02","arxiv_id":"2112.01174","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cora-random-partition","slug":"node-classification-on-cora-random-partition","dataset":"Cora random partition","dataset_url":"/dataset/cora","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_url":"/paper/graphmix-regularized-training-of-graph-neural","paper_date":"2019-09-25","arxiv_id":"1909.11715","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-dblp-20-nodes-per","slug":"node-classification-on-dblp-20-nodes-per","dataset":"DBLP: 20 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-dblp-5-nodes-per-class","slug":"node-classification-on-dblp-5-nodes-per-class","dataset":"DBLP: 5 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-deezer-croatia","slug":"node-classification-on-deezer-croatia","dataset":"Deezer Croatia","dataset_url":null,"rows_in_archive":1,"metrics":["Micro-F1"],"first_row_in_archive_order":{"model":"GEMSEC 2","paper_title":"GEMSEC: Graph Embedding with Self Clustering","paper_url":"/paper/gemsec-graph-embedding-with-self-clustering","paper_date":"2018-02-12","arxiv_id":"1802.03997","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GEMSEC","url":"https://github.com/benedekrozemberczki/GEMSEC"},{"title":"benedekrozemberczki/GRAF","url":"https://github.com/benedekrozemberczki/GRAF"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-deezer-hungary","slug":"node-classification-on-deezer-hungary","dataset":"Deezer Hungary","dataset_url":null,"rows_in_archive":1,"metrics":["Micro-F1"],"first_row_in_archive_order":{"model":"Smooth GEMSEC 2","paper_title":"GEMSEC: Graph Embedding with Self Clustering","paper_url":"/paper/gemsec-graph-embedding-with-self-clustering","paper_date":"2018-02-12","arxiv_id":"1802.03997","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GEMSEC","url":"https://github.com/benedekrozemberczki/GEMSEC"},{"title":"benedekrozemberczki/GRAF","url":"https://github.com/benedekrozemberczki/GRAF"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-electronics","slug":"node-classification-on-electronics","dataset":"Electronics","dataset_url":"/dataset/electronics","rows_in_archive":1,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"PathNet","paper_title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","paper_url":"/paper/beyond-homophily-structure-aware-path","paper_date":"2022-07-20","arxiv_id":null,"code_links":[{"title":"zjunet/PathNet","url":"https://github.com/zjunet/PathNet"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-film-48-32-20-fixed","slug":"node-classification-on-film-48-32-20-fixed","dataset":"Film(48%/32%/20% fixed splits)","dataset_url":"/dataset/film-48-32-20-fixed-splits","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GREAD-BS","paper_title":"GREAD: Graph Neural Reaction-Diffusion Networks","paper_url":"/paper/gread-graph-neural-reaction-diffusion","paper_date":"2022-11-25","arxiv_id":"2211.14208","code_links":[{"title":"jeongwhanchoi/gread","url":"https://github.com/jeongwhanchoi/gread"}],"syntology":{"n":10,"n_ran":3,"n_unverified":7,"n_pointer_only":3}}},{"leaderboard":"/sota/node-classification-on-nba","slug":"node-classification-on-nba","dataset":"NBA","dataset_url":"/dataset/nba","rows_in_archive":1,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"PathNet","paper_title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","paper_url":"/paper/beyond-homophily-structure-aware-path","paper_date":"2022-07-20","arxiv_id":null,"code_links":[{"title":"zjunet/PathNet","url":"https://github.com/zjunet/PathNet"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-ogbn-products","slug":"node-classification-on-ogbn-products","dataset":"ogbn-products","dataset_url":"/dataset/ogb","rows_in_archive":1,"metrics":["Inference Time (ms)"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-ogbn-products-20-nodes","slug":"node-classification-on-ogbn-products-20-nodes","dataset":"ogbn-products: 20 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-5-nodes-per","slug":"node-classification-on-pubmed-5-nodes-per","dataset":"PubMed: 5 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-fixed-20-node","slug":"node-classification-on-pubmed-fixed-20-node","dataset":"Pubmed: fixed 20 node per class","dataset_url":"/dataset/pubmed","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SDSS-APPNP","paper_title":"Multi-task Self-distillation for Graph-based Semi-Supervised Learning","paper_url":"/paper/multi-task-self-distillation-for-graph-based","paper_date":"2021-12-02","arxiv_id":"2112.01174","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-random","slug":"node-classification-on-pubmed-random","dataset":"Pubmed random partition","dataset_url":"/dataset/pubmed","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_url":"/paper/graphmix-regularized-training-of-graph-neural","paper_date":"2019-09-25","arxiv_id":"1909.11715","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"syntology":null}}],"datasets":[{"url":"/dataset/pubmed","name":"Pubmed","full_name":"","num_papers_in_archive":1236},{"url":"/dataset/ogb","name":"OGB","full_name":"Open Graph Benchmark","num_papers_in_archive":1000},{"url":"/dataset/flickr30k","name":"Flickr30k","full_name":"Flickr30k","num_papers_in_archive":880},{"url":"/dataset/reddit","name":"Reddit","full_name":"","num_papers_in_archive":699},{"url":"/dataset/cora","name":"Cora","full_name":"","num_papers_in_archive":602},{"url":"/dataset/citeseer","name":"Citeseer","full_name":"","num_papers_in_archive":381},{"url":"/dataset/ppi","name":"PPI","full_name":"Protein-Protein Interactions (PPI)","num_papers_in_archive":309},{"url":"/dataset/mutag","name":"MUTAG","full_name":"","num_papers_in_archive":274},{"url":"/dataset/moleculenet","name":"MoleculeNet","full_name":"","num_papers_in_archive":240},{"url":"/dataset/dblp","name":"DBLP","full_name":"Citation Network Dataset","num_papers_in_archive":218},{"url":"/dataset/wiki-squirrel","name":"Wiki Squirrel","full_name":"Wikipedia Squirrel","num_papers_in_archive":208},{"url":"/dataset/pascal-voc","name":"PASCAL VOC","full_name":"PASCAL Visual Object Classes Challenge","num_papers_in_archive":198},{"url":"/dataset/nell","name":"NELL","full_name":"Never Ending Language Learning","num_papers_in_archive":177},{"url":"/dataset/cluster","name":"CLUSTER","full_name":"","num_papers_in_archive":159},{"url":"/dataset/pattern","name":"PATTERN","full_name":"","num_papers_in_archive":153},{"url":"/dataset/ava","name":"AVA","full_name":"Atomic Visual Actions","num_papers_in_archive":113},{"url":"/dataset/webkb","name":"WebKB","full_name":"WebKB","num_papers_in_archive":113},{"url":"/dataset/wiki-cs","name":"Wiki-CS","full_name":"","num_papers_in_archive":111},{"url":"/dataset/yelp","name":"Yelp","full_name":"","num_papers_in_archive":86},{"url":"/dataset/aminer","name":"AMiner","full_name":"","num_papers_in_archive":80},{"url":"/dataset/pascalvoc-sp","name":"Long Range Graph Benchmark (LRGB)","full_name":"","num_papers_in_archive":76},{"url":"/dataset/friendster","name":"Friendster","full_name":"","num_papers_in_archive":65},{"url":"/dataset/penn94","name":"Penn94","full_name":"","num_papers_in_archive":60},{"url":"/dataset/cornell","name":"Cornell","full_name":null,"num_papers_in_archive":54},{"url":"/dataset/roman-empire","name":"roman-empire","full_name":"","num_papers_in_archive":49},{"url":"/dataset/questions","name":"questions","full_name":"","num_papers_in_archive":46},{"url":"/dataset/tolokers","name":"tolokers","full_name":"","num_papers_in_archive":38},{"url":"/dataset/genius","name":"genius","full_name":"","num_papers_in_archive":37},{"url":"/dataset/biogrid","name":"BioGRID","full_name":"Biological General Repository for Interaction Datasets","num_papers_in_archive":34},{"url":"/dataset/minesweeper","name":"minesweeper","full_name":"","num_papers_in_archive":34},{"url":"/dataset/ogb-lsc","name":"OGB-LSC","full_name":"OGB Large-Scale Challenge","num_papers_in_archive":34},{"url":"/dataset/amazon-ratings","name":"amazon-ratings","full_name":"","num_papers_in_archive":33},{"url":"/dataset/twitch-gamers","name":"twitch-gamers","full_name":"","num_papers_in_archive":24},{"url":"/dataset/chameleon-48-32-20-fixed-splits","name":"Chameleon (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":20},{"url":"/dataset/film-60-20-20-random-splits","name":"Film (60%/20%/20% random splits)","full_name":"","num_papers_in_archive":19},{"url":"/dataset/squirrel-48-32-20-fixed-splits","name":"Squirrel (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":19},{"url":"/dataset/squirrel-60-20-20-random-splits","name":"Squirrel (60%/20%/20% random splits)","full_name":"","num_papers_in_archive":19},{"url":"/dataset/pubmed-60-20-20-random-splits","name":"PubMed (60%/20%/20% random splits)","full_name":"","num_papers_in_archive":18},{"url":"/dataset/yeast","name":"Yeast","full_name":"","num_papers_in_archive":18},{"url":"/dataset/chameleon-60-20-20-random-splits-1","name":"Chameleon(60%/20%/20% random splits)","full_name":"","num_papers_in_archive":17},{"url":"/dataset/cornell-48-32-20-fixed-splits","name":"Cornell (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":16},{"url":"/dataset/cornell-60-20-20-random-splits","name":"Cornell (60%/20%/20% random splits)","full_name":"","num_papers_in_archive":16},{"url":"/dataset/citeseer-48-32-20-fixed-splits","name":"Citeseer (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":15},{"url":"/dataset/cora-48-32-20-fixed-splits","name":"Cora (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":15},{"url":"/dataset/pubmed-48-32-20-fixed-splits","name":"PubMed (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":15},{"url":"/dataset/wisconsin-48-32-20-fixed-splits","name":"Wisconsin (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":15},{"url":"/dataset/film-48-32-20-fixed-splits","name":"Film(48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":14},{"url":"/dataset/texas-48-32-20-fixed-splits","name":"Texas (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":14},{"url":"/dataset/yelpchi","name":"Yelp-Fraud","full_name":"Multi-relational Graph Dataset for Yelp Spam Review Detection","num_papers_in_archive":13},{"url":"/dataset/aesthetic-visual-analysis","name":"Aesthetic Visual Analysis","full_name":"Aesthetic Visual Analysis","num_papers_in_archive":12},{"url":"/dataset/amazon-photo","name":"Amazon Photo","full_name":"Amazon Photo","num_papers_in_archive":11},{"url":"/dataset/amz-computers","name":"AMZ Computers","full_name":"amazon_electronics_computers","num_papers_in_archive":9},{"url":"/dataset/usa-air-traffic","name":"USA Air-Traffic","full_name":"USA Air-Traffic","num_papers_in_archive":9},{"url":"/dataset/amazon-fraud","name":"Amazon-Fraud","full_name":"Multi-relational Graph Dataset for Amazon Fraudulent Account Detection","num_papers_in_archive":8},{"url":"/dataset/brazil-air-traffic","name":"Brazil Air-Traffic","full_name":"Brazil Air-Traffic","num_papers_in_archive":8},{"url":"/dataset/wiki","name":"Wiki","full_name":"Web Traffic Time Series Forecasting","num_papers_in_archive":8},{"url":"/dataset/mag-scholar-c-1","name":"MAG-Scholar-C","full_name":"","num_papers_in_archive":5},{"url":"/dataset/mumin","name":"MuMiN","full_name":"","num_papers_in_archive":5},{"url":"/dataset/bgp","name":"BGP","full_name":"Border Gateway Protocol (BGP) Network","num_papers_in_archive":3},{"url":"/dataset/deezer-user-networks","name":"Deezer User Networks","full_name":"","num_papers_in_archive":3},{"url":"/dataset/placenta","name":"Placenta","full_name":"","num_papers_in_archive":3},{"url":"/dataset/city-networks","name":"City-Networks","full_name":"","num_papers_in_archive":2},{"url":"/dataset/electronics","name":"Electronics","full_name":"","num_papers_in_archive":2},{"url":"/dataset/fdcompcn","name":"FDCompCN","full_name":"","num_papers_in_archive":2},{"url":"/dataset/herigraph","name":"HeriGraph","full_name":"Multimodal Machine Learning Datasets on Graphs of Heritage Values and Attributes","num_papers_in_archive":2},{"url":"/dataset/nba","name":"NBA","full_name":"","num_papers_in_archive":2},{"url":"/dataset/celltypegraph-benchmark","name":"CellTypeGraph Benchmark","full_name":"","num_papers_in_archive":1},{"url":"/dataset/financial-dynamic-knowledge-graph","name":"Financial Dynamic Knowledge Graph","full_name":"","num_papers_in_archive":1},{"url":"/dataset/maple","name":"MAPLE","full_name":"","num_papers_in_archive":1},{"url":"/dataset/mumin-large","name":"MuMiN-large","full_name":"","num_papers_in_archive":1},{"url":"/dataset/mumin-medium","name":"MuMiN-medium","full_name":"","num_papers_in_archive":1},{"url":"/dataset/mumin-small","name":"MuMiN-small","full_name":"","num_papers_in_archive":1},{"url":"/dataset/sagc-a68","name":"SAGC-A68","full_name":"A space access graph dataset for the classification of spaces and space elements in apartment buildings","num_papers_in_archive":1},{"url":"/dataset/twitter-hydrug","name":"Twitter-HyDrug","full_name":"","num_papers_in_archive":1},{"url":"/dataset/twitter-hydrug-ur","name":"Twitter-HyDrug-UR","full_name":"Twitter Hypergraph Drug for User Roles","num_papers_in_archive":1}],"subtasks":[{"url":"/task/atomic-number-classification","name":"Atomic number classification"},{"url":"/task/dynamic-node-classification","name":"Dynamic Node Classification"},{"url":"/task/graph-structure-learning","name":"Graph structure learning"},{"url":"/task/heterogeneous-node-classification","name":"Heterogeneous Node Classification"},{"url":"/task/node-classification-on-non-homophilic","name":"Node Classification on Non-Homophilic (Heterophilic) Graphs"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":991,"tagged_in_all":1860,"items":[{"url":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":50,"n_unverified":56,"n_pointer_only":43}},{"url":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","repositories_listed":55,"syntology":{"n":58,"n_ran":31,"n_unverified":27,"n_pointer_only":22}},{"url":"/paper/modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","repositories_listed":27,"syntology":{"n":32,"n_ran":10,"n_unverified":22,"n_pointer_only":15}},{"url":"/paper/revisiting-semi-supervised-learning-with","title":"Revisiting Semi-Supervised Learning with Graph Embeddings","date":"2016-03-29","arxiv_id":"1603.08861","repositories_listed":26,"syntology":{"n":28,"n_ran":15,"n_unverified":13,"n_pointer_only":4}},{"url":"/paper/inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","arxiv_id":"1706.02216","repositories_listed":20,"syntology":{"n":5,"n_ran":3,"n_unverified":2,"n_pointer_only":5}},{"url":"/paper/neural-message-passing-for-quantum-chemistry","title":"Neural Message Passing for Quantum Chemistry","date":"2017-04-04","arxiv_id":"1704.01212","repositories_listed":20,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/node2vec-scalable-feature-learning-for","title":"node2vec: Scalable Feature Learning for Networks","date":"2016-07-03","arxiv_id":"1607.00653","repositories_listed":20,"syntology":{"n":25,"n_ran":8,"n_unverified":17,"n_pointer_only":3}},{"url":"/paper/how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","arxiv_id":"1810.00826","repositories_listed":19,"syntology":{"n":10,"n_ran":3,"n_unverified":7,"n_pointer_only":5}},{"url":"/paper/benchmarking-graph-neural-networks","title":"Benchmarking Graph Neural Networks","date":"2020-03-02","arxiv_id":"2003.00982","repositories_listed":15,"syntology":{"n":23,"n_ran":1,"n_unverified":22,"n_pointer_only":0}},{"url":"/paper/hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","arxiv_id":"1806.08804","repositories_listed":14,"syntology":{"n":20,"n_ran":1,"n_unverified":19,"n_pointer_only":0}},{"url":"/paper/deepwalk-online-learning-of-social","title":"DeepWalk: Online Learning of Social Representations","date":"2014-03-26","arxiv_id":"1403.6652","repositories_listed":14,"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/gated-graph-sequence-neural-networks","title":"Gated Graph Sequence Neural Networks","date":"2015-11-17","arxiv_id":"1511.05493","repositories_listed":13,"syntology":{"n":12,"n_ran":0,"n_unverified":12,"n_pointer_only":0}},{"url":"/paper/deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","arxiv_id":"1809.10341","repositories_listed":11,"syntology":{"n":35,"n_ran":24,"n_unverified":11,"n_pointer_only":9}},{"url":"/paper/evolvegcn-evolving-graph-convolutional","title":"EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs","date":"2019-02-26","arxiv_id":"1902.10191","repositories_listed":10,"syntology":{"n":11,"n_ran":3,"n_unverified":8,"n_pointer_only":1}},{"url":"/paper/graph-random-neural-network","title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","date":"2020-05-22","arxiv_id":"2005.11079","repositories_listed":9,"syntology":{"n":22,"n_ran":8,"n_unverified":14,"n_pointer_only":0}},{"url":"/paper/line-large-scale-information-network","title":"LINE: Large-scale Information Network Embedding","date":"2015-03-12","arxiv_id":"1503.03578","repositories_listed":9,"syntology":{"n":3,"n_ran":0,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","arxiv_id":"2004.05718","repositories_listed":8,"syntology":{"n":55,"n_ran":33,"n_unverified":22,"n_pointer_only":48}},{"url":"/paper/graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","arxiv_id":"1907.04931","repositories_listed":8,"syntology":null},{"url":"/paper/convolutional-networks-on-graphs-for-learning","title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","date":"2015-09-30","arxiv_id":"1509.09292","repositories_listed":8,"syntology":{"n":26,"n_ran":0,"n_unverified":26,"n_pointer_only":1}},{"url":"/paper/combining-label-propagation-and-simple-models-1","title":"Combining Label Propagation and Simple Models Out-performs Graph Neural Networks","date":"2020-10-27","arxiv_id":"2010.13993","repositories_listed":7,"syntology":{"n":5,"n_ran":2,"n_unverified":3,"n_pointer_only":2}},{"url":"/paper/deep-graph-library-towards-efficient-and","title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","date":"2019-09-03","arxiv_id":"1909.01315","repositories_listed":7,"syntology":{"n":39,"n_ran":3,"n_unverified":36,"n_pointer_only":4}},{"url":"/paper/the-truly-deep-graph-convolutional-networks","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","date":"2019-07-25","arxiv_id":"1907.10903","repositories_listed":7,"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/simplifying-graph-convolutional-networks","title":"Simplifying Graph Convolutional Networks","date":"2019-02-19","arxiv_id":"1902.07153","repositories_listed":7,"syntology":{"n":8,"n_ran":3,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","date":"2021-03-17","arxiv_id":"2103.09430","repositories_listed":6,"syntology":null},{"url":"/paper/enhancing-graph-neural-network-based-fraud","title":"Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters","date":"2020-08-19","arxiv_id":"2008.08692","repositories_listed":6,"syntology":{"n":17,"n_ran":1,"n_unverified":16,"n_pointer_only":0}},{"url":"/paper/cluster-gcn-an-efficient-algorithm-for","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","date":"2019-05-20","arxiv_id":"1905.07953","repositories_listed":6,"syntology":null},{"url":"/paper/fast-graph-representation-learning-with","title":"Fast Graph Representation Learning with PyTorch Geometric","date":"2019-03-06","arxiv_id":"1903.02428","repositories_listed":6,"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","arxiv_id":"2110.14446","repositories_listed":5,"syntology":{"n":21,"n_ran":7,"n_unverified":14,"n_pointer_only":4}},{"url":"/paper/sign-scalable-inception-graph-neural-networks","title":"SIGN: Scalable Inception Graph Neural Networks","date":"2020-04-23","arxiv_id":"2004.11198","repositories_listed":5,"syntology":{"n":7,"n_ran":2,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/inductive-representation-learning-on-temporal-1","title":"Inductive Representation Learning on Temporal Graphs","date":"2020-02-19","arxiv_id":"2002.07962","repositories_listed":5,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}}],"syntology_records":27,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":3,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}