{"url":"/dataset/nci1","name":"NCI1","full_name":null,"description_markdown":"The **NCI1** dataset comes from the cheminformatics domain, where each input graph is used as representation of a chemical compound: each vertex stands for an atom of the molecule, and edges between vertices represent bonds between atoms. This dataset is relative to anti-cancer screens where the chemicals are assessed as positive or negative to cell lung cancer. Each vertex has an input label representing the corresponding atom type, encoded by a one-hot-encoding scheme into a vector of 0/1 elements.\r\n\r\nSource: [Ring Reservoir Neural Networks for Graphs](https://arxiv.org/abs/2005.05294)","description_withheld":null,"homepage":"https://ls11-www.cs.tu-dortmund.de/staff/morris/graphkerneldatasets","introduced_date":"2006-01-01","introduced_date_note":null,"introduced_by":{"paper":null,"title":"Comparison of descriptor spaces for chemical compound retrieval and classification","first_author":null,"url":"https://doi.org/10.1109/ICDM.2006.39"},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Graph Classification","url":"/task/graph-classification","datasets_with_task":"/datasets/task/graph-classification"}],"languages":[{"name":"Chinese","url":"/datasets/language/chinese"}],"variants":["NCI1","NCI-123"],"data_loaders":[{"repo":"https://github.com/dmlc/dgl","url":"https://docs.dgl.ai/api/python/dgl.data.html#dgl.data.TUDataset","frameworks":["pytorch","tf","mxnet"]},{"repo":"https://github.com/danielegrattarola/spektral","url":"https://graphneural.network/datasets/#tudataset","frameworks":["tf"]}],"num_papers_in_archive":260,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/graph-classification-on-nci1","task":"Graph Classification","dataset_variant":"NCI1","rows":69,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"TFGW ADJ (L=2)","paper":"/paper/template-based-graph-neural-network-with","metrics":{"Accuracy":"88.1%"},"code_links":[{"title":"cedricvincentcuaz/TFGW","url":"https://github.com/cedricvincentcuaz/TFGW"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-classification-on-nci-123","task":"Graph Classification","dataset_variant":"NCI-123","rows":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GAM","paper":"/paper/graph-classification-using-structural","metrics":{"Accuracy":"64.79%"},"code_links":[{"title":"benedekrozemberczki/GAM","url":"https://github.com/benedekrozemberczki/GAM"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"paper":"/paper/pre-training-graph-neural-networks-on","title":"Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck","date":"2025-02-20","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/multi-hop-attention-based-graph-pooling-a","title":"Multi-hop Attention-based Graph Pooling: A Personalized PageRank Perspective","date":"2024-03-04","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/masked-attention-is-all-you-need-for-graphs","title":"An end-to-end attention-based approach for learning on graphs","date":"2024-02-16","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-isomorphism-unet","title":"Graph isomorphism UNet","date":"2023-08-23","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":26,"samples_ran":5,"samples_unverified":21,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/generalizing-topological-graph-neural","title":"Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes","date":"2023-08-13","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/cin-enhancing-topological-message-passing","title":"CIN++: Enhancing Topological Message Passing","date":"2023-06-06","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/strengthening-structural-baselines-for-graph","title":"Strengthening structural baselines for graph classification using Local Topological Profile","date":"2023-05-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cell-attention-networks","title":"Cell Attention Networks","date":"2022-09-16","rows_on_this_dataset":1,"code_links":1,"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/pure-transformers-are-powerful-graph-learners","title":"Pure Transformers are Powerful Graph Learners","date":"2022-07-06","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":7,"samples_unverified":0,"pointer_only_for_licence":7,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"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/template-based-graph-neural-network-with","title":"Template based Graph Neural Network with Optimal Transport Distances","date":"2022-05-31","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":21,"samples_ran":3,"samples_unverified":18,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/relational-reasoning-over-spatial-temporal","title":"Relational Reasoning Over Spatial-Temporal Graphs for Video Summarization","date":"2022-04-06","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/improving-spectral-graph-convolution-for","title":"A New Perspective on the Effects of Spectrum in Graph Neural Networks","date":"2021-12-14","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/dropgnn-random-dropouts-increase-the","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","date":"2021-11-11","rows_on_this_dataset":1,"code_links":1,"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/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/relation-order-histograms-as-a-network","title":"Relation order histograms as a network embedding tool","date":"2021-06-09","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/do-transformers-really-perform-bad-for-graph","title":"Do Transformers Really Perform Bad for Graph Representation?","date":"2021-06-09","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":16,"samples_ran":6,"samples_unverified":10,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/a-novel-higher-order-weisfeiler-lehman-graph","title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","date":"2020-07-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/wasserstein-embedding-for-graph-learning","title":"Wasserstein Embedding for Graph Learning","date":"2020-06-16","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":55,"samples_ran":33,"samples_unverified":22,"pointer_only_for_licence":48,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/a-fair-comparison-of-graph-neural-networks-1","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","date":"2019-12-20","rows_on_this_dataset":2,"code_links":5,"syntology":null},{"paper":"/paper/asap-adaptive-structure-aware-pooling-for","title":"ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representations","date":"2019-11-18","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hierarchical-graph-pooling-with-structure","title":"Hierarchical Graph Pooling with Structure Learning","date":"2019-11-14","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/hierarchical-representation-learning-in-graph","title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","date":"2019-10-24","rows_on_this_dataset":1,"code_links":1,"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/a-non-negative-factorization-approach-to-node","title":"A Non-Negative Factorization approach to node pooling in Graph Convolutional Neural Networks","date":"2019-09-07","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/improving-attention-mechanism-in-graph-neural","title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","date":"2019-07-04","rows_on_this_dataset":1,"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/wasserstein-weisfeiler-lehman-graph-kernels","title":"Wasserstein Weisfeiler-Lehman Graph Kernels","date":"2019-06-04","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":11,"samples_ran":0,"samples_unverified":11,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/provably-powerful-graph-networks","title":"Provably Powerful Graph Networks","date":"2019-05-27","rows_on_this_dataset":1,"code_links":2,"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/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/dissecting-graph-neural-networks-on-graph","title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","date":"2019-05-11","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/capsule-graph-neural-network","title":"Capsule Graph Neural Network","date":"2019-05-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-kernels-a-survey","title":"Graph Kernels: A Survey","date":"2019-04-27","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/ddgk-learning-graph-representations-for-deep","title":"DDGK: Learning Graph Representations for Deep Divergence Graph Kernels","date":"2019-04-21","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/self-attention-graph-pooling","title":"Self-Attention Graph Pooling","date":"2019-04-17","rows_on_this_dataset":2,"code_links":3,"syntology":null},{"paper":"/paper/spi-gcn-a-simple-permutation-invariant-graph","title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","date":"2019-04-08","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/dagcn-dual-attention-graph-convolutional","title":"DAGCN: Dual Attention Graph Convolutional Networks","date":"2019-04-04","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-a-practical-k-dimensional-weisfeiler","title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","date":"2019-04-02","rows_on_this_dataset":1,"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":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/subgraph-networks-with-application-to","title":"Subgraph Networks with Application to Structural Feature Space Expansion","date":"2019-03-21","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/capsule-neural-networks-for-graph","title":"Capsule Neural Networks for Graph Classification using Explicit Tensorial Graph Representations","date":"2019-02-22","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-classification-with-recurrent","title":"Variational Recurrent Neural Networks for Graph Classification","date":"2019-02-07","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/propagation-kernels-efficient-graph-kernels","title":"Propagation kernels: efficient graph kernels from propagated information","date":"2019-02-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/spectral-multigraph-networks-for-discovering","title":"Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules","date":"2018-11-23","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gaussian-induced-convolution-for-graphs","title":"Gaussian-Induced Convolution for Graphs","date":"2018-11-11","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-simple-yet-effective-baseline-for-non","title":"A simple yet effective baseline for non-attributed graph classification","date":"2018-11-08","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/a-simple-baseline-algorithm-for-graph","title":"A Simple Baseline Algorithm for Graph Classification","date":"2018-10-22","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/weisfeiler-and-leman-go-neural-higher-order","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","date":"2018-10-04","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","rows_on_this_dataset":2,"code_links":19,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":10,"samples_ran":3,"samples_unverified":7,"pointer_only_for_licence":5,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/graph-classification-using-structural","title":"Graph Classification using Structural Attention","date":"2018-07-19","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/optimal-transport-for-structured-data-with","title":"Optimal Transport for structured data with application on graphs","date":"2018-05-23","rows_on_this_dataset":3,"code_links":2,"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/graph-capsule-convolutional-neural-networks","title":"Graph Capsule Convolutional Neural Networks","date":"2018-05-21","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/an-end-to-end-deep-learning-architecture-for","title":"An End-to-End Deep Learning Architecture for Graph Classification","date":"2018-04-29","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","rows_on_this_dataset":1,"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/learning-universal-adversarial-perturbations","title":"Learning Universal Adversarial Perturbations with Generative Models","date":"2017-08-17","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":2,"samples_ran":2,"samples_unverified":0,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/dynamic-edge-conditioned-filters-in","title":"Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs","date":"2017-04-10","rows_on_this_dataset":1,"code_links":2,"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-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/on-valid-optimal-assignment-kernels-and","title":"On Valid Optimal Assignment Kernels and Applications to Graph Classification","date":"2016-06-03","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/learning-convolutional-neural-networks-for","title":"Learning Convolutional Neural Networks for Graphs","date":"2016-05-17","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/learning-metrics-for-persistence-based-2","title":"Learning metrics for persistence-based summaries and applications for graph classification","date":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null}],"syntology_totals":{"read_at":"2026-09-24T18:15:14+00:00","papers_with_samples":20,"samples_harvested":348,"samples_ran":144,"samples_unverified":204,"pointer_only_for_licence":133,"papers_with_no_sample_that_ran":9,"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."}