{"url":"/dataset/pubmed","name":"Pubmed","full_name":null,"description_markdown":"The **PubMed** dataset consists of 19717 scientific publications from PubMed database pertaining to diabetes classified into one of three classes. The citation network consists of 44338 links. Each publication in the dataset is described by a TF/IDF weighted word vector from a dictionary which consists of 500 unique words.\r\n\r\nSource: [https://linqs.soe.ucsc.edu/data](https://linqs.soe.ucsc.edu/data)","description_withheld":null,"homepage":"https://linqs.org/datasets/#pubmed-diabetes","introduced_date":"2008-01-01","introduced_date_note":null,"introduced_by":{"paper":null,"title":"Collective Classification in Network Data","first_author":null,"url":"http://www.aaai.org/ojs/index.php/aimagazine/article/view/2157"},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Node Classification","url":"/task/node-classification","datasets_with_task":"/datasets/task/node-classification"},{"name":"Link Prediction","url":"/task/link-prediction","datasets_with_task":"/datasets/task/link-prediction"},{"name":"Text Summarization","url":"/task/text-summarization","datasets_with_task":"/datasets/task/text-summarization"},{"name":"Graph Classification","url":"/task/graph-classification","datasets_with_task":"/datasets/task/graph-classification"},{"name":"Language Modelling","url":"/task/language-modelling","datasets_with_task":"/datasets/task/language-modelling"},{"name":"Node Clustering","url":"/task/node-clustering","datasets_with_task":"/datasets/task/node-clustering"},{"name":"Node Classification on Non-Homophilic (Heterophilic) Graphs","url":"/task/node-classification-on-non-homophilic","datasets_with_task":"/datasets/task/node-classification-on-non-homophilic"},{"name":"Community Detection","url":"/task/community-detection","datasets_with_task":"/datasets/task/community-detection"},{"name":"Graph Clustering","url":"/task/graph-clustering","datasets_with_task":"/datasets/task/graph-clustering"},{"name":"Extended Summarization","url":"/task/extended-summarization","datasets_with_task":"/datasets/task/extended-summarization"},{"name":"Sentence Classification","url":"/task/sentence-classification","datasets_with_task":"/datasets/task/sentence-classification"},{"name":"Unsupervised Extractive Summarization","url":"/task/unsupervised-extractive-summarization","datasets_with_task":"/datasets/task/unsupervised-extractive-summarization"}],"languages":[],"variants":["PubMed-Long Val","PubMed-Long Test","Pubmed: fixed 20 node per class"," PubMed Central","PubMed (60%/20%/20% random splits)","PubMed (48%/32%/20% fixed splits)","keyword_pubmed_dataset","enoriega/keyword_pubmed sentence","Pubmed (weighted evaluation)","Pubmed random partition","Pubmed (nonstandard variant)","Pubmed (biased evaluation)","PubMed 20k RCT","Pubmed Full-supervised","Pubmed","PubMed with Public Split: fixed 20 nodes per class","PubMed (0.1%)","PubMed (0.05%)","PubMed (0.03%)"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/z1az/pubmed","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/pranavvmurthy26/pubmed","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/pubmed","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/VietAI/vi_pubmed","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/justinphan3110/vi_pubmed","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/tmnam20/ViPubMed","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/ncbi/pubmed","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/dmlc/dgl","url":"https://docs.dgl.ai/api/python/dgl.data.html#dgl.data.PubmedGraphDataset","frameworks":["pytorch","tf","mxnet"]},{"repo":"https://github.com/danielegrattarola/spektral","url":"https://graphneural.network/datasets/#citation","frameworks":["tf"]}],"num_papers_in_archive":1236,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/node-classification-on-pubmed","task":"Node Classification","dataset_variant":"Pubmed","rows":70,"metrics":["Accuracy","Training Split","F1","Validation","Accuracy (%)","F1-Score","Inference Time (ms)"],"first_row_in_archive_order":{"model":"NCGCN","paper":"/paper/clarify-confused-nodes-through-separated","metrics":{"Accuracy":"91.64 ± 0.53"},"code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-pubmed-with-public","task":"Node Classification","dataset_variant":"PubMed with Public Split: fixed 20 nodes per class","rows":37,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"OGC","paper":"/paper/from-cluster-assumption-to-graph-convolution","metrics":{"Accuracy":"83.4%"},"code_links":[{"title":"zhengwang100/ogc_ggcm","url":"https://github.com/zhengwang100/ogc_ggcm"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/text-summarization-on-pubmed-1","task":"Text Summarization","dataset_variant":"Pubmed","rows":29,"metrics":["ROUGE-1","ROUGE-2","ROUGE-L"],"first_row_in_archive_order":{"model":"Top Down Transformer (AdaPool) (464M)","paper":"/paper/long-document-summarization-with-top-down-and-1","metrics":{"ROUGE-1":"51.05","ROUGE-2":"23.26","ROUGE-L":"46.47"},"code_links":[{"title":"lllyasviel/framepack","url":"https://github.com/lllyasviel/framepack"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-pubmed-003","task":"Node Classification","dataset_variant":"PubMed (0.03%)","rows":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"VCHN","paper":"/paper/view-consistent-heterogeneous-network-on","metrics":{"Accuracy":"71.8%"},"code_links":[{"title":"kunzhan/VCHN","url":"https://github.com/kunzhan/VCHN"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-pubmed-005","task":"Node Classification","dataset_variant":"PubMed (0.05%)","rows":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"VCHN","paper":"/paper/view-consistent-heterogeneous-network-on","metrics":{"Accuracy":"74.3%"},"code_links":[{"title":"kunzhan/VCHN","url":"https://github.com/kunzhan/VCHN"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-pubmed-01","task":"Node Classification","dataset_variant":"PubMed (0.1%)","rows":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Truncated Krylov","paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","metrics":{"Accuracy":"77.21%"},"code_links":[{"title":"PwnerHarry/Stronger_GCN","url":"https://github.com/PwnerHarry/Stronger_GCN"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-pubmed","task":"Link Prediction","dataset_variant":"Pubmed","rows":13,"metrics":["AUC","AP","Accuracy","ACC"],"first_row_in_archive_order":{"model":"","paper":"/paper/an-effective-graph-learning-based-approach","metrics":{"AUC":"200%"},"code_links":[{"title":"im0qianqian/WSDM2022TGP-AntGraph","url":"https://github.com/im0qianqian/WSDM2022TGP-AntGraph"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/unsupervised-extractive-summarization-on-1","task":"Unsupervised Extractive Summarization","dataset_variant":"Pubmed","rows":9,"metrics":["ROUGE-1","ROUGE-2","ROUGE-L"],"first_row_in_archive_order":{"model":"HipoRank","paper":"/paper/hiporank-incorporating-hierarchical-and","metrics":{"ROUGE-1":"43.58","ROUGE-2":"17.00","ROUGE-L":"39.31"},"code_links":[{"title":"mirandrom/HipoRank","url":"https://github.com/mirandrom/HipoRank"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-clustering-on-pubmed","task":"Graph Clustering","dataset_variant":"Pubmed","rows":7,"metrics":["ACC","NMI","ARI","F score"],"first_row_in_archive_order":{"model":"R-GMM-VGAE","paper":"/paper/rethinking-graph-autoencoder-models-for","metrics":{"ACC":"74.0","ARI":"37.9","NMI":"33.4"},"code_links":[{"title":"nairouz/R-GAE","url":"https://github.com/nairouz/R-GAE"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-pubmed-full-supervised","task":"Node Classification","dataset_variant":"Pubmed Full-supervised","rows":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphSAGE+DropEdge","paper":"/paper/the-truly-deep-graph-convolutional-networks","metrics":{"Accuracy":"91.70%"},"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"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-pubmed-biased-evaluation","task":"Link Prediction","dataset_variant":"Pubmed (biased evaluation)","rows":2,"metrics":["AP","AUC","Accuracy"],"first_row_in_archive_order":{"model":"GraphStar (double weight on positive examples)","paper":"/paper/graph-star-net-for-generalized-multi-task-1","metrics":{"AP":"98.64","AUC":"97.67","Accuracy":"98.16"},"code_links":[{"title":"graph-star-team/graph_star","url":"https://github.com/graph-star-team/graph_star"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/sentence-classification-on-pubmed-20k-rct","task":"Sentence Classification","dataset_variant":"PubMed 20k RCT","rows":2,"metrics":["F1"],"first_row_in_archive_order":{"model":"Hierarchical Neural Networks","paper":"/paper/hierarchical-neural-networks-for-sequential","metrics":{"F1":"92.60"},"code_links":[{"title":"jind11/HSLN-Joint-Sentence-Classification","url":"https://github.com/jind11/HSLN-Joint-Sentence-Classification"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/community-detection-on-pubmed","task":"Community Detection","dataset_variant":"Pubmed","rows":1,"metrics":["ACC","NMI"],"first_row_in_archive_order":{"model":"CDNMF","paper":"/paper/contrastive-deep-nonnegative-matrix","metrics":{"ACC":"0.6653","NMI":"0.2330"},"code_links":[{"title":"6lyc/cdnmf","url":"https://github.com/6lyc/cdnmf"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-classification-on-pubmed","task":"Graph Classification","dataset_variant":"Pubmed","rows":1,"metrics":["Test Accuracy"],"first_row_in_archive_order":{"model":"Fea2Fea-s3","paper":"/paper/fea2fea-exploring-structural-feature","metrics":{"Test Accuracy":"78.5"},"code_links":[{"title":"JIAQING-XIE/Fea2Fea","url":"https://github.com/JIAQING-XIE/Fea2Fea"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/language-modelling-on-pubmed-central","task":"Language Modelling","dataset_variant":"PubMed Central","rows":1,"metrics":["BPB"],"first_row_in_archive_order":{"model":"Gopher","paper":"/paper/scaling-language-models-methods-analysis-1","metrics":{"BPB":"0.525"},"code_links":[{"title":"allenai/dolma","url":"https://github.com/allenai/dolma"},{"title":"rvlopes/gloria","url":"https://github.com/rvlopes/gloria"},{"title":"bramiozo/PubScience","url":"https://github.com/bramiozo/PubScience"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-pubmed-nonstandard-variant","task":"Link Prediction","dataset_variant":"Pubmed (nonstandard variant)","rows":1,"metrics":["AP","AUC"],"first_row_in_archive_order":{"model":"GLACE","paper":"/paper/gaussian-embedding-of-large-scale-attributed","metrics":{"AP":"97.49","AUC":"97.82"},"code_links":[{"title":"bhagya-hettige/GLACE","url":"https://github.com/bhagya-hettige/GLACE"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-non-homophilic-16","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset_variant":"Pubmed","rows":1,"metrics":["F1-Score","NMI"],"first_row_in_archive_order":{"model":"GAT","paper":"/paper/graph-attention-networks","metrics":{"F1-Score":"59.89 ± 4.12","NMI":"55.80 ± 0.87"},"code_links":[{"title":"labmlai/annotated_deep_learning_paper_implementations","url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gat"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/gat"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gat"},{"title":"PetarV-/GAT","url":"https://github.com/PetarV-/GAT"},{"title":"Diego999/pyGAT","url":"https://github.com/Diego999/pyGAT"},{"title":"gordicaleksa/pytorch-GAT","url":"https://github.com/gordicaleksa/pytorch-GAT"},{"title":"shenweichen/GraphNeuralNetwork","url":"https://github.com/shenweichen/GraphNeuralNetwork"},{"title":"HazyResearch/hgcn","url":"https://github.com/HazyResearch/hgcn"},{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT"},{"title":"danielegrattarola/keras-gat","url":"https://github.com/danielegrattarola/keras-gat"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"meliketoy/graph-cnn.pytorch","url":"https://github.com/meliketoy/graph-cnn.pytorch"},{"title":"mindspore-ai/models","url":"https://github.com/mindspore-ai/models/tree/master/official/gnn/gat"},{"title":"Kaimaoge/IGNNK","url":"https://github.com/Kaimaoge/IGNNK"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"arangoml/fastgraphml","url":"https://github.com/arangoml/fastgraphml"},{"title":"zhao-tong/GNNs-easy-to-use","url":"https://github.com/zhao-tong/GNNs-easy-to-use"},{"title":"davidpicard/homm","url":"https://github.com/davidpicard/homm"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric"},{"title":"snowkylin/gnn","url":"https://github.com/snowkylin/gnn"},{"title":"akash18tripathi/MAGNET-Multi-Label-Text-Classi-cation-using-Attention-based-Graph-Neural-Network","url":"https://github.com/akash18tripathi/MAGNET-Multi-Label-Text-Classi-cation-using-Attention-based-Graph-Neural-Network"},{"title":"fanzhenliu/dagad","url":"https://github.com/fanzhenliu/dagad"},{"title":"weiyangfb/PyTorchSparseGAT","url":"https://github.com/weiyangfb/PyTorchSparseGAT"},{"title":"HeapHop30/graph-attention-nets","url":"https://github.com/HeapHop30/graph-attention-nets"},{"title":"marblet/GNN_models_pytorch_geometric","url":"https://github.com/marblet/GNN_models_pytorch_geometric"},{"title":"marble0117/GNN_models_pytorch_geometric","url":"https://github.com/marble0117/GNN_models_pytorch_geometric"},{"title":"marble0117/GNN_models_pytorch","url":"https://github.com/marble0117/GNN_models_pytorch"},{"title":"zxhhh97/ABot","url":"https://github.com/zxhhh97/ABot"},{"title":"ds4dm/sGat","url":"https://github.com/ds4dm/sGat"},{"title":"ds4dm/sparse-gcn","url":"https://github.com/ds4dm/sparse-gcn"},{"title":"isotlaboratory/ml4vrp","url":"https://github.com/isotlaboratory/ml4vrp"},{"title":"marblet/gat-pytorch","url":"https://github.com/marblet/gat-pytorch"},{"title":"ydzhang-stormstout/HAT","url":"https://github.com/ydzhang-stormstout/HAT"},{"title":"gcucurull/jax-gat","url":"https://github.com/gcucurull/jax-gat"},{"title":"calciver/Graph-Attention-Networks","url":"https://github.com/calciver/Graph-Attention-Networks"},{"title":"shi27feng/transformers.satisfy","url":"https://github.com/shi27feng/transformers.satisfy"},{"title":"pengsl-lab/mssl","url":"https://github.com/pengsl-lab/mssl"},{"title":"pengsl-lab/mssl2drug","url":"https://github.com/pengsl-lab/mssl2drug"},{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"taishan1994/pytorch_gat","url":"https://github.com/taishan1994/pytorch_gat"},{"title":"wan2000/mc-mot","url":"https://github.com/wan2000/mc-mot"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"dmeoli/neuro-sat","url":"https://github.com/dmeoli/neuro-sat"},{"title":"liu6zijian/simplified-gcn-model","url":"https://github.com/liu6zijian/simplified-gcn-model"},{"title":"tatp22/pytorch-fast-GAT","url":"https://github.com/tatp22/pytorch-fast-GAT"},{"title":"noahtren/Graph-Attention-Networks-TensorFlow-2","url":"https://github.com/noahtren/Graph-Attention-Networks-TensorFlow-2"},{"title":"yururyuru00/GAT_pyG","url":"https://github.com/yururyuru00/GAT_pyG"},{"title":"qema/orca-py","url":"https://github.com/qema/orca-py"},{"title":"zhanglab-aim/cancer-net","url":"https://github.com/zhanglab-aim/cancer-net"},{"title":"gayanku/FDGATII","url":"https://github.com/gayanku/FDGATII"},{"title":"Yindong-Zhang/myGAT","url":"https://github.com/Yindong-Zhang/myGAT"},{"title":"giuseppefutia/link-prediction-code","url":"https://github.com/giuseppefutia/link-prediction-code"},{"title":"Aveek-Saha/Graph-Attention-Net","url":"https://github.com/Aveek-Saha/Graph-Attention-Net"},{"title":"BIG-S2/keras-gnm","url":"https://github.com/BIG-S2/keras-gnm"},{"title":"mlzxzhou/keras-gnm","url":"https://github.com/mlzxzhou/keras-gnm"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"abhilash1910/GraphAttentionNetworks","url":"https://github.com/abhilash1910/GraphAttentionNetworks"},{"title":"Kristof-Neys/GAT_Neo4j_DGL","url":"https://github.com/Kristof-Neys/GAT_Neo4j_DGL"},{"title":"ak24watch/Graph-Deeplearning-GAT","url":"https://github.com/ak24watch/Graph-Deeplearning-GAT"},{"title":"Negus25/GAT-Mindspore","url":"https://github.com/Negus25/GAT-Mindspore"},{"title":"ChengyuSun/gat","url":"https://github.com/ChengyuSun/gat"},{"title":"joaopedromattos/gnee","url":"https://github.com/joaopedromattos/gnee"},{"title":"mitya8128/experiments_notes","url":"https://github.com/mitya8128/experiments_notes"},{"title":"4pygmalion/GAT_tensorflow","url":"https://github.com/4pygmalion/GAT_tensorflow"},{"title":"vailatuts/SSFG-regularization","url":"https://github.com/vailatuts/SSFG-regularization"},{"title":"handasontam/GAT-with-edgewise-attention","url":"https://github.com/handasontam/GAT-with-edgewise-attention"},{"title":"Mind23-2/MindCode-4","url":"https://github.com/Mind23-2/MindCode-4/tree/main/gat"},{"title":"AngusMonroe/GAT-pytorch","url":"https://github.com/AngusMonroe/GAT-pytorch"},{"title":"fongyk/graph-attention","url":"https://github.com/fongyk/graph-attention"},{"title":"404nofound/gat","url":"https://github.com/404nofound/gat"},{"title":"ColdenChan/GAT_D","url":"https://github.com/ColdenChan/GAT_D"},{"title":"MehmetBarutcu/Streaming-Algorithm-for-Monotone-k-Submodular-Maximization-with-Cardinality-Constraints","url":"https://github.com/MehmetBarutcu/Streaming-Algorithm-for-Monotone-k-Submodular-Maximization-with-Cardinality-Constraints"},{"title":"bowu/GraphSearch","url":"https://github.com/bowu/GraphSearch"},{"title":"Messham87/COVID_GAT","url":"https://github.com/Messham87/COVID_GAT"},{"title":"zhangbo2008/GAT_network","url":"https://github.com/zhangbo2008/GAT_network"},{"title":"blueberryc/pyGAT","url":"https://github.com/blueberryc/pyGAT"},{"title":"anish-lu-yihe/SVRT-by-GAT","url":"https://github.com/anish-lu-yihe/SVRT-by-GAT"},{"title":"WantingZhao/my_GAT","url":"https://github.com/WantingZhao/my_GAT"},{"title":"dzb1998/pyGAT","url":"https://github.com/dzb1998/pyGAT"},{"title":"subercui/pyGConvAT","url":"https://github.com/subercui/pyGConvAT"},{"title":"YunseobShin/wiki_GAT","url":"https://github.com/YunseobShin/wiki_GAT"},{"title":"MindSpore-scientific-2/code-4","url":"https://github.com/MindSpore-scientific-2/code-4/tree/main/GR-HSTU"},{"title":"snownus/COOP","url":"https://github.com/snownus/COOP"},{"title":"ChengSashankh/trying-GAT","url":"https://github.com/ChengSashankh/trying-GAT"},{"title":"Anak2016/GAT","url":"https://github.com/Anak2016/GAT"},{"title":"whut2962575697/gat_sementic_segmentation","url":"https://github.com/whut2962575697/gat_sementic_segmentation"},{"title":"Anou9531/GAT","url":"https://github.com/Anou9531/GAT"},{"title":"PumpkinYing/GAT","url":"https://github.com/PumpkinYing/GAT"},{"title":"galkampel/HyperNetworks","url":"https://github.com/galkampel/HyperNetworks"},{"title":"tlmakinen/GAT-noise","url":"https://github.com/tlmakinen/GAT-noise"},{"title":"TyngJiunKuo/deep-learning-project","url":"https://github.com/TyngJiunKuo/deep-learning-project"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-pubmed-fixed-20-node","task":"Node Classification","dataset_variant":"Pubmed: fixed 20 node per class","rows":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SDSS-APPNP","paper":"/paper/multi-task-self-distillation-for-graph-based","metrics":{"Accuracy":"82.72"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-pubmed-random","task":"Node Classification","dataset_variant":"Pubmed random partition","rows":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper":"/paper/graphmix-regularized-training-of-graph-neural","metrics":{"Accuracy":"80.72 ± 1.08"},"code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"paper":"/paper/faster-inference-time-for-gnns-using","title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","date":"2024-10-19","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/scaling-up-summarization-leveraging-large","title":"Scaling Up Summarization: Leveraging Large Language Models for Long Text Extractive Summarization","date":"2024-08-28","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/classic-gnns-are-strong-baselines-reassessing","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","date":"2024-06-13","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":9,"samples_ran":2,"samples_unverified":7,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/gscan-graph-stability-clustering-for","title":"GSCAN: Graph Stability Clustering for Applications With Noise Using Edge-Aware Excess-of-Mass","date":"2024-04-17","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mitigating-degree-biases-in-message-passing","title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","date":"2023-12-28","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/contrastive-deep-nonnegative-matrix","title":"Contrastive Deep Nonnegative Matrix Factorization for Community Detection","date":"2023-11-04","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/from-cluster-assumption-to-graph-convolution","title":"From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited","date":"2023-09-24","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/the-split-matters-flat-minima-methods-for","title":"The Split Matters: Flat Minima Methods for Improving the Performance of GNNs","date":"2023-06-15","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/clarify-confused-nodes-through-separated","title":"Clarify Confused Nodes via Separated Learning","date":"2023-06-04","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/graph-entropy-minimization-for-semi","title":"Graph Entropy Minimization for Semi-supervised Node Classification","date":"2023-05-31","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/ness-learning-node-embeddings-from-static","title":"NESS: Node Embeddings from Static SubGraphs","date":"2023-03-15","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/multi-mask-aggregators-for-graph-neural","title":"Multi-Mask Aggregators for Graph Neural Networks","date":"2022-11-24","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gosum-extractive-summarization-of-long","title":"GoSum: Extractive Summarization of Long Documents by Reinforcement Learning and Graph Organized discourse state","date":"2022-11-18","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/toward-unifying-text-segmentation-and-long","title":"Toward Unifying Text Segmentation and Long Document Summarization","date":"2022-10-28","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/beyond-homophily-with-graph-echo-state-1","title":"Beyond Homophily with Graph Echo State Networks","date":"2022-10-27","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/adapting-pretrained-text-to-text-models-for","title":"Adapting Pretrained Text-to-Text Models for Long Text Sequences","date":"2022-09-21","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gretel-graph-contrastive-topic-enhanced","title":"GRETEL: Graph Contrastive Topic Enhanced Language Model for Long Document Extractive Summarization","date":"2022-08-21","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/beyond-homophily-structure-aware-path","title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","date":"2022-07-20","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-trees-with-attention","title":"TREE-G: Decision Trees Contesting Graph Neural Networks","date":"2022-07-06","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":10,"samples_ran":0,"samples_unverified":10,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/diffwire-inductive-graph-rewiring-via-the","title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","date":"2022-06-15","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/factorizing-content-and-budget-decisions-in","title":"Factorizing Content and Budget Decisions in Abstractive Summarization of Long Documents","date":"2022-05-25","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gencomparesum-a-hybrid-unsupervised","title":"GenCompareSum: a hybrid unsupervised summarization method using salience","date":"2022-05-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/inferring-from-references-with-differences","title":"Inferring from References with Differences for Semi-Supervised Node Classification on Graphs","date":"2022-04-11","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/how-to-find-your-friendly-neighborhood-graph-1","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","date":"2022-04-11","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":1,"samples_unverified":0,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/view-consistent-heterogeneous-network-on","title":"View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes","date":"2022-03-17","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/histruct-improving-extractive-text-1","title":"HiStruct+: Improving Extractive Text Summarization with Hierarchical Structure Information","date":"2022-03-17","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/long-document-summarization-with-top-down-and-1","title":"Long Document Summarization with Top-down and Bottom-up Inference","date":"2022-03-15","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-representation-learning-beyond-node-and","title":"Graph Representation Learning Beyond Node and Homophily","date":"2022-03-03","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/an-effective-graph-learning-based-approach","title":"An Effective Graph Learning based Approach for Temporal Link Prediction: The First Place of WSDM Cup 2022","date":"2022-03-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/longt5-efficient-text-to-text-transformer-for","title":"LongT5: Efficient Text-To-Text Transformer for Long Sequences","date":"2021-12-15","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":1,"samples_unverified":0,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/scaling-language-models-methods-analysis-1","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","date":"2021-12-08","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/multi-task-self-distillation-for-graph-based","title":"Multi-task Self-distillation for Graph-based Semi-Supervised Learning","date":"2021-12-02","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/understanding-over-squashing-and-bottlenecks-1","title":"Understanding over-squashing and bottlenecks on graphs via curvature","date":"2021-11-29","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":5,"samples_ran":0,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/cn-motifs-perceptive-graph-neural-networks","title":"CN-Motifs Perceptive Graph Neural Networks","date":"2021-11-15","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/tackling-oversmoothing-of-gnns-with-1","title":"Deeper-GXX: Deepening Arbitrary GNNs","date":"2021-10-26","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/fdgatii-fast-dynamic-graph-attention-with","title":"FDGATII : Fast Dynamic Graph Attention with Initial Residual and Identity Mapping","date":"2021-10-21","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-less-neural-networks-teaching-old-mlps-1","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","date":"2021-10-17","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":8,"samples_ran":5,"samples_unverified":3,"pointer_only_for_licence":8,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/neural-link-prediction-with-walk-pooling-1","title":"Neural Link Prediction with Walk Pooling","date":"2021-10-08","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/is-heterophily-a-real-nightmare-for-graph","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","date":"2021-09-12","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/fastformer-additive-attention-is-all-you-need","title":"Fastformer: Additive Attention Can Be All You Need","date":"2021-08-20","rows_on_this_dataset":1,"code_links":13,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":4,"samples_ran":4,"samples_unverified":0,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/variational-graph-normalized-auto-encoders","title":"Variational Graph Normalized Auto-Encoders","date":"2021-08-18","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/improving-unsupervised-extractive","title":"Improving Unsupervised Extractive Summarization with Facet-Aware Modeling","date":"2021-08-01","rows_on_this_dataset":4,"code_links":0,"syntology":null},{"paper":"/paper/rethinking-graph-autoencoder-models-for","title":"Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering","date":"2021-07-19","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":3,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/memsum-extractive-summarization-of-long","title":"MemSum: Extractive Summarization of Long Documents Using Multi-Step Episodic Markov Decision Processes","date":"2021-07-19","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fea2fea-exploring-structural-feature","title":"Fea2Fea: Exploring Structural Feature Correlations via Graph Neural Networks","date":"2021-06-24","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/distilling-self-knowledge-from-contrastive","title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","date":"2021-06-16","rows_on_this_dataset":8,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":0,"samples_unverified":1,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":15,"samples_ran":2,"samples_unverified":13,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/mixup-for-node-and-graph-classification","title":"Mixup for Node and Graph Classification","date":"2021-06-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hierarchical-learning-for-generation-with","title":"Hierarchical Learning for Generation with Long Source Sequences","date":"2021-04-15","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/extract-the-knowledge-of-graph-neural","title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","date":"2021-03-04","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":2,"samples_unverified":1,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/cleora-a-simple-strong-and-scalable-graph","title":"Cleora: A Simple, Strong and Scalable Graph Embedding Scheme","date":"2021-02-03","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/simple-spectral-graph-convolution","title":"Simple Spectral Graph Convolution","date":"2021-01-01","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/systematically-exploring-redundancy-reduction","title":"Systematically Exploring Redundancy Reduction in Summarizing Long Documents","date":"2020-11-30","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/graph-infoclust-leveraging-cluster-level-node","title":"Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning","date":"2020-09-15","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":1,"samples_unverified":2,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/sparsifying-transformer-models-with","title":"Sparsifying Transformer Models with Trainable Representation Pooling","date":"2020-09-10","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mutual-teaching-for-graph-convolutional","title":"Mutual Teaching for Graph Convolutional Networks","date":"2020-09-02","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/optimization-of-graph-neural-networks-with","title":"Optimization of Graph Neural Networks with Natural Gradient Descent","date":"2020-08-21","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/big-bird-transformers-for-longer-sequences","title":"Big Bird: Transformers for Longer Sequences","date":"2020-07-28","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":15,"samples_ran":10,"samples_unverified":5,"pointer_only_for_licence":11,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/towards-deeper-graph-neural-networks","title":"Towards Deeper Graph Neural Networks","date":"2020-07-18","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":3,"samples_unverified":0,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":5,"samples_unverified":2,"pointer_only_for_licence":4,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/nodenet-a-graph-regularised-neural-network","title":"NodeNet: A Graph Regularised Neural Network for Node Classification","date":"2020-06-16","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":1,"samples_unverified":0,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/graph-random-neural-network","title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","date":"2020-05-22","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":22,"samples_ran":8,"samples_unverified":14,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/hiporank-incorporating-hierarchical-and","title":"Discourse-Aware Unsupervised Summarization of Long Scientific Documents","date":"2020-05-01","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/extractive-summarization-as-text-matching","title":"Extractive Summarization as Text Matching","date":"2020-04-19","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/a-divide-and-conquer-approach-to-the","title":"A Divide-and-Conquer Approach to the Summarization of Long Documents","date":"2020-04-13","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/bridging-the-gap-between-spectral-and-spatial","title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","date":"2020-03-26","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/unifying-graph-convolutional-neural-networks-1","title":"Unifying Graph Convolutional Neural Networks and Label Propagation","date":"2020-02-17","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":14,"samples_ran":2,"samples_unverified":12,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/get-rid-of-suspended-animation-problem-deep","title":"Get Rid of Suspended Animation Problem: Deep Diffusive Neural Network on Graph Semi-Supervised Classification","date":"2020-01-22","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/graph-bert-only-attention-is-needed-for","title":"Graph-Bert: Only Attention is Needed for Learning Graph Representations","date":"2020-01-15","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/pegasus-pre-training-with-extracted-gap","title":"PEGASUS: Pre-training with Extracted Gap-sentences for Abstractive Summarization","date":"2019-12-18","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":19,"samples_ran":1,"samples_unverified":18,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/gaussian-embedding-of-large-scale-attributed","title":"Gaussian Embedding of Large-scale Attributed Graphs","date":"2019-12-02","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-capsule-network-based-model-for-learning","title":"A Capsule Network-based Model for Learning Node Embeddings","date":"2019-11-12","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graphair-graph-representation-learning-with","title":"GraphAIR: Graph Representation Learning with Neighborhood Aggregation and Interaction","date":"2019-11-05","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":11,"samples_ran":7,"samples_unverified":4,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/hyperbolic-graph-convolutional-neural","title":"Hyperbolic Graph Convolutional Neural Networks","date":"2019-10-28","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":2,"samples_unverified":1,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/diffusion-improves-graph-learning-1","title":"Diffusion Improves Graph Learning","date":"2019-10-28","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":0,"samples_unverified":3,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/pre-train-and-learn-preserve-global","title":"Pre-train and Learn: Preserve Global Information for Graph Neural Networks","date":"2019-10-27","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dfnets-spectral-cnns-for-graphs-with-feedback","title":"DFNets: Spectral CNNs for Graphs with Feedback-Looped Filters","date":"2019-10-24","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":2,"samples_ran":0,"samples_unverified":2,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/rethinking-kernel-methods-for-node","title":"Rethinking Kernel Methods for Node Representation Learning on Graphs","date":"2019-10-06","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graphmix-regularized-training-of-graph-neural","title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","date":"2019-09-25","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/extractive-summarization-of-long-documents-by","title":"Extractive Summarization of Long Documents by Combining Global and Local Context","date":"2019-09-17","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gresnet-graph-residuals-for-reviving-deep","title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","date":"2019-09-12","rows_on_this_dataset":4,"code_links":2,"syntology":null},{"paper":"/paper/on-extractive-and-abstractive-neural-document","title":"On Extractive and Abstractive Neural Document Summarization with Transformer Language Models","date":"2019-09-07","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":6,"samples_ran":0,"samples_unverified":6,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/measuring-and-relieving-the-over-smoothing","title":"Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological View","date":"2019-09-07","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/auto-gnn-neural-architecture-search-of-graph","title":"Auto-GNN: Neural Architecture Search of Graph Neural Networks","date":"2019-09-07","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/190807558","title":"Transferring Robustness for Graph Neural Network Against Poisoning Attacks","date":"2019-08-20","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/adagcn-adaboosting-graph-convolutional","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","date":"2019-08-14","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/rwr-gae-random-walk-regularization-for-graph","title":"RWR-GAE: Random Walk Regularization for Graph Auto Encoders","date":"2019-08-12","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":9,"samples_ran":2,"samples_unverified":7,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/the-truly-deep-graph-convolutional-networks","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","date":"2019-07-25","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":5,"samples_ran":0,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/structure-fusion-based-on-graph-convolutional","title":"Structure fusion based on graph convolutional networks for semi-supervised classification","date":"2019-07-02","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/certifiable-robustness-and-robust-training","title":"Certifiable Robustness and Robust Training for Graph Convolutional Networks","date":"2019-06-28","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":3,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":6,"samples_ran":1,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","date":"2019-06-05","rows_on_this_dataset":15,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":9,"samples_ran":1,"samples_unverified":8,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/attributed-graph-clustering-via-adaptive","title":"Attributed Graph Clustering via Adaptive Graph Convolution","date":"2019-06-04","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-flexible-generative-framework-for-graph","title":"A Flexible Generative Framework for Graph-based Semi-supervised Learning","date":"2019-05-26","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":0,"samples_unverified":1,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/neighborhood-enlargement-in-graph-neural","title":"Mutual Information Maximization in Graph Neural Networks","date":"2019-05-21","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":6,"syntology":null},{"paper":"/paper/graph-u-nets","title":"Graph U-Nets","date":"2019-05-11","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":4,"samples_ran":3,"samples_unverified":1,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/mixhop-higher-order-graph-convolution","title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","date":"2019-04-30","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/graph-optimized-convolutional-networks","title":"Robust Graph Data Learning via Latent Graph Convolutional Representation","date":"2019-04-26","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graphnas-graph-neural-architecture-search","title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","date":"2019-04-22","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":8,"samples_ran":0,"samples_unverified":8,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/graph-wavelet-neural-network-1","title":"Graph Wavelet Neural Network","date":"2019-04-12","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/scibert-pretrained-contextualized-embeddings","title":"SciBERT: A Pretrained Language Model for Scientific Text","date":"2019-03-26","rows_on_this_dataset":1,"code_links":6,"syntology":null},{"paper":"/paper/fast-graph-representation-learning-with","title":"Fast Graph Representation Learning with PyTorch Geometric","date":"2019-03-06","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":2,"samples_ran":0,"samples_unverified":2,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/semi-supervised-node-classification-via","title":"Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification","date":"2019-02-13","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":13,"samples_ran":8,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/lanczosnet-multi-scale-deep-graph","title":"LanczosNet: Multi-Scale Deep Graph Convolutional Networks","date":"2019-01-06","rows_on_this_dataset":8,"code_links":1,"syntology":null},{"paper":"/paper/multi-task-graph-autoencoders","title":"Multi-Task Graph Autoencoders","date":"2018-11-07","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":9,"samples_ran":2,"samples_unverified":7,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/deep-autoencoder-like-nonnegative-matrix","title":"Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection","date":"2018-10-22","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/predict-then-propagate-graph-neural-networks","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","date":"2018-10-14","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":12,"samples_ran":1,"samples_unverified":11,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/encoding-robust-representation-for-graph","title":"Encoding Robust Representation for Graph Generation","date":"2018-09-28","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":35,"samples_ran":24,"samples_unverified":11,"pointer_only_for_licence":9,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/every-node-counts-self-ensembling-graph","title":"Every Node Counts: Self-Ensembling Graph Convolutional Networks for Semi-Supervised Learning","date":"2018-09-26","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/adaptive-sampling-towards-fast-graph","title":"Adaptive Sampling Towards Fast Graph Representation Learning","date":"2018-09-14","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/hierarchical-neural-networks-for-sequential","title":"Hierarchical Neural Networks for Sequential Sentence Classification in Medical Scientific Abstracts","date":"2018-08-19","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/large-scale-learnable-graph-convolutional","title":"Large-Scale Learnable Graph Convolutional Networks","date":"2018-08-12","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-discourse-aware-attention-model-for","title":"A Discourse-Aware Attention Model for Abstractive Summarization of Long Documents","date":"2018-04-16","rows_on_this_dataset":4,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":14,"samples_ran":1,"samples_unverified":13,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/hyperspherical-variational-auto-encoders","title":"Hyperspherical Variational Auto-Encoders","date":"2018-04-03","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":14,"samples_ran":0,"samples_unverified":14,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/graphite-iterative-generative-modeling-of","title":"Graphite: Iterative Generative Modeling of Graphs","date":"2018-03-28","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/n-gcn-multi-scale-graph-convolution-for-semi","title":"N-GCN: Multi-scale Graph Convolution for Semi-supervised Node Classification","date":"2018-02-24","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-to-make-predictions-on-graphs-with","title":"Learning to Make Predictions on Graphs with Autoencoders","date":"2018-02-23","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/adversarially-regularized-graph-autoencoder","title":"Adversarially Regularized Graph Autoencoder for Graph Embedding","date":"2018-02-13","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/fastgcn-fast-learning-with-graph","title":"FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling","date":"2018-01-30","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":0,"samples_unverified":3,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/splinecnn-fast-geometric-deep-learning-with","title":"SplineCNN: Fast Geometric Deep Learning with Continuous B-Spline Kernels","date":"2017-11-24","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","rows_on_this_dataset":6,"code_links":93,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":106,"samples_ran":50,"samples_unverified":56,"pointer_only_for_licence":43,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","rows_on_this_dataset":5,"code_links":20,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":5,"samples_ran":3,"samples_unverified":2,"pointer_only_for_licence":5,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/get-to-the-point-summarization-with-pointer","title":"Get To The Point: Summarization with Pointer-Generator Networks","date":"2017-04-14","rows_on_this_dataset":1,"code_links":39,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":64,"samples_ran":30,"samples_unverified":34,"pointer_only_for_licence":44,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/variational-graph-auto-encoders","title":"Variational Graph Auto-Encoders","date":"2016-11-21","rows_on_this_dataset":2,"code_links":22,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":13,"samples_ran":7,"samples_unverified":6,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","rows_on_this_dataset":1,"code_links":55,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":58,"samples_ran":31,"samples_unverified":27,"pointer_only_for_licence":22,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/convolutional-neural-networks-on-graphs-with","title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","date":"2016-06-30","rows_on_this_dataset":5,"code_links":5,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":6,"samples_ran":2,"samples_unverified":4,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/revisiting-semi-supervised-learning-with","title":"Revisiting Semi-Supervised Learning with Graph Embeddings","date":"2016-03-29","rows_on_this_dataset":1,"code_links":26,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":28,"samples_ran":15,"samples_unverified":13,"pointer_only_for_licence":4,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/gated-graph-sequence-neural-networks","title":"Gated Graph Sequence Neural Networks","date":"2015-11-17","rows_on_this_dataset":4,"code_links":13,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":12,"samples_ran":0,"samples_unverified":12,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/diffusion-convolutional-neural-networks","title":"Diffusion-Convolutional Neural Networks","date":"2015-11-06","rows_on_this_dataset":4,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":0,"samples_unverified":3,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/convolutional-networks-on-graphs-for-learning","title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","date":"2015-09-30","rows_on_this_dataset":4,"code_links":8,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":26,"samples_ran":0,"samples_unverified":26,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}}],"syntology_totals":{"read_at":"2026-09-24T18:15:14+00:00","papers_with_samples":50,"samples_harvested":637,"samples_ran":244,"samples_unverified":393,"pointer_only_for_licence":175,"papers_with_no_sample_that_ran":15,"note":"the per-paper counts above, summed; not a rate"},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks."}