{"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/imdb-multi","name":"IMDB-MULTI","full_name":null,"description_markdown":"**IMDB-MULTI** is a relational dataset that consists of a network of 1000 actors or actresses who played roles in movies in IMDB. A node represents an actor or actress, and an edge connects two nodes when they appear in the same movie. In IMDB-MULTI, the edges are collected from three different genres: Comedy, Romance and Sci-Fi.\r\n\r\nSource: [Learning metrics for persistence-based summaries and applications for graph classification](https://arxiv.org/abs/1904.12189)","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":"Graph Classification","url":"/task/graph-classification","datasets_with_task":"/datasets/task/graph-classification"},{"name":"Document Classification","url":"/task/document-classification","datasets_with_task":"/datasets/task/document-classification"},{"name":"Graph Similarity","url":"/task/graph-similarity","datasets_with_task":"/datasets/task/graph-similarity"}],"languages":[],"variants":["IMDb-M","IMDB-MULTI"],"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":243,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/graph-classification-on-imdb-m","task":"Graph Classification","dataset_variant":"IMDb-M","rows":36,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper":"/paper/unsupervised-universal-self-attention-network","metrics":{"Accuracy":"89.2%"},"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/document-classification-on-imdb-m","task":"Document Classification","dataset_variant":"IMDb-M","rows":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Document Classification Using Importance of Sentences","paper":"/paper/improving-document-level-sentiment","metrics":{"Accuracy":"54.8"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-classification-on-imdb-multi","task":"Graph Classification","dataset_variant":"IMDB-MULTI","rows":1,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"Local Topological Profile (LTP)","paper":"/paper/strengthening-structural-baselines-for-graph","metrics":{"Accuracy":"50.0 ± 4.6","Accuracy (10-fold)":"50.0 ± 4.6"},"code_links":[{"title":"j-adamczyk/ltp","url":"https://github.com/j-adamczyk/ltp"}]},"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":33,"of":33,"counts":{"papers_with_a_benchmark_row":33,"with_a_code_link":29,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":33,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":9,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":9,"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/fine-tuning-graph-neural-networks-by","slug":"fine-tuning-graph-neural-networks-by","title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","date":"2023-12-21","arxiv_id":"2312.13583","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":13,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":13,"official":{"repos":["zjunet/G-Tuning"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fine-tuning-graph-neural-networks-by#ran","syntology_url":"https://syntology.ai/paper/2312.13583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13583"}}}},{"paper":"/paper/graph-level-representation-learning-with","slug":"graph-level-representation-learning-with","title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","date":"2023-09-27","arxiv_id":"2309.16014","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":4,"official":{"repos":["geriskenderi/graph-jepa"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-level-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/2309.16014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16014"}}}},{"paper":"/paper/graph-isomorphism-unet","slug":"graph-isomorphism-unet","title":"Graph isomorphism UNet","date":"2023-08-23","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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":2,"code_links":1,"syntology":null},{"paper":"/paper/graph-trees-with-attention","slug":"graph-trees-with-attention","title":"TREE-G: Decision Trees Contesting Graph Neural Networks","date":"2022-07-06","arxiv_id":"2207.02760","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["mayabechlerspeicher/tree-g"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-trees-with-attention#ran","syntology_url":"https://syntology.ai/paper/2207.02760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02760"}}}},{"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/dropgnn-random-dropouts-increase-the","slug":"dropgnn-random-dropouts-increase-the","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","date":"2021-11-11","arxiv_id":"2111.06283","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["karolismart/dropgnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dropgnn-random-dropouts-increase-the#ran","syntology_url":"https://syntology.ai/paper/2111.06283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06283"}}}},{"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/improving-document-level-sentiment","slug":"improving-document-level-sentiment","title":"Improving Document-Level Sentiment Classification Using Importance of Sentences","date":"2021-03-09","arxiv_id":"2103.05167","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"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/online-graph-dictionary-learning","slug":"online-graph-dictionary-learning","title":"Online Graph Dictionary Learning","date":"2021-02-12","arxiv_id":"2102.06555","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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/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/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/infograph-unsupervised-and-semi-supervised","slug":"infograph-unsupervised-and-semi-supervised","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","date":"2019-07-31","arxiv_id":"1908.01000","rows_on_this_dataset":1,"code_links":5,"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/rethinking-complex-neural-network","slug":"rethinking-complex-neural-network","title":"Rethinking Complex Neural Network Architectures for Document Classification","date":"2019-06-01","arxiv_id":null,"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/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/spi-gcn-a-simple-permutation-invariant-graph","slug":"spi-gcn-a-simple-permutation-invariant-graph","title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","date":"2019-04-08","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/rep-the-set-neural-networks-for-learning-set","slug":"rep-the-set-neural-networks-for-learning-set","title":"Rep the Set: Neural Networks for Learning Set Representations","date":"2019-04-03","arxiv_id":"1904.01962","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-a-practical-k-dimensional-weisfeiler","slug":"towards-a-practical-k-dimensional-weisfeiler","title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","date":"2019-04-02","arxiv_id":"1904.01543","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["chrsmrrs/sparsewl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/towards-a-practical-k-dimensional-weisfeiler#ran","syntology_url":"https://syntology.ai/paper/1904.01543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01543"}}}},{"paper":"/paper/unsupervised-inductive-whole-graph-embedding","slug":"unsupervised-inductive-whole-graph-embedding","title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","date":"2019-04-01","arxiv_id":"1904.01098","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/weisfeiler-and-leman-go-neural-higher-order","slug":"weisfeiler-and-leman-go-neural-higher-order","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","date":"2018-10-04","arxiv_id":"1810.02244","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"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/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/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},{"paper":"/paper/learning-metrics-for-persistence-based-2","slug":"learning-metrics-for-persistence-based-2","title":"Learning metrics for persistence-based summaries and applications for graph classification","date":null,"arxiv_id":"1904.12189","rows_on_this_dataset":1,"code_links":1,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/fine-tuning-graph-neural-networks-by","slug":"fine-tuning-graph-neural-networks-by","title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","date":"2023-12-21","arxiv_id":"2312.13583","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":13,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":13,"official":{"repos":["zjunet/G-Tuning"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fine-tuning-graph-neural-networks-by#ran","syntology_url":"https://syntology.ai/paper/2312.13583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13583"}}}},{"paper":"/paper/graph-level-representation-learning-with","slug":"graph-level-representation-learning-with","title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","date":"2023-09-27","arxiv_id":"2309.16014","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":4,"official":{"repos":["geriskenderi/graph-jepa"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-level-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/2309.16014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16014"}}}},{"paper":"/paper/graph-isomorphism-unet","slug":"graph-isomorphism-unet","title":"Graph isomorphism UNet","date":"2023-08-23","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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":2,"code_links":1,"syntology":null},{"paper":"/paper/graph-trees-with-attention","slug":"graph-trees-with-attention","title":"TREE-G: Decision Trees Contesting Graph Neural Networks","date":"2022-07-06","arxiv_id":"2207.02760","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["mayabechlerspeicher/tree-g"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-trees-with-attention#ran","syntology_url":"https://syntology.ai/paper/2207.02760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02760"}}}},{"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/dropgnn-random-dropouts-increase-the","slug":"dropgnn-random-dropouts-increase-the","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","date":"2021-11-11","arxiv_id":"2111.06283","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["karolismart/dropgnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dropgnn-random-dropouts-increase-the#ran","syntology_url":"https://syntology.ai/paper/2111.06283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06283"}}}},{"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/improving-document-level-sentiment","slug":"improving-document-level-sentiment","title":"Improving Document-Level Sentiment Classification Using Importance of Sentences","date":"2021-03-09","arxiv_id":"2103.05167","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"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/online-graph-dictionary-learning","slug":"online-graph-dictionary-learning","title":"Online Graph Dictionary Learning","date":"2021-02-12","arxiv_id":"2102.06555","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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/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/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/infograph-unsupervised-and-semi-supervised","slug":"infograph-unsupervised-and-semi-supervised","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","date":"2019-07-31","arxiv_id":"1908.01000","rows_on_this_dataset":1,"code_links":5,"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/rethinking-complex-neural-network","slug":"rethinking-complex-neural-network","title":"Rethinking Complex Neural Network Architectures for Document Classification","date":"2019-06-01","arxiv_id":null,"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/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/spi-gcn-a-simple-permutation-invariant-graph","slug":"spi-gcn-a-simple-permutation-invariant-graph","title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","date":"2019-04-08","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/rep-the-set-neural-networks-for-learning-set","slug":"rep-the-set-neural-networks-for-learning-set","title":"Rep the Set: Neural Networks for Learning Set Representations","date":"2019-04-03","arxiv_id":"1904.01962","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-a-practical-k-dimensional-weisfeiler","slug":"towards-a-practical-k-dimensional-weisfeiler","title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","date":"2019-04-02","arxiv_id":"1904.01543","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["chrsmrrs/sparsewl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/towards-a-practical-k-dimensional-weisfeiler#ran","syntology_url":"https://syntology.ai/paper/1904.01543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01543"}}}},{"paper":"/paper/unsupervised-inductive-whole-graph-embedding","slug":"unsupervised-inductive-whole-graph-embedding","title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","date":"2019-04-01","arxiv_id":"1904.01098","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/weisfeiler-and-leman-go-neural-higher-order","slug":"weisfeiler-and-leman-go-neural-higher-order","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","date":"2018-10-04","arxiv_id":"1810.02244","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"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/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/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},{"paper":"/paper/learning-metrics-for-persistence-based-2","slug":"learning-metrics-for-persistence-based-2","title":"Learning metrics for persistence-based summaries and applications for graph classification","date":null,"arxiv_id":"1904.12189","rows_on_this_dataset":1,"code_links":1,"syntology":null}],"papers_where_code_ran":9,"papers_where_code_ran_first_page":"/dataset/imdb-multi/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/imdb-multi/papers/ran/1","json":"/dataset/imdb-multi/papers/ran/1.json","rows":9}],"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":10,"samples_harvested":67,"samples_ran":54,"samples_constructed":7,"samples_ran_checked":45,"samples_ran_instrument_failed":9,"samples_unverified":13,"pointer_only_for_licence":30,"papers_with_no_sample_that_ran":1,"papers_with_a_sample_that_ran":9,"papers_with_a_run_with_no_instrument_failure":9,"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":6,"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-imdb-m","since_archive":"/sota/graph-classification-on-imdb-m#since-judged","papers_judged":5,"placed":0},{"leaderboard":"/sota/graph-classification-on-imdb-multi","since_archive":"/sota/graph-classification-on-imdb-multi#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":"657f57cf59b6f952a9f0f22401828a6f5ae96616b3baaa74dcd73aba5e9245c1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}