{"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/citeseer/papers/ran/1","list_of":"/dataset/citeseer","dataset":"Citeseer","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","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)"},"order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,39],"of":39,"counts":{"papers_with_a_benchmark_row":107,"with_a_code_link":98,"where_syntology_ran_a_sample":39,"not_listed_spam_title":0,"listed":107,"listed_where_code_ran":39,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":33,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":33,"listed_every_run_a_failure_of_syntologys_instrument":6,"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"},"first_page":"/dataset/citeseer/papers/ran/1","prev":null,"next":null,"papers":[{"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-09-28T10:30:06+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":3,"official":{"repos":["LUOyk1999/tunedGNN"],"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/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/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-09-28T10:30:06+00:00","samples_harvested":26,"samples_ran":19,"samples_constructed":0,"samples_ran_checked":16,"samples_ran_instrument_failed":3,"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":2,"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/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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":2,"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":2,"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":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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-09-28T10:30:06+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/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-09-28T10:30:06+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-09-28T10:30:06+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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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-09-28T10:30:06+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/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-09-28T10:30:06+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-09-28T10:30:06+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":11,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","rows_on_this_dataset":4,"code_links":93,"syntology":{"read_at":"2026-09-28T10:30:06+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/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":4,"code_links":20,"syntology":{"read_at":"2026-09-28T10:30:06+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/neural-message-passing-for-quantum-chemistry","slug":"neural-message-passing-for-quantum-chemistry","title":"Neural Message Passing for Quantum Chemistry","date":"2017-04-04","arxiv_id":"1704.01212","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-09-28T10:30:06+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":1,"official":{"repos":["brain-research/mpnn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-message-passing-for-quantum-chemistry#ran","syntology_url":"https://syntology.ai/paper/1704.01212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.01212"}}}},{"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-09-28T10:30:06+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-09-28T10:30:06+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":4,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+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":1,"code_links":26,"syntology":{"read_at":"2026-09-28T10:30:06+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":2,"code_links":13,"syntology":{"read_at":"2026-09-28T10:30:06+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":3,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+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":3,"code_links":8,"syntology":{"read_at":"2026-09-28T10:30:06+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"}}}}],"record_sha256":"cff1e868fa29a726e0d29c0bc321425518abfc72c9ea6dc0d980c10ec539d980","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}