{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/dataset/collab","name":"COLLAB","full_name":null,"description_markdown":"**COLLAB** is a scientific collaboration dataset. A graph corresponds to a researcher’s ego network, i.e., the researcher and its collaborators are nodes and an edge indicates collaboration between two researchers. A researcher’s ego network has three possible labels, i.e., High Energy Physics, Condensed Matter Physics, and Astro Physics, which are the fields that the researcher belongs to. The dataset has 5,000 graphs and each graph has label 0, 1, or 2.\r\n\r\nSource: [1 Introduction](https://arxiv.org/abs/2006.11165)","description_withheld":null,"homepage":"https://ls11-www.cs.tu-dortmund.de/staff/morris/graphkerneldatasets","introduced_date":"2015-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/deep-graph-kernels","title":"Deep Graph Kernels","first_author":"Pinar Yanardag","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Link Prediction","url":"/task/link-prediction","datasets_with_task":"/datasets/task/link-prediction"},{"name":"Graph Classification","url":"/task/graph-classification","datasets_with_task":"/datasets/task/graph-classification"}],"languages":[],"variants":["COLLAB"],"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":259,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/graph-classification-on-collab","task":"Graph Classification","dataset_variant":"COLLAB","rows":39,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper":"/paper/unsupervised-universal-self-attention-network","metrics":{"Accuracy":"95.62%"},"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"},{"leaderboard":"/sota/link-prediction-on-collab","task":"Link Prediction","dataset_variant":"COLLAB","rows":1,"metrics":["Hits"],"first_row_in_archive_order":{"model":"GatedGCN-PE","paper":"/paper/benchmarking-graph-neural-networks","metrics":{"Hits":"52.849"},"code_links":[{"title":"graphdeeplearning/benchmarking-gnns","url":"https://github.com/graphdeeplearning/benchmarking-gnns"},{"title":"PaddlePaddle/PGL","url":"https://github.com/PaddlePaddle/PGL/tree/main/ogb_examples/nodeproppred/ogbn-arxiv/unimp_appnp_vnode_smooth"},{"title":"PaddlePaddle/PGL","url":"https://github.com/PaddlePaddle/PGL/tree/main/ogb_examples/nodeproppred/ogbn-proteins/unimp_cross_feat"},{"title":"PaddlePaddle/PGL","url":"https://github.com/PaddlePaddle/PGL/tree/master/examples/GaAN"},{"title":"PaddlePaddle/PGL","url":"https://github.com/PaddlePaddle/PGL/tree/master/ogb_examples/nodeproppred/ogbn-arxiv"},{"title":"PaddlePaddle/PGL","url":"https://github.com/PaddlePaddle/PGL/tree/main/ogb_examples/graphproppred/ogbg_molpcba"},{"title":"PaddlePaddle/PGL","url":"https://github.com/PaddlePaddle/PGL"},{"title":"shamim-hussain/egt","url":"https://github.com/shamim-hussain/egt"},{"title":"karl-zhao/benchmarking-gnns-pyg","url":"https://github.com/karl-zhao/benchmarking-gnns-pyg"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"chenfengzhao/gnnhls","url":"https://github.com/chenfengzhao/gnnhls"},{"title":"yashkotadia/GatedGCN-PATTERN","url":"https://github.com/yashkotadia/GatedGCN-PATTERN"},{"title":"changminwu/expandergnn","url":"https://github.com/changminwu/expandergnn"},{"title":"liketheflower/jimmy_dgl","url":"https://github.com/liketheflower/jimmy_dgl"},{"title":"icml2024357/hombasis-gnn","url":"https://github.com/icml2024357/hombasis-gnn"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":31,"of":31,"counts":{"papers_with_a_benchmark_row":31,"with_a_code_link":26,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":31,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":12,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":12,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/panda-expanded-width-aware-message-passing","slug":"panda-expanded-width-aware-message-passing","title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","date":"2024-06-06","arxiv_id":"2406.03671","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":4,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["jeongwhanchoi/panda"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/panda-expanded-width-aware-message-passing#ran","syntology_url":"https://syntology.ai/paper/2406.03671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03671"}}}},{"paper":"/paper/strengthening-structural-baselines-for-graph","slug":"strengthening-structural-baselines-for-graph","title":"Strengthening structural baselines for graph classification using Local Topological Profile","date":"2023-05-01","arxiv_id":"2305.00724","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/diffwire-inductive-graph-rewiring-via-the","slug":"diffwire-inductive-graph-rewiring-via-the","title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","date":"2022-06-15","arxiv_id":"2206.07369","rows_on_this_dataset":4,"code_links":2,"syntology":null},{"paper":"/paper/template-based-graph-neural-network-with","slug":"template-based-graph-neural-network-with","title":"Template based Graph Neural Network with Optimal Transport Distances","date":"2022-05-31","arxiv_id":"2205.15733","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graphmae-self-supervised-masked-graph","slug":"graphmae-self-supervised-masked-graph","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","date":"2022-05-22","arxiv_id":"2205.10803","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["thudm/graphmae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graphmae-self-supervised-masked-graph#ran","syntology_url":"https://syntology.ai/paper/2205.10803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10803"}}}},{"paper":"/paper/maximum-entropy-weighted-independent-set","slug":"maximum-entropy-weighted-independent-set","title":"Maximum Entropy Weighted Independent Set Pooling for Graph Neural Networks","date":"2021-07-03","arxiv_id":"2107.01410","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["mewispool/mewispool"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/maximum-entropy-weighted-independent-set#ran","syntology_url":"https://syntology.ai/paper/2107.01410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01410"}}}},{"paper":"/paper/accurate-learning-of-graph-representations-1","slug":"accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","arxiv_id":"2102.11533","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":4,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":5,"official":{"repos":["JinheonBaek/GMT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/accurate-learning-of-graph-representations-1#ran","syntology_url":"https://syntology.ai/paper/2102.11533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11533"}}}},{"paper":"/paper/factorizable-graph-convolutional-networks","slug":"factorizable-graph-convolutional-networks","title":"Factorizable Graph Convolutional Networks","date":"2020-10-12","arxiv_id":"2010.05421","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ihollywhy/FactorGCN.PyTorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/factorizable-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2010.05421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05421"}}}},{"paper":"/paper/wasserstein-embedding-for-graph-learning","slug":"wasserstein-embedding-for-graph-learning","title":"Wasserstein Embedding for Graph Learning","date":"2020-06-16","arxiv_id":"2006.09430","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/benchmarking-graph-neural-networks","slug":"benchmarking-graph-neural-networks","title":"Benchmarking Graph Neural Networks","date":"2020-03-02","arxiv_id":"2003.00982","rows_on_this_dataset":1,"code_links":15,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":23,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":13,"pointer_only_for_licence":1,"official":{"repos":["graphdeeplearning/benchmarking-gnns","karl-zhao/benchmarking-gnns-pyg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/benchmarking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2003.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00982"}}}},{"paper":"/paper/segmented-graph-bert-for-graph-instance","slug":"segmented-graph-bert-for-graph-instance","title":"Segmented Graph-Bert for Graph Instance Modeling","date":"2020-02-09","arxiv_id":"2002.03283","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-fair-comparison-of-graph-neural-networks-1","slug":"a-fair-comparison-of-graph-neural-networks-1","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","date":"2019-12-20","arxiv_id":"1912.09893","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/hierarchical-representation-learning-in-graph","slug":"hierarchical-representation-learning-in-graph","title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","date":"2019-10-24","arxiv_id":"1910.11436","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["danielegrattarola/decimation-pooling"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-representation-learning-in-graph#ran","syntology_url":"https://syntology.ai/paper/1910.11436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11436"}}}},{"paper":"/paper/unsupervised-universal-self-attention-network","slug":"unsupervised-universal-self-attention-network","title":"Universal Graph Transformer Self-Attention Networks","date":"2019-09-26","arxiv_id":"1909.11855","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["daiquocnguyen/Graph-Transformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unsupervised-universal-self-attention-network#ran","syntology_url":"https://syntology.ai/paper/1909.11855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11855"}}}},{"paper":"/paper/190910086","slug":"190910086","title":"Learning Universal Graph Neural Network Embeddings With Aid Of Transfer Learning","date":"2019-09-22","arxiv_id":"1909.10086","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-non-negative-factorization-approach-to-node","slug":"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","arxiv_id":"1909.03287","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-representation-learning-via-hard-and","slug":"graph-representation-learning-via-hard-and","title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","date":"2019-07-05","arxiv_id":"1907.04652","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/provably-powerful-graph-networks","slug":"provably-powerful-graph-networks","title":"Provably Powerful Graph Networks","date":"2019-05-27","arxiv_id":"1905.11136","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/provably-powerful-graph-networks#ran","syntology_url":"https://syntology.ai/paper/1905.11136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11136"}}}},{"paper":"/paper/neighborhood-enlargement-in-graph-neural","slug":"neighborhood-enlargement-in-graph-neural","title":"Mutual Information Maximization in Graph Neural Networks","date":"2019-05-21","arxiv_id":"1905.08509","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/dissecting-graph-neural-networks-on-graph","slug":"dissecting-graph-neural-networks-on-graph","title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","date":"2019-05-11","arxiv_id":"1905.04579","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/graph-u-nets","slug":"graph-u-nets","title":"Graph U-Nets","date":"2019-05-11","arxiv_id":"1905.05178","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["HongyangGao/gunet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-u-nets#ran","syntology_url":"https://syntology.ai/paper/1905.05178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05178"}}}},{"paper":"/paper/understanding-attention-in-graph-neural","slug":"understanding-attention-in-graph-neural","title":"Understanding Attention and Generalization in Graph Neural Networks","date":"2019-05-08","arxiv_id":"1905.02850","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/capsule-graph-neural-network","slug":"capsule-graph-neural-network","title":"Capsule Graph Neural Network","date":"2019-05-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fast-graph-representation-learning-with","slug":"fast-graph-representation-learning-with","title":"Fast Graph Representation Learning with PyTorch Geometric","date":"2019-03-06","arxiv_id":"1903.02428","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["rusty1s/pytorch_geometric"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fast-graph-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/1903.02428","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.02428"}}}},{"paper":"/paper/how-powerful-are-graph-neural-networks","slug":"how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","arxiv_id":"1810.00826","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":2,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":5,"official":{"repos":["weihua916/powerful-gnns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-powerful-are-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.00826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.00826"}}}},{"paper":"/paper/when-work-matters-transforming-classical","slug":"when-work-matters-transforming-classical","title":"When Work Matters: Transforming Classical Network Structures to Graph CNN","date":"2018-07-07","arxiv_id":"1807.02653","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/hierarchical-graph-representation-learning","slug":"hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","arxiv_id":"1806.08804","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":20,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":10,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/1806.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08804"}}}},{"paper":"/paper/an-end-to-end-deep-learning-architecture-for","slug":"an-end-to-end-deep-learning-architecture-for","title":"An End-to-End Deep Learning Architecture for Graph Classification","date":"2018-04-29","arxiv_id":null,"rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/dgcnn-disordered-graph-convolutional-neural","slug":"dgcnn-disordered-graph-convolutional-neural","title":"DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model","date":"2017-12-10","arxiv_id":"1712.03563","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-classification-with-2d-convolutional","slug":"graph-classification-with-2d-convolutional","title":"Graph Classification with 2D Convolutional Neural Networks","date":"2017-07-29","arxiv_id":"1708.02218","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/deep-graph-kernels","slug":"deep-graph-kernels","title":"Deep Graph Kernels","date":"2015-08-10","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/panda-expanded-width-aware-message-passing","slug":"panda-expanded-width-aware-message-passing","title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","date":"2024-06-06","arxiv_id":"2406.03671","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":4,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["jeongwhanchoi/panda"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/panda-expanded-width-aware-message-passing#ran","syntology_url":"https://syntology.ai/paper/2406.03671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03671"}}}},{"paper":"/paper/strengthening-structural-baselines-for-graph","slug":"strengthening-structural-baselines-for-graph","title":"Strengthening structural baselines for graph classification using Local Topological Profile","date":"2023-05-01","arxiv_id":"2305.00724","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/diffwire-inductive-graph-rewiring-via-the","slug":"diffwire-inductive-graph-rewiring-via-the","title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","date":"2022-06-15","arxiv_id":"2206.07369","rows_on_this_dataset":4,"code_links":2,"syntology":null},{"paper":"/paper/template-based-graph-neural-network-with","slug":"template-based-graph-neural-network-with","title":"Template based Graph Neural Network with Optimal Transport Distances","date":"2022-05-31","arxiv_id":"2205.15733","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graphmae-self-supervised-masked-graph","slug":"graphmae-self-supervised-masked-graph","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","date":"2022-05-22","arxiv_id":"2205.10803","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["thudm/graphmae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graphmae-self-supervised-masked-graph#ran","syntology_url":"https://syntology.ai/paper/2205.10803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10803"}}}},{"paper":"/paper/maximum-entropy-weighted-independent-set","slug":"maximum-entropy-weighted-independent-set","title":"Maximum Entropy Weighted Independent Set Pooling for Graph Neural Networks","date":"2021-07-03","arxiv_id":"2107.01410","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["mewispool/mewispool"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/maximum-entropy-weighted-independent-set#ran","syntology_url":"https://syntology.ai/paper/2107.01410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01410"}}}},{"paper":"/paper/accurate-learning-of-graph-representations-1","slug":"accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","arxiv_id":"2102.11533","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":4,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":5,"official":{"repos":["JinheonBaek/GMT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/accurate-learning-of-graph-representations-1#ran","syntology_url":"https://syntology.ai/paper/2102.11533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11533"}}}},{"paper":"/paper/factorizable-graph-convolutional-networks","slug":"factorizable-graph-convolutional-networks","title":"Factorizable Graph Convolutional Networks","date":"2020-10-12","arxiv_id":"2010.05421","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ihollywhy/FactorGCN.PyTorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/factorizable-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2010.05421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05421"}}}},{"paper":"/paper/wasserstein-embedding-for-graph-learning","slug":"wasserstein-embedding-for-graph-learning","title":"Wasserstein Embedding for Graph Learning","date":"2020-06-16","arxiv_id":"2006.09430","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/benchmarking-graph-neural-networks","slug":"benchmarking-graph-neural-networks","title":"Benchmarking Graph Neural Networks","date":"2020-03-02","arxiv_id":"2003.00982","rows_on_this_dataset":1,"code_links":15,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":23,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":13,"pointer_only_for_licence":1,"official":{"repos":["graphdeeplearning/benchmarking-gnns","karl-zhao/benchmarking-gnns-pyg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/benchmarking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2003.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00982"}}}},{"paper":"/paper/segmented-graph-bert-for-graph-instance","slug":"segmented-graph-bert-for-graph-instance","title":"Segmented Graph-Bert for Graph Instance Modeling","date":"2020-02-09","arxiv_id":"2002.03283","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-fair-comparison-of-graph-neural-networks-1","slug":"a-fair-comparison-of-graph-neural-networks-1","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","date":"2019-12-20","arxiv_id":"1912.09893","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/hierarchical-representation-learning-in-graph","slug":"hierarchical-representation-learning-in-graph","title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","date":"2019-10-24","arxiv_id":"1910.11436","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["danielegrattarola/decimation-pooling"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-representation-learning-in-graph#ran","syntology_url":"https://syntology.ai/paper/1910.11436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11436"}}}},{"paper":"/paper/unsupervised-universal-self-attention-network","slug":"unsupervised-universal-self-attention-network","title":"Universal Graph Transformer Self-Attention Networks","date":"2019-09-26","arxiv_id":"1909.11855","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["daiquocnguyen/Graph-Transformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unsupervised-universal-self-attention-network#ran","syntology_url":"https://syntology.ai/paper/1909.11855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11855"}}}},{"paper":"/paper/190910086","slug":"190910086","title":"Learning Universal Graph Neural Network Embeddings With Aid Of Transfer Learning","date":"2019-09-22","arxiv_id":"1909.10086","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-non-negative-factorization-approach-to-node","slug":"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","arxiv_id":"1909.03287","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-representation-learning-via-hard-and","slug":"graph-representation-learning-via-hard-and","title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","date":"2019-07-05","arxiv_id":"1907.04652","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/provably-powerful-graph-networks","slug":"provably-powerful-graph-networks","title":"Provably Powerful Graph Networks","date":"2019-05-27","arxiv_id":"1905.11136","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/provably-powerful-graph-networks#ran","syntology_url":"https://syntology.ai/paper/1905.11136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11136"}}}},{"paper":"/paper/neighborhood-enlargement-in-graph-neural","slug":"neighborhood-enlargement-in-graph-neural","title":"Mutual Information Maximization in Graph Neural Networks","date":"2019-05-21","arxiv_id":"1905.08509","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/dissecting-graph-neural-networks-on-graph","slug":"dissecting-graph-neural-networks-on-graph","title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","date":"2019-05-11","arxiv_id":"1905.04579","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/graph-u-nets","slug":"graph-u-nets","title":"Graph U-Nets","date":"2019-05-11","arxiv_id":"1905.05178","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["HongyangGao/gunet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-u-nets#ran","syntology_url":"https://syntology.ai/paper/1905.05178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05178"}}}},{"paper":"/paper/understanding-attention-in-graph-neural","slug":"understanding-attention-in-graph-neural","title":"Understanding Attention and Generalization in Graph Neural Networks","date":"2019-05-08","arxiv_id":"1905.02850","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/capsule-graph-neural-network","slug":"capsule-graph-neural-network","title":"Capsule Graph Neural Network","date":"2019-05-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fast-graph-representation-learning-with","slug":"fast-graph-representation-learning-with","title":"Fast Graph Representation Learning with PyTorch Geometric","date":"2019-03-06","arxiv_id":"1903.02428","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["rusty1s/pytorch_geometric"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fast-graph-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/1903.02428","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.02428"}}}},{"paper":"/paper/how-powerful-are-graph-neural-networks","slug":"how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","arxiv_id":"1810.00826","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":2,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":5,"official":{"repos":["weihua916/powerful-gnns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-powerful-are-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.00826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.00826"}}}},{"paper":"/paper/when-work-matters-transforming-classical","slug":"when-work-matters-transforming-classical","title":"When Work Matters: Transforming Classical Network Structures to Graph CNN","date":"2018-07-07","arxiv_id":"1807.02653","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/hierarchical-graph-representation-learning","slug":"hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","arxiv_id":"1806.08804","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":20,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":10,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/1806.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08804"}}}},{"paper":"/paper/an-end-to-end-deep-learning-architecture-for","slug":"an-end-to-end-deep-learning-architecture-for","title":"An End-to-End Deep Learning Architecture for Graph Classification","date":"2018-04-29","arxiv_id":null,"rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/dgcnn-disordered-graph-convolutional-neural","slug":"dgcnn-disordered-graph-convolutional-neural","title":"DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model","date":"2017-12-10","arxiv_id":"1712.03563","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-classification-with-2d-convolutional","slug":"graph-classification-with-2d-convolutional","title":"Graph Classification with 2D Convolutional Neural Networks","date":"2017-07-29","arxiv_id":"1708.02218","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/deep-graph-kernels","slug":"deep-graph-kernels","title":"Deep Graph Kernels","date":"2015-08-10","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null}],"papers_where_code_ran":12,"papers_where_code_ran_first_page":"/dataset/collab/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/collab/papers/ran/1","json":"/dataset/collab/papers/ran/1.json","rows":12}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":13,"samples_harvested":93,"samples_ran":55,"samples_constructed":7,"samples_ran_checked":44,"samples_ran_instrument_failed":11,"samples_unverified":38,"pointer_only_for_licence":22,"papers_with_no_sample_that_ran":1,"papers_with_a_sample_that_ran":12,"papers_with_a_run_with_no_instrument_failure":12,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":4,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/graph-classification-on-collab","since_archive":"/sota/graph-classification-on-collab#since-judged","papers_judged":4,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"189d2a1346867de7d6d1150232033affaa97b96297a3003bc5588219b91998a0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}