{"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/node-classification","name":"Node Classification","slug":"node-classification","description_markdown":"**Node Classification** is a machine learning task in graph-based data analysis, where the goal is to assign labels to nodes in a graph based on the properties of nodes and the relationships between them.\r\n\r\n**Node Classification** models aim to predict non-existing node properties (known as the target property) based on other node properties. Typical models used for node classification consists of a large family of graph neural networks. Model performance can be measured using benchmark datasets like [Cora](/dataset/cora), [Citeseer](/dataset/citeseer), and [Pubmed](/dataset/pubmed), among others, typically using Accuracy and F1.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Fast Graph Representation Learning With PyTorch Geometric](https://arxiv.org/pdf/1903.02428v3.pdf) )</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":1860,"papers_with_code":991,"benchmarks":138,"benchmark_tables_in_archive":138,"benchmark_tables_shown":138,"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":75,"subtasks":5,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/node-classification-on-cora","slug":"node-classification-on-cora","dataset":"Cora","dataset_url":"/dataset/cora","rows_in_archive":73,"metrics":["Accuracy","Training Split","Validation","1:1 Accuracy","Inference Time (ms)"],"first_row_in_archive_order":{"model":"SSP","paper_title":"Optimization of Graph Neural Networks with Natural Gradient Descent","paper_url":"/paper/optimization-of-graph-neural-networks-with","paper_date":"2020-08-21","arxiv_id":"2008.09624","code_links":[{"title":"russellizadi/ssp","url":"https://github.com/russellizadi/ssp"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer","slug":"node-classification-on-citeseer","dataset":"Citeseer","dataset_url":"/dataset/citeseer","rows_in_archive":71,"metrics":["Accuracy","Training Split","Validation","1:1 Accuracy","Accuracy (%)","Inference Time (ms)"],"first_row_in_archive_order":{"model":"ACMII-Snowball-2","paper_title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","paper_url":"/paper/is-heterophily-a-real-nightmare-for-graph","paper_date":"2021-09-12","arxiv_id":"2109.05641","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed","slug":"node-classification-on-pubmed","dataset":"Pubmed","dataset_url":"/dataset/pubmed","rows_in_archive":70,"metrics":["Accuracy","Training Split","F1","Validation","Accuracy (%)","F1-Score","Inference Time (ms)"],"first_row_in_archive_order":{"model":"NCGCN","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-wisconsin","slug":"node-classification-on-wisconsin","dataset":"Wisconsin","dataset_url":"/dataset/webkb","rows_in_archive":63,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"5-HiGCN","paper_title":"Higher-order Graph Convolutional Network with Flower-Petals Laplacians on Simplicial Complexes","paper_url":"/paper/higher-order-graph-convolutional-network-with","paper_date":"2023-09-22","arxiv_id":"2309.12971","code_links":[{"title":"yiminghh/higcn","url":"https://github.com/yiminghh/higcn"}],"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":1,"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/higher-order-graph-convolutional-network-with#ran","syntology_url":"https://syntology.ai/paper/2309.12971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.12971"}},"official":{"repos":["yiminghh/higcn"],"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/node-classification-on-actor","slug":"node-classification-on-actor","dataset":"Actor","dataset_url":null,"rows_in_archive":62,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCSAGE","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-texas","slug":"node-classification-on-texas","dataset":"Texas","dataset_url":"/dataset/webkb","rows_in_archive":62,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"RDGNN-S","paper_title":"Graph Neural Reaction Diffusion Models","paper_url":"/paper/graph-neural-reaction-diffusion-models","paper_date":"2024-06-16","arxiv_id":"2406.10871","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-chameleon","slug":"node-classification-on-chameleon","dataset":"Chameleon","dataset_url":null,"rows_in_archive":61,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"DJ-GNN","paper_title":"Diffusion-Jump GNNs: Homophiliation via Learnable Metric Filters","paper_url":"/paper/diffusion-jump-gnns-homophiliation-via","paper_date":"2023-06-29","arxiv_id":"2306.16976","code_links":[{"title":"AhmedBegggaUA/TFM","url":"https://github.com/AhmedBegggaUA/TFM"}],"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":1,"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/diffusion-jump-gnns-homophiliation-via#ran","syntology_url":"https://syntology.ai/paper/2306.16976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.16976"}},"official":{"repos":["AhmedBegggaUA/TFM"],"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/node-classification-on-cornell","slug":"node-classification-on-cornell","dataset":"Cornell","dataset_url":"/dataset/cornell","rows_in_archive":60,"metrics":["Accuracy","Accuracy (%)"],"first_row_in_archive_order":{"model":"RDGNN-I","paper_title":"Graph Neural Reaction Diffusion Models","paper_url":"/paper/graph-neural-reaction-diffusion-models","paper_date":"2024-06-16","arxiv_id":"2406.10871","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-squirrel","slug":"node-classification-on-squirrel","dataset":"Squirrel","dataset_url":"/dataset/wiki-squirrel","rows_in_archive":59,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"FaberNet","paper_title":"HoloNets: Spectral Convolutions do extend to Directed Graphs","paper_url":"/paper/holonets-spectral-convolutions-do-extend-to","paper_date":"2023-10-03","arxiv_id":"2310.02232","code_links":[{"title":"ChristianKoke/HoloNets","url":"https://github.com/ChristianKoke/HoloNets"}],"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/holonets-spectral-convolutions-do-extend-to#ran","syntology_url":"https://syntology.ai/paper/2310.02232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02232"}},"official":{"repos":["ChristianKoke/HoloNets"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-citeseer-with-public","slug":"node-classification-on-citeseer-with-public","dataset":"CiteSeer with Public Split: fixed 20 nodes per class","dataset_url":"/dataset/citeseer","rows_in_archive":40,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"OGC","paper_title":"From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited","paper_url":"/paper/from-cluster-assumption-to-graph-convolution","paper_date":"2023-09-24","arxiv_id":"2309.13599","code_links":[{"title":"zhengwang100/ogc_ggcm","url":"https://github.com/zhengwang100/ogc_ggcm"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-chameleon-60-20-20","slug":"node-classification-on-chameleon-60-20-20","dataset":"Chameleon (60%/20%/20% random splits)","dataset_url":null,"rows_in_archive":38,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"GNNDLD","paper_title":"GNNDLD: Graph Neural Network with Directional Label Distribution","paper_url":"/paper/gnndld-graph-neural-network-with-directional","paper_date":"2024-02-26","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-film-60-20-20-random","slug":"node-classification-on-film-60-20-20-random","dataset":"Film (60%/20%/20% random splits)","dataset_url":"/dataset/film-60-20-20-random-splits","rows_in_archive":37,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"GNNDLD","paper_title":"GNNDLD: Graph Neural Network with Directional Label Distribution","paper_url":"/paper/gnndld-graph-neural-network-with-directional","paper_date":"2024-02-26","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-60-20-20-random","slug":"node-classification-on-pubmed-60-20-20-random","dataset":"PubMed (60%/20%/20% random splits)","dataset_url":"/dataset/pubmed-60-20-20-random-splits","rows_in_archive":37,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"GNNDLD","paper_title":"GNNDLD: Graph Neural Network with Directional Label Distribution","paper_url":"/paper/gnndld-graph-neural-network-with-directional","paper_date":"2024-02-26","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-with-public","slug":"node-classification-on-pubmed-with-public","dataset":"PubMed with Public Split: fixed 20 nodes per class","dataset_url":"/dataset/pubmed","rows_in_archive":37,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"OGC","paper_title":"From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited","paper_url":"/paper/from-cluster-assumption-to-graph-convolution","paper_date":"2023-09-24","arxiv_id":"2309.13599","code_links":[{"title":"zhengwang100/ogc_ggcm","url":"https://github.com/zhengwang100/ogc_ggcm"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-squirrel-60-20-20","slug":"node-classification-on-squirrel-60-20-20","dataset":"Squirrel (60%/20%/20% random splits)","dataset_url":"/dataset/squirrel-60-20-20-random-splits","rows_in_archive":37,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"GNNDLD","paper_title":"GNNDLD: Graph Neural Network with Directional Label Distribution","paper_url":"/paper/gnndld-graph-neural-network-with-directional","paper_date":"2024-02-26","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cora-with-public-split","slug":"node-classification-on-cora-with-public-split","dataset":"Cora with Public Split: fixed 20 nodes per class","dataset_url":"/dataset/cora","rows_in_archive":36,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"OGC","paper_title":"From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited","paper_url":"/paper/from-cluster-assumption-to-graph-convolution","paper_date":"2023-09-24","arxiv_id":"2309.13599","code_links":[{"title":"zhengwang100/ogc_ggcm","url":"https://github.com/zhengwang100/ogc_ggcm"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cornell-60-20-20","slug":"node-classification-on-cornell-60-20-20","dataset":"Cornell (60%/20%/20% random splits)","dataset_url":"/dataset/cornell-60-20-20-random-splits","rows_in_archive":36,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACMII-GCN","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_url":"/paper/revisiting-heterophily-for-graph-neural","paper_date":"2022-10-14","arxiv_id":"2210.07606","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}},"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-texas-60-20-20-random","slug":"node-classification-on-texas-60-20-20-random","dataset":"Texas (60%/20%/20% random splits)","dataset_url":null,"rows_in_archive":36,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACM-GCN++","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_url":"/paper/revisiting-heterophily-for-graph-neural","paper_date":"2022-10-14","arxiv_id":"2210.07606","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}},"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-wisconsin-60-20-20","slug":"node-classification-on-wisconsin-60-20-20","dataset":"Wisconsin (60%/20%/20% random splits)","dataset_url":null,"rows_in_archive":35,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACM-GCN++","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_url":"/paper/revisiting-heterophily-for-graph-neural","paper_date":"2022-10-14","arxiv_id":"2210.07606","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}},"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-citeseer-60-20-20","slug":"node-classification-on-citeseer-60-20-20","dataset":"CiteSeer (60%/20%/20% random splits)","dataset_url":null,"rows_in_archive":33,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"GNNDLD","paper_title":"GNNDLD: Graph Neural Network with Directional Label Distribution","paper_url":"/paper/gnndld-graph-neural-network-with-directional","paper_date":"2024-02-26","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cora-60-20-20-random","slug":"node-classification-on-cora-60-20-20-random","dataset":"Cora (60%/20%/20% random splits)","dataset_url":null,"rows_in_archive":33,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"GNNDLD","paper_title":"GNNDLD: Graph Neural Network with Directional Label Distribution","paper_url":"/paper/gnndld-graph-neural-network-with-directional","paper_date":"2024-02-26","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-penn94","slug":"node-classification-on-penn94","dataset":"Penn94","dataset_url":"/dataset/penn94","rows_in_archive":32,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Dual-Net GNN","paper_title":"Feature Selection: Key to Enhance Node Classification with Graph Neural Networks","paper_url":"/paper/feature-selection-key-to-enhance-node","paper_date":"2023-01-25","arxiv_id":null,"code_links":[{"title":"sunilkmaurya/DualNetGNN_large","url":"https://github.com/sunilkmaurya/DualNetGNN_large"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer-48-32-20","slug":"node-classification-on-citeseer-48-32-20","dataset":"Citeseer (48%/32%/20% fixed splits)","dataset_url":"/dataset/citeseer-48-32-20-fixed-splits","rows_in_archive":26,"metrics":["1:1 Accuracy","Accuracy"],"first_row_in_archive_order":{"model":"Geom-GCN","paper_title":"Geom-GCN: Geometric Graph Convolutional Networks","paper_url":"/paper/geom-gcn-geometric-graph-convolutional-1","paper_date":"2020-02-13","arxiv_id":"2002.05287","code_links":[{"title":"bingzhewei/geom-gcn","url":"https://github.com/bingzhewei/geom-gcn"},{"title":"graphdml-uiuc-jlu/geom-gcn","url":"https://github.com/graphdml-uiuc-jlu/geom-gcn"},{"title":"alexfanjn/geomgcn_pyg","url":"https://github.com/alexfanjn/geomgcn_pyg"},{"title":"KAIDI3270/Geom_GCN_pytorch_implementation","url":"https://github.com/KAIDI3270/Geom_GCN_pytorch_implementation"}],"syntology":{"n":7,"n_ran":7,"n_constructed":2,"n_ran_checked":3,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/geom-gcn-geometric-graph-convolutional-1#ran","syntology_url":"https://syntology.ai/paper/2002.05287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05287"}},"official":{"repos":["graphdml-uiuc-jlu/geom-gcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"leaderboard":"/sota/node-classification-on-cora-48-32-20-fixed","slug":"node-classification-on-cora-48-32-20-fixed","dataset":"Cora (48%/32%/20% fixed splits)","dataset_url":"/dataset/cora-48-32-20-fixed-splits","rows_in_archive":26,"metrics":["1:1 Accuracy","Accuracy"],"first_row_in_archive_order":{"model":"NLGAT","paper_title":"Non-Local Graph Neural Networks","paper_url":"/paper/non-local-graph-neural-networks","paper_date":"2020-05-29","arxiv_id":"2005.14612","code_links":[{"title":"divelab/Non-Local-GNN","url":"https://github.com/divelab/Non-Local-GNN"}],"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/non-local-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2005.14612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14612"}},"official":{"repos":["divelab/Non-Local-GNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-genius","slug":"node-classification-on-genius","dataset":"genius","dataset_url":"/dataset/genius","rows_in_archive":26,"metrics":["Accuracy","1:1 Accuracy"],"first_row_in_archive_order":{"model":"Dual-Net GNN","paper_title":"Feature Selection: Key to Enhance Node Classification with Graph Neural Networks","paper_url":"/paper/feature-selection-key-to-enhance-node","paper_date":"2023-01-25","arxiv_id":null,"code_links":[{"title":"sunilkmaurya/DualNetGNN_large","url":"https://github.com/sunilkmaurya/DualNetGNN_large"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-48-32-20-fixed","slug":"node-classification-on-pubmed-48-32-20-fixed","dataset":"PubMed (48%/32%/20% fixed splits)","dataset_url":"/dataset/pubmed-48-32-20-fixed-splits","rows_in_archive":26,"metrics":["1:1 Accuracy","Accuracy"],"first_row_in_archive_order":{"model":"GCNII","paper_title":"Simple and Deep Graph Convolutional Networks","paper_url":"/paper/simple-and-deep-graph-convolutional-networks-1","paper_date":"2020-07-04","arxiv_id":"2007.02133","code_links":[{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII/tree/master/PyG/ogbn-arxiv"},{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII"},{"title":"zhanglab-aim/cancer-net","url":"https://github.com/zhanglab-aim/cancer-net"},{"title":"tyxxzjpdez/GCNII-DropGroups","url":"https://github.com/tyxxzjpdez/GCNII-DropGroups"}],"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"]}}}},{"leaderboard":"/sota/node-classification-on-coauthor-cs","slug":"node-classification-on-coauthor-cs","dataset":"Coauthor CS","dataset_url":null,"rows_in_archive":24,"metrics":["Accuracy","Inference Time (ms)"],"first_row_in_archive_order":{"model":"NCGCN","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-ppi","slug":"node-classification-on-ppi","dataset":"PPI","dataset_url":"/dataset/ppi","rows_in_archive":24,"metrics":["F1","Micro-F1","Micro F1","Macro-F1"],"first_row_in_archive_order":{"model":"g2-MLP","paper_title":"A Proposal of Multi-Layer Perceptron with Graph Gating Unit for Graph Representation Learning and its Application to Surrogate Model for FEM","paper_url":"/paper/a-proposal-of-multi-layer-perceptron-with","paper_date":"2022-07-11","arxiv_id":null,"code_links":[{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pascalvoc-sp-1","slug":"node-classification-on-pascalvoc-sp-1","dataset":"PascalVOC-SP","dataset_url":"/dataset/pascal-voc","rows_in_archive":21,"metrics":["macro F1"],"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/node-classification-on-coco-sp","slug":"node-classification-on-coco-sp","dataset":"COCO-SP","dataset_url":"/dataset/pascalvoc-sp","rows_in_archive":19,"metrics":["macro F1"],"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/node-classification-on-reddit","slug":"node-classification-on-reddit","dataset":"Reddit","dataset_url":"/dataset/reddit","rows_in_archive":16,"metrics":["Accuracy","Micro-F1"],"first_row_in_archive_order":{"model":"BNS-GCN","paper_title":"BNS-GCN: Efficient Full-Graph Training of Graph Convolutional Networks with Partition-Parallelism and Random Boundary Node Sampling","paper_url":"/paper/bns-gcn-efficient-full-graph-training-of","paper_date":"2022-03-21","arxiv_id":"2203.10983","code_links":[{"title":"gatech-eic/bns-gcn","url":"https://github.com/gatech-eic/bns-gcn"},{"title":"RICE-EIC/BNS-GCN","url":"https://github.com/RICE-EIC/BNS-GCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cora-05","slug":"node-classification-on-cora-05","dataset":"Cora (0.5%)","dataset_url":"/dataset/cora","rows_in_archive":15,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-ind_APPNP","paper_title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","paper_url":"/paper/extract-the-knowledge-of-graph-neural","paper_date":"2021-03-04","arxiv_id":"2103.02885","code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}],"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/extract-the-knowledge-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2103.02885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.02885"}},"official":{"repos":["BUPT-GAMMA/CPF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-cora-1","slug":"node-classification-on-cora-1","dataset":"Cora (1%)","dataset_url":"/dataset/cora","rows_in_archive":15,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-ind-APPNP","paper_title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","paper_url":"/paper/extract-the-knowledge-of-graph-neural","paper_date":"2021-03-04","arxiv_id":"2103.02885","code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}],"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/extract-the-knowledge-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2103.02885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.02885"}},"official":{"repos":["BUPT-GAMMA/CPF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-cora-3","slug":"node-classification-on-cora-3","dataset":"Cora (3%)","dataset_url":"/dataset/cora","rows_in_archive":15,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-tra-GCNII","paper_title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","paper_url":"/paper/extract-the-knowledge-of-graph-neural","paper_date":"2021-03-04","arxiv_id":"2103.02885","code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}],"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/extract-the-knowledge-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2103.02885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.02885"}},"official":{"repos":["BUPT-GAMMA/CPF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-amz-photo","slug":"node-classification-on-amz-photo","dataset":"AMZ Photo","dataset_url":null,"rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCSAGE","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer-05","slug":"node-classification-on-citeseer-05","dataset":"CiteSeer (0.5%)","dataset_url":"/dataset/citeseer","rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"MT-GCN","paper_title":"Mutual Teaching for Graph Convolutional Networks","paper_url":"/paper/mutual-teaching-for-graph-convolutional","paper_date":"2020-09-02","arxiv_id":"2009.00952","code_links":[{"title":"kunzhan/MTGCN","url":"https://github.com/kunzhan/MTGCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer-1","slug":"node-classification-on-citeseer-1","dataset":"CiteSeer (1%)","dataset_url":"/dataset/citeseer","rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"VCHN","paper_title":"View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes","paper_url":"/paper/view-consistent-heterogeneous-network-on","paper_date":"2022-03-17","arxiv_id":null,"code_links":[{"title":"kunzhan/VCHN","url":"https://github.com/kunzhan/VCHN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-coauthor-physics","slug":"node-classification-on-coauthor-physics","dataset":"Coauthor Physics","dataset_url":null,"rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCSAGE","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-003","slug":"node-classification-on-pubmed-003","dataset":"PubMed (0.03%)","dataset_url":"/dataset/pubmed","rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"VCHN","paper_title":"View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes","paper_url":"/paper/view-consistent-heterogeneous-network-on","paper_date":"2022-03-17","arxiv_id":null,"code_links":[{"title":"kunzhan/VCHN","url":"https://github.com/kunzhan/VCHN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-005","slug":"node-classification-on-pubmed-005","dataset":"PubMed (0.05%)","dataset_url":"/dataset/pubmed","rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"VCHN","paper_title":"View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes","paper_url":"/paper/view-consistent-heterogeneous-network-on","paper_date":"2022-03-17","arxiv_id":null,"code_links":[{"title":"kunzhan/VCHN","url":"https://github.com/kunzhan/VCHN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-01","slug":"node-classification-on-pubmed-01","dataset":"PubMed (0.1%)","dataset_url":"/dataset/pubmed","rows_in_archive":14,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Truncated Krylov","paper_title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","paper_url":"/paper/break-the-ceiling-stronger-multi-scale-deep","paper_date":"2019-06-05","arxiv_id":"1906.02174","code_links":[{"title":"PwnerHarry/Stronger_GCN","url":"https://github.com/PwnerHarry/Stronger_GCN"}],"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/break-the-ceiling-stronger-multi-scale-deep#ran","syntology_url":"https://syntology.ai/paper/1906.02174","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02174"}},"official":{"repos":["PwnerHarry/Stronger_GCN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-amazon-computers-1","slug":"node-classification-on-amazon-computers-1","dataset":"Amazon Computers","dataset_url":null,"rows_in_archive":12,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GAT","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","paper_url":"/paper/classic-gnns-are-strong-baselines-reassessing","paper_date":"2024-06-13","arxiv_id":"2406.08993","code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}],"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/classic-gnns-are-strong-baselines-reassessing#ran","syntology_url":"https://syntology.ai/paper/2406.08993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08993"}},"official":{"repos":["LUOyk1999/tunedGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-arxiv-year","slug":"node-classification-on-arxiv-year","dataset":"arXiv-year","dataset_url":null,"rows_in_archive":12,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"MRS-Dir-GNN","paper_title":"Preventing Representational Rank Collapse in MPNNs by Splitting the Computational Graph","paper_url":"/paper/preventing-representational-rank-collapse-in","paper_date":"2024-09-17","arxiv_id":"2409.11504","code_links":[{"title":"roth-andreas/splitting-computational-graphs","url":"https://github.com/roth-andreas/splitting-computational-graphs"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cluster","slug":"node-classification-on-cluster","dataset":"CLUSTER","dataset_url":"/dataset/cluster","rows_in_archive":12,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GRIT","paper_title":"Graph Inductive Biases in Transformers without Message Passing","paper_url":"/paper/graph-inductive-biases-in-transformers","paper_date":"2023-05-27","arxiv_id":"2305.17589","code_links":[{"title":"liamma/grit","url":"https://github.com/liamma/grit"},{"title":"linusbao/MoSE","url":"https://github.com/linusbao/MoSE"}],"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"]}}}},{"leaderboard":"/sota/node-classification-on-amazon-photo-1","slug":"node-classification-on-amazon-photo-1","dataset":"Amazon Photo","dataset_url":"/dataset/amazon-photo","rows_in_archive":11,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphSAGE","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","paper_url":"/paper/classic-gnns-are-strong-baselines-reassessing","paper_date":"2024-06-13","arxiv_id":"2406.08993","code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}],"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/classic-gnns-are-strong-baselines-reassessing#ran","syntology_url":"https://syntology.ai/paper/2406.08993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08993"}},"official":{"repos":["LUOyk1999/tunedGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-pattern","slug":"node-classification-on-pattern","dataset":"PATTERN","dataset_url":"/dataset/pattern","rows_in_archive":11,"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/node-classification-on-cora-fixed-20-node-per","slug":"node-classification-on-cora-fixed-20-node-per","dataset":"Cora: fixed 20 node per class","dataset_url":"/dataset/cora","rows_in_archive":9,"metrics":["Accuracy","Micro F1"],"first_row_in_archive_order":{"model":"DSGCN","paper_title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","paper_url":"/paper/bridging-the-gap-between-spectral-and-spatial","paper_date":"2020-03-26","arxiv_id":"2003.11702","code_links":[{"title":"balcilar/Spectral-Designed-Graph-Convolutions","url":"https://github.com/balcilar/Spectral-Designed-Graph-Convolutions"},{"title":"sidneyarcidiacono/UnderstandingGCNs","url":"https://github.com/sidneyarcidiacono/UnderstandingGCNs"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cora-full-supervised","slug":"node-classification-on-cora-full-supervised","dataset":"Cora Full-supervised","dataset_url":"/dataset/cora","rows_in_archive":9,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GCNII","paper_title":"Simple and Deep Graph Convolutional Networks","paper_url":"/paper/simple-and-deep-graph-convolutional-networks-1","paper_date":"2020-07-04","arxiv_id":"2007.02133","code_links":[{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII/tree/master/PyG/ogbn-arxiv"},{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII"},{"title":"zhanglab-aim/cancer-net","url":"https://github.com/zhanglab-aim/cancer-net"},{"title":"tyxxzjpdez/GCNII-DropGroups","url":"https://github.com/tyxxzjpdez/GCNII-DropGroups"}],"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"]}}}},{"leaderboard":"/sota/node-classification-on-pattern-100k","slug":"node-classification-on-pattern-100k","dataset":"PATTERN 100k","dataset_url":null,"rows_in_archive":9,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"EGT","paper_title":"Global Self-Attention as a Replacement for Graph Convolution","paper_url":"/paper/edge-augmented-graph-transformers-global-self","paper_date":"2021-08-07","arxiv_id":"2108.03348","code_links":[{"title":"shamim-hussain/egt_pytorch","url":"https://github.com/shamim-hussain/egt_pytorch"},{"title":"shamim-hussain/egt","url":"https://github.com/shamim-hussain/egt"},{"title":"shamim-hussain/egt_triangular","url":"https://github.com/shamim-hussain/egt_triangular"}],"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"]}}}},{"leaderboard":"/sota/node-classification-on-yelpchi","slug":"node-classification-on-yelpchi","dataset":"Yelp-Fraud","dataset_url":"/dataset/yelpchi","rows_in_archive":9,"metrics":["AUC-ROC"],"first_row_in_archive_order":{"model":"LEX-GNN","paper_title":"LEX-GNN: Label-Exploring Graph Neural Network for Accurate Fraud Detection","paper_url":"/paper/lex-gnn-label-exploring-graph-neural-network","paper_date":"2024-10-21","arxiv_id":null,"code_links":[{"title":"wdhyun/LEX-GNN","url":"https://github.com/wdhyun/LEX-GNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-am","slug":"node-classification-on-am","dataset":"AM","dataset_url":null,"rows_in_archive":8,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"BoP","paper_title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","paper_url":"/paper/from-primes-to-paths-enabling-fast-multi","paper_date":"2024-11-17","arxiv_id":"2411.11149","code_links":[{"title":"kbogas/PAM_BoP","url":"https://github.com/kbogas/PAM_BoP"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-facebook","slug":"node-classification-on-facebook","dataset":"Facebook","dataset_url":null,"rows_in_archive":8,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GNNMoE(GCN-like P)","paper_title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","paper_url":"/paper/mixture-of-experts-meets-decoupled-message","paper_date":"2024-12-11","arxiv_id":"2412.08193","code_links":[{"title":"GISec-Team/GNNMoE","url":"https://github.com/GISec-Team/GNNMoE"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-flickr","slug":"node-classification-on-flickr","dataset":"Flickr","dataset_url":"/dataset/flickr30k","rows_in_archive":8,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GCN+GAugM (Zhao et al., 2021)","paper_title":"Data Augmentation for Graph Neural Networks","paper_url":"/paper/data-augmentation-for-graph-neural-networks","paper_date":"2020-06-11","arxiv_id":"2006.06830","code_links":[{"title":"zhao-tong/GAug","url":"https://github.com/zhao-tong/GAug"},{"title":"andyjzhao/wsdm23-gsr","url":"https://github.com/andyjzhao/wsdm23-gsr"}],"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/data-augmentation-for-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.06830","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06830"}},"official":{"repos":["zhao-tong/GAug"],"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/node-classification-on-aifb","slug":"node-classification-on-aifb","dataset":"AIFB","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"R-GCN","paper_title":"Modeling Relational Data with Graph Convolutional Networks","paper_url":"/paper/modeling-relational-data-with-graph","paper_date":"2017-03-17","arxiv_id":"1703.06103","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/rgcn"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/rgcn-hetero"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/rgcn"},{"title":"tkipf/gae","url":"https://github.com/tkipf/gae"},{"title":"Microsoft/gated-graph-neural-network-samples","url":"https://github.com/Microsoft/gated-graph-neural-network-samples"},{"title":"tkipf/relational-gcn","url":"https://github.com/tkipf/relational-gcn"},{"title":"MichSchli/RelationPrediction","url":"https://github.com/MichSchli/RelationPrediction"},{"title":"INK-USC/RE-Net","url":"https://github.com/INK-USC/RE-Net"},{"title":"INK-USC/MHGRN","url":"https://github.com/INK-USC/MHGRN"},{"title":"shijx12/kqapro_baselines","url":"https://github.com/shijx12/kqapro_baselines"},{"title":"thiviyanT/torch-rgcn","url":"https://github.com/thiviyanT/torch-rgcn"},{"title":"berlincho/RGCN-pytorch","url":"https://github.com/berlincho/RGCN-pytorch"},{"title":"masakicktashiro/rgcn_pytorch_implementation","url":"https://github.com/masakicktashiro/rgcn_pytorch_implementation"},{"title":"dglai/wsdm2022-challenge","url":"https://github.com/dglai/wsdm2022-challenge"},{"title":"predict-idlab/RR-GCN","url":"https://github.com/predict-idlab/RR-GCN"},{"title":"giuseppefutia/semi","url":"https://github.com/giuseppefutia/semi"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"anilakash/indkgc","url":"https://github.com/anilakash/indkgc"},{"title":"toooooodo/rgcn-linkprediction","url":"https://github.com/toooooodo/rgcn-linkprediction"},{"title":"JiabenLi/rgcn_paddlepaddle","url":"https://github.com/JiabenLi/rgcn_paddlepaddle"},{"title":"kracr/document-level-relation-extraction","url":"https://github.com/kracr/document-level-relation-extraction"},{"title":"susurrant/flow-imputation","url":"https://github.com/susurrant/flow-imputation"},{"title":"susurrant/spatial-interaction-modeling","url":"https://github.com/susurrant/spatial-interaction-modeling"},{"title":"parkererickson/crunchBaseGraph","url":"https://github.com/parkererickson/crunchBaseGraph"},{"title":"chalothon/Graph-Convolutional-Networks-for-Relational-Link-Prediction","url":"https://github.com/chalothon/Graph-Convolutional-Networks-for-Relational-Link-Prediction"},{"title":"QustKcz/relational-GCN","url":"https://github.com/QustKcz/relational-GCN"},{"title":"yangyucheng000/Papers","url":"https://github.com/yangyucheng000/Papers/tree/main/MindSpore-Retrieval-augmented"}],"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"]}}}},{"leaderboard":"/sota/node-classification-on-amz-comp","slug":"node-classification-on-amz-comp","dataset":"AMZ Comp","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"HH-GCN","paper_title":"Half-Hop: A graph upsampling approach for slowing down message passing","paper_url":"/paper/half-hop-a-graph-upsampling-approach-for","paper_date":"2023-08-17","arxiv_id":"2308.09198","code_links":[{"title":"nerdslab/halfhop","url":"https://github.com/nerdslab/halfhop"}],"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/half-hop-a-graph-upsampling-approach-for#ran","syntology_url":"https://syntology.ai/paper/2308.09198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09198"}},"official":{"repos":["nerdslab/halfhop"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}}},{"leaderboard":"/sota/node-classification-on-bgs","slug":"node-classification-on-bgs","dataset":"BGS","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SCENE","paper_title":"SCENE: Reasoning about Traffic Scenes using Heterogeneous Graph Neural Networks","paper_url":"/paper/scene-reasoning-about-traffic-scenes-using","paper_date":"2023-01-09","arxiv_id":"2301.03512","code_links":[{"title":"schmidt-ju/scene","url":"https://github.com/schmidt-ju/scene"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-brazil-air-traffic","slug":"node-classification-on-brazil-air-traffic","dataset":"Brazil Air-Traffic","dataset_url":"/dataset/brazil-air-traffic","rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"UGT","paper_title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","paper_url":"/paper/transitivity-preserving-graph-representation","paper_date":"2023-08-18","arxiv_id":"2308.09517","code_links":[{"title":"nslab-cuk/unified-graph-transformer","url":"https://github.com/nslab-cuk/unified-graph-transformer"},{"title":"nslab-cuk/community-aware-graph-transformer","url":"https://github.com/nslab-cuk/community-aware-graph-transformer"},{"title":"nslab-cuk/literalkg","url":"https://github.com/nslab-cuk/literalkg"}],"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"]}}}},{"leaderboard":"/sota/node-classification-on-citeseer-full","slug":"node-classification-on-citeseer-full","dataset":"Citeseer Full-supervised","dataset_url":"/dataset/citeseer","rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"IncepGCN+DropEdge","paper_title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","paper_url":"/paper/the-truly-deep-graph-convolutional-networks","paper_date":"2019-07-25","arxiv_id":"1907.10903","code_links":[{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT"},{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT/tree/master/graphsaint/open_graph_benchmark"},{"title":"DropEdge/DropEdge","url":"https://github.com/DropEdge/DropEdge"},{"title":"chr26195/pmlp","url":"https://github.com/chr26195/pmlp"},{"title":"zjunet/dropmessage","url":"https://github.com/zjunet/dropmessage"},{"title":"luckytiger123/dropmessage","url":"https://github.com/luckytiger123/dropmessage"},{"title":"sandl99/KGraph","url":"https://github.com/sandl99/KGraph"}],"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/the-truly-deep-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/1907.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10903"}},"official":{"repos":["DropEdge/DropEdge"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"leaderboard":"/sota/node-classification-on-europe-air-traffic","slug":"node-classification-on-europe-air-traffic","dataset":"Europe Air-Traffic","dataset_url":null,"rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"UGT","paper_title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","paper_url":"/paper/transitivity-preserving-graph-representation","paper_date":"2023-08-18","arxiv_id":"2308.09517","code_links":[{"title":"nslab-cuk/unified-graph-transformer","url":"https://github.com/nslab-cuk/unified-graph-transformer"},{"title":"nslab-cuk/community-aware-graph-transformer","url":"https://github.com/nslab-cuk/community-aware-graph-transformer"},{"title":"nslab-cuk/literalkg","url":"https://github.com/nslab-cuk/literalkg"}],"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"]}}}},{"leaderboard":"/sota/node-classification-on-pokec","slug":"node-classification-on-pokec","dataset":"pokec","dataset_url":null,"rows_in_archive":7,"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/node-classification-on-pubmed-full-supervised","slug":"node-classification-on-pubmed-full-supervised","dataset":"Pubmed Full-supervised","dataset_url":"/dataset/pubmed","rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphSAGE+DropEdge","paper_title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","paper_url":"/paper/the-truly-deep-graph-convolutional-networks","paper_date":"2019-07-25","arxiv_id":"1907.10903","code_links":[{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT"},{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT/tree/master/graphsaint/open_graph_benchmark"},{"title":"DropEdge/DropEdge","url":"https://github.com/DropEdge/DropEdge"},{"title":"chr26195/pmlp","url":"https://github.com/chr26195/pmlp"},{"title":"zjunet/dropmessage","url":"https://github.com/zjunet/dropmessage"},{"title":"luckytiger123/dropmessage","url":"https://github.com/luckytiger123/dropmessage"},{"title":"sandl99/KGraph","url":"https://github.com/sandl99/KGraph"}],"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/the-truly-deep-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/1907.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10903"}},"official":{"repos":["DropEdge/DropEdge"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"leaderboard":"/sota/node-classification-on-roman-empire","slug":"node-classification-on-roman-empire","dataset":"roman-empire","dataset_url":"/dataset/roman-empire","rows_in_archive":7,"metrics":["Accuracy (% )"],"first_row_in_archive_order":{"model":"Polynormer","paper_title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","paper_url":"/paper/polynormer-polynomial-expressive-graph","paper_date":"2024-03-02","arxiv_id":"2403.01232","code_links":[{"title":"cornell-zhang/Polynormer","url":"https://github.com/cornell-zhang/Polynormer/tree/master/large_graph_exp"},{"title":"cornell-zhang/polynormer","url":"https://github.com/cornell-zhang/polynormer"}],"syntology":{"n":8,"n_ran":5,"n_constructed":2,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/polynormer-polynomial-expressive-graph#ran","syntology_url":"https://syntology.ai/paper/2403.01232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01232"}},"official":{"repos":["cornell-zhang/polynormer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-usa-air-traffic","slug":"node-classification-on-usa-air-traffic","dataset":"USA Air-Traffic","dataset_url":"/dataset/usa-air-traffic","rows_in_archive":7,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"UGT","paper_title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","paper_url":"/paper/transitivity-preserving-graph-representation","paper_date":"2023-08-18","arxiv_id":"2308.09517","code_links":[{"title":"nslab-cuk/unified-graph-transformer","url":"https://github.com/nslab-cuk/unified-graph-transformer"},{"title":"nslab-cuk/community-aware-graph-transformer","url":"https://github.com/nslab-cuk/community-aware-graph-transformer"},{"title":"nslab-cuk/literalkg","url":"https://github.com/nslab-cuk/literalkg"}],"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"]}}}},{"leaderboard":"/sota/node-classification-on-amazon-fraud","slug":"node-classification-on-amazon-fraud","dataset":"Amazon-Fraud","dataset_url":"/dataset/amazon-fraud","rows_in_archive":6,"metrics":["AUC-ROC"],"first_row_in_archive_order":{"model":"LEX-GNN","paper_title":"LEX-GNN: Label-Exploring Graph Neural Network for Accurate Fraud Detection","paper_url":"/paper/lex-gnn-label-exploring-graph-neural-network","paper_date":"2024-10-21","arxiv_id":null,"code_links":[{"title":"wdhyun/LEX-GNN","url":"https://github.com/wdhyun/LEX-GNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-blogcatalog-1","slug":"node-classification-on-blogcatalog-1","dataset":"BlogCatalog","dataset_url":null,"rows_in_archive":6,"metrics":["Accuracy","Macro-F1"],"first_row_in_archive_order":{"model":"ISNE","paper_title":"Unsupervised Graph Representation Learning with Inductive Shallow Node Embedding","paper_url":"/paper/unsupervised-graph-representation-learning","paper_date":"2024-07-12","arxiv_id":null,"code_links":[{"title":"ricsi98/inductive-shallow-node-embedding","url":"https://github.com/ricsi98/inductive-shallow-node-embedding"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-dblp","slug":"node-classification-on-dblp","dataset":"DBLP","dataset_url":"/dataset/dblp","rows_in_archive":6,"metrics":["Accuracy","Micro F1","Inference Time (ms)","Macro F1"],"first_row_in_archive_order":{"model":"GRACE","paper_title":"Deep Graph Contrastive Representation Learning","paper_url":"/paper/deep-graph-contrastive-representation","paper_date":"2020-06-07","arxiv_id":"2006.04131","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/grace"},{"title":"CRIPAC-DIG/GRACE","url":"https://github.com/CRIPAC-DIG/GRACE"},{"title":"ycremar/DIG-SSL","url":"https://github.com/ycremar/DIG-SSL"}],"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":1,"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/deep-graph-contrastive-representation#ran","syntology_url":"https://syntology.ai/paper/2006.04131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04131"}},"official":{"repos":["CRIPAC-DIG/GRACE"],"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"]}}}},{"leaderboard":"/sota/node-classification-on-mutag","slug":"node-classification-on-mutag","dataset":"MUTAG","dataset_url":"/dataset/mutag","rows_in_archive":6,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"BoP","paper_title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","paper_url":"/paper/from-primes-to-paths-enabling-fast-multi","paper_date":"2024-11-17","arxiv_id":"2411.11149","code_links":[{"title":"kbogas/PAM_BoP","url":"https://github.com/kbogas/PAM_BoP"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-wiki-cs","slug":"node-classification-on-wiki-cs","dataset":"Wiki-CS","dataset_url":"/dataset/wiki-cs","rows_in_archive":6,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CGT","paper_title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","paper_url":"/paper/mitigating-degree-biases-in-message-passing","paper_date":"2023-12-28","arxiv_id":"2312.16788","code_links":[{"title":"nslab-cuk/community-aware-graph-transformer","url":"https://github.com/nslab-cuk/community-aware-graph-transformer"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-wiki-vote","slug":"node-classification-on-wiki-vote","dataset":"Wiki-Vote","dataset_url":null,"rows_in_archive":6,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"DEMO-Net(weight)","paper_title":"DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph Classification","paper_url":"/paper/demo-net-degree-specific-graph-neural","paper_date":"2019-06-05","arxiv_id":"1906.02319","code_links":[{"title":"jwu4sml/DEMO-Net","url":"https://github.com/jwu4sml/DEMO-Net"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-wikipedia","slug":"node-classification-on-wikipedia","dataset":"Wikipedia","dataset_url":null,"rows_in_archive":6,"metrics":["Macro-F1","Accuracy"],"first_row_in_archive_order":{"model":"GraphGAN","paper_title":"GraphGAN: Graph Representation Learning with Generative Adversarial Nets","paper_url":"/paper/graphgan-graph-representation-learning-with","paper_date":"2017-11-22","arxiv_id":"1711.08267","code_links":[{"title":"hwwang55/GraphGAN","url":"https://github.com/hwwang55/GraphGAN"},{"title":"liutongyang/GraphGAN-pytorch","url":"https://github.com/liutongyang/GraphGAN-pytorch"},{"title":"shuo-git/GraphGAN","url":"https://github.com/shuo-git/GraphGAN"},{"title":"hyunjin72/GraphGAN-PyTorch","url":"https://github.com/hyunjin72/GraphGAN-PyTorch"},{"title":"liuxinkai94/Graph-embedding","url":"https://github.com/liuxinkai94/Graph-embedding"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-amz-computers","slug":"node-classification-on-amz-computers","dataset":"AMZ Computers","dataset_url":"/dataset/amz-computers","rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCGCN","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-blogcatalog","slug":"node-classification-on-blogcatalog","dataset":"Eximtradedata","dataset_url":null,"rows_in_archive":5,"metrics":["Accuracy","Macro-F1","Macro F1","Micro F1"],"first_row_in_archive_order":{"model":"Struc2vec","paper_title":"struc2vec: Learning Node Representations from Structural Identity","paper_url":"/paper/struc2vec-learning-node-representations-from","paper_date":"2017-04-11","arxiv_id":"1704.03165","code_links":[{"title":"shenweichen/GraphEmbedding","url":"https://github.com/shenweichen/GraphEmbedding"},{"title":"leoribeiro/struc2vec","url":"https://github.com/leoribeiro/struc2vec"},{"title":"snap-stanford/graphwave","url":"https://github.com/snap-stanford/graphwave"},{"title":"liuxinkai94/Graph-embedding","url":"https://github.com/liuxinkai94/Graph-embedding"},{"title":"zehong-wang/subgraph-pooling","url":"https://github.com/zehong-wang/subgraph-pooling"}],"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":0,"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/struc2vec-learning-node-representations-from#ran","syntology_url":"https://syntology.ai/paper/1704.03165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.03165"}},"official":{"repos":["leoribeiro/struc2vec"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"leaderboard":"/sota/node-classification-on-cora-full","slug":"node-classification-on-cora-full","dataset":"Cora Full","dataset_url":null,"rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCSAGE","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-log-angeles","slug":"node-classification-on-log-angeles","dataset":"Log Angeles","dataset_url":"/dataset/city-networks","rows_in_archive":5,"metrics":["Average Top-1 Accuracy"],"first_row_in_archive_order":{"model":"IM-GCN","paper_title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","paper_url":"/paper/improving-the-effective-receptive-field-of","paper_date":"2025-05-29","arxiv_id":"2505.23185","code_links":[{"title":"bgu-cs-vil/im-mpnn","url":"https://github.com/bgu-cs-vil/im-mpnn"}],"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":0,"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/improving-the-effective-receptive-field-of#ran","syntology_url":"https://syntology.ai/paper/2505.23185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23185"}},"official":{"repos":["bgu-cs-vil/im-mpnn"],"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/node-classification-on-london","slug":"node-classification-on-london","dataset":"London","dataset_url":"/dataset/city-networks","rows_in_archive":5,"metrics":["Average Top-1 Accuracy"],"first_row_in_archive_order":{"model":"IM-GCN","paper_title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","paper_url":"/paper/improving-the-effective-receptive-field-of","paper_date":"2025-05-29","arxiv_id":"2505.23185","code_links":[{"title":"bgu-cs-vil/im-mpnn","url":"https://github.com/bgu-cs-vil/im-mpnn"}],"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":0,"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/improving-the-effective-receptive-field-of#ran","syntology_url":"https://syntology.ai/paper/2505.23185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23185"}},"official":{"repos":["bgu-cs-vil/im-mpnn"],"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/node-classification-on-paris","slug":"node-classification-on-paris","dataset":"Paris","dataset_url":"/dataset/city-networks","rows_in_archive":5,"metrics":["Average Top-1 Accuracy"],"first_row_in_archive_order":{"model":"IM-GCN","paper_title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","paper_url":"/paper/improving-the-effective-receptive-field-of","paper_date":"2025-05-29","arxiv_id":"2505.23185","code_links":[{"title":"bgu-cs-vil/im-mpnn","url":"https://github.com/bgu-cs-vil/im-mpnn"}],"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":0,"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/improving-the-effective-receptive-field-of#ran","syntology_url":"https://syntology.ai/paper/2505.23185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23185"}},"official":{"repos":["bgu-cs-vil/im-mpnn"],"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/node-classification-on-placenta","slug":"node-classification-on-placenta","dataset":"Placenta","dataset_url":"/dataset/placenta","rows_in_archive":5,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"GraphSAGE","paper_title":"A New Graph Node Classification Benchmark: Learning Structure from Histology Cell Graphs","paper_url":"/paper/a-new-graph-node-classification-benchmark","paper_date":"2022-11-11","arxiv_id":"2211.06292","code_links":[{"title":"nellaker-group/placenta","url":"https://github.com/nellaker-group/placenta"}],"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-new-graph-node-classification-benchmark#ran","syntology_url":"https://syntology.ai/paper/2211.06292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.06292"}},"official":{"repos":["nellaker-group/placenta"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-shanghai","slug":"node-classification-on-shanghai","dataset":"Shanghai","dataset_url":"/dataset/city-networks","rows_in_archive":5,"metrics":["Average Top-1 Accuracy"],"first_row_in_archive_order":{"model":"IM-GCN","paper_title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","paper_url":"/paper/improving-the-effective-receptive-field-of","paper_date":"2025-05-29","arxiv_id":"2505.23185","code_links":[{"title":"bgu-cs-vil/im-mpnn","url":"https://github.com/bgu-cs-vil/im-mpnn"}],"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":0,"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/improving-the-effective-receptive-field-of#ran","syntology_url":"https://syntology.ai/paper/2505.23185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23185"}},"official":{"repos":["bgu-cs-vil/im-mpnn"],"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/node-classification-on-amazon-ratings","slug":"node-classification-on-amazon-ratings","dataset":"amazon-ratings","dataset_url":"/dataset/amazon-ratings","rows_in_archive":4,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"GAT","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","paper_url":"/paper/classic-gnns-are-strong-baselines-reassessing","paper_date":"2024-06-13","arxiv_id":"2406.08993","code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}],"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/classic-gnns-are-strong-baselines-reassessing#ran","syntology_url":"https://syntology.ai/paper/2406.08993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08993"}},"official":{"repos":["LUOyk1999/tunedGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-ava","slug":"node-classification-on-ava","dataset":"AVA","dataset_url":"/dataset/ava","rows_in_archive":4,"metrics":["mAP"],"first_row_in_archive_order":{"model":"ASDNet [ASDNet_ICCV2021]","paper_title":"Learning Long-Term Spatial-Temporal Graphs for Active Speaker Detection","paper_url":"/paper/learning-long-term-spatial-temporal-graphs","paper_date":"2022-07-15","arxiv_id":"2207.07783","code_links":[{"title":"sra2/spell","url":"https://github.com/sra2/spell"},{"title":"kylemin/SPELL","url":"https://github.com/kylemin/SPELL"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-chameleon-48-32-20","slug":"node-classification-on-chameleon-48-32-20","dataset":"Chameleon (48%/32%/20% fixed splits)","dataset_url":"/dataset/chameleon-48-32-20-fixed-splits","rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GREAD-BS","paper_title":"GREAD: Graph Neural Reaction-Diffusion Networks","paper_url":"/paper/gread-graph-neural-reaction-diffusion","paper_date":"2022-11-25","arxiv_id":"2211.14208","code_links":[{"title":"jeongwhanchoi/gread","url":"https://github.com/jeongwhanchoi/gread"}],"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gread-graph-neural-reaction-diffusion#ran","syntology_url":"https://syntology.ai/paper/2211.14208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14208"}},"official":{"repos":["jeongwhanchoi/gread"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}}},{"leaderboard":"/sota/node-classification-on-cora-full-with-public","slug":"node-classification-on-cora-full-with-public","dataset":"Cora Full with Public Split","dataset_url":null,"rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CoLinkDist","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_url":"/paper/distilling-self-knowledge-from-contrastive","paper_date":"2021-06-16","arxiv_id":"2106.08541","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"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":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/distilling-self-knowledge-from-contrastive#ran","syntology_url":"https://syntology.ai/paper/2106.08541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08541"}},"official":{"repos":["cf020031308/LinkDist"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}}},{"leaderboard":"/sota/node-classification-on-mag-scholar-c","slug":"node-classification-on-mag-scholar-c","dataset":"MAG-scholar-C","dataset_url":"/dataset/mag-scholar-c-1","rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"FastGCN","paper_title":"GRAND+: Scalable Graph Random Neural Networks","paper_url":"/paper/grand-scalable-graph-random-neural-networks","paper_date":"2022-03-12","arxiv_id":"2203.06389","code_links":[{"title":"wzfhaha/grand-plus","url":"https://github.com/wzfhaha/grand-plus"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-mag240m-lsc","slug":"node-classification-on-mag240m-lsc","dataset":"MAG240M-LSC","dataset_url":"/dataset/ogb-lsc","rows_in_archive":4,"metrics":["Test Accuracy","Validation Accuracy"],"first_row_in_archive_order":{"model":"R-GraphSAGE (NS)","paper_title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","paper_url":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","paper_date":"2021-03-17","arxiv_id":"2103.09430","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ogb_lsc"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb"},{"title":"graphcore/ogb-lsc-pcqm4mv2","url":"https://github.com/graphcore/ogb-lsc-pcqm4mv2"},{"title":"shamim-hussain/egt","url":"https://github.com/shamim-hussain/egt"},{"title":"graphcore/distributed-kge-poplar","url":"https://github.com/graphcore/distributed-kge-poplar"},{"title":"lars-research/3d-pgt","url":"https://github.com/lars-research/3d-pgt"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-minesweeper","slug":"node-classification-on-minesweeper","dataset":"minesweeper","dataset_url":"/dataset/minesweeper","rows_in_archive":4,"metrics":["AUCROC"],"first_row_in_archive_order":{"model":"GCN","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","paper_url":"/paper/classic-gnns-are-strong-baselines-reassessing","paper_date":"2024-06-13","arxiv_id":"2406.08993","code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}],"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/classic-gnns-are-strong-baselines-reassessing#ran","syntology_url":"https://syntology.ai/paper/2406.08993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08993"}},"official":{"repos":["LUOyk1999/tunedGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-mumin-large","slug":"node-classification-on-mumin-large","dataset":"MuMiN-large","dataset_url":"/dataset/mumin-large","rows_in_archive":4,"metrics":["Claim Classification Macro-F1","Tweet Classification Macro-F1"],"first_row_in_archive_order":{"model":"HeteroGraphSAGE","paper_title":"MuMiN: A Large-Scale Multilingual Multimodal Fact-Checked Misinformation Social Network Dataset","paper_url":"/paper/mumin-a-large-scale-multilingual-multimodal","paper_date":"2022-02-23","arxiv_id":"2202.11684","code_links":[{"title":"MuMiN-dataset/mumin-build","url":"https://github.com/MuMiN-dataset/mumin-build"},{"title":"MuMiN-dataset/mumin-baseline","url":"https://github.com/MuMiN-dataset/mumin-baseline"},{"title":"MuMiN-dataset/mumin-trawl","url":"https://github.com/MuMiN-dataset/mumin-trawl"}],"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/mumin-a-large-scale-multilingual-multimodal#ran","syntology_url":"https://syntology.ai/paper/2202.11684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11684"}},"official":{"repos":["MuMiN-dataset/mumin-build"],"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/node-classification-on-mumin-medium","slug":"node-classification-on-mumin-medium","dataset":"MuMiN-medium","dataset_url":"/dataset/mumin-medium","rows_in_archive":4,"metrics":["Claim Classification Macro-F1","Tweet Classification Macro-F1"],"first_row_in_archive_order":{"model":"HeteroGraphSAGE","paper_title":"MuMiN: A Large-Scale Multilingual Multimodal Fact-Checked Misinformation Social Network Dataset","paper_url":"/paper/mumin-a-large-scale-multilingual-multimodal","paper_date":"2022-02-23","arxiv_id":"2202.11684","code_links":[{"title":"MuMiN-dataset/mumin-build","url":"https://github.com/MuMiN-dataset/mumin-build"},{"title":"MuMiN-dataset/mumin-baseline","url":"https://github.com/MuMiN-dataset/mumin-baseline"},{"title":"MuMiN-dataset/mumin-trawl","url":"https://github.com/MuMiN-dataset/mumin-trawl"}],"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/mumin-a-large-scale-multilingual-multimodal#ran","syntology_url":"https://syntology.ai/paper/2202.11684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11684"}},"official":{"repos":["MuMiN-dataset/mumin-build"],"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/node-classification-on-mumin-small","slug":"node-classification-on-mumin-small","dataset":"MuMiN-small","dataset_url":"/dataset/mumin-small","rows_in_archive":4,"metrics":["Claim Classification Macro-F1","Tweet Classification Macro-F1"],"first_row_in_archive_order":{"model":"LaBSE","paper_title":"MuMiN: A Large-Scale Multilingual Multimodal Fact-Checked Misinformation Social Network Dataset","paper_url":"/paper/mumin-a-large-scale-multilingual-multimodal","paper_date":"2022-02-23","arxiv_id":"2202.11684","code_links":[{"title":"MuMiN-dataset/mumin-build","url":"https://github.com/MuMiN-dataset/mumin-build"},{"title":"MuMiN-dataset/mumin-baseline","url":"https://github.com/MuMiN-dataset/mumin-baseline"},{"title":"MuMiN-dataset/mumin-trawl","url":"https://github.com/MuMiN-dataset/mumin-trawl"}],"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/mumin-a-large-scale-multilingual-multimodal#ran","syntology_url":"https://syntology.ai/paper/2202.11684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11684"}},"official":{"repos":["MuMiN-dataset/mumin-build"],"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/node-classification-on-nell","slug":"node-classification-on-nell","dataset":"NELL","dataset_url":"/dataset/nell","rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"DFNet-ATT","paper_title":"DFNets: Spectral CNNs for Graphs with Feedback-Looped Filters","paper_url":"/paper/dfnets-spectral-cnns-for-graphs-with-feedback","paper_date":"2019-10-24","arxiv_id":"1910.10866","code_links":[{"title":"wokas36/DFNets","url":"https://github.com/wokas36/DFNets"}],"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/dfnets-spectral-cnns-for-graphs-with-feedback#ran","syntology_url":"https://syntology.ai/paper/1910.10866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10866"}},"official":{"repos":["wokas36/DFNets"],"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/node-classification-on-squirrel-48-32-20","slug":"node-classification-on-squirrel-48-32-20","dataset":"Squirrel (48%/32%/20% fixed splits)","dataset_url":"/dataset/squirrel-48-32-20-fixed-splits","rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GREAD-BS","paper_title":"GREAD: Graph Neural Reaction-Diffusion Networks","paper_url":"/paper/gread-graph-neural-reaction-diffusion","paper_date":"2022-11-25","arxiv_id":"2211.14208","code_links":[{"title":"jeongwhanchoi/gread","url":"https://github.com/jeongwhanchoi/gread"}],"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gread-graph-neural-reaction-diffusion#ran","syntology_url":"https://syntology.ai/paper/2211.14208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14208"}},"official":{"repos":["jeongwhanchoi/gread"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}}},{"leaderboard":"/sota/node-classification-on-tolokers","slug":"node-classification-on-tolokers","dataset":"tolokers","dataset_url":"/dataset/tolokers","rows_in_archive":4,"metrics":["AUCROC"],"first_row_in_archive_order":{"model":"Polynormer","paper_title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","paper_url":"/paper/polynormer-polynomial-expressive-graph","paper_date":"2024-03-02","arxiv_id":"2403.01232","code_links":[{"title":"cornell-zhang/Polynormer","url":"https://github.com/cornell-zhang/Polynormer/tree/master/large_graph_exp"},{"title":"cornell-zhang/polynormer","url":"https://github.com/cornell-zhang/polynormer"}],"syntology":{"n":8,"n_ran":5,"n_constructed":2,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/polynormer-polynomial-expressive-graph#ran","syntology_url":"https://syntology.ai/paper/2403.01232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01232"}},"official":{"repos":["cornell-zhang/polynormer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-cornell-48-32-20-fixed","slug":"node-classification-on-cornell-48-32-20-fixed","dataset":"Cornell (48%/32%/20% fixed splits)","dataset_url":"/dataset/cornell-48-32-20-fixed-splits","rows_in_archive":3,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GREAD-AC","paper_title":"GREAD: Graph Neural Reaction-Diffusion Networks","paper_url":"/paper/gread-graph-neural-reaction-diffusion","paper_date":"2022-11-25","arxiv_id":"2211.14208","code_links":[{"title":"jeongwhanchoi/gread","url":"https://github.com/jeongwhanchoi/gread"}],"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gread-graph-neural-reaction-diffusion#ran","syntology_url":"https://syntology.ai/paper/2211.14208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14208"}},"official":{"repos":["jeongwhanchoi/gread"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}}},{"leaderboard":"/sota/node-classification-on-ms-academic","slug":"node-classification-on-ms-academic","dataset":"MS ACADEMIC","dataset_url":null,"rows_in_archive":3,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"APPNP","paper_title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","paper_url":"/paper/predict-then-propagate-graph-neural-networks","paper_date":"2018-10-14","arxiv_id":"1810.05997","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/appnp"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/appnp"},{"title":"benedekrozemberczki/APPNP","url":"https://github.com/benedekrozemberczki/APPNP"},{"title":"klicperajo/ppnp","url":"https://github.com/klicperajo/ppnp"},{"title":"mahequn001/graphlearning","url":"https://github.com/mahequn001/graphlearning/tree/master/model_zoo/appnp"}],"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"11 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/predict-then-propagate-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.05997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.05997"}},"official":{"repos":["klicperajo/ppnp"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-questions","slug":"node-classification-on-questions","dataset":"questions","dataset_url":"/dataset/questions","rows_in_archive":3,"metrics":["AUCROC"],"first_row_in_archive_order":{"model":"NID","paper_title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","paper_url":"/paper/structure-aware-semantic-node-identifiers-for","paper_date":"2024-05-26","arxiv_id":"2405.16435","code_links":[{"title":"LUOyk1999/NodeID","url":"https://github.com/LUOyk1999/NodeID"}],"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":3,"n_honours":1,"n_violates":2,"n_no_contract":2,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 2 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/structure-aware-semantic-node-identifiers-for#ran","syntology_url":"https://syntology.ai/paper/2405.16435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16435"}},"official":{"repos":["LUOyk1999/NodeID"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-amplus","slug":"node-classification-on-amplus","dataset":"AMPLUS","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"RR-GCN-PPV","paper_title":"R-GCN: The R Could Stand for Random","paper_url":"/paper/r-gcn-the-r-could-stand-for-random","paper_date":"2022-03-04","arxiv_id":"2203.02424","code_links":[{"title":"predict-idlab/RR-GCN","url":"https://github.com/predict-idlab/RR-GCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-chameleon-60-20-20-1","slug":"node-classification-on-chameleon-60-20-20-1","dataset":"Chameleon(60%/20%/20% random splits)","dataset_url":"/dataset/chameleon-60-20-20-random-splits-1","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCSAGE","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer-fixed-20-node","slug":"node-classification-on-citeseer-fixed-20-node","dataset":"Citeseer: fixed 20 node per class","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SDSS-GAT","paper_title":"Multi-task Self-distillation for Graph-based Semi-Supervised Learning","paper_url":"/paper/multi-task-self-distillation-for-graph-based","paper_date":"2021-12-02","arxiv_id":"2112.01174","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-coauthor-phy","slug":"node-classification-on-coauthor-phy","dataset":"Coauthor Phy","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GCN-LPA","paper_title":"Unifying Graph Convolutional Neural Networks and Label Propagation","paper_url":"/paper/unifying-graph-convolutional-neural-networks-1","paper_date":"2020-02-17","arxiv_id":"2002.06755","code_links":[{"title":"hwwang55/GCN-LPA","url":"https://github.com/hwwang55/GCN-LPA"},{"title":"achalagarwal/gcn-lpa","url":"https://github.com/achalagarwal/gcn-lpa"}],"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":7,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/unifying-graph-convolutional-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2002.06755","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06755"}},"official":null}}},{"leaderboard":"/sota/node-classification-on-cora-fixed-10-node-per","slug":"node-classification-on-cora-fixed-10-node-per","dataset":"Cora: fixed 10 node per class","dataset_url":"/dataset/cora","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-tra-GCNII","paper_title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","paper_url":"/paper/extract-the-knowledge-of-graph-neural","paper_date":"2021-03-04","arxiv_id":"2103.02885","code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}],"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/extract-the-knowledge-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2103.02885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.02885"}},"official":{"repos":["BUPT-GAMMA/CPF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-cora-fixed-5-node-per","slug":"node-classification-on-cora-fixed-5-node-per","dataset":"Cora: fixed 5 node per class","dataset_url":"/dataset/cora","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-tra-APPNP","paper_title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","paper_url":"/paper/extract-the-knowledge-of-graph-neural","paper_date":"2021-03-04","arxiv_id":"2103.02885","code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}],"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/extract-the-knowledge-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2103.02885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.02885"}},"official":{"repos":["BUPT-GAMMA/CPF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-crocodile","slug":"node-classification-on-crocodile","dataset":"Crocodile","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"LW-GCN","paper_title":"Label-Wise Graph Convolutional Network for Heterophilic Graphs","paper_url":"/paper/label-wise-message-passing-graph-neural","paper_date":"2021-10-15","arxiv_id":"2110.08128","code_links":[{"title":"enyandai/lwgcn","url":"https://github.com/enyandai/lwgcn"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-deezer-romania","slug":"node-classification-on-deezer-romania","dataset":"Deezer Romania","dataset_url":null,"rows_in_archive":2,"metrics":["Micro-F1"],"first_row_in_archive_order":{"model":"PairE","paper_title":"Graph Representation Learning Beyond Node and Homophily","paper_url":"/paper/graph-representation-learning-beyond-node-and","paper_date":"2022-03-03","arxiv_id":"2203.01564","code_links":[{"title":"syvail/PairE-Graph-Representation-Learning-Beyond-Node-and-Homophily","url":"https://github.com/syvail/PairE-Graph-Representation-Learning-Beyond-Node-and-Homophily"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-dmg777k","slug":"node-classification-on-dmg777k","dataset":"DMG777K","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"RR-GCN-PPV","paper_title":"R-GCN: The R Could Stand for Random","paper_url":"/paper/r-gcn-the-r-could-stand-for-random","paper_date":"2022-03-04","arxiv_id":"2203.02424","code_links":[{"title":"predict-idlab/RR-GCN","url":"https://github.com/predict-idlab/RR-GCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-dmgfull","slug":"node-classification-on-dmgfull","dataset":"DMGFULL","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"RR-GCN-PPV","paper_title":"R-GCN: The R Could Stand for Random","paper_url":"/paper/r-gcn-the-r-could-stand-for-random","paper_date":"2022-03-04","arxiv_id":"2203.02424","code_links":[{"title":"predict-idlab/RR-GCN","url":"https://github.com/predict-idlab/RR-GCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-mdgenre","slug":"node-classification-on-mdgenre","dataset":"MDGENRE","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"R-GCN","paper_title":"R-GCN: The R Could Stand for Random","paper_url":"/paper/r-gcn-the-r-could-stand-for-random","paper_date":"2022-03-04","arxiv_id":"2203.02424","code_links":[{"title":"predict-idlab/RR-GCN","url":"https://github.com/predict-idlab/RR-GCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-squirrel-60-20-20-1","slug":"node-classification-on-squirrel-60-20-20-1","dataset":"Squirrel(60%/20%/20% random splits)","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"NCSAGE","paper_title":"Clarify Confused Nodes via Separated Learning","paper_url":"/paper/clarify-confused-nodes-through-separated","paper_date":"2023-06-04","arxiv_id":"2306.02285","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-telegram-directed-1","slug":"node-classification-on-telegram-directed-1","dataset":"Telegram (Directed Graph label rate 60%)","dataset_url":null,"rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"ScaleNet","paper_title":"Scale Invariance of Graph Neural Networks","paper_url":"/paper/scale-invariance-of-graph-neural-networks","paper_date":"2024-11-28","arxiv_id":"2411.19392","code_links":[{"title":"qin87/scalenet","url":"https://github.com/qin87/scalenet"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-texas-48-32-20-fixed","slug":"node-classification-on-texas-48-32-20-fixed","dataset":"Texas (48%/32%/20% fixed splits)","dataset_url":"/dataset/texas-48-32-20-fixed-splits","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GREAD-F","paper_title":"GREAD: Graph Neural Reaction-Diffusion Networks","paper_url":"/paper/gread-graph-neural-reaction-diffusion","paper_date":"2022-11-25","arxiv_id":"2211.14208","code_links":[{"title":"jeongwhanchoi/gread","url":"https://github.com/jeongwhanchoi/gread"}],"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gread-graph-neural-reaction-diffusion#ran","syntology_url":"https://syntology.ai/paper/2211.14208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14208"}},"official":{"repos":["jeongwhanchoi/gread"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}}},{"leaderboard":"/sota/node-classification-on-twitch-gamers","slug":"node-classification-on-twitch-gamers","dataset":"twitch-gamers","dataset_url":"/dataset/twitch-gamers","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Dual-Net GNN","paper_title":"Feature Selection: Key to Enhance Node Classification with Graph Neural Networks","paper_url":"/paper/feature-selection-key-to-enhance-node","paper_date":"2023-01-25","arxiv_id":null,"code_links":[{"title":"sunilkmaurya/DualNetGNN_large","url":"https://github.com/sunilkmaurya/DualNetGNN_large"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-wiki","slug":"node-classification-on-wiki","dataset":"Wiki","dataset_url":"/dataset/wiki","rows_in_archive":2,"metrics":["AUC","Macro F1","Micro F1"],"first_row_in_archive_order":{"model":"DANMF","paper_title":"Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection","paper_url":"/paper/deep-autoencoder-like-nonnegative-matrix","paper_date":"2018-10-22","arxiv_id":null,"code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/DANMF","url":"https://github.com/benedekrozemberczki/DANMF"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-wiki-1","slug":"node-classification-on-wiki-1","dataset":"wiki","dataset_url":"/dataset/wiki","rows_in_archive":2,"metrics":["ACCURACY"],"first_row_in_archive_order":{"model":"A2DUG","paper_title":"A Simple and Scalable Graph Neural Network for Large Directed Graphs","paper_url":"/paper/why-using-either-aggregated-features-or","paper_date":"2023-06-14","arxiv_id":"2306.08274","code_links":[{"title":"seijimaekawa/a2dug","url":"https://github.com/seijimaekawa/a2dug"}],"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"10 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; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/why-using-either-aggregated-features-or#ran","syntology_url":"https://syntology.ai/paper/2306.08274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08274"}},"official":{"repos":["seijimaekawa/a2dug"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-wisconsin-48-32-20","slug":"node-classification-on-wisconsin-48-32-20","dataset":"Wisconsin (48%/32%/20% fixed splits)","dataset_url":"/dataset/wisconsin-48-32-20-fixed-splits","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GREAD-BS","paper_title":"GREAD: Graph Neural Reaction-Diffusion Networks","paper_url":"/paper/gread-graph-neural-reaction-diffusion","paper_date":"2022-11-25","arxiv_id":"2211.14208","code_links":[{"title":"jeongwhanchoi/gread","url":"https://github.com/jeongwhanchoi/gread"}],"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gread-graph-neural-reaction-diffusion#ran","syntology_url":"https://syntology.ai/paper/2211.14208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14208"}},"official":{"repos":["jeongwhanchoi/gread"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}}},{"leaderboard":"/sota/node-classification-on-youtube","slug":"node-classification-on-youtube","dataset":"YouTube","dataset_url":null,"rows_in_archive":2,"metrics":["Macro-F1@2%","Micro-F1@2%","runtime (s)"],"first_row_in_archive_order":{"model":"LINE","paper_title":"GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding","paper_url":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid","paper_date":"2019-03-02","arxiv_id":"1903.00757","code_links":[{"title":"DeepGraphLearning/graphvite","url":"https://github.com/DeepGraphLearning/graphvite"}],"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid#ran","syntology_url":"https://syntology.ai/paper/1903.00757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.00757"}},"official":null}}},{"leaderboard":"/sota/node-classification-on-20news","slug":"node-classification-on-20news","dataset":"20NEWS","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraRep","paper_title":"GraRep: Learning Graph Representations with Global Structural Information","paper_url":"/paper/grarep-learning-graph-representations-with","paper_date":"2015-10-17","arxiv_id":null,"code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GraRep","url":"https://github.com/benedekrozemberczki/GraRep"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-amazon2m","slug":"node-classification-on-amazon2m","dataset":"Amazon2M","dataset_url":null,"rows_in_archive":1,"metrics":["F1"],"first_row_in_archive_order":{"model":"Cluster-GCN","paper_title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","paper_url":"/paper/cluster-gcn-an-efficient-algorithm-for","paper_date":"2019-05-20","arxiv_id":"1905.07953","code_links":[{"title":"google-research/google-research","url":"https://github.com/google-research/google-research"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/cluster_gcn"},{"title":"benedekrozemberczki/ClusterGCN","url":"https://github.com/benedekrozemberczki/ClusterGCN"},{"title":"qitianwu/nodeformer","url":"https://github.com/qitianwu/nodeformer"},{"title":"NIRVANALAN/ClusterGCN_google-reseach","url":"https://github.com/NIRVANALAN/ClusterGCN_google-reseach"},{"title":"zhengjingwei/cluster_GCN","url":"https://github.com/zhengjingwei/cluster_GCN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-amz-computers-fixed-20","slug":"node-classification-on-amz-computers-fixed-20","dataset":"AMZ Computers: fixed 20 node per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SDSS-GCN","paper_title":"Multi-task Self-distillation for Graph-based Semi-Supervised Learning","paper_url":"/paper/multi-task-self-distillation-for-graph-based","paper_date":"2021-12-02","arxiv_id":"2112.01174","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-bgp","slug":"node-classification-on-bgp","dataset":"BGP","dataset_url":"/dataset/bgp","rows_in_archive":1,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"PathNet","paper_title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","paper_url":"/paper/beyond-homophily-structure-aware-path","paper_date":"2022-07-20","arxiv_id":null,"code_links":[{"title":"zjunet/PathNet","url":"https://github.com/zjunet/PathNet"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-bitcoin-alpha","slug":"node-classification-on-bitcoin-alpha","dataset":"Bitcoin-Alpha","dataset_url":null,"rows_in_archive":1,"metrics":["F1-score"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_url":"/paper/graphmix-regularized-training-of-graph-neural","paper_date":"2019-09-25","arxiv_id":"1909.11715","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-bitcoin-otc","slug":"node-classification-on-bitcoin-otc","dataset":"Bitcoin-OTC","dataset_url":null,"rows_in_archive":1,"metrics":["F1-score"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_url":"/paper/graphmix-regularized-training-of-graph-neural","paper_date":"2019-09-25","arxiv_id":"1909.11715","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-celltypegraph","slug":"node-classification-on-celltypegraph","dataset":"CellTypeGraph Benchmark","dataset_url":"/dataset/celltypegraph-benchmark","rows_in_archive":1,"metrics":["Top-1 accuracy","class-average Accuracy"],"first_row_in_archive_order":{"model":"plantcelltype-EdgeDeeperGCN","paper_title":"CellTypeGraph: A New Geometric Computer Vision Benchmark","paper_url":"/paper/celltypegraph-a-new-geometric-computer-vision","paper_date":"2022-05-17","arxiv_id":"2205.08166","code_links":[{"title":"hci-unihd/celltype-graph-benchmark","url":"https://github.com/hci-unihd/celltype-graph-benchmark"},{"title":"hci-unihd/plant-celltype","url":"https://github.com/hci-unihd/plant-celltype"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer-5-nodes-per","slug":"node-classification-on-citeseer-5-nodes-per","dataset":"CiteSeer: 5 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"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/node-classification-on-citeseer-random","slug":"node-classification-on-citeseer-random","dataset":"Citeseer random partition","dataset_url":"/dataset/citeseer","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_url":"/paper/graphmix-regularized-training-of-graph-neural","paper_date":"2019-09-25","arxiv_id":"1909.11715","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-citeseer-with-public-1","slug":"node-classification-on-citeseer-with-public-1","dataset":"CiteSeer with Public Split: fixed 5 nodes per class","dataset_url":"/dataset/citeseer","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_url":"/paper/graphmix-regularized-training-of-graph-neural","paper_date":"2019-09-25","arxiv_id":"1909.11715","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cora-5-nodes-per-class","slug":"node-classification-on-cora-5-nodes-per-class","dataset":"Cora: 5 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"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/node-classification-on-cora-fixed-20-nodes","slug":"node-classification-on-cora-fixed-20-nodes","dataset":"Cora: fixed 20 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SDSS-GCN","paper_title":"Multi-task Self-distillation for Graph-based Semi-Supervised Learning","paper_url":"/paper/multi-task-self-distillation-for-graph-based","paper_date":"2021-12-02","arxiv_id":"2112.01174","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-cora-random-partition","slug":"node-classification-on-cora-random-partition","dataset":"Cora random partition","dataset_url":"/dataset/cora","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_url":"/paper/graphmix-regularized-training-of-graph-neural","paper_date":"2019-09-25","arxiv_id":"1909.11715","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-dblp-20-nodes-per","slug":"node-classification-on-dblp-20-nodes-per","dataset":"DBLP: 20 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"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/node-classification-on-dblp-5-nodes-per-class","slug":"node-classification-on-dblp-5-nodes-per-class","dataset":"DBLP: 5 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"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/node-classification-on-deezer-croatia","slug":"node-classification-on-deezer-croatia","dataset":"Deezer Croatia","dataset_url":null,"rows_in_archive":1,"metrics":["Micro-F1"],"first_row_in_archive_order":{"model":"GEMSEC 2","paper_title":"GEMSEC: Graph Embedding with Self Clustering","paper_url":"/paper/gemsec-graph-embedding-with-self-clustering","paper_date":"2018-02-12","arxiv_id":"1802.03997","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GEMSEC","url":"https://github.com/benedekrozemberczki/GEMSEC"},{"title":"benedekrozemberczki/GRAF","url":"https://github.com/benedekrozemberczki/GRAF"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-deezer-hungary","slug":"node-classification-on-deezer-hungary","dataset":"Deezer Hungary","dataset_url":null,"rows_in_archive":1,"metrics":["Micro-F1"],"first_row_in_archive_order":{"model":"Smooth GEMSEC 2","paper_title":"GEMSEC: Graph Embedding with Self Clustering","paper_url":"/paper/gemsec-graph-embedding-with-self-clustering","paper_date":"2018-02-12","arxiv_id":"1802.03997","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GEMSEC","url":"https://github.com/benedekrozemberczki/GEMSEC"},{"title":"benedekrozemberczki/GRAF","url":"https://github.com/benedekrozemberczki/GRAF"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-electronics","slug":"node-classification-on-electronics","dataset":"Electronics","dataset_url":"/dataset/electronics","rows_in_archive":1,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"PathNet","paper_title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","paper_url":"/paper/beyond-homophily-structure-aware-path","paper_date":"2022-07-20","arxiv_id":null,"code_links":[{"title":"zjunet/PathNet","url":"https://github.com/zjunet/PathNet"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-film-48-32-20-fixed","slug":"node-classification-on-film-48-32-20-fixed","dataset":"Film(48%/32%/20% fixed splits)","dataset_url":"/dataset/film-48-32-20-fixed-splits","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GREAD-BS","paper_title":"GREAD: Graph Neural Reaction-Diffusion Networks","paper_url":"/paper/gread-graph-neural-reaction-diffusion","paper_date":"2022-11-25","arxiv_id":"2211.14208","code_links":[{"title":"jeongwhanchoi/gread","url":"https://github.com/jeongwhanchoi/gread"}],"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gread-graph-neural-reaction-diffusion#ran","syntology_url":"https://syntology.ai/paper/2211.14208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14208"}},"official":{"repos":["jeongwhanchoi/gread"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}}},{"leaderboard":"/sota/node-classification-on-nba","slug":"node-classification-on-nba","dataset":"NBA","dataset_url":"/dataset/nba","rows_in_archive":1,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"PathNet","paper_title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","paper_url":"/paper/beyond-homophily-structure-aware-path","paper_date":"2022-07-20","arxiv_id":null,"code_links":[{"title":"zjunet/PathNet","url":"https://github.com/zjunet/PathNet"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-ogbn-products","slug":"node-classification-on-ogbn-products","dataset":"ogbn-products","dataset_url":"/dataset/ogb","rows_in_archive":1,"metrics":["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/node-classification-on-ogbn-products-20-nodes","slug":"node-classification-on-ogbn-products-20-nodes","dataset":"ogbn-products: 20 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"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/node-classification-on-pubmed-5-nodes-per","slug":"node-classification-on-pubmed-5-nodes-per","dataset":"PubMed: 5 nodes per class","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"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/node-classification-on-pubmed-fixed-20-node","slug":"node-classification-on-pubmed-fixed-20-node","dataset":"Pubmed: fixed 20 node per class","dataset_url":"/dataset/pubmed","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SDSS-APPNP","paper_title":"Multi-task Self-distillation for Graph-based Semi-Supervised Learning","paper_url":"/paper/multi-task-self-distillation-for-graph-based","paper_date":"2021-12-02","arxiv_id":"2112.01174","code_links":[],"syntology":null}},{"leaderboard":"/sota/node-classification-on-pubmed-random","slug":"node-classification-on-pubmed-random","dataset":"Pubmed random partition","dataset_url":"/dataset/pubmed","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_url":"/paper/graphmix-regularized-training-of-graph-neural","paper_date":"2019-09-25","arxiv_id":"1909.11715","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"syntology":null}}],"datasets":[{"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/flickr30k","name":"Flickr30k","full_name":"Flickr30k","num_papers_in_archive":880},{"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/ppi","name":"PPI","full_name":"Protein-Protein Interactions (PPI)","num_papers_in_archive":309},{"url":"/dataset/mutag","name":"MUTAG","full_name":"","num_papers_in_archive":274},{"url":"/dataset/moleculenet","name":"MoleculeNet","full_name":"","num_papers_in_archive":240},{"url":"/dataset/dblp","name":"DBLP","full_name":"Citation Network Dataset","num_papers_in_archive":218},{"url":"/dataset/wiki-squirrel","name":"Wiki Squirrel","full_name":"Wikipedia Squirrel","num_papers_in_archive":208},{"url":"/dataset/pascal-voc","name":"PASCAL VOC","full_name":"PASCAL Visual Object Classes Challenge","num_papers_in_archive":198},{"url":"/dataset/nell","name":"NELL","full_name":"Never Ending Language Learning","num_papers_in_archive":177},{"url":"/dataset/cluster","name":"CLUSTER","full_name":"","num_papers_in_archive":159},{"url":"/dataset/pattern","name":"PATTERN","full_name":"","num_papers_in_archive":153},{"url":"/dataset/ava","name":"AVA","full_name":"Atomic Visual Actions","num_papers_in_archive":113},{"url":"/dataset/webkb","name":"WebKB","full_name":"WebKB","num_papers_in_archive":113},{"url":"/dataset/wiki-cs","name":"Wiki-CS","full_name":"","num_papers_in_archive":111},{"url":"/dataset/yelp","name":"Yelp","full_name":"","num_papers_in_archive":86},{"url":"/dataset/aminer","name":"AMiner","full_name":"","num_papers_in_archive":80},{"url":"/dataset/pascalvoc-sp","name":"Long Range Graph Benchmark (LRGB)","full_name":"","num_papers_in_archive":76},{"url":"/dataset/friendster","name":"Friendster","full_name":"","num_papers_in_archive":65},{"url":"/dataset/penn94","name":"Penn94","full_name":"","num_papers_in_archive":60},{"url":"/dataset/cornell","name":"Cornell","full_name":null,"num_papers_in_archive":54},{"url":"/dataset/roman-empire","name":"roman-empire","full_name":"","num_papers_in_archive":49},{"url":"/dataset/questions","name":"questions","full_name":"","num_papers_in_archive":46},{"url":"/dataset/tolokers","name":"tolokers","full_name":"","num_papers_in_archive":38},{"url":"/dataset/genius","name":"genius","full_name":"","num_papers_in_archive":37},{"url":"/dataset/biogrid","name":"BioGRID","full_name":"Biological General Repository for Interaction Datasets","num_papers_in_archive":34},{"url":"/dataset/minesweeper","name":"minesweeper","full_name":"","num_papers_in_archive":34},{"url":"/dataset/ogb-lsc","name":"OGB-LSC","full_name":"OGB Large-Scale Challenge","num_papers_in_archive":34},{"url":"/dataset/amazon-ratings","name":"amazon-ratings","full_name":"","num_papers_in_archive":33},{"url":"/dataset/twitch-gamers","name":"twitch-gamers","full_name":"","num_papers_in_archive":24},{"url":"/dataset/chameleon-48-32-20-fixed-splits","name":"Chameleon (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":20},{"url":"/dataset/film-60-20-20-random-splits","name":"Film (60%/20%/20% random splits)","full_name":"","num_papers_in_archive":19},{"url":"/dataset/squirrel-48-32-20-fixed-splits","name":"Squirrel (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":19},{"url":"/dataset/squirrel-60-20-20-random-splits","name":"Squirrel (60%/20%/20% random splits)","full_name":"","num_papers_in_archive":19},{"url":"/dataset/pubmed-60-20-20-random-splits","name":"PubMed (60%/20%/20% random splits)","full_name":"","num_papers_in_archive":18},{"url":"/dataset/yeast","name":"Yeast","full_name":"","num_papers_in_archive":18},{"url":"/dataset/chameleon-60-20-20-random-splits-1","name":"Chameleon(60%/20%/20% random splits)","full_name":"","num_papers_in_archive":17},{"url":"/dataset/cornell-48-32-20-fixed-splits","name":"Cornell (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":16},{"url":"/dataset/cornell-60-20-20-random-splits","name":"Cornell (60%/20%/20% random splits)","full_name":"","num_papers_in_archive":16},{"url":"/dataset/citeseer-48-32-20-fixed-splits","name":"Citeseer (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":15},{"url":"/dataset/cora-48-32-20-fixed-splits","name":"Cora (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":15},{"url":"/dataset/pubmed-48-32-20-fixed-splits","name":"PubMed (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":15},{"url":"/dataset/wisconsin-48-32-20-fixed-splits","name":"Wisconsin (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":15},{"url":"/dataset/film-48-32-20-fixed-splits","name":"Film(48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":14},{"url":"/dataset/texas-48-32-20-fixed-splits","name":"Texas (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":14},{"url":"/dataset/yelpchi","name":"Yelp-Fraud","full_name":"Multi-relational Graph Dataset for Yelp Spam Review Detection","num_papers_in_archive":13},{"url":"/dataset/aesthetic-visual-analysis","name":"Aesthetic Visual Analysis","full_name":"Aesthetic Visual Analysis","num_papers_in_archive":12},{"url":"/dataset/amazon-photo","name":"Amazon Photo","full_name":"Amazon Photo","num_papers_in_archive":11},{"url":"/dataset/amz-computers","name":"AMZ Computers","full_name":"amazon_electronics_computers","num_papers_in_archive":9},{"url":"/dataset/usa-air-traffic","name":"USA Air-Traffic","full_name":"USA Air-Traffic","num_papers_in_archive":9},{"url":"/dataset/amazon-fraud","name":"Amazon-Fraud","full_name":"Multi-relational Graph Dataset for Amazon Fraudulent Account Detection","num_papers_in_archive":8},{"url":"/dataset/brazil-air-traffic","name":"Brazil Air-Traffic","full_name":"Brazil Air-Traffic","num_papers_in_archive":8},{"url":"/dataset/wiki","name":"Wiki","full_name":"Web Traffic Time Series Forecasting","num_papers_in_archive":8},{"url":"/dataset/mag-scholar-c-1","name":"MAG-Scholar-C","full_name":"","num_papers_in_archive":5},{"url":"/dataset/mumin","name":"MuMiN","full_name":"","num_papers_in_archive":5},{"url":"/dataset/bgp","name":"BGP","full_name":"Border Gateway Protocol (BGP) Network","num_papers_in_archive":3},{"url":"/dataset/deezer-user-networks","name":"Deezer User Networks","full_name":"","num_papers_in_archive":3},{"url":"/dataset/placenta","name":"Placenta","full_name":"","num_papers_in_archive":3},{"url":"/dataset/city-networks","name":"City-Networks","full_name":"","num_papers_in_archive":2},{"url":"/dataset/electronics","name":"Electronics","full_name":"","num_papers_in_archive":2},{"url":"/dataset/fdcompcn","name":"FDCompCN","full_name":"","num_papers_in_archive":2},{"url":"/dataset/herigraph","name":"HeriGraph","full_name":"Multimodal Machine Learning Datasets on Graphs of Heritage Values and Attributes","num_papers_in_archive":2},{"url":"/dataset/nba","name":"NBA","full_name":"","num_papers_in_archive":2},{"url":"/dataset/celltypegraph-benchmark","name":"CellTypeGraph Benchmark","full_name":"","num_papers_in_archive":1},{"url":"/dataset/financial-dynamic-knowledge-graph","name":"Financial Dynamic Knowledge Graph","full_name":"","num_papers_in_archive":1},{"url":"/dataset/maple","name":"MAPLE","full_name":"","num_papers_in_archive":1},{"url":"/dataset/mumin-large","name":"MuMiN-large","full_name":"","num_papers_in_archive":1},{"url":"/dataset/mumin-medium","name":"MuMiN-medium","full_name":"","num_papers_in_archive":1},{"url":"/dataset/mumin-small","name":"MuMiN-small","full_name":"","num_papers_in_archive":1},{"url":"/dataset/sagc-a68","name":"SAGC-A68","full_name":"A space access graph dataset for the classification of spaces and space elements in apartment buildings","num_papers_in_archive":1},{"url":"/dataset/twitter-hydrug","name":"Twitter-HyDrug","full_name":"","num_papers_in_archive":1},{"url":"/dataset/twitter-hydrug-ur","name":"Twitter-HyDrug-UR","full_name":"Twitter Hypergraph Drug for User Roles","num_papers_in_archive":1}],"subtasks":[{"url":"/task/atomic-number-classification","name":"Atomic number classification"},{"url":"/task/dynamic-node-classification","name":"Dynamic Node Classification"},{"url":"/task/graph-structure-learning","name":"Graph structure learning"},{"url":"/task/heterogeneous-node-classification","name":"Heterogeneous Node Classification"},{"url":"/task/node-classification-on-non-homophilic","name":"Node Classification on Non-Homophilic (Heterophilic) Graphs"}],"parent_tasks":[],"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":19,"rows_per_page":100,"shown":100,"of":1860,"of_with_code":991,"tagged_in_all":1860,"counts":{"archive_papers_tagged":1860,"with_a_code_link":991,"where_syntology_ran_a_sample":305,"not_listed_spam_title":0,"listed":1860,"listed_where_code_ran":305,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":251,"every_run_a_failure_of_syntologys_instrument":54,"listed_with_a_run_with_no_instrument_failure":251,"listed_every_run_a_failure_of_syntologys_instrument":54,"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/revisiting-semi-supervised-learning-with","slug":"revisiting-semi-supervised-learning-with","title":"Revisiting Semi-Supervised Learning with Graph Embeddings","date":"2016-03-29","arxiv_id":"1603.08861","repositories_listed":26,"syntology":{"n":28,"n_ran":15,"n_constructed":4,"n_ran_checked":13,"n_instrument":2,"n_unverified":13,"n_honours":3,"n_violates":2,"n_no_contract":8,"n_pointer_only":11,"phrase":"15 ran (of which 4 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 2 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/revisiting-semi-supervised-learning-with#ran","syntology_url":"https://syntology.ai/paper/1603.08861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.08861"}},"official":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/neural-message-passing-for-quantum-chemistry","slug":"neural-message-passing-for-quantum-chemistry","title":"Neural Message Passing for Quantum Chemistry","date":"2017-04-04","arxiv_id":"1704.01212","repositories_listed":20,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-message-passing-for-quantum-chemistry#ran","syntology_url":"https://syntology.ai/paper/1704.01212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.01212"}},"official":{"repos":["brain-research/mpnn"],"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/node2vec-scalable-feature-learning-for","slug":"node2vec-scalable-feature-learning-for","title":"node2vec: Scalable Feature Learning for Networks","date":"2016-07-03","arxiv_id":"1607.00653","repositories_listed":20,"syntology":{"n":25,"n_ran":15,"n_constructed":2,"n_ran_checked":12,"n_instrument":3,"n_unverified":10,"n_honours":2,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"15 ran (of which 2 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/node2vec-scalable-feature-learning-for#ran","syntology_url":"https://syntology.ai/paper/1607.00653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.00653"}},"official":{"repos":["aditya-grover/node2vec"],"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/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/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/deepwalk-online-learning-of-social","slug":"deepwalk-online-learning-of-social","title":"DeepWalk: Online Learning of Social Representations","date":"2014-03-26","arxiv_id":"1403.6652","repositories_listed":14,"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":1,"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/deepwalk-online-learning-of-social#ran","syntology_url":"https://syntology.ai/paper/1403.6652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1403.6652"}},"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/deep-graph-infomax","slug":"deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","arxiv_id":"1809.10341","repositories_listed":11,"syntology":{"n":35,"n_ran":26,"n_constructed":11,"n_ran_checked":22,"n_instrument":4,"n_unverified":9,"n_honours":2,"n_violates":1,"n_no_contract":19,"n_pointer_only":10,"phrase":"26 ran (of which 11 constructed an object rather than computing a result; 22 with no instrument failure: 2 honoured, 1 violated, 19 with no contract checked; 4 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/deep-graph-infomax#ran","syntology_url":"https://syntology.ai/paper/1809.10341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.10341"}},"official":{"repos":["PetarV-/DGI"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/evolvegcn-evolving-graph-convolutional","slug":"evolvegcn-evolving-graph-convolutional","title":"EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs","date":"2019-02-26","arxiv_id":"1902.10191","repositories_listed":10,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/evolvegcn-evolving-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/1902.10191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10191"}},"official":{"repos":["IBM/AMLSim","IBM/EvolveGCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/graph-random-neural-network","slug":"graph-random-neural-network","title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","date":"2020-05-22","arxiv_id":"2005.11079","repositories_listed":9,"syntology":{"n":22,"n_ran":15,"n_constructed":1,"n_ran_checked":9,"n_instrument":6,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"15 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 6 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/graph-random-neural-network#ran","syntology_url":"https://syntology.ai/paper/2005.11079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.11079"}},"official":{"repos":["Grand20/grand"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/line-large-scale-information-network","slug":"line-large-scale-information-network","title":"LINE: Large-scale Information Network Embedding","date":"2015-03-12","arxiv_id":"1503.03578","repositories_listed":9,"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/line-large-scale-information-network#ran","syntology_url":"https://syntology.ai/paper/1503.03578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.03578"}},"official":{"repos":["tangjianpku/LINE"],"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/graphsaint-graph-sampling-based-inductive","slug":"graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","arxiv_id":"1907.04931","repositories_listed":8,"syntology":null},{"url":"/paper/convolutional-networks-on-graphs-for-learning","slug":"convolutional-networks-on-graphs-for-learning","title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","date":"2015-09-30","arxiv_id":"1509.09292","repositories_listed":8,"syntology":{"n":26,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":1,"phrase":"17 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; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/convolutional-networks-on-graphs-for-learning#ran","syntology_url":"https://syntology.ai/paper/1509.09292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1509.09292"}},"official":{"repos":["HIPS/neural-fingerprint"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/combining-label-propagation-and-simple-models-1","slug":"combining-label-propagation-and-simple-models-1","title":"Combining Label Propagation and Simple Models Out-performs Graph Neural Networks","date":"2020-10-27","arxiv_id":"2010.13993","repositories_listed":7,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/combining-label-propagation-and-simple-models-1#ran","syntology_url":"https://syntology.ai/paper/2010.13993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13993"}},"official":{"repos":["CUAI/CorrectAndSmooth"],"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":["listed","official"]}}},{"url":"/paper/deep-graph-library-towards-efficient-and","slug":"deep-graph-library-towards-efficient-and","title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","date":"2019-09-03","arxiv_id":"1909.01315","repositories_listed":7,"syntology":{"n":39,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":28,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":4,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 28 unverified","sample_list":"/paper/deep-graph-library-towards-efficient-and#ran","syntology_url":"https://syntology.ai/paper/1909.01315","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.01315"}},"official":{"repos":["dglai/dgl-0.5-benchmark"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/the-truly-deep-graph-convolutional-networks","slug":"the-truly-deep-graph-convolutional-networks","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","date":"2019-07-25","arxiv_id":"1907.10903","repositories_listed":7,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/the-truly-deep-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/1907.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10903"}},"official":{"repos":["DropEdge/DropEdge"],"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/simplifying-graph-convolutional-networks","slug":"simplifying-graph-convolutional-networks","title":"Simplifying Graph Convolutional Networks","date":"2019-02-19","arxiv_id":"1902.07153","repositories_listed":7,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"8 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simplifying-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/1902.07153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07153"}},"official":{"repos":["Tiiiger/SGC"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","slug":"ogb-lsc-a-large-scale-challenge-for-machine","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","date":"2021-03-17","arxiv_id":"2103.09430","repositories_listed":6,"syntology":null},{"url":"/paper/enhancing-graph-neural-network-based-fraud","slug":"enhancing-graph-neural-network-based-fraud","title":"Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters","date":"2020-08-19","arxiv_id":"2008.08692","repositories_listed":6,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/enhancing-graph-neural-network-based-fraud#ran","syntology_url":"https://syntology.ai/paper/2008.08692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.08692"}},"official":{"repos":["YingtongDou/CARE-GNN","safe-graph/DGFraud"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/cluster-gcn-an-efficient-algorithm-for","slug":"cluster-gcn-an-efficient-algorithm-for","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","date":"2019-05-20","arxiv_id":"1905.07953","repositories_listed":6,"syntology":null},{"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/large-scale-learning-on-non-homophilous","slug":"large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","arxiv_id":"2110.14446","repositories_listed":5,"syntology":{"n":21,"n_ran":15,"n_constructed":5,"n_ran_checked":10,"n_instrument":5,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":11,"phrase":"15 ran (of which 5 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/large-scale-learning-on-non-homophilous#ran","syntology_url":"https://syntology.ai/paper/2110.14446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14446"}},"official":{"repos":["cuai/non-homophily-large-scale"],"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/sign-scalable-inception-graph-neural-networks","slug":"sign-scalable-inception-graph-neural-networks","title":"SIGN: Scalable Inception Graph Neural Networks","date":"2020-04-23","arxiv_id":"2004.11198","repositories_listed":5,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sign-scalable-inception-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2004.11198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11198"}},"official":{"repos":["twitter-research/sign"],"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":["listed","official"]}}},{"url":"/paper/inductive-representation-learning-on-temporal-1","slug":"inductive-representation-learning-on-temporal-1","title":"Inductive Representation Learning on Temporal Graphs","date":"2020-02-19","arxiv_id":"2002.07962","repositories_listed":5,"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":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/inductive-representation-learning-on-temporal-1#ran","syntology_url":"https://syntology.ai/paper/2002.07962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07962"}},"official":{"repos":["StatsDLMathsRecomSys/Inductive-representation-learning-on-temporal-graphs"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/predict-then-propagate-graph-neural-networks","slug":"predict-then-propagate-graph-neural-networks","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","date":"2018-10-14","arxiv_id":"1810.05997","repositories_listed":5,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"11 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/predict-then-propagate-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.05997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.05997"}},"official":{"repos":["klicperajo/ppnp"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/representation-learning-on-graphs-with","slug":"representation-learning-on-graphs-with","title":"Representation Learning on Graphs with Jumping Knowledge Networks","date":"2018-06-09","arxiv_id":"1806.03536","repositories_listed":5,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/representation-learning-on-graphs-with#ran","syntology_url":"https://syntology.ai/paper/1806.03536","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.03536"}},"official":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/graphgan-graph-representation-learning-with","slug":"graphgan-graph-representation-learning-with","title":"GraphGAN: Graph Representation Learning with Generative Adversarial Nets","date":"2017-11-22","arxiv_id":"1711.08267","repositories_listed":5,"syntology":null},{"url":"/paper/struc2vec-learning-node-representations-from","slug":"struc2vec-learning-node-representations-from","title":"struc2vec: Learning Node Representations from Structural Identity","date":"2017-04-11","arxiv_id":"1704.03165","repositories_listed":5,"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":0,"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/struc2vec-learning-node-representations-from#ran","syntology_url":"https://syntology.ai/paper/1704.03165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.03165"}},"official":{"repos":["leoribeiro/struc2vec"],"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/convolutional-neural-networks-on-graphs-with","slug":"convolutional-neural-networks-on-graphs-with","title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","date":"2016-06-30","arxiv_id":"1606.09375","repositories_listed":5,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 4 unverified","sample_list":"/paper/convolutional-neural-networks-on-graphs-with#ran","syntology_url":"https://syntology.ai/paper/1606.09375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.09375"}},"official":{"repos":["mdeff/cnn_graph"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/llms-as-zero-shot-graph-learners-alignment-of","slug":"llms-as-zero-shot-graph-learners-alignment-of","title":"LLMs as Zero-shot Graph Learners: Alignment of GNN Representations with LLM Token Embeddings","date":"2024-08-25","arxiv_id":"2408.14512","repositories_listed":4,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/llms-as-zero-shot-graph-learners-alignment-of#ran","syntology_url":"https://syntology.ai/paper/2408.14512","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.14512"}},"official":{"repos":["w-rudder/tea-glm"],"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":["listed","official"]}}},{"url":"/paper/long-range-dependency-based-multi-layer","slug":"long-range-dependency-based-multi-layer","title":"Long-range Meta-path Search on Large-scale Heterogeneous Graphs","date":"2023-07-17","arxiv_id":"2307.08430","repositories_listed":4,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":7,"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) · 4 unverified","sample_list":"/paper/long-range-dependency-based-multi-layer#ran","syntology_url":"https://syntology.ai/paper/2307.08430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08430"}},"official":{"repos":["jhl-hust/ldmlp","jhl-hust/lmsps"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/sa-mlp-distilling-graph-knowledge-from-gnns","slug":"sa-mlp-distilling-graph-knowledge-from-gnns","title":"SA-MLP: Distilling Graph Knowledge from GNNs into Structure-Aware MLP","date":"2022-10-18","arxiv_id":"2210.09609","repositories_listed":4,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/sa-mlp-distilling-graph-knowledge-from-gnns#ran","syntology_url":"https://syntology.ai/paper/2210.09609","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09609"}},"official":{"repos":["jc-202/sa-mlp"],"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/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/improving-the-training-of-graph-neural","slug":"improving-the-training-of-graph-neural","title":"SCR: Training Graph Neural Networks with Consistency Regularization","date":"2021-12-08","arxiv_id":"2112.04319","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-the-training-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2112.04319","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.04319"}},"official":{"repos":["thudm/crgnn","thudm/scr"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/understanding-over-squashing-and-bottlenecks-1","slug":"understanding-over-squashing-and-bottlenecks-1","title":"Understanding over-squashing and bottlenecks on graphs via curvature","date":"2021-11-29","arxiv_id":"2111.14522","repositories_listed":4,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/understanding-over-squashing-and-bottlenecks-1#ran","syntology_url":"https://syntology.ai/paper/2111.14522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.14522"}},"official":{"repos":["jctops/understanding-oversquashing"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/nodepiece-compositional-and-parameter","slug":"nodepiece-compositional-and-parameter","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","date":"2021-06-23","arxiv_id":"2106.12144","repositories_listed":4,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/nodepiece-compositional-and-parameter#ran","syntology_url":"https://syntology.ai/paper/2106.12144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12144"}},"official":{"repos":["migalkin/NodePiece"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/residual-network-and-embedding-usage-new","slug":"residual-network-and-embedding-usage-new","title":"Residual Network and Embedding Usage: New Tricks of Node Classification with Graph Convolutional Networks","date":"2021-05-18","arxiv_id":"2105.08330","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/generalizing-graph-neural-networks-beyond","slug":"generalizing-graph-neural-networks-beyond","title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","date":"2020-06-20","arxiv_id":"2006.11468","repositories_listed":4,"syntology":{"n":21,"n_ran":16,"n_constructed":2,"n_ran_checked":13,"n_instrument":3,"n_unverified":5,"n_honours":4,"n_violates":2,"n_no_contract":7,"n_pointer_only":13,"phrase":"16 ran (of which 2 constructed an object rather than computing a result; 13 with no instrument failure: 4 honoured, 2 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/generalizing-graph-neural-networks-beyond#ran","syntology_url":"https://syntology.ai/paper/2006.11468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11468"}},"official":{"repos":["GemsLab/H2GCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"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/understanding-negative-sampling-in-graph","slug":"understanding-negative-sampling-in-graph","title":"Understanding Negative Sampling in Graph Representation Learning","date":"2020-05-20","arxiv_id":"2005.09863","repositories_listed":4,"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":1,"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/understanding-negative-sampling-in-graph#ran","syntology_url":"https://syntology.ai/paper/2005.09863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09863"}},"official":{"repos":["zyang-16/MCNS"],"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/ktrain-a-low-code-library-for-augmented","slug":"ktrain-a-low-code-library-for-augmented","title":"ktrain: A Low-Code Library for Augmented Machine Learning","date":"2020-04-19","arxiv_id":"2004.10703","repositories_listed":4,"syntology":{"n":16,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":12,"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) · 12 unverified","sample_list":"/paper/ktrain-a-low-code-library-for-augmented#ran","syntology_url":"https://syntology.ai/paper/2004.10703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10703"}},"official":{"repos":["amaiya/ktrain"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":10,"ran_from_kinds":["listed"]}}},{"url":"/paper/geom-gcn-geometric-graph-convolutional-1","slug":"geom-gcn-geometric-graph-convolutional-1","title":"Geom-GCN: Geometric Graph Convolutional Networks","date":"2020-02-13","arxiv_id":"2002.05287","repositories_listed":4,"syntology":{"n":7,"n_ran":7,"n_constructed":2,"n_ran_checked":3,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/geom-gcn-geometric-graph-convolutional-1#ran","syntology_url":"https://syntology.ai/paper/2002.05287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05287"}},"official":{"repos":["graphdml-uiuc-jlu/geom-gcn"],"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/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/deepgcns-making-gcns-go-as-deep-as-cnns","slug":"deepgcns-making-gcns-go-as-deep-as-cnns","title":"DeepGCNs: Making GCNs Go as Deep as CNNs","date":"2019-10-15","arxiv_id":"1910.06849","repositories_listed":4,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deepgcns-making-gcns-go-as-deep-as-cnns#ran","syntology_url":"https://syntology.ai/paper/1910.06849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06849"}},"official":{"repos":["lightaime/deep_gcns_torch","lightaime/deep_gcns"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/graph-embedding-on-biomedical-networks","slug":"graph-embedding-on-biomedical-networks","title":"Graph Embedding on Biomedical Networks: Methods, Applications, and Evaluations","date":"2019-06-12","arxiv_id":"1906.05017","repositories_listed":4,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 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; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/graph-embedding-on-biomedical-networks#ran","syntology_url":"https://syntology.ai/paper/1906.05017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05017"}},"official":{"repos":["xiangyue9607/BioNEV"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/fastgcn-fast-learning-with-graph","slug":"fastgcn-fast-learning-with-graph","title":"FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling","date":"2018-01-30","arxiv_id":"1801.10247","repositories_listed":4,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/fastgcn-fast-learning-with-graph#ran","syntology_url":"https://syntology.ai/paper/1801.10247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.10247"}},"official":{"repos":["matenure/FastGCN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"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/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/boosting-multitask-learning-on-graphs-through","slug":"boosting-multitask-learning-on-graphs-through","title":"Boosting Multitask Learning on Graphs through Higher-Order Task Affinities","date":"2023-06-24","arxiv_id":"2306.14009","repositories_listed":3,"syntology":null},{"url":"/paper/a-critical-look-at-the-evaluation-of-gnns","slug":"a-critical-look-at-the-evaluation-of-gnns","title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","date":"2023-02-22","arxiv_id":"2302.11640","repositories_listed":3,"syntology":null},{"url":"/paper/explaining-the-explainers-in-graph-neural","slug":"explaining-the-explainers-in-graph-neural","title":"Explaining the Explainers in Graph Neural Networks: a Comparative Study","date":"2022-10-27","arxiv_id":"2210.15304","repositories_listed":3,"syntology":null},{"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/mumin-a-large-scale-multilingual-multimodal","slug":"mumin-a-large-scale-multilingual-multimodal","title":"MuMiN: A Large-Scale Multilingual Multimodal Fact-Checked Misinformation Social Network Dataset","date":"2022-02-23","arxiv_id":"2202.11684","repositories_listed":3,"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/mumin-a-large-scale-multilingual-multimodal#ran","syntology_url":"https://syntology.ai/paper/2202.11684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11684"}},"official":{"repos":["MuMiN-dataset/mumin-build"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"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/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/a-generalization-of-transformer-networks-to","slug":"a-generalization-of-transformer-networks-to","title":"A Generalization of Transformer Networks to Graphs","date":"2020-12-17","arxiv_id":"2012.09699","repositories_listed":3,"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/a-generalization-of-transformer-networks-to#ran","syntology_url":"https://syntology.ai/paper/2012.09699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.09699"}},"official":{"repos":["graphdeeplearning/graphtransformer"],"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/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/masked-label-prediction-unified-massage","slug":"masked-label-prediction-unified-massage","title":"Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification","date":"2020-09-08","arxiv_id":"2009.03509","repositories_listed":3,"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":2,"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/masked-label-prediction-unified-massage#ran","syntology_url":"https://syntology.ai/paper/2009.03509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.03509"}},"official":{"repos":["PaddlePaddle/PGL"],"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/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/towards-deeper-graph-neural-networks","slug":"towards-deeper-graph-neural-networks","title":"Towards Deeper Graph Neural Networks","date":"2020-07-18","arxiv_id":"2007.09296","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-deeper-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2007.09296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.09296"}},"official":{"repos":["divelab/DeeperGNN"],"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","unlocated"]}}},{"url":"/paper/deep-graph-contrastive-representation","slug":"deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","arxiv_id":"2006.04131","repositories_listed":3,"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":1,"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/deep-graph-contrastive-representation#ran","syntology_url":"https://syntology.ai/paper/2006.04131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04131"}},"official":{"repos":["CRIPAC-DIG/GRACE"],"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/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/diffusion-improves-graph-learning-1","slug":"diffusion-improves-graph-learning-1","title":"Diffusion Improves Graph Learning","date":"2019-10-28","arxiv_id":"1911.05485","repositories_listed":3,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 3 unverified","sample_list":"/paper/diffusion-improves-graph-learning-1#ran","syntology_url":"https://syntology.ai/paper/1911.05485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.05485"}},"official":{"repos":["klicperajo/gdc"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/hyperbolic-graph-convolutional-neural","slug":"hyperbolic-graph-convolutional-neural","title":"Hyperbolic Graph Convolutional Neural Networks","date":"2019-10-28","arxiv_id":"1910.12933","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hyperbolic-graph-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/1910.12933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.12933"}},"official":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/node-attribute-generation-on-graphs","slug":"node-attribute-generation-on-graphs","title":"Node Attribute Generation on Graphs","date":"2019-07-23","arxiv_id":"1907.09708","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/mixhop-higher-order-graph-convolution","slug":"mixhop-higher-order-graph-convolution","title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","date":"2019-04-30","arxiv_id":"1905.00067","repositories_listed":3,"syntology":null},{"url":"/paper/diffusion-convolutional-neural-networks","slug":"diffusion-convolutional-neural-networks","title":"Diffusion-Convolutional Neural Networks","date":"2015-11-06","arxiv_id":"1511.02136","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/diffusion-convolutional-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1511.02136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.02136"}},"official":null}},{"url":"/paper/network-representation-learning-with-rich","slug":"network-representation-learning-with-rich","title":"Network Representation Learning with Rich Text Information","date":"2015-06-24","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/a-scalable-multiclass-algorithm-for-node","slug":"a-scalable-multiclass-algorithm-for-node","title":"A Scalable Multiclass Algorithm for Node Classification","date":"2011-12-19","arxiv_id":"1112.4344","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/diss-l-ect-dissecting-graph-data-with-local","slug":"diss-l-ect-dissecting-graph-data-with-local","title":"Diss-l-ECT: Dissecting Graph Data with Local Euler Characteristic Transforms","date":"2024-10-03","arxiv_id":"2410.02622","repositories_listed":2,"syntology":{"n":10,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/diss-l-ect-dissecting-graph-data-with-local#ran","syntology_url":"https://syntology.ai/paper/2410.02622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02622"}},"official":{"repos":["aidos-lab/Diss-l-ECT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/rllm-relational-table-learning-with-llms","slug":"rllm-relational-table-learning-with-llms","title":"rLLM: Relational Table Learning with LLMs","date":"2024-07-29","arxiv_id":"2407.20157","repositories_listed":2,"syntology":null},{"url":"/paper/gc-bench-a-benchmark-framework-for-graph","slug":"gc-bench-a-benchmark-framework-for-graph","title":"GC4NC: A Benchmark Framework for Graph Condensation on Node Classification with New Insights","date":"2024-06-24","arxiv_id":"2406.16715","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":0,"n_honours":3,"n_violates":2,"n_no_contract":0,"n_pointer_only":4,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 2 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gc-bench-a-benchmark-framework-for-graph#ran","syntology_url":"https://syntology.ai/paper/2406.16715","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.16715"}},"official":{"repos":["emory-melody/graphslim"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/noisygl-a-comprehensive-benchmark-for-graph","slug":"noisygl-a-comprehensive-benchmark-for-graph","title":"NoisyGL: A Comprehensive Benchmark for Graph Neural Networks under Label Noise","date":"2024-06-06","arxiv_id":"2406.04299","repositories_listed":2,"syntology":null},{"url":"/paper/polynormer-polynomial-expressive-graph","slug":"polynormer-polynomial-expressive-graph","title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","date":"2024-03-02","arxiv_id":"2403.01232","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":2,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/polynormer-polynomial-expressive-graph#ran","syntology_url":"https://syntology.ai/paper/2403.01232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01232"}},"official":{"repos":["cornell-zhang/polynormer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"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/can-gnn-be-good-adapter-for-llms","slug":"can-gnn-be-good-adapter-for-llms","title":"Can GNN be Good Adapter for LLMs?","date":"2024-02-20","arxiv_id":"2402.12984","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"6 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/can-gnn-be-good-adapter-for-llms#ran","syntology_url":"https://syntology.ai/paper/2402.12984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12984"}},"official":{"repos":["zjunet/graphadapter","hxttkl/GraphAdapter"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/classifying-nodes-in-graphs-without-gnns","slug":"classifying-nodes-in-graphs-without-gnns","title":"Classifying Nodes in Graphs without GNNs","date":"2024-02-08","arxiv_id":"2402.05934","repositories_listed":2,"syntology":null},{"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/rdf-star2vec-rdf-star-graph-embeddings-for","slug":"rdf-star2vec-rdf-star-graph-embeddings-for","title":"RDF-star2Vec: RDF-star Graph Embeddings for Data Mining","date":"2023-12-25","arxiv_id":"2312.15626","repositories_listed":2,"syntology":null},{"url":"/paper/splitgnn-spectral-graph-neural-network-for","slug":"splitgnn-spectral-graph-neural-network-for","title":"SplitGNN: Spectral Graph Neural Network for Fraud Detection against Heterophily","date":"2023-10-21","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/can-llms-effectively-leverage-structural","slug":"can-llms-effectively-leverage-structural","title":"Can LLMs Effectively Leverage Graph Structural Information through Prompts, and Why?","date":"2023-09-28","arxiv_id":"2309.16595","repositories_listed":2,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/can-llms-effectively-leverage-structural#ran","syntology_url":"https://syntology.ai/paper/2309.16595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16595"}},"official":{"repos":["trais-lab/llm-structured-data"],"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":["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/simmatchv2-semi-supervised-learning-with","slug":"simmatchv2-semi-supervised-learning-with","title":"SimMatchV2: Semi-Supervised Learning with Graph Consistency","date":"2023-08-13","arxiv_id":"2308.06692","repositories_listed":2,"syntology":null},{"url":"/paper/simteg-a-frustratingly-simple-approach","slug":"simteg-a-frustratingly-simple-approach","title":"SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning","date":"2023-08-03","arxiv_id":"2308.02565","repositories_listed":2,"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/simteg-a-frustratingly-simple-approach#ran","syntology_url":"https://syntology.ai/paper/2308.02565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.02565"}},"official":{"repos":["vermouthdky/simteg"],"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/exploring-the-potential-of-large-language-1","slug":"exploring-the-potential-of-large-language-1","title":"Exploring the Potential of Large Language Models (LLMs) in Learning on Graphs","date":"2023-07-07","arxiv_id":"2307.03393","repositories_listed":2,"syntology":null},{"url":"/paper/spectral-heterogeneous-graph-convolutions-via","slug":"spectral-heterogeneous-graph-convolutions-via","title":"Spectral Heterogeneous Graph Convolutions via Positive Noncommutative Polynomials","date":"2023-05-31","arxiv_id":"2305.19872","repositories_listed":2,"syntology":null},{"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/bolt-an-automated-deep-learning-framework-for","slug":"bolt-an-automated-deep-learning-framework-for","title":"BOLT: An Automated Deep Learning Framework for Training and Deploying Large-Scale Search and Recommendation Models on Commodity CPU Hardware","date":"2023-03-30","arxiv_id":"2303.17727","repositories_listed":2,"syntology":null},{"url":"/paper/towards-better-dynamic-graph-learning-new-1","slug":"towards-better-dynamic-graph-learning-new-1","title":"Towards Better Dynamic Graph Learning: New Architecture and Unified Library","date":"2023-03-23","arxiv_id":"2303.13047","repositories_listed":2,"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/towards-better-dynamic-graph-learning-new-1#ran","syntology_url":"https://syntology.ai/paper/2303.13047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.13047"}},"official":{"repos":["yule-buaa/dyglib"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"syntology_records":77,"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":47,"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/node-classification-on-cora","since_archive":"/sota/node-classification-on-cora#since-judged","papers_judged":24,"placed":0},{"leaderboard":"/sota/node-classification-on-citeseer","since_archive":"/sota/node-classification-on-citeseer#since-judged","papers_judged":22,"placed":1},{"leaderboard":"/sota/node-classification-on-pubmed","since_archive":"/sota/node-classification-on-pubmed#since-judged","papers_judged":20,"placed":0},{"leaderboard":"/sota/node-classification-on-wisconsin","since_archive":"/sota/node-classification-on-wisconsin#since-judged","papers_judged":10,"placed":1},{"leaderboard":"/sota/node-classification-on-actor","since_archive":"/sota/node-classification-on-actor#since-judged","papers_judged":7,"placed":0},{"leaderboard":"/sota/node-classification-on-texas","since_archive":"/sota/node-classification-on-texas#since-judged","papers_judged":9,"placed":1},{"leaderboard":"/sota/node-classification-on-chameleon","since_archive":"/sota/node-classification-on-chameleon#since-judged","papers_judged":9,"placed":1},{"leaderboard":"/sota/node-classification-on-cornell","since_archive":"/sota/node-classification-on-cornell#since-judged","papers_judged":7,"placed":1},{"leaderboard":"/sota/node-classification-on-squirrel","since_archive":"/sota/node-classification-on-squirrel#since-judged","papers_judged":7,"placed":0},{"leaderboard":"/sota/node-classification-on-penn94","since_archive":"/sota/node-classification-on-penn94#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/node-classification-on-coauthor-cs","since_archive":"/sota/node-classification-on-coauthor-cs#since-judged","papers_judged":3,"placed":1},{"leaderboard":"/sota/node-classification-on-ppi","since_archive":"/sota/node-classification-on-ppi#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/node-classification-on-reddit","since_archive":"/sota/node-classification-on-reddit#since-judged","papers_judged":5,"placed":0},{"leaderboard":"/sota/node-classification-on-coauthor-physics","since_archive":"/sota/node-classification-on-coauthor-physics#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/node-classification-on-amazon-computers-1","since_archive":"/sota/node-classification-on-amazon-computers-1#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/node-classification-on-arxiv-year","since_archive":"/sota/node-classification-on-arxiv-year#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/node-classification-on-amazon-photo-1","since_archive":"/sota/node-classification-on-amazon-photo-1#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/node-classification-on-pokec","since_archive":"/sota/node-classification-on-pokec#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/node-classification-on-roman-empire","since_archive":"/sota/node-classification-on-roman-empire#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/node-classification-on-blogcatalog-1","since_archive":"/sota/node-classification-on-blogcatalog-1#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/node-classification-on-dblp","since_archive":"/sota/node-classification-on-dblp#since-judged","papers_judged":3,"placed":0},{"leaderboard":"/sota/node-classification-on-amazon-ratings","since_archive":"/sota/node-classification-on-amazon-ratings#since-judged","papers_judged":3,"placed":0},{"leaderboard":"/sota/node-classification-on-minesweeper","since_archive":"/sota/node-classification-on-minesweeper#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/node-classification-on-tolokers","since_archive":"/sota/node-classification-on-tolokers#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/node-classification-on-questions","since_archive":"/sota/node-classification-on-questions#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":305,"papers_where_code_ran_first_page":"/task/node-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":19,"url":"/task/node-classification/papers/2","json":"/task/node-classification/papers/2.json","rows":100},{"order":"archive","page":3,"of":19,"url":"/task/node-classification/papers/3","json":"/task/node-classification/papers/3.json","rows":100},{"order":"archive","page":4,"of":19,"url":"/task/node-classification/papers/4","json":"/task/node-classification/papers/4.json","rows":100},{"order":"archive","page":5,"of":19,"url":"/task/node-classification/papers/5","json":"/task/node-classification/papers/5.json","rows":100},{"order":"archive","page":6,"of":19,"url":"/task/node-classification/papers/6","json":"/task/node-classification/papers/6.json","rows":100},{"order":"archive","page":7,"of":19,"url":"/task/node-classification/papers/7","json":"/task/node-classification/papers/7.json","rows":100},{"order":"archive","page":8,"of":19,"url":"/task/node-classification/papers/8","json":"/task/node-classification/papers/8.json","rows":100},{"order":"archive","page":9,"of":19,"url":"/task/node-classification/papers/9","json":"/task/node-classification/papers/9.json","rows":100},{"order":"archive","page":10,"of":19,"url":"/task/node-classification/papers/10","json":"/task/node-classification/papers/10.json","rows":100},{"order":"archive","page":11,"of":19,"url":"/task/node-classification/papers/11","json":"/task/node-classification/papers/11.json","rows":100},{"order":"archive","page":12,"of":19,"url":"/task/node-classification/papers/12","json":"/task/node-classification/papers/12.json","rows":100},{"order":"archive","page":13,"of":19,"url":"/task/node-classification/papers/13","json":"/task/node-classification/papers/13.json","rows":100},{"order":"archive","page":14,"of":19,"url":"/task/node-classification/papers/14","json":"/task/node-classification/papers/14.json","rows":100},{"order":"archive","page":15,"of":19,"url":"/task/node-classification/papers/15","json":"/task/node-classification/papers/15.json","rows":100},{"order":"archive","page":16,"of":19,"url":"/task/node-classification/papers/16","json":"/task/node-classification/papers/16.json","rows":100},{"order":"archive","page":17,"of":19,"url":"/task/node-classification/papers/17","json":"/task/node-classification/papers/17.json","rows":100},{"order":"archive","page":18,"of":19,"url":"/task/node-classification/papers/18","json":"/task/node-classification/papers/18.json","rows":100},{"order":"archive","page":19,"of":19,"url":"/task/node-classification/papers/19","json":"/task/node-classification/papers/19.json","rows":60},{"order":"ran","page":1,"of":4,"url":"/task/node-classification/papers/ran/1","json":"/task/node-classification/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":4,"url":"/task/node-classification/papers/ran/2","json":"/task/node-classification/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":4,"url":"/task/node-classification/papers/ran/3","json":"/task/node-classification/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":4,"url":"/task/node-classification/papers/ran/4","json":"/task/node-classification/papers/ran/4.json","rows":5}],"description_links":{"kept":3,"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":"e5287610e42f6ec78acae245dcf2f3f717c9aa50c3cf4ace62b04d29ee8814be","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}