{"url":"/dataset/ptc","name":"PTC","full_name":"Predictive Toxicology Challenge","description_markdown":"**PTC** is a collection of 344 chemical compounds represented as graphs which report the carcinogenicity for rats. There are 19 node labels for each node.\r\n\r\nSource: [Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity](https://arxiv.org/abs/1904.01098)","description_withheld":null,"homepage":"https://relational.fit.cvut.cz/dataset/PTC","introduced_date":null,"introduced_date_note":null,"introduced_by":{"paper":null,"title":"The predictive toxicology challenge","first_author":null,"url":"http://www.predictive-toxicology.org/ptc/Citedby:xxref-S2SS1p3"},"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":[],"variants":["PTC"],"data_loaders":[{"repo":"https://github.com/daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer","frameworks":["pytorch"]}],"num_papers_in_archive":111,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/graph-classification-on-ptc","task":"Graph Classification","dataset_variant":"PTC","rows":37,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper":"/paper/unsupervised-universal-self-attention-network","metrics":{"Accuracy":"91.81%"},"code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"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/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/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/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/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/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/segmented-graph-bert-for-graph-instance","title":"Segmented Graph-Bert for Graph Instance Modeling","date":"2020-02-09","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/unsupervised-universal-self-attention-network","title":"Universal Graph Transformer Self-Attention Networks","date":"2019-09-26","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":4,"samples_ran":4,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/190910086","title":"Learning Universal Graph Neural Network Embeddings With Aid Of Transfer Learning","date":"2019-09-22","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/infograph-unsupervised-and-semi-supervised","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","date":"2019-07-31","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/isonn-isomorphic-neural-network-for-graph","title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","date":"2019-07-22","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/graph-representation-learning-via-hard-and","title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","date":"2019-07-05","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"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/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/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/unsupervised-inductive-whole-graph-embedding","title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","date":"2019-04-01","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"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/discriminative-graph-autoencoder","title":"Discriminative Graph Autoencoder","date":"2018-11-17","rows_on_this_dataset":1,"code_links":0,"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/how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","rows_on_this_dataset":1,"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/when-work-matters-transforming-classical","title":"When Work Matters: Transforming Classical Network Structures to Graph CNN","date":"2018-07-07","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/dgcnn-disordered-graph-convolutional-neural","title":"DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model","date":"2017-12-10","rows_on_this_dataset":1,"code_links":0,"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/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}],"syntology_totals":{"read_at":"2026-09-24T18:15:14+00:00","papers_with_samples":10,"samples_harvested":56,"samples_ran":9,"samples_unverified":47,"pointer_only_for_licence":8,"papers_with_no_sample_that_ran":7,"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."}