{"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/mutag","name":"MUTAG","full_name":null,"description_markdown":"In particular, **MUTAG** is a collection of nitroaromatic compounds and the goal is to predict their mutagenicity on Salmonella typhimurium. Input graphs are used to represent chemical compounds, where vertices stand for atoms and are labeled by the atom type (represented by one-hot encoding), while edges between vertices represent bonds between the corresponding atoms. It includes 188 samples of chemical compounds with 7 discrete node labels.\r\n\r\nSource: [Fast and Deep Graph Neural Networks](https://arxiv.org/abs/1911.08941)","description_withheld":null,"homepage":"https://ls11-www.cs.tu-dortmund.de/staff/morris/graphkerneldatasets","introduced_date":null,"introduced_date_note":null,"introduced_by":{"paper":null,"title":"Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds","first_author":null,"url":"http://pubs.acs.org/doi/abs/10.1021/jm00106a046"},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Node Classification","url":"/task/node-classification","datasets_with_task":"/datasets/task/node-classification"},{"name":"Graph Classification","url":"/task/graph-classification","datasets_with_task":"/datasets/task/graph-classification"},{"name":"Explanation Fidelity Evaluation","url":"/task/explanation-fidelity-evaluation","datasets_with_task":"/datasets/task/explanation-fidelity-evaluation"}],"languages":[],"variants":["MUTAG"],"data_loaders":[{"repo":"https://github.com/dmlc/dgl","url":"https://docs.dgl.ai/api/python/dgl.data.html#dgl.data.MUTAGDataset","frameworks":["pytorch","tf","mxnet"]}],"num_papers_in_archive":274,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/graph-classification-on-mutag","task":"Graph Classification","dataset_variant":"MUTAG","rows":74,"metrics":["Accuracy","Accuracy (10-fold)","Mean Accuracy","Accuracy (10 fold)"],"first_row_in_archive_order":{"model":"Evolution of Graph Classifiers","paper":"/paper/evolution-of-graph-classifiers","metrics":{"Accuracy":"100.00%","Accuracy (10-fold)":"100"},"code_links":[{"title":"rohand24/GraphCNN_evolution","url":"https://github.com/rohand24/GraphCNN_evolution"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-mutag","task":"Node Classification","dataset_variant":"MUTAG","rows":6,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"BoP","paper":"/paper/from-primes-to-paths-enabling-fast-multi","metrics":{"Accuracy":"91.17"},"code_links":[{"title":"kbogas/PAM_BoP","url":"https://github.com/kbogas/PAM_BoP"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/explanation-fidelity-evaluation-on-mutag","task":"Explanation Fidelity Evaluation","dataset_variant":"MUTAG","rows":1,"metrics":["fidelity"],"first_row_in_archive_order":{"model":"GCN","paper":"/paper/same-uncovering-gnn-black-box-with-structure","metrics":{"fidelity":"0.702"},"code_links":[{"title":"same2023neurips/same","url":"https://github.com/same2023neurips/same"}]},"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":68,"of":68,"counts":{"papers_with_a_benchmark_row":68,"with_a_code_link":59,"where_syntology_ran_a_sample":20,"not_listed_spam_title":0,"listed":68,"listed_where_code_ran":20,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":19,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":19,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/from-primes-to-paths-enabling-fast-multi","slug":"from-primes-to-paths-enabling-fast-multi","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","date":"2024-11-17","arxiv_id":"2411.11149","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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/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/same-uncovering-gnn-black-box-with-structure","slug":"same-uncovering-gnn-black-box-with-structure","title":"SAME: Uncovering GNN Black Box with Structure-aware Shapley-based Multipiece Explanations","date":"2023-09-21","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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/cin-enhancing-topological-message-passing","slug":"cin-enhancing-topological-message-passing","title":"CIN++: Enhancing Topological Message Passing","date":"2023-06-06","arxiv_id":"2306.03561","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/scene-reasoning-about-traffic-scenes-using","slug":"scene-reasoning-about-traffic-scenes-using","title":"SCENE: Reasoning about Traffic Scenes using Heterogeneous Graph Neural Networks","date":"2023-01-09","arxiv_id":"2301.03512","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cell-attention-networks","slug":"cell-attention-networks","title":"Cell Attention Networks","date":"2022-09-16","arxiv_id":"2209.08179","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["lrnzgiusti/can"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cell-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2209.08179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08179"}}}},{"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/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":3,"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/r-gcn-the-r-could-stand-for-random","slug":"r-gcn-the-r-could-stand-for-random","title":"R-GCN: The R Could Stand for Random","date":"2022-03-04","arxiv_id":"2203.02424","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/relation-order-histograms-as-a-network","slug":"relation-order-histograms-as-a-network","title":"Relation order histograms as a network embedding tool","date":"2021-06-09","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"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":2,"code_links":1,"syntology":null},{"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/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/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/evolution-of-graph-classifiers","slug":"evolution-of-graph-classifiers","title":"Evolution of Graph Classifiers","date":"2019-10-04","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"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/inducing-a-decision-tree-with-discriminative","slug":"inducing-a-decision-tree-with-discriminative","title":"Inducing a Decision Tree with Discriminative Paths to Classify Entities in a Knowledge Graph","date":"2019-08-22","arxiv_id":null,"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/isonn-isomorphic-neural-network-for-graph","slug":"isonn-isomorphic-neural-network-for-graph","title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","date":"2019-07-22","arxiv_id":"1907.09495","rows_on_this_dataset":1,"code_links":2,"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/improving-attention-mechanism-in-graph-neural","slug":"improving-attention-mechanism-in-graph-neural","title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","date":"2019-07-04","arxiv_id":"1907.02204","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":0,"official":{"repos":["zetayue/CPA"],"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/improving-attention-mechanism-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1907.02204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02204"}}}},{"paper":"/paper/graph-star-net-for-generalized-multi-task-1","slug":"graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","arxiv_id":"1906.12330","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}}}},{"paper":"/paper/a-persistent-weisfeilerlehman-procedure-for","slug":"a-persistent-weisfeilerlehman-procedure-for","title":"A Persistent Weisfeiler–Lehman Procedure for Graph Classification","date":"2019-06-09","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/wasserstein-weisfeiler-lehman-graph-kernels","slug":"wasserstein-weisfeiler-lehman-graph-kernels","title":"Wasserstein Weisfeiler-Lehman Graph Kernels","date":"2019-06-04","arxiv_id":"1906.01277","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":0,"official":{"repos":["BorgwardtLab/WWL"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/wasserstein-weisfeiler-lehman-graph-kernels#ran","syntology_url":"https://syntology.ai/paper/1906.01277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01277"}}}},{"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/function-space-pooling-for-graph","slug":"function-space-pooling-for-graph","title":"Function Space Pooling For Graph Convolutional Networks","date":"2019-05-15","arxiv_id":"1905.06259","rows_on_this_dataset":1,"code_links":0,"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/graph-convolutional-networks-with","slug":"graph-convolutional-networks-with","title":"Graph Convolutional Networks with EigenPooling","date":"2019-04-30","arxiv_id":"1904.13107","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/ddgk-learning-graph-representations-for-deep","slug":"ddgk-learning-graph-representations-for-deep","title":"DDGK: Learning Graph Representations for Deep Divergence Graph Kernels","date":"2019-04-21","arxiv_id":"1904.09671","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/edgnn-a-simple-and-powerful-gnn-for-directed","slug":"edgnn-a-simple-and-powerful-gnn-for-directed","title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs","date":"2019-04-18","arxiv_id":"1904.08745","rows_on_this_dataset":2,"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/dagcn-dual-attention-graph-convolutional","slug":"dagcn-dual-attention-graph-convolutional","title":"DAGCN: Dual Attention Graph Convolutional Networks","date":"2019-04-04","arxiv_id":"1904.02278","rows_on_this_dataset":1,"code_links":1,"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/quantum-based-subgraph-convolutional-neural","slug":"quantum-based-subgraph-convolutional-neural","title":"Quantum-based subgraph convolutional neural networks","date":"2019-04-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/subgraph-networks-with-application-to","slug":"subgraph-networks-with-application-to","title":"Subgraph Networks with Application to Structural Feature Space Expansion","date":"2019-03-21","arxiv_id":"1903.09022","rows_on_this_dataset":1,"code_links":0,"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/graph-kernels-based-on-linear-patterns","slug":"graph-kernels-based-on-linear-patterns","title":"Graph Kernels Based on Linear Patterns: Theoretical and Experimental Comparisons","date":"2019-03-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/capsule-neural-networks-for-graph","slug":"capsule-neural-networks-for-graph","title":"Capsule Neural Networks for Graph Classification using Explicit Tensorial Graph Representations","date":"2019-02-22","arxiv_id":"1902.08399","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-classification-with-recurrent","slug":"graph-classification-with-recurrent","title":"Variational Recurrent Neural Networks for Graph Classification","date":"2019-02-07","arxiv_id":"1902.02721","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/propagation-kernels-efficient-graph-kernels","slug":"propagation-kernels-efficient-graph-kernels","title":"Propagation kernels: efficient graph kernels from propagated information","date":"2019-02-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/spectral-multigraph-networks-for-discovering","slug":"spectral-multigraph-networks-for-discovering","title":"Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules","date":"2018-11-23","arxiv_id":"1811.09595","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gaussian-induced-convolution-for-graphs","slug":"gaussian-induced-convolution-for-graphs","title":"Gaussian-Induced Convolution for Graphs","date":"2018-11-11","arxiv_id":"1811.04393","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-simple-yet-effective-baseline-for-non","slug":"a-simple-yet-effective-baseline-for-non","title":"A simple yet effective baseline for non-attributed graph classification","date":"2018-11-08","arxiv_id":"1811.03508","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/a-simple-baseline-algorithm-for-graph","slug":"a-simple-baseline-algorithm-for-graph","title":"A Simple Baseline Algorithm for Graph Classification","date":"2018-10-22","arxiv_id":"1810.09155","rows_on_this_dataset":1,"code_links":3,"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/anonymous-walk-embeddings","slug":"anonymous-walk-embeddings","title":"Anonymous Walk Embeddings","date":"2018-05-30","arxiv_id":"1805.11921","rows_on_this_dataset":1,"code_links":2,"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":0,"official":{"repos":["nd7141/AWE"],"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/anonymous-walk-embeddings#ran","syntology_url":"https://syntology.ai/paper/1805.11921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11921"}}}},{"paper":"/paper/optimal-transport-for-structured-data-with","slug":"optimal-transport-for-structured-data-with","title":"Optimal Transport for structured data with application on graphs","date":"2018-05-23","arxiv_id":"1805.09114","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/optimal-transport-for-structured-data-with#ran","syntology_url":"https://syntology.ai/paper/1805.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09114"}}}},{"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":1,"code_links":2,"syntology":null},{"paper":"/paper/rdf2vec-rdf-graph-embeddings-and-their","slug":"rdf2vec-rdf-graph-embeddings-and-their","title":"RDF2Vec: RDF Graph Embeddings and Their Applications","date":"2017-11-10","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph2vec-learning-distributed","slug":"graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph2vec-learning-distributed#ran","syntology_url":"https://syntology.ai/paper/1707.05005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.05005"}}}},{"paper":"/paper/dynamic-edge-conditioned-filters-in","slug":"dynamic-edge-conditioned-filters-in","title":"Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs","date":"2017-04-10","arxiv_id":"1704.02901","rows_on_this_dataset":1,"code_links":2,"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":["mys007/ecc"],"state":"official: not harvested","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/dynamic-edge-conditioned-filters-in#ran","syntology_url":"https://syntology.ai/paper/1704.02901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.02901"}}}},{"paper":"/paper/modeling-relational-data-with-graph","slug":"modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","rows_on_this_dataset":1,"code_links":27,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":32,"samples_ran":18,"samples_constructed":3,"samples_ran_checked":13,"samples_ran_instrument_failed":5,"samples_unverified":14,"pointer_only_for_licence":15,"official":{"repos":["tkipf/relational-gcn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/modeling-relational-data-with-graph#ran","syntology_url":"https://syntology.ai/paper/1703.06103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06103"}}}},{"paper":"/paper/on-valid-optimal-assignment-kernels-and","slug":"on-valid-optimal-assignment-kernels-and","title":"On Valid Optimal Assignment Kernels and Applications to Graph Classification","date":"2016-06-03","arxiv_id":"1606.01141","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/learning-convolutional-neural-networks-for","slug":"learning-convolutional-neural-networks-for","title":"Learning Convolutional Neural Networks for Graphs","date":"2016-05-17","arxiv_id":"1605.05273","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/from-primes-to-paths-enabling-fast-multi","slug":"from-primes-to-paths-enabling-fast-multi","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","date":"2024-11-17","arxiv_id":"2411.11149","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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/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/same-uncovering-gnn-black-box-with-structure","slug":"same-uncovering-gnn-black-box-with-structure","title":"SAME: Uncovering GNN Black Box with Structure-aware Shapley-based Multipiece Explanations","date":"2023-09-21","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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/cin-enhancing-topological-message-passing","slug":"cin-enhancing-topological-message-passing","title":"CIN++: Enhancing Topological Message Passing","date":"2023-06-06","arxiv_id":"2306.03561","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/scene-reasoning-about-traffic-scenes-using","slug":"scene-reasoning-about-traffic-scenes-using","title":"SCENE: Reasoning about Traffic Scenes using Heterogeneous Graph Neural Networks","date":"2023-01-09","arxiv_id":"2301.03512","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cell-attention-networks","slug":"cell-attention-networks","title":"Cell Attention Networks","date":"2022-09-16","arxiv_id":"2209.08179","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["lrnzgiusti/can"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cell-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2209.08179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08179"}}}},{"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/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":3,"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/r-gcn-the-r-could-stand-for-random","slug":"r-gcn-the-r-could-stand-for-random","title":"R-GCN: The R Could Stand for Random","date":"2022-03-04","arxiv_id":"2203.02424","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/relation-order-histograms-as-a-network","slug":"relation-order-histograms-as-a-network","title":"Relation order histograms as a network embedding tool","date":"2021-06-09","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"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":2,"code_links":1,"syntology":null},{"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/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/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/evolution-of-graph-classifiers","slug":"evolution-of-graph-classifiers","title":"Evolution of Graph Classifiers","date":"2019-10-04","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"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/inducing-a-decision-tree-with-discriminative","slug":"inducing-a-decision-tree-with-discriminative","title":"Inducing a Decision Tree with Discriminative Paths to Classify Entities in a Knowledge Graph","date":"2019-08-22","arxiv_id":null,"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/isonn-isomorphic-neural-network-for-graph","slug":"isonn-isomorphic-neural-network-for-graph","title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","date":"2019-07-22","arxiv_id":"1907.09495","rows_on_this_dataset":1,"code_links":2,"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/improving-attention-mechanism-in-graph-neural","slug":"improving-attention-mechanism-in-graph-neural","title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","date":"2019-07-04","arxiv_id":"1907.02204","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":0,"official":{"repos":["zetayue/CPA"],"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/improving-attention-mechanism-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1907.02204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02204"}}}},{"paper":"/paper/graph-star-net-for-generalized-multi-task-1","slug":"graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","arxiv_id":"1906.12330","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}}}},{"paper":"/paper/a-persistent-weisfeilerlehman-procedure-for","slug":"a-persistent-weisfeilerlehman-procedure-for","title":"A Persistent Weisfeiler–Lehman Procedure for Graph Classification","date":"2019-06-09","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/wasserstein-weisfeiler-lehman-graph-kernels","slug":"wasserstein-weisfeiler-lehman-graph-kernels","title":"Wasserstein Weisfeiler-Lehman Graph Kernels","date":"2019-06-04","arxiv_id":"1906.01277","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":0,"official":{"repos":["BorgwardtLab/WWL"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/wasserstein-weisfeiler-lehman-graph-kernels#ran","syntology_url":"https://syntology.ai/paper/1906.01277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01277"}}}},{"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/function-space-pooling-for-graph","slug":"function-space-pooling-for-graph","title":"Function Space Pooling For Graph Convolutional Networks","date":"2019-05-15","arxiv_id":"1905.06259","rows_on_this_dataset":1,"code_links":0,"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/graph-convolutional-networks-with","slug":"graph-convolutional-networks-with","title":"Graph Convolutional Networks with EigenPooling","date":"2019-04-30","arxiv_id":"1904.13107","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/ddgk-learning-graph-representations-for-deep","slug":"ddgk-learning-graph-representations-for-deep","title":"DDGK: Learning Graph Representations for Deep Divergence Graph Kernels","date":"2019-04-21","arxiv_id":"1904.09671","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/edgnn-a-simple-and-powerful-gnn-for-directed","slug":"edgnn-a-simple-and-powerful-gnn-for-directed","title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs","date":"2019-04-18","arxiv_id":"1904.08745","rows_on_this_dataset":2,"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/dagcn-dual-attention-graph-convolutional","slug":"dagcn-dual-attention-graph-convolutional","title":"DAGCN: Dual Attention Graph Convolutional Networks","date":"2019-04-04","arxiv_id":"1904.02278","rows_on_this_dataset":1,"code_links":1,"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/quantum-based-subgraph-convolutional-neural","slug":"quantum-based-subgraph-convolutional-neural","title":"Quantum-based subgraph convolutional neural networks","date":"2019-04-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/subgraph-networks-with-application-to","slug":"subgraph-networks-with-application-to","title":"Subgraph Networks with Application to Structural Feature Space Expansion","date":"2019-03-21","arxiv_id":"1903.09022","rows_on_this_dataset":1,"code_links":0,"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/graph-kernels-based-on-linear-patterns","slug":"graph-kernels-based-on-linear-patterns","title":"Graph Kernels Based on Linear Patterns: Theoretical and Experimental Comparisons","date":"2019-03-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/capsule-neural-networks-for-graph","slug":"capsule-neural-networks-for-graph","title":"Capsule Neural Networks for Graph Classification using Explicit Tensorial Graph Representations","date":"2019-02-22","arxiv_id":"1902.08399","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-classification-with-recurrent","slug":"graph-classification-with-recurrent","title":"Variational Recurrent Neural Networks for Graph Classification","date":"2019-02-07","arxiv_id":"1902.02721","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/propagation-kernels-efficient-graph-kernels","slug":"propagation-kernels-efficient-graph-kernels","title":"Propagation kernels: efficient graph kernels from propagated information","date":"2019-02-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/spectral-multigraph-networks-for-discovering","slug":"spectral-multigraph-networks-for-discovering","title":"Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules","date":"2018-11-23","arxiv_id":"1811.09595","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gaussian-induced-convolution-for-graphs","slug":"gaussian-induced-convolution-for-graphs","title":"Gaussian-Induced Convolution for Graphs","date":"2018-11-11","arxiv_id":"1811.04393","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-simple-yet-effective-baseline-for-non","slug":"a-simple-yet-effective-baseline-for-non","title":"A simple yet effective baseline for non-attributed graph classification","date":"2018-11-08","arxiv_id":"1811.03508","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/a-simple-baseline-algorithm-for-graph","slug":"a-simple-baseline-algorithm-for-graph","title":"A Simple Baseline Algorithm for Graph Classification","date":"2018-10-22","arxiv_id":"1810.09155","rows_on_this_dataset":1,"code_links":3,"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/anonymous-walk-embeddings","slug":"anonymous-walk-embeddings","title":"Anonymous Walk Embeddings","date":"2018-05-30","arxiv_id":"1805.11921","rows_on_this_dataset":1,"code_links":2,"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":0,"official":{"repos":["nd7141/AWE"],"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/anonymous-walk-embeddings#ran","syntology_url":"https://syntology.ai/paper/1805.11921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11921"}}}},{"paper":"/paper/optimal-transport-for-structured-data-with","slug":"optimal-transport-for-structured-data-with","title":"Optimal Transport for structured data with application on graphs","date":"2018-05-23","arxiv_id":"1805.09114","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/optimal-transport-for-structured-data-with#ran","syntology_url":"https://syntology.ai/paper/1805.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09114"}}}},{"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":1,"code_links":2,"syntology":null},{"paper":"/paper/rdf2vec-rdf-graph-embeddings-and-their","slug":"rdf2vec-rdf-graph-embeddings-and-their","title":"RDF2Vec: RDF Graph Embeddings and Their Applications","date":"2017-11-10","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph2vec-learning-distributed","slug":"graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph2vec-learning-distributed#ran","syntology_url":"https://syntology.ai/paper/1707.05005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.05005"}}}},{"paper":"/paper/dynamic-edge-conditioned-filters-in","slug":"dynamic-edge-conditioned-filters-in","title":"Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs","date":"2017-04-10","arxiv_id":"1704.02901","rows_on_this_dataset":1,"code_links":2,"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":["mys007/ecc"],"state":"official: not harvested","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/dynamic-edge-conditioned-filters-in#ran","syntology_url":"https://syntology.ai/paper/1704.02901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.02901"}}}},{"paper":"/paper/modeling-relational-data-with-graph","slug":"modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","rows_on_this_dataset":1,"code_links":27,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":32,"samples_ran":18,"samples_constructed":3,"samples_ran_checked":13,"samples_ran_instrument_failed":5,"samples_unverified":14,"pointer_only_for_licence":15,"official":{"repos":["tkipf/relational-gcn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/modeling-relational-data-with-graph#ran","syntology_url":"https://syntology.ai/paper/1703.06103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06103"}}}},{"paper":"/paper/on-valid-optimal-assignment-kernels-and","slug":"on-valid-optimal-assignment-kernels-and","title":"On Valid Optimal Assignment Kernels and Applications to Graph Classification","date":"2016-06-03","arxiv_id":"1606.01141","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/learning-convolutional-neural-networks-for","slug":"learning-convolutional-neural-networks-for","title":"Learning Convolutional Neural Networks for Graphs","date":"2016-05-17","arxiv_id":"1605.05273","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":20,"papers_where_code_ran_first_page":"/dataset/mutag/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/mutag/papers/ran/1","json":"/dataset/mutag/papers/ran/1.json","rows":20}],"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":22,"samples_harvested":145,"samples_ran":99,"samples_constructed":10,"samples_ran_checked":75,"samples_ran_instrument_failed":24,"samples_unverified":46,"pointer_only_for_licence":54,"papers_with_no_sample_that_ran":2,"papers_with_a_sample_that_ran":20,"papers_with_a_run_with_no_instrument_failure":19,"papers_where_every_run_was_an_instrument_failure":1,"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":10,"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-mutag","since_archive":"/sota/graph-classification-on-mutag#since-judged","papers_judged":10,"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":"04999008f0031e675a28a90cc8dafaec0b55731b0d05461b5f91a8aaf3461b73","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}