{"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/16","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":16,"pages_in_order":27,"rows_per_page":100,"rows":[1501,1600],"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/15","next":"/method/graph-neural-network/papers/17","papers":[{"paper":null,"slug":"learning-the-dynamics-of-particle-based","title":"Learning the Dynamics of Particle-based Systems with Lagrangian Graph Neural Networks","date":"2022-09-03","arxiv_id":"2209.01476","n_code_links":0,"syntology":null},{"paper":"/paper/a-novel-approach-for-pill-prescription","slug":"a-novel-approach-for-pill-prescription","title":"A Novel Approach for Pill-Prescription Matching with GNN Assistance and Contrastive Learning","date":"2022-09-02","arxiv_id":"2209.01152","n_code_links":1,"syntology":null},{"paper":null,"slug":"satformer-transformers-for-sat-solving","title":"SATformer: Transformer-Based UNSAT Core Learning","date":"2022-09-02","arxiv_id":"2209.00953","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-chemical-space-exploration-using","slug":"efficient-chemical-space-exploration-using","title":"Efficient Chemical Space Exploration Using Active Learning Based on Marginalized Graph Kernel: an Application for Predicting the Thermodynamic Properties of Alkanes with Molecular Simulation","date":"2022-09-01","arxiv_id":"2209.00514","n_code_links":1,"syntology":null},{"paper":null,"slug":"multi-scale-contrastive-co-training-for-event","title":"Distilling Multi-Scale Knowledge for Event Temporal Relation Extraction","date":"2022-09-01","arxiv_id":"2209.00568","n_code_links":0,"syntology":null},{"paper":"/paper/learning-tree-structures-from-leaves-for","slug":"learning-tree-structures-from-leaves-for","title":"Learning Tree Structures from Leaves For Particle Decay Reconstruction","date":"2022-08-31","arxiv_id":"2208.14924","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-self-supervised-riemannian-gnn-with-time","title":"A Self-supervised Riemannian GNN with Time Varying Curvature for Temporal Graph Learning","date":"2022-08-30","arxiv_id":"2208.14073","n_code_links":0,"syntology":null},{"paper":"/paper/spatio-temporal-wind-speed-forecasting-using","slug":"spatio-temporal-wind-speed-forecasting-using","title":"Spatio-Temporal Wind Speed Forecasting using Graph Networks and Novel Transformer Architectures","date":"2022-08-29","arxiv_id":"2208.13585","n_code_links":1,"syntology":null},{"paper":null,"slug":"tep-gnn-accurate-execution-time-prediction-of","title":"TEP-GNN: Accurate Execution Time Prediction of Functional Tests using Graph Neural Networks","date":"2022-08-25","arxiv_id":"2208.11947","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-review-of-knowledge-graph-completion","title":"A Review of Knowledge Graph Completion","date":"2022-08-24","arxiv_id":"2208.11652","n_code_links":0,"syntology":null},{"paper":null,"slug":"data-driven-approach-to-form-energy-resilient","title":"Data-Driven Approach to form Energy Resilient Smart Microgrids with Identification of Vulnerable Nodes in Active Electrical Distribution Network","date":"2022-08-24","arxiv_id":"2208.11682","n_code_links":0,"syntology":null},{"paper":"/paper/data-augmentation-on-graphs-for-table-type","slug":"data-augmentation-on-graphs-for-table-type","title":"Data augmentation on graphs for table type classification","date":"2022-08-23","arxiv_id":"2208.11210","n_code_links":1,"syntology":null},{"paper":"/paper/flexer-flexible-entity-resolution-for","slug":"flexer-flexible-entity-resolution-for","title":"FlexER: Flexible Entity Resolution for Multiple Intents","date":"2022-08-23","arxiv_id":"2209.07569","n_code_links":1,"syntology":null},{"paper":null,"slug":"grad-align-empowering-gradual-network","title":"Grad-Align+: Empowering Gradual Network Alignment Using Attribute Augmentation","date":"2022-08-23","arxiv_id":"2208.11025","n_code_links":0,"syntology":null},{"paper":null,"slug":"object-detection-in-aerial-images-with","title":"Object Detection in Aerial Images with Uncertainty-Aware Graph Network","date":"2022-08-23","arxiv_id":"2208.10781","n_code_links":0,"syntology":null},{"paper":"/paper/one-model-any-csp-graph-neural-networks-as","slug":"one-model-any-csp-graph-neural-networks-as","title":"One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction","date":"2022-08-22","arxiv_id":"2208.10227","n_code_links":1,"syntology":{"ran":6,"of":8,"n_ran_checked":6,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["toenshoff/runcsp-pytorch"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"representation-learning-of-knowledge-graph","title":"Representation Learning of Knowledge Graph for Wireless Communication Networks","date":"2022-08-22","arxiv_id":"2208.10496","n_code_links":0,"syntology":null},{"paper":"/paper/molgraph-a-python-package-for-the","slug":"molgraph-a-python-package-for-the","title":"MolGraph: a Python package for the implementation of molecular graphs and graph neural networks with TensorFlow and Keras","date":"2022-08-21","arxiv_id":"2208.09944","n_code_links":1,"syntology":null},{"paper":null,"slug":"representation-learning-with-graph-neural","title":"Representation Learning with Graph Neural Networks for Speech Emotion Recognition","date":"2022-08-21","arxiv_id":"2208.09830","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-neural-network-based-node-deployment","title":"Graph Neural Network Based Node Deployment for Throughput Enhancement","date":"2022-08-19","arxiv_id":"2209.06905","n_code_links":0,"syntology":null},{"paper":null,"slug":"personalized-federated-recommendation-via","title":"Personalized Federated Recommendation via Joint Representation Learning, User Clustering, and Model Adaptation","date":"2022-08-19","arxiv_id":"2208.09375","n_code_links":0,"syntology":null},{"paper":null,"slug":"aoi-based-temporal-attention-graph-neural","title":"AoI-based Temporal Attention Graph Neural Network for Popularity Prediction and Content Caching","date":"2022-08-18","arxiv_id":"2208.08606","n_code_links":0,"syntology":null},{"paper":"/paper/robust-causal-graph-representation-learning","slug":"robust-causal-graph-representation-learning","title":"Robust Causal Graph Representation Learning against Confounding Effects","date":"2022-08-18","arxiv_id":"2208.08584","n_code_links":1,"syntology":{"ran":0,"of":3,"n_ran_checked":0,"n_instrument":0,"unverified":3,"pointer_only":3,"phrase":"0 ran · 3 unverified","official":{"repos":["hang53/rcgrl"],"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":"learnable-filters-for-geometric-scattering","title":"Learnable Filters for Geometric Scattering Modules","date":"2022-08-15","arxiv_id":"2208.07458","n_code_links":0,"syntology":null},{"paper":"/paper/mm-gnn-mix-moment-graph-neural-network","slug":"mm-gnn-mix-moment-graph-neural-network","title":"MM-GNN: Mix-Moment Graph Neural Network towards Modeling Neighborhood Feature Distribution","date":"2022-08-15","arxiv_id":"2208.07012","n_code_links":1,"syntology":{"ran":2,"of":5,"n_ran_checked":2,"n_instrument":0,"unverified":3,"pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["wendongbi/MMGNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"star-gnn-spatial-temporal-video","title":"STAR-GNN: Spatial-Temporal Video Representation for Content-based Retrieval","date":"2022-08-15","arxiv_id":"2208.06966","n_code_links":0,"syntology":null},{"paper":"/paper/eegnn-edge-enhanced-graph-neural-networks","slug":"eegnn-edge-enhanced-graph-neural-networks","title":"EEGNN: Edge Enhanced Graph Neural Network with a Bayesian Nonparametric Graph Model","date":"2022-08-12","arxiv_id":"2208.06322","n_code_links":1,"syntology":null},{"paper":null,"slug":"gsim-a-graph-neural-network-based-relevance","title":"GSim: A Graph Neural Network based Relevance Measure for Heterogeneous Graphs","date":"2022-08-12","arxiv_id":"2208.06144","n_code_links":0,"syntology":null},{"paper":"/paper/partition-pooling-for-convolutional-graph","slug":"partition-pooling-for-convolutional-graph","title":"Partition Pooling for Convolutional Graph Network Applications in Particle Physics","date":"2022-08-11","arxiv_id":"2208.05952","n_code_links":1,"syntology":null},{"paper":null,"slug":"task-aligned-meta-learning-based-augmented","title":"Task Aligned Meta-learning based Augmented Graph for Cold-Start Recommendation","date":"2022-08-11","arxiv_id":"2208.05716","n_code_links":0,"syntology":null},{"paper":"/paper/uncertainty-quantification-of-sparse-travel","slug":"uncertainty-quantification-of-sparse-travel","title":"Uncertainty Quantification of Sparse Travel Demand Prediction with Spatial-Temporal Graph Neural Networks","date":"2022-08-11","arxiv_id":"2208.05908","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["zhuangdingyi/stzinb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"sequence-feature-extraction-for-malware","title":"Sequence Feature Extraction for Malware Family Analysis via Graph Neural Network","date":"2022-08-10","arxiv_id":"2208.05476","n_code_links":0,"syntology":null},{"paper":null,"slug":"phygnnet-solving-spatiotemporal-pdes-with","title":"PhyGNNet: Solving spatiotemporal PDEs with Physics-informed Graph Neural Network","date":"2022-08-07","arxiv_id":"2208.04319","n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerating-discrete-dislocation-dynamics","title":"Accelerating discrete dislocation dynamics simulations with graph neural networks","date":"2022-08-05","arxiv_id":"2208.03296","n_code_links":0,"syntology":null},{"paper":"/paper/semantic-interleaving-global-channel","slug":"semantic-interleaving-global-channel","title":"Semantic Interleaving Global Channel Attention for Multilabel Remote Sensing Image Classification","date":"2022-08-04","arxiv_id":"2208.02613","n_code_links":1,"syntology":null},{"paper":"/paper/grown-up-a-graph-representation-of-a-webpage","slug":"grown-up-a-graph-representation-of-a-webpage","title":"GROWN+UP: A Graph Representation Of a Webpage Network Utilizing Pre-training","date":"2022-08-03","arxiv_id":"2208.02252","n_code_links":1,"syntology":null},{"paper":null,"slug":"polarmot-how-far-can-geometric-relations-take","title":"PolarMOT: How Far Can Geometric Relations Take Us in 3D Multi-Object Tracking?","date":"2022-08-03","arxiv_id":"2208.01957","n_code_links":0,"syntology":null},{"paper":"/paper/adapting-triplet-importance-of-implicit","slug":"adapting-triplet-importance-of-implicit","title":"Adapting Triplet Importance of Implicit Feedback for Personalized Recommendation","date":"2022-08-02","arxiv_id":"2208.01709","n_code_links":1,"syntology":null},{"paper":null,"slug":"dress-well-via-fashion-cognitive-learning","title":"Dress Well via Fashion Cognitive Learning","date":"2022-08-01","arxiv_id":"2208.00639","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-navigate-using-visual-sensor","title":"See What the Robot Can't See: Learning Cooperative Perception for Visual Navigation","date":"2022-08-01","arxiv_id":"2208.00759","n_code_links":0,"syntology":null},{"paper":null,"slug":"face-to-face-contrastive-learning-for-social","title":"Face-to-Face Contrastive Learning for Social Intelligence Question-Answering","date":"2022-07-29","arxiv_id":"2208.01036","n_code_links":0,"syntology":null},{"paper":"/paper/graph-neural-networks-for-channel-decoding","slug":"graph-neural-networks-for-channel-decoding","title":"Graph Neural Networks for Channel Decoding","date":"2022-07-29","arxiv_id":"2207.14742","n_code_links":2,"syntology":null},{"paper":null,"slug":"using-graph-neural-networks-for-program","title":"Using Graph Neural Networks for Program Termination","date":"2022-07-28","arxiv_id":"2207.14648","n_code_links":0,"syntology":null},{"paper":"/paper/factorial-user-modeling-with-hierarchical","slug":"factorial-user-modeling-with-hierarchical","title":"Factorial User Modeling with Hierarchical Graph Neural Network for Enhanced Sequential Recommendation","date":"2022-07-27","arxiv_id":"2207.13262","n_code_links":1,"syntology":null},{"paper":null,"slug":"gaia-graph-neural-network-with-temporal-shift","title":"Gaia: Graph Neural Network with Temporal Shift aware Attention for Gross Merchandise Value Forecast in E-commerce","date":"2022-07-27","arxiv_id":"2207.13329","n_code_links":0,"syntology":null},{"paper":"/paper/learned-label-aggregation-for-weak","slug":"learned-label-aggregation-for-weak","title":"Learning Hyper Label Model for Programmatic Weak Supervision","date":"2022-07-27","arxiv_id":"2207.13545","n_code_links":1,"syntology":{"ran":6,"of":14,"n_ran_checked":4,"n_instrument":2,"unverified":8,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","official":{"repos":["wurenzhi/hyper_label_model"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":8,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"modelling-social-context-for-fake-news","title":"Modelling Social Context for Fake News Detection: A Graph Neural Network Based Approach","date":"2022-07-27","arxiv_id":"2207.13500","n_code_links":0,"syntology":null},{"paper":null,"slug":"unsupervised-training-for-neural-tsp-solver","title":"Unsupervised Training for Neural TSP Solver","date":"2022-07-27","arxiv_id":"2207.13667","n_code_links":0,"syntology":null},{"paper":"/paper/sgat-simplicial-graph-attention-network","slug":"sgat-simplicial-graph-attention-network","title":"SGAT: Simplicial Graph Attention Network","date":"2022-07-24","arxiv_id":"2207.11761","n_code_links":1,"syntology":null},{"paper":"/paper/distributed-nonlinear-state-estimation-in","slug":"distributed-nonlinear-state-estimation-in","title":"Distributed Nonlinear State Estimation in Electric Power Systems using Graph Neural Networks","date":"2022-07-23","arxiv_id":"2207.11465","n_code_links":1,"syntology":null},{"paper":null,"slug":"multi-modal-retinal-image-registration-using","title":"Multi-modal Retinal Image Registration Using a Keypoint-Based Vessel Structure Aligning Network","date":"2022-07-21","arxiv_id":"2207.10506","n_code_links":0,"syntology":null},{"paper":"/paper/beyond-homophily-structure-aware-path","slug":"beyond-homophily-structure-aware-path","title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","date":"2022-07-20","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"neuralneb-neural-networks-can-find-reaction","title":"NeuralNEB -- Neural Networks can find Reaction Paths Fast","date":"2022-07-20","arxiv_id":"2207.09971","n_code_links":0,"syntology":null},{"paper":"/paper/posernet-refining-relative-camera-poses","slug":"posernet-refining-relative-camera-poses","title":"PoserNet: Refining Relative Camera Poses Exploiting Object Detections","date":"2022-07-19","arxiv_id":"2207.09445","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["iit-pavis/posernet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"xg-bot-an-explainable-deep-graph-neural","title":"XG-BoT: An Explainable Deep Graph Neural Network for Botnet Detection and Forensics","date":"2022-07-19","arxiv_id":"2207.09088","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-enhanced-graph-representation-for-machine","title":"An Enhanced Graph Representation for Machine Learning Based Automatic Intersection Management","date":"2022-07-18","arxiv_id":"2207.08655","n_code_links":0,"syntology":null},{"paper":null,"slug":"grabqc-graph-based-query-contextualization","title":"GrabQC: Graph based Query Contextualization for automated ICD coding","date":"2022-07-14","arxiv_id":"2207.06802","n_code_links":0,"syntology":null},{"paper":"/paper/graph-property-prediction-on-open-graph","slug":"graph-property-prediction-on-open-graph","title":"Graph Property Prediction on Open Graph Benchmark: A Winning Solution by Graph Neural Architecture Search","date":"2022-07-13","arxiv_id":"2207.06027","n_code_links":1,"syntology":null},{"paper":null,"slug":"neural-topological-ordering-for-computation","title":"Neural Topological Ordering for Computation Graphs","date":"2022-07-13","arxiv_id":"2207.05899","n_code_links":0,"syntology":null},{"paper":"/paper/qt-routenet-improved-gnn-generalization-to","slug":"qt-routenet-improved-gnn-generalization-to","title":"QT-Routenet: Improved GNN generalization to larger 5G networks by fine-tuning predictions from queueing theory","date":"2022-07-13","arxiv_id":"2207.06336","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-bipartite-graph-neural-network-approach-for","title":"A Bipartite Graph Neural Network Approach for Scalable Beamforming Optimization","date":"2022-07-12","arxiv_id":"2207.05364","n_code_links":0,"syntology":null},{"paper":null,"slug":"few-shot-semantic-relation-prediction-across","title":"Few-Shot Semantic Relation Prediction across Heterogeneous Graphs","date":"2022-07-11","arxiv_id":"2207.05068","n_code_links":0,"syntology":null},{"paper":null,"slug":"interference-limited-ultra-reliable-and-low","title":"Interference-Limited Ultra-Reliable and Low-Latency Communications: Graph Neural Networks or Stochastic Geometry?","date":"2022-07-11","arxiv_id":"2207.06918","n_code_links":0,"syntology":null},{"paper":"/paper/the-cosmic-graph-optimal-information","slug":"the-cosmic-graph-optimal-information","title":"The Cosmic Graph: Optimal Information Extraction from Large-Scale Structure using Catalogues","date":"2022-07-11","arxiv_id":"2207.05202","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["tlmakinen/cosmicgraphs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"signed-link-representation-in-continuous-time","title":"Representation Learning in Continuous-Time Dynamic Signed Networks","date":"2022-07-07","arxiv_id":"2207.03408","n_code_links":0,"syntology":null},{"paper":"/paper/simple-and-efficient-heterogeneous-graph","slug":"simple-and-efficient-heterogeneous-graph","title":"Simple and Efficient Heterogeneous Graph Neural Network","date":"2022-07-06","arxiv_id":"2207.02547","n_code_links":2,"syntology":null},{"paper":"/paper/state-augmented-learnable-algorithms-for","slug":"state-augmented-learnable-algorithms-for","title":"State-Augmented Learnable Algorithms for Resource Management in Wireless Networks","date":"2022-07-05","arxiv_id":"2207.02242","n_code_links":1,"syntology":null},{"paper":null,"slug":"nodetrans-a-graph-transfer-learning-approach","title":"NodeTrans: A Graph Transfer Learning Approach for Traffic Prediction","date":"2022-07-04","arxiv_id":"2207.01301","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-neural-prediction-based-acceleration","title":"The Neural-Prediction based Acceleration Algorithm of Column Generation for Graph-Based Set Covering Problems","date":"2022-07-04","arxiv_id":"2207.01411","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-graph-isomorphism-network-with-weighted","title":"A Graph Isomorphism Network with Weighted Multiple Aggregators for Speech Emotion Recognition","date":"2022-07-03","arxiv_id":"2207.00940","n_code_links":0,"syntology":null},{"paper":null,"slug":"tree-constrained-pointer-generator-with-graph","title":"Tree-constrained Pointer Generator with Graph Neural Network Encodings for Contextual Speech Recognition","date":"2022-07-02","arxiv_id":"2207.00857","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-class-alignment-method-based-on-graph","title":"A class alignment method based on graph convolution neural network for bearing fault diagnosis in presence of missing data and changing working conditions","date":"2022-07-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/cross-document-misinformation-detection-based-1","slug":"cross-document-misinformation-detection-based-1","title":"Cross-document Misinformation Detection based on Event Graph Reasoning","date":"2022-07-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"detecting-suicidality-with-a-contextual-graph","title":"Detecting Suicidality with a Contextual Graph Neural Network","date":"2022-07-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/great-truths-are-always-simple-a-rather-2","slug":"great-truths-are-always-simple-a-rather-2","title":"Great~Truths~are ~Always ~Simple: A Rather Simple Knowledge Encoder for Enhancing the Commonsense Reasoning Capacity of Pre-Trained Models","date":"2022-07-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/static-and-dynamic-speaker-modeling-based-on","slug":"static-and-dynamic-speaker-modeling-based-on","title":"Static and Dynamic Speaker Modeling based on Graph Neural Network for Emotion Recognition in Conversation","date":"2022-07-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/trajectory-forecasting-on-temporal-graphs","slug":"trajectory-forecasting-on-temporal-graphs","title":"Trajectory Forecasting on Temporal Graphs","date":"2022-07-01","arxiv_id":"2207.00255","n_code_links":1,"syntology":null},{"paper":"/paper/transforming-pagerank-into-an-infinite-depth","slug":"transforming-pagerank-into-an-infinite-depth","title":"Transforming PageRank into an Infinite-Depth Graph Neural Network","date":"2022-07-01","arxiv_id":"2207.00684","n_code_links":1,"syntology":null},{"paper":null,"slug":"modeling-teams-performance-using-deep","title":"Modeling Teams Performance Using Deep Representational Learning on Graphs","date":"2022-06-29","arxiv_id":"2206.14741","n_code_links":0,"syntology":null},{"paper":"/paper/spherical-channels-for-modeling-atomic","slug":"spherical-channels-for-modeling-atomic","title":"Spherical Channels for Modeling Atomic Interactions","date":"2022-06-29","arxiv_id":"2206.14331","n_code_links":2,"syntology":null},{"paper":"/paper/3d-multi-object-tracking-with-differentiable","slug":"3d-multi-object-tracking-with-differentiable","title":"3D Multi-Object Tracking with Differentiable Pose Estimation","date":"2022-06-28","arxiv_id":"2206.13785","n_code_links":0,"syntology":null},{"paper":"/paper/learning-the-evolutionary-and-multi-scale","slug":"learning-the-evolutionary-and-multi-scale","title":"Learning the Evolutionary and Multi-scale Graph Structure for Multivariate Time Series Forecasting","date":"2022-06-28","arxiv_id":"2206.13816","n_code_links":1,"syntology":null},{"paper":null,"slug":"raw-gnn-random-walk-aggregation-based-graph","title":"RAW-GNN: RAndom Walk Aggregation based Graph Neural Network","date":"2022-06-28","arxiv_id":"2206.13953","n_code_links":0,"syntology":null},{"paper":"/paper/automatic-identification-of-segmentation","slug":"automatic-identification-of-segmentation","title":"Automatic identification of segmentation errors for radiotherapy using geometric learning","date":"2022-06-27","arxiv_id":"2206.13317","n_code_links":1,"syntology":null},{"paper":"/paper/cracking-nuts-with-a-sledgehammer-when-modern","slug":"cracking-nuts-with-a-sledgehammer-when-modern","title":"Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set","date":"2022-06-27","arxiv_id":"2206.13211","n_code_links":1,"syntology":null},{"paper":null,"slug":"destripe-a-self2self-spatio-spectral-graph","title":"DeStripe: A Self2Self Spatio-Spectral Graph Neural Network with Unfolded Hessian for Stripe Artifact Removal in Light-sheet Microscopy","date":"2022-06-27","arxiv_id":"2206.13419","n_code_links":0,"syntology":null},{"paper":"/paper/learning-to-control-local-search-for","slug":"learning-to-control-local-search-for","title":"Learning to Control Local Search for Combinatorial Optimization","date":"2022-06-27","arxiv_id":"2206.13181","n_code_links":1,"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":["jokofa/neurols"],"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":null,"slug":"reduced-optimal-power-flow-using-graph-neural","title":"Reduced Optimal Power Flow Using Graph Neural Network","date":"2022-06-27","arxiv_id":"2206.13591","n_code_links":0,"syntology":null},{"paper":null,"slug":"edge-direction-invariant-graph-neural","title":"Edge Direction-invariant Graph Neural Networks for Molecular Dipole Moments Prediction","date":"2022-06-26","arxiv_id":"2206.12867","n_code_links":0,"syntology":null},{"paper":"/paper/image-aesthetics-assessment-using-graph","slug":"image-aesthetics-assessment-using-graph","title":"Image Aesthetics Assessment Using Graph Attention Network","date":"2022-06-26","arxiv_id":"2206.12869","n_code_links":1,"syntology":null},{"paper":"/paper/equiformer-equivariant-graph-attention","slug":"equiformer-equivariant-graph-attention","title":"Equiformer: Equivariant Graph Attention Transformer for 3D Atomistic Graphs","date":"2022-06-23","arxiv_id":"2206.11990","n_code_links":4,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["atomicarchitects/equiformer"],"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":["listed","official"]}}},{"paper":"/paper/retrograph-retrosynthetic-planning-with-graph","slug":"retrograph-retrosynthetic-planning-with-graph","title":"RetroGraph: Retrosynthetic Planning with Graph Search","date":"2022-06-23","arxiv_id":"2206.11477","n_code_links":1,"syntology":null},{"paper":null,"slug":"similarity-aware-positive-instance-sampling-1","title":"Similarity-aware Positive Instance Sampling for Graph Contrastive Pre-training","date":"2022-06-23","arxiv_id":"2206.11959","n_code_links":0,"syntology":null},{"paper":"/paper/agent-based-graph-neural-networks","slug":"agent-based-graph-neural-networks","title":"Agent-based Graph Neural Networks","date":"2022-06-22","arxiv_id":"2206.11010","n_code_links":1,"syntology":{"ran":4,"of":7,"n_ran_checked":4,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["karolismart/agentnet"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"heterogeneous-graph-neural-networks-for-4","title":"Heterogeneous Graph Neural Networks for Software Effort Estimation","date":"2022-06-22","arxiv_id":"2206.11023","n_code_links":0,"syntology":null},{"paper":null,"slug":"finding-diverse-and-predictable-subgraphs-for","title":"Finding Diverse and Predictable Subgraphs for Graph Domain Generalization","date":"2022-06-19","arxiv_id":"2206.09345","n_code_links":0,"syntology":null},{"paper":"/paper/graph-neural-network-aided-mu-mimo-detectors","slug":"graph-neural-network-aided-mu-mimo-detectors","title":"Graph Neural Network Aided MU-MIMO Detectors","date":"2022-06-19","arxiv_id":"2206.09381","n_code_links":1,"syntology":null},{"paper":"/paper/decoupled-dynamic-spatial-temporal-graph","slug":"decoupled-dynamic-spatial-temporal-graph","title":"Decoupled Dynamic Spatial-Temporal Graph Neural Network for Traffic Forecasting","date":"2022-06-18","arxiv_id":"2206.09112","n_code_links":1,"syntology":null},{"paper":"/paper/nas-bench-graph-benchmarking-graph-neural","slug":"nas-bench-graph-benchmarking-graph-neural","title":"NAS-Bench-Graph: Benchmarking Graph Neural Architecture Search","date":"2022-06-18","arxiv_id":"2206.09166","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["thumnlab/nas-bench-graph"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/comenet-towards-complete-and-efficient","slug":"comenet-towards-complete-and-efficient","title":"ComENet: Towards Complete and Efficient Message Passing for 3D Molecular Graphs","date":"2022-06-17","arxiv_id":"2206.08515","n_code_links":1,"syntology":null}],"record_sha256":"16b240379c81fb2ddacfac1cf332cc554e78c5d898ab296a5b5771dfd052eaae","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}