{"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-neural-network/papers/ran/4","list_of":"/task/graph-neural-network","task":"Graph Neural Network","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":4,"pages_in_order":4,"rows_per_page":100,"rows":[301,350],"of":350,"counts":{"archive_papers_tagged":3598,"with_a_code_link":1516,"where_syntology_ran_a_sample":350,"not_listed_spam_title":0,"listed":3598,"listed_where_code_ran":350,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":302,"every_run_a_failure_of_syntologys_instrument":48,"listed_with_a_run_with_no_instrument_failure":302,"listed_every_run_a_failure_of_syntologys_instrument":48,"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-neural-network/papers/ran/1","prev":"/task/graph-neural-network/papers/ran/3","next":null,"papers":[{"url":"/paper/contrastive-learning-of-structured-world-1","slug":"contrastive-learning-of-structured-world-1","title":"Contrastive Learning of Structured World Models","date":"2019-11-27","arxiv_id":"1911.12247","repositories_listed":3,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/contrastive-learning-of-structured-world-1#ran","syntology_url":"https://syntology.ai/paper/1911.12247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.12247"}},"official":{"repos":["tkipf/c-swm"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/superglue-learning-feature-matching-with","slug":"superglue-learning-feature-matching-with","title":"SuperGlue: Learning Feature Matching with Graph Neural Networks","date":"2019-11-26","arxiv_id":"1911.11763","repositories_listed":19,"syntology":{"n":22,"n_ran":16,"n_constructed":0,"n_ran_checked":11,"n_instrument":5,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":6,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/superglue-learning-feature-matching-with#ran","syntology_url":"https://syntology.ai/paper/1911.11763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.11763"}},"official":{"repos":["magicleap/SuperGluePretrainedNetwork"],"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/inductive-relation-prediction-on-knowledge","slug":"inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"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/inductive-relation-prediction-on-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06962"}},"official":{"repos":["kkteru/grail"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/improving-graph-neural-network","slug":"improving-graph-neural-network","title":"Improving Graph Neural Network Representations of Logical Formulae with Subgraph Pooling","date":"2019-11-15","arxiv_id":"1911.06904","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/improving-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/1911.06904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06904"}},"official":null}},{"url":"/paper/hyper-sagnn-a-self-attention-based-graph-1","slug":"hyper-sagnn-a-self-attention-based-graph-1","title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs","date":"2019-11-06","arxiv_id":"1911.02613","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/hyper-sagnn-a-self-attention-based-graph-1#ran","syntology_url":"https://syntology.ai/paper/1911.02613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02613"}},"official":{"repos":["ma-compbio/Hyper-SAGNN"],"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"]}}},{"url":"/paper/text-level-graph-neural-network-for-text","slug":"text-level-graph-neural-network-for-text","title":"Text Level Graph Neural Network for Text Classification","date":"2019-10-06","arxiv_id":"1910.02356","repositories_listed":2,"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":2,"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/text-level-graph-neural-network-for-text#ran","syntology_url":"https://syntology.ai/paper/1910.02356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02356"}},"official":{"repos":["mojave-pku/TextLevelGCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/overlapping-community-detection-with-graph-1","slug":"overlapping-community-detection-with-graph-1","title":"Overlapping Community Detection with Graph Neural Networks","date":"2019-09-26","arxiv_id":"1909.12201","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/overlapping-community-detection-with-graph-1#ran","syntology_url":"https://syntology.ai/paper/1909.12201","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.12201"}},"official":{"repos":["shchur/overlapping-community-detection"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/devign-effective-vulnerability-identification","slug":"devign-effective-vulnerability-identification","title":"Devign: Effective Vulnerability Identification by Learning Comprehensive Program Semantics via Graph Neural Networks","date":"2019-09-08","arxiv_id":"1909.03496","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/devign-effective-vulnerability-identification#ran","syntology_url":"https://syntology.ai/paper/1909.03496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03496"}},"official":null}},{"url":"/paper/dialoguegcn-a-graph-convolutional-neural","slug":"dialoguegcn-a-graph-convolutional-neural","title":"DialogueGCN: A Graph Convolutional Neural Network for Emotion Recognition in Conversation","date":"2019-08-30","arxiv_id":"1908.11540","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dialoguegcn-a-graph-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/1908.11540","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.11540"}},"official":{"repos":["SenticNet/conv-emotion"],"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/clutrr-a-diagnostic-benchmark-for-inductive","slug":"clutrr-a-diagnostic-benchmark-for-inductive","title":"CLUTRR: A Diagnostic Benchmark for Inductive Reasoning from Text","date":"2019-08-16","arxiv_id":"1908.06177","repositories_listed":5,"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/clutrr-a-diagnostic-benchmark-for-inductive#ran","syntology_url":"https://syntology.ai/paper/1908.06177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.06177"}},"official":{"repos":["facebookresearch/clutrr"],"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/reinforcement-learning-based-graph-to","slug":"reinforcement-learning-based-graph-to","title":"Reinforcement Learning Based Graph-to-Sequence Model for Natural Question Generation","date":"2019-08-14","arxiv_id":"1908.04942","repositories_listed":1,"syntology":{"n":10,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/reinforcement-learning-based-graph-to#ran","syntology_url":"https://syntology.ai/paper/1908.04942","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04942"}},"official":{"repos":["hugochan/RL-based-Graph2Seq-for-NQG"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/complicated-table-structure-recognition","slug":"complicated-table-structure-recognition","title":"Complicated Table Structure Recognition","date":"2019-08-13","arxiv_id":"1908.04729","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/complicated-table-structure-recognition#ran","syntology_url":"https://syntology.ai/paper/1908.04729","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04729"}},"official":{"repos":["Academic-Hammer/SciTSR"],"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/graphflow-exploiting-conversation-flow-with","slug":"graphflow-exploiting-conversation-flow-with","title":"GraphFlow: Exploiting Conversation Flow with Graph Neural Networks for Conversational Machine Comprehension","date":"2019-07-31","arxiv_id":"1908.00059","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graphflow-exploiting-conversation-flow-with#ran","syntology_url":"https://syntology.ai/paper/1908.00059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.00059"}},"official":{"repos":["hugochan/GraphFlow"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"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/position-aware-graph-neural-networks","slug":"position-aware-graph-neural-networks","title":"Position-aware Graph Neural Networks","date":"2019-06-11","arxiv_id":"1906.04817","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/position-aware-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1906.04817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.04817"}},"official":{"repos":["JiaxuanYou/P-GNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/combining-generative-and-discriminative-3","slug":"combining-generative-and-discriminative-3","title":"Combining Generative and Discriminative Models for Hybrid Inference","date":"2019-06-06","arxiv_id":"1906.02547","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/combining-generative-and-discriminative-3#ran","syntology_url":"https://syntology.ai/paper/1906.02547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02547"}},"official":{"repos":["vgsatorras/hybrid-inference"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/190600554","slug":"190600554","title":"Factor Graph Neural Network","date":"2019-06-03","arxiv_id":"1906.00554","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190600554#ran","syntology_url":"https://syntology.ai/paper/1906.00554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00554"}},"official":{"repos":["zzhang1987/Factor-Graph-Neural-Network"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-bayesian-optimization-on-attributed","slug":"deep-bayesian-optimization-on-attributed","title":"Deep Bayesian Optimization on Attributed Graphs","date":"2019-05-31","arxiv_id":"1905.13403","repositories_listed":3,"syntology":{"n":18,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":5,"n_honours":3,"n_violates":2,"n_no_contract":6,"n_pointer_only":7,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 2 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/deep-bayesian-optimization-on-attributed#ran","syntology_url":"https://syntology.ai/paper/1905.13403","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13403"}},"official":null}},{"url":"/paper/190600121","slug":"190600121","title":"Graph WaveNet for Deep Spatial-Temporal Graph Modeling","date":"2019-05-31","arxiv_id":"1906.00121","repositories_listed":9,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190600121#ran","syntology_url":"https://syntology.ai/paper/1906.00121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00121"}},"official":{"repos":["nnzhan/Graph-WaveNet"],"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/solving-np-hard-problems-on-graphs-by","slug":"solving-np-hard-problems-on-graphs-by","title":"Solving NP-Hard Problems on Graphs with Extended AlphaGo Zero","date":"2019-05-28","arxiv_id":"1905.11623","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/solving-np-hard-problems-on-graphs-by#ran","syntology_url":"https://syntology.ai/paper/1905.11623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11623"}},"official":null}},{"url":"/paper/revisiting-graph-neural-networks-all-we-have","slug":"revisiting-graph-neural-networks-all-we-have","title":"Revisiting Graph Neural Networks: All We Have is Low-Pass Filters","date":"2019-05-23","arxiv_id":"1905.09550","repositories_listed":2,"syntology":{"n":18,"n_ran":17,"n_constructed":0,"n_ran_checked":13,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":7,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/revisiting-graph-neural-networks-all-we-have#ran","syntology_url":"https://syntology.ai/paper/1905.09550","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09550"}},"official":{"repos":["gear/gfnn"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/kgat-knowledge-graph-attention-network-for","slug":"kgat-knowledge-graph-attention-network-for","title":"KGAT: Knowledge Graph Attention Network for Recommendation","date":"2019-05-20","arxiv_id":"1905.07854","repositories_listed":7,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":7,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/kgat-knowledge-graph-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/1905.07854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07854"}},"official":{"repos":["xiangwang1223/knowledge_graph_attention_network"],"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":["listed","official"]}}},{"url":"/paper/190510350","slug":"190510350","title":"Unsupervised Community Detection with Modularity-Based Attention Model","date":"2019-05-20","arxiv_id":"1905.10350","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/190510350#ran","syntology_url":"https://syntology.ai/paper/1905.10350","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10350"}},"official":{"repos":["Ivanopolo/modnet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gmnn-graph-markov-neural-networks","slug":"gmnn-graph-markov-neural-networks","title":"GMNN: Graph Markov Neural Networks","date":"2019-05-15","arxiv_id":"1905.06214","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/gmnn-graph-markov-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1905.06214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06214"}},"official":null}},{"url":"/paper/cognitive-graph-for-multi-hop-reading","slug":"cognitive-graph-for-multi-hop-reading","title":"Cognitive Graph for Multi-Hop Reading Comprehension at Scale","date":"2019-05-14","arxiv_id":"1905.05460","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":2,"n_no_contract":2,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 2 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cognitive-graph-for-multi-hop-reading#ran","syntology_url":"https://syntology.ai/paper/1905.05460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05460"}},"official":{"repos":["THUDM/CogQA"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/knowledge-graph-convolutional-networks-for","slug":"knowledge-graph-convolutional-networks-for","title":"Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems","date":"2019-05-11","arxiv_id":"1905.04413","repositories_listed":6,"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/knowledge-graph-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1905.04413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.04413"}},"official":null}},{"url":"/paper/edge-labeling-graph-neural-network-for-few","slug":"edge-labeling-graph-neural-network-for-few","title":"Edge-labeling Graph Neural Network for Few-shot Learning","date":"2019-05-04","arxiv_id":"1905.01436","repositories_listed":4,"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/edge-labeling-graph-neural-network-for-few#ran","syntology_url":"https://syntology.ai/paper/1905.01436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01436"}},"official":{"repos":["khy0809/fewshot-egnn"],"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/generating-classification-weights-with-gnn","slug":"generating-classification-weights-with-gnn","title":"Generating Classification Weights with GNN Denoising Autoencoders for Few-Shot Learning","date":"2019-05-03","arxiv_id":"1905.01102","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/generating-classification-weights-with-gnn#ran","syntology_url":"https://syntology.ai/paper/1905.01102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01102"}},"official":{"repos":["gidariss/wDAE_GNN_FewShot"],"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":["official"]}}},{"url":"/paper/inductive-graph-pattern-learning-for","slug":"inductive-graph-pattern-learning-for","title":"Inductive Matrix Completion Based on Graph Neural Networks","date":"2019-04-26","arxiv_id":"1904.12058","repositories_listed":3,"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/inductive-graph-pattern-learning-for#ran","syntology_url":"https://syntology.ai/paper/1904.12058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12058"}},"official":{"repos":["muhanzhang/IGMC"],"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/dag-gnn-dag-structure-learning-with-graph","slug":"dag-gnn-dag-structure-learning-with-graph","title":"DAG-GNN: DAG Structure Learning with Graph Neural Networks","date":"2019-04-22","arxiv_id":"1904.10098","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/dag-gnn-dag-structure-learning-with-graph#ran","syntology_url":"https://syntology.ai/paper/1904.10098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.10098"}},"official":{"repos":["fishmoon1234/DAG-GNN"],"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/deepsphere-towards-an-equivariant-graph-based","slug":"deepsphere-towards-an-equivariant-graph-based","title":"DeepSphere: towards an equivariant graph-based spherical CNN","date":"2019-04-08","arxiv_id":"1904.05146","repositories_listed":7,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deepsphere-towards-an-equivariant-graph-based#ran","syntology_url":"https://syntology.ai/paper/1904.05146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.05146"}},"official":{"repos":["deepsphere/deepsphere-tf1"],"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/what-object-should-i-use-task-driven-object","slug":"what-object-should-i-use-task-driven-object","title":"What Object Should I Use? - Task Driven Object Detection","date":"2019-04-05","arxiv_id":"1904.03000","repositories_listed":1,"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/what-object-should-i-use-task-driven-object#ran","syntology_url":"https://syntology.ai/paper/1904.03000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.03000"}},"official":null}},{"url":"/paper/molecular-geometry-prediction-using-a-deep","slug":"molecular-geometry-prediction-using-a-deep","title":"Molecular geometry prediction using a deep generative graph neural network","date":"2019-03-31","arxiv_id":"1904.00314","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/molecular-geometry-prediction-using-a-deep#ran","syntology_url":"https://syntology.ai/paper/1904.00314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.00314"}},"official":{"repos":["nyu-dl/dl4chem-geometry"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/medgcn-graph-convolutional-networks-for","slug":"medgcn-graph-convolutional-networks-for","title":"MedGCN: Medication recommendation and lab test imputation via graph convolutional networks","date":"2019-03-31","arxiv_id":"1904.00326","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/medgcn-graph-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1904.00326","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.00326"}},"official":{"repos":["mocherson/MedGCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/extrapolating-paths-with-graph-neural","slug":"extrapolating-paths-with-graph-neural","title":"Extrapolating paths with graph neural networks","date":"2019-03-18","arxiv_id":"1903.07518","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/extrapolating-paths-with-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1903.07518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.07518"}},"official":{"repos":["jbcdnr/gretel-path-extrapolation"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fisher-bures-adversary-graph-convolutional","slug":"fisher-bures-adversary-graph-convolutional","title":"Fisher-Bures Adversary Graph Convolutional Networks","date":"2019-03-11","arxiv_id":"1903.04154","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/fisher-bures-adversary-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/1903.04154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.04154"}},"official":{"repos":["stellargraph/FisherGCN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-colouring-meets-deep-learning-effective","slug":"graph-colouring-meets-deep-learning-effective","title":"Graph Colouring Meets Deep Learning: Effective Graph Neural Network Models for Combinatorial Problems","date":"2019-03-11","arxiv_id":"1903.04598","repositories_listed":2,"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/graph-colouring-meets-deep-learning-effective#ran","syntology_url":"https://syntology.ai/paper/1903.04598","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.04598"}},"official":null}},{"url":"/paper/gnn-explainer-a-tool-for-post-hoc-explanation","slug":"gnn-explainer-a-tool-for-post-hoc-explanation","title":"GNNExplainer: Generating Explanations for Graph Neural Networks","date":"2019-03-10","arxiv_id":"1903.03894","repositories_listed":12,"syntology":{"n":22,"n_ran":18,"n_constructed":0,"n_ran_checked":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/pdp-a-general-neural-framework-for-learning","slug":"pdp-a-general-neural-framework-for-learning","title":"PDP: A General Neural Framework for Learning Constraint Satisfaction Solvers","date":"2019-03-05","arxiv_id":"1903.01969","repositories_listed":4,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/pdp-a-general-neural-framework-for-learning#ran","syntology_url":"https://syntology.ai/paper/1903.01969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.01969"}},"official":{"repos":["Microsoft/PDP-Solver"],"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":["listed","official"]}}},{"url":"/paper/graph-neural-networks-for-social","slug":"graph-neural-networks-for-social","title":"Graph Neural Networks for Social Recommendation","date":"2019-02-19","arxiv_id":"1902.07243","repositories_listed":9,"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":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) · 1 unverified","sample_list":"/paper/graph-neural-networks-for-social#ran","syntology_url":"https://syntology.ai/paper/1902.07243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07243"}},"official":{"repos":["wenqifan03/GraphRec-WWW19"],"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":["listed","official"]}}},{"url":"/paper/pitfalls-of-graph-neural-network-evaluation","slug":"pitfalls-of-graph-neural-network-evaluation","title":"Pitfalls of Graph Neural Network Evaluation","date":"2018-11-14","arxiv_id":"1811.05868","repositories_listed":2,"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/pitfalls-of-graph-neural-network-evaluation#ran","syntology_url":"https://syntology.ai/paper/1811.05868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.05868"}},"official":null}},{"url":"/paper/a-recurrent-graph-neural-network-for-multi","slug":"a-recurrent-graph-neural-network-for-multi","title":"A Recurrent Graph Neural Network for Multi-Relational Data","date":"2018-11-05","arxiv_id":"1811.02061","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/a-recurrent-graph-neural-network-for-multi#ran","syntology_url":"https://syntology.ai/paper/1811.02061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.02061"}},"official":null}},{"url":"/paper/online-planner-selection-with-graph-neural","slug":"online-planner-selection-with-graph-neural","title":"Online Planner Selection with Graph Neural Networks and Adaptive Scheduling","date":"2018-11-01","arxiv_id":"1811.00210","repositories_listed":2,"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":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/online-planner-selection-with-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1811.00210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.00210"}},"official":{"repos":["IBM/IPC-graph-data","matenure/GNN_planner"],"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/graph-hypernetworks-for-neural-architecture","slug":"graph-hypernetworks-for-neural-architecture","title":"Graph HyperNetworks for Neural Architecture Search","date":"2018-10-12","arxiv_id":"1810.05749","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-hypernetworks-for-neural-architecture#ran","syntology_url":"https://syntology.ai/paper/1810.05749","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.05749"}},"official":null}},{"url":"/paper/learning-to-solve-np-complete-problems-a","slug":"learning-to-solve-np-complete-problems-a","title":"Learning to Solve NP-Complete Problems - A Graph Neural Network for Decision TSP","date":"2018-09-08","arxiv_id":"1809.02721","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":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/learning-to-solve-np-complete-problems-a#ran","syntology_url":"https://syntology.ai/paper/1809.02721","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.02721"}},"official":null}},{"url":"/paper/deepinf-social-influence-prediction-with-deep","slug":"deepinf-social-influence-prediction-with-deep","title":"DeepInf: Social Influence Prediction with Deep Learning","date":"2018-07-15","arxiv_id":"1807.05560","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/deepinf-social-influence-prediction-with-deep#ran","syntology_url":"https://syntology.ai/paper/1807.05560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.05560"}},"official":{"repos":["xptree/DeepInf"],"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/n-gram-graph-a-novel-molecule-representation","slug":"n-gram-graph-a-novel-molecule-representation","title":"N-Gram Graph: Simple Unsupervised Representation for Graphs, with Applications to Molecules","date":"2018-06-24","arxiv_id":"1806.09206","repositories_listed":1,"syntology":{"n":14,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/n-gram-graph-a-novel-molecule-representation#ran","syntology_url":"https://syntology.ai/paper/1806.09206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09206"}},"official":{"repos":["chao1224/n_gram_graph"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":9,"ran_from_kinds":["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/attention-based-graph-neural-network-for-semi","slug":"attention-based-graph-neural-network-for-semi","title":"Attention-based Graph Neural Network for Semi-supervised Learning","date":"2018-03-10","arxiv_id":"1803.03735","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attention-based-graph-neural-network-for-semi#ran","syntology_url":"https://syntology.ai/paper/1803.03735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.03735"}},"official":null}},{"url":"/paper/few-shot-learning-with-graph-neural-networks","slug":"few-shot-learning-with-graph-neural-networks","title":"Few-Shot Learning with Graph Neural Networks","date":"2017-11-10","arxiv_id":"1711.04043","repositories_listed":6,"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/few-shot-learning-with-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1711.04043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.04043"}},"official":{"repos":["vgsatorras/few-shot-gnn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"e2f7dd578f0e467e7dfa57c1f7161ed77ff08f77e2133b20f5984715476252cc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}