{"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/21","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":21,"pages_in_order":27,"rows_per_page":100,"rows":[2001,2100],"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/20","next":"/method/graph-neural-network/papers/22","papers":[{"paper":null,"slug":"blockchain-phishing-scam-detection-via-multi","title":"Blockchain Phishing Scam Detection via Multi-channel Graph Classification","date":"2021-08-19","arxiv_id":"2108.08456","n_code_links":0,"syntology":null},{"paper":"/paper/learning-to-match-features-with-seeded-graph","slug":"learning-to-match-features-with-seeded-graph","title":"Learning to Match Features with Seeded Graph Matching Network","date":"2021-08-19","arxiv_id":"2108.08771","n_code_links":1,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":null},{"paper":null,"slug":"when-product-search-meets-collaborative","title":"When Product Search Meets Collaborative Filtering: A Hierarchical Heterogeneous Graph Neural Network Approach","date":"2021-08-17","arxiv_id":"2108.07574","n_code_links":0,"syntology":null},{"paper":"/paper/scene-designer-a-unified-model-for-scene","slug":"scene-designer-a-unified-model-for-scene","title":"Scene Designer: a Unified Model for Scene Search and Synthesis from Sketch","date":"2021-08-16","arxiv_id":"2108.07353","n_code_links":1,"syntology":null},{"paper":"/paper/coupled-graph-ode-for-learning-interacting","slug":"coupled-graph-ode-for-learning-interacting","title":"Coupled Graph ODE for Learning Interacting System Dynamics","date":"2021-08-14","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"linkteller-recovering-private-edges-from","title":"LinkTeller: Recovering Private Edges from Graph Neural Networks via Influence Analysis","date":"2021-08-14","arxiv_id":"2108.06504","n_code_links":0,"syntology":null},{"paper":null,"slug":"progressive-representative-labeling-for-deep","title":"Progressive Representative Labeling for Deep Semi-Supervised Learning","date":"2021-08-13","arxiv_id":"2108.06070","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-efficient-point-cloud-graph-neural","title":"Towards Efficient Point Cloud Graph Neural Networks Through Architectural Simplification","date":"2021-08-13","arxiv_id":"2108.06317","n_code_links":0,"syntology":null},{"paper":null,"slug":"session-based-recommendation-with","title":"SR-HetGNN:Session-based Recommendation with Heterogeneous Graph Neural Network","date":"2021-08-12","arxiv_id":"2108.05641","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-maximize-influence","title":"Maximizing Influence with Graph Neural Networks","date":"2021-08-10","arxiv_id":"2108.04623","n_code_links":0,"syntology":null},{"paper":null,"slug":"maf-gnn-multi-adaptive-spatiotemporal-flow","title":"MAF-GNN: Multi-adaptive Spatiotemporal-flow Graph Neural Network for Traffic Speed Forecasting","date":"2021-08-08","arxiv_id":"2108.03594","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-difficulty-of-generalizing","title":"On the Difficulty of Generalizing Reinforcement Learning Framework for Combinatorial Optimization","date":"2021-08-08","arxiv_id":"2108.03713","n_code_links":0,"syntology":null},{"paper":"/paper/recurrent-graph-neural-networks-for-rumor","slug":"recurrent-graph-neural-networks-for-rumor","title":"Recurrent Graph Neural Networks for Rumor Detection in Online Forums","date":"2021-08-08","arxiv_id":"2108.03548","n_code_links":1,"syntology":null},{"paper":null,"slug":"jointly-attacking-graph-neural-network-and","title":"Jointly Attacking Graph Neural Network and its Explanations","date":"2021-08-07","arxiv_id":"2108.03388","n_code_links":0,"syntology":null},{"paper":null,"slug":"missing-data-estimation-in-temporal","title":"Missing Data Estimation in Temporal Multilayer Position-aware Graph Neural Network (TMP-GNN)","date":"2021-08-07","arxiv_id":"2108.03400","n_code_links":0,"syntology":null},{"paper":null,"slug":"angle-based-feature-learning-in-gnn-for-3d","title":"Angle Based Feature Learning in GNN for 3D Object Detection using Point Cloud","date":"2021-08-02","arxiv_id":"2108.00780","n_code_links":0,"syntology":null},{"paper":"/paper/hierarchical-representations-and-explicit","slug":"hierarchical-representations-and-explicit","title":"Hierarchical Representations and Explicit Memory: Learning Effective Navigation Policies on 3D Scene Graphs using Graph Neural Networks","date":"2021-08-02","arxiv_id":"2108.01176","n_code_links":1,"syntology":null},{"paper":null,"slug":"optimal-solving-of-constrained-path-planning","title":"Optimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search","date":"2021-08-02","arxiv_id":"2108.01036","n_code_links":0,"syntology":null},{"paper":"/paper/a-structure-self-aware-model-for-discourse","slug":"a-structure-self-aware-model-for-discourse","title":"A Structure Self-Aware Model for Discourse Parsing on Multi-Party Dialogues","date":"2021-08-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"discovering-dialog-structure-graph-for","title":"Discovering Dialog Structure Graph for Coherent Dialog Generation","date":"2021-08-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"label-specific-dual-graph-neural-network-for","title":"Label-Specific Dual Graph Neural Network for Multi-Label Text Classification","date":"2021-08-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/modeling-transitions-of-focal-entities-for","slug":"modeling-transitions-of-focal-entities-for","title":"Modeling Transitions of Focal Entities for Conversational Knowledge Base Question Answering","date":"2021-08-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":{"ran":5,"of":10,"n_ran_checked":4,"n_instrument":1,"unverified":5,"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","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"]}}},{"paper":"/paper/artist-similarity-with-graph-neural-networks","slug":"artist-similarity-with-graph-neural-networks","title":"Artist Similarity with Graph Neural Networks","date":"2021-07-30","arxiv_id":"2107.14541","n_code_links":1,"syntology":null},{"paper":"/paper/unveiling-the-potential-of-graph-neural-1","slug":"unveiling-the-potential-of-graph-neural-1","title":"Unveiling the potential of Graph Neural Networks for robust Intrusion Detection","date":"2021-07-30","arxiv_id":"2107.14756","n_code_links":1,"syntology":null},{"paper":null,"slug":"spatio-temporal-graph-neural-networks-for","title":"Spatio-temporal graph neural networks for multi-site PV power forecasting","date":"2021-07-29","arxiv_id":"2107.13875","n_code_links":0,"syntology":null},{"paper":null,"slug":"packet-routing-with-graph-attention-multi","title":"Packet Routing with Graph Attention Multi-agent Reinforcement Learning","date":"2021-07-28","arxiv_id":"2107.13181","n_code_links":0,"syntology":null},{"paper":null,"slug":"explicit-pairwise-factorized-graph-neural","title":"Explicit Pairwise Factorized Graph Neural Network for Semi-Supervised Node Classification","date":"2021-07-27","arxiv_id":"2107.13059","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-echo-lidar-for-3d-object-detection","title":"Multi-Echo LiDAR for 3D Object Detection","date":"2021-07-23","arxiv_id":"2107.11470","n_code_links":0,"syntology":null},{"paper":"/paper/learning-theorem-proving-components","slug":"learning-theorem-proving-components","title":"Learning Theorem Proving Components","date":"2021-07-21","arxiv_id":"2107.10034","n_code_links":1,"syntology":null},{"paper":"/paper/structure-aware-interactive-graph-neural","slug":"structure-aware-interactive-graph-neural","title":"Structure-aware Interactive Graph Neural Networks for the Prediction of Protein-Ligand Binding Affinity","date":"2021-07-21","arxiv_id":"2107.10670","n_code_links":1,"syntology":null},{"paper":"/paper/significant-wave-height-prediction-based-on","slug":"significant-wave-height-prediction-based-on","title":"Significant Wave Height Prediction based on Wavelet Graph Neural Network","date":"2021-07-20","arxiv_id":"2107.09483","n_code_links":1,"syntology":null},{"paper":"/paper/wikigraphs-a-wikipedia-text-knowledge-graph","slug":"wikigraphs-a-wikipedia-text-knowledge-graph","title":"WikiGraphs: A Wikipedia Text - Knowledge Graph Paired Dataset","date":"2021-07-20","arxiv_id":"2107.09556","n_code_links":1,"syntology":null},{"paper":null,"slug":"gnn4ip-graph-neural-network-for-hardware","title":"GNN4IP: Graph Neural Network for Hardware Intellectual Property Piracy Detection","date":"2021-07-19","arxiv_id":"2107.09130","n_code_links":0,"syntology":null},{"paper":null,"slug":"train-on-small-play-the-large-scaling-up","title":"Train on Small, Play the Large: Scaling Up Board Games with AlphaZero and GNN","date":"2021-07-18","arxiv_id":"2107.08387","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-an-interpretable-latent-space-in","title":"Towards an Interpretable Latent Space in Structured Models for Video Prediction","date":"2021-07-16","arxiv_id":"2107.07713","n_code_links":0,"syntology":null},{"paper":"/paper/algorithmic-concept-based-explainable","slug":"algorithmic-concept-based-explainable","title":"Algorithmic Concept-based Explainable Reasoning","date":"2021-07-15","arxiv_id":"2107.07493","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":7,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["HekpoMaH/algorithmic-concepts-reasoning"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/scalable-surface-reconstruction-with-delaunay","slug":"scalable-surface-reconstruction-with-delaunay","title":"Scalable Surface Reconstruction with Delaunay-Graph Neural Networks","date":"2021-07-13","arxiv_id":"2107.06130","n_code_links":1,"syntology":null},{"paper":null,"slug":"towards-representation-identical-privacy","title":"Towards Representation Identical Privacy-Preserving Graph Neural Network via Split Learning","date":"2021-07-13","arxiv_id":"2107.05917","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalization-of-graph-network-inferences-in","title":"Generalization of graph network inferences in higher-order graphical models","date":"2021-07-12","arxiv_id":"2107.05729","n_code_links":0,"syntology":null},{"paper":null,"slug":"group-node-attention-for-community-evolution","title":"Group-Node Attention for Community Evolution Prediction","date":"2021-07-09","arxiv_id":"2107.04522","n_code_links":0,"syntology":null},{"paper":null,"slug":"classifying-component-function-in-product","title":"Classifying Component Function in Product Assemblies with Graph Neural Networks","date":"2021-07-08","arxiv_id":"2107.07042","n_code_links":0,"syntology":null},{"paper":"/paper/discrete-time-temporal-network-embedding-via","slug":"discrete-time-temporal-network-embedding-via","title":"Discrete-time Temporal Network Embedding via Implicit Hierarchical Learning in Hyperbolic Space","date":"2021-07-08","arxiv_id":"2107.03767","n_code_links":1,"syntology":null},{"paper":"/paper/heterogeneous-global-graph-neural-networks","slug":"heterogeneous-global-graph-neural-networks","title":"Heterogeneous Global Graph Neural Networks for Personalized Session-based Recommendation","date":"2021-07-08","arxiv_id":"2107.03813","n_code_links":1,"syntology":null},{"paper":"/paper/echoea-echo-information-between-entities-and","slug":"echoea-echo-information-between-entities-and","title":"EchoEA: Echo Information between Entities and Relations for Entity Alignment","date":"2021-07-07","arxiv_id":"2107.03054","n_code_links":1,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":null},{"paper":null,"slug":"physics-informed-graph-learning-for-robust","title":"PPGN: Physics-Preserved Graph Networks for Real-Time Fault Location in Distribution Systems with Limited Observation and Labels","date":"2021-07-05","arxiv_id":"2107.02275","n_code_links":0,"syntology":null},{"paper":"/paper/learning-hierarchical-graph-neural-networks","slug":"learning-hierarchical-graph-neural-networks","title":"Learning Hierarchical Graph Neural Networks for Image Clustering","date":"2021-07-03","arxiv_id":"2107.01319","n_code_links":3,"syntology":null},{"paper":"/paper/combinatorial-optimization-with-physics","slug":"combinatorial-optimization-with-physics","title":"Combinatorial Optimization with Physics-Inspired Graph Neural Networks","date":"2021-07-02","arxiv_id":"2107.01188","n_code_links":3,"syntology":null},{"paper":null,"slug":"exploiting-cross-session-information-for","title":"Exploiting Cross-Session Information for Session-based Recommendation with Graph Neural Networks","date":"2021-07-02","arxiv_id":"2107.00852","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploiting-positional-information-for-session","title":"Exploiting Positional Information for Session-based Recommendation","date":"2021-07-02","arxiv_id":"2107.00846","n_code_links":0,"syntology":null},{"paper":null,"slug":"curvature-graph-neural-network","title":"Curvature Graph Neural Network","date":"2021-06-30","arxiv_id":"2106.15762","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploiting-spiking-dynamics-with-spatial","title":"Exploiting Spiking Dynamics with Spatial-temporal Feature Normalization in Graph Learning","date":"2021-06-30","arxiv_id":"2107.06865","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-learning-for-technical-document","title":"Deep Learning for Technical Document Classification","date":"2021-06-27","arxiv_id":"2106.14269","n_code_links":0,"syntology":null},{"paper":null,"slug":"deepgd-a-deep-learning-framework-for-graph","title":"DeepGD: A Deep Learning Framework for Graph Drawing Using GNN","date":"2021-06-27","arxiv_id":"2106.15347","n_code_links":0,"syntology":null},{"paper":"/paper/sequential-recommendation-with-graph-neural","slug":"sequential-recommendation-with-graph-neural","title":"Sequential Recommendation with Graph Neural Networks","date":"2021-06-27","arxiv_id":"2106.14226","n_code_links":1,"syntology":null},{"paper":null,"slug":"privileged-zero-shot-automl","title":"Privileged Zero-Shot AutoML","date":"2021-06-25","arxiv_id":"2106.13743","n_code_links":0,"syntology":null},{"paper":null,"slug":"to-the-point-efficient-3d-object-detection-in","title":"To the Point: Efficient 3D Object Detection in the Range Image with Graph Convolution Kernels","date":"2021-06-25","arxiv_id":"2106.13381","n_code_links":0,"syntology":null},{"paper":null,"slug":"vegn-variant-effect-prediction-with-graph","title":"VEGN: Variant Effect Prediction with Graph Neural Networks","date":"2021-06-25","arxiv_id":"2106.13642","n_code_links":0,"syntology":null},{"paper":"/paper/fea2fea-exploring-structural-feature","slug":"fea2fea-exploring-structural-feature","title":"Fea2Fea: Exploring Structural Feature Correlations via Graph Neural Networks","date":"2021-06-24","arxiv_id":"2106.13061","n_code_links":1,"syntology":null},{"paper":"/paper/geometric-learning-of-the-conformational","slug":"geometric-learning-of-the-conformational","title":"Geometric learning of the conformational dynamics of molecules using dynamic graph neural networks","date":"2021-06-24","arxiv_id":"2106.13277","n_code_links":1,"syntology":null},{"paper":null,"slug":"matchvie-exploiting-match-relevancy-between","title":"MatchVIE: Exploiting Match Relevancy between Entities for Visual Information Extraction","date":"2021-06-24","arxiv_id":"2106.12940","n_code_links":0,"syntology":null},{"paper":"/paper/scalable-perception-action-communication","slug":"scalable-perception-action-communication","title":"Scalable Perception-Action-Communication Loops with Convolutional and Graph Neural Networks","date":"2021-06-24","arxiv_id":"2106.13358","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":6,"n_instrument":1,"unverified":1,"pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["VITA-Group/VGAI"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-vertical-federated-learning-framework-for-1","title":"A Vertical Federated Learning Framework for Graph Convolutional Network","date":"2021-06-22","arxiv_id":"2106.11593","n_code_links":0,"syntology":null},{"paper":"/paper/bernnet-learning-arbitrary-graph-spectral","slug":"bernnet-learning-arbitrary-graph-spectral","title":"BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximation","date":"2021-06-21","arxiv_id":"2106.10994","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["ivam-he/BernNet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":"/paper/disenhan-disentangled-heterogeneous-graph","slug":"disenhan-disentangled-heterogeneous-graph","title":"DisenHAN: Disentangled Heterogeneous Graph Attention Network for Recommendation","date":"2021-06-21","arxiv_id":"2106.10879","n_code_links":1,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":null},{"paper":"/paper/end-to-end-rotation-averaging-with-multi","slug":"end-to-end-rotation-averaging-with-multi","title":"End-to-End Rotation Averaging With Multi-Source Propagation","date":"2021-06-19","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/graph-neural-networks-for-learning-real-time","slug":"graph-neural-networks-for-learning-real-time","title":"Graph Neural Networks for Learning Real-Time Prices in Electricity Market","date":"2021-06-19","arxiv_id":"2106.10529","n_code_links":1,"syntology":null},{"paper":"/paper/scale-aware-graph-neural-network-for-few-shot","slug":"scale-aware-graph-neural-network-for-few-shot","title":"Scale-Aware Graph Neural Network for Few-Shot Semantic Segmentation","date":"2021-06-19","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"scene-essence","title":"Scene Essence","date":"2021-06-19","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"self-supervised-incremental-deep-graph","title":"Self-supervised Incremental Deep Graph Learning for Ethereum Phishing Scam Detection","date":"2021-06-18","arxiv_id":"2106.10176","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-visibility-graph-neural-network-and","title":"Adaptive Visibility Graph Neural Network and It's Application in Modulation Classification","date":"2021-06-16","arxiv_id":"2106.08564","n_code_links":0,"syntology":null},{"paper":null,"slug":"eeg-gnn-graph-neural-networks-for","title":"EEG-GNN: Graph Neural Networks for Classification of Electroencephalogram (EEG) Signals","date":"2021-06-16","arxiv_id":"2106.09135","n_code_links":0,"syntology":null},{"paper":"/paper/fast-quantum-property-prediction-via-deeper","slug":"fast-quantum-property-prediction-via-deeper","title":"Fast Quantum Property Prediction via Deeper 2D and 3D Graph Networks","date":"2021-06-16","arxiv_id":"2106.08551","n_code_links":1,"syntology":null},{"paper":"/paper/neural-bellman-ford-networks-a-general-graph","slug":"neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","arxiv_id":"2106.06935","n_code_links":3,"syntology":{"ran":12,"of":15,"n_ran_checked":10,"n_instrument":2,"unverified":3,"pointer_only":2,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["DeepGraphLearning/NBFNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["community","listed","official"]}}},{"paper":"/paper/solving-graph-based-public-good-games-with","slug":"solving-graph-based-public-good-games-with","title":"Solving Graph-based Public Good Games with Tree Search and Imitation Learning","date":"2021-06-12","arxiv_id":"2106.06762","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["victordarvariu/solving-graph-pgg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/cross-node-federated-graph-neural-network-for-1","slug":"cross-node-federated-graph-neural-network-for-1","title":"Cross-Node Federated Graph Neural Network for Spatio-Temporal Data Modeling","date":"2021-06-09","arxiv_id":"2106.05223","n_code_links":1,"syntology":null},{"paper":"/paper/digrac-digraph-clustering-with-flow-imbalance","slug":"digrac-digraph-clustering-with-flow-imbalance","title":"DIGRAC: Digraph Clustering Based on Flow Imbalance","date":"2021-06-09","arxiv_id":"2106.05194","n_code_links":1,"syntology":{"ran":3,"of":8,"n_ran_checked":3,"n_instrument":0,"unverified":5,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["sherylhyx/digrac_directed_clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/plan2scene-converting-floorplans-to-3d-scenes","slug":"plan2scene-converting-floorplans-to-3d-scenes","title":"Plan2Scene: Converting Floorplans to 3D Scenes","date":"2021-06-09","arxiv_id":"2106.05375","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["3dlg-hcvc/plan2scene"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/self-supervised-graph-learning-with","slug":"self-supervised-graph-learning-with","title":"Self-Supervised Graph Learning with Hyperbolic Embedding for Temporal Health Event Prediction","date":"2021-06-09","arxiv_id":"2106.04751","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":1,"n_instrument":4,"unverified":0,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","official":{"repos":["LuChang-CS/sherbet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"simulating-continuum-mechanics-with-multi","title":"Simulating Continuum Mechanics with Multi-Scale Graph Neural Networks","date":"2021-06-09","arxiv_id":"2106.04900","n_code_links":0,"syntology":null},{"paper":"/paper/affinity-attention-graph-neural-network-for","slug":"affinity-attention-graph-neural-network-for","title":"Affinity Attention Graph Neural Network for Weakly Supervised Semantic Segmentation","date":"2021-06-08","arxiv_id":"2106.04054","n_code_links":1,"syntology":{"ran":1,"of":4,"n_ran_checked":1,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["zbf1991/A2GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"principled-hyperedge-prediction-with","title":"Principled Hyperedge Prediction with Structural Spectral Features and Neural Networks","date":"2021-06-08","arxiv_id":"2106.04292","n_code_links":0,"syntology":null},{"paper":"/paper/graph-neural-networks-in-network-neuroscience","slug":"graph-neural-networks-in-network-neuroscience","title":"Graph Neural Networks in Network Neuroscience","date":"2021-06-07","arxiv_id":"2106.03535","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-to-guide-a-saturation-based-theorem","title":"Learning to Guide a Saturation-Based Theorem Prover","date":"2021-06-07","arxiv_id":"2106.03906","n_code_links":0,"syntology":null},{"paper":"/paper/leveraging-tripartite-interaction-information","slug":"leveraging-tripartite-interaction-information","title":"Leveraging Tripartite Interaction Information from Live Stream E-Commerce for Improving Product Recommendation","date":"2021-06-07","arxiv_id":"2106.03415","n_code_links":1,"syntology":null},{"paper":"/paper/damsl-domain-agnostic-meta-score-based","slug":"damsl-domain-agnostic-meta-score-based","title":"DAMSL: Domain Agnostic Meta Score-based Learning","date":"2021-06-06","arxiv_id":"2106.03041","n_code_links":1,"syntology":null},{"paper":"/paper/graph-belief-propagation-networks","slug":"graph-belief-propagation-networks","title":"Graph Belief Propagation Networks","date":"2021-06-06","arxiv_id":"2106.03033","n_code_links":1,"syntology":null},{"paper":null,"slug":"graph2graph-learning-with-conditional","title":"Graph2Graph Learning with Conditional Autoregressive Models","date":"2021-06-06","arxiv_id":"2106.03236","n_code_links":0,"syntology":null},{"paper":null,"slug":"spectral-temporal-graph-neural-network-for","title":"Spectral Temporal Graph Neural Network for Trajectory Prediction","date":"2021-06-05","arxiv_id":"2106.02930","n_code_links":0,"syntology":null},{"paper":"/paper/convergent-graph-solvers","slug":"convergent-graph-solvers","title":"Convergent Graph Solvers","date":"2021-06-03","arxiv_id":"2106.01680","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","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"]}}},{"paper":null,"slug":"heterogeneous-graph-neural-network-via","title":"Heterogeneous Graph Neural Network via Attribute Completion","date":"2021-06-03","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"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","official":null}},{"paper":null,"slug":"learning-to-schedule-job-shop-problems","title":"Learning to schedule job-shop problems: Representation and policy learning using graph neural network and reinforcement learning","date":"2021-06-02","arxiv_id":"2106.01086","n_code_links":0,"syntology":null},{"paper":null,"slug":"breadth-first-reasoning-graph-for-multi-hop","title":"Breadth First Reasoning Graph for Multi-hop Question Answering","date":"2021-06-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":null,"slug":"structural-realization-with-ggnns","title":"Structural Realization with GGNNs","date":"2021-06-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null}],"record_sha256":"c5fc2f79dc3186d89ef291fc1fe23b08c248f84e4f175ad516ea14772bf18094","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}