{"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":"/method/graph-neural-network/papers/26","list_of":"/method/graph-neural-network","method":"Graph Neural Network","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":26,"pages_in_order":27,"rows_per_page":100,"rows":[2501,2600],"of":2694,"counts":{"archive_papers_tagged":2694,"with_a_code_link":1137,"where_syntology_ran_a_sample":271,"not_listed_spam_title":0,"listed":2694,"listed_where_code_ran":271,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":235,"every_run_a_failure_of_syntologys_instrument":36,"listed_with_a_run_with_no_instrument_failure":235,"listed_every_run_a_failure_of_syntologys_instrument":36,"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":"/method/graph-neural-network","prev":"/method/graph-neural-network/papers/25","next":"/method/graph-neural-network/papers/27","papers":[{"paper":null,"slug":"evonet-a-neural-network-for-predicting-the-1","title":"EvoNet: A Neural Network for Predicting the Evolution of Dynamic Graphs","date":"2020-03-02","arxiv_id":"2003.00842","n_code_links":0,"syntology":null},{"paper":"/paper/permutation-invariant-graph-generation-via","slug":"permutation-invariant-graph-generation-via","title":"Permutation Invariant Graph Generation via Score-Based Generative Modeling","date":"2020-03-02","arxiv_id":"2003.00638","n_code_links":1,"syntology":null},{"paper":"/paper/point-gnn-graph-neural-network-for-3d-object","slug":"point-gnn-graph-neural-network-for-3d-object","title":"Point-GNN: Graph Neural Network for 3D Object Detection in a Point Cloud","date":"2020-03-02","arxiv_id":"2003.01251","n_code_links":1,"syntology":null},{"paper":"/paper/sketchgcn-semantic-sketch-segmentation-with","slug":"sketchgcn-semantic-sketch-segmentation-with","title":"SketchGNN: Semantic Sketch Segmentation with Graph Neural Networks","date":"2020-03-02","arxiv_id":"2003.00678","n_code_links":1,"syntology":null},{"paper":"/paper/heterogeneous-graph-neural-networks-for","slug":"heterogeneous-graph-neural-networks-for","title":"Heterogeneous Graph Neural Networks for Malicious Account Detection","date":"2020-02-27","arxiv_id":"2002.12307","n_code_links":1,"syntology":null},{"paper":null,"slug":"data-augmentation-for-personal-knowledge","title":"Data Augmentation for Personal Knowledge Base Population","date":"2020-02-23","arxiv_id":"2002.10943","n_code_links":0,"syntology":null},{"paper":"/paper/exploiting-typed-syntactic-dependencies-for","slug":"exploiting-typed-syntactic-dependencies-for","title":"Investigating Typed Syntactic Dependencies for Targeted Sentiment Classification Using Graph Attention Neural Network","date":"2020-02-22","arxiv_id":"2002.09685","n_code_links":1,"syntology":null},{"paper":"/paper/ocgnn-one-class-classification-with-graph","slug":"ocgnn-one-class-classification-with-graph","title":"One-Class Graph Neural Networks for Anomaly Detection in Attributed Networks","date":"2020-02-22","arxiv_id":"2002.09594","n_code_links":3,"syntology":null},{"paper":"/paper/beyond-clicks-modeling-multi-relational-item","slug":"beyond-clicks-modeling-multi-relational-item","title":"Beyond Clicks: Modeling Multi-Relational Item Graph for Session-Based Target Behavior Prediction","date":"2020-02-19","arxiv_id":"2002.07993","n_code_links":1,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"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","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"]}}},{"paper":null,"slug":"riskoracle-a-minute-level-citywide-traffic","title":"RiskOracle: A Minute-level Citywide Traffic Accident Forecasting Framework","date":"2020-02-19","arxiv_id":"2003.00819","n_code_links":0,"syntology":null},{"paper":"/paper/a-lagrangian-approach-to-information","slug":"a-lagrangian-approach-to-information","title":"A Lagrangian Approach to Information Propagation in Graph Neural Networks","date":"2020-02-18","arxiv_id":"2002.07684","n_code_links":1,"syntology":null},{"paper":null,"slug":"wireless-power-control-via-counterfactual","title":"Wireless Power Control via Counterfactual Optimization of Graph Neural Networks","date":"2020-02-17","arxiv_id":"2002.07631","n_code_links":0,"syntology":null},{"paper":"/paper/learning-cross-modal-context-graph-for-visual","slug":"learning-cross-modal-context-graph-for-visual","title":"Learning Cross-modal Context Graph for Visual Grounding","date":"2020-02-13","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/superpixel-image-classification-with-graph","slug":"superpixel-image-classification-with-graph","title":"Superpixel Image Classification with Graph Attention Networks","date":"2020-02-13","arxiv_id":"2002.05544","n_code_links":1,"syntology":null},{"paper":"/paper/deep-multi-task-augmented-feature-learning","slug":"deep-multi-task-augmented-feature-learning","title":"Deep Multi-Task Augmented Feature Learning via Hierarchical Graph Neural Network","date":"2020-02-12","arxiv_id":"2002.04813","n_code_links":1,"syntology":null},{"paper":"/paper/graph-universal-adversarial-attacks-a-few-bad","slug":"graph-universal-adversarial-attacks-a-few-bad","title":"Graph Universal Adversarial Attacks: A Few Bad Actors Ruin Graph Learning Models","date":"2020-02-12","arxiv_id":"2002.04784","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":6,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["chisam0217/Graph-Universal-Attack"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/differentiable-graph-module-dgm-graph","slug":"differentiable-graph-module-dgm-graph","title":"Differentiable Graph Module (DGM) for Graph Convolutional Networks","date":"2020-02-11","arxiv_id":"2002.04999","n_code_links":1,"syntology":null},{"paper":null,"slug":"graph-convolutional-gaussian-processes-for","title":"Graph Convolutional Gaussian Processes For Link Prediction","date":"2020-02-11","arxiv_id":"2002.04337","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-structured-communication-for-multi-1","title":"Learning Structured Communication for Multi-agent Reinforcement Learning","date":"2020-02-11","arxiv_id":"2002.04235","n_code_links":0,"syntology":null},{"paper":"/paper/bilinear-graph-neural-network-with-node","slug":"bilinear-graph-neural-network-with-node","title":"Bilinear Graph Neural Network with Neighbor Interactions","date":"2020-02-10","arxiv_id":"2002.03575","n_code_links":1,"syntology":null},{"paper":"/paper/graph-neural-distance-metric-learning-with","slug":"graph-neural-distance-metric-learning-with","title":"Graph Neural Distance Metric Learning with Graph-Bert","date":"2020-02-09","arxiv_id":"2002.03427","n_code_links":1,"syntology":null},{"paper":null,"slug":"fast-detection-of-maximum-common-subgraph-via","title":"GLSearch: Maximum Common Subgraph Detection via Learning to Search","date":"2020-02-08","arxiv_id":"2002.03129","n_code_links":0,"syntology":null},{"paper":"/paper/message-passing-for-query-answering-over","slug":"message-passing-for-query-answering-over","title":"Message Passing Query Embedding","date":"2020-02-06","arxiv_id":"2002.02406","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["dfdazac/mpqe"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"vgai-a-vision-based-decentralized-controller","title":"VGAI: End-to-End Learning of Vision-Based Decentralized Controllers for Robot Swarms","date":"2020-02-06","arxiv_id":"2002.02308","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":null},{"paper":"/paper/mraea-an-efficient-and-robust-entity","slug":"mraea-an-efficient-and-robust-entity","title":"MRAEA: An Efficient and Robust Entity Alignment Approach for Cross-lingual Knowledge Graph","date":"2020-02-03","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"hybrid-graph-neural-networks-for-crowd","title":"Hybrid Graph Neural Networks for Crowd Counting","date":"2020-01-31","arxiv_id":"2002.00092","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":null},{"paper":"/paper/taxoexpan-self-supervised-taxonomy-expansion","slug":"taxoexpan-self-supervised-taxonomy-expansion","title":"TaxoExpan: Self-supervised Taxonomy Expansion with Position-Enhanced Graph Neural Network","date":"2020-01-26","arxiv_id":"2001.09522","n_code_links":3,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["mickeystroller/TaxoExpan"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"theoretically-expressive-and-edge-aware-graph","title":"Theoretically Expressive and Edge-aware Graph Learning","date":"2020-01-24","arxiv_id":"2001.09005","n_code_links":0,"syntology":null},{"paper":null,"slug":"linking-bank-clients-using-graph-neural","title":"Linking Bank Clients using Graph Neural Networks Powered by Rich Transactional Data","date":"2020-01-23","arxiv_id":"2001.08427","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":null},{"paper":"/paper/zero-shot-video-object-segmentation-via-1","slug":"zero-shot-video-object-segmentation-via-1","title":"Zero-Shot Video Object Segmentation via Attentive Graph Neural Networks","date":"2020-01-19","arxiv_id":"2001.06807","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":3,"n_instrument":1,"unverified":1,"pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["carrierlxk/AGNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"few-shot-relation-extraction-via-bayesian-1","title":"Few-shot Relation Extraction via Bayesian Meta-learning on Task Graphs","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"fully-convolutional-graph-neural-networks","title":"Fully Convolutional Graph Neural Networks using Bipartite Graph Convolutions","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":null},{"paper":null,"slug":"solving-cold-start-problem-in-recommendation","title":"Solving Cold Start Problem in Recommendation with Attribute Graph Neural Networks","date":"2019-12-28","arxiv_id":"1912.12398","n_code_links":0,"syntology":null},{"paper":"/paper/memory-augmented-graph-neural-networks-for","slug":"memory-augmented-graph-neural-networks-for","title":"Memory Augmented Graph Neural Networks for Sequential Recommendation","date":"2019-12-26","arxiv_id":"1912.11730","n_code_links":1,"syntology":null},{"paper":"/paper/multi-graph-transformer-for-free-hand-sketch","slug":"multi-graph-transformer-for-free-hand-sketch","title":"Multi-Graph Transformer for Free-Hand Sketch Recognition","date":"2019-12-24","arxiv_id":"1912.11258","n_code_links":1,"syntology":{"ran":0,"of":4,"n_ran_checked":0,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"0 ran · 4 unverified","official":{"repos":["PengBoXiangShang/multigraph_transformer"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]}}},{"paper":"/paper/learning-variable-ordering-heuristics-for","slug":"learning-variable-ordering-heuristics-for","title":"Learning Variable Ordering Heuristics for Solving Constraint Satisfaction Problems","date":"2019-12-23","arxiv_id":"1912.10762","n_code_links":1,"syntology":null},{"paper":null,"slug":"graph-message-passing-with-cross-location","title":"Graph Message Passing with Cross-location Attentions for Long-term ILI Prediction","date":"2019-12-21","arxiv_id":"1912.10202","n_code_links":0,"syntology":null},{"paper":"/paper/a-fair-comparison-of-graph-neural-networks-1","slug":"a-fair-comparison-of-graph-neural-networks-1","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","date":"2019-12-20","arxiv_id":"1912.09893","n_code_links":5,"syntology":null},{"paper":"/paper/meta-graph-few-shot-link-prediction-via-meta-1","slug":"meta-graph-few-shot-link-prediction-via-meta-1","title":"Meta-Graph: Few Shot Link Prediction via Meta Learning","date":"2019-12-20","arxiv_id":"1912.09867","n_code_links":1,"syntology":null},{"paper":"/paper/an-attention-based-graph-neural-network-for","slug":"an-attention-based-graph-neural-network-for","title":"An Attention-based Graph Neural Network for Heterogeneous Structural Learning","date":"2019-12-19","arxiv_id":"1912.10832","n_code_links":1,"syntology":{"ran":0,"of":3,"n_ran_checked":0,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"0 ran · 3 unverified","official":{"repos":["didi/hetsann"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"paper":null,"slug":"joint-interaction-and-trajectory-prediction","title":"Joint Interaction and Trajectory Prediction for Autonomous Driving using Graph Neural Networks","date":"2019-12-17","arxiv_id":"1912.07882","n_code_links":0,"syntology":null},{"paper":null,"slug":"zoom-in-to-where-it-matters-a-hierarchical","title":"Zoom in to where it matters: a hierarchical graph based model for mammogram analysis","date":"2019-12-16","arxiv_id":"1912.07517","n_code_links":0,"syntology":null},{"paper":null,"slug":"coloring-graph-neural-networks-for-node-1","title":"Coloring graph neural networks for node disambiguation","date":"2019-12-12","arxiv_id":"1912.06058","n_code_links":0,"syntology":null},{"paper":"/paper/graph-neural-networks-for-decentralized-multi","slug":"graph-neural-networks-for-decentralized-multi","title":"Graph Neural Networks for Decentralized Multi-Robot Path Planning","date":"2019-12-12","arxiv_id":"1912.06095","n_code_links":1,"syntology":null},{"paper":"/paper/incrementally-improving-graph-wavenet","slug":"incrementally-improving-graph-wavenet","title":"Incrementally Improving Graph WaveNet Performance on Traffic Prediction","date":"2019-12-11","arxiv_id":"1912.07390","n_code_links":4,"syntology":null},{"paper":"/paper/conv-mpn-convolutional-message-passing-neural","slug":"conv-mpn-convolutional-message-passing-neural","title":"Conv-MPN: Convolutional Message Passing Neural Network for Structured Outdoor Architecture Reconstruction","date":"2019-12-04","arxiv_id":"1912.01756","n_code_links":1,"syntology":null},{"paper":"/paper/neural-network-branching-for-neural-network-1","slug":"neural-network-branching-for-neural-network-1","title":"Neural Network Branching for Neural Network Verification","date":"2019-12-03","arxiv_id":"1912.01329","n_code_links":1,"syntology":{"ran":5,"of":6,"n_ran_checked":4,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["oval-group/GNN_branching"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/compiler-auto-vectorization-with-imitation","slug":"compiler-auto-vectorization-with-imitation","title":"Compiler Auto-Vectorization with Imitation Learning","date":"2019-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"hepatocellular-carcinoma-intra-arterial","title":"Hepatocellular Carcinoma Intra-arterial Treatment Response Prediction for Improved Therapeutic Decision-Making","date":"2019-12-01","arxiv_id":"1912.00411","n_code_links":0,"syntology":null},{"paper":"/paper/learning-local-search-heuristics-for-boolean","slug":"learning-local-search-heuristics-for-boolean","title":"Learning Local Search Heuristics for Boolean Satisfiability","date":"2019-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"property-invariant-embedding-for-automated","title":"Property Invariant Embedding for Automated Reasoning","date":"2019-11-27","arxiv_id":"1911.12073","n_code_links":0,"syntology":null},{"paper":"/paper/semi-supervised-hierarchical-recurrent-graph","slug":"semi-supervised-hierarchical-recurrent-graph","title":"Semi-Supervised Hierarchical Recurrent Graph Neural Network for City-Wide Parking Availability Prediction","date":"2019-11-24","arxiv_id":"1911.10516","n_code_links":1,"syntology":null},{"paper":null,"slug":"fast-and-deep-graph-neural-networks","title":"Fast and Deep Graph Neural Networks","date":"2019-11-20","arxiv_id":"1911.08941","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":null},{"paper":null,"slug":"on-node-features-for-graph-neural-networks","title":"On Node Features for Graph Neural Networks","date":"2019-11-20","arxiv_id":"1911.08795","n_code_links":0,"syntology":null},{"paper":"/paper/heterogeneous-deep-graph-infomax","slug":"heterogeneous-deep-graph-infomax","title":"Heterogeneous Deep Graph Infomax","date":"2019-11-19","arxiv_id":"1911.08538","n_code_links":1,"syntology":null},{"paper":"/paper/modality-to-modality-translation-an","slug":"modality-to-modality-translation-an","title":"Modality to Modality Translation: An Adversarial Representation Learning and Graph Fusion Network for Multimodal Fusion","date":"2019-11-18","arxiv_id":"1911.07848","n_code_links":1,"syntology":null},{"paper":"/paper/inductive-relation-prediction-on-knowledge","slug":"inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","n_code_links":10,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["kkteru/grail"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/hierarchical-graph-pooling-with-structure","slug":"hierarchical-graph-pooling-with-structure","title":"Hierarchical Graph Pooling with Structure Learning","date":"2019-11-14","arxiv_id":"1911.05954","n_code_links":3,"syntology":null},{"paper":"/paper/leveraging-dependency-forest-for-neural-1","slug":"leveraging-dependency-forest-for-neural-1","title":"Leveraging Dependency Forest for Neural Medical Relation Extraction","date":"2019-11-11","arxiv_id":"1911.04123","n_code_links":1,"syntology":null},{"paper":"/paper/hyper-sagnn-a-self-attention-based-graph-1","slug":"hyper-sagnn-a-self-attention-based-graph-1","title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs","date":"2019-11-06","arxiv_id":"1911.02613","n_code_links":1,"syntology":{"ran":7,"of":11,"n_ran_checked":6,"n_instrument":1,"unverified":4,"pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","official":{"repos":["ma-compbio/Hyper-SAGNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/multi-paragraph-reasoning-with-knowledge","slug":"multi-paragraph-reasoning-with-knowledge","title":"Multi-Paragraph Reasoning with Knowledge-enhanced Graph Neural Network","date":"2019-11-06","arxiv_id":"1911.02170","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-fix-build-errors-with-graph2diff","title":"Learning to Fix Build Errors with Graph2Diff Neural Networks","date":"2019-11-04","arxiv_id":"1911.01205","n_code_links":0,"syntology":null},{"paper":"/paper/a-lexicon-based-graph-neural-network-for","slug":"a-lexicon-based-graph-neural-network-for","title":"A Lexicon-Based Graph Neural Network for Chinese NER","date":"2019-11-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"heterogeneous-graph-attention-networks-for","title":"Heterogeneous Graph Attention Networks for Semi-supervised Short Text Classification","date":"2019-11-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-order-graph-elements-with","title":"Learning to Order Graph Elements with Application to Multilingual Surface Realization","date":"2019-11-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"reviews-meet-graphs-enhancing-user-and-item","title":"Reviews Meet Graphs: Enhancing User and Item Representations for Recommendation with Hierarchical Attentive Graph Neural Network","date":"2019-11-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"multitask-learning-on-graph-neural-networks-1","title":"Multitask Learning On Graph Neural Networks Applied To Molecular Property Predictions","date":"2019-10-29","arxiv_id":"1910.13124","n_code_links":0,"syntology":null},{"paper":null,"slug":"prodyn0-inferring-calponin-homology-domain","title":"ProDyn0: Inferring calponin homology domain stretching behavior using graph neural networks","date":"2019-10-22","arxiv_id":"1910.09738","n_code_links":0,"syntology":null},{"paper":"/paper/personalizing-graph-neural-networks-with","slug":"personalizing-graph-neural-networks-with","title":"Personalized Graph Neural Networks with Attention Mechanism for Session-Aware Recommendation","date":"2019-10-20","arxiv_id":"1910.08887","n_code_links":3,"syntology":null},{"paper":"/paper/natural-question-generation-with","slug":"natural-question-generation-with","title":"Natural Question Generation with Reinforcement Learning Based Graph-to-Sequence Model","date":"2019-10-19","arxiv_id":"1910.08832","n_code_links":1,"syntology":null},{"paper":null,"slug":"relational-graph-representation-learning-for","title":"Relational Graph Representation Learning for Open-Domain Question Answering","date":"2019-10-18","arxiv_id":"1910.08249","n_code_links":0,"syntology":null},{"paper":null,"slug":"spatially-aware-graph-neural-networks-for","title":"Spatially-Aware Graph Neural Networks for Relational Behavior Forecasting from Sensor Data","date":"2019-10-18","arxiv_id":"1910.08233","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":null},{"paper":"/paper/graph-based-knowledge-tracing-modeling","slug":"graph-based-knowledge-tracing-modeling","title":"Graph-based Knowledge Tracing: Modeling Student Proficiency Using Graph Neural Network","date":"2019-10-14","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"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","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"]}}},{"paper":"/paper/routenet-leveraging-graph-neural-networks-for","slug":"routenet-leveraging-graph-neural-networks-for","title":"RouteNet: Leveraging Graph Neural Networks for network modeling and optimization in SDN","date":"2019-10-03","arxiv_id":"1910.01508","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-graphical-feature-learning-for-the","title":"Deep Graphical Feature Learning for the Feature Matching Problem","date":"2019-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"from-strings-to-things-knowledge-enabled-vqa","title":"From Strings to Things: Knowledge-Enabled VQA Model That Can Read and Reason","date":"2019-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"g3raphground-graph-based-language-grounding","title":"G3raphGround: Graph-Based Language Grounding","date":"2019-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/mixture-kernel-graph-attention-network-for","slug":"mixture-kernel-graph-attention-network-for","title":"Mixture-Kernel Graph Attention Network for Situation Recognition","date":"2019-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"gdp-generalized-device-placement-for-dataflow","title":"GDP: Generalized Device Placement for Dataflow Graphs","date":"2019-09-28","arxiv_id":"1910.01578","n_code_links":0,"syntology":null},{"paper":"/paper/overlapping-community-detection-with-graph-1","slug":"overlapping-community-detection-with-graph-1","title":"Overlapping Community Detection with Graph Neural Networks","date":"2019-09-26","arxiv_id":"1909.12201","n_code_links":1,"syntology":{"ran":12,"of":12,"n_ran_checked":12,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["shchur/overlapping-community-detection"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-graph-neural-network-assisted-monte-carlo","title":"A Graph Neural Network Assisted Monte Carlo Tree Search Approach to Traveling Salesman Problem","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"beyond-classical-diffusion-ballistic-graph","title":"Beyond Classical Diffusion: Ballistic Graph Neural Network","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"demystifying-graph-neural-network-via-graph","title":"Demystifying Graph Neural Network Via Graph Filter Assessment","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"empowering-graph-representation-learning-with","title":"Empowering Graph Representation Learning with Paired Training and Graph Co-Attention","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"frequency-analysis-for-graph-convolution","title":"Frequency Analysis for Graph Convolution Network","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-neural-networks-for-multi-image","title":"Graph Neural Networks For Multi-Image Matching","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/graphmix-regularized-training-of-graph-neural","slug":"graphmix-regularized-training-of-graph-neural","title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","date":"2019-09-25","arxiv_id":"1909.11715","n_code_links":1,"syntology":null},{"paper":null,"slug":"graphmix-regularized-training-of-graph-neural-1","title":"GraphMix: Regularized Training of Graph Neural Networks for Semi-Supervised Learning","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"hierarchical-graph-matching-networks-for-deep","title":"Hierarchical Graph Matching Networks for Deep Graph Similarity Learning","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/molecular-graph-enhanced-transformer-for","slug":"molecular-graph-enhanced-transformer-for","title":"Molecular Graph Enhanced Transformer for Retrosynthesis Prediction","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"pdp-a-general-neural-framework-for-learning-1","title":"PDP: A General Neural Framework for Learning SAT Solvers","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/190910086","slug":"190910086","title":"Learning Universal Graph Neural Network Embeddings With Aid Of Transfer Learning","date":"2019-09-22","arxiv_id":"1909.10086","n_code_links":1,"syntology":null}],"record_sha256":"5273dec280ad05fe225d4034f39058d992d88ca5dcdf54b3682e36ae8b12daf4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}