{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/dataset/cora","name":"Cora","full_name":null,"description_markdown":"The **Cora** dataset consists of 2708 scientific publications classified into one of seven classes. The citation network consists of 5429 links. Each publication in the dataset is described by a 0/1-valued word vector indicating the absence/presence of the corresponding word from the dictionary. The dictionary consists of 1433 unique words.\r\n\r\nSource: [https://relational.fit.cvut.cz/dataset/CORA](https://relational.fit.cvut.cz/dataset/CORA)\r\nImage Source: [https://arxiv.org/abs/1611.08402](https://arxiv.org/abs/1611.08402)","description_withheld":null,"homepage":"https://relational.fit.cvut.cz/dataset/CORA","introduced_date":"2000-01-01","introduced_date_note":null,"introduced_by":{"paper":null,"title":"Automating the Construction of Internet Portals with Machine Learning","first_author":null,"url":"https://doi.org/10.1023/A:1009953814988"},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Node Classification","url":"/task/node-classification","datasets_with_task":"/datasets/task/node-classification"},{"name":"Link Prediction","url":"/task/link-prediction","datasets_with_task":"/datasets/task/link-prediction"},{"name":"Graph Classification","url":"/task/graph-classification","datasets_with_task":"/datasets/task/graph-classification"},{"name":"Document Classification","url":"/task/document-classification","datasets_with_task":"/datasets/task/document-classification"},{"name":"Node Clustering","url":"/task/node-clustering","datasets_with_task":"/datasets/task/node-clustering"},{"name":"Community Detection","url":"/task/community-detection","datasets_with_task":"/datasets/task/community-detection"},{"name":"Graph Clustering","url":"/task/graph-clustering","datasets_with_task":"/datasets/task/graph-clustering"},{"name":"Graph structure learning","url":"/task/graph-structure-learning","datasets_with_task":"/datasets/task/graph-structure-learning"}],"languages":[],"variants":["Cora (weighted evaluation)","Cora: fixed 5 node per class","Cora: fixed 20 node per class","Cora: fixed 10 node per class","Cora random partition","Cora Full-supervised","Cora (nonstandard variant)","Cora (biased evaluation)","Cora with Public Split: fixed 20 nodes per class","Cora (3%)","Cora (1%)","Cora (0.5%)","Cora"],"data_loaders":[{"repo":"https://github.com/pyg-team/pytorch_geometric","url":"https://pytorch-geometric.readthedocs.io/en/latest/modules/datasets.html#torch_geometric.datasets.Planetoid","frameworks":["pytorch"]},{"repo":"https://github.com/dmlc/dgl","url":"https://docs.dgl.ai/api/python/dgl.data.html#citation-network-dataset","frameworks":["pytorch","tf","mxnet"]},{"repo":"https://github.com/danielegrattarola/spektral","url":"https://graphneural.network/datasets/#citation","frameworks":["tf"]},{"repo":"https://github.com/neo4j/graph-data-science-client","url":"https://neo4j.com/docs/graph-data-science-client/current/graph-object/#graph-object-load-cora","frameworks":[]}],"num_papers_in_archive":602,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/node-classification-on-cora","task":"Node Classification","dataset_variant":"Cora","rows":73,"metrics":["Accuracy","Training Split","Validation","1:1 Accuracy","Inference Time (ms)"],"first_row_in_archive_order":{"model":"SSP","paper":"/paper/optimization-of-graph-neural-networks-with","metrics":{"Accuracy":"90.16% ± 0.59%"},"code_links":[{"title":"russellizadi/ssp","url":"https://github.com/russellizadi/ssp"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-cora-with-public-split","task":"Node Classification","dataset_variant":"Cora with Public Split: fixed 20 nodes per class","rows":36,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"OGC","paper":"/paper/from-cluster-assumption-to-graph-convolution","metrics":{"Accuracy":"86.9%"},"code_links":[{"title":"zhengwang100/ogc_ggcm","url":"https://github.com/zhengwang100/ogc_ggcm"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-cora-05","task":"Node Classification","dataset_variant":"Cora (0.5%)","rows":15,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-ind_APPNP","paper":"/paper/extract-the-knowledge-of-graph-neural","metrics":{"Accuracy":"77.3%"},"code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-cora-1","task":"Node Classification","dataset_variant":"Cora (1%)","rows":15,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-ind-APPNP","paper":"/paper/extract-the-knowledge-of-graph-neural","metrics":{"Accuracy":"80.24%"},"code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-cora-3","task":"Node Classification","dataset_variant":"Cora (3%)","rows":15,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-tra-GCNII","paper":"/paper/extract-the-knowledge-of-graph-neural","metrics":{"Accuracy":"84.18%"},"code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-cora","task":"Link Prediction","dataset_variant":"Cora","rows":13,"metrics":["AUC","AP","Accuracy","ACC"],"first_row_in_archive_order":{"model":"NESS","paper":"/paper/ness-learning-node-embeddings-from-static","metrics":{"AP":"98.71%","AUC":"98.46%"},"code_links":[{"title":"AstraZeneca/NESS","url":"https://github.com/AstraZeneca/NESS"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-clustering-on-cora","task":"Graph Clustering","dataset_variant":"Cora","rows":9,"metrics":["ACC","NMI","ARI","F1","Precision","F score"],"first_row_in_archive_order":{"model":"R-GMM-VGAE","paper":"/paper/rethinking-graph-autoencoder-models-for","metrics":{"ACC":"76.7","ARI":"57.9","NMI":"57.3"},"code_links":[{"title":"nairouz/R-GAE","url":"https://github.com/nairouz/R-GAE"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-cora-fixed-20-node-per","task":"Node Classification","dataset_variant":"Cora: fixed 20 node per class","rows":9,"metrics":["Accuracy","Micro F1"],"first_row_in_archive_order":{"model":"DSGCN","paper":"/paper/bridging-the-gap-between-spectral-and-spatial","metrics":{"Accuracy":"84.2"},"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"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-cora-full-supervised","task":"Node Classification","dataset_variant":"Cora Full-supervised","rows":9,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GCNII","paper":"/paper/simple-and-deep-graph-convolutional-networks-1","metrics":{"Accuracy":"88.49%"},"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"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/document-classification-on-cora","task":"Document Classification","dataset_variant":"Cora","rows":6,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"ACNet","paper":"/paper/adaptively-connected-neural-networks","metrics":{"Accuracy":"83.5%"},"code_links":[{"title":"wanggrun/Adaptively-Connected-Neural-Networks","url":"https://github.com/wanggrun/Adaptively-Connected-Neural-Networks"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/community-detection-on-cora","task":"Community Detection","dataset_variant":"Cora","rows":2,"metrics":["NMI","ACC"],"first_row_in_archive_order":{"model":"EdMot","paper":"/paper/edmot-an-edge-enhancement-approach-for-motif-1","metrics":{"NMI":"0.4226"},"code_links":[{"title":"benedekrozemberczki/EdMot","url":"https://github.com/benedekrozemberczki/EdMot"},{"title":"lipzh5/EdMot_pro","url":"https://github.com/lipzh5/EdMot_pro"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-cora-biased-evaluation","task":"Link Prediction","dataset_variant":"Cora (biased evaluation)","rows":2,"metrics":["AP","AUC","Accuracy"],"first_row_in_archive_order":{"model":"GraphStar (double weight on positive examples)","paper":"/paper/graph-star-net-for-generalized-multi-task-1","metrics":{"AP":"96.15","AUC":"95.65","Accuracy":"95.9"},"code_links":[{"title":"graph-star-team/graph_star","url":"https://github.com/graph-star-team/graph_star"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-cora-fixed-10-node-per","task":"Node Classification","dataset_variant":"Cora: fixed 10 node per class","rows":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-tra-GCNII","paper":"/paper/extract-the-knowledge-of-graph-neural","metrics":{"Accuracy":"84.1%"},"code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-cora-fixed-5-node-per","task":"Node Classification","dataset_variant":"Cora: fixed 5 node per class","rows":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"CPF-tra-APPNP","paper":"/paper/extract-the-knowledge-of-graph-neural","metrics":{"Accuracy":"80.26%"},"code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-classification-on-cora","task":"Graph Classification","dataset_variant":"Cora","rows":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"sKNN-LDS","paper":"/paper/neighborhood-enlargement-in-graph-neural","metrics":{"Accuracy":"72.3"},"code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-structure-learning-on-cora","task":"Graph structure learning","dataset_variant":"Cora","rows":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SLAPS","paper":"/paper/slaps-self-supervision-improves-structure-1","metrics":{"Accuracy":"73.4"},"code_links":[{"title":"BorealisAI/SLAPS-GNN","url":"https://github.com/BorealisAI/SLAPS-GNN"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-cora-nonstandard-variant","task":"Link Prediction","dataset_variant":"Cora (nonstandard variant)","rows":1,"metrics":["AP","AUC"],"first_row_in_archive_order":{"model":"GLACE","paper":"/paper/gaussian-embedding-of-large-scale-attributed","metrics":{"AP":"98.52","AUC":"98.6"},"code_links":[{"title":"bhagya-hettige/GLACE","url":"https://github.com/bhagya-hettige/GLACE"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-cora-random-partition","task":"Node Classification","dataset_variant":"Cora random partition","rows":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GraphMix (GCN)","paper":"/paper/graphmix-regularized-training-of-graph-neural","metrics":{"Accuracy":"82.07 ± 1.17"},"code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":117,"counts":{"papers_with_a_benchmark_row":117,"with_a_code_link":106,"where_syntology_ran_a_sample":45,"not_listed_spam_title":0,"listed":117,"listed_where_code_ran":45,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":38,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":38,"listed_every_run_a_failure_of_syntologys_instrument":7,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/scale-invariance-of-graph-neural-networks","slug":"scale-invariance-of-graph-neural-networks","title":"Scale Invariance of Graph Neural Networks","date":"2024-11-28","arxiv_id":"2411.19392","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/faster-inference-time-for-gnns-using","slug":"faster-inference-time-for-gnns-using","title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","date":"2024-10-19","arxiv_id":"2410.15001","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/classic-gnns-are-strong-baselines-reassessing","slug":"classic-gnns-are-strong-baselines-reassessing","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","date":"2024-06-13","arxiv_id":"2406.08993","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":4,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/gscan-graph-stability-clustering-for","slug":"gscan-graph-stability-clustering-for","title":"GSCAN: Graph Stability Clustering for Applications With Noise Using Edge-Aware Excess-of-Mass","date":"2024-04-17","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/strong-transitivity-relations-and-graph","slug":"strong-transitivity-relations-and-graph","title":"Strong Transitivity Relations and Graph Neural Networks","date":"2024-01-01","arxiv_id":"2401.01384","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mitigating-degree-biases-in-message-passing","slug":"mitigating-degree-biases-in-message-passing","title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","date":"2023-12-28","arxiv_id":"2312.16788","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/contrastive-deep-nonnegative-matrix","slug":"contrastive-deep-nonnegative-matrix","title":"Contrastive Deep Nonnegative Matrix Factorization for Community Detection","date":"2023-11-04","arxiv_id":"2311.02357","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/from-cluster-assumption-to-graph-convolution","slug":"from-cluster-assumption-to-graph-convolution","title":"From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited","date":"2023-09-24","arxiv_id":"2309.13599","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":26,"samples_ran":19,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":6,"samples_unverified":7,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/re-think-and-re-design-graph-neural-networks","slug":"re-think-and-re-design-graph-neural-networks","title":"Re-Think and Re-Design Graph Neural Networks in Spaces of Continuous Graph Diffusion Functionals","date":"2023-07-01","arxiv_id":"2307.00222","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":3,"official":{"repos":["Dandy5721/GNN-PDE-COV"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/re-think-and-re-design-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2307.00222","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00222"}}}},{"paper":"/paper/the-split-matters-flat-minima-methods-for","slug":"the-split-matters-flat-minima-methods-for","title":"The Split Matters: Flat Minima Methods for Improving the Performance of GNNs","date":"2023-06-15","arxiv_id":"2306.09121","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/clarify-confused-nodes-through-separated","slug":"clarify-confused-nodes-through-separated","title":"Clarify Confused Nodes via Separated Learning","date":"2023-06-04","arxiv_id":"2306.02285","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-entropy-minimization-for-semi","slug":"graph-entropy-minimization-for-semi","title":"Graph Entropy Minimization for Semi-supervised Node Classification","date":"2023-05-31","arxiv_id":"2305.19502","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/ness-learning-node-embeddings-from-static","slug":"ness-learning-node-embeddings-from-static","title":"NESS: Node Embeddings from Static SubGraphs","date":"2023-03-15","arxiv_id":"2303.08958","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/multi-mask-aggregators-for-graph-neural","slug":"multi-mask-aggregators-for-graph-neural","title":"Multi-Mask Aggregators for Graph Neural Networks","date":"2022-11-24","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/beyond-homophily-with-graph-echo-state-1","slug":"beyond-homophily-with-graph-echo-state-1","title":"Beyond Homophily with Graph Echo State Networks","date":"2022-10-27","arxiv_id":"2210.15731","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-trees-with-attention","slug":"graph-trees-with-attention","title":"TREE-G: Decision Trees Contesting Graph Neural Networks","date":"2022-07-06","arxiv_id":"2207.02760","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["mayabechlerspeicher/tree-g"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-trees-with-attention#ran","syntology_url":"https://syntology.ai/paper/2207.02760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02760"}}}},{"paper":"/paper/diffwire-inductive-graph-rewiring-via-the","slug":"diffwire-inductive-graph-rewiring-via-the","title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","date":"2022-06-15","arxiv_id":"2206.07369","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/graphmae-self-supervised-masked-graph","slug":"graphmae-self-supervised-masked-graph","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","date":"2022-05-22","arxiv_id":"2205.10803","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["thudm/graphmae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graphmae-self-supervised-masked-graph#ran","syntology_url":"https://syntology.ai/paper/2205.10803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10803"}}}},{"paper":"/paper/how-to-find-your-friendly-neighborhood-graph-1","slug":"how-to-find-your-friendly-neighborhood-graph-1","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","date":"2022-04-11","arxiv_id":"2204.04879","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["dongkwan-kim/SuperGAT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-to-find-your-friendly-neighborhood-graph-1#ran","syntology_url":"https://syntology.ai/paper/2204.04879","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.04879"}}}},{"paper":"/paper/inferring-from-references-with-differences","slug":"inferring-from-references-with-differences","title":"Inferring from References with Differences for Semi-Supervised Node Classification on Graphs","date":"2022-04-11","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/view-consistent-heterogeneous-network-on","slug":"view-consistent-heterogeneous-network-on","title":"View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes","date":"2022-03-17","arxiv_id":null,"rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/graph-representation-learning-beyond-node-and","slug":"graph-representation-learning-beyond-node-and","title":"Graph Representation Learning Beyond Node and Homophily","date":"2022-03-03","arxiv_id":"2203.01564","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/pppne-personalized-proximity-preserved","slug":"pppne-personalized-proximity-preserved","title":"PPPNE: Personalized proximity preserved network embedding","date":"2022-02-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/cn-motifs-perceptive-graph-neural-networks","slug":"cn-motifs-perceptive-graph-neural-networks","title":"CN-Motifs Perceptive Graph Neural Networks","date":"2021-11-15","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/tackling-oversmoothing-of-gnns-with-1","slug":"tackling-oversmoothing-of-gnns-with-1","title":"Deeper-GXX: Deepening Arbitrary GNNs","date":"2021-10-26","arxiv_id":"2110.13798","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/fdgatii-fast-dynamic-graph-attention-with","slug":"fdgatii-fast-dynamic-graph-attention-with","title":"FDGATII : Fast Dynamic Graph Attention with Initial Residual and Identity Mapping","date":"2021-10-21","arxiv_id":"2110.11464","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-less-neural-networks-teaching-old-mlps-1","slug":"graph-less-neural-networks-teaching-old-mlps-1","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","date":"2021-10-17","arxiv_id":"2110.08727","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":8,"official":{"repos":["snap-research/graphless-neural-networks"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-less-neural-networks-teaching-old-mlps-1#ran","syntology_url":"https://syntology.ai/paper/2110.08727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.08727"}}}},{"paper":"/paper/neural-link-prediction-with-walk-pooling-1","slug":"neural-link-prediction-with-walk-pooling-1","title":"Neural Link Prediction with Walk Pooling","date":"2021-10-08","arxiv_id":"2110.04375","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/is-heterophily-a-real-nightmare-for-graph","slug":"is-heterophily-a-real-nightmare-for-graph","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","date":"2021-09-12","arxiv_id":"2109.05641","rows_on_this_dataset":4,"code_links":0,"syntology":null},{"paper":"/paper/tree-decomposed-graph-neural-network","slug":"tree-decomposed-graph-neural-network","title":"Tree Decomposed Graph Neural Network","date":"2021-08-25","arxiv_id":"2108.11022","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/variational-graph-normalized-auto-encoders","slug":"variational-graph-normalized-auto-encoders","title":"Variational Graph Normalized Auto-Encoders","date":"2021-08-18","arxiv_id":"2108.08046","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/rethinking-graph-autoencoder-models-for","slug":"rethinking-graph-autoencoder-models-for","title":"Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering","date":"2021-07-19","arxiv_id":"2107.08562","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["nairouz/R-GAE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/rethinking-graph-autoencoder-models-for#ran","syntology_url":"https://syntology.ai/paper/2107.08562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08562"}}}},{"paper":"/paper/distilling-self-knowledge-from-contrastive","slug":"distilling-self-knowledge-from-contrastive","title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","date":"2021-06-16","arxiv_id":"2106.08541","rows_on_this_dataset":8,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["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":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/neural-bellman-ford-networks-a-general-graph","slug":"neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","arxiv_id":"2106.06935","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["DeepGraphLearning/NBFNet"],"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":["community","listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-bellman-ford-networks-a-general-graph#ran","syntology_url":"https://syntology.ai/paper/2106.06935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06935"}}}},{"paper":"/paper/extract-the-knowledge-of-graph-neural","slug":"extract-the-knowledge-of-graph-neural","title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","date":"2021-03-04","arxiv_id":"2103.02885","rows_on_this_dataset":6,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/slaps-self-supervision-improves-structure-1","slug":"slaps-self-supervision-improves-structure-1","title":"SLAPS: Self-Supervision Improves Structure Learning for Graph Neural Networks","date":"2021-02-09","arxiv_id":"2102.05034","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cleora-a-simple-strong-and-scalable-graph","slug":"cleora-a-simple-strong-and-scalable-graph","title":"Cleora: A Simple, Strong and Scalable Graph Embedding Scheme","date":"2021-02-03","arxiv_id":"2102.02302","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/simple-spectral-graph-convolution","slug":"simple-spectral-graph-convolution","title":"Simple Spectral Graph Convolution","date":"2021-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/graph-infoclust-leveraging-cluster-level-node","slug":"graph-infoclust-leveraging-cluster-level-node","title":"Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning","date":"2020-09-15","arxiv_id":"2009.06946","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-infoclust-leveraging-cluster-level-node#ran","syntology_url":"https://syntology.ai/paper/2009.06946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.06946"}}}},{"paper":"/paper/snore-scalable-unsupervised-learning-of","slug":"snore-scalable-unsupervised-learning-of","title":"SNoRe: Scalable Unsupervised Learning of Symbolic Node Representations","date":"2020-09-08","arxiv_id":"2009.04535","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mutual-teaching-for-graph-convolutional","slug":"mutual-teaching-for-graph-convolutional","title":"Mutual Teaching for Graph Convolutional Networks","date":"2020-09-02","arxiv_id":"2009.00952","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/optimization-of-graph-neural-networks-with","slug":"optimization-of-graph-neural-networks-with","title":"Optimization of Graph Neural Networks with Natural Gradient Descent","date":"2020-08-21","arxiv_id":"2008.09624","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":5,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":4,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/nodenet-a-graph-regularised-neural-network","slug":"nodenet-a-graph-regularised-neural-network","title":"NodeNet: A Graph Regularised Neural Network for Node Classification","date":"2020-06-16","arxiv_id":"2006.09022","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/data-augmentation-for-graph-neural-networks","slug":"data-augmentation-for-graph-neural-networks","title":"Data Augmentation for Graph Neural Networks","date":"2020-06-11","arxiv_id":"2006.06830","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/deep-graph-contrastive-representation","slug":"deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","arxiv_id":"2006.04131","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":15,"samples_constructed":1,"samples_ran_checked":9,"samples_ran_instrument_failed":6,"samples_unverified":7,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/bridging-the-gap-between-spectral-and-spatial","slug":"bridging-the-gap-between-spectral-and-spatial","title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","date":"2020-03-26","arxiv_id":"2003.11702","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/unifying-graph-convolutional-neural-networks-1","slug":"unifying-graph-convolutional-neural-networks-1","title":"Unifying Graph Convolutional Neural Networks and Label Propagation","date":"2020-02-17","arxiv_id":"2002.06755","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/get-rid-of-suspended-animation-problem-deep","slug":"get-rid-of-suspended-animation-problem-deep","title":"Get Rid of Suspended Animation Problem: Deep Diffusive Neural Network on Graph Semi-Supervised Classification","date":"2020-01-22","arxiv_id":"2001.07922","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/graph-bert-only-attention-is-needed-for","slug":"graph-bert-only-attention-is-needed-for","title":"Graph-Bert: Only Attention is Needed for Learning Graph Representations","date":"2020-01-15","arxiv_id":"2001.05140","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/gaussian-embedding-of-large-scale-attributed","slug":"gaussian-embedding-of-large-scale-attributed","title":"Gaussian Embedding of Large-scale Attributed Graphs","date":"2019-12-02","arxiv_id":"1912.00536","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-capsule-network-based-model-for-learning","slug":"a-capsule-network-based-model-for-learning","title":"A Capsule Network-based Model for Learning Node Embeddings","date":"2019-11-12","arxiv_id":"1911.04822","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graphair-graph-representation-learning-with","slug":"graphair-graph-representation-learning-with","title":"GraphAIR: Graph Representation Learning with Neighborhood Aggregation and Interaction","date":"2019-11-05","arxiv_id":"1911.01731","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":7,"official":{"repos":["CRIPAC-DIG/GraphAIR"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graphair-graph-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/1911.01731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01731"}}}},{"paper":"/paper/hyperbolic-graph-convolutional-neural","slug":"hyperbolic-graph-convolutional-neural","title":"Hyperbolic Graph Convolutional Neural Networks","date":"2019-10-28","arxiv_id":"1910.12933","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/pre-train-and-learn-preserve-global","slug":"pre-train-and-learn-preserve-global","title":"Pre-train and Learn: Preserve Global Information for Graph Neural Networks","date":"2019-10-27","arxiv_id":"1910.12241","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dfnets-spectral-cnns-for-graphs-with-feedback","slug":"dfnets-spectral-cnns-for-graphs-with-feedback","title":"DFNets: Spectral CNNs for Graphs with Feedback-Looped Filters","date":"2019-10-24","arxiv_id":"1910.10866","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["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":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/rethinking-kernel-methods-for-node","slug":"rethinking-kernel-methods-for-node","title":"Rethinking Kernel Methods for Node Representation Learning on Graphs","date":"2019-10-06","arxiv_id":"1910.02548","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graphmix-regularized-training-of-graph-neural","slug":"graphmix-regularized-training-of-graph-neural","title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","date":"2019-09-25","arxiv_id":"1909.11715","rows_on_this_dataset":6,"code_links":1,"syntology":null},{"paper":"/paper/gresnet-graph-residuals-for-reviving-deep","slug":"gresnet-graph-residuals-for-reviving-deep","title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","date":"2019-09-12","arxiv_id":"1909.05729","rows_on_this_dataset":4,"code_links":2,"syntology":null},{"paper":"/paper/auto-gnn-neural-architecture-search-of-graph","slug":"auto-gnn-neural-architecture-search-of-graph","title":"Auto-GNN: Neural Architecture Search of Graph Neural Networks","date":"2019-09-07","arxiv_id":"1909.03184","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/measuring-and-relieving-the-over-smoothing","slug":"measuring-and-relieving-the-over-smoothing","title":"Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological View","date":"2019-09-07","arxiv_id":"1909.03211","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":39,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":2,"samples_unverified":28,"pointer_only_for_licence":4,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/hpgat-high-order-proximity-informed-graph","slug":"hpgat-high-order-proximity-informed-graph","title":"hpGAT: High-order Proximity Informed Graph Attention Network","date":"2019-08-28","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/adagcn-adaboosting-graph-convolutional","slug":"adagcn-adaboosting-graph-convolutional","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","date":"2019-08-14","arxiv_id":"1908.05081","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/rwr-gae-random-walk-regularization-for-graph","slug":"rwr-gae-random-walk-regularization-for-graph","title":"RWR-GAE: Random Walk Regularization for Graph Auto Encoders","date":"2019-08-12","arxiv_id":"1908.04003","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["MysteryVaibhav/DW-GAE"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/rwr-gae-random-walk-regularization-for-graph#ran","syntology_url":"https://syntology.ai/paper/1908.04003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04003"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/structure-fusion-based-on-graph-convolutional","slug":"structure-fusion-based-on-graph-convolutional","title":"Structure fusion based on graph convolutional networks for semi-supervised classification","date":"2019-07-02","arxiv_id":"1907.02586","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/certifiable-robustness-and-robust-training","slug":"certifiable-robustness-and-robust-training","title":"Certifiable Robustness and Robust Training for Graph Convolutional Networks","date":"2019-06-28","arxiv_id":"1906.12269","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/certifiable-robustness-and-robust-training#ran","syntology_url":"https://syntology.ai/paper/1906.12269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12269"}}}},{"paper":"/paper/graph-star-net-for-generalized-multi-task-1","slug":"graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","arxiv_id":"1906.12330","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}}}},{"paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","slug":"break-the-ceiling-stronger-multi-scale-deep","title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","date":"2019-06-05","arxiv_id":"1906.02174","rows_on_this_dataset":15,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/attributed-graph-clustering-via-adaptive","slug":"attributed-graph-clustering-via-adaptive","title":"Attributed Graph Clustering via Adaptive Graph Convolution","date":"2019-06-04","arxiv_id":"1906.01210","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-flexible-generative-framework-for-graph","slug":"a-flexible-generative-framework-for-graph","title":"A Flexible Generative Framework for Graph-based Semi-supervised Learning","date":"2019-05-26","arxiv_id":"1905.10769","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["jiaqima/G3NN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-flexible-generative-framework-for-graph#ran","syntology_url":"https://syntology.ai/paper/1905.10769","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10769"}}}},{"paper":"/paper/neighborhood-enlargement-in-graph-neural","slug":"neighborhood-enlargement-in-graph-neural","title":"Mutual Information Maximization in Graph Neural Networks","date":"2019-05-21","arxiv_id":"1905.08509","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/graph-u-nets","slug":"graph-u-nets","title":"Graph U-Nets","date":"2019-05-11","arxiv_id":"1905.05178","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["HongyangGao/gunet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-u-nets#ran","syntology_url":"https://syntology.ai/paper/1905.05178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05178"}}}},{"paper":"/paper/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","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/graph-optimized-convolutional-networks","slug":"graph-optimized-convolutional-networks","title":"Robust Graph Data Learning via Latent Graph Convolutional Representation","date":"2019-04-26","arxiv_id":"1904.11883","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graphnas-graph-neural-architecture-search","slug":"graphnas-graph-neural-architecture-search","title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","date":"2019-04-22","arxiv_id":"1904.09981","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["GraphNAS/GraphNAS-simple"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graphnas-graph-neural-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1904.09981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09981"}}}},{"paper":"/paper/graph-wavelet-neural-network-1","slug":"graph-wavelet-neural-network-1","title":"Graph Wavelet Neural Network","date":"2019-04-12","arxiv_id":"1904.07785","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/adaptively-connected-neural-networks","slug":"adaptively-connected-neural-networks","title":"Adaptively Connected Neural Networks","date":"2019-04-07","arxiv_id":"1904.03579","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-discrete-structures-for-graph-neural","slug":"learning-discrete-structures-for-graph-neural","title":"Learning Discrete Structures for Graph Neural Networks","date":"2019-03-28","arxiv_id":"1903.11960","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["lucfra/LDS","lucfra/LDS-GNN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-discrete-structures-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1903.11960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.11960"}}}},{"paper":"/paper/fast-graph-representation-learning-with","slug":"fast-graph-representation-learning-with","title":"Fast Graph Representation Learning with PyTorch Geometric","date":"2019-03-06","arxiv_id":"1903.02428","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["rusty1s/pytorch_geometric"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fast-graph-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/1903.02428","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.02428"}}}},{"paper":"/paper/graph-adversarial-training-dynamically","slug":"graph-adversarial-training-dynamically","title":"Graph Adversarial Training: Dynamically Regularizing Based on Graph Structure","date":"2019-02-20","arxiv_id":"1902.08226","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/semi-supervised-node-classification-via","slug":"semi-supervised-node-classification-via","title":"Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification","date":"2019-02-13","arxiv_id":"1902.06667","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":7,"official":{"repos":["CRIPAC-DIG/H-GCN"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/semi-supervised-node-classification-via#ran","syntology_url":"https://syntology.ai/paper/1902.06667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06667"}}}},{"paper":"/paper/lanczosnet-multi-scale-deep-graph","slug":"lanczosnet-multi-scale-deep-graph","title":"LanczosNet: Multi-Scale Deep Graph Convolutional Networks","date":"2019-01-06","arxiv_id":"1901.01484","rows_on_this_dataset":8,"code_links":1,"syntology":null},{"paper":"/paper/multi-task-graph-autoencoders","slug":"multi-task-graph-autoencoders","title":"Multi-Task Graph Autoencoders","date":"2018-11-07","arxiv_id":"1811.02798","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":1,"official":{"repos":["vuptran/graph-representation-learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-task-graph-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1811.02798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.02798"}}}},{"paper":"/paper/binarized-attributed-network-embedding","slug":"binarized-attributed-network-embedding","title":"Binarized Attributed Network Embedding","date":"2018-10-22","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/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","rows_on_this_dataset":2,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/encoding-robust-representation-for-graph","slug":"encoding-robust-representation-for-graph","title":"Encoding Robust Representation for Graph Generation","date":"2018-09-28","arxiv_id":"1809.10851","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deep-graph-infomax","slug":"deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","arxiv_id":"1809.10341","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":35,"samples_ran":26,"samples_constructed":11,"samples_ran_checked":22,"samples_ran_instrument_failed":4,"samples_unverified":9,"pointer_only_for_licence":10,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/every-node-counts-self-ensembling-graph","slug":"every-node-counts-self-ensembling-graph","title":"Every Node Counts: Self-Ensembling Graph Convolutional Networks for Semi-Supervised Learning","date":"2018-09-26","arxiv_id":"1809.09925","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/adaptive-sampling-towards-fast-graph","slug":"adaptive-sampling-towards-fast-graph","title":"Adaptive Sampling Towards Fast Graph Representation Learning","date":"2018-09-14","arxiv_id":"1809.05343","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/large-scale-learnable-graph-convolutional","slug":"large-scale-learnable-graph-convolutional","title":"Large-Scale Learnable Graph Convolutional Networks","date":"2018-08-12","arxiv_id":"1808.03965","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/hyperspherical-variational-auto-encoders","slug":"hyperspherical-variational-auto-encoders","title":"Hyperspherical Variational Auto-Encoders","date":"2018-04-03","arxiv_id":"1804.00891","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":0,"official":{"repos":["nicola-decao/s-vae","nicola-decao/s-vae-pytorch","nicola-decao/s-vae-tf"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyperspherical-variational-auto-encoders#ran","syntology_url":"https://syntology.ai/paper/1804.00891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00891"}}}},{"paper":"/paper/graph-convolutional-neural-networks-via-1","slug":"graph-convolutional-neural-networks-via-1","title":"Graph Convolutional Neural Networks via Scattering","date":"2018-03-31","arxiv_id":"1804.00099","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-convolutional-neural-networks-via-1#ran","syntology_url":"https://syntology.ai/paper/1804.00099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00099"}}}},{"paper":"/paper/graphite-iterative-generative-modeling-of","slug":"graphite-iterative-generative-modeling-of","title":"Graphite: Iterative Generative Modeling of Graphs","date":"2018-03-28","arxiv_id":"1803.10459","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/n-gcn-multi-scale-graph-convolution-for-semi","slug":"n-gcn-multi-scale-graph-convolution-for-semi","title":"N-GCN: Multi-scale Graph Convolution for Semi-supervised Node Classification","date":"2018-02-24","arxiv_id":"1802.08888","rows_on_this_dataset":1,"code_links":1,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/scale-invariance-of-graph-neural-networks","slug":"scale-invariance-of-graph-neural-networks","title":"Scale Invariance of Graph Neural Networks","date":"2024-11-28","arxiv_id":"2411.19392","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/faster-inference-time-for-gnns-using","slug":"faster-inference-time-for-gnns-using","title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","date":"2024-10-19","arxiv_id":"2410.15001","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/classic-gnns-are-strong-baselines-reassessing","slug":"classic-gnns-are-strong-baselines-reassessing","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","date":"2024-06-13","arxiv_id":"2406.08993","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":4,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/gscan-graph-stability-clustering-for","slug":"gscan-graph-stability-clustering-for","title":"GSCAN: Graph Stability Clustering for Applications With Noise Using Edge-Aware Excess-of-Mass","date":"2024-04-17","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/strong-transitivity-relations-and-graph","slug":"strong-transitivity-relations-and-graph","title":"Strong Transitivity Relations and Graph Neural Networks","date":"2024-01-01","arxiv_id":"2401.01384","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mitigating-degree-biases-in-message-passing","slug":"mitigating-degree-biases-in-message-passing","title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","date":"2023-12-28","arxiv_id":"2312.16788","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/contrastive-deep-nonnegative-matrix","slug":"contrastive-deep-nonnegative-matrix","title":"Contrastive Deep Nonnegative Matrix Factorization for Community Detection","date":"2023-11-04","arxiv_id":"2311.02357","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/from-cluster-assumption-to-graph-convolution","slug":"from-cluster-assumption-to-graph-convolution","title":"From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited","date":"2023-09-24","arxiv_id":"2309.13599","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":26,"samples_ran":19,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":6,"samples_unverified":7,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/re-think-and-re-design-graph-neural-networks","slug":"re-think-and-re-design-graph-neural-networks","title":"Re-Think and Re-Design Graph Neural Networks in Spaces of Continuous Graph Diffusion Functionals","date":"2023-07-01","arxiv_id":"2307.00222","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":3,"official":{"repos":["Dandy5721/GNN-PDE-COV"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/re-think-and-re-design-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2307.00222","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00222"}}}},{"paper":"/paper/the-split-matters-flat-minima-methods-for","slug":"the-split-matters-flat-minima-methods-for","title":"The Split Matters: Flat Minima Methods for Improving the Performance of GNNs","date":"2023-06-15","arxiv_id":"2306.09121","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/clarify-confused-nodes-through-separated","slug":"clarify-confused-nodes-through-separated","title":"Clarify Confused Nodes via Separated Learning","date":"2023-06-04","arxiv_id":"2306.02285","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-entropy-minimization-for-semi","slug":"graph-entropy-minimization-for-semi","title":"Graph Entropy Minimization for Semi-supervised Node Classification","date":"2023-05-31","arxiv_id":"2305.19502","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/ness-learning-node-embeddings-from-static","slug":"ness-learning-node-embeddings-from-static","title":"NESS: Node Embeddings from Static SubGraphs","date":"2023-03-15","arxiv_id":"2303.08958","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/multi-mask-aggregators-for-graph-neural","slug":"multi-mask-aggregators-for-graph-neural","title":"Multi-Mask Aggregators for Graph Neural Networks","date":"2022-11-24","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/beyond-homophily-with-graph-echo-state-1","slug":"beyond-homophily-with-graph-echo-state-1","title":"Beyond Homophily with Graph Echo State Networks","date":"2022-10-27","arxiv_id":"2210.15731","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-trees-with-attention","slug":"graph-trees-with-attention","title":"TREE-G: Decision Trees Contesting Graph Neural Networks","date":"2022-07-06","arxiv_id":"2207.02760","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["mayabechlerspeicher/tree-g"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-trees-with-attention#ran","syntology_url":"https://syntology.ai/paper/2207.02760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02760"}}}},{"paper":"/paper/diffwire-inductive-graph-rewiring-via-the","slug":"diffwire-inductive-graph-rewiring-via-the","title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","date":"2022-06-15","arxiv_id":"2206.07369","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/graphmae-self-supervised-masked-graph","slug":"graphmae-self-supervised-masked-graph","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","date":"2022-05-22","arxiv_id":"2205.10803","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["thudm/graphmae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graphmae-self-supervised-masked-graph#ran","syntology_url":"https://syntology.ai/paper/2205.10803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10803"}}}},{"paper":"/paper/how-to-find-your-friendly-neighborhood-graph-1","slug":"how-to-find-your-friendly-neighborhood-graph-1","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","date":"2022-04-11","arxiv_id":"2204.04879","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["dongkwan-kim/SuperGAT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-to-find-your-friendly-neighborhood-graph-1#ran","syntology_url":"https://syntology.ai/paper/2204.04879","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.04879"}}}},{"paper":"/paper/inferring-from-references-with-differences","slug":"inferring-from-references-with-differences","title":"Inferring from References with Differences for Semi-Supervised Node Classification on Graphs","date":"2022-04-11","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/view-consistent-heterogeneous-network-on","slug":"view-consistent-heterogeneous-network-on","title":"View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes","date":"2022-03-17","arxiv_id":null,"rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/graph-representation-learning-beyond-node-and","slug":"graph-representation-learning-beyond-node-and","title":"Graph Representation Learning Beyond Node and Homophily","date":"2022-03-03","arxiv_id":"2203.01564","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/pppne-personalized-proximity-preserved","slug":"pppne-personalized-proximity-preserved","title":"PPPNE: Personalized proximity preserved network embedding","date":"2022-02-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/cn-motifs-perceptive-graph-neural-networks","slug":"cn-motifs-perceptive-graph-neural-networks","title":"CN-Motifs Perceptive Graph Neural Networks","date":"2021-11-15","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/tackling-oversmoothing-of-gnns-with-1","slug":"tackling-oversmoothing-of-gnns-with-1","title":"Deeper-GXX: Deepening Arbitrary GNNs","date":"2021-10-26","arxiv_id":"2110.13798","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/fdgatii-fast-dynamic-graph-attention-with","slug":"fdgatii-fast-dynamic-graph-attention-with","title":"FDGATII : Fast Dynamic Graph Attention with Initial Residual and Identity Mapping","date":"2021-10-21","arxiv_id":"2110.11464","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-less-neural-networks-teaching-old-mlps-1","slug":"graph-less-neural-networks-teaching-old-mlps-1","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","date":"2021-10-17","arxiv_id":"2110.08727","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":8,"official":{"repos":["snap-research/graphless-neural-networks"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-less-neural-networks-teaching-old-mlps-1#ran","syntology_url":"https://syntology.ai/paper/2110.08727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.08727"}}}},{"paper":"/paper/neural-link-prediction-with-walk-pooling-1","slug":"neural-link-prediction-with-walk-pooling-1","title":"Neural Link Prediction with Walk Pooling","date":"2021-10-08","arxiv_id":"2110.04375","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/is-heterophily-a-real-nightmare-for-graph","slug":"is-heterophily-a-real-nightmare-for-graph","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","date":"2021-09-12","arxiv_id":"2109.05641","rows_on_this_dataset":4,"code_links":0,"syntology":null},{"paper":"/paper/tree-decomposed-graph-neural-network","slug":"tree-decomposed-graph-neural-network","title":"Tree Decomposed Graph Neural Network","date":"2021-08-25","arxiv_id":"2108.11022","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/variational-graph-normalized-auto-encoders","slug":"variational-graph-normalized-auto-encoders","title":"Variational Graph Normalized Auto-Encoders","date":"2021-08-18","arxiv_id":"2108.08046","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/rethinking-graph-autoencoder-models-for","slug":"rethinking-graph-autoencoder-models-for","title":"Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering","date":"2021-07-19","arxiv_id":"2107.08562","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["nairouz/R-GAE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/rethinking-graph-autoencoder-models-for#ran","syntology_url":"https://syntology.ai/paper/2107.08562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08562"}}}},{"paper":"/paper/distilling-self-knowledge-from-contrastive","slug":"distilling-self-knowledge-from-contrastive","title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","date":"2021-06-16","arxiv_id":"2106.08541","rows_on_this_dataset":8,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["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":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/neural-bellman-ford-networks-a-general-graph","slug":"neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","arxiv_id":"2106.06935","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["DeepGraphLearning/NBFNet"],"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":["community","listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-bellman-ford-networks-a-general-graph#ran","syntology_url":"https://syntology.ai/paper/2106.06935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06935"}}}},{"paper":"/paper/extract-the-knowledge-of-graph-neural","slug":"extract-the-knowledge-of-graph-neural","title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","date":"2021-03-04","arxiv_id":"2103.02885","rows_on_this_dataset":6,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/slaps-self-supervision-improves-structure-1","slug":"slaps-self-supervision-improves-structure-1","title":"SLAPS: Self-Supervision Improves Structure Learning for Graph Neural Networks","date":"2021-02-09","arxiv_id":"2102.05034","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cleora-a-simple-strong-and-scalable-graph","slug":"cleora-a-simple-strong-and-scalable-graph","title":"Cleora: A Simple, Strong and Scalable Graph Embedding Scheme","date":"2021-02-03","arxiv_id":"2102.02302","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/simple-spectral-graph-convolution","slug":"simple-spectral-graph-convolution","title":"Simple Spectral Graph Convolution","date":"2021-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/graph-infoclust-leveraging-cluster-level-node","slug":"graph-infoclust-leveraging-cluster-level-node","title":"Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning","date":"2020-09-15","arxiv_id":"2009.06946","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-infoclust-leveraging-cluster-level-node#ran","syntology_url":"https://syntology.ai/paper/2009.06946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.06946"}}}},{"paper":"/paper/snore-scalable-unsupervised-learning-of","slug":"snore-scalable-unsupervised-learning-of","title":"SNoRe: Scalable Unsupervised Learning of Symbolic Node Representations","date":"2020-09-08","arxiv_id":"2009.04535","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mutual-teaching-for-graph-convolutional","slug":"mutual-teaching-for-graph-convolutional","title":"Mutual Teaching for Graph Convolutional Networks","date":"2020-09-02","arxiv_id":"2009.00952","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/optimization-of-graph-neural-networks-with","slug":"optimization-of-graph-neural-networks-with","title":"Optimization of Graph Neural Networks with Natural Gradient Descent","date":"2020-08-21","arxiv_id":"2008.09624","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":5,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":4,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/nodenet-a-graph-regularised-neural-network","slug":"nodenet-a-graph-regularised-neural-network","title":"NodeNet: A Graph Regularised Neural Network for Node Classification","date":"2020-06-16","arxiv_id":"2006.09022","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/data-augmentation-for-graph-neural-networks","slug":"data-augmentation-for-graph-neural-networks","title":"Data Augmentation for Graph Neural Networks","date":"2020-06-11","arxiv_id":"2006.06830","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/deep-graph-contrastive-representation","slug":"deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","arxiv_id":"2006.04131","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":15,"samples_constructed":1,"samples_ran_checked":9,"samples_ran_instrument_failed":6,"samples_unverified":7,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/bridging-the-gap-between-spectral-and-spatial","slug":"bridging-the-gap-between-spectral-and-spatial","title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","date":"2020-03-26","arxiv_id":"2003.11702","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/unifying-graph-convolutional-neural-networks-1","slug":"unifying-graph-convolutional-neural-networks-1","title":"Unifying Graph Convolutional Neural Networks and Label Propagation","date":"2020-02-17","arxiv_id":"2002.06755","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/get-rid-of-suspended-animation-problem-deep","slug":"get-rid-of-suspended-animation-problem-deep","title":"Get Rid of Suspended Animation Problem: Deep Diffusive Neural Network on Graph Semi-Supervised Classification","date":"2020-01-22","arxiv_id":"2001.07922","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/graph-bert-only-attention-is-needed-for","slug":"graph-bert-only-attention-is-needed-for","title":"Graph-Bert: Only Attention is Needed for Learning Graph Representations","date":"2020-01-15","arxiv_id":"2001.05140","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/gaussian-embedding-of-large-scale-attributed","slug":"gaussian-embedding-of-large-scale-attributed","title":"Gaussian Embedding of Large-scale Attributed Graphs","date":"2019-12-02","arxiv_id":"1912.00536","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-capsule-network-based-model-for-learning","slug":"a-capsule-network-based-model-for-learning","title":"A Capsule Network-based Model for Learning Node Embeddings","date":"2019-11-12","arxiv_id":"1911.04822","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graphair-graph-representation-learning-with","slug":"graphair-graph-representation-learning-with","title":"GraphAIR: Graph Representation Learning with Neighborhood Aggregation and Interaction","date":"2019-11-05","arxiv_id":"1911.01731","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":7,"official":{"repos":["CRIPAC-DIG/GraphAIR"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graphair-graph-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/1911.01731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01731"}}}},{"paper":"/paper/hyperbolic-graph-convolutional-neural","slug":"hyperbolic-graph-convolutional-neural","title":"Hyperbolic Graph Convolutional Neural Networks","date":"2019-10-28","arxiv_id":"1910.12933","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/pre-train-and-learn-preserve-global","slug":"pre-train-and-learn-preserve-global","title":"Pre-train and Learn: Preserve Global Information for Graph Neural Networks","date":"2019-10-27","arxiv_id":"1910.12241","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dfnets-spectral-cnns-for-graphs-with-feedback","slug":"dfnets-spectral-cnns-for-graphs-with-feedback","title":"DFNets: Spectral CNNs for Graphs with Feedback-Looped Filters","date":"2019-10-24","arxiv_id":"1910.10866","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["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":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/rethinking-kernel-methods-for-node","slug":"rethinking-kernel-methods-for-node","title":"Rethinking Kernel Methods for Node Representation Learning on Graphs","date":"2019-10-06","arxiv_id":"1910.02548","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graphmix-regularized-training-of-graph-neural","slug":"graphmix-regularized-training-of-graph-neural","title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","date":"2019-09-25","arxiv_id":"1909.11715","rows_on_this_dataset":6,"code_links":1,"syntology":null},{"paper":"/paper/gresnet-graph-residuals-for-reviving-deep","slug":"gresnet-graph-residuals-for-reviving-deep","title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","date":"2019-09-12","arxiv_id":"1909.05729","rows_on_this_dataset":4,"code_links":2,"syntology":null},{"paper":"/paper/auto-gnn-neural-architecture-search-of-graph","slug":"auto-gnn-neural-architecture-search-of-graph","title":"Auto-GNN: Neural Architecture Search of Graph Neural Networks","date":"2019-09-07","arxiv_id":"1909.03184","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/measuring-and-relieving-the-over-smoothing","slug":"measuring-and-relieving-the-over-smoothing","title":"Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological View","date":"2019-09-07","arxiv_id":"1909.03211","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":39,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":2,"samples_unverified":28,"pointer_only_for_licence":4,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/hpgat-high-order-proximity-informed-graph","slug":"hpgat-high-order-proximity-informed-graph","title":"hpGAT: High-order Proximity Informed Graph Attention Network","date":"2019-08-28","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/adagcn-adaboosting-graph-convolutional","slug":"adagcn-adaboosting-graph-convolutional","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","date":"2019-08-14","arxiv_id":"1908.05081","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/rwr-gae-random-walk-regularization-for-graph","slug":"rwr-gae-random-walk-regularization-for-graph","title":"RWR-GAE: Random Walk Regularization for Graph Auto Encoders","date":"2019-08-12","arxiv_id":"1908.04003","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["MysteryVaibhav/DW-GAE"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/rwr-gae-random-walk-regularization-for-graph#ran","syntology_url":"https://syntology.ai/paper/1908.04003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04003"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/structure-fusion-based-on-graph-convolutional","slug":"structure-fusion-based-on-graph-convolutional","title":"Structure fusion based on graph convolutional networks for semi-supervised classification","date":"2019-07-02","arxiv_id":"1907.02586","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/certifiable-robustness-and-robust-training","slug":"certifiable-robustness-and-robust-training","title":"Certifiable Robustness and Robust Training for Graph Convolutional Networks","date":"2019-06-28","arxiv_id":"1906.12269","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/certifiable-robustness-and-robust-training#ran","syntology_url":"https://syntology.ai/paper/1906.12269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12269"}}}},{"paper":"/paper/graph-star-net-for-generalized-multi-task-1","slug":"graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","arxiv_id":"1906.12330","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}}}},{"paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","slug":"break-the-ceiling-stronger-multi-scale-deep","title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","date":"2019-06-05","arxiv_id":"1906.02174","rows_on_this_dataset":15,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/attributed-graph-clustering-via-adaptive","slug":"attributed-graph-clustering-via-adaptive","title":"Attributed Graph Clustering via Adaptive Graph Convolution","date":"2019-06-04","arxiv_id":"1906.01210","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-flexible-generative-framework-for-graph","slug":"a-flexible-generative-framework-for-graph","title":"A Flexible Generative Framework for Graph-based Semi-supervised Learning","date":"2019-05-26","arxiv_id":"1905.10769","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["jiaqima/G3NN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-flexible-generative-framework-for-graph#ran","syntology_url":"https://syntology.ai/paper/1905.10769","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10769"}}}},{"paper":"/paper/neighborhood-enlargement-in-graph-neural","slug":"neighborhood-enlargement-in-graph-neural","title":"Mutual Information Maximization in Graph Neural Networks","date":"2019-05-21","arxiv_id":"1905.08509","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/graph-u-nets","slug":"graph-u-nets","title":"Graph U-Nets","date":"2019-05-11","arxiv_id":"1905.05178","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["HongyangGao/gunet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-u-nets#ran","syntology_url":"https://syntology.ai/paper/1905.05178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05178"}}}},{"paper":"/paper/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","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/graph-optimized-convolutional-networks","slug":"graph-optimized-convolutional-networks","title":"Robust Graph Data Learning via Latent Graph Convolutional Representation","date":"2019-04-26","arxiv_id":"1904.11883","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graphnas-graph-neural-architecture-search","slug":"graphnas-graph-neural-architecture-search","title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","date":"2019-04-22","arxiv_id":"1904.09981","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["GraphNAS/GraphNAS-simple"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graphnas-graph-neural-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1904.09981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09981"}}}},{"paper":"/paper/graph-wavelet-neural-network-1","slug":"graph-wavelet-neural-network-1","title":"Graph Wavelet Neural Network","date":"2019-04-12","arxiv_id":"1904.07785","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/adaptively-connected-neural-networks","slug":"adaptively-connected-neural-networks","title":"Adaptively Connected Neural Networks","date":"2019-04-07","arxiv_id":"1904.03579","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-discrete-structures-for-graph-neural","slug":"learning-discrete-structures-for-graph-neural","title":"Learning Discrete Structures for Graph Neural Networks","date":"2019-03-28","arxiv_id":"1903.11960","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["lucfra/LDS","lucfra/LDS-GNN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-discrete-structures-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1903.11960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.11960"}}}},{"paper":"/paper/fast-graph-representation-learning-with","slug":"fast-graph-representation-learning-with","title":"Fast Graph Representation Learning with PyTorch Geometric","date":"2019-03-06","arxiv_id":"1903.02428","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["rusty1s/pytorch_geometric"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fast-graph-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/1903.02428","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.02428"}}}},{"paper":"/paper/graph-adversarial-training-dynamically","slug":"graph-adversarial-training-dynamically","title":"Graph Adversarial Training: Dynamically Regularizing Based on Graph Structure","date":"2019-02-20","arxiv_id":"1902.08226","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/semi-supervised-node-classification-via","slug":"semi-supervised-node-classification-via","title":"Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification","date":"2019-02-13","arxiv_id":"1902.06667","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":7,"official":{"repos":["CRIPAC-DIG/H-GCN"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/semi-supervised-node-classification-via#ran","syntology_url":"https://syntology.ai/paper/1902.06667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06667"}}}},{"paper":"/paper/lanczosnet-multi-scale-deep-graph","slug":"lanczosnet-multi-scale-deep-graph","title":"LanczosNet: Multi-Scale Deep Graph Convolutional Networks","date":"2019-01-06","arxiv_id":"1901.01484","rows_on_this_dataset":8,"code_links":1,"syntology":null},{"paper":"/paper/multi-task-graph-autoencoders","slug":"multi-task-graph-autoencoders","title":"Multi-Task Graph Autoencoders","date":"2018-11-07","arxiv_id":"1811.02798","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":1,"official":{"repos":["vuptran/graph-representation-learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-task-graph-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1811.02798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.02798"}}}},{"paper":"/paper/binarized-attributed-network-embedding","slug":"binarized-attributed-network-embedding","title":"Binarized Attributed Network Embedding","date":"2018-10-22","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/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","rows_on_this_dataset":2,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/encoding-robust-representation-for-graph","slug":"encoding-robust-representation-for-graph","title":"Encoding Robust Representation for Graph Generation","date":"2018-09-28","arxiv_id":"1809.10851","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deep-graph-infomax","slug":"deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","arxiv_id":"1809.10341","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":35,"samples_ran":26,"samples_constructed":11,"samples_ran_checked":22,"samples_ran_instrument_failed":4,"samples_unverified":9,"pointer_only_for_licence":10,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/every-node-counts-self-ensembling-graph","slug":"every-node-counts-self-ensembling-graph","title":"Every Node Counts: Self-Ensembling Graph Convolutional Networks for Semi-Supervised Learning","date":"2018-09-26","arxiv_id":"1809.09925","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/adaptive-sampling-towards-fast-graph","slug":"adaptive-sampling-towards-fast-graph","title":"Adaptive Sampling Towards Fast Graph Representation Learning","date":"2018-09-14","arxiv_id":"1809.05343","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/large-scale-learnable-graph-convolutional","slug":"large-scale-learnable-graph-convolutional","title":"Large-Scale Learnable Graph Convolutional Networks","date":"2018-08-12","arxiv_id":"1808.03965","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/hyperspherical-variational-auto-encoders","slug":"hyperspherical-variational-auto-encoders","title":"Hyperspherical Variational Auto-Encoders","date":"2018-04-03","arxiv_id":"1804.00891","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":0,"official":{"repos":["nicola-decao/s-vae","nicola-decao/s-vae-pytorch","nicola-decao/s-vae-tf"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyperspherical-variational-auto-encoders#ran","syntology_url":"https://syntology.ai/paper/1804.00891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00891"}}}},{"paper":"/paper/graph-convolutional-neural-networks-via-1","slug":"graph-convolutional-neural-networks-via-1","title":"Graph Convolutional Neural Networks via Scattering","date":"2018-03-31","arxiv_id":"1804.00099","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-convolutional-neural-networks-via-1#ran","syntology_url":"https://syntology.ai/paper/1804.00099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00099"}}}},{"paper":"/paper/graphite-iterative-generative-modeling-of","slug":"graphite-iterative-generative-modeling-of","title":"Graphite: Iterative Generative Modeling of Graphs","date":"2018-03-28","arxiv_id":"1803.10459","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/n-gcn-multi-scale-graph-convolution-for-semi","slug":"n-gcn-multi-scale-graph-convolution-for-semi","title":"N-GCN: Multi-scale Graph Convolution for Semi-supervised Node Classification","date":"2018-02-24","arxiv_id":"1802.08888","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-to-make-predictions-on-graphs-with","slug":"learning-to-make-predictions-on-graphs-with","title":"Learning to Make Predictions on Graphs with Autoencoders","date":"2018-02-23","arxiv_id":"1802.08352","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/adversarially-regularized-graph-autoencoder","slug":"adversarially-regularized-graph-autoencoder","title":"Adversarially Regularized Graph Autoencoder for Graph Embedding","date":"2018-02-13","arxiv_id":"1802.04407","rows_on_this_dataset":3,"code_links":4,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":3,"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":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","rows_on_this_dataset":6,"code_links":93,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":106,"samples_ran":61,"samples_constructed":28,"samples_ran_checked":52,"samples_ran_instrument_failed":9,"samples_unverified":45,"pointer_only_for_licence":46,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/watch-your-step-learning-node-embeddings-via","slug":"watch-your-step-learning-node-embeddings-via","title":"Watch Your Step: Learning Node Embeddings via Graph Attention","date":"2017-10-26","arxiv_id":"1710.09599","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/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","rows_on_this_dataset":5,"code_links":20,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":5,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/variational-graph-auto-encoders","slug":"variational-graph-auto-encoders","title":"Variational Graph Auto-Encoders","date":"2016-11-21","arxiv_id":"1611.07308","rows_on_this_dataset":2,"code_links":22,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":4,"samples_unverified":2,"pointer_only_for_licence":4,"official":{"repos":["tkipf/gae"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/variational-graph-auto-encoders#ran","syntology_url":"https://syntology.ai/paper/1611.07308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.07308"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":55,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":39,"samples_constructed":13,"samples_ran_checked":34,"samples_ran_instrument_failed":5,"samples_unverified":19,"pointer_only_for_licence":23,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":5,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":2,"code_links":26,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":28,"samples_ran":15,"samples_constructed":4,"samples_ran_checked":13,"samples_ran_instrument_failed":2,"samples_unverified":13,"pointer_only_for_licence":11,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":4,"code_links":13,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/diffusion-convolutional-neural-networks","slug":"diffusion-convolutional-neural-networks","title":"Diffusion-Convolutional Neural Networks","date":"2015-11-06","arxiv_id":"1511.02136","rows_on_this_dataset":4,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":4,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":26,"samples_ran":17,"samples_constructed":0,"samples_ran_checked":17,"samples_ran_instrument_failed":0,"samples_unverified":9,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/edmot-an-edge-enhancement-approach-for-motif-1","slug":"edmot-an-edge-enhancement-approach-for-motif-1","title":"EdMot: An Edge Enhancement Approach for Motif-aware Community Detection","date":null,"arxiv_id":"1906.04560","rows_on_this_dataset":1,"code_links":2,"syntology":null}],"papers_where_code_ran":45,"papers_where_code_ran_first_page":"/dataset/cora/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/dataset/cora/papers/2","json":"/dataset/cora/papers/2.json","rows":17},{"order":"ran","page":1,"of":1,"url":"/dataset/cora/papers/ran/1","json":"/dataset/cora/papers/ran/1.json","rows":45}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":51,"samples_harvested":600,"samples_ran":381,"samples_constructed":64,"samples_ran_checked":309,"samples_ran_instrument_failed":72,"samples_unverified":219,"pointer_only_for_licence":171,"papers_with_no_sample_that_ran":6,"papers_with_a_sample_that_ran":45,"papers_with_a_run_with_no_instrument_failure":38,"papers_where_every_run_was_an_instrument_failure":7,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":34,"papers_placed":1,"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/link-prediction-on-cora","since_archive":"/sota/link-prediction-on-cora#since-judged","papers_judged":5,"placed":0},{"leaderboard":"/sota/graph-clustering-on-cora","since_archive":"/sota/graph-clustering-on-cora#since-judged","papers_judged":6,"placed":1},{"leaderboard":"/sota/community-detection-on-cora","since_archive":"/sota/community-detection-on-cora#since-judged","papers_judged":3,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"f511e9f0b566af37ee6ab8a9e2752cc2cbea3bc8ddb2a781b19e30b999bdfea2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}