{"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/13","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":13,"pages_in_order":36,"rows_per_page":100,"rows":[1201,1300],"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/papers/12","next":"/task/graph-neural-network/papers/14","papers":[{"url":"/paper/graph-belief-propagation-networks","slug":"graph-belief-propagation-networks","title":"Graph Belief Propagation Networks","date":"2021-06-06","arxiv_id":"2106.03033","repositories_listed":1,"syntology":null},{"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/kgpool-dynamic-knowledge-graph-context","slug":"kgpool-dynamic-knowledge-graph-context","title":"KGPool: Dynamic Knowledge Graph Context Selection for Relation Extraction","date":"2021-06-01","arxiv_id":"2106.00459","repositories_listed":1,"syntology":null},{"url":"/paper/sn-graph-a-minimalist-3d-object","slug":"sn-graph-a-minimalist-3d-object","title":"SN-Graph: a Minimalist 3D Object Representation for Classification","date":"2021-05-31","arxiv_id":"2105.14784","repositories_listed":1,"syntology":null},{"url":"/paper/hashing-accelerated-graph-neural-networks-for","slug":"hashing-accelerated-graph-neural-networks-for","title":"Hashing-Accelerated Graph Neural Networks for Link Prediction","date":"2021-05-29","arxiv_id":"2105.14280","repositories_listed":1,"syntology":null},{"url":"/paper/neural-enhanced-belief-propagation-for","slug":"neural-enhanced-belief-propagation-for","title":"Neural Enhanced Belief Propagation for Cooperative Localization","date":"2021-05-27","arxiv_id":"2105.12903","repositories_listed":1,"syntology":null},{"url":"/paper/local-global-and-scale-dependent-node-roles","slug":"local-global-and-scale-dependent-node-roles","title":"Local, global and scale-dependent node roles","date":"2021-05-26","arxiv_id":"2105.12598","repositories_listed":1,"syntology":null},{"url":"/paper/graphfm-graph-factorization-machines-for","slug":"graphfm-graph-factorization-machines-for","title":"GraphFM: Graph Factorization Machines for Feature Interaction Modeling","date":"2021-05-25","arxiv_id":"2105.11866","repositories_listed":1,"syntology":null},{"url":"/paper/cross-lingual-text-classification-with-1","slug":"cross-lingual-text-classification-with-1","title":"Cross-lingual Text Classification with Heterogeneous Graph Neural Network","date":"2021-05-24","arxiv_id":"2105.11246","repositories_listed":1,"syntology":null},{"url":"/paper/dorylus-affordable-scalable-and-accurate-gnn","slug":"dorylus-affordable-scalable-and-accurate-gnn","title":"Dorylus: Affordable, Scalable, and Accurate GNN Training with Distributed CPU Servers and Serverless Threads","date":"2021-05-24","arxiv_id":"2105.11118","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-representation-learning","slug":"heterogeneous-graph-representation-learning","title":"Heterogeneous Graph Representation Learning with Relation Awareness","date":"2021-05-24","arxiv_id":"2105.11122","repositories_listed":1,"syntology":null},{"url":"/paper/distance-enhanced-graph-neural-network-for","slug":"distance-enhanced-graph-neural-network-for","title":"Distance-Enhanced Graph Neural Network for Link Prediction","date":"2021-05-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/superpixel-based-domain-knowledge-infusion-in","slug":"superpixel-based-domain-knowledge-infusion-in","title":"Superpixel-based Knowledge Infusion in Deep Neural Networks for Image Classification","date":"2021-05-20","arxiv_id":"2105.09448","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-decentralized-multi-1","slug":"graph-neural-networks-for-decentralized-multi-1","title":"Graph Neural Networks for Decentralized Multi-Robot Submodular Action Selection","date":"2021-05-18","arxiv_id":"2105.08601","repositories_listed":1,"syntology":null},{"url":"/paper/stacking-vae-with-graph-neural-networks-for","slug":"stacking-vae-with-graph-neural-networks-for","title":"StackVAE-G: An efficient and interpretable model for time series anomaly detection","date":"2021-05-18","arxiv_id":"2105.08397","repositories_listed":1,"syntology":null},{"url":"/paper/zorro-valid-sparse-and-stable-explanations-in","slug":"zorro-valid-sparse-and-stable-explanations-in","title":"Zorro: Valid, Sparse, and Stable Explanations in Graph Neural Networks","date":"2021-05-18","arxiv_id":"2105.08621","repositories_listed":1,"syntology":null},{"url":"/paper/improving-graph-neural-networks-with-simple","slug":"improving-graph-neural-networks-with-simple","title":"Improving Graph Neural Networks with Simple Architecture Design","date":"2021-05-17","arxiv_id":"2105.07634","repositories_listed":1,"syntology":null},{"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/vsr-a-unified-framework-for-document-layout","slug":"vsr-a-unified-framework-for-document-layout","title":"VSR: A Unified Framework for Document Layout Analysis combining Vision, Semantics and Relations","date":"2021-05-13","arxiv_id":"2105.06220","repositories_listed":1,"syntology":null},{"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/representation-iterative-fusion-based-on","slug":"representation-iterative-fusion-based-on","title":"Representation Iterative Fusion based on Heterogeneous Graph Neural Network for Joint Entity and Relation Extraction","date":"2021-05-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/brain-multigraph-prediction-using-topology","slug":"brain-multigraph-prediction-using-topology","title":"Brain Multigraph Prediction using Topology-Aware Adversarial Graph Neural Network","date":"2021-05-06","arxiv_id":"2105.02565","repositories_listed":1,"syntology":null},{"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/leveraging-third-order-features-in-skeleton","slug":"leveraging-third-order-features-in-skeleton","title":"Fusing Higher-order Features in Graph Neural Networks for Skeleton-based Action Recognition","date":"2021-05-04","arxiv_id":"2105.01563","repositories_listed":1,"syntology":null},{"url":"/paper/an-effective-self-supervised-framework-for","slug":"an-effective-self-supervised-framework-for","title":"An effective self-supervised framework for learning expressive molecular global representations to drug discovery","date":"2021-05-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/recovering-barabsi-albert-parameters-of","slug":"recovering-barabsi-albert-parameters-of","title":"Recovering Barabási-Albert Parameters of Graphs through Disentanglement","date":"2021-05-03","arxiv_id":"2105.00997","repositories_listed":1,"syntology":null},{"url":"/paper/brain-graph-super-resolution-using","slug":"brain-graph-super-resolution-using","title":"Brain Graph Super-Resolution Using Adversarial Graph Neural Network with Application to Functional Brain Connectivity","date":"2021-05-02","arxiv_id":"2105.00425","repositories_listed":1,"syntology":null},{"url":"/paper/bermuda-triangles-gnns-fail-to-detect-simple","slug":"bermuda-triangles-gnns-fail-to-detect-simple","title":"Bermuda Triangles: GNNs Fail to Detect Simple Topological Structures","date":"2021-05-01","arxiv_id":"2105.00134","repositories_listed":1,"syntology":null},{"url":"/paper/communication-topology-co-design-in-graph","slug":"communication-topology-co-design-in-graph","title":"Communication Topology Co-Design in Graph Recurrent Neural Network Based Distributed Control","date":"2021-04-28","arxiv_id":"2104.13868","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-embedding-procedure-knowledge","slug":"interpretable-embedding-procedure-knowledge","title":"Interpretable Embedding Procedure Knowledge Transfer via Stacked Principal Component Analysis and Graph Neural Network","date":"2021-04-28","arxiv_id":"2104.13561","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/interpretable-embedding-procedure-knowledge#ran","syntology_url":"https://syntology.ai/paper/2104.13561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.13561"}},"official":null}},{"url":"/paper/graph-neural-networks-with-adaptive-frequency","slug":"graph-neural-networks-with-adaptive-frequency","title":"AdaGNN: Graph Neural Networks with Adaptive Frequency Response Filter","date":"2021-04-26","arxiv_id":"2104.12840","repositories_listed":1,"syntology":null},{"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/graph-neural-network-reinforcement-learning","slug":"graph-neural-network-reinforcement-learning","title":"Graph Neural Network Reinforcement Learning for Autonomous Mobility-on-Demand Systems","date":"2021-04-23","arxiv_id":"2104.11434","repositories_listed":1,"syntology":null},{"url":"/paper/graphtheta-a-distributed-graph-neural-network","slug":"graphtheta-a-distributed-graph-neural-network","title":"GraphTheta: A Distributed Graph Neural Network Learning System With Flexible Training Strategy","date":"2021-04-21","arxiv_id":"2104.10569","repositories_listed":1,"syntology":null},{"url":"/paper/graghvqa-language-guided-graph-neural","slug":"graghvqa-language-guided-graph-neural","title":"GraghVQA: Language-Guided Graph Neural Networks for Graph-based Visual Question Answering","date":"2021-04-20","arxiv_id":"2104.10283","repositories_listed":1,"syntology":null},{"url":"/paper/pick-and-choose-a-gnn-based-imbalanced","slug":"pick-and-choose-a-gnn-based-imbalanced","title":"Pick and Choose: A GNN-based Imbalanced Learning Approach for Fraud Detection","date":"2021-04-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/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/improving-hyper-relational-knowledge-graph","slug":"improving-hyper-relational-knowledge-graph","title":"Improving Hyper-Relational Knowledge Graph Completion","date":"2021-04-16","arxiv_id":"2104.08167","repositories_listed":1,"syntology":null},{"url":"/paper/reinforced-neighborhood-selection-guided","slug":"reinforced-neighborhood-selection-guided","title":"Reinforced Neighborhood Selection Guided Multi-Relational Graph Neural Networks","date":"2021-04-16","arxiv_id":"2104.07886","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-graph-neural-networks-for-sequential","slug":"dynamic-graph-neural-networks-for-sequential","title":"Dynamic Graph Neural Networks for Sequential Recommendation","date":"2021-04-15","arxiv_id":"2104.07368","repositories_listed":1,"syntology":null},{"url":"/paper/fedgraphnn-a-federated-learning-system-and","slug":"fedgraphnn-a-federated-learning-system-and","title":"FedGraphNN: A Federated Learning System and Benchmark for Graph Neural Networks","date":"2021-04-14","arxiv_id":"2104.07145","repositories_listed":1,"syntology":null},{"url":"/paper/identity-inference-on-blockchain-using-graph","slug":"identity-inference-on-blockchain-using-graph","title":"Identity Inference on Blockchain using Graph Neural Network","date":"2021-04-14","arxiv_id":"2104.06559","repositories_listed":1,"syntology":null},{"url":"/paper/search-to-aggregate-neighborhood-for-graph","slug":"search-to-aggregate-neighborhood-for-graph","title":"Search to aggregate neighborhood for graph neural network","date":"2021-04-14","arxiv_id":"2104.06608","repositories_listed":1,"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":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/search-to-aggregate-neighborhood-for-graph#ran","syntology_url":"https://syntology.ai/paper/2104.06608","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06608"}},"official":null}},{"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/scalable-power-control-beamforming-in","slug":"scalable-power-control-beamforming-in","title":"Scalable Power Control/Beamforming in Heterogeneous Wireless Networks with Graph Neural Networks","date":"2021-04-12","arxiv_id":"2104.05463","repositories_listed":1,"syntology":null},{"url":"/paper/attentional-graph-neural-network-for-parking","slug":"attentional-graph-neural-network-for-parking","title":"Attentional Graph Neural Network for Parking-slot Detection","date":"2021-04-06","arxiv_id":"2104.02576","repositories_listed":1,"syntology":null},{"url":"/paper/learning-spatial-context-with-graph-neural","slug":"learning-spatial-context-with-graph-neural","title":"Learning Spatial Context with Graph Neural Network for Multi-Person Pose Grouping","date":"2021-04-06","arxiv_id":"2104.02385","repositories_listed":1,"syntology":null},{"url":"/paper/visual-camera-re-localization-using-graph","slug":"visual-camera-re-localization-using-graph","title":"Visual Camera Re-Localization Using Graph Neural Networks and Relative Pose Supervision","date":"2021-04-06","arxiv_id":"2104.02538","repositories_listed":1,"syntology":null},{"url":"/paper/segmentation-of-em-showers-for-neutrino","slug":"segmentation-of-em-showers-for-neutrino","title":"Segmentation of EM showers for neutrino experiments with deep graph neural networks","date":"2021-04-05","arxiv_id":"2104.02040","repositories_listed":1,"syntology":null},{"url":"/paper/mgn-net-a-multi-view-graph-normalizer-for","slug":"mgn-net-a-multi-view-graph-normalizer-for","title":"MGN-Net: a multi-view graph normalizer for integrating heterogeneous biological network populations","date":"2021-04-04","arxiv_id":"2104.03895","repositories_listed":1,"syntology":null},{"url":"/paper/qubit-routing-using-graph-neural-network","slug":"qubit-routing-using-graph-neural-network","title":"Qubit Routing using Graph Neural Network aided Monte Carlo Tree Search","date":"2021-04-01","arxiv_id":"2104.01992","repositories_listed":1,"syntology":null},{"url":"/paper/sst-gnn-simplified-spatio-temporal-traffic","slug":"sst-gnn-simplified-spatio-temporal-traffic","title":"SST-GNN: Simplified Spatio-temporal Traffic forecasting model using Graph Neural Network","date":"2021-03-31","arxiv_id":"2104.00055","repositories_listed":1,"syntology":null},{"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/degraphcs-embedding-variable-based-flow-graph","slug":"degraphcs-embedding-variable-based-flow-graph","title":"deGraphCS: Embedding Variable-based Flow Graph for Neural Code Search","date":"2021-03-24","arxiv_id":"2103.13020","repositories_listed":1,"syntology":null},{"url":"/paper/modgnn-expert-policy-approximation-in-multi","slug":"modgnn-expert-policy-approximation-in-multi","title":"ModGNN: Expert Policy Approximation in Multi-Agent Systems with a Modular Graph Neural Network Architecture","date":"2021-03-24","arxiv_id":"2103.13446","repositories_listed":1,"syntology":null},{"url":"/paper/graphdive-graph-classification-by-mixture-of","slug":"graphdive-graph-classification-by-mixture-of","title":"GraphDIVE: Graph Classification by Mixture of Diverse Experts","date":"2021-03-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mars-markov-molecular-sampling-for-multi-1","slug":"mars-markov-molecular-sampling-for-multi-1","title":"MARS: Markov Molecular Sampling for Multi-objective Drug Discovery","date":"2021-03-18","arxiv_id":"2103.10432","repositories_listed":1,"syntology":null},{"url":"/paper/dual-side-deep-context-aware-modulation-for","slug":"dual-side-deep-context-aware-modulation-for","title":"Dual Side Deep Context-aware Modulation for Social Recommendation","date":"2021-03-16","arxiv_id":"2103.08976","repositories_listed":1,"syntology":null},{"url":"/paper/r-gsn-the-relation-based-graph-similar","slug":"r-gsn-the-relation-based-graph-similar","title":"R-GSN: The Relation-based Graph Similar Network for Heterogeneous Graph","date":"2021-03-14","arxiv_id":"2103.07877","repositories_listed":1,"syntology":null},{"url":"/paper/holistic-3d-scene-understanding-from-a-single-1","slug":"holistic-3d-scene-understanding-from-a-single-1","title":"Holistic 3D Scene Understanding from a Single Image with Implicit Representation","date":"2021-03-11","arxiv_id":"2103.06422","repositories_listed":1,"syntology":null},{"url":"/paper/fast-interactive-video-object-segmentation","slug":"fast-interactive-video-object-segmentation","title":"Fast Interactive Video Object Segmentation with Graph Neural Networks","date":"2021-03-05","arxiv_id":"2103.03821","repositories_listed":1,"syntology":null},{"url":"/paper/recurrent-graph-neural-network-algorithm-for","slug":"recurrent-graph-neural-network-algorithm-for","title":"Recurrent Graph Neural Network Algorithm for Unsupervised Network Community Detection","date":"2021-03-03","arxiv_id":"2103.02520","repositories_listed":1,"syntology":null},{"url":"/paper/autobahn-automorphism-based-graph-neural-nets","slug":"autobahn-automorphism-based-graph-neural-nets","title":"Autobahn: Automorphism-based Graph Neural Nets","date":"2021-03-02","arxiv_id":"2103.01710","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-strategies-for-protodune-raw","slug":"deep-learning-strategies-for-protodune-raw","title":"Deep Learning strategies for ProtoDUNE raw data denoising","date":"2021-03-02","arxiv_id":"2103.01596","repositories_listed":1,"syntology":null},{"url":"/paper/a-biased-graph-neural-network-sampler-with","slug":"a-biased-graph-neural-network-sampler-with","title":"A Biased Graph Neural Network Sampler with Near-Optimal Regret","date":"2021-03-01","arxiv_id":"2103.01089","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-auxiliary-learning-for-graph","slug":"self-supervised-auxiliary-learning-for-graph","title":"Self-supervised Auxiliary Learning for Graph Neural Networks via Meta-Learning","date":"2021-03-01","arxiv_id":"2103.00771","repositories_listed":1,"syntology":null},{"url":"/paper/learning-symbolic-operators-for-task-and","slug":"learning-symbolic-operators-for-task-and","title":"Learning Symbolic Operators for Task and Motion Planning","date":"2021-02-28","arxiv_id":"2103.00589","repositories_listed":1,"syntology":null},{"url":"/paper/anomaly-detection-on-attributed-networks-via","slug":"anomaly-detection-on-attributed-networks-via","title":"Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning","date":"2021-02-27","arxiv_id":"2103.00113","repositories_listed":1,"syntology":null},{"url":"/paper/pre-training-on-dynamic-graph-neural-networks","slug":"pre-training-on-dynamic-graph-neural-networks","title":"Pre-Training on Dynamic Graph Neural Networks","date":"2021-02-24","arxiv_id":"2102.12380","repositories_listed":1,"syntology":null},{"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/node-select-a-graph-neural-network-based-on-a","slug":"node-select-a-graph-neural-network-based-on-a","title":"NODE-SELECT: A Graph Neural Network Based On A Selective Propagation Technique","date":"2021-02-17","arxiv_id":"2102.08588","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-graph-learning-for-molecular","slug":"few-shot-graph-learning-for-molecular","title":"Few-Shot Graph Learning for Molecular Property Prediction","date":"2021-02-16","arxiv_id":"2102.07916","repositories_listed":1,"syntology":null},{"url":"/paper/enhance-information-propagation-for-graph","slug":"enhance-information-propagation-for-graph","title":"Enhance Information Propagation for Graph Neural Network by Heterogeneous Aggregations","date":"2021-02-08","arxiv_id":"2102.04064","repositories_listed":1,"syntology":null},{"url":"/paper/hint-hierarchical-interaction-network-for","slug":"hint-hierarchical-interaction-network-for","title":"HINT: Hierarchical Interaction Network for Trial Outcome Prediction Leveraging Web Data","date":"2021-02-08","arxiv_id":"2102.04252","repositories_listed":1,"syntology":null},{"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/re-parameterized-explainer-for-graph-neural","slug":"re-parameterized-explainer-for-graph-neural","title":"[Re] Parameterized Explainer for Graph Neural Network","date":"2021-01-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/bridgedpi-a-novel-graph-neural-network-for","slug":"bridgedpi-a-novel-graph-neural-network-for","title":"BridgeDPI: A Novel Graph Neural Network for Predicting Drug-Protein Interactions","date":"2021-01-29","arxiv_id":"2101.12547","repositories_listed":1,"syntology":null},{"url":"/paper/improving-graph-representation-learning-by","slug":"improving-graph-representation-learning-by","title":"Calibrating and Improving Graph Contrastive Learning","date":"2021-01-27","arxiv_id":"2101.11525","repositories_listed":1,"syntology":null},{"url":"/paper/learning-parametrised-graph-shift-operators-1","slug":"learning-parametrised-graph-shift-operators-1","title":"Learning Parametrised Graph Shift Operators","date":"2021-01-25","arxiv_id":"2101.10050","repositories_listed":1,"syntology":null},{"url":"/paper/directed-acyclic-graph-neural-networks-1","slug":"directed-acyclic-graph-neural-networks-1","title":"Directed Acyclic Graph Neural Networks","date":"2021-01-20","arxiv_id":"2101.07965","repositories_listed":1,"syntology":null},{"url":"/paper/pytorch-direct-enabling-gpu-centric-data","slug":"pytorch-direct-enabling-gpu-centric-data","title":"PyTorch-Direct: Enabling GPU Centric Data Access for Very Large Graph Neural Network Training with Irregular Accesses","date":"2021-01-20","arxiv_id":"2101.07956","repositories_listed":1,"syntology":null},{"url":"/paper/sugar-subgraph-neural-network-with","slug":"sugar-subgraph-neural-network-with","title":"SUGAR: Subgraph Neural Network with Reinforcement Pooling and Self-Supervised Mutual Information Mechanism","date":"2021-01-20","arxiv_id":"2101.08170","repositories_listed":1,"syntology":null},{"url":"/paper/label-contrastive-coding-based-graph-neural","slug":"label-contrastive-coding-based-graph-neural","title":"Label Contrastive Coding based Graph Neural Network for Graph Classification","date":"2021-01-14","arxiv_id":"2101.05486","repositories_listed":1,"syntology":null},{"url":"/paper/highair-a-hierarchical-graph-neural-network","slug":"highair-a-hierarchical-graph-neural-network","title":"HighAir: A Hierarchical Graph Neural Network-Based Air Quality Forecasting Method","date":"2021-01-12","arxiv_id":"2101.04264","repositories_listed":1,"syntology":null},{"url":"/paper/crslab-an-open-source-toolkit-for-building","slug":"crslab-an-open-source-toolkit-for-building","title":"CRSLab: An Open-Source Toolkit for Building Conversational Recommender System","date":"2021-01-04","arxiv_id":"2101.00939","repositories_listed":1,"syntology":null},{"url":"/paper/binary-graph-neural-networks","slug":"binary-graph-neural-networks","title":"Binary Graph Neural Networks","date":"2020-12-31","arxiv_id":"2012.15823","repositories_listed":1,"syntology":null},{"url":"/paper/sit3-code-summarization-with-structure","slug":"sit3-code-summarization-with-structure","title":"Code Summarization with Structure-induced Transformer","date":"2020-12-29","arxiv_id":"2012.14710","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-image-retrieval-re-ranking-a","slug":"understanding-image-retrieval-re-ranking-a","title":"Understanding Image Retrieval Re-Ranking: A Graph Neural Network Perspective","date":"2020-12-14","arxiv_id":"2012.07620","repositories_listed":1,"syntology":null},{"url":"/paper/group-wise-semantic-mining-for-weakly","slug":"group-wise-semantic-mining-for-weakly","title":"Group-Wise Semantic Mining for Weakly Supervised Semantic Segmentation","date":"2020-12-09","arxiv_id":"2012.05007","repositories_listed":1,"syntology":null},{"url":"/paper/infusing-multi-source-knowledge-with","slug":"infusing-multi-source-knowledge-with","title":"Emotional Conversation Generation with Heterogeneous Graph Neural Network","date":"2020-12-09","arxiv_id":"2012.04882","repositories_listed":1,"syntology":null},{"url":"/paper/tracking-interaction-states-for-multi-turn","slug":"tracking-interaction-states-for-multi-turn","title":"Tracking Interaction States for Multi-Turn Text-to-SQL Semantic Parsing","date":"2020-12-09","arxiv_id":"2012.04995","repositories_listed":1,"syntology":null},{"url":"/paper/bondnet-a-graph-neural-network-for-the","slug":"bondnet-a-graph-neural-network-for-the","title":"BonDNet: a graph neural network for the prediction of bond dissociation energies for charged molecules","date":"2020-12-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-soil-moisture-prediction","slug":"semi-supervised-soil-moisture-prediction","title":"Dynamic Structure Learning through Graph Neural Network for Forecasting Soil Moisture in Precision Agriculture","date":"2020-12-07","arxiv_id":"2012.03506","repositories_listed":1,"syntology":null},{"url":"/paper/dr-covid-graph-neural-networks-for-sars-cov-2","slug":"dr-covid-graph-neural-networks-for-sars-cov-2","title":"Dr-COVID: Graph Neural Networks for SARS-CoV-2 Drug Repurposing","date":"2020-12-03","arxiv_id":"2012.02151","repositories_listed":1,"syntology":null},{"url":"/paper/codecmr-cross-modal-retrieval-for-function","slug":"codecmr-cross-modal-retrieval-for-function","title":"CodeCMR: Cross-Modal Retrieval For Function-Level Binary Source Code Matching","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-stochastic-neural-networks-for-semi","slug":"graph-stochastic-neural-networks-for-semi","title":"Graph Stochastic Neural Networks for Semi-supervised Learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-targeted-universal-attack-on-graph","slug":"a-targeted-universal-attack-on-graph","title":"A Targeted Universal Attack on Graph Convolutional Network","date":"2020-11-29","arxiv_id":"2011.14365","repositories_listed":1,"syntology":null},{"url":"/paper/self-expressive-graph-neural-network-for","slug":"self-expressive-graph-neural-network-for","title":"Unsupervised Constrained Community Detection via Self-Expressive Graph Neural Network","date":"2020-11-28","arxiv_id":"2011.14078","repositories_listed":1,"syntology":null}],"record_sha256":"fb7d0a8dccfed84a9594296fdb0b90248c29bed890eae6ddc51dc1700bfff895","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}