{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/graph-classification/papers/ran/2","list_of":"/task/graph-classification","task":"Graph Classification","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","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 task or check it against the task'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.","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,174],"of":174,"counts":{"archive_papers_tagged":927,"with_a_code_link":483,"where_syntology_ran_a_sample":174,"not_listed_spam_title":0,"listed":927,"listed_where_code_ran":174,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":150,"every_run_a_failure_of_syntologys_instrument":24,"listed_with_a_run_with_no_instrument_failure":150,"listed_every_run_a_failure_of_syntologys_instrument":24,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/graph-classification/papers/ran/1","prev":"/task/graph-classification/papers/ran/1","next":null,"papers":[{"url":"/paper/topological-relational-learning-on-graphs","slug":"topological-relational-learning-on-graphs","title":"Topological Relational Learning on Graphs","date":"2021-10-29","arxiv_id":"2110.15529","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/topological-relational-learning-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2110.15529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.15529"}},"official":{"repos":["tri-gnn/tri-gnn"],"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"]}}},{"url":"/paper/nested-graph-neural-networks","slug":"nested-graph-neural-networks","title":"Nested Graph Neural Networks","date":"2021-10-25","arxiv_id":"2110.13197","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/nested-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2110.13197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13197"}},"official":{"repos":["muhanzhang/nestedgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adapting-membership-inference-attacks-to-gnn","slug":"adapting-membership-inference-attacks-to-gnn","title":"Adapting Membership Inference Attacks to GNN for Graph Classification: Approaches and Implications","date":"2021-10-17","arxiv_id":"2110.08760","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adapting-membership-inference-attacks-to-gnn#ran","syntology_url":"https://syntology.ai/paper/2110.08760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.08760"}},"official":{"repos":["trustworthygnn/mia-gnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-empirical-study-of-graph-contrastive","slug":"an-empirical-study-of-graph-contrastive","title":"An Empirical Study of Graph Contrastive Learning","date":"2021-09-02","arxiv_id":"2109.01116","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-empirical-study-of-graph-contrastive#ran","syntology_url":"https://syntology.ai/paper/2109.01116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01116"}},"official":{"repos":["GraphCL/PyGCL"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/pooling-architecture-search-for-graph","slug":"pooling-architecture-search-for-graph","title":"Pooling Architecture Search for Graph Classification","date":"2021-08-24","arxiv_id":"2108.10587","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pooling-architecture-search-for-graph#ran","syntology_url":"https://syntology.ai/paper/2108.10587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.10587"}},"official":{"repos":["automl-research/pas"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/edge-augmented-graph-transformers-global-self","slug":"edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/edge-augmented-graph-transformers-global-self#ran","syntology_url":"https://syntology.ai/paper/2108.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03348"}},"official":{"repos":["shamim-hussain/egt","shamim-hussain/egt_pytorch","shamim-hussain/egt_triangular"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/maximum-entropy-weighted-independent-set","slug":"maximum-entropy-weighted-independent-set","title":"Maximum Entropy Weighted Independent Set Pooling for Graph Neural Networks","date":"2021-07-03","arxiv_id":"2107.01410","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/maximum-entropy-weighted-independent-set#ran","syntology_url":"https://syntology.ai/paper/2107.01410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01410"}},"official":{"repos":["mewispool/mewispool"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluating-modules-in-graph-contrastive","slug":"evaluating-modules-in-graph-contrastive","title":"Evaluating Modules in Graph Contrastive Learning","date":"2021-06-15","arxiv_id":"2106.08171","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evaluating-modules-in-graph-contrastive#ran","syntology_url":"https://syntology.ai/paper/2106.08171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08171"}},"official":{"repos":["thunlp/opengcl"],"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"]}}},{"url":"/paper/convergent-graph-solvers","slug":"convergent-graph-solvers","title":"Convergent Graph Solvers","date":"2021-06-03","arxiv_id":"2106.01680","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/convergent-graph-solvers#ran","syntology_url":"https://syntology.ai/paper/2106.01680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01680"}},"official":{"repos":["Junyoungpark/CGS"],"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"]}}},{"url":"/paper/how-attentive-are-graph-attention-networks","slug":"how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","arxiv_id":"2105.14491","repositories_listed":8,"syntology":{"n":16,"n_ran":11,"n_constructed":1,"n_ran_checked":11,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/how-attentive-are-graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2105.14491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14491"}},"official":{"repos":["tech-srl/how_attentive_are_gats"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/user-preference-aware-fake-news-detection","slug":"user-preference-aware-fake-news-detection","title":"User Preference-aware Fake News Detection","date":"2021-04-25","arxiv_id":"2104.12259","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/user-preference-aware-fake-news-detection#ran","syntology_url":"https://syntology.ai/paper/2104.12259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12259"}},"official":{"repos":["safe-graph/GNN-FakeNews"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/accurate-learning-of-graph-representations-1","slug":"accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","arxiv_id":"2102.11533","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/accurate-learning-of-graph-representations-1#ran","syntology_url":"https://syntology.ai/paper/2102.11533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11533"}},"official":{"repos":["JinheonBaek/GMT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/on-using-classification-datasets-to-evaluate","slug":"on-using-classification-datasets-to-evaluate","title":"On Using Classification Datasets to Evaluate Graph-Level Outlier Detection: Peculiar Observations and New Insights","date":"2020-12-23","arxiv_id":"2012.12931","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-using-classification-datasets-to-evaluate#ran","syntology_url":"https://syntology.ai/paper/2012.12931","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.12931"}},"official":{"repos":["LingxiaoShawn/GLOD-Issues"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-experimental-study-of-the-transferability","slug":"an-experimental-study-of-the-transferability","title":"An Experimental Study of the Transferability of Spectral Graph Networks","date":"2020-12-18","arxiv_id":"2012.10258","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-experimental-study-of-the-transferability#ran","syntology_url":"https://syntology.ai/paper/2012.10258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.10258"}},"official":{"repos":["Axeln78/Transferability-of-spectral-gnns"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/decimated-framelet-system-on-graphs-and-fast","slug":"decimated-framelet-system-on-graphs-and-fast","title":"Decimated Framelet System on Graphs and Fast G-Framelet Transforms","date":"2020-12-12","arxiv_id":"2012.06922","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/decimated-framelet-system-on-graphs-and-fast#ran","syntology_url":"https://syntology.ai/paper/2012.06922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.06922"}},"official":{"repos":["YuGuangWang/FGT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/parameterized-explainer-for-graph-neural","slug":"parameterized-explainer-for-graph-neural","title":"Parameterized Explainer for Graph Neural Network","date":"2020-11-09","arxiv_id":"2011.04573","repositories_listed":4,"syntology":{"n":8,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/parameterized-explainer-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2011.04573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.04573"}},"official":{"repos":["flyingdoog/PGExplainer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/revisiting-graph-neural-networks-for-link-1","slug":"revisiting-graph-neural-networks-for-link-1","title":"Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning","date":"2020-10-30","arxiv_id":"2010.16103","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/revisiting-graph-neural-networks-for-link-1#ran","syntology_url":"https://syntology.ai/paper/2010.16103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.16103"}},"official":{"repos":["facebookresearch/SEAL_OGB"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fewer-is-more-a-deep-graph-metric-learning","slug":"fewer-is-more-a-deep-graph-metric-learning","title":"Fewer is More: A Deep Graph Metric Learning Perspective Using Fewer Proxies","date":"2020-10-26","arxiv_id":"2010.13636","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/fewer-is-more-a-deep-graph-metric-learning#ran","syntology_url":"https://syntology.ai/paper/2010.13636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13636"}},"official":{"repos":["YuehuaZhu/ProxyGML"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/flag-adversarial-data-augmentation-for-graph-1","slug":"flag-adversarial-data-augmentation-for-graph-1","title":"Robust Optimization as Data Augmentation for Large-scale Graphs","date":"2020-10-19","arxiv_id":"2010.09891","repositories_listed":3,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/flag-adversarial-data-augmentation-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2010.09891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09891"}},"official":{"repos":["devnkong/FLAG"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-graph-kernel-with-optical-random","slug":"fast-graph-kernel-with-optical-random","title":"Fast Graph Kernel with Optical Random Features","date":"2020-10-16","arxiv_id":"2010.08270","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-graph-kernel-with-optical-random#ran","syntology_url":"https://syntology.ai/paper/2010.08270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08270"}},"official":{"repos":["hashemghanem/OPU_Graph_Classifier"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/factorizable-graph-convolutional-networks","slug":"factorizable-graph-convolutional-networks","title":"Factorizable Graph Convolutional Networks","date":"2020-10-12","arxiv_id":"2010.05421","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/factorizable-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2010.05421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05421"}},"official":{"repos":["ihollywhy/FactorGCN.PyTorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-information-bottleneck-for-subgraph-1","slug":"graph-information-bottleneck-for-subgraph-1","title":"Graph Information Bottleneck for Subgraph Recognition","date":"2020-10-12","arxiv_id":"2010.05563","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-information-bottleneck-for-subgraph-1#ran","syntology_url":"https://syntology.ai/paper/2010.05563","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05563"}},"official":{"repos":["Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/data-driven-learning-of-geometric-scattering-1","slug":"data-driven-learning-of-geometric-scattering-1","title":"Data-Driven Learning of Geometric Scattering Networks","date":"2020-10-06","arxiv_id":"2010.02415","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-driven-learning-of-geometric-scattering-1#ran","syntology_url":"https://syntology.ai/paper/2010.02415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02415"}},"official":null}},{"url":"/paper/directional-graph-networks-1","slug":"directional-graph-networks-1","title":"Directional Graph Networks","date":"2020-10-06","arxiv_id":"2010.02863","repositories_listed":2,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":1,"n_honours":3,"n_violates":1,"n_no_contract":7,"n_pointer_only":5,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 1 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/directional-graph-networks-1#ran","syntology_url":"https://syntology.ai/paper/2010.02863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02863"}},"official":{"repos":["Saro00/DGN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/graph-cross-networks-with-vertex-infomax","slug":"graph-cross-networks-with-vertex-infomax","title":"Graph Cross Networks with Vertex Infomax Pooling","date":"2020-10-05","arxiv_id":"2010.01804","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-cross-networks-with-vertex-infomax#ran","syntology_url":"https://syntology.ai/paper/2010.01804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01804"}},"official":{"repos":["limaosen0/GXN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-graph-normalization-for-graph-neural","slug":"learning-graph-normalization-for-graph-neural","title":"Learning Graph Normalization for Graph Neural Networks","date":"2020-09-24","arxiv_id":"2009.11746","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-graph-normalization-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2009.11746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.11746"}},"official":{"repos":["cyh1112/GraphNormalization"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/graphnorm-a-principled-approach-to","slug":"graphnorm-a-principled-approach-to","title":"GraphNorm: A Principled Approach to Accelerating Graph Neural Network Training","date":"2020-09-07","arxiv_id":"2009.03294","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphnorm-a-principled-approach-to#ran","syntology_url":"https://syntology.ai/paper/2009.03294","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.03294"}},"official":null}},{"url":"/paper/lifelong-graph-learning","slug":"lifelong-graph-learning","title":"Lifelong Graph Learning","date":"2020-09-01","arxiv_id":"2009.00647","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lifelong-graph-learning#ran","syntology_url":"https://syntology.ai/paper/2009.00647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.00647"}},"official":{"repos":["wang-chen/LGL","wang-chen/lgl-action-recognition"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/quaternion-graph-neural-networks","slug":"quaternion-graph-neural-networks","title":"Quaternion Graph Neural Networks","date":"2020-08-12","arxiv_id":"2008.05089","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/quaternion-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2008.05089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.05089"}},"official":{"repos":["daiquocnguyen/QGNN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-graph-matching-networks-for-deep-1","slug":"hierarchical-graph-matching-networks-for-deep-1","title":"Multilevel Graph Matching Networks for Deep Graph Similarity Learning","date":"2020-07-08","arxiv_id":"2007.04395","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-graph-matching-networks-for-deep-1#ran","syntology_url":"https://syntology.ai/paper/2007.04395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04395"}},"official":{"repos":["kleincup/MGMN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/simple-and-deep-graph-convolutional-networks-1","slug":"simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","arxiv_id":"2007.02133","repositories_listed":4,"syntology":{"n":7,"n_ran":5,"n_constructed":5,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result","sample_list":"/paper/simple-and-deep-graph-convolutional-networks-1#ran","syntology_url":"https://syntology.ai/paper/2007.02133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02133"}},"official":{"repos":["chennnM/GCNII"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/path-integral-based-convolution-and-pooling","slug":"path-integral-based-convolution-and-pooling","title":"Path Integral Based Convolution and Pooling for Graph Neural Networks","date":"2020-06-29","arxiv_id":"2006.16811","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/path-integral-based-convolution-and-pooling#ran","syntology_url":"https://syntology.ai/paper/2006.16811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16811"}},"official":{"repos":["YuGuangWang/PAN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-in-tensorflow-and-keras","slug":"graph-neural-networks-in-tensorflow-and-keras","title":"Graph Neural Networks in TensorFlow and Keras with Spektral","date":"2020-06-22","arxiv_id":"2006.12138","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-neural-networks-in-tensorflow-and-keras#ran","syntology_url":"https://syntology.ai/paper/2006.12138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12138"}},"official":{"repos":["danielegrattarola/spektral"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/backdoor-attacks-to-graph-neural-networks","slug":"backdoor-attacks-to-graph-neural-networks","title":"Backdoor Attacks to Graph Neural Networks","date":"2020-06-19","arxiv_id":"2006.11165","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/backdoor-attacks-to-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.11165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11165"}},"official":{"repos":["zaixizhang/graphbackdoor"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gcc-graph-contrastive-coding-for-graph-neural","slug":"gcc-graph-contrastive-coding-for-graph-neural","title":"GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training","date":"2020-06-17","arxiv_id":"2006.09963","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gcc-graph-contrastive-coding-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2006.09963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09963"}},"official":{"repos":["THUDM/GCC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-graph-neural-network-expressivity","slug":"improving-graph-neural-network-expressivity","title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","date":"2020-06-16","arxiv_id":"2006.09252","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-graph-neural-network-expressivity#ran","syntology_url":"https://syntology.ai/paper/2006.09252","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09252"}},"official":{"repos":["gbouritsas/graph-substructure-networks"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-multi-view-representation","slug":"contrastive-multi-view-representation","title":"Contrastive Multi-View Representation Learning on Graphs","date":"2020-06-10","arxiv_id":"2006.05582","repositories_listed":5,"syntology":{"n":22,"n_ran":16,"n_constructed":3,"n_ran_checked":10,"n_instrument":6,"n_unverified":6,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":9,"phrase":"16 ran (of which 3 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 6 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/contrastive-multi-view-representation#ran","syntology_url":"https://syntology.ai/paper/2006.05582","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05582"}},"official":{"repos":["kavehhassani/mvgrl"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/characteristic-functions-on-graphs-birds-of-a","slug":"characteristic-functions-on-graphs-birds-of-a","title":"Characteristic Functions on Graphs: Birds of a Feather, from Statistical Descriptors to Parametric Models","date":"2020-05-16","arxiv_id":"2005.07959","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/characteristic-functions-on-graphs-birds-of-a#ran","syntology_url":"https://syntology.ai/paper/2005.07959","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07959"}},"official":{"repos":["benedekrozemberczki/FEATHER"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-homomorphism-convolution","slug":"graph-homomorphism-convolution","title":"Graph Homomorphism Convolution","date":"2020-05-03","arxiv_id":"2005.01214","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-homomorphism-convolution#ran","syntology_url":"https://syntology.ai/paper/2005.01214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01214"}},"official":null}},{"url":"/paper/principal-neighbourhood-aggregation-for-graph","slug":"principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","arxiv_id":"2004.05718","repositories_listed":8,"syntology":{"n":55,"n_ran":33,"n_constructed":4,"n_ran_checked":11,"n_instrument":22,"n_unverified":22,"n_honours":4,"n_violates":0,"n_no_contract":7,"n_pointer_only":48,"phrase":"33 ran (of which 4 constructed an object rather than computing a result; 11 with no instrument failure: 4 honoured, 0 violated, 7 with no contract checked; 22 where Syntology's instrument failed) · 22 unverified","sample_list":"/paper/principal-neighbourhood-aggregation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2004.05718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05718"}},"official":{"repos":["lukecavabarrett/pna"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-distributed-representations-of-3","slug":"learning-distributed-representations-of-3","title":"Learning distributed representations of graphs with Geo2DR","date":"2020-03-12","arxiv_id":"2003.05926","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/learning-distributed-representations-of-3#ran","syntology_url":"https://syntology.ai/paper/2003.05926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05926"}},"official":{"repos":["paulmorio/geo2dr"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/copt-coordinated-optimal-transport-on-graphs","slug":"copt-coordinated-optimal-transport-on-graphs","title":"COPT: Coordinated Optimal Transport for Graph Sketching","date":"2020-03-09","arxiv_id":"2003.03892","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":4,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/copt-coordinated-optimal-transport-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2003.03892","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03892"}},"official":{"repos":["twistedcubic/copt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/benchmarking-graph-neural-networks","slug":"benchmarking-graph-neural-networks","title":"Benchmarking Graph Neural Networks","date":"2020-03-02","arxiv_id":"2003.00982","repositories_listed":15,"syntology":{"n":23,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":13,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/benchmarking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2003.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00982"}},"official":{"repos":["graphdeeplearning/benchmarking-gnns","karl-zhao/benchmarking-gnns-pyg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/few-shot-learning-on-graphs-via-super-classes-1","slug":"few-shot-learning-on-graphs-via-super-classes-1","title":"Few-Shot Learning on Graphs via Super-Classes based on Graph Spectral Measures","date":"2020-02-27","arxiv_id":"2002.12815","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-learning-on-graphs-via-super-classes-1#ran","syntology_url":"https://syntology.ai/paper/2002.12815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12815"}},"official":{"repos":["chauhanjatin10/GraphsFewShot"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/memory-based-graph-networks-1","slug":"memory-based-graph-networks-1","title":"Memory-Based Graph Networks","date":"2020-02-21","arxiv_id":"2002.09518","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/memory-based-graph-networks-1#ran","syntology_url":"https://syntology.ai/paper/2002.09518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09518"}},"official":{"repos":["amirkhas/GraphMemoryNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lightgcn-simplifying-and-powering-graph","slug":"lightgcn-simplifying-and-powering-graph","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","date":"2020-02-06","arxiv_id":"2002.02126","repositories_listed":18,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lightgcn-simplifying-and-powering-graph#ran","syntology_url":"https://syntology.ai/paper/2002.02126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02126"}},"official":{"repos":["gusye1234/pytorch-light-gcn","kuandeng/LightGCN"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/composition-based-multi-relational-graph","slug":"composition-based-multi-relational-graph","title":"Composition-based Multi-Relational Graph Convolutional Networks","date":"2019-11-08","arxiv_id":"1911.03082","repositories_listed":4,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/composition-based-multi-relational-graph#ran","syntology_url":"https://syntology.ai/paper/1911.03082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03082"}},"official":{"repos":["malllabiisc/CompGCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/hierarchical-representation-learning-in-graph","slug":"hierarchical-representation-learning-in-graph","title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","date":"2019-10-24","arxiv_id":"1910.11436","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-representation-learning-in-graph#ran","syntology_url":"https://syntology.ai/paper/1910.11436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11436"}},"official":{"repos":["danielegrattarola/decimation-pooling"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-universal-self-attention-network","slug":"unsupervised-universal-self-attention-network","title":"Universal Graph Transformer Self-Attention Networks","date":"2019-09-26","arxiv_id":"1909.11855","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-universal-self-attention-network#ran","syntology_url":"https://syntology.ai/paper/1909.11855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11855"}},"official":{"repos":["daiquocnguyen/Graph-Transformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-attention-mechanism-in-graph-neural","slug":"improving-attention-mechanism-in-graph-neural","title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","date":"2019-07-04","arxiv_id":"1907.02204","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-attention-mechanism-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1907.02204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02204"}},"official":{"repos":["zetayue/CPA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mincut-pooling-in-graph-neural-networks","slug":"mincut-pooling-in-graph-neural-networks","title":"Spectral Clustering with Graph Neural Networks for Graph Pooling","date":"2019-06-30","arxiv_id":"1907.00481","repositories_listed":4,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/mincut-pooling-in-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1907.00481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00481"}},"official":{"repos":["FilippoMB/Spectral-Clustering-with-Graph-Neural-Networks-for-Graph-Pooling","FilippoMB/Benchmark_dataset_for_graph_classification"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/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","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","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"}},"official":null}},{"url":"/paper/got-an-optimal-transport-framework-for-graph","slug":"got-an-optimal-transport-framework-for-graph","title":"GOT: An Optimal Transport framework for Graph comparison","date":"2019-06-05","arxiv_id":"1906.02085","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/got-an-optimal-transport-framework-for-graph#ran","syntology_url":"https://syntology.ai/paper/1906.02085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02085"}},"official":{"repos":["Hermina/GOT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/wasserstein-weisfeiler-lehman-graph-kernels","slug":"wasserstein-weisfeiler-lehman-graph-kernels","title":"Wasserstein Weisfeiler-Lehman Graph Kernels","date":"2019-06-04","arxiv_id":"1906.01277","repositories_listed":2,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/wasserstein-weisfeiler-lehman-graph-kernels#ran","syntology_url":"https://syntology.ai/paper/1906.01277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01277"}},"official":{"repos":["BorgwardtLab/WWL"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/graph-neural-tangent-kernel-fusing-graph","slug":"graph-neural-tangent-kernel-fusing-graph","title":"Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernels","date":"2019-05-30","arxiv_id":"1905.13192","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-neural-tangent-kernel-fusing-graph#ran","syntology_url":"https://syntology.ai/paper/1905.13192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13192"}},"official":{"repos":["KangchengHou/gntk"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pre-training-graph-neural-networks","slug":"pre-training-graph-neural-networks","title":"Strategies for Pre-training Graph Neural Networks","date":"2019-05-29","arxiv_id":"1905.12265","repositories_listed":11,"syntology":{"n":14,"n_ran":13,"n_constructed":1,"n_ran_checked":9,"n_instrument":4,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"13 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 3 honoured, 0 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pre-training-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1905.12265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12265"}},"official":{"repos":["snap-stanford/pretrain-gnns"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/provably-powerful-graph-networks","slug":"provably-powerful-graph-networks","title":"Provably Powerful Graph Networks","date":"2019-05-27","arxiv_id":"1905.11136","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/provably-powerful-graph-networks#ran","syntology_url":"https://syntology.ai/paper/1905.11136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11136"}},"official":null}},{"url":"/paper/graph-u-nets","slug":"graph-u-nets","title":"Graph U-Nets","date":"2019-05-11","arxiv_id":"1905.05178","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-u-nets#ran","syntology_url":"https://syntology.ai/paper/1905.05178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05178"}},"official":{"repos":["HongyangGao/gunet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/gnn-explainer-a-tool-for-post-hoc-explanation","slug":"gnn-explainer-a-tool-for-post-hoc-explanation","title":"GNNExplainer: Generating Explanations for Graph Neural Networks","date":"2019-03-10","arxiv_id":"1903.03894","repositories_listed":12,"syntology":{"n":22,"n_ran":18,"n_constructed":0,"n_ran_checked":18,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":18,"n_pointer_only":1,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 0 violated, 18 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/gnn-explainer-a-tool-for-post-hoc-explanation#ran","syntology_url":"https://syntology.ai/paper/1903.03894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03894"}},"official":{"repos":["RexYing/gnn-model-explainer"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/relational-pooling-for-graph-representations","slug":"relational-pooling-for-graph-representations","title":"Relational Pooling for Graph Representations","date":"2019-03-06","arxiv_id":"1903.02541","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/relational-pooling-for-graph-representations#ran","syntology_url":"https://syntology.ai/paper/1903.02541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.02541"}},"official":{"repos":["PurdueMINDS/RelationalPooling"],"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"]}}},{"url":"/paper/fake-news-detection-on-social-media-using","slug":"fake-news-detection-on-social-media-using","title":"Fake News Detection on Social Media using Geometric Deep Learning","date":"2019-02-10","arxiv_id":"1902.06673","repositories_listed":4,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fake-news-detection-on-social-media-using#ran","syntology_url":"https://syntology.ai/paper/1902.06673","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06673"}},"official":null}},{"url":"/paper/bayesian-graph-convolutional-neural-networks","slug":"bayesian-graph-convolutional-neural-networks","title":"Bayesian graph convolutional neural networks for semi-supervised classification","date":"2018-11-27","arxiv_id":"1811.11103","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":3,"n_honours":3,"n_violates":3,"n_no_contract":6,"n_pointer_only":16,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 3 honoured, 3 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bayesian-graph-convolutional-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1811.11103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.11103"}},"official":null}},{"url":"/paper/how-powerful-are-graph-neural-networks","slug":"how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","arxiv_id":"1810.00826","repositories_listed":19,"syntology":{"n":10,"n_ran":6,"n_constructed":2,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/how-powerful-are-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.00826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.00826"}},"official":{"repos":["weihua916/powerful-gnns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/hierarchical-graph-representation-learning","slug":"hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","arxiv_id":"1806.08804","repositories_listed":14,"syntology":{"n":20,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/hierarchical-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/1806.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08804"}},"official":null}},{"url":"/paper/anonymous-walk-embeddings","slug":"anonymous-walk-embeddings","title":"Anonymous Walk Embeddings","date":"2018-05-30","arxiv_id":"1805.11921","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/anonymous-walk-embeddings#ran","syntology_url":"https://syntology.ai/paper/1805.11921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11921"}},"official":{"repos":["nd7141/AWE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/optimal-transport-for-structured-data-with","slug":"optimal-transport-for-structured-data-with","title":"Optimal Transport for structured data with application on graphs","date":"2018-05-23","arxiv_id":"1805.09114","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimal-transport-for-structured-data-with#ran","syntology_url":"https://syntology.ai/paper/1805.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09114"}},"official":null}},{"url":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_pointer_only":46,"phrase":"61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}},"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/graph2vec-learning-distributed","slug":"graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph2vec-learning-distributed#ran","syntology_url":"https://syntology.ai/paper/1707.05005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.05005"}},"official":null}},{"url":"/paper/inductive-representation-learning-on-large","slug":"inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","arxiv_id":"1706.02216","repositories_listed":20,"syntology":{"n":5,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/inductive-representation-learning-on-large#ran","syntology_url":"https://syntology.ai/paper/1706.02216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02216"}},"official":{"repos":["williamleif/GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/supervised-community-detection-with-line","slug":"supervised-community-detection-with-line","title":"Supervised Community Detection with Line Graph Neural Networks","date":"2017-05-23","arxiv_id":"1705.08415","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/supervised-community-detection-with-line#ran","syntology_url":"https://syntology.ai/paper/1705.08415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.08415"}},"official":{"repos":["zhengdao-chen/GNN4CD"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/modeling-relational-data-with-graph","slug":"modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","repositories_listed":27,"syntology":{"n":32,"n_ran":18,"n_constructed":3,"n_ran_checked":13,"n_instrument":5,"n_unverified":14,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":15,"phrase":"18 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/modeling-relational-data-with-graph#ran","syntology_url":"https://syntology.ai/paper/1703.06103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06103"}},"official":{"repos":["tkipf/relational-gcn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/geometric-deep-learning-on-graphs-and","slug":"geometric-deep-learning-on-graphs-and","title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","date":"2016-11-25","arxiv_id":"1611.08402","repositories_listed":4,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/geometric-deep-learning-on-graphs-and#ran","syntology_url":"https://syntology.ai/paper/1611.08402","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.08402"}},"official":null}},{"url":"/paper/semi-supervised-classification-with-graph","slug":"semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","repositories_listed":55,"syntology":{"n":58,"n_ran":39,"n_constructed":13,"n_ran_checked":34,"n_instrument":5,"n_unverified":19,"n_honours":0,"n_violates":1,"n_no_contract":33,"n_pointer_only":23,"phrase":"39 ran (of which 13 constructed an object rather than computing a result; 34 with no instrument failure: 0 honoured, 1 violated, 33 with no contract checked; 5 where Syntology's instrument failed) · 19 unverified","sample_list":"/paper/semi-supervised-classification-with-graph#ran","syntology_url":"https://syntology.ai/paper/1609.02907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02907"}},"official":{"repos":["tkipf/pygcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/gated-graph-sequence-neural-networks","slug":"gated-graph-sequence-neural-networks","title":"Gated Graph Sequence Neural Networks","date":"2015-11-17","arxiv_id":"1511.05493","repositories_listed":13,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gated-graph-sequence-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1511.05493","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05493"}},"official":null}}],"record_sha256":"bdc4f80b466658ed4a95703639d3b81774feb507b64fa721bcb318cc5281277b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}