{"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/3","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":3,"pages_in_order":4,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/graph-neural-network/papers/ran/4","papers":[{"url":"/paper/a-neural-framework-for-learning-subgraph-and","slug":"a-neural-framework-for-learning-subgraph-and","title":"GREED: A Neural Framework for Learning Graph Distance Functions","date":"2021-12-24","arxiv_id":"2112.13143","repositories_listed":2,"syntology":{"n":15,"n_ran":6,"n_constructed":2,"n_ran_checked":6,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 9 unverified","sample_list":"/paper/a-neural-framework-for-learning-subgraph-and#ran","syntology_url":"https://syntology.ai/paper/2112.13143","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.13143"}},"official":{"repos":["idea-iitd/neurosed","idea-iitd/greed"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":6,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-kernel-graph-neural-network","slug":"adaptive-kernel-graph-neural-network","title":"Adaptive Kernel Graph Neural Network","date":"2021-12-08","arxiv_id":"2112.04575","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-kernel-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2112.04575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.04575"}},"official":{"repos":["jumxglhf/akgnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-accelerated-molecular","slug":"graph-neural-networks-accelerated-molecular","title":"Graph Neural Networks Accelerated Molecular Dynamics","date":"2021-12-06","arxiv_id":"2112.03383","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":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) · 0 unverified","sample_list":"/paper/graph-neural-networks-accelerated-molecular#ran","syntology_url":"https://syntology.ai/paper/2112.03383","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.03383"}},"official":{"repos":["baratilab/gamd"],"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/decoding-the-protein-ligand-interactions","slug":"decoding-the-protein-ligand-interactions","title":"Decoding the Protein-ligand Interactions Using Parallel Graph Neural Networks","date":"2021-11-30","arxiv_id":"2111.15144","repositories_listed":1,"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":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) · 1 unverified","sample_list":"/paper/decoding-the-protein-ligand-interactions#ran","syntology_url":"https://syntology.ai/paper/2111.15144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.15144"}},"official":{"repos":["nkkchem/pf-gnn_pli"],"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/polyworld-polygonal-building-extraction-with","slug":"polyworld-polygonal-building-extraction-with","title":"PolyWorld: Polygonal Building Extraction with Graph Neural Networks in Satellite Images","date":"2021-11-30","arxiv_id":"2111.15491","repositories_listed":1,"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/polyworld-polygonal-building-extraction-with#ran","syntology_url":"https://syntology.ai/paper/2111.15491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.15491"}},"official":{"repos":["zorzi-s/polyworldpretrainednetwork"],"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/representation-learning-of-logic-circuits","slug":"representation-learning-of-logic-circuits","title":"DeepGate: Learning Neural Representations of Logic Gates","date":"2021-11-26","arxiv_id":"2111.14616","repositories_listed":1,"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/representation-learning-of-logic-circuits#ran","syntology_url":"https://syntology.ai/paper/2111.14616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.14616"}},"official":{"repos":["cure-lab/DeepGate"],"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/explaining-machine-learned-particle-flow","slug":"explaining-machine-learned-particle-flow","title":"Explaining machine-learned particle-flow reconstruction","date":"2021-11-24","arxiv_id":"2111.12840","repositories_listed":2,"syntology":{"n":18,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/explaining-machine-learned-particle-flow#ran","syntology_url":"https://syntology.ai/paper/2111.12840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12840"}},"official":{"repos":["faroukmokhtar/particleflow"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/particle-graph-autoencoders-and","slug":"particle-graph-autoencoders-and","title":"Particle Graph Autoencoders and Differentiable, Learned Energy Mover's Distance","date":"2021-11-24","arxiv_id":"2111.12849","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":0,"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/particle-graph-autoencoders-and#ran","syntology_url":"https://syntology.ai/paper/2111.12849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12849"}},"official":{"repos":["ucsd-hep-ex/GraphAE"],"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/cheblienet-invariant-spectral-graph-nns","slug":"cheblienet-invariant-spectral-graph-nns","title":"ChebLieNet: Invariant Spectral Graph NNs Turned Equivariant by Riemannian Geometry on Lie Groups","date":"2021-11-23","arxiv_id":"2111.12139","repositories_listed":2,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"9 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; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cheblienet-invariant-spectral-graph-nns#ran","syntology_url":"https://syntology.ai/paper/2111.12139","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12139"}},"official":{"repos":["haguettaz/cheblienet"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/recognizing-vector-graphics-without","slug":"recognizing-vector-graphics-without","title":"Recognizing Vector Graphics without Rasterization","date":"2021-11-05","arxiv_id":"2111.03281","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/recognizing-vector-graphics-without#ran","syntology_url":"https://syntology.ai/paper/2111.03281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.03281"}},"official":{"repos":["microsoft/YOLaT-VectorGraphicsRecognition"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/convergent-boosted-smoothing-for-modeling-1","slug":"convergent-boosted-smoothing-for-modeling-1","title":"Does your graph need a confidence boost? Convergent boosted smoothing on graphs with tabular node features","date":"2021-10-26","arxiv_id":"2110.13413","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/convergent-boosted-smoothing-for-modeling-1#ran","syntology_url":"https://syntology.ai/paper/2110.13413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13413"}},"official":{"repos":["JiuhaiChen/EBBS"],"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/sssnet-semi-supervised-signed-network","slug":"sssnet-semi-supervised-signed-network","title":"SSSNET: Semi-Supervised Signed Network Clustering","date":"2021-10-13","arxiv_id":"2110.06623","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/sssnet-semi-supervised-signed-network#ran","syntology_url":"https://syntology.ai/paper/2110.06623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.06623"}},"official":{"repos":["sherylhyx/sssnet_signed_clustering"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/ab-initio-potential-energy-surfaces-by-1","slug":"ab-initio-potential-energy-surfaces-by-1","title":"Ab-Initio Potential Energy Surfaces by Pairing GNNs with Neural Wave Functions","date":"2021-10-11","arxiv_id":"2110.05064","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/ab-initio-potential-energy-surfaces-by-1#ran","syntology_url":"https://syntology.ai/paper/2110.05064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.05064"}},"official":{"repos":["n-gao/pesnet"],"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/graph-guided-network-for-irregularly-sampled-1","slug":"graph-guided-network-for-irregularly-sampled-1","title":"Graph-Guided Network for Irregularly Sampled Multivariate Time Series","date":"2021-10-11","arxiv_id":"2110.05357","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/graph-guided-network-for-irregularly-sampled-1#ran","syntology_url":"https://syntology.ai/paper/2110.05357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.05357"}},"official":{"repos":["WenjieDu/PyPOTS"],"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":["named_in_paper"]}}},{"url":"/paper/towards-open-world-feature-extrapolation-an","slug":"towards-open-world-feature-extrapolation-an","title":"Towards Open-World Feature Extrapolation: An Inductive Graph Learning Approach","date":"2021-10-09","arxiv_id":"2110.04514","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-open-world-feature-extrapolation-an#ran","syntology_url":"https://syntology.ai/paper/2110.04514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04514"}},"official":{"repos":["qitianwu/FATE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/iterative-refinement-graph-neural-network-for-1","slug":"iterative-refinement-graph-neural-network-for-1","title":"Iterative Refinement Graph Neural Network for Antibody Sequence-Structure Co-design","date":"2021-10-09","arxiv_id":"2110.04624","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":5,"n_ran_checked":6,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/iterative-refinement-graph-neural-network-for-1#ran","syntology_url":"https://syntology.ai/paper/2110.04624","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04624"}},"official":null}},{"url":"/paper/from-stars-to-subgraphs-uplifting-any-gnn","slug":"from-stars-to-subgraphs-uplifting-any-gnn","title":"From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awareness","date":"2021-10-07","arxiv_id":"2110.03753","repositories_listed":2,"syntology":{"n":18,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":14,"n_pointer_only":2,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/from-stars-to-subgraphs-uplifting-any-gnn#ran","syntology_url":"https://syntology.ai/paper/2110.03753","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.03753"}},"official":{"repos":["gnnaskernel/gnnaskernel"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/tent-text-classification-based-on-encoding","slug":"tent-text-classification-based-on-encoding","title":"Hierarchical information matters: Text classification via tree based graph neural network","date":"2021-10-05","arxiv_id":"2110.02047","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/tent-text-classification-based-on-encoding#ran","syntology_url":"https://syntology.ai/paper/2110.02047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.02047"}},"official":{"repos":["daisean/hint","daisean/tent"],"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"]}}},{"url":"/paper/single-image-3d-object-estimation-with","slug":"single-image-3d-object-estimation-with","title":"Single Image 3D Object Estimation with Primitive Graph Networks","date":"2021-09-09","arxiv_id":"2109.04153","repositories_listed":1,"syntology":{"n":15,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":13,"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) · 13 unverified","sample_list":"/paper/single-image-3d-object-estimation-with#ran","syntology_url":"https://syntology.ai/paper/2109.04153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.04153"}},"official":{"repos":["hailieqh/3d-object-primitive-graph"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":13,"ran_from_kinds":["official"]}}},{"url":"/paper/traversenet-unifying-space-and-time-in","slug":"traversenet-unifying-space-and-time-in","title":"TraverseNet: Unifying Space and Time in Message Passing for Traffic Forecasting","date":"2021-08-25","arxiv_id":"2109.02474","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/traversenet-unifying-space-and-time-in#ran","syntology_url":"https://syntology.ai/paper/2109.02474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.02474"}},"official":{"repos":["nnzhan/traversenet"],"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":["official"]}}},{"url":"/paper/multivariate-time-series-imputation-by-graph","slug":"multivariate-time-series-imputation-by-graph","title":"Filling the G_ap_s: Multivariate Time Series Imputation by Graph Neural Networks","date":"2021-07-31","arxiv_id":"2108.00298","repositories_listed":2,"syntology":{"n":10,"n_ran":5,"n_constructed":3,"n_ran_checked":4,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":9,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/multivariate-time-series-imputation-by-graph#ran","syntology_url":"https://syntology.ai/paper/2108.00298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.00298"}},"official":{"repos":["Graph-Machine-Learning-Group/grin"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/algorithmic-concept-based-explainable","slug":"algorithmic-concept-based-explainable","title":"Algorithmic Concept-based Explainable Reasoning","date":"2021-07-15","arxiv_id":"2107.07493","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":0,"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/algorithmic-concept-based-explainable#ran","syntology_url":"https://syntology.ai/paper/2107.07493","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07493"}},"official":{"repos":["HekpoMaH/algorithmic-concepts-reasoning"],"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/brainnnexplainer-an-interpretable-graph","slug":"brainnnexplainer-an-interpretable-graph","title":"BrainNNExplainer: An Interpretable Graph Neural Network Framework for Brain Network based Disease Analysis","date":"2021-07-11","arxiv_id":"2107.05097","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":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/brainnnexplainer-an-interpretable-graph#ran","syntology_url":"https://syntology.ai/paper/2107.05097","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05097"}},"official":{"repos":["hennyjie/ibgnn"],"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/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/scalable-perception-action-communication","slug":"scalable-perception-action-communication","title":"Scalable Perception-Action-Communication Loops with Convolutional and Graph Neural Networks","date":"2021-06-24","arxiv_id":"2106.13358","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/scalable-perception-action-communication#ran","syntology_url":"https://syntology.ai/paper/2106.13358","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.13358"}},"official":{"repos":["VITA-Group/VGAI"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-bellman-ford-networks-a-general-graph","slug":"neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","arxiv_id":"2106.06935","repositories_listed":3,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":2,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-bellman-ford-networks-a-general-graph#ran","syntology_url":"https://syntology.ai/paper/2106.06935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06935"}},"official":{"repos":["DeepGraphLearning/NBFNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["community","listed","official"]}}},{"url":"/paper/graph-neural-network-based-anomaly-detection","slug":"graph-neural-network-based-anomaly-detection","title":"Graph Neural Network-Based Anomaly Detection in Multivariate Time Series","date":"2021-06-13","arxiv_id":"2106.06947","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-neural-network-based-anomaly-detection#ran","syntology_url":"https://syntology.ai/paper/2106.06947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06947"}},"official":{"repos":["d-ailin/GDN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/solving-graph-based-public-good-games-with","slug":"solving-graph-based-public-good-games-with","title":"Solving Graph-based Public Good Games with Tree Search and Imitation Learning","date":"2021-06-12","arxiv_id":"2106.06762","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/solving-graph-based-public-good-games-with#ran","syntology_url":"https://syntology.ai/paper/2106.06762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06762"}},"official":{"repos":["victordarvariu/solving-graph-pgg"],"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/self-supervised-graph-learning-with","slug":"self-supervised-graph-learning-with","title":"Self-Supervised Graph Learning with Hyperbolic Embedding for Temporal Health Event Prediction","date":"2021-06-09","arxiv_id":"2106.04751","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-supervised-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2106.04751","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04751"}},"official":{"repos":["LuChang-CS/sherbet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/digrac-digraph-clustering-with-flow-imbalance","slug":"digrac-digraph-clustering-with-flow-imbalance","title":"DIGRAC: Digraph Clustering Based on Flow Imbalance","date":"2021-06-09","arxiv_id":"2106.05194","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/digrac-digraph-clustering-with-flow-imbalance#ran","syntology_url":"https://syntology.ai/paper/2106.05194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05194"}},"official":{"repos":["sherylhyx/digrac_directed_clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/plan2scene-converting-floorplans-to-3d-scenes","slug":"plan2scene-converting-floorplans-to-3d-scenes","title":"Plan2Scene: Converting Floorplans to 3D Scenes","date":"2021-06-09","arxiv_id":"2106.05375","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/plan2scene-converting-floorplans-to-3d-scenes#ran","syntology_url":"https://syntology.ai/paper/2106.05375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05375"}},"official":{"repos":["3dlg-hcvc/plan2scene"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/affinity-attention-graph-neural-network-for","slug":"affinity-attention-graph-neural-network-for","title":"Affinity Attention Graph Neural Network for Weakly Supervised Semantic Segmentation","date":"2021-06-08","arxiv_id":"2106.04054","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/affinity-attention-graph-neural-network-for#ran","syntology_url":"https://syntology.ai/paper/2106.04054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04054"}},"official":{"repos":["zbf1991/A2GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"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/three-sentences-are-all-you-need-local-path","slug":"three-sentences-are-all-you-need-local-path","title":"Three Sentences Are All You Need: Local Path Enhanced Document Relation Extraction","date":"2021-06-03","arxiv_id":"2106.01793","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"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 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) · 0 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/three-sentences-are-all-you-need-local-path#ran","syntology_url":"https://syntology.ai/paper/2106.01793","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01793"}},"official":null}},{"url":"/paper/self-supervised-heterogeneous-graph-neural","slug":"self-supervised-heterogeneous-graph-neural","title":"Self-supervised Heterogeneous Graph Neural Network with Co-contrastive Learning","date":"2021-05-19","arxiv_id":"2105.09111","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/self-supervised-heterogeneous-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2105.09111","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.09111"}},"official":{"repos":["liun-online/HeCo"],"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-unknown-from-correlations-graph","slug":"learning-unknown-from-correlations-graph","title":"Learning Unknown from Correlations: Graph Neural Network for Inter-novel-protein Interaction Prediction","date":"2021-05-14","arxiv_id":"2105.06709","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-unknown-from-correlations-graph#ran","syntology_url":"https://syntology.ai/paper/2105.06709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.06709"}},"official":{"repos":["lvguofeng/GNN_PPI"],"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/improving-molecular-graph-neural-network","slug":"improving-molecular-graph-neural-network","title":"Improving Molecular Graph Neural Network Explainability with Orthonormalization and Induced Sparsity","date":"2021-05-11","arxiv_id":"2105.04854","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/improving-molecular-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2105.04854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04854"}},"official":{"repos":["bayer-science-for-a-better-life/graph-attribution"],"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/tango-commonsense-generalization-in","slug":"tango-commonsense-generalization-in","title":"TANGO: Commonsense Generalization in Predicting Tool Interactions for Mobile Manipulators","date":"2021-05-05","arxiv_id":"2105.04556","repositories_listed":1,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/tango-commonsense-generalization-in#ran","syntology_url":"https://syntology.ai/paper/2105.04556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04556"}},"official":{"repos":["reail-iitd/tango"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/unified-spatio-temporal-modeling-for-traffic","slug":"unified-spatio-temporal-modeling-for-traffic","title":"Unified Spatio-Temporal Modeling for Traffic Forecasting using Graph Neural Network","date":"2021-04-26","arxiv_id":"2104.12518","repositories_listed":1,"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/unified-spatio-temporal-modeling-for-traffic#ran","syntology_url":"https://syntology.ai/paper/2104.12518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12518"}},"official":{"repos":["AmitRoy7781/USTGCN"],"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/higher-order-attribute-enhancing","slug":"higher-order-attribute-enhancing","title":"Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networks","date":"2021-04-16","arxiv_id":"2104.07892","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/higher-order-attribute-enhancing#ran","syntology_url":"https://syntology.ai/paper/2104.07892","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07892"}},"official":{"repos":["RingBDStack/HAE"],"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/automated-seizure-detection-and-seizure-type","slug":"automated-seizure-detection-and-seizure-type","title":"Self-Supervised Graph Neural Networks for Improved Electroencephalographic Seizure Analysis","date":"2021-04-16","arxiv_id":"2104.08336","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/automated-seizure-detection-and-seizure-type#ran","syntology_url":"https://syntology.ai/paper/2104.08336","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08336"}},"official":{"repos":["tsy935/eeg-gnn-ssl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/glara-graph-based-labeling-rule-augmentation","slug":"glara-graph-based-labeling-rule-augmentation","title":"GLaRA: Graph-based Labeling Rule Augmentation for Weakly Supervised Named Entity Recognition","date":"2021-04-13","arxiv_id":"2104.06230","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/glara-graph-based-labeling-rule-augmentation#ran","syntology_url":"https://syntology.ai/paper/2104.06230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06230"}},"official":{"repos":["zhaoxy92/GLaRA"],"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/e-graphsage-a-graph-neural-network-based","slug":"e-graphsage-a-graph-neural-network-based","title":"E-GraphSAGE: A Graph Neural Network based Intrusion Detection System for IoT","date":"2021-03-30","arxiv_id":"2103.16329","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/e-graphsage-a-graph-neural-network-based#ran","syntology_url":"https://syntology.ai/paper/2103.16329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16329"}},"official":{"repos":["waimorris/E-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/context-modeling-in-3d-human-pose-estimation","slug":"context-modeling-in-3d-human-pose-estimation","title":"Context Modeling in 3D Human Pose Estimation: A Unified Perspective","date":"2021-03-29","arxiv_id":"2103.15507","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":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/context-modeling-in-3d-human-pose-estimation#ran","syntology_url":"https://syntology.ai/paper/2103.15507","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.15507"}},"official":null}},{"url":"/paper/spectral-temporal-graph-neural-network-for-1","slug":"spectral-temporal-graph-neural-network-for-1","title":"Spectral Temporal Graph Neural Network for Multivariate Time-series Forecasting","date":"2021-03-13","arxiv_id":"2103.07719","repositories_listed":3,"syntology":{"n":13,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":11,"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) · 11 unverified","sample_list":"/paper/spectral-temporal-graph-neural-network-for-1#ran","syntology_url":"https://syntology.ai/paper/2103.07719","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07719"}},"official":{"repos":["WenjieDu/PyPOTS"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/persistence-homology-for-link-prediction-an","slug":"persistence-homology-for-link-prediction-an","title":"Link Prediction with Persistent Homology: An Interactive View","date":"2021-02-20","arxiv_id":"2102.10255","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/persistence-homology-for-link-prediction-an#ran","syntology_url":"https://syntology.ai/paper/2102.10255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.10255"}},"official":{"repos":["pkuyzy/TLC-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/graph-neural-network-to-dilute-outliers-for","slug":"graph-neural-network-to-dilute-outliers-for","title":"Graph Neural Network to Dilute Outliers for Refactoring Monolith Application","date":"2021-02-07","arxiv_id":"2102.03827","repositories_listed":1,"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/graph-neural-network-to-dilute-outliers-for#ran","syntology_url":"https://syntology.ai/paper/2102.03827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03827"}},"official":{"repos":["utkd/cogcn"],"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/knowledge-preserving-incremental-social-event","slug":"knowledge-preserving-incremental-social-event","title":"Knowledge-Preserving Incremental Social Event Detection via Heterogeneous GNNs","date":"2021-01-21","arxiv_id":"2101.08747","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/knowledge-preserving-incremental-social-event#ran","syntology_url":"https://syntology.ai/paper/2101.08747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.08747"}},"official":{"repos":["RingBDStack/KPGNN"],"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/a-large-scale-database-for-graph","slug":"a-large-scale-database-for-graph","title":"A Large-Scale Database for Graph Representation Learning","date":"2020-11-16","arxiv_id":"2011.07682","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/a-large-scale-database-for-graph#ran","syntology_url":"https://syntology.ai/paper/2011.07682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.07682"}},"official":{"repos":["safreita1/malnet-graph"],"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/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/learning-continuous-system-dynamics-from","slug":"learning-continuous-system-dynamics-from","title":"Learning Continuous System Dynamics from Irregularly-Sampled Partial Observations","date":"2020-11-08","arxiv_id":"2011.03880","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-continuous-system-dynamics-from#ran","syntology_url":"https://syntology.ai/paper/2011.03880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.03880"}},"official":{"repos":["ZijieH/LG-ODE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-representation-learning-for-3","slug":"self-supervised-representation-learning-for-3","title":"Self-supervised Representation Learning for Evolutionary Neural Architecture Search","date":"2020-10-31","arxiv_id":"2011.00186","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/self-supervised-representation-learning-for-3#ran","syntology_url":"https://syntology.ai/paper/2011.00186","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.00186"}},"official":{"repos":["auroua/SSNENAS"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/strongly-incremental-constituency-parsing","slug":"strongly-incremental-constituency-parsing","title":"Strongly Incremental Constituency Parsing with Graph Neural Networks","date":"2020-10-27","arxiv_id":"2010.14568","repositories_listed":3,"syntology":{"n":5,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/strongly-incremental-constituency-parsing#ran","syntology_url":"https://syntology.ai/paper/2010.14568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14568"}},"official":{"repos":["princeton-vl/attach-juxtapose-parser"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-graph-neural-network-explanation","slug":"contrastive-graph-neural-network-explanation","title":"Contrastive Graph Neural Network Explanation","date":"2020-10-26","arxiv_id":"2010.13663","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/contrastive-graph-neural-network-explanation#ran","syntology_url":"https://syntology.ai/paper/2010.13663","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13663"}},"official":{"repos":["lukasjf/contrastive-gnn-explanation"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-dispatch-for-job-shop-scheduling","slug":"learning-to-dispatch-for-job-shop-scheduling","title":"Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning","date":"2020-10-23","arxiv_id":"2010.12367","repositories_listed":4,"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/learning-to-dispatch-for-job-shop-scheduling#ran","syntology_url":"https://syntology.ai/paper/2010.12367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12367"}},"official":{"repos":["zcajiayin/L2D"],"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/the-open-catalyst-2020-oc20-dataset-and","slug":"the-open-catalyst-2020-oc20-dataset-and","title":"The Open Catalyst 2020 (OC20) Dataset and Community Challenges","date":"2020-10-20","arxiv_id":"2010.09990","repositories_listed":5,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":11,"phrase":"11 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-open-catalyst-2020-oc20-dataset-and#ran","syntology_url":"https://syntology.ai/paper/2010.09990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09990"}},"official":{"repos":["Open-Catalyst-Project/Open-Catalyst-Dataset","Open-Catalyst-Project/ocp"],"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/a-graph-neural-network-framework-for-causal","slug":"a-graph-neural-network-framework-for-causal","title":"A Graph Neural Network Framework for Causal Inference in Brain Networks","date":"2020-10-14","arxiv_id":"2010.07143","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/a-graph-neural-network-framework-for-causal#ran","syntology_url":"https://syntology.ai/paper/2010.07143","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07143"}},"official":{"repos":["simonvino/DCRNN_brain_connectivity"],"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/smooth-variational-graph-embeddings-for","slug":"smooth-variational-graph-embeddings-for","title":"Smooth Variational Graph Embeddings for Efficient Neural Architecture Search","date":"2020-10-09","arxiv_id":"2010.04683","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/smooth-variational-graph-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/2010.04683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04683"}},"official":{"repos":["automl/SVGe","jovitalukasik/SVGe"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"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/a-unified-view-on-graph-neural-networks-as-1","slug":"a-unified-view-on-graph-neural-networks-as-1","title":"A Unified View on Graph Neural Networks as Graph Signal Denoising","date":"2020-10-05","arxiv_id":"2010.01777","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/a-unified-view-on-graph-neural-networks-as-1#ran","syntology_url":"https://syntology.ai/paper/2010.01777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01777"}},"official":{"repos":["alge24/ADA-UGNN"],"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/copulagnn-towards-integrating-1","slug":"copulagnn-towards-integrating-1","title":"CopulaGNN: Towards Integrating Representational and Correlational Roles of Graphs in Graph Neural Networks","date":"2020-10-05","arxiv_id":"2010.02089","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/copulagnn-towards-integrating-1#ran","syntology_url":"https://syntology.ai/paper/2010.02089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02089"}},"official":{"repos":["jiaqima/CopulaGNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sumgnn-multi-typed-drug-interaction","slug":"sumgnn-multi-typed-drug-interaction","title":"SumGNN: Multi-typed Drug Interaction Prediction via Efficient Knowledge Graph Summarization","date":"2020-10-04","arxiv_id":"2010.01450","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/sumgnn-multi-typed-drug-interaction#ran","syntology_url":"https://syntology.ai/paper/2010.01450","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01450"}},"official":{"repos":["yueyu1030/SumGNN"],"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/direct-multi-hop-attention-based-graph-neural","slug":"direct-multi-hop-attention-based-graph-neural","title":"Multi-hop Attention Graph Neural Network","date":"2020-09-29","arxiv_id":"2009.14332","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/direct-multi-hop-attention-based-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2009.14332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14332"}},"official":{"repos":["xjtuwgt/gnn-magna"],"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/heterogeneous-molecular-graph-neural-networks","slug":"heterogeneous-molecular-graph-neural-networks","title":"Heterogeneous Molecular Graph Neural Networks for Predicting Molecule Properties","date":"2020-09-26","arxiv_id":"2009.12710","repositories_listed":1,"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/heterogeneous-molecular-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2009.12710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.12710"}},"official":{"repos":["shuix007/HMGNN"],"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/planning-with-learned-object-importance-in","slug":"planning-with-learned-object-importance-in","title":"Planning with Learned Object Importance in Large Problem Instances using Graph Neural Networks","date":"2020-09-11","arxiv_id":"2009.05613","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/planning-with-learned-object-importance-in#ran","syntology_url":"https://syntology.ai/paper/2009.05613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05613"}},"official":null}},{"url":"/paper/masked-label-prediction-unified-massage","slug":"masked-label-prediction-unified-massage","title":"Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification","date":"2020-09-08","arxiv_id":"2009.03509","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":4,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/masked-label-prediction-unified-massage#ran","syntology_url":"https://syntology.ai/paper/2009.03509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.03509"}},"official":{"repos":["PaddlePaddle/PGL"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/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/enhancing-graph-neural-network-based-fraud","slug":"enhancing-graph-neural-network-based-fraud","title":"Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters","date":"2020-08-19","arxiv_id":"2008.08692","repositories_listed":6,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"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) · 5 unverified","sample_list":"/paper/enhancing-graph-neural-network-based-fraud#ran","syntology_url":"https://syntology.ai/paper/2008.08692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.08692"}},"official":{"repos":["YingtongDou/CARE-GNN","safe-graph/DGFraud"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/coarse-graining-molecular-dynamics-with-graph","slug":"coarse-graining-molecular-dynamics-with-graph","title":"Coarse Graining Molecular Dynamics with Graph Neural Networks","date":"2020-07-22","arxiv_id":"2007.11412","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/coarse-graining-molecular-dynamics-with-graph#ran","syntology_url":"https://syntology.ai/paper/2007.11412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.11412"}},"official":{"repos":["coarse-graining/cgnet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-deeper-graph-neural-networks","slug":"towards-deeper-graph-neural-networks","title":"Towards Deeper Graph Neural Networks","date":"2020-07-18","arxiv_id":"2007.09296","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-deeper-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2007.09296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.09296"}},"official":{"repos":["divelab/DeeperGNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/multi-agent-routing-value-iteration-network","slug":"multi-agent-routing-value-iteration-network","title":"Multi-Agent Routing Value Iteration Network","date":"2020-07-09","arxiv_id":"2007.05096","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":5,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"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) · 3 unverified; every one of the 5 samples that ran constructed an object rather than computing a result","sample_list":"/paper/multi-agent-routing-value-iteration-network#ran","syntology_url":"https://syntology.ai/paper/2007.05096","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05096"}},"official":{"repos":["uber/MARVIN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":3,"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/gag-global-attributed-graph-neural-network","slug":"gag-global-attributed-graph-neural-network","title":"GAG: Global Attributed Graph Neural Network for Streaming Session-based Recommendation","date":"2020-07-06","arxiv_id":"2007.02747","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/gag-global-attributed-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2007.02747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02747"}},"official":{"repos":["RuihongQiu/GAG"],"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/adaptive-graph-convolutional-recurrent","slug":"adaptive-graph-convolutional-recurrent","title":"Adaptive Graph Convolutional Recurrent Network for Traffic Forecasting","date":"2020-07-06","arxiv_id":"2007.02842","repositories_listed":3,"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":1,"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/adaptive-graph-convolutional-recurrent#ran","syntology_url":"https://syntology.ai/paper/2007.02842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02842"}},"official":{"repos":["LeiBAI/AGCRN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/few-shot-relation-extraction-via-bayesian","slug":"few-shot-relation-extraction-via-bayesian","title":"Few-shot Relation Extraction via Bayesian Meta-learning on Relation Graphs","date":"2020-07-05","arxiv_id":"2007.02387","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/few-shot-relation-extraction-via-bayesian#ran","syntology_url":"https://syntology.ai/paper/2007.02387","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02387"}},"official":null}},{"url":"/paper/hybrid-models-for-learning-to-branch","slug":"hybrid-models-for-learning-to-branch","title":"Hybrid Models for Learning to Branch","date":"2020-06-26","arxiv_id":"2006.15212","repositories_listed":1,"syntology":{"n":16,"n_ran":5,"n_constructed":4,"n_ran_checked":5,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 4 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) · 11 unverified","sample_list":"/paper/hybrid-models-for-learning-to-branch#ran","syntology_url":"https://syntology.ai/paper/2006.15212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15212"}},"official":{"repos":["pg2455/Hybrid-learn2branch"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":4,"n_ran_no_instrument_failure":5,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-network-based-coarse-grained","slug":"graph-neural-network-based-coarse-grained","title":"Graph Neural Network Based Coarse-Grained Mapping Prediction","date":"2020-06-24","arxiv_id":"2007.04921","repositories_listed":2,"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/graph-neural-network-based-coarse-grained#ran","syntology_url":"https://syntology.ai/paper/2007.04921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04921"}},"official":{"repos":["rochesterxugroup/DSGPM","rochesterxugroup/HAM_dataset"],"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/progressive-graph-learning-for-open-set","slug":"progressive-graph-learning-for-open-set","title":"Progressive Graph Learning for Open-Set Domain Adaptation","date":"2020-06-22","arxiv_id":"2006.12087","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":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/progressive-graph-learning-for-open-set#ran","syntology_url":"https://syntology.ai/paper/2006.12087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12087"}},"official":{"repos":["BUserName/PGL"],"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/generalizing-graph-neural-networks-beyond","slug":"generalizing-graph-neural-networks-beyond","title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","date":"2020-06-20","arxiv_id":"2006.11468","repositories_listed":4,"syntology":{"n":21,"n_ran":16,"n_constructed":2,"n_ran_checked":13,"n_instrument":3,"n_unverified":5,"n_honours":4,"n_violates":2,"n_no_contract":7,"n_pointer_only":13,"phrase":"16 ran (of which 2 constructed an object rather than computing a result; 13 with no instrument failure: 4 honoured, 2 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/generalizing-graph-neural-networks-beyond#ran","syntology_url":"https://syntology.ai/paper/2006.11468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11468"}},"official":{"repos":["GemsLab/H2GCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/gcc-graph-contrastive-coding-for-graph-neural","slug":"gcc-graph-contrastive-coding-for-graph-neural","title":"GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training","date":"2020-06-17","arxiv_id":"2006.09963","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gcc-graph-contrastive-coding-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2006.09963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09963"}},"official":{"repos":["THUDM/GCC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/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/multipole-graph-neural-operator-for","slug":"multipole-graph-neural-operator-for","title":"Multipole Graph Neural Operator for Parametric Partial Differential Equations","date":"2020-06-16","arxiv_id":"2006.09535","repositories_listed":4,"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/multipole-graph-neural-operator-for#ran","syntology_url":"https://syntology.ai/paper/2006.09535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09535"}},"official":{"repos":["zongyi-li/graph-pde"],"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/from-graph-low-rank-global-attention-to-2-fwl","slug":"from-graph-low-rank-global-attention-to-2-fwl","title":"Global Attention Improves Graph Networks Generalization","date":"2020-06-14","arxiv_id":"2006.07846","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/from-graph-low-rank-global-attention-to-2-fwl#ran","syntology_url":"https://syntology.ai/paper/2006.07846","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07846"}},"official":null}},{"url":"/paper/on-the-bottleneck-of-graph-neural-networks","slug":"on-the-bottleneck-of-graph-neural-networks","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","date":"2020-06-09","arxiv_id":"2006.05205","repositories_listed":3,"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/on-the-bottleneck-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.05205","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05205"}},"official":{"repos":["tech-srl/bottleneck"],"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/optimal-transport-graph-neural-networks","slug":"optimal-transport-graph-neural-networks","title":"Optimal Transport Graph Neural Networks","date":"2020-06-08","arxiv_id":"2006.04804","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":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/optimal-transport-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.04804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04804"}},"official":{"repos":["benatorc/OTGNN"],"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/connecting-the-dots-multivariate-time-series","slug":"connecting-the-dots-multivariate-time-series","title":"Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks","date":"2020-05-24","arxiv_id":"2005.11650","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/connecting-the-dots-multivariate-time-series#ran","syntology_url":"https://syntology.ai/paper/2005.11650","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.11650"}},"official":{"repos":["nnzhan/MTGNN"],"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/graph-based-self-supervised-program-repair","slug":"graph-based-self-supervised-program-repair","title":"Graph-based, Self-Supervised Program Repair from Diagnostic Feedback","date":"2020-05-20","arxiv_id":"2005.10636","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-based-self-supervised-program-repair#ran","syntology_url":"https://syntology.ai/paper/2005.10636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10636"}},"official":{"repos":["michiyasunaga/DrRepair","worksheets.codalab.org/worksheets/0x01838644724a433c932bef4cb5c42fbd"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/improved-protein-ligand-binding-affinity","slug":"improved-protein-ligand-binding-affinity","title":"Improved Protein-ligand Binding Affinity Prediction with Structure-Based Deep Fusion Inference","date":"2020-05-17","arxiv_id":"2005.07704","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improved-protein-ligand-binding-affinity#ran","syntology_url":"https://syntology.ai/paper/2005.07704","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07704"}},"official":{"repos":["LLNL/FAST"],"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/vectornet-encoding-hd-maps-and-agent-dynamics","slug":"vectornet-encoding-hd-maps-and-agent-dynamics","title":"VectorNet: Encoding HD Maps and Agent Dynamics from Vectorized Representation","date":"2020-05-08","arxiv_id":"2005.04259","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/vectornet-encoding-hd-maps-and-agent-dynamics#ran","syntology_url":"https://syntology.ai/paper/2005.04259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.04259"}},"official":null}},{"url":"/paper/reducing-communication-in-graph-neural","slug":"reducing-communication-in-graph-neural","title":"Reducing Communication in Graph Neural Network Training","date":"2020-05-07","arxiv_id":"2005.03300","repositories_listed":2,"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/reducing-communication-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2005.03300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03300"}},"official":{"repos":["PASSIONLab/CAGNET","PASSIONLab/gnn_training"],"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/tagnn-target-attentive-graph-neural-networks","slug":"tagnn-target-attentive-graph-neural-networks","title":"TAGNN: Target Attentive Graph Neural Networks for Session-based Recommendation","date":"2020-05-06","arxiv_id":"2005.02844","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tagnn-target-attentive-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2005.02844","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02844"}},"official":{"repos":["CRIPAC-DIG/TAGNN"],"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/skipgnn-predicting-molecular-interactions","slug":"skipgnn-predicting-molecular-interactions","title":"SkipGNN: Predicting Molecular Interactions with Skip-Graph Networks","date":"2020-04-30","arxiv_id":"2004.14949","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/skipgnn-predicting-molecular-interactions#ran","syntology_url":"https://syntology.ai/paper/2004.14949","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14949"}},"official":{"repos":["kexinhuang12345/SkipGNN"],"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"]}}},{"url":"/paper/typilus-neural-type-hints","slug":"typilus-neural-type-hints","title":"Typilus: Neural Type Hints","date":"2020-04-06","arxiv_id":"2004.10657","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/typilus-neural-type-hints#ran","syntology_url":"https://syntology.ai/paper/2004.10657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10657"}},"official":{"repos":["typilus/typilus"],"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/outcome-correlation-in-graph-neural-network","slug":"outcome-correlation-in-graph-neural-network","title":"Residual Correlation in Graph Neural Network Regression","date":"2020-02-19","arxiv_id":"2002.08274","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/outcome-correlation-in-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2002.08274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08274"}},"official":{"repos":["000Justin000/gnn-residual-correlation"],"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-universal-adversarial-attacks-a-few-bad","slug":"graph-universal-adversarial-attacks-a-few-bad","title":"Graph Universal Adversarial Attacks: A Few Bad Actors Ruin Graph Learning Models","date":"2020-02-12","arxiv_id":"2002.04784","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/graph-universal-adversarial-attacks-a-few-bad#ran","syntology_url":"https://syntology.ai/paper/2002.04784","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04784"}},"official":{"repos":["chisam0217/Graph-Universal-Attack"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/message-passing-for-query-answering-over","slug":"message-passing-for-query-answering-over","title":"Message Passing Query Embedding","date":"2020-02-06","arxiv_id":"2002.02406","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":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/message-passing-for-query-answering-over#ran","syntology_url":"https://syntology.ai/paper/2002.02406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02406"}},"official":{"repos":["dfdazac/mpqe"],"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/taxoexpan-self-supervised-taxonomy-expansion","slug":"taxoexpan-self-supervised-taxonomy-expansion","title":"TaxoExpan: Self-supervised Taxonomy Expansion with Position-Enhanced Graph Neural Network","date":"2020-01-26","arxiv_id":"2001.09522","repositories_listed":3,"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":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) · 1 unverified","sample_list":"/paper/taxoexpan-self-supervised-taxonomy-expansion#ran","syntology_url":"https://syntology.ai/paper/2001.09522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.09522"}},"official":{"repos":["mickeystroller/TaxoExpan"],"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/zero-shot-video-object-segmentation-via-1","slug":"zero-shot-video-object-segmentation-via-1","title":"Zero-Shot Video Object Segmentation via Attentive Graph Neural Networks","date":"2020-01-19","arxiv_id":"2001.06807","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/zero-shot-video-object-segmentation-via-1#ran","syntology_url":"https://syntology.ai/paper/2001.06807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06807"}},"official":{"repos":["carrierlxk/AGNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-network-branching-for-neural-network-1","slug":"neural-network-branching-for-neural-network-1","title":"Neural Network Branching for Neural Network Verification","date":"2019-12-03","arxiv_id":"1912.01329","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":3,"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, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-network-branching-for-neural-network-1#ran","syntology_url":"https://syntology.ai/paper/1912.01329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.01329"}},"official":{"repos":["oval-group/GNN_branching"],"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"]}}}],"record_sha256":"9aee9bd1eaa03d3b98a454e09ca403fe43e2d50c70f15220afe6154d64599d55","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}