{"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/2","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":36,"rows_per_page":100,"rows":[101,200],"of":3598,"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","prev":"/task/graph-neural-network","next":"/task/graph-neural-network/papers/3","papers":[{"url":"/paper/reducing-so-3-convolutions-to-so-2-for","slug":"reducing-so-3-convolutions-to-so-2-for","title":"Reducing SO(3) Convolutions to SO(2) for Efficient Equivariant GNNs","date":"2023-02-07","arxiv_id":"2302.03655","repositories_listed":2,"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/reducing-so-3-convolutions-to-so-2-for#ran","syntology_url":"https://syntology.ai/paper/2302.03655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03655"}},"official":null}},{"url":"/paper/heterogeneous-multi-robot-reinforcement","slug":"heterogeneous-multi-robot-reinforcement","title":"Heterogeneous Multi-Robot Reinforcement Learning","date":"2023-01-17","arxiv_id":"2301.07137","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/heterogeneous-multi-robot-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2301.07137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.07137"}},"official":{"repos":["proroklab/hetgppo","proroklab/vectorizedmultiagentsimulator"],"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/hada-a-graph-based-amalgamation-framework-in","slug":"hada-a-graph-based-amalgamation-framework-in","title":"HADA: A Graph-based Amalgamation Framework in Image-text Retrieval","date":"2023-01-11","arxiv_id":"2301.04742","repositories_listed":2,"syntology":null},{"url":"/paper/dmnet-delaunay-meshing-network-for-3d-shape","slug":"dmnet-delaunay-meshing-network-for-3d-shape","title":"DMNet: Delaunay Meshing Network for 3D Shape Representation","date":"2023-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/multi-task-learning-for-sparse-traffic","slug":"multi-task-learning-for-sparse-traffic","title":"Multi-task Learning for Sparse Traffic Forecasting","date":"2022-11-18","arxiv_id":"2211.09984","repositories_listed":2,"syntology":null},{"url":"/paper/scalable-multi-agent-reinforcement-learning-2","slug":"scalable-multi-agent-reinforcement-learning-2","title":"Scalable Multi-Agent Reinforcement Learning through Intelligent Information Aggregation","date":"2022-11-03","arxiv_id":"2211.02127","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-multi-agent-reinforcement-learning-2#ran","syntology_url":"https://syntology.ai/paper/2211.02127","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02127"}},"official":{"repos":["nsidn98/informarl"],"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/amgnet-multi-scale-graph-neural-networks-for","slug":"amgnet-multi-scale-graph-neural-networks-for","title":"AMGNET: multi-scale graph neural networks for flow field prediction","date":"2022-10-13","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/a-generalist-neural-algorithmic-learner","slug":"a-generalist-neural-algorithmic-learner","title":"A Generalist Neural Algorithmic Learner","date":"2022-09-22","arxiv_id":"2209.11142","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/a-generalist-neural-algorithmic-learner#ran","syntology_url":"https://syntology.ai/paper/2209.11142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.11142"}},"official":null}},{"url":"/paper/graph-neural-networks-for-channel-decoding","slug":"graph-neural-networks-for-channel-decoding","title":"Graph Neural Networks for Channel Decoding","date":"2022-07-29","arxiv_id":"2207.14742","repositories_listed":2,"syntology":null},{"url":"/paper/simple-and-efficient-heterogeneous-graph","slug":"simple-and-efficient-heterogeneous-graph","title":"Simple and Efficient Heterogeneous Graph Neural Network","date":"2022-07-06","arxiv_id":"2207.02547","repositories_listed":2,"syntology":null},{"url":"/paper/spherical-channels-for-modeling-atomic","slug":"spherical-channels-for-modeling-atomic","title":"Spherical Channels for Modeling Atomic Interactions","date":"2022-06-29","arxiv_id":"2206.14331","repositories_listed":2,"syntology":null},{"url":"/paper/towards-representation-alignment-and","slug":"towards-representation-alignment-and","title":"Towards Representation Alignment and Uniformity in Collaborative Filtering","date":"2022-06-26","arxiv_id":"2206.12811","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-representation-alignment-and#ran","syntology_url":"https://syntology.ai/paper/2206.12811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12811"}},"official":{"repos":["thuwangcy/directau"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pre-training-enhanced-spatial-temporal-graph","slug":"pre-training-enhanced-spatial-temporal-graph","title":"Pre-training Enhanced Spatial-temporal Graph Neural Network for Multivariate Time Series Forecasting","date":"2022-06-18","arxiv_id":"2206.09113","repositories_listed":2,"syntology":null},{"url":"/paper/recbole-2-0-towards-a-more-up-to-date","slug":"recbole-2-0-towards-a-more-up-to-date","title":"RecBole 2.0: Towards a More Up-to-Date Recommendation Library","date":"2022-06-15","arxiv_id":"2206.07351","repositories_listed":2,"syntology":null},{"url":"/paper/diffusion-probabilistic-modeling-of-protein","slug":"diffusion-probabilistic-modeling-of-protein","title":"Diffusion probabilistic modeling of protein backbones in 3D for the motif-scaffolding problem","date":"2022-06-08","arxiv_id":"2206.04119","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/diffusion-probabilistic-modeling-of-protein#ran","syntology_url":"https://syntology.ai/paper/2206.04119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04119"}},"official":{"repos":["blt2114/protdiff_smcdiff"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-adaptive-propagation-for-knowledge","slug":"learning-adaptive-propagation-for-knowledge","title":"AdaProp: Learning Adaptive Propagation for Graph Neural Network based Knowledge Graph Reasoning","date":"2022-05-30","arxiv_id":"2205.15319","repositories_listed":2,"syntology":null},{"url":"/paper/how-powerful-are-spectral-graph-neural","slug":"how-powerful-are-spectral-graph-neural","title":"How Powerful are Spectral Graph Neural Networks","date":"2022-05-23","arxiv_id":"2205.11172","repositories_listed":2,"syntology":null},{"url":"/paper/a-correlation-information-based","slug":"a-correlation-information-based","title":"A Correlation Information-based Spatiotemporal Network for Traffic Flow Forecasting","date":"2022-05-20","arxiv_id":"2205.10365","repositories_listed":2,"syntology":null},{"url":"/paper/celltypegraph-a-new-geometric-computer-vision","slug":"celltypegraph-a-new-geometric-computer-vision","title":"CellTypeGraph: A New Geometric Computer Vision Benchmark","date":"2022-05-17","arxiv_id":"2205.08166","repositories_listed":2,"syntology":null},{"url":"/paper/cogmen-contextualized-gnn-based-multimodal","slug":"cogmen-contextualized-gnn-based-multimodal","title":"COGMEN: COntextualized GNN based Multimodal Emotion recognitioN","date":"2022-05-05","arxiv_id":"2205.02455","repositories_listed":2,"syntology":null},{"url":"/paper/hdgt-heterogeneous-driving-graph-transformer","slug":"hdgt-heterogeneous-driving-graph-transformer","title":"HDGT: Heterogeneous Driving Graph Transformer for Multi-Agent Trajectory Prediction via Scene Encoding","date":"2022-04-30","arxiv_id":"2205.09753","repositories_listed":2,"syntology":null},{"url":"/paper/generating-3d-molecules-for-target-protein","slug":"generating-3d-molecules-for-target-protein","title":"Generating 3D Molecules for Target Protein Binding","date":"2022-04-19","arxiv_id":"2204.09410","repositories_listed":2,"syntology":{"n":33,"n_ran":18,"n_constructed":10,"n_ran_checked":13,"n_instrument":5,"n_unverified":15,"n_honours":2,"n_violates":0,"n_no_contract":11,"n_pointer_only":33,"phrase":"18 ran (of which 10 constructed an object rather than computing a result; 13 with no instrument failure: 2 honoured, 0 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/generating-3d-molecules-for-target-protein#ran","syntology_url":"https://syntology.ai/paper/2204.09410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.09410"}},"official":{"repos":["divelab/graphbp"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":11,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/multimodal-spatiotemporal-graph-neural","slug":"multimodal-spatiotemporal-graph-neural","title":"Multimodal spatiotemporal graph neural networks for improved prediction of 30-day all-cause hospital readmission","date":"2022-04-14","arxiv_id":"2204.06766","repositories_listed":2,"syntology":null},{"url":"/paper/tgl-a-general-framework-for-temporal-gnn","slug":"tgl-a-general-framework-for-temporal-gnn","title":"TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphs","date":"2022-03-28","arxiv_id":"2203.14883","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tgl-a-general-framework-for-temporal-gnn#ran","syntology_url":"https://syntology.ai/paper/2203.14883","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14883"}},"official":{"repos":["amazon-research/tgl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/socially-aware-robot-crowd-navigation-with","slug":"socially-aware-robot-crowd-navigation-with","title":"Intention Aware Robot Crowd Navigation with Attention-Based Interaction Graph","date":"2022-03-03","arxiv_id":"2203.01821","repositories_listed":2,"syntology":null},{"url":"/paper/graph-neural-network-for-cell-tracking-in","slug":"graph-neural-network-for-cell-tracking-in","title":"Graph Neural Network for Cell Tracking in Microscopy Videos","date":"2022-02-09","arxiv_id":"2202.04731","repositories_listed":2,"syntology":null},{"url":"/paper/neural-approximation-of-extended-persistent","slug":"neural-approximation-of-extended-persistent","title":"Neural Approximation of Graph Topological Features","date":"2022-01-28","arxiv_id":"2201.12032","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/neural-approximation-of-extended-persistent#ran","syntology_url":"https://syntology.ai/paper/2201.12032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12032"}},"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":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/multi-scale-adaptive-graph-neural-network-for","slug":"multi-scale-adaptive-graph-neural-network-for","title":"Multi-Scale Adaptive Graph Neural Network for Multivariate Time Series Forecasting","date":"2022-01-13","arxiv_id":"2201.04828","repositories_listed":2,"syntology":null},{"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/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/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/spatio-temporal-scene-graph-embedding-for","slug":"spatio-temporal-scene-graph-embedding-for","title":"Spatio-Temporal Scene-Graph Embedding for Autonomous Vehicle Collision Prediction","date":"2021-11-11","arxiv_id":"2111.06123","repositories_listed":2,"syntology":null},{"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/moomin-deep-molecular-omics-network-for-anti","slug":"moomin-deep-molecular-omics-network-for-anti","title":"MOOMIN: Deep Molecular Omics Network for Anti-Cancer Drug Combination Therapy","date":"2021-10-28","arxiv_id":"2110.15087","repositories_listed":2,"syntology":null},{"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/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/joint-graph-learning-and-matching-for","slug":"joint-graph-learning-and-matching-for","title":"Joint Graph Learning and Matching for Semantic Feature Correspondence","date":"2021-09-01","arxiv_id":"2109.00240","repositories_listed":2,"syntology":null},{"url":"/paper/inductive-matrix-completion-using-graph","slug":"inductive-matrix-completion-using-graph","title":"Inductive Matrix Completion Using Graph Autoencoder","date":"2021-08-25","arxiv_id":"2108.11124","repositories_listed":2,"syntology":null},{"url":"/paper/gccad-graph-contrastive-coding-for-anomaly","slug":"gccad-graph-contrastive-coding-for-anomaly","title":"Graph Contrastive Learning for Anomaly Detection","date":"2021-08-17","arxiv_id":"2108.07516","repositories_listed":2,"syntology":null},{"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/deepdds-deep-graph-neural-network-with","slug":"deepdds-deep-graph-neural-network-with","title":"DeepDDS: deep graph neural network with attention mechanism to predict synergistic drug combinations","date":"2021-07-06","arxiv_id":"2107.02467","repositories_listed":2,"syntology":null},{"url":"/paper/quantitative-evaluation-of-explainable-graph","slug":"quantitative-evaluation-of-explainable-graph","title":"Quantitative Evaluation of Explainable Graph Neural Networks for Molecular Property Prediction","date":"2021-07-01","arxiv_id":"2107.04119","repositories_listed":2,"syntology":null},{"url":"/paper/graph-attention-networks-with-lstm-based-path","slug":"graph-attention-networks-with-lstm-based-path","title":"Customizing Graph Neural Networks using Path Reweighting","date":"2021-06-21","arxiv_id":"2106.10866","repositories_listed":2,"syntology":null},{"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/lggnet-learning-from-local-global-graph","slug":"lggnet-learning-from-local-global-graph","title":"LGGNet: Learning from Local-Global-Graph Representations for Brain-Computer Interface","date":"2021-05-05","arxiv_id":"2105.02786","repositories_listed":2,"syntology":null},{"url":"/paper/pyramidal-reservoir-graph-neural-network","slug":"pyramidal-reservoir-graph-neural-network","title":"Pyramidal Reservoir Graph Neural Network","date":"2021-04-10","arxiv_id":"2104.04710","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/pyramidal-reservoir-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2104.04710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04710"}},"official":{"repos":["FilippoMB/Benchmark_dataset_for_graph_classification","FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/adaptive-filters-and-aggregator-fusion-for","slug":"adaptive-filters-and-aggregator-fusion-for","title":"Do We Need Anisotropic Graph Neural Networks?","date":"2021-04-03","arxiv_id":"2104.01481","repositories_listed":2,"syntology":null},{"url":"/paper/haconvgnn-hierarchical-attention-based","slug":"haconvgnn-hierarchical-attention-based","title":"HAConvGNN: Hierarchical Attention Based Convolutional Graph Neural Network for Code Documentation Generation in Jupyter Notebooks","date":"2021-03-31","arxiv_id":"2104.01002","repositories_listed":2,"syntology":null},{"url":"/paper/scenegraphfusion-incremental-3d-scene-graph","slug":"scenegraphfusion-incremental-3d-scene-graph","title":"SceneGraphFusion: Incremental 3D Scene Graph Prediction from RGB-D Sequences","date":"2021-03-27","arxiv_id":"2103.14898","repositories_listed":2,"syntology":null},{"url":"/paper/self-supervised-graph-neural-networks-without","slug":"self-supervised-graph-neural-networks-without","title":"Self-supervised Graph Neural Networks without explicit negative sampling","date":"2021-03-27","arxiv_id":"2103.14958","repositories_listed":2,"syntology":null},{"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/textgnn-improving-text-encoder-via-graph","slug":"textgnn-improving-text-encoder-via-graph","title":"TextGNN: Improving Text Encoder via Graph Neural Network in Sponsored Search","date":"2021-01-15","arxiv_id":"2101.06323","repositories_listed":2,"syntology":null},{"url":"/paper/accelerating-the-screening-of-amorphous","slug":"accelerating-the-screening-of-amorphous","title":"Accelerating amorphous polymer electrolyte screening by learning to reduce errors in molecular dynamics simulated properties","date":"2021-01-13","arxiv_id":"2101.05339","repositories_listed":2,"syntology":null},{"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/graph-neural-networks-in-recommender-systems","slug":"graph-neural-networks-in-recommender-systems","title":"Graph Neural Networks in Recommender Systems: A Survey","date":"2020-11-04","arxiv_id":"2011.02260","repositories_listed":2,"syntology":null},{"url":"/paper/a-graph-neural-network-based-approach-for","slug":"a-graph-neural-network-based-approach-for","title":"Identifying Possible Rumor Spreaders on Twitter: A Weak Supervised Learning Approach","date":"2020-10-15","arxiv_id":"2010.07647","repositories_listed":2,"syntology":null},{"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/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/tudataset-a-collection-of-benchmark-datasets","slug":"tudataset-a-collection-of-benchmark-datasets","title":"TUDataset: A collection of benchmark datasets for learning with graphs","date":"2020-07-16","arxiv_id":"2007.08663","repositories_listed":2,"syntology":null},{"url":"/paper/part-aware-prototype-network-for-few-shot","slug":"part-aware-prototype-network-for-few-shot","title":"Part-aware Prototype Network for Few-shot Semantic Segmentation","date":"2020-07-13","arxiv_id":"2007.06309","repositories_listed":2,"syntology":null},{"url":"/paper/combining-differentiable-pde-solvers-and","slug":"combining-differentiable-pde-solvers-and","title":"Combining Differentiable PDE Solvers and Graph Neural Networks for Fluid Flow Prediction","date":"2020-07-08","arxiv_id":"2007.04439","repositories_listed":2,"syntology":null},{"url":"/paper/switchblade-a-neural-network-for-hard-2d","slug":"switchblade-a-neural-network-for-hard-2d","title":"Matrix Shuffle-Exchange Networks for Hard 2D Tasks","date":"2020-06-29","arxiv_id":"2006.15892","repositories_listed":2,"syntology":null},{"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/attentional-graph-convolutional-networks-for","slug":"attentional-graph-convolutional-networks-for","title":"Attentional Graph Convolutional Networks for Knowledge Concept Recommendation in MOOCs in a Heterogeneous View","date":"2020-06-23","arxiv_id":"2006.13257","repositories_listed":2,"syntology":null},{"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/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/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/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/multivariate-time-series-forecasting-based-on","slug":"multivariate-time-series-forecasting-based-on","title":"Multivariate Time Series Forecasting with Transfer Entropy Graph","date":"2020-05-03","arxiv_id":"2005.01185","repositories_listed":2,"syntology":null},{"url":"/paper/transfer-learning-with-graph-neural-networks","slug":"transfer-learning-with-graph-neural-networks","title":"Transfer Learning with Graph Neural Networks for Short-Term Highway Traffic Forecasting","date":"2020-04-17","arxiv_id":"2004.08038","repositories_listed":2,"syntology":null},{"url":"/paper/improved-code-summarization-via-a-graph","slug":"improved-code-summarization-via-a-graph","title":"Improved Code Summarization via a Graph Neural Network","date":"2020-04-06","arxiv_id":"2004.02843","repositories_listed":2,"syntology":null},{"url":"/paper/multi-label-text-classification-using","slug":"multi-label-text-classification-using","title":"Multi-Label Text Classification using Attention-based Graph Neural Network","date":"2020-03-22","arxiv_id":"2003.11644","repositories_listed":2,"syntology":null},{"url":"/paper/magnet-multi-label-text-classification-using","slug":"magnet-multi-label-text-classification-using","title":"MAGNET: Multi-Label Text Classification using Attention-based Graph Neural Network","date":"2020-02-24","arxiv_id":null,"repositories_listed":2,"syntology":null},{"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/pm25-gnn-a-domain-knowledge-enhanced-graph","slug":"pm25-gnn-a-domain-knowledge-enhanced-graph","title":"PM2.5-GNN: A Domain Knowledge Enhanced Graph Neural Network For PM2.5 Forecasting","date":"2020-02-10","arxiv_id":"2002.12898","repositories_listed":2,"syntology":null},{"url":"/paper/magnn-metapath-aggregated-graph-neural","slug":"magnn-metapath-aggregated-graph-neural","title":"MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding","date":"2020-02-05","arxiv_id":"2002.01680","repositories_listed":2,"syntology":null},{"url":"/paper/deep-graph-matching-consensus-1","slug":"deep-graph-matching-consensus-1","title":"Deep Graph Matching Consensus","date":"2020-01-27","arxiv_id":"2001.09621","repositories_listed":2,"syntology":null},{"url":"/paper/get-rid-of-suspended-animation-problem-deep","slug":"get-rid-of-suspended-animation-problem-deep","title":"Get Rid of Suspended Animation Problem: Deep Diffusive Neural Network on Graph Semi-Supervised Classification","date":"2020-01-22","arxiv_id":"2001.07922","repositories_listed":2,"syntology":null},{"url":"/paper/graph-bert-only-attention-is-needed-for","slug":"graph-bert-only-attention-is-needed-for","title":"Graph-Bert: Only Attention is Needed for Learning Graph Representations","date":"2020-01-15","arxiv_id":"2001.05140","repositories_listed":2,"syntology":null},{"url":"/paper/inf-vae-a-variational-autoencoder-framework","slug":"inf-vae-a-variational-autoencoder-framework","title":"Inf-VAE: A Variational Autoencoder Framework to Integrate Homophily and Influence in Diffusion Prediction","date":"2020-01-01","arxiv_id":"2001.00132","repositories_listed":2,"syntology":null},{"url":"/paper/learning-cross-modal-context-graph-for-visual-1","slug":"learning-cross-modal-context-graph-for-visual-1","title":"Learning Cross-modal Context Graph for Visual Grounding","date":"2019-11-20","arxiv_id":"1911.09042","repositories_listed":2,"syntology":null},{"url":"/paper/on-the-choice-of-graph-neural-network","slug":"on-the-choice-of-graph-neural-network","title":"On the choice of graph neural network architectures","date":"2019-11-13","arxiv_id":"1911.05384","repositories_listed":2,"syntology":null},{"url":"/paper/numnet-machine-reading-comprehension-with","slug":"numnet-machine-reading-comprehension-with","title":"NumNet: Machine Reading Comprehension with Numerical Reasoning","date":"2019-10-15","arxiv_id":"1910.06701","repositories_listed":2,"syntology":null},{"url":"/paper/text-level-graph-neural-network-for-text","slug":"text-level-graph-neural-network-for-text","title":"Text Level Graph Neural Network for Text Classification","date":"2019-10-06","arxiv_id":"1910.02356","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/text-level-graph-neural-network-for-text#ran","syntology_url":"https://syntology.ai/paper/1910.02356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02356"}},"official":{"repos":["mojave-pku/TextLevelGCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gresnet-graph-residuals-for-reviving-deep","slug":"gresnet-graph-residuals-for-reviving-deep","title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","date":"2019-09-12","arxiv_id":"1909.05729","repositories_listed":2,"syntology":null},{"url":"/paper/devign-effective-vulnerability-identification","slug":"devign-effective-vulnerability-identification","title":"Devign: Effective Vulnerability Identification by Learning Comprehensive Program Semantics via Graph Neural Networks","date":"2019-09-08","arxiv_id":"1909.03496","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/devign-effective-vulnerability-identification#ran","syntology_url":"https://syntology.ai/paper/1909.03496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03496"}},"official":null}},{"url":"/paper/dialoguegcn-a-graph-convolutional-neural","slug":"dialoguegcn-a-graph-convolutional-neural","title":"DialogueGCN: A Graph Convolutional Neural Network for Emotion Recognition in Conversation","date":"2019-08-30","arxiv_id":"1908.11540","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dialoguegcn-a-graph-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/1908.11540","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.11540"}},"official":{"repos":["SenticNet/conv-emotion"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-graph-neural-network-approach-for-scalable","slug":"a-graph-neural-network-approach-for-scalable","title":"A Graph Neural Network Approach for Scalable Wireless Power Control","date":"2019-07-19","arxiv_id":"1907.08487","repositories_listed":2,"syntology":null},{"url":"/paper/a-hybrid-method-of-exponential-smoothing-and","slug":"a-hybrid-method-of-exponential-smoothing-and","title":"A hybrid method of Exponential Smoothing and Recurrent Neural Networks for time series forecasting","date":"2019-07-18","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/gnn-film-graph-neural-networks-with-feature","slug":"gnn-film-graph-neural-networks-with-feature","title":"GNN-FiLM: Graph Neural Networks with Feature-wise Linear Modulation","date":"2019-06-28","arxiv_id":"1906.12192","repositories_listed":2,"syntology":null},{"url":"/paper/molecular-property-prediction-a-multilevel","slug":"molecular-property-prediction-a-multilevel","title":"Molecular Property Prediction: A Multilevel Quantum Interactions Modeling Perspective","date":"2019-06-25","arxiv_id":"1906.11081","repositories_listed":2,"syntology":null},{"url":"/paper/position-aware-graph-neural-networks","slug":"position-aware-graph-neural-networks","title":"Position-aware Graph Neural Networks","date":"2019-06-11","arxiv_id":"1906.04817","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/position-aware-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1906.04817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.04817"}},"official":{"repos":["JiaxuanYou/P-GNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/solving-np-hard-problems-on-graphs-by","slug":"solving-np-hard-problems-on-graphs-by","title":"Solving NP-Hard Problems on Graphs with Extended AlphaGo Zero","date":"2019-05-28","arxiv_id":"1905.11623","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/solving-np-hard-problems-on-graphs-by#ran","syntology_url":"https://syntology.ai/paper/1905.11623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11623"}},"official":null}},{"url":"/paper/mr-gnn-multi-resolution-and-dual-graph-neural","slug":"mr-gnn-multi-resolution-and-dual-graph-neural","title":"MR-GNN: Multi-Resolution and Dual Graph Neural Network for Predicting Structured Entity Interactions","date":"2019-05-23","arxiv_id":"1905.09558","repositories_listed":2,"syntology":null},{"url":"/paper/revisiting-graph-neural-networks-all-we-have","slug":"revisiting-graph-neural-networks-all-we-have","title":"Revisiting Graph Neural Networks: All We Have is Low-Pass Filters","date":"2019-05-23","arxiv_id":"1905.09550","repositories_listed":2,"syntology":{"n":18,"n_ran":17,"n_constructed":0,"n_ran_checked":13,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":7,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/revisiting-graph-neural-networks-all-we-have#ran","syntology_url":"https://syntology.ai/paper/1905.09550","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09550"}},"official":{"repos":["gear/gfnn"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/neighborhood-enlargement-in-graph-neural","slug":"neighborhood-enlargement-in-graph-neural","title":"Mutual Information Maximization in Graph Neural Networks","date":"2019-05-21","arxiv_id":"1905.08509","repositories_listed":2,"syntology":null},{"url":"/paper/cognitive-graph-for-multi-hop-reading","slug":"cognitive-graph-for-multi-hop-reading","title":"Cognitive Graph for Multi-Hop Reading Comprehension at Scale","date":"2019-05-14","arxiv_id":"1905.05460","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":2,"n_no_contract":2,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 2 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cognitive-graph-for-multi-hop-reading#ran","syntology_url":"https://syntology.ai/paper/1905.05460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05460"}},"official":{"repos":["THUDM/CogQA"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/deep-neural-architecture-search-with-deep","slug":"deep-neural-architecture-search-with-deep","title":"Deep Neural Architecture Search with Deep Graph Bayesian Optimization","date":"2019-05-14","arxiv_id":"1905.06159","repositories_listed":2,"syntology":null},{"url":"/paper/autoregressive-models-for-sequences-of-graphs","slug":"autoregressive-models-for-sequences-of-graphs","title":"Autoregressive Models for Sequences of Graphs","date":"2019-03-18","arxiv_id":"1903.07299","repositories_listed":2,"syntology":null}],"record_sha256":"1779cbe983ed7569aca36f0a42f3b096c55df13e60912814c6bde61b4765f0c2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}