{"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":"/task/graph-classification","name":"Graph Classification","slug":"graph-classification","description_markdown":"**Graph Classification** is a task that involves classifying a graph-structured data into different classes or categories. Graphs are a powerful way to represent relationships and interactions between different entities, and graph classification can be applied to a wide range of applications, such as social network analysis, bioinformatics, and recommendation systems. In graph classification, the input is a graph, and the goal is to learn a classifier that can accurately predict the class of the graph.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Hierarchical Graph Pooling with Structure Learning](https://github.com/cszhangzhen/HGP-SL) )</span>","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":927,"papers_with_code":483,"benchmarks":73,"benchmark_tables_in_archive":73,"benchmark_tables_shown":73,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":54,"subtasks":3,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/graph-classification-on-proteins","slug":"graph-classification-on-proteins","dataset":"PROTEINS","dataset_url":"/dataset/proteins","rows_in_archive":103,"metrics":["Accuracy","Accuracy (10 fold)","Inference Time (ms)"],"first_row_in_archive_order":{"model":"HGP-SL","paper_title":"Hierarchical Graph Pooling with Structure Learning","paper_url":"/paper/hierarchical-graph-pooling-with-structure","paper_date":"2019-11-14","arxiv_id":"1911.05954","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hgp_sl"},{"title":"cszhangzhen/HGP-SL","url":"https://github.com/cszhangzhen/HGP-SL"},{"title":"gsl-benchmark/gslb","url":"https://github.com/gsl-benchmark/gslb"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-mutag","slug":"graph-classification-on-mutag","dataset":"MUTAG","dataset_url":"/dataset/mutag","rows_in_archive":74,"metrics":["Accuracy","Accuracy (10-fold)","Mean Accuracy","Accuracy (10 fold)"],"first_row_in_archive_order":{"model":"Evolution of Graph Classifiers","paper_title":"Evolution of Graph Classifiers","paper_url":"/paper/evolution-of-graph-classifiers","paper_date":"2019-10-04","arxiv_id":null,"code_links":[{"title":"rohand24/GraphCNN_evolution","url":"https://github.com/rohand24/GraphCNN_evolution"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-nci1","slug":"graph-classification-on-nci1","dataset":"NCI1","dataset_url":"/dataset/nci1","rows_in_archive":69,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"TFGW ADJ (L=2)","paper_title":"Template based Graph Neural Network with Optimal Transport Distances","paper_url":"/paper/template-based-graph-neural-network-with","paper_date":"2022-05-31","arxiv_id":"2205.15733","code_links":[{"title":"cedricvincentcuaz/TFGW","url":"https://github.com/cedricvincentcuaz/TFGW"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-enzymes","slug":"graph-classification-on-enzymes","dataset":"ENZYMES","dataset_url":"/dataset/enzymes","rows_in_archive":54,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"ESA (Edge set attention, no positional encodings)","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_url":"/paper/masked-attention-is-all-you-need-for-graphs","paper_date":"2024-02-16","arxiv_id":"2402.10793","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-dd","slug":"graph-classification-on-dd","dataset":"D&D","dataset_url":null,"rows_in_archive":53,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_url":"/paper/unsupervised-universal-self-attention-network","paper_date":"2019-09-26","arxiv_id":"1909.11855","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-imdb-b","slug":"graph-classification-on-imdb-b","dataset":"IMDb-B","dataset_url":"/dataset/imdb-binary","rows_in_archive":51,"metrics":["Accuracy","Accuracy (10-fold)","Rand index"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_url":"/paper/unsupervised-universal-self-attention-network","paper_date":"2019-09-26","arxiv_id":"1909.11855","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-peptides-func","slug":"graph-classification-on-peptides-func","dataset":"Peptides-func","dataset_url":"/dataset/pascalvoc-sp","rows_in_archive":44,"metrics":["AP"],"first_row_in_archive_order":{"model":"ESA + RWSE (Edge set attention, Random Walk Structural Encoding, + validation set)","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_url":"/paper/masked-attention-is-all-you-need-for-graphs","paper_date":"2024-02-16","arxiv_id":"2402.10793","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-collab","slug":"graph-classification-on-collab","dataset":"COLLAB","dataset_url":"/dataset/collab","rows_in_archive":39,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_url":"/paper/unsupervised-universal-self-attention-network","paper_date":"2019-09-26","arxiv_id":"1909.11855","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-nci109","slug":"graph-classification-on-nci109","dataset":"NCI109","dataset_url":"/dataset/nci109","rows_in_archive":38,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"WKPI-kcenters","paper_title":"Learning metrics for persistence-based summaries and applications for graph classification","paper_url":"/paper/learning-metrics-for-persistence-based-2","paper_date":"2019-04-27","arxiv_id":"1904.12189","code_links":[{"title":"topology474/WKPI","url":"https://github.com/topology474/WKPI"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-ptc","slug":"graph-classification-on-ptc","dataset":"PTC","dataset_url":"/dataset/ptc","rows_in_archive":37,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_url":"/paper/unsupervised-universal-self-attention-network","paper_date":"2019-09-26","arxiv_id":"1909.11855","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-imdb-m","slug":"graph-classification-on-imdb-m","dataset":"IMDb-M","dataset_url":"/dataset/imdb-multi","rows_in_archive":36,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_url":"/paper/unsupervised-universal-self-attention-network","paper_date":"2019-09-26","arxiv_id":"1909.11855","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-cifar10-100k","slug":"graph-classification-on-cifar10-100k","dataset":"CIFAR10 100k","dataset_url":"/dataset/cifar-10","rows_in_archive":20,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"NeuralWalker","paper_title":"Learning Long Range Dependencies on Graphs via Random Walks","paper_url":"/paper/learning-long-range-dependencies-on-graphs","paper_date":"2024-06-05","arxiv_id":"2406.03386","code_links":[{"title":"borgwardtlab/neuralwalker","url":"https://github.com/borgwardtlab/neuralwalker"}],"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":8,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-long-range-dependencies-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2406.03386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03386"}},"official":{"repos":["borgwardtlab/neuralwalker"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/graph-classification-on-mnist","slug":"graph-classification-on-mnist","dataset":"MNIST","dataset_url":"/dataset/mnist","rows_in_archive":13,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"ESA (Edge set attention, no positional encodings, tuned)","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_url":"/paper/masked-attention-is-all-you-need-for-graphs","paper_date":"2024-02-16","arxiv_id":"2402.10793","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-reddit-b","slug":"graph-classification-on-reddit-b","dataset":"REDDIT-B","dataset_url":"/dataset/reddit","rows_in_archive":12,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"CRaWl","paper_title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","paper_url":"/paper/graph-learning-with-1d-convolutions-on-random","paper_date":"2021-02-17","arxiv_id":"2102.08786","code_links":[{"title":"toenshoff/CRaWl","url":"https://github.com/toenshoff/CRaWl"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-reddit-binary","slug":"graph-classification-on-reddit-binary","dataset":"REDDIT-BINARY","dataset_url":"/dataset/reddit-binary","rows_in_archive":9,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"R-GIN + PANDA","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","paper_url":"/paper/panda-expanded-width-aware-message-passing","paper_date":"2024-06-06","arxiv_id":"2406.03671","code_links":[{"title":"jeongwhanchoi/panda","url":"https://github.com/jeongwhanchoi/panda"}],"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-imdb-binary","slug":"graph-classification-on-imdb-binary","dataset":"IMDB-BINARY","dataset_url":"/dataset/imdb-binary","rows_in_archive":8,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"Local Topological Profile (LTP)","paper_title":"Strengthening structural baselines for graph classification using Local Topological Profile","paper_url":"/paper/strengthening-structural-baselines-for-graph","paper_date":"2023-05-01","arxiv_id":"2305.00724","code_links":[{"title":"j-adamczyk/ltp","url":"https://github.com/j-adamczyk/ltp"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-re-m5k","slug":"graph-classification-on-re-m5k","dataset":"RE-M5K","dataset_url":null,"rows_in_archive":8,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GIN-0","paper_title":"How Powerful are Graph Neural Networks?","paper_url":"/paper/how-powerful-are-graph-neural-networks","paper_date":"2018-10-01","arxiv_id":"1810.00826","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gin"},{"title":"weihua916/powerful-gnns","url":"https://github.com/weihua916/powerful-gnns"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"calciver/Graph-Isomorphism-Networks","url":"https://github.com/calciver/Graph-Isomorphism-Networks"},{"title":"yuwvandy/g2gnn","url":"https://github.com/yuwvandy/g2gnn"},{"title":"PurdueMINDS/RelationalPooling","url":"https://github.com/PurdueMINDS/RelationalPooling"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/gin_conv.py"},{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"},{"title":"egyptdj/graph-neural-mapping","url":"https://github.com/egyptdj/graph-neural-mapping"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"pfnet-research/treewidth-prediction","url":"https://github.com/pfnet-research/treewidth-prediction"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"zhliping/Deep-Learning","url":"https://github.com/zhliping/Deep-Learning"},{"title":"k4my4r/ECG-Classification","url":"https://github.com/k4my4r/ECG-Classification"},{"title":"igorsterner/commute-opt-gnn","url":"https://github.com/igorsterner/commute-opt-gnn"},{"title":"mfmceneaney/Lambda-GNNs","url":"https://github.com/mfmceneaney/Lambda-GNNs"},{"title":"willy-b/tiny-GIN-for-ogbg-molhiv","url":"https://github.com/willy-b/tiny-GIN-for-ogbg-molhiv"}],"syntology":{"n":10,"n_ran":6,"n_constructed":2,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-upfd-gos","slug":"graph-classification-on-upfd-gos","dataset":"UPFD-GOS","dataset_url":"/dataset/upfd-gos","rows_in_archive":8,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"UPFD-SAGE","paper_title":"User Preference-aware Fake News Detection","paper_url":"/paper/user-preference-aware-fake-news-detection","paper_date":"2021-04-25","arxiv_id":"2104.12259","code_links":[{"title":"safe-graph/GNN-FakeNews","url":"https://github.com/safe-graph/GNN-FakeNews"},{"title":"code-implementation1/Code9","url":"https://github.com/code-implementation1/Code9/tree/main/gat"}],"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/user-preference-aware-fake-news-detection#ran","syntology_url":"https://syntology.ai/paper/2104.12259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12259"}},"official":{"repos":["safe-graph/GNN-FakeNews"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/graph-classification-on-upfd-pol","slug":"graph-classification-on-upfd-pol","dataset":"UPFD-POL","dataset_url":"/dataset/upfd-pol","rows_in_archive":8,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"HGFND","paper_title":"Nothing Stands Alone: Relational Fake News Detection with Hypergraph Neural Networks","paper_url":"/paper/nothing-stands-alone-relational-fake-news-2","paper_date":"2022-12-24","arxiv_id":"2212.12621","code_links":[{"title":"ujeong1/IEEEBigdata22_HGFND","url":"https://github.com/ujeong1/IEEEBigdata22_HGFND"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-bp-fmri-97","slug":"graph-classification-on-bp-fmri-97","dataset":"BP-fMRI-97","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy","F1"],"first_row_in_archive_order":{"model":"IsoNN","paper_title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","paper_url":"/paper/isonn-isomorphic-neural-network-for-graph","paper_date":"2019-07-22","arxiv_id":"1907.09495","code_links":[{"title":"linmengsysu/IsoNN","url":"https://github.com/linmengsysu/IsoNN"},{"title":"jwzhanggy/isocapsnet","url":"https://github.com/jwzhanggy/isocapsnet"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-hiv-fmri-77","slug":"graph-classification-on-hiv-fmri-77","dataset":"HIV-fMRI-77","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy","F1"],"first_row_in_archive_order":{"model":"IsoNN","paper_title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","paper_url":"/paper/isonn-isomorphic-neural-network-for-graph","paper_date":"2019-07-22","arxiv_id":"1907.09495","code_links":[{"title":"linmengsysu/IsoNN","url":"https://github.com/linmengsysu/IsoNN"},{"title":"jwzhanggy/isocapsnet","url":"https://github.com/jwzhanggy/isocapsnet"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-frankenstein","slug":"graph-classification-on-frankenstein","dataset":"FRANKENSTEIN","dataset_url":null,"rows_in_archive":6,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GWL_WL","paper_title":"Graph Invariant Kernels","paper_url":"/paper/graph-invariant-kernels","paper_date":"2015-07-25","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-hiv-dti-77","slug":"graph-classification-on-hiv-dti-77","dataset":"HIV-DTI-77","dataset_url":null,"rows_in_archive":6,"metrics":["Accuracy","F1"],"first_row_in_archive_order":{"model":"IsoNN","paper_title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","paper_url":"/paper/isonn-isomorphic-neural-network-for-graph","paper_date":"2019-07-22","arxiv_id":"1907.09495","code_links":[{"title":"linmengsysu/IsoNN","url":"https://github.com/linmengsysu/IsoNN"},{"title":"jwzhanggy/isocapsnet","url":"https://github.com/jwzhanggy/isocapsnet"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-re-m12k","slug":"graph-classification-on-re-m12k","dataset":"RE-M12K","dataset_url":null,"rows_in_archive":6,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GFN-light","paper_title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","paper_url":"/paper/dissecting-graph-neural-networks-on-graph","paper_date":"2019-05-11","arxiv_id":"1905.04579","code_links":[{"title":"chentingpc/gfn","url":"https://github.com/chentingpc/gfn"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-hiv-dataset","slug":"graph-classification-on-hiv-dataset","dataset":"HIV dataset","dataset_url":"/dataset/qm9-charge-densities-and-energies-calculated","rows_in_archive":5,"metrics":["ROC-AUC","Accuracy"],"first_row_in_archive_order":{"model":"CIN++","paper_title":"CIN++: Enhancing Topological Message Passing","paper_url":"/paper/cin-enhancing-topological-message-passing","paper_date":"2023-06-06","arxiv_id":"2306.03561","code_links":[{"title":"twitter-research/cwn","url":"https://github.com/twitter-research/cwn"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-mutagenicity","slug":"graph-classification-on-mutagenicity","dataset":"Mutagenicity","dataset_url":"/dataset/mutagenicity","rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"TREE-G","paper_title":"TREE-G: Decision Trees Contesting Graph Neural Networks","paper_url":"/paper/graph-trees-with-attention","paper_date":"2022-07-06","arxiv_id":"2207.02760","code_links":[{"title":"mayabechlerspeicher/tree-g","url":"https://github.com/mayabechlerspeicher/tree-g"}],"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-neuron-average","slug":"graph-classification-on-neuron-average","dataset":"NEURON-Average","dataset_url":null,"rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"WKPI-kcenters","paper_title":"Learning metrics for persistence-based summaries and applications for graph classification","paper_url":"/paper/learning-metrics-for-persistence-based-2","paper_date":"2019-04-27","arxiv_id":"1904.12189","code_links":[{"title":"topology474/WKPI","url":"https://github.com/topology474/WKPI"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-neuron-binary","slug":"graph-classification-on-neuron-binary","dataset":"NEURON-BINARY","dataset_url":null,"rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"WKPI-kmeans","paper_title":"Learning metrics for persistence-based summaries and applications for graph classification","paper_url":"/paper/learning-metrics-for-persistence-based-2","paper_date":"2019-04-27","arxiv_id":"1904.12189","code_links":[{"title":"topology474/WKPI","url":"https://github.com/topology474/WKPI"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-neuron-multi","slug":"graph-classification-on-neuron-multi","dataset":"NEURON-MULTI","dataset_url":null,"rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"WKPI-kcenters","paper_title":"Learning metrics for persistence-based summaries and applications for graph classification","paper_url":"/paper/learning-metrics-for-persistence-based-2","paper_date":"2019-04-27","arxiv_id":"1904.12189","code_links":[{"title":"topology474/WKPI","url":"https://github.com/topology474/WKPI"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-malnet-tiny","slug":"graph-classification-on-malnet-tiny","dataset":"MalNet-Tiny","dataset_url":"/dataset/malnet","rows_in_archive":4,"metrics":["Accuracy","MCC"],"first_row_in_archive_order":{"model":"ESA (Edge set attention, no positional encodings)","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_url":"/paper/masked-attention-is-all-you-need-for-graphs","paper_date":"2024-02-16","arxiv_id":"2402.10793","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-bbbp","slug":"graph-classification-on-bbbp","dataset":"BBBP","dataset_url":"/dataset/bbbp-scaffold","rows_in_archive":3,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"G-Tuning","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","paper_url":"/paper/fine-tuning-graph-neural-networks-by","paper_date":"2023-12-21","arxiv_id":"2312.13583","code_links":[{"title":"zjunet/G-Tuning","url":"https://github.com/zjunet/G-Tuning"}],"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":2,"n_no_contract":5,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-cox2","slug":"graph-classification-on-cox2","dataset":"COX2","dataset_url":null,"rows_in_archive":3,"metrics":["Accuracy(10-fold)"],"first_row_in_archive_order":{"model":"GIN-0","paper_title":"How Powerful are Graph Neural Networks?","paper_url":"/paper/how-powerful-are-graph-neural-networks","paper_date":"2018-10-01","arxiv_id":"1810.00826","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gin"},{"title":"weihua916/powerful-gnns","url":"https://github.com/weihua916/powerful-gnns"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"calciver/Graph-Isomorphism-Networks","url":"https://github.com/calciver/Graph-Isomorphism-Networks"},{"title":"yuwvandy/g2gnn","url":"https://github.com/yuwvandy/g2gnn"},{"title":"PurdueMINDS/RelationalPooling","url":"https://github.com/PurdueMINDS/RelationalPooling"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/gin_conv.py"},{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"},{"title":"egyptdj/graph-neural-mapping","url":"https://github.com/egyptdj/graph-neural-mapping"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"pfnet-research/treewidth-prediction","url":"https://github.com/pfnet-research/treewidth-prediction"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"zhliping/Deep-Learning","url":"https://github.com/zhliping/Deep-Learning"},{"title":"k4my4r/ECG-Classification","url":"https://github.com/k4my4r/ECG-Classification"},{"title":"igorsterner/commute-opt-gnn","url":"https://github.com/igorsterner/commute-opt-gnn"},{"title":"mfmceneaney/Lambda-GNNs","url":"https://github.com/mfmceneaney/Lambda-GNNs"},{"title":"willy-b/tiny-GIN-for-ogbg-molhiv","url":"https://github.com/willy-b/tiny-GIN-for-ogbg-molhiv"}],"syntology":{"n":10,"n_ran":6,"n_constructed":2,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-hiv","slug":"graph-classification-on-hiv","dataset":"HIV","dataset_url":"/dataset/qm9-charge-densities-and-energies-calculated","rows_in_archive":3,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"GTOT-Tuning","paper_title":"Fine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transport","paper_url":"/paper/fine-tuning-graph-neural-networks-via-graph","paper_date":"2022-03-20","arxiv_id":"2203.10453","code_links":[{"title":"youjibiying/gtot-tuning","url":"https://github.com/youjibiying/gtot-tuning"}],"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/fine-tuning-graph-neural-networks-via-graph#ran","syntology_url":"https://syntology.ai/paper/2203.10453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10453"}},"official":{"repos":["youjibiying/gtot-tuning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}}},{"leaderboard":"/sota/graph-classification-on-reddit-multi-12k","slug":"graph-classification-on-reddit-multi-12k","dataset":"REDDIT-MULTI-12K","dataset_url":"/dataset/reddit","rows_in_archive":3,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GNN (DiffPool)","paper_title":"Hierarchical Graph Representation Learning with Differentiable Pooling","paper_url":"/paper/hierarchical-graph-representation-learning","paper_date":"2018-06-22","arxiv_id":"1806.08804","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/diffpool"},{"title":"RexYing/diffpool","url":"https://github.com/RexYing/diffpool"},{"title":"RexYing/graph-pooling","url":"https://github.com/RexYing/graph-pooling"},{"title":"AaltoPML/Rethinking-pooling-in-GNNs","url":"https://github.com/AaltoPML/Rethinking-pooling-in-GNNs"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"VoVAllen/diffpool","url":"https://github.com/VoVAllen/diffpool"},{"title":"Tioz90/GCN","url":"https://github.com/Tioz90/GCN"},{"title":"Tioz90/DiffPool","url":"https://github.com/Tioz90/DiffPool"},{"title":"basiralab/reproduciblefedgnn","url":"https://github.com/basiralab/reproduciblefedgnn"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"chappers/graph-differential-pooling","url":"https://github.com/chappers/graph-differential-pooling"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"PasqualeAuriemma/GCN-DIFFPOOL","url":"https://github.com/PasqualeAuriemma/GCN-DIFFPOOL"},{"title":"cedric_sanders/masterarbeit","url":"https://gitlab.com/cedric_sanders/masterarbeit"}],"syntology":{"n":20,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/hierarchical-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/1806.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08804"}},"official":null}}},{"leaderboard":"/sota/graph-classification-on-synthetic-dynamic","slug":"graph-classification-on-synthetic-dynamic","dataset":"Synthetic Dynamic Networks","dataset_url":"/dataset/synthetic-dynamic-networks","rows_in_archive":3,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Time-cohort Dynamic Features + Static Features","paper_title":"Learning the mechanisms of network growth","paper_url":"/paper/learning-the-mechanisms-of-network-growth","paper_date":"2024-03-31","arxiv_id":"2404.00793","code_links":[{"title":"LourensT/DynamicNetworkSimulation","url":"https://github.com/LourensT/DynamicNetworkSimulation"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-tox21","slug":"graph-classification-on-tox21","dataset":"Tox21","dataset_url":"/dataset/tox21-1","rows_in_archive":3,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"GMT","paper_title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","paper_url":"/paper/accurate-learning-of-graph-representations-1","paper_date":"2021-02-23","arxiv_id":"2102.11533","code_links":[{"title":"JinheonBaek/GMT","url":"https://github.com/JinheonBaek/GMT"}],"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-toxcast","slug":"graph-classification-on-toxcast","dataset":"ToxCast","dataset_url":"/dataset/toxcast-scaffold","rows_in_archive":3,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"GMT","paper_title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","paper_url":"/paper/accurate-learning-of-graph-representations-1","paper_date":"2021-02-23","arxiv_id":"2102.11533","code_links":[{"title":"JinheonBaek/GMT","url":"https://github.com/JinheonBaek/GMT"}],"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-aids","slug":"graph-classification-on-aids","dataset":"AIDS","dataset_url":"/dataset/aids","rows_in_archive":2,"metrics":["Accuracy","Inference Time (ms)"],"first_row_in_archive_order":{"model":"FIT-GNN","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_url":"/paper/faster-inference-time-for-gnns-using","paper_date":"2024-10-19","arxiv_id":"2410.15001","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-bace","slug":"graph-classification-on-bace","dataset":"BACE","dataset_url":"/dataset/bace-scaffold","rows_in_archive":2,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"G-Tuning","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","paper_url":"/paper/fine-tuning-graph-neural-networks-by","paper_date":"2023-12-21","arxiv_id":"2312.13583","code_links":[{"title":"zjunet/G-Tuning","url":"https://github.com/zjunet/G-Tuning"}],"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":2,"n_no_contract":5,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-clintox","slug":"graph-classification-on-clintox","dataset":"clintox","dataset_url":"/dataset/clintox","rows_in_archive":2,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"G-Tuning","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","paper_url":"/paper/fine-tuning-graph-neural-networks-by","paper_date":"2023-12-21","arxiv_id":"2312.13583","code_links":[{"title":"zjunet/G-Tuning","url":"https://github.com/zjunet/G-Tuning"}],"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":2,"n_no_contract":5,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-ipc-grounded","slug":"graph-classification-on-ipc-grounded","dataset":"IPC-grounded","dataset_url":"/dataset/ipc-grounded","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GG-NN","paper_title":"Gated Graph Sequence Neural Networks","paper_url":"/paper/gated-graph-sequence-neural-networks","paper_date":"2015-11-17","arxiv_id":"1511.05493","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ggnn"},{"title":"Microsoft/gated-graph-neural-network-samples","url":"https://github.com/Microsoft/gated-graph-neural-network-samples"},{"title":"chingyaoc/ggnn.pytorch","url":"https://github.com/chingyaoc/ggnn.pytorch"},{"title":"JamesChuanggg/ggnn.pytorch","url":"https://github.com/JamesChuanggg/ggnn.pytorch"},{"title":"yujiali/ggnn","url":"https://github.com/yujiali/ggnn"},{"title":"messi-q/gnnscvuldetector","url":"https://github.com/messi-q/gnnscvuldetector"},{"title":"Microsoft/graph-partition-neural-network-samples","url":"https://github.com/Microsoft/graph-partition-neural-network-samples"},{"title":"bdqnghi/bi-tbcnn","url":"https://github.com/bdqnghi/bi-tbcnn"},{"title":"entslscheia/GGNN_Reasoning","url":"https://github.com/entslscheia/GGNN_Reasoning"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/gated_graph_conv.py"},{"title":"aszot/ggnn","url":"https://github.com/aszot/ggnn"},{"title":"vntchain/gnnscvuldetector","url":"https://github.com/vntchain/gnnscvuldetector"},{"title":"fau-is/grm","url":"https://github.com/fau-is/grm"}],"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gated-graph-sequence-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1511.05493","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05493"}},"official":null}}},{"leaderboard":"/sota/graph-classification-on-ipc-lifted","slug":"graph-classification-on-ipc-lifted","dataset":"IPC-lifted","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CNN","paper_title":"IPC: A Benchmark Data Set for Learning with Graph-Structured Data","paper_url":"/paper/ipc-a-benchmark-data-set-for-learning-with","paper_date":"2019-05-15","arxiv_id":"1905.06393","code_links":[{"title":"IBM/IPC-graph-data","url":"https://github.com/IBM/IPC-graph-data"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-muv","slug":"graph-classification-on-muv","dataset":"MUV","dataset_url":"/dataset/muv","rows_in_archive":2,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"GTOT-Tuning","paper_title":"Fine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transport","paper_url":"/paper/fine-tuning-graph-neural-networks-via-graph","paper_date":"2022-03-20","arxiv_id":"2203.10453","code_links":[{"title":"youjibiying/gtot-tuning","url":"https://github.com/youjibiying/gtot-tuning"}],"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/fine-tuning-graph-neural-networks-via-graph#ran","syntology_url":"https://syntology.ai/paper/2203.10453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10453"}},"official":{"repos":["youjibiying/gtot-tuning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}}},{"leaderboard":"/sota/graph-classification-on-sider","slug":"graph-classification-on-sider","dataset":"SIDER","dataset_url":"/dataset/sider","rows_in_archive":2,"metrics":["ROC-AUC"],"first_row_in_archive_order":{"model":"GTOT-Tuning","paper_title":"Fine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transport","paper_url":"/paper/fine-tuning-graph-neural-networks-via-graph","paper_date":"2022-03-20","arxiv_id":"2203.10453","code_links":[{"title":"youjibiying/gtot-tuning","url":"https://github.com/youjibiying/gtot-tuning"}],"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/fine-tuning-graph-neural-networks-via-graph#ran","syntology_url":"https://syntology.ai/paper/2203.10453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10453"}},"official":{"repos":["youjibiying/gtot-tuning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}}},{"leaderboard":"/sota/graph-classification-on-20news","slug":"graph-classification-on-20news","dataset":"20NEWS","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"sKNN-LDS","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_url":"/paper/neighborhood-enlargement-in-graph-neural","paper_date":"2019-05-21","arxiv_id":"1905.08509","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-5pt-bench-easy","slug":"graph-classification-on-5pt-bench-easy","dataset":"5pt. Bench-Easy","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NDP","paper_title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","paper_url":"/paper/hierarchical-representation-learning-in-graph","paper_date":"2019-10-24","arxiv_id":"1910.11436","code_links":[{"title":"danielegrattarola/decimation-pooling","url":"https://github.com/danielegrattarola/decimation-pooling"}],"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-adni","slug":"graph-classification-on-adni","dataset":"ADNI","dataset_url":"/dataset/adni","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NeuroPath","paper_title":"NeuroPath: A Neural Pathway Transformer for Joining the Dots of Human Connectomes","paper_url":"/paper/neuropath-a-neural-pathway-transformer-for","paper_date":"2024-09-26","arxiv_id":"2409.17510","code_links":[{"title":"Chrisa142857/neuro_detour","url":"https://github.com/Chrisa142857/neuro_detour"}],"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neuropath-a-neural-pathway-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2409.17510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17510"}},"official":{"repos":["Chrisa142857/neuro_detour"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/graph-classification-on-bench-hard","slug":"graph-classification-on-bench-hard","dataset":"Bench-hard","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NDP","paper_title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","paper_url":"/paper/hierarchical-representation-learning-in-graph","paper_date":"2019-10-24","arxiv_id":"1910.11436","code_links":[{"title":"danielegrattarola/decimation-pooling","url":"https://github.com/danielegrattarola/decimation-pooling"}],"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-bzr","slug":"graph-classification-on-bzr","dataset":"BZR","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GDL-g (ADJ)","paper_title":"Online Graph Dictionary Learning","paper_url":"/paper/online-graph-dictionary-learning","paper_date":"2021-02-12","arxiv_id":"2102.06555","code_links":[{"title":"cedricvincentcuaz/GDL","url":"https://github.com/cedricvincentcuaz/GDL"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-cancer","slug":"graph-classification-on-cancer","dataset":"Cancer","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"sKNN-LDS","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_url":"/paper/neighborhood-enlargement-in-graph-neural","paper_date":"2019-05-21","arxiv_id":"1905.08509","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-cifar-10","slug":"graph-classification-on-cifar-10","dataset":"CIFAR-10","dataset_url":"/dataset/cifar-10","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CKGCN","paper_title":"CKGConv: General Graph Convolution with Continuous Kernels","paper_url":"/paper/ckgconv-general-graph-convolution-with","paper_date":"2024-04-21","arxiv_id":"2404.13604","code_links":[{"title":"networkslab/ckgconv","url":"https://github.com/networkslab/ckgconv"}],"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/ckgconv-general-graph-convolution-with#ran","syntology_url":"https://syntology.ai/paper/2404.13604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13604"}},"official":{"repos":["networkslab/ckgconv"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/graph-classification-on-citeseer","slug":"graph-classification-on-citeseer","dataset":"Citeseer","dataset_url":"/dataset/citeseer","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"sKNN-LDS","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_url":"/paper/neighborhood-enlargement-in-graph-neural","paper_date":"2019-05-21","arxiv_id":"1905.08509","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-coil-rag","slug":"graph-classification-on-coil-rag","dataset":"COIL-RAG","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SPI-GCN","paper_title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","paper_url":"/paper/spi-gcn-a-simple-permutation-invariant-graph","paper_date":"2019-04-08","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-cora","slug":"graph-classification-on-cora","dataset":"Cora","dataset_url":"/dataset/cora","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"sKNN-LDS","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_url":"/paper/neighborhood-enlargement-in-graph-neural","paper_date":"2019-05-21","arxiv_id":"1905.08509","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-csl","slug":"graph-classification-on-csl","dataset":"CSL","dataset_url":"/dataset/csl","rows_in_archive":1,"metrics":["Acc"],"first_row_in_archive_order":{"model":"CIN","paper_title":"Weisfeiler and Lehman Go Cellular: CW Networks","paper_url":"/paper/weisfeiler-and-lehman-go-cellular-cw-networks","paper_date":"2021-06-23","arxiv_id":"2106.12575","code_links":[{"title":"twitter-research/cwn","url":"https://github.com/twitter-research/cwn"},{"title":"josefhoppe/cwn-random-ccs","url":"https://github.com/josefhoppe/cwn-random-ccs"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-digits","slug":"graph-classification-on-digits","dataset":"Digits","dataset_url":"/dataset/digits","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"sKNN-LDS","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_url":"/paper/neighborhood-enlargement-in-graph-neural","paper_date":"2019-05-21","arxiv_id":"1905.08509","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-hcp-aging","slug":"graph-classification-on-hcp-aging","dataset":"HCP Aging","dataset_url":"/dataset/hcp-aging","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NeuroPath","paper_title":"NeuroPath: A Neural Pathway Transformer for Joining the Dots of Human Connectomes","paper_url":"/paper/neuropath-a-neural-pathway-transformer-for","paper_date":"2024-09-26","arxiv_id":"2409.17510","code_links":[{"title":"Chrisa142857/neuro_detour","url":"https://github.com/Chrisa142857/neuro_detour"}],"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neuropath-a-neural-pathway-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2409.17510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17510"}},"official":{"repos":["Chrisa142857/neuro_detour"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/graph-classification-on-hiv-fmri-77-1","slug":"graph-classification-on-hiv-fmri-77-1","dataset":"HIV-fMRI-77","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy","F1"],"first_row_in_archive_order":{"model":"IsoNN","paper_title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","paper_url":"/paper/isonn-isomorphic-neural-network-for-graph","paper_date":"2019-07-22","arxiv_id":"1907.09495","code_links":[{"title":"linmengsysu/IsoNN","url":"https://github.com/linmengsysu/IsoNN"},{"title":"jwzhanggy/isocapsnet","url":"https://github.com/jwzhanggy/isocapsnet"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-hydrides","slug":"graph-classification-on-hydrides","dataset":"HYDRIDES","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SPI-GCN","paper_title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","paper_url":"/paper/spi-gcn-a-simple-permutation-invariant-graph","paper_date":"2019-04-08","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-imdb-multi","slug":"graph-classification-on-imdb-multi","dataset":"IMDB-MULTI","dataset_url":"/dataset/imdb-multi","rows_in_archive":1,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"Local Topological Profile (LTP)","paper_title":"Strengthening structural baselines for graph classification using Local Topological Profile","paper_url":"/paper/strengthening-structural-baselines-for-graph","paper_date":"2023-05-01","arxiv_id":"2305.00724","code_links":[{"title":"j-adamczyk/ltp","url":"https://github.com/j-adamczyk/ltp"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-msrc-21-per-class","slug":"graph-classification-on-msrc-21-per-class","dataset":"MSRC-21 (per-class)","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy (10 fold)"],"first_row_in_archive_order":{"model":"G-Tuning","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","paper_url":"/paper/fine-tuning-graph-neural-networks-by","paper_date":"2023-12-21","arxiv_id":"2312.13583","code_links":[{"title":"zjunet/G-Tuning","url":"https://github.com/zjunet/G-Tuning"}],"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":2,"n_no_contract":5,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-nc1","slug":"graph-classification-on-nc1","dataset":"NC1","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"EigenGCN-3","paper_title":"Graph Convolutional Networks with EigenPooling","paper_url":"/paper/graph-convolutional-networks-with","paper_date":"2019-04-30","arxiv_id":"1904.13107","code_links":[{"title":"alge24/eigenpooling","url":"https://github.com/alge24/eigenpooling"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-nci-123","slug":"graph-classification-on-nci-123","dataset":"NCI-123","dataset_url":"/dataset/nci1","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GAM","paper_title":"Graph Classification using Structural Attention","paper_url":"/paper/graph-classification-using-structural","paper_date":"2018-07-19","arxiv_id":null,"code_links":[{"title":"benedekrozemberczki/GAM","url":"https://github.com/benedekrozemberczki/GAM"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-nci-83","slug":"graph-classification-on-nci-83","dataset":"NCI-83","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GAM","paper_title":"Graph Classification using Structural Attention","paper_url":"/paper/graph-classification-using-structural","paper_date":"2018-07-19","arxiv_id":null,"code_links":[{"title":"benedekrozemberczki/GAM","url":"https://github.com/benedekrozemberczki/GAM"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-nci33","slug":"graph-classification-on-nci33","dataset":"NCI33","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GAM","paper_title":"Graph Classification using Structural Attention","paper_url":"/paper/graph-classification-using-structural","paper_date":"2018-07-19","arxiv_id":null,"code_links":[{"title":"benedekrozemberczki/GAM","url":"https://github.com/benedekrozemberczki/GAM"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-oasis","slug":"graph-classification-on-oasis","dataset":"OASIS","dataset_url":"/dataset/oasis","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NeuroPath","paper_title":"NeuroPath: A Neural Pathway Transformer for Joining the Dots of Human Connectomes","paper_url":"/paper/neuropath-a-neural-pathway-transformer-for","paper_date":"2024-09-26","arxiv_id":"2409.17510","code_links":[{"title":"Chrisa142857/neuro_detour","url":"https://github.com/Chrisa142857/neuro_detour"}],"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neuropath-a-neural-pathway-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2409.17510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17510"}},"official":{"repos":["Chrisa142857/neuro_detour"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/graph-classification-on-pubmed","slug":"graph-classification-on-pubmed","dataset":"Pubmed","dataset_url":"/dataset/pubmed","rows_in_archive":1,"metrics":["Test Accuracy"],"first_row_in_archive_order":{"model":"Fea2Fea-s3","paper_title":"Fea2Fea: Exploring Structural Feature Correlations via Graph Neural Networks","paper_url":"/paper/fea2fea-exploring-structural-feature","paper_date":"2021-06-24","arxiv_id":"2106.13061","code_links":[{"title":"JIAQING-XIE/Fea2Fea","url":"https://github.com/JIAQING-XIE/Fea2Fea"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-reddit-12k","slug":"graph-classification-on-reddit-12k","dataset":"REDDIT-12K","dataset_url":"/dataset/reddit-12k","rows_in_archive":1,"metrics":["Accuracy (10 fold)"],"first_row_in_archive_order":{"model":"G-Tuning","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","paper_url":"/paper/fine-tuning-graph-neural-networks-by","paper_date":"2023-12-21","arxiv_id":"2312.13583","code_links":[{"title":"zjunet/G-Tuning","url":"https://github.com/zjunet/G-Tuning"}],"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":2,"n_no_contract":5,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/graph-classification-on-reddit-multi-5k","slug":"graph-classification-on-reddit-multi-5k","dataset":"REDDIT-MULTI-5k","dataset_url":"/dataset/reddit-5k","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphSAGE","paper_title":"A Fair Comparison of Graph Neural Networks for Graph Classification","paper_url":"/paper/a-fair-comparison-of-graph-neural-networks-1","paper_date":"2019-12-20","arxiv_id":"1912.09893","code_links":[{"title":"diningphil/gnn-comparison","url":"https://github.com/diningphil/gnn-comparison"},{"title":"diningphil/CGMM","url":"https://github.com/diningphil/CGMM"},{"title":"FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks","url":"https://github.com/FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks"},{"title":"diningphil/icgmm","url":"https://github.com/diningphil/icgmm"},{"title":"toinesayan/node-classification-and-label-dependencies","url":"https://github.com/toinesayan/node-classification-and-label-dependencies"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-synthie","slug":"graph-classification-on-synthie","dataset":"SYNTHIE","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SPI-GCN","paper_title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","paper_url":"/paper/spi-gcn-a-simple-permutation-invariant-graph","paper_date":"2019-04-08","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-uk-biobank-brain-mri","slug":"graph-classification-on-uk-biobank-brain-mri","dataset":"UK Biobank Brain MRI","dataset_url":"/dataset/uk-biobank-brain-mri","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NeuroPath","paper_title":"NeuroPath: A Neural Pathway Transformer for Joining the Dots of Human Connectomes","paper_url":"/paper/neuropath-a-neural-pathway-transformer-for","paper_date":"2024-09-26","arxiv_id":"2409.17510","code_links":[{"title":"Chrisa142857/neuro_detour","url":"https://github.com/Chrisa142857/neuro_detour"}],"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neuropath-a-neural-pathway-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2409.17510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17510"}},"official":{"repos":["Chrisa142857/neuro_detour"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/graph-classification-on-web","slug":"graph-classification-on-web","dataset":"Web","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"UGraphEmb-F","paper_title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","paper_url":"/paper/unsupervised-inductive-whole-graph-embedding","paper_date":"2019-04-01","arxiv_id":"1904.01098","code_links":[{"title":"yunshengb/UGraphEmb","url":"https://github.com/yunshengb/UGraphEmb"}],"syntology":null}},{"leaderboard":"/sota/graph-classification-on-wine","slug":"graph-classification-on-wine","dataset":"Wine","dataset_url":"/dataset/wine","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"sKNN-LDS","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_url":"/paper/neighborhood-enlargement-in-graph-neural","paper_date":"2019-05-21","arxiv_id":"1905.08509","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"syntology":null}}],"datasets":[{"url":"/dataset/cifar-10","name":"CIFAR-10","full_name":"CIFAR-10","num_papers_in_archive":16145},{"url":"/dataset/mnist","name":"MNIST","full_name":"","num_papers_in_archive":7651},{"url":"/dataset/pubmed","name":"Pubmed","full_name":"","num_papers_in_archive":1236},{"url":"/dataset/ogb","name":"OGB","full_name":"Open Graph Benchmark","num_papers_in_archive":1000},{"url":"/dataset/reddit","name":"Reddit","full_name":"","num_papers_in_archive":699},{"url":"/dataset/cora","name":"Cora","full_name":"","num_papers_in_archive":602},{"url":"/dataset/citeseer","name":"Citeseer","full_name":"","num_papers_in_archive":381},{"url":"/dataset/proteins","name":"PROTEINS","full_name":"","num_papers_in_archive":371},{"url":"/dataset/imdb-binary","name":"IMDB-BINARY","full_name":"","num_papers_in_archive":326},{"url":"/dataset/mutag","name":"MUTAG","full_name":"","num_papers_in_archive":274},{"url":"/dataset/nci1","name":"NCI1","full_name":"","num_papers_in_archive":260},{"url":"/dataset/collab","name":"COLLAB","full_name":"","num_papers_in_archive":259},{"url":"/dataset/imdb-multi","name":"IMDB-MULTI","full_name":"","num_papers_in_archive":243},{"url":"/dataset/enzymes","name":"ENZYMES","full_name":"","num_papers_in_archive":202},{"url":"/dataset/reddit-binary","name":"REDDIT-BINARY","full_name":"","num_papers_in_archive":150},{"url":"/dataset/ptc","name":"PTC","full_name":"Predictive Toxicology Challenge","num_papers_in_archive":111},{"url":"/dataset/nci109","name":"NCI109","full_name":"NCI109","num_papers_in_archive":96},{"url":"/dataset/reddit-5k","name":"REDDIT-5K","full_name":"REDDIT-MULTI-5K","num_papers_in_archive":78},{"url":"/dataset/pascalvoc-sp","name":"Long Range Graph Benchmark (LRGB)","full_name":"","num_papers_in_archive":76},{"url":"/dataset/aids","name":"AIDS","full_name":"AIDS","num_papers_in_archive":67},{"url":"/dataset/ba-2motifs","name":"BA-2motifs","full_name":"","num_papers_in_archive":48},{"url":"/dataset/csl","name":"CSL","full_name":"","num_papers_in_archive":34},{"url":"/dataset/tox21-1","name":"Tox21","full_name":"","num_papers_in_archive":30},{"url":"/dataset/adni","name":"ADNI","full_name":"Alzheimer's Disease NeuroImaging Initiative","num_papers_in_archive":28},{"url":"/dataset/bbbp-scaffold","name":"BBBP (Blood-Brain Barrier Penetration)","full_name":"","num_papers_in_archive":28},{"url":"/dataset/oasis","name":"OASIS","full_name":"Open Annotations of Single Image Surfaces","num_papers_in_archive":28},{"url":"/dataset/reddit-12k","name":"REDDIT-12K","full_name":"","num_papers_in_archive":24},{"url":"/dataset/bace-scaffold","name":"BACE (β-secretase enzyme)","full_name":"","num_papers_in_archive":22},{"url":"/dataset/digits","name":"Digits","full_name":"Optical Recognition of Handwritten Digits","num_papers_in_archive":21},{"url":"/dataset/qm9-charge-densities-and-energies-calculated","name":"HIV (Human Immunodeficiency Virus)","full_name":"","num_papers_in_archive":20},{"url":"/dataset/clintox","name":"clintox","full_name":"","num_papers_in_archive":19},{"url":"/dataset/sider","name":"SIDER","full_name":"SIDER","num_papers_in_archive":19},{"url":"/dataset/malnet","name":"MalNet","full_name":"","num_papers_in_archive":17},{"url":"/dataset/toxcast-scaffold","name":"ToxCast (Toxicity Forecaster)","full_name":"","num_papers_in_archive":15},{"url":"/dataset/linux","name":"Linux","full_name":"Linux Program Dependence Graphs","num_papers_in_archive":14},{"url":"/dataset/mutagenicity","name":"Mutagenicity","full_name":null,"num_papers_in_archive":13},{"url":"/dataset/upfd","name":"UPFD","full_name":"User Preference-aware Fake News Detection","num_papers_in_archive":13},{"url":"/dataset/muv","name":"MUV","full_name":"","num_papers_in_archive":12},{"url":"/dataset/wine","name":"Wine","full_name":"Wine Data Set","num_papers_in_archive":11},{"url":"/dataset/upfd-gos","name":"UPFD-GOS","full_name":"User Preference-aware Fake News Detection","num_papers_in_archive":3},{"url":"/dataset/apistox","name":"ApisTox","full_name":"","num_papers_in_archive":2},{"url":"/dataset/eth-exchange","name":"Eth-Exchange","full_name":"Exchange in Ethereum","num_papers_in_archive":2},{"url":"/dataset/gvlqa","name":"GVLQA","full_name":"Graph Vision-Language Question-Answering","num_papers_in_archive":2},{"url":"/dataset/hcp-aging","name":"HCP Aging","full_name":"Lifespan Human Connectome Project Aging","num_papers_in_archive":2},{"url":"/dataset/ipc-grounded","name":"IPC-grounded","full_name":"","num_papers_in_archive":2},{"url":"/dataset/uk-biobank-brain-mri","name":"UK Biobank Brain MRI","full_name":"UK Biobank Data - Brain MRI","num_papers_in_archive":2},{"url":"/dataset/upfd-pol","name":"UPFD-POL","full_name":"User Preference-aware Fake News Detection","num_papers_in_archive":2},{"url":"/dataset/aids-antiviral-screen","name":"AIDS Antiviral Screen","full_name":"AIDS Antiviral Screen","num_papers_in_archive":1},{"url":"/dataset/b-xaic","name":"B-XAIC","full_name":"","num_papers_in_archive":1},{"url":"/dataset/color-connectivity","name":"Color-connectivity","full_name":"","num_papers_in_archive":1},{"url":"/dataset/eth-ico","name":"Eth-ICO","full_name":"ICO-wallets in Ethereum","num_papers_in_archive":1},{"url":"/dataset/eth-mining","name":"Eth-Mining","full_name":"Mining in Ethereum","num_papers_in_archive":1},{"url":"/dataset/spot-10","name":"SPOT-10","full_name":"Animal Pattern Benchmark Dataset for Machine Learning Algorithms","num_papers_in_archive":1},{"url":"/dataset/synthetic-dynamic-networks","name":"Synthetic Dynamic Networks","full_name":"from Aging, Fitness Preferential Attachment mechanisms","num_papers_in_archive":1}],"subtasks":[{"url":"/task/crystal-system-classification","name":"Crystal system classification"},{"url":"/task/isomorphism-testing","name":"Isomorphism Testing"},{"url":"/task/space-group-classification","name":"Space group classification"}],"parent_tasks":[{"url":"/task/classification-1","name":"Classification"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":10,"rows_per_page":100,"shown":100,"of":927,"of_with_code":483,"tagged_in_all":927,"counts":{"archive_papers_tagged":927,"with_a_code_link":483,"where_syntology_ran_a_sample":174,"not_listed_spam_title":0,"listed":927,"listed_where_code_ran":174,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":149,"every_run_a_failure_of_syntologys_instrument":25,"listed_with_a_run_with_no_instrument_failure":149,"listed_every_run_a_failure_of_syntologys_instrument":25,"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 the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_pointer_only":46,"phrase":"61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}},"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/semi-supervised-classification-with-graph","slug":"semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","repositories_listed":55,"syntology":{"n":58,"n_ran":39,"n_constructed":13,"n_ran_checked":34,"n_instrument":5,"n_unverified":19,"n_honours":0,"n_violates":1,"n_no_contract":33,"n_pointer_only":23,"phrase":"39 ran (of which 13 constructed an object rather than computing a result; 34 with no instrument failure: 0 honoured, 1 violated, 33 with no contract checked; 5 where Syntology's instrument failed) · 19 unverified","sample_list":"/paper/semi-supervised-classification-with-graph#ran","syntology_url":"https://syntology.ai/paper/1609.02907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02907"}},"official":{"repos":["tkipf/pygcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/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","repositories_listed":27,"syntology":{"n":32,"n_ran":18,"n_constructed":3,"n_ran_checked":13,"n_instrument":5,"n_unverified":14,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":15,"phrase":"18 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified","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"}},"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"]}}},{"url":"/paper/imagenet-classification-with-deep","slug":"imagenet-classification-with-deep","title":"ImageNet Classification with Deep Convolutional Neural Networks","date":"2012-12-01","arxiv_id":null,"repositories_listed":23,"syntology":null},{"url":"/paper/inductive-representation-learning-on-large","slug":"inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","arxiv_id":"1706.02216","repositories_listed":20,"syntology":{"n":5,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/inductive-representation-learning-on-large#ran","syntology_url":"https://syntology.ai/paper/1706.02216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02216"}},"official":{"repos":["williamleif/GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/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","repositories_listed":19,"syntology":{"n":10,"n_ran":6,"n_constructed":2,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","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"}},"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"]}}},{"url":"/paper/lightgcn-simplifying-and-powering-graph","slug":"lightgcn-simplifying-and-powering-graph","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","date":"2020-02-06","arxiv_id":"2002.02126","repositories_listed":18,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lightgcn-simplifying-and-powering-graph#ran","syntology_url":"https://syntology.ai/paper/2002.02126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02126"}},"official":{"repos":["gusye1234/pytorch-light-gcn","kuandeng/LightGCN"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/benchmarking-graph-neural-networks","slug":"benchmarking-graph-neural-networks","title":"Benchmarking Graph Neural Networks","date":"2020-03-02","arxiv_id":"2003.00982","repositories_listed":15,"syntology":{"n":23,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":13,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/benchmarking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2003.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00982"}},"official":{"repos":["graphdeeplearning/benchmarking-gnns","karl-zhao/benchmarking-gnns-pyg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/hierarchical-graph-representation-learning","slug":"hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","arxiv_id":"1806.08804","repositories_listed":14,"syntology":{"n":20,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/hierarchical-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/1806.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08804"}},"official":null}},{"url":"/paper/gated-graph-sequence-neural-networks","slug":"gated-graph-sequence-neural-networks","title":"Gated Graph Sequence Neural Networks","date":"2015-11-17","arxiv_id":"1511.05493","repositories_listed":13,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gated-graph-sequence-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1511.05493","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05493"}},"official":null}},{"url":"/paper/gnn-explainer-a-tool-for-post-hoc-explanation","slug":"gnn-explainer-a-tool-for-post-hoc-explanation","title":"GNNExplainer: Generating Explanations for Graph Neural Networks","date":"2019-03-10","arxiv_id":"1903.03894","repositories_listed":12,"syntology":{"n":22,"n_ran":18,"n_constructed":0,"n_ran_checked":17,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":1,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/gnn-explainer-a-tool-for-post-hoc-explanation#ran","syntology_url":"https://syntology.ai/paper/1903.03894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03894"}},"official":{"repos":["RexYing/gnn-model-explainer"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/pre-training-graph-neural-networks","slug":"pre-training-graph-neural-networks","title":"Strategies for Pre-training Graph Neural Networks","date":"2019-05-29","arxiv_id":"1905.12265","repositories_listed":11,"syntology":{"n":14,"n_ran":13,"n_constructed":1,"n_ran_checked":9,"n_instrument":4,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"13 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 3 honoured, 0 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pre-training-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1905.12265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12265"}},"official":{"repos":["snap-stanford/pretrain-gnns"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/how-attentive-are-graph-attention-networks","slug":"how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","arxiv_id":"2105.14491","repositories_listed":8,"syntology":{"n":16,"n_ran":11,"n_constructed":1,"n_ran_checked":10,"n_instrument":1,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/how-attentive-are-graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2105.14491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14491"}},"official":{"repos":["tech-srl/how_attentive_are_gats"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/principal-neighbourhood-aggregation-for-graph","slug":"principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","arxiv_id":"2004.05718","repositories_listed":8,"syntology":{"n":55,"n_ran":33,"n_constructed":4,"n_ran_checked":11,"n_instrument":22,"n_unverified":22,"n_honours":4,"n_violates":0,"n_no_contract":7,"n_pointer_only":48,"phrase":"33 ran (of which 4 constructed an object rather than computing a result; 11 with no instrument failure: 4 honoured, 0 violated, 7 with no contract checked; 22 where Syntology's instrument failed) · 22 unverified","sample_list":"/paper/principal-neighbourhood-aggregation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2004.05718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05718"}},"official":{"repos":["lukecavabarrett/pna"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/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","repositories_listed":6,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","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"}},"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":[]}}},{"url":"/paper/graph2vec-learning-distributed","slug":"graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","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"}},"official":null}},{"url":"/paper/structural-deep-network-embedding","slug":"structural-deep-network-embedding","title":"Structural Deep Network Embedding","date":"2016-06-01","arxiv_id":null,"repositories_listed":6,"syntology":null},{"url":"/paper/do-transformers-really-perform-bad-for-graph","slug":"do-transformers-really-perform-bad-for-graph","title":"Do Transformers Really Perform Bad for Graph Representation?","date":"2021-06-09","arxiv_id":"2106.05234","repositories_listed":5,"syntology":null},{"url":"/paper/contrastive-multi-view-representation","slug":"contrastive-multi-view-representation","title":"Contrastive Multi-View Representation Learning on Graphs","date":"2020-06-10","arxiv_id":"2006.05582","repositories_listed":5,"syntology":{"n":22,"n_ran":16,"n_constructed":3,"n_ran_checked":10,"n_instrument":6,"n_unverified":6,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":9,"phrase":"16 ran (of which 3 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 6 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/contrastive-multi-view-representation#ran","syntology_url":"https://syntology.ai/paper/2006.05582","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05582"}},"official":{"repos":["kavehhassani/mvgrl"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/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","repositories_listed":5,"syntology":null},{"url":"/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","repositories_listed":5,"syntology":null},{"url":"/paper/splinecnn-fast-geometric-deep-learning-with","slug":"splinecnn-fast-geometric-deep-learning-with","title":"SplineCNN: Fast Geometric Deep Learning with Continuous B-Spline Kernels","date":"2017-11-24","arxiv_id":"1711.08920","repositories_listed":5,"syntology":null},{"url":"/paper/molecular-fingerprints-are-strong-models-for","slug":"molecular-fingerprints-are-strong-models-for","title":"Molecular Fingerprints Are Strong Models for Peptide Function Prediction","date":"2025-01-29","arxiv_id":"2501.17901","repositories_listed":4,"syntology":null},{"url":"/paper/energy-transformer","slug":"energy-transformer","title":"Energy Transformer","date":"2023-02-14","arxiv_id":"2302.07253","repositories_listed":4,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":7,"n_instrument":6,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/energy-transformer#ran","syntology_url":"https://syntology.ai/paper/2302.07253","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.07253"}},"official":{"repos":["bhoov/energy-transformer-jax","zhuergou/energy-transformer-for-graph-anomaly-detection","Lemon-cmd/energy-transformer-graph","Lemon-cmd/energy-transformer-torch"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","repositories_listed":4,"syntology":{"n":21,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":18,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 18 unverified","sample_list":"/paper/recipe-for-a-general-powerful-scalable-graph#ran","syntology_url":"https://syntology.ai/paper/2205.12454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12454"}},"official":{"repos":["rampasek/GraphGPS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/parameterized-explainer-for-graph-neural","slug":"parameterized-explainer-for-graph-neural","title":"Parameterized Explainer for Graph Neural Network","date":"2020-11-09","arxiv_id":"2011.04573","repositories_listed":4,"syntology":{"n":8,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/parameterized-explainer-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2011.04573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.04573"}},"official":{"repos":["flyingdoog/PGExplainer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/detecting-relevant-feature-interactions-for","slug":"detecting-relevant-feature-interactions-for","title":"Detecting Beneficial Feature Interactions for Recommender Systems","date":"2020-08-02","arxiv_id":"2008.00404","repositories_listed":4,"syntology":null},{"url":"/paper/simple-and-deep-graph-convolutional-networks-1","slug":"simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","arxiv_id":"2007.02133","repositories_listed":4,"syntology":{"n":7,"n_ran":5,"n_constructed":5,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result","sample_list":"/paper/simple-and-deep-graph-convolutional-networks-1#ran","syntology_url":"https://syntology.ai/paper/2007.02133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02133"}},"official":{"repos":["chennnM/GCNII"],"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":["found_in_text","listed","official"]}}},{"url":"/paper/gcc-graph-contrastive-coding-for-graph-neural","slug":"gcc-graph-contrastive-coding-for-graph-neural","title":"GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training","date":"2020-06-17","arxiv_id":"2006.09963","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gcc-graph-contrastive-coding-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2006.09963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09963"}},"official":{"repos":["THUDM/GCC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/composition-based-multi-relational-graph","slug":"composition-based-multi-relational-graph","title":"Composition-based Multi-Relational Graph Convolutional Networks","date":"2019-11-08","arxiv_id":"1911.03082","repositories_listed":4,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/composition-based-multi-relational-graph#ran","syntology_url":"https://syntology.ai/paper/1911.03082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03082"}},"official":{"repos":["malllabiisc/CompGCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/mincut-pooling-in-graph-neural-networks","slug":"mincut-pooling-in-graph-neural-networks","title":"Spectral Clustering with Graph Neural Networks for Graph Pooling","date":"2019-06-30","arxiv_id":"1907.00481","repositories_listed":4,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/mincut-pooling-in-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1907.00481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00481"}},"official":{"repos":["FilippoMB/Spectral-Clustering-with-Graph-Neural-Networks-for-Graph-Pooling","FilippoMB/Benchmark_dataset_for_graph_classification"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/fake-news-detection-on-social-media-using","slug":"fake-news-detection-on-social-media-using","title":"Fake News Detection on Social Media using Geometric Deep Learning","date":"2019-02-10","arxiv_id":"1902.06673","repositories_listed":4,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fake-news-detection-on-social-media-using#ran","syntology_url":"https://syntology.ai/paper/1902.06673","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06673"}},"official":null}},{"url":"/paper/supervised-community-detection-with-line","slug":"supervised-community-detection-with-line","title":"Supervised Community Detection with Line Graph Neural Networks","date":"2017-05-23","arxiv_id":"1705.08415","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/supervised-community-detection-with-line#ran","syntology_url":"https://syntology.ai/paper/1705.08415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.08415"}},"official":{"repos":["zhengdao-chen/GNN4CD"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/geometric-deep-learning-on-graphs-and","slug":"geometric-deep-learning-on-graphs-and","title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","date":"2016-11-25","arxiv_id":"1611.08402","repositories_listed":4,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/geometric-deep-learning-on-graphs-and#ran","syntology_url":"https://syntology.ai/paper/1611.08402","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.08402"}},"official":null}},{"url":"/paper/persistence-images-a-stable-vector","slug":"persistence-images-a-stable-vector","title":"Persistence Images: A Stable Vector Representation of Persistent Homology","date":"2015-07-22","arxiv_id":"1507.06217","repositories_listed":4,"syntology":null},{"url":"/paper/laplacian-canonization-a-minimalist-approach-1","slug":"laplacian-canonization-a-minimalist-approach-1","title":"Laplacian Canonization: A Minimalist Approach to Sign and Basis Invariant Spectral Embedding","date":"2023-10-28","arxiv_id":"2310.18716","repositories_listed":3,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/laplacian-canonization-a-minimalist-approach-1#ran","syntology_url":"https://syntology.ai/paper/2310.18716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18716"}},"official":{"repos":["GeorgeMLP/basis-invariance-synthetic-experiment","pku-ml/laplaciancanonization","georgemlp/laplacian-canonization"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/transitivity-preserving-graph-representation","slug":"transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","arxiv_id":"2308.09517","repositories_listed":3,"syntology":{"n":26,"n_ran":19,"n_constructed":0,"n_ran_checked":13,"n_instrument":6,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 6 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/transitivity-preserving-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2308.09517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09517"}},"official":{"repos":["nslab-cuk/unified-graph-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/tractable-probabilistic-graph-representation","slug":"tractable-probabilistic-graph-representation","title":"Tractable Probabilistic Graph Representation Learning with Graph-Induced Sum-Product Networks","date":"2023-05-17","arxiv_id":"2305.10544","repositories_listed":3,"syntology":null},{"url":"/paper/simplifying-subgraph-representation-learning","slug":"simplifying-subgraph-representation-learning","title":"Simplifying Subgraph Representation Learning for Scalable Link Prediction","date":"2023-01-29","arxiv_id":"2301.12562","repositories_listed":3,"syntology":null},{"url":"/paper/a-generalization-of-vit-mlp-mixer-to-graphs","slug":"a-generalization-of-vit-mlp-mixer-to-graphs","title":"A Generalization of ViT/MLP-Mixer to Graphs","date":"2022-12-27","arxiv_id":"2212.13350","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-generalization-of-vit-mlp-mixer-to-graphs#ran","syntology_url":"https://syntology.ai/paper/2212.13350","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.13350"}},"official":{"repos":["XiaoxinHe/Graph-ViT-MLPMixer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/graphmae-self-supervised-masked-graph","slug":"graphmae-self-supervised-masked-graph","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","date":"2022-05-22","arxiv_id":"2205.10803","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graphmae-self-supervised-masked-graph#ran","syntology_url":"https://syntology.ai/paper/2205.10803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10803"}},"official":{"repos":["thudm/graphmae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-empirical-study-of-graph-contrastive","slug":"an-empirical-study-of-graph-contrastive","title":"An Empirical Study of Graph Contrastive Learning","date":"2021-09-02","arxiv_id":"2109.01116","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-empirical-study-of-graph-contrastive#ran","syntology_url":"https://syntology.ai/paper/2109.01116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01116"}},"official":{"repos":["GraphCL/PyGCL"],"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":["listed","official"]}}},{"url":"/paper/pooling-architecture-search-for-graph","slug":"pooling-architecture-search-for-graph","title":"Pooling Architecture Search for Graph Classification","date":"2021-08-24","arxiv_id":"2108.10587","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pooling-architecture-search-for-graph#ran","syntology_url":"https://syntology.ai/paper/2108.10587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.10587"}},"official":{"repos":["automl-research/pas"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/edge-augmented-graph-transformers-global-self","slug":"edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/edge-augmented-graph-transformers-global-self#ran","syntology_url":"https://syntology.ai/paper/2108.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03348"}},"official":{"repos":["shamim-hussain/egt","shamim-hussain/egt_pytorch","shamim-hussain/egt_triangular"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/flag-adversarial-data-augmentation-for-graph-1","slug":"flag-adversarial-data-augmentation-for-graph-1","title":"Robust Optimization as Data Augmentation for Large-scale Graphs","date":"2020-10-19","arxiv_id":"2010.09891","repositories_listed":3,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/flag-adversarial-data-augmentation-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2010.09891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09891"}},"official":{"repos":["devnkong/FLAG"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/lifelong-graph-learning","slug":"lifelong-graph-learning","title":"Lifelong Graph Learning","date":"2020-09-01","arxiv_id":"2009.00647","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lifelong-graph-learning#ran","syntology_url":"https://syntology.ai/paper/2009.00647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.00647"}},"official":{"repos":["wang-chen/LGL","wang-chen/lgl-action-recognition"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/characteristic-functions-on-graphs-birds-of-a","slug":"characteristic-functions-on-graphs-birds-of-a","title":"Characteristic Functions on Graphs: Birds of a Feather, from Statistical Descriptors to Parametric Models","date":"2020-05-16","arxiv_id":"2005.07959","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/characteristic-functions-on-graphs-birds-of-a#ran","syntology_url":"https://syntology.ai/paper/2005.07959","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07959"}},"official":{"repos":["benedekrozemberczki/FEATHER"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-graph-pooling-with-structure","slug":"hierarchical-graph-pooling-with-structure","title":"Hierarchical Graph Pooling with Structure Learning","date":"2019-11-14","arxiv_id":"1911.05954","repositories_listed":3,"syntology":null},{"url":"/paper/hats-a-hierarchical-graph-attention-network","slug":"hats-a-hierarchical-graph-attention-network","title":"HATS: A Hierarchical Graph Attention Network for Stock Movement Prediction","date":"2019-08-07","arxiv_id":"1908.07999","repositories_listed":3,"syntology":null},{"url":"/paper/graph-u-nets","slug":"graph-u-nets","title":"Graph U-Nets","date":"2019-05-11","arxiv_id":"1905.05178","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-u-nets#ran","syntology_url":"https://syntology.ai/paper/1905.05178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05178"}},"official":{"repos":["HongyangGao/gunet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/self-attention-graph-pooling","slug":"self-attention-graph-pooling","title":"Self-Attention Graph Pooling","date":"2019-04-17","arxiv_id":"1904.08082","repositories_listed":3,"syntology":null},{"url":"/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","repositories_listed":3,"syntology":null},{"url":"/paper/graph-edit-distance-computation-via-graph","slug":"graph-edit-distance-computation-via-graph","title":"SimGNN: A Neural Network Approach to Fast Graph Similarity Computation","date":"2018-08-16","arxiv_id":"1808.05689","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/graph-edit-distance-computation-via-graph#ran","syntology_url":"https://syntology.ai/paper/1808.05689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.05689"}},"official":null}},{"url":"/paper/subgraph2vec-learning-distributed","slug":"subgraph2vec-learning-distributed","title":"subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs from Large Graphs","date":"2016-06-29","arxiv_id":"1606.08928","repositories_listed":3,"syntology":null},{"url":"/paper/neural-graph-pattern-machine","slug":"neural-graph-pattern-machine","title":"Beyond Message Passing: Neural Graph Pattern Machine","date":"2025-01-30","arxiv_id":"2501.18739","repositories_listed":2,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":4,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 2 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-graph-pattern-machine#ran","syntology_url":"https://syntology.ai/paper/2501.18739","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.18739"}},"official":{"repos":["zehong-wang/gpm"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-canonization-perspective-on-invariant-and","slug":"a-canonization-perspective-on-invariant-and","title":"A Canonicalization Perspective on Invariant and Equivariant Learning","date":"2024-05-28","arxiv_id":"2405.18378","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-canonization-perspective-on-invariant-and#ran","syntology_url":"https://syntology.ai/paper/2405.18378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18378"}},"official":{"repos":["PKU-ML/canonicalization","georgemlp/canonicalization"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/graph-parsing-networks","slug":"graph-parsing-networks","title":"Graph Parsing Networks","date":"2024-02-22","arxiv_id":"2402.14393","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-parsing-networks#ran","syntology_url":"https://syntology.ai/paper/2402.14393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14393"}},"official":{"repos":["lumia-group/graphparsingnetworks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/g-retriever-retrieval-augmented-generation","slug":"g-retriever-retrieval-augmented-generation","title":"G-Retriever: Retrieval-Augmented Generation for Textual Graph Understanding and Question Answering","date":"2024-02-12","arxiv_id":"2402.07630","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/g-retriever-retrieval-augmented-generation#ran","syntology_url":"https://syntology.ai/paper/2402.07630","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07630"}},"official":{"repos":["xiaoxinhe/g-retriever"],"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"]}}},{"url":"/paper/topology-informed-graph-transformer","slug":"topology-informed-graph-transformer","title":"Topology-Informed Graph Transformer","date":"2024-02-03","arxiv_id":"2402.02005","repositories_listed":2,"syntology":{"n":21,"n_ran":17,"n_constructed":0,"n_ran_checked":13,"n_instrument":4,"n_unverified":4,"n_honours":2,"n_violates":5,"n_no_contract":6,"n_pointer_only":21,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 2 honoured, 5 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/topology-informed-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2402.02005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02005"}},"official":{"repos":["leemingo/tigt"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/where-did-the-gap-go-reassessing-the-long","slug":"where-did-the-gap-go-reassessing-the-long","title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","date":"2023-09-01","arxiv_id":"2309.00367","repositories_listed":2,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":4,"n_no_contract":2,"n_pointer_only":6,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 4 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/where-did-the-gap-go-reassessing-the-long#ran","syntology_url":"https://syntology.ai/paper/2309.00367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.00367"}},"official":{"repos":["toenshoff/lrgb"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/graph-inductive-biases-in-transformers","slug":"graph-inductive-biases-in-transformers","title":"Graph Inductive Biases in Transformers without Message Passing","date":"2023-05-27","arxiv_id":"2305.17589","repositories_listed":2,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/graph-inductive-biases-in-transformers#ran","syntology_url":"https://syntology.ai/paper/2305.17589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17589"}},"official":{"repos":["liamma/grit"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/masked-relation-learning-for-deepfake","slug":"masked-relation-learning-for-deepfake","title":"Masked Relation Learning for DeepFake Detection","date":"2023-02-27","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/multiresolution-graph-transformers-and","slug":"multiresolution-graph-transformers-and","title":"Multiresolution Graph Transformers and Wavelet Positional Encoding for Learning Hierarchical Structures","date":"2023-02-17","arxiv_id":"2302.08647","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multiresolution-graph-transformers-and#ran","syntology_url":"https://syntology.ai/paper/2302.08647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08647"}},"official":{"repos":["hysonlab/multires-graph-transformer","vijaydwivedi75/lrgb"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fosr-first-order-spectral-rewiring-for","slug":"fosr-first-order-spectral-rewiring-for","title":"FoSR: First-order spectral rewiring for addressing oversquashing in GNNs","date":"2022-10-21","arxiv_id":"2210.11790","repositories_listed":2,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":6,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fosr-first-order-spectral-rewiring-for#ran","syntology_url":"https://syntology.ai/paper/2210.11790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.11790"}},"official":{"repos":["kedar2/FoSR"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/pure-transformers-are-powerful-graph-learners","slug":"pure-transformers-are-powerful-graph-learners","title":"Pure Transformers are Powerful Graph Learners","date":"2022-07-06","arxiv_id":"2207.02505","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":4,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pure-transformers-are-powerful-graph-learners#ran","syntology_url":"https://syntology.ai/paper/2207.02505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02505"}},"official":{"repos":["jw9730/tokengt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/long-range-graph-benchmark","slug":"long-range-graph-benchmark","title":"Long Range Graph Benchmark","date":"2022-06-16","arxiv_id":"2206.08164","repositories_listed":2,"syntology":null},{"url":"/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","repositories_listed":2,"syntology":null},{"url":"/paper/imbalanced-graph-classification-via-graph-of","slug":"imbalanced-graph-classification-via-graph-of","title":"Imbalanced Graph Classification via Graph-of-Graph Neural Networks","date":"2021-12-01","arxiv_id":"2112.00238","repositories_listed":2,"syntology":null},{"url":"/paper/nested-graph-neural-networks","slug":"nested-graph-neural-networks","title":"Nested Graph Neural Networks","date":"2021-10-25","arxiv_id":"2110.13197","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/nested-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2110.13197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13197"}},"official":{"repos":["muhanzhang/nestedgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/on-positional-and-structural-node-features","slug":"on-positional-and-structural-node-features","title":"On Positional and Structural Node Features for Graph Neural Networks on Non-attributed Graphs","date":"2021-07-03","arxiv_id":"2107.01495","repositories_listed":2,"syntology":null},{"url":"/paper/edge-representation-learning-with-hypergraphs","slug":"edge-representation-learning-with-hypergraphs","title":"Edge Representation Learning with Hypergraphs","date":"2021-06-30","arxiv_id":"2106.15845","repositories_listed":2,"syntology":null},{"url":"/paper/weisfeiler-and-lehman-go-cellular-cw-networks","slug":"weisfeiler-and-lehman-go-cellular-cw-networks","title":"Weisfeiler and Lehman Go Cellular: CW Networks","date":"2021-06-23","arxiv_id":"2106.12575","repositories_listed":2,"syntology":null},{"url":"/paper/user-preference-aware-fake-news-detection","slug":"user-preference-aware-fake-news-detection","title":"User Preference-aware Fake News Detection","date":"2021-04-25","arxiv_id":"2104.12259","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/user-preference-aware-fake-news-detection#ran","syntology_url":"https://syntology.ai/paper/2104.12259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12259"}},"official":{"repos":["safe-graph/GNN-FakeNews"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-shapley-value-of-classifiers-in-ensemble","slug":"the-shapley-value-of-classifiers-in-ensemble","title":"The Shapley Value of Classifiers in Ensemble Games","date":"2021-01-06","arxiv_id":"2101.02153","repositories_listed":2,"syntology":null},{"url":"/paper/revisiting-graph-neural-networks-for-link-1","slug":"revisiting-graph-neural-networks-for-link-1","title":"Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning","date":"2020-10-30","arxiv_id":"2010.16103","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/revisiting-graph-neural-networks-for-link-1#ran","syntology_url":"https://syntology.ai/paper/2010.16103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.16103"}},"official":{"repos":["facebookresearch/SEAL_OGB"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/line-graph-neural-networks-for-link","slug":"line-graph-neural-networks-for-link","title":"Line Graph Neural Networks for Link Prediction","date":"2020-10-20","arxiv_id":"2010.10046","repositories_listed":2,"syntology":null},{"url":"/paper/directional-graph-networks-1","slug":"directional-graph-networks-1","title":"Directional Graph Networks","date":"2020-10-06","arxiv_id":"2010.02863","repositories_listed":2,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":1,"n_honours":3,"n_violates":1,"n_no_contract":7,"n_pointer_only":5,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 1 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/directional-graph-networks-1#ran","syntology_url":"https://syntology.ai/paper/2010.02863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02863"}},"official":{"repos":["Saro00/DGN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/graph-cross-networks-with-vertex-infomax","slug":"graph-cross-networks-with-vertex-infomax","title":"Graph Cross Networks with Vertex Infomax Pooling","date":"2020-10-05","arxiv_id":"2010.01804","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-cross-networks-with-vertex-infomax#ran","syntology_url":"https://syntology.ai/paper/2010.01804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01804"}},"official":{"repos":["limaosen0/GXN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tudataset-a-collection-of-benchmark-datasets","slug":"tudataset-a-collection-of-benchmark-datasets","title":"TUDataset: A collection of benchmark datasets for learning with graphs","date":"2020-07-16","arxiv_id":"2007.08663","repositories_listed":2,"syntology":null},{"url":"/paper/graph-backdoor","slug":"graph-backdoor","title":"Graph Backdoor","date":"2020-06-21","arxiv_id":"2006.11890","repositories_listed":2,"syntology":null},{"url":"/paper/backdoor-attacks-to-graph-neural-networks","slug":"backdoor-attacks-to-graph-neural-networks","title":"Backdoor Attacks to Graph Neural Networks","date":"2020-06-19","arxiv_id":"2006.11165","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/backdoor-attacks-to-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.11165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11165"}},"official":{"repos":["zaixizhang/graphbackdoor"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-graph-neural-network-expressivity","slug":"improving-graph-neural-network-expressivity","title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","date":"2020-06-16","arxiv_id":"2006.09252","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-graph-neural-network-expressivity#ran","syntology_url":"https://syntology.ai/paper/2006.09252","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09252"}},"official":{"repos":["gbouritsas/graph-substructure-networks"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bridging-the-gap-between-spectral-and-spatial","slug":"bridging-the-gap-between-spectral-and-spatial","title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","date":"2020-03-26","arxiv_id":"2003.11702","repositories_listed":2,"syntology":null},{"url":"/paper/an-api-oriented-open-source-python-framework-1","slug":"an-api-oriented-open-source-python-framework-1","title":"Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs","date":"2020-03-10","arxiv_id":"2003.04819","repositories_listed":2,"syntology":null},{"url":"/paper/memory-based-graph-networks-1","slug":"memory-based-graph-networks-1","title":"Memory-Based Graph Networks","date":"2020-02-21","arxiv_id":"2002.09518","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/memory-based-graph-networks-1#ran","syntology_url":"https://syntology.ai/paper/2002.09518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09518"}},"official":{"repos":["amirkhas/GraphMemoryNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/distance-metric-learning-for-graph-structured","slug":"distance-metric-learning-for-graph-structured","title":"Distance Metric Learning for Graph Structured Data","date":"2020-02-03","arxiv_id":"2002.00727","repositories_listed":2,"syntology":null},{"url":"/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","repositories_listed":2,"syntology":null},{"url":"/paper/got-an-optimal-transport-framework-for-graph","slug":"got-an-optimal-transport-framework-for-graph","title":"GOT: An Optimal Transport framework for Graph comparison","date":"2019-06-05","arxiv_id":"1906.02085","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/got-an-optimal-transport-framework-for-graph#ran","syntology_url":"https://syntology.ai/paper/1906.02085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02085"}},"official":{"repos":["Hermina/GOT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":2,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","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"}},"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"]}}},{"url":"/paper/provably-powerful-graph-networks","slug":"provably-powerful-graph-networks","title":"Provably Powerful Graph Networks","date":"2019-05-27","arxiv_id":"1905.11136","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","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"}},"official":null}},{"url":"/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","repositories_listed":2,"syntology":null},{"url":"/paper/understanding-attention-in-graph-neural","slug":"understanding-attention-in-graph-neural","title":"Understanding Attention and Generalization in Graph Neural Networks","date":"2019-05-08","arxiv_id":"1905.02850","repositories_listed":2,"syntology":null},{"url":"/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,"repositories_listed":2,"syntology":null},{"url":"/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","repositories_listed":2,"syntology":null},{"url":"/paper/community-detection-with-graph-neural","slug":"community-detection-with-graph-neural","title":"Community Detection with Graph Neural Networks","date":"2018-10-25","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/streaming-graph-neural-networks","slug":"streaming-graph-neural-networks","title":"Streaming Graph Neural Networks","date":"2018-10-24","arxiv_id":"1810.10627","repositories_listed":2,"syntology":null},{"url":"/paper/anonymous-walk-embeddings","slug":"anonymous-walk-embeddings","title":"Anonymous Walk Embeddings","date":"2018-05-30","arxiv_id":"1805.11921","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}},{"url":"/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","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","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"}},"official":null}},{"url":"/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,"repositories_listed":2,"syntology":null},{"url":"/paper/hunt-for-the-unique-stable-sparse-and-fast","slug":"hunt-for-the-unique-stable-sparse-and-fast","title":"Hunt For The Unique, Stable, Sparse And Fast Feature Learning On Graphs","date":"2017-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null}],"syntology_records":61,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_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'","n_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":27,"papers_placed":3,"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-proteins","since_archive":"/sota/graph-classification-on-proteins#since-judged","papers_judged":13,"placed":0},{"leaderboard":"/sota/graph-classification-on-mutag","since_archive":"/sota/graph-classification-on-mutag#since-judged","papers_judged":10,"placed":0},{"leaderboard":"/sota/graph-classification-on-nci1","since_archive":"/sota/graph-classification-on-nci1#since-judged","papers_judged":9,"placed":3},{"leaderboard":"/sota/graph-classification-on-enzymes","since_archive":"/sota/graph-classification-on-enzymes#since-judged","papers_judged":6,"placed":0},{"leaderboard":"/sota/graph-classification-on-dd","since_archive":"/sota/graph-classification-on-dd#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/graph-classification-on-imdb-b","since_archive":"/sota/graph-classification-on-imdb-b#since-judged","papers_judged":9,"placed":0},{"leaderboard":"/sota/graph-classification-on-peptides-func","since_archive":"/sota/graph-classification-on-peptides-func#since-judged","papers_judged":5,"placed":0},{"leaderboard":"/sota/graph-classification-on-collab","since_archive":"/sota/graph-classification-on-collab#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/graph-classification-on-nci109","since_archive":"/sota/graph-classification-on-nci109#since-judged","papers_judged":4,"placed":1},{"leaderboard":"/sota/graph-classification-on-ptc","since_archive":"/sota/graph-classification-on-ptc#since-judged","papers_judged":1,"placed":0},{"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-reddit-b","since_archive":"/sota/graph-classification-on-reddit-b#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/graph-classification-on-reddit-binary","since_archive":"/sota/graph-classification-on-reddit-binary#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/graph-classification-on-imdb-binary","since_archive":"/sota/graph-classification-on-imdb-binary#since-judged","papers_judged":8,"placed":0},{"leaderboard":"/sota/graph-classification-on-mutagenicity","since_archive":"/sota/graph-classification-on-mutagenicity#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-bbbp","since_archive":"/sota/graph-classification-on-bbbp#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-tox21","since_archive":"/sota/graph-classification-on-tox21#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-aids","since_archive":"/sota/graph-classification-on-aids#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-bace","since_archive":"/sota/graph-classification-on-bace#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-clintox","since_archive":"/sota/graph-classification-on-clintox#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-muv","since_archive":"/sota/graph-classification-on-muv#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-sider","since_archive":"/sota/graph-classification-on-sider#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-20news","since_archive":"/sota/graph-classification-on-20news#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-adni","since_archive":"/sota/graph-classification-on-adni#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/graph-classification-on-bzr","since_archive":"/sota/graph-classification-on-bzr#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-cancer","since_archive":"/sota/graph-classification-on-cancer#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-csl","since_archive":"/sota/graph-classification-on-csl#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-digits","since_archive":"/sota/graph-classification-on-digits#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-hcp-aging","since_archive":"/sota/graph-classification-on-hcp-aging#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-classification-on-imdb-multi","since_archive":"/sota/graph-classification-on-imdb-multi#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/graph-classification-on-wine","since_archive":"/sota/graph-classification-on-wine#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":174,"papers_where_code_ran_first_page":"/task/graph-classification/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":10,"url":"/task/graph-classification/papers/2","json":"/task/graph-classification/papers/2.json","rows":100},{"order":"archive","page":3,"of":10,"url":"/task/graph-classification/papers/3","json":"/task/graph-classification/papers/3.json","rows":100},{"order":"archive","page":4,"of":10,"url":"/task/graph-classification/papers/4","json":"/task/graph-classification/papers/4.json","rows":100},{"order":"archive","page":5,"of":10,"url":"/task/graph-classification/papers/5","json":"/task/graph-classification/papers/5.json","rows":100},{"order":"archive","page":6,"of":10,"url":"/task/graph-classification/papers/6","json":"/task/graph-classification/papers/6.json","rows":100},{"order":"archive","page":7,"of":10,"url":"/task/graph-classification/papers/7","json":"/task/graph-classification/papers/7.json","rows":100},{"order":"archive","page":8,"of":10,"url":"/task/graph-classification/papers/8","json":"/task/graph-classification/papers/8.json","rows":100},{"order":"archive","page":9,"of":10,"url":"/task/graph-classification/papers/9","json":"/task/graph-classification/papers/9.json","rows":100},{"order":"archive","page":10,"of":10,"url":"/task/graph-classification/papers/10","json":"/task/graph-classification/papers/10.json","rows":27},{"order":"ran","page":1,"of":2,"url":"/task/graph-classification/papers/ran/1","json":"/task/graph-classification/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":2,"url":"/task/graph-classification/papers/ran/2","json":"/task/graph-classification/papers/ran/2.json","rows":74}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper 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"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"11bdc3ec2c8a24038e55b2aabd6a0050abf7fb5dc55ad963c33135ffd2dac907","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}