{"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/gat","slug":"gat","name":"GAT","full_name":"Graph Attention Network","full_name_withheld":false,"description_markdown":"A **Graph Attention Network (GAT)** is a neural network architecture that operates on graph-structured data, leveraging masked self-attentional layers to address the shortcomings of prior methods based on graph convolutions or their approximations. By stacking layers in which nodes are able to attend over their neighborhoods’ features, a GAT enables (implicitly) specifying different weights to different nodes in a neighborhood, without requiring any kind of costly matrix operation (such as inversion) or depending on knowing the graph structure upfront.\r\n\r\nSee [here](https://docs.dgl.ai/en/0.4.x/tutorials/models/1_gnn/9_gat.html) for an explanation by DGL.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Graph Attention Networks","paper":"/paper/graph-attention-networks","first_author":"Petar Veličković","n_authors":6,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/graph-attention-networks"},"source":{"url":"http://arxiv.org/abs/1710.10903v3","title":"Graph Attention Networks","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Models","url":"/methods/category/graph-models","pwc_aliases":[]}],"n_papers_tagged":197,"archive_num_papers":197,"papers_newest_first":[{"paper":null,"slug":"temporal-aware-graph-attention-network-for","title":"Temporal-Aware Graph Attention Network for Cryptocurrency Transaction Fraud Detection","date":"2025-06-26","arxiv_id":"2506.21382","n_code_links":0,"syntology":null},{"paper":null,"slug":"evaluating-loss-functions-for-graph-neural","title":"Evaluating Loss Functions for Graph Neural Networks: Towards Pretraining and Generalization","date":"2025-06-17","arxiv_id":"2506.14114","n_code_links":0,"syntology":null},{"paper":null,"slug":"beyond-attention-learning-spatio-temporal","title":"Beyond Attention: Learning Spatio-Temporal Dynamics with Emergent Interpretable Topologies","date":"2025-06-01","arxiv_id":"2506.00770","n_code_links":0,"syntology":null},{"paper":"/paper/2505-10711","slug":"2505-10711","title":"GNN-Suite: a Graph Neural Network Benchmarking Framework for Biomedical Informatics","date":"2025-05-15","arxiv_id":"2505.10711","n_code_links":1,"syntology":null},{"paper":null,"slug":"event-triggered-gat-lstm-framework-for-attack","title":"Event-Triggered GAT-LSTM Framework for Attack Detection in Heating, Ventilation, and Air Conditioning Systems","date":"2025-05-06","arxiv_id":"2505.03559","n_code_links":0,"syntology":null},{"paper":null,"slug":"robustness-questions-the-interpretability-of","title":"Robustness questions the interpretability of graph neural networks: what to do?","date":"2025-05-05","arxiv_id":"2505.02566","n_code_links":0,"syntology":null},{"paper":null,"slug":"detecting-credit-card-fraud-via-heterogeneous","title":"Detecting Credit Card Fraud via Heterogeneous Graph Neural Networks with Graph Attention","date":"2025-04-11","arxiv_id":"2504.08183","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-power-flow-analysis-and-fault","title":"Dynamic Power Flow Analysis and Fault Characteristics: A Graph Attention Neural Network","date":"2025-03-19","arxiv_id":"2503.15563","n_code_links":0,"syntology":null},{"paper":null,"slug":"lyapunov-based-graph-neural-networks-for","title":"Lyapunov-Based Graph Neural Networks for Adaptive Control of Multi-Agent Systems","date":"2025-03-19","arxiv_id":"2503.15360","n_code_links":0,"syntology":null},{"paper":null,"slug":"fault-localization-and-state-estimation-of","title":"Fault Localization and State Estimation of Power Grid under Parallel Cyber-Physical Attacks","date":"2025-03-03","arxiv_id":"2503.05797","n_code_links":0,"syntology":null},{"paper":null,"slug":"feature-based-graph-attention-networks","title":"Feature-based Graph Attention Networks Improve Online Continual Learning","date":"2025-02-13","arxiv_id":"2502.09143","n_code_links":0,"syntology":null},{"paper":"/paper/bridging-traffic-state-and-trajectory-for","slug":"bridging-traffic-state-and-trajectory-for","title":"Bridging Traffic State and Trajectory for Dynamic Road Network and Trajectory Representation Learning","date":"2025-02-08","arxiv_id":"2502.06870","n_code_links":1,"syntology":null},{"paper":null,"slug":"graph-neural-network-enabled-pinching","title":"Graph Neural Network Enabled Pinching Antennas","date":"2025-02-08","arxiv_id":"2502.05447","n_code_links":0,"syntology":null},{"paper":"/paper/graph-neural-networks-for-efficient-ac-power","slug":"graph-neural-networks-for-efficient-ac-power","title":"Graph Neural Networks for Efficient AC Power Flow Prediction in Power Grids","date":"2025-02-08","arxiv_id":"2502.05702","n_code_links":1,"syntology":null},{"paper":"/paper/generative-autoregressive-transformers-for","slug":"generative-autoregressive-transformers-for","title":"Generative Autoregressive Transformers for Model-Agnostic Federated MRI Reconstruction","date":"2025-02-06","arxiv_id":"2502.04521","n_code_links":1,"syntology":null},{"paper":"/paper/graph-machine-learning-for-flight-delay","slug":"graph-machine-learning-for-flight-delay","title":"Graph machine learning for flight delay prediction due to holding manouver","date":"2025-02-06","arxiv_id":"2502.04233","n_code_links":1,"syntology":null},{"paper":null,"slug":"utilizing-graph-neural-networks-for-effective","title":"Utilizing Graph Neural Networks for Effective Link Prediction in Microservice Architectures","date":"2025-01-25","arxiv_id":"2501.15019","n_code_links":0,"syntology":null},{"paper":"/paper/an-attentive-graph-agent-for-topology","slug":"an-attentive-graph-agent-for-topology","title":"An Attentive Graph Agent for Topology-Adaptive Cyber Defence","date":"2025-01-24","arxiv_id":"2501.14700","n_code_links":1,"syntology":null},{"paper":null,"slug":"multivariate-wireless-link-quality-prediction","title":"Multivariate Wireless Link Quality Prediction Based on Pre-trained Large Language Models","date":"2025-01-20","arxiv_id":"2501.11247","n_code_links":0,"syntology":null},{"paper":null,"slug":"detection-retrieval-and-explanation-unified-a","title":"Detection, Retrieval, and Explanation Unified: A Violence Detection System Based on Knowledge Graphs and GAT","date":"2025-01-07","arxiv_id":"2501.06224","n_code_links":0,"syntology":null},{"paper":"/paper/dual-level-adaptive-incongruity-enhanced","slug":"dual-level-adaptive-incongruity-enhanced","title":"Dual-level Adaptive Incongruity-enhanced Model for Multimodal Sarcasm Detection","date":"2025-01-07","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"gais-a-novel-approach-to-instance-selection","title":"GAIS: A Novel Approach to Instance Selection with Graph Attention Networks","date":"2024-12-26","arxiv_id":"2412.19201","n_code_links":0,"syntology":null},{"paper":"/paper/lase-learned-adjacency-spectral-embeddings","slug":"lase-learned-adjacency-spectral-embeddings","title":"LASE: Learned Adjacency Spectral Embeddings","date":"2024-12-23","arxiv_id":"2412.17734","n_code_links":1,"syntology":null},{"paper":null,"slug":"fedgat-a-privacy-preserving-federated","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","date":"2024-12-20","arxiv_id":"2412.16144","n_code_links":0,"syntology":null},{"paper":null,"slug":"boosting-gnn-performance-via-training-sample","title":"Training Graph Neural Networks Using Non-Robust Samples","date":"2024-12-19","arxiv_id":"2412.14738","n_code_links":0,"syntology":null},{"paper":null,"slug":"grimm-a-plug-and-play-perturbation-rectifier","title":"Grimm: A Plug-and-Play Perturbation Rectifier for Graph Neural Networks Defending against Poisoning Attacks","date":"2024-12-11","arxiv_id":"2412.08555","n_code_links":0,"syntology":null},{"paper":null,"slug":"merlin-multi-stage-query-performance","title":"CONCERTO: Complex Query Execution Mechanism-Aware Learned Cost Estimation","date":"2024-12-01","arxiv_id":"2412.00749","n_code_links":0,"syntology":null},{"paper":"/paper/locate-gat-modeling-multi-scale-local-context","slug":"locate-gat-modeling-multi-scale-local-context","title":"LoCATe-GAT: Modeling Multi-Scale Local Context and Action Relationships for Zero-Shot Action Recognition","date":"2024-11-27","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/df-gnn-dynamic-fusion-framework-for-attention","slug":"df-gnn-dynamic-fusion-framework-for-attention","title":"DF-GNN: Dynamic Fusion Framework for Attention Graph Neural Networks on GPUs","date":"2024-11-25","arxiv_id":"2411.16127","n_code_links":1,"syntology":null},{"paper":"/paper/graph-neural-networks-in-supply-chain","slug":"graph-neural-networks-in-supply-chain","title":"Graph Neural Networks in Supply Chain Analytics and Optimization: Concepts, Perspectives, Dataset and Benchmarks","date":"2024-11-13","arxiv_id":"2411.08550","n_code_links":3,"syntology":null},{"paper":null,"slug":"using-half-precision-for-gnn-training","title":"Using Half-Precision for GNN Training","date":"2024-11-02","arxiv_id":"2411.01109","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-graph-neural-networks-for-enhanced","title":"Dynamic graph neural networks for enhanced volatility prediction in financial markets","date":"2024-10-22","arxiv_id":"2410.16858","n_code_links":0,"syntology":null},{"paper":"/paper/deep-graph-attention-networks","slug":"deep-graph-attention-networks","title":"Deep Graph Attention Networks","date":"2024-10-21","arxiv_id":"2410.15640","n_code_links":1,"syntology":null},{"paper":null,"slug":"spatial-temporal-bearing-fault-detection","title":"Spatial-Temporal Bearing Fault Detection Using Graph Attention Networks and LSTM","date":"2024-10-15","arxiv_id":"2410.11923","n_code_links":0,"syntology":null},{"paper":null,"slug":"dual-stream-graph-transformer-fusion-networks","title":"Dual Stream Graph Transformer Fusion Networks for Enhanced Brain Decoding","date":"2024-09-23","arxiv_id":"2410.07189","n_code_links":0,"syntology":null},{"paper":null,"slug":"gather-graph-attention-based-predictions-of","title":"GATher: Graph Attention Based Predictions of Gene-Disease Links","date":"2024-09-23","arxiv_id":"2409.16327","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-network-models-to-detect-illicit","title":"Graph Network Models To Detect Illicit Transactions In Block Chain","date":"2024-09-23","arxiv_id":"2410.07150","n_code_links":0,"syntology":null},{"paper":"/paper/detecting-homeomorphic-3-manifolds-via-graph","slug":"detecting-homeomorphic-3-manifolds-via-graph","title":"Detecting Homeomorphic 3-manifolds via Graph Neural Networks","date":"2024-09-01","arxiv_id":"2409.02126","n_code_links":1,"syntology":null},{"paper":null,"slug":"applying-graph-neural-network-to-supplygraph","title":"Applying graph neural network to SupplyGraph for supply chain network","date":"2024-08-23","arxiv_id":"2408.14501","n_code_links":0,"syntology":null},{"paper":"/paper/multivariate-time-series-anomaly-detection-5","slug":"multivariate-time-series-anomaly-detection-5","title":"Multivariate Time-Series Anomaly Detection based on Enhancing Graph Attention Networks with Topological Analysis","date":"2024-08-23","arxiv_id":"2408.13082","n_code_links":1,"syntology":{"ran":8,"of":12,"n_ran_checked":3,"n_instrument":5,"unverified":4,"pointer_only":12,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","official":{"repos":["ljj-cyber/topogdn"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/quantum-inverse-contextual-vision","slug":"quantum-inverse-contextual-vision","title":"Quantum Inverse Contextual Vision Transformers (Q-ICVT): A New Frontier in 3D Object Detection for AVs","date":"2024-08-20","arxiv_id":"2408.11207","n_code_links":1,"syntology":null},{"paper":"/paper/graph-neural-network-surrogate-for-strategic","slug":"graph-neural-network-surrogate-for-strategic","title":"Graph neural network surrogate for strategic transport planning","date":"2024-08-14","arxiv_id":"2408.07726","n_code_links":1,"syntology":null},{"paper":null,"slug":"large-scale-time-varying-portfolio","title":"Large-scale Time-Varying Portfolio Optimisation using Graph Attention Networks","date":"2024-07-22","arxiv_id":"2407.15532","n_code_links":0,"syntology":null},{"paper":null,"slug":"elcorec-enhance-language-understanding-with","title":"ELCoRec: Enhance Language Understanding with Co-Propagation of Numerical and Categorical Features for Recommendation","date":"2024-06-27","arxiv_id":"2406.18825","n_code_links":0,"syntology":null},{"paper":"/paper/enhancing-cross-document-event-coreference","slug":"enhancing-cross-document-event-coreference","title":"Enhancing Cross-Document Event Coreference Resolution by Discourse Structure and Semantic Information","date":"2024-06-23","arxiv_id":"2406.15990","n_code_links":1,"syntology":null},{"paper":"/paper/classic-gnns-are-strong-baselines-reassessing","slug":"classic-gnns-are-strong-baselines-reassessing","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","date":"2024-06-13","arxiv_id":"2406.08993","n_code_links":1,"syntology":{"ran":5,"of":9,"n_ran_checked":3,"n_instrument":2,"unverified":4,"pointer_only":3,"phrase":"5 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; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["LUOyk1999/tunedGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/duplex-dual-gat-for-complex-embedding-of","slug":"duplex-dual-gat-for-complex-embedding-of","title":"DUPLEX: Dual GAT for Complex Embedding of Directed Graphs","date":"2024-06-08","arxiv_id":"2406.05391","n_code_links":1,"syntology":{"ran":8,"of":8,"n_ran_checked":5,"n_instrument":3,"unverified":0,"pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["alipay/duplex"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/learning-divergence-fields-for-shift-robust","slug":"learning-divergence-fields-for-shift-robust","title":"Learning Divergence Fields for Shift-Robust Graph Representations","date":"2024-06-07","arxiv_id":"2406.04963","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":5,"n_instrument":0,"unverified":3,"pointer_only":8,"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) · 3 unverified","official":{"repos":["fannie1208/glind"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/revisiting-attention-weights-as","slug":"revisiting-attention-weights-as","title":"Faithful and Accurate Self-Attention Attribution for Message Passing Neural Networks via the Computation Tree Viewpoint","date":"2024-06-07","arxiv_id":"2406.04612","n_code_links":1,"syntology":null},{"paper":"/paper/gate-how-to-keep-out-intrusive-neighbors","slug":"gate-how-to-keep-out-intrusive-neighbors","title":"GATE: How to Keep Out Intrusive Neighbors","date":"2024-06-01","arxiv_id":"2406.00418","n_code_links":1,"syntology":{"ran":6,"of":8,"n_ran_checked":3,"n_instrument":3,"unverified":2,"pointer_only":8,"phrase":"6 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; 3 where Syntology's instrument failed) · 2 unverified","official":{"repos":["relationalml/gate"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/graphany-a-foundation-model-for-node","slug":"graphany-a-foundation-model-for-node","title":"Fully-inductive Node Classification on Arbitrary Graphs","date":"2024-05-30","arxiv_id":"2405.20445","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":3,"n_instrument":2,"unverified":3,"pointer_only":0,"phrase":"5 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; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["deepgraphlearning/graphany"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/network-analytics-for-anti-money-laundering-a","slug":"network-analytics-for-anti-money-laundering-a","title":"Network Analytics for Anti-Money Laundering -- A Systematic Literature Review and Experimental Evaluation","date":"2024-05-29","arxiv_id":"2405.19383","n_code_links":1,"syntology":null},{"paper":null,"slug":"fighter-flight-trajectory-prediction-based-on","title":"Fighter flight trajectory prediction based on spatio-temporal graphcial attention network","date":"2024-05-13","arxiv_id":"2405.08034","n_code_links":0,"syntology":null},{"paper":null,"slug":"spectral-brain-graph-neural-network-for","title":"Spectral Brain Graph Neural Network for Prediction of Anxiety in Children with Autism Spectrum Disorder","date":"2024-04-23","arxiv_id":"2407.00008","n_code_links":0,"syntology":null},{"paper":"/paper/radiogat-a-joint-model-based-and-data-driven","slug":"radiogat-a-joint-model-based-and-data-driven","title":"RadioGAT: A Joint Model-based and Data-driven Framework for Multi-band Radiomap Reconstruction via Graph Attention Networks","date":"2024-03-25","arxiv_id":"2403.16397","n_code_links":1,"syntology":null},{"paper":null,"slug":"representation-learning-on-heterophilic-graph","title":"Representation Learning on Heterophilic Graph with Directional Neighborhood Attention","date":"2024-03-03","arxiv_id":"2403.01475","n_code_links":0,"syntology":null},{"paper":null,"slug":"attention-based-shape-and-gait","title":"Attention-based Shape and Gait Representations Learning for Video-based Cloth-Changing Person Re-Identification","date":"2024-02-06","arxiv_id":"2402.03716","n_code_links":0,"syntology":null},{"paper":null,"slug":"attention-based-dynamic-multilayer-graph","title":"Attention-based Dynamic Multilayer Graph Neural Networks for Loan Default Prediction","date":"2024-02-01","arxiv_id":"2402.00299","n_code_links":0,"syntology":null},{"paper":"/paper/gd-caf-graph-dual-stream-convolutional","slug":"gd-caf-graph-dual-stream-convolutional","title":"Graph Dual-stream Convolutional Attention Fusion for Precipitation Nowcasting","date":"2024-01-15","arxiv_id":"2401.07958","n_code_links":1,"syntology":null},{"paper":null,"slug":"masked-autoencoder-for-graph-clustering","title":"Masked AutoEncoder for Graph Clustering without Pre-defined Cluster Number k","date":"2024-01-09","arxiv_id":"2401.04741","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-community-detection-and-graph-neural","title":"A Community Detection and Graph Neural Network Based Link Prediction Approach for Scientific Literature","date":"2024-01-04","arxiv_id":"2401.02542","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-multi-graph-neural-network-for","title":"Dynamic multi-graph neural network for traffic flow prediction incorporating traffic accidents","date":"2023-12-30","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"blood-glucose-level-prediction-a-graph-based","title":"Blood Glucose Level Prediction: A Graph-based Explainable Method with Federated Learning","date":"2023-12-19","arxiv_id":"2312.12541","n_code_links":0,"syntology":null},{"paper":"/paper/cat-a-causally-graph-attention-network-for","slug":"cat-a-causally-graph-attention-network-for","title":"CAT: A Causally Graph Attention Network for Trimming Heterophilic Graph","date":"2023-12-14","arxiv_id":"2312.08672","n_code_links":1,"syntology":null},{"paper":null,"slug":"trends-in-temperature-data-micro-foundations","title":"Trends in Temperature Data: Micro-foundations of Their Nature","date":"2023-12-11","arxiv_id":"2312.06379","n_code_links":0,"syntology":null},{"paper":null,"slug":"analysis-of-information-propagation-in","title":"Analysis of Information Propagation in Ethereum Network Using Combined Graph Attention Network and Reinforcement Learning to Optimize Network Efficiency and Scalability","date":"2023-11-02","arxiv_id":"2311.01406","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-causal-disentangled-multi-granularity-graph","title":"A Causal Disentangled Multi-Granularity Graph Classification Method","date":"2023-10-25","arxiv_id":"2310.16256","n_code_links":0,"syntology":null},{"paper":null,"slug":"sga-a-graph-augmentation-method-for-signed","title":"SGA: A Graph Augmentation Method for Signed Graph Neural Networks","date":"2023-10-15","arxiv_id":"2310.09705","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-neural-network-approaches-for-single","title":"Graph Neural Network approaches for single-cell data: A recent overview","date":"2023-10-14","arxiv_id":"2310.09561","n_code_links":0,"syntology":null},{"paper":null,"slug":"are-gats-out-of-balance","title":"Are GATs Out of Balance?","date":"2023-10-11","arxiv_id":"2310.07235","n_code_links":0,"syntology":null},{"paper":null,"slug":"global-minima-recoverability-thresholds-and","title":"Global Minima, Recoverability Thresholds, and Higher-Order Structure in GNNS","date":"2023-10-11","arxiv_id":"2310.07667","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-hierarchical-graph-based-approach-for","title":"A Hierarchical Graph-based Approach for Recognition and Description Generation of Bimanual Actions in Videos","date":"2023-10-01","arxiv_id":"2310.00670","n_code_links":0,"syntology":null},{"paper":null,"slug":"extracting-physical-causality-from","title":"Extracting Physical Causality from Measurements to Detect and Localize False Data Injection Attacks","date":"2023-09-21","arxiv_id":"2310.10666","n_code_links":0,"syntology":null},{"paper":null,"slug":"masked-feature-modelling-feature-masking-for","title":"Masked Feature Modelling: Feature Masking for the Unsupervised Pre-training of a Graph Attention Network Block for Bottom-up Video Event Recognition","date":"2023-08-24","arxiv_id":"2308.12673","n_code_links":0,"syntology":null},{"paper":null,"slug":"cached-operator-reordering-a-unified-view-for","title":"Cached Operator Reordering: A Unified View for Fast GNN Training","date":"2023-08-23","arxiv_id":"2308.12093","n_code_links":0,"syntology":null},{"paper":"/paper/pixel-wise-graph-attention-networks-for","slug":"pixel-wise-graph-attention-networks-for","title":"Pixel-wise Graph Attention Networks for Person Re-identification","date":"2023-07-18","arxiv_id":"2307.09183","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-prediction-of-peptide-self-assembly","slug":"efficient-prediction-of-peptide-self-assembly","title":"Efficient Prediction of Peptide Self-assembly through Sequential and Graphical Encoding","date":"2023-07-17","arxiv_id":"2307.09169","n_code_links":1,"syntology":null},{"paper":null,"slug":"supervised-attention-using-homophily-in-graph","title":"Supervised Attention Using Homophily in Graph Neural Networks","date":"2023-07-11","arxiv_id":"2307.05217","n_code_links":0,"syntology":null},{"paper":null,"slug":"ga-drl-graph-neural-network-augmented-deep","title":"GA-DRL: Graph Neural Network-Augmented Deep Reinforcement Learning for DAG Task Scheduling over Dynamic Vehicular Clouds","date":"2023-07-03","arxiv_id":"2307.00777","n_code_links":0,"syntology":null},{"paper":null,"slug":"higher-order-graph-attention-network-for","title":"Higher-order Graph Attention Network for Stock Selection with Joint Analysis","date":"2023-06-27","arxiv_id":"2306.15526","n_code_links":0,"syntology":null},{"paper":"/paper/the-split-matters-flat-minima-methods-for","slug":"the-split-matters-flat-minima-methods-for","title":"The Split Matters: Flat Minima Methods for Improving the Performance of GNNs","date":"2023-06-15","arxiv_id":"2306.09121","n_code_links":1,"syntology":null},{"paper":"/paper/optimization-and-interpretability-of-graph","slug":"optimization-and-interpretability-of-graph","title":"Optimization and Interpretability of Graph Attention Networks for Small Sparse Graph Structures in Automotive Applications","date":"2023-05-25","arxiv_id":"2305.16196","n_code_links":1,"syntology":null},{"paper":null,"slug":"gatology-for-linguistics-what-syntactic","title":"GATology for Linguistics: What Syntactic Dependencies It Knows","date":"2023-05-22","arxiv_id":"2305.13403","n_code_links":0,"syntology":null},{"paper":null,"slug":"syntactic-knowledge-via-graph-attention-with","title":"Syntactic Knowledge via Graph Attention with BERT in Machine Translation","date":"2023-05-22","arxiv_id":"2305.13413","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-short-term-wind-speed-forecasting","title":"Enhancing Short-Term Wind Speed Forecasting using Graph Attention and Frequency-Enhanced Mechanisms","date":"2023-05-19","arxiv_id":"2305.11526","n_code_links":0,"syntology":null},{"paper":"/paper/edge-directionality-improves-learning-on","slug":"edge-directionality-improves-learning-on","title":"Edge Directionality Improves Learning on Heterophilic Graphs","date":"2023-05-17","arxiv_id":"2305.10498","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":3,"n_instrument":1,"unverified":1,"pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["emalgorithm/directed-graph-neural-network"],"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":"/paper/sgaligner-3d-scene-alignment-with-scene","slug":"sgaligner-3d-scene-alignment-with-scene","title":"SGAligner : 3D Scene Alignment with Scene Graphs","date":"2023-04-28","arxiv_id":"2304.14880","n_code_links":1,"syntology":{"ran":7,"of":10,"n_ran_checked":7,"n_instrument":0,"unverified":3,"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) · 3 unverified","official":{"repos":["sayands/sgaligner"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"spatio-temporal-driven-attention-graph-neural","title":"Spatio-Temporal driven Attention Graph Neural Network with Block Adjacency matrix (STAG-NN-BA)","date":"2023-03-25","arxiv_id":"2303.14322","n_code_links":0,"syntology":null},{"paper":"/paper/gator-graph-aware-transformer-with-motion","slug":"gator-graph-aware-transformer-with-motion","title":"GATOR: Graph-Aware Transformer with Motion-Disentangled Regression for Human Mesh Recovery from a 2D Pose","date":"2023-03-10","arxiv_id":"2303.05652","n_code_links":1,"syntology":null},{"paper":null,"slug":"dedgat-dual-embedding-of-directed-graph","title":"DEDGAT: Dual Embedding of Directed Graph Attention Networks for Detecting Financial Risk","date":"2023-03-06","arxiv_id":"2303.03933","n_code_links":0,"syntology":null},{"paper":null,"slug":"heterogeneous-graph-convolutional-neural","title":"Heterogeneous Graph Convolutional Neural Network via Hodge-Laplacian for Brain Functional Data","date":"2023-02-18","arxiv_id":"2302.09323","n_code_links":0,"syntology":null},{"paper":"/paper/gat-guided-adversarial-training-with-pareto","slug":"gat-guided-adversarial-training-with-pareto","title":"GAT: Guided Adversarial Training with Pareto-optimal Auxiliary Tasks","date":"2023-02-06","arxiv_id":"2302.02907","n_code_links":1,"syntology":null},{"paper":"/paper/depgraph-towards-any-structural-pruning","slug":"depgraph-towards-any-structural-pruning","title":"DepGraph: Towards Any Structural Pruning","date":"2023-01-30","arxiv_id":"2301.12900","n_code_links":1,"syntology":{"ran":7,"of":7,"n_ran_checked":7,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["VainF/Torch-Pruning"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/graph-mixer-networks","slug":"graph-mixer-networks","title":"Graph Mixer Networks","date":"2023-01-29","arxiv_id":"2301.12493","n_code_links":1,"syntology":null},{"paper":null,"slug":"understanding-and-improving-deep-graph-neural","title":"Understanding and Improving Deep Graph Neural Networks: A Probabilistic Graphical Model Perspective","date":"2023-01-25","arxiv_id":"2301.10536","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-depth-graph-attention-networks","title":"Adaptive Depth Graph Attention Networks","date":"2023-01-16","arxiv_id":"2301.06265","n_code_links":0,"syntology":null},{"paper":"/paper/mgtab-a-multi-relational-graph-based-twitter","slug":"mgtab-a-multi-relational-graph-based-twitter","title":"MGTAB: A Multi-Relational Graph-Based Twitter Account Detection Benchmark","date":"2023-01-03","arxiv_id":"2301.01123","n_code_links":1,"syntology":null},{"paper":"/paper/meaformer-multi-modal-entity-alignment","slug":"meaformer-multi-modal-entity-alignment","title":"MEAformer: Multi-modal Entity Alignment Transformer for Meta Modality Hybrid","date":"2022-12-29","arxiv_id":"2212.14454","n_code_links":1,"syntology":{"ran":11,"of":13,"n_ran_checked":7,"n_instrument":4,"unverified":2,"pointer_only":3,"phrase":"11 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; 4 where Syntology's instrument failed) · 2 unverified","official":{"repos":["zjukg/MEAformer"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"every-node-counts-improving-the-training-of","title":"Every Node Counts: Improving the Training of Graph Neural Networks on Node Classification","date":"2022-11-29","arxiv_id":"2211.16631","n_code_links":0,"syntology":null},{"paper":"/paper/multi-mask-aggregators-for-graph-neural","slug":"multi-mask-aggregators-for-graph-neural","title":"Multi-Mask Aggregators for Graph Neural Networks","date":"2022-11-24","arxiv_id":null,"n_code_links":1,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":197,"with_a_code_link":90,"where_syntology_ran_a_sample":24,"not_listed_spam_title":0,"listed":197,"listed_where_code_ran":24,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":21,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":21,"listed_every_run_a_failure_of_syntologys_instrument":3,"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"},"papers_where_code_ran":24,"papers_where_code_ran_first_page":"/method/gat/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"archive","page":2,"of":2,"url":"/method/gat/papers/2","json":"/method/gat/papers/2.json","rows":97},{"order":"ran","page":1,"of":1,"url":"/method/gat/papers/ran/1","json":"/method/gat/papers/ran/1.json","rows":24}],"tasks":[{"task":"/task/graph-attention","name":"Graph Attention","papers":102},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":43},{"task":"/task/node-classification","name":"Node Classification","papers":35},{"task":"/task/link-prediction","name":"Link Prediction","papers":11},{"task":"/task/graph-learning","name":"Graph Learning","papers":9},{"task":"/task/representation-learning","name":"Representation Learning","papers":9},{"task":"/task/graph-classification","name":"Graph Classification","papers":8},{"task":"/task/knowledge-graphs","name":"Knowledge Graphs","papers":7},{"task":"/task/prediction","name":"Prediction","papers":7},{"task":"/task/anomaly-detection","name":"Anomaly Detection","papers":6},{"task":"/task/benchmarking","name":"Benchmarking","papers":6},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":6},{"task":"/task/adversarial-robustness","name":"Adversarial Robustness","papers":5},{"task":"/task/classification-1","name":"Classification","papers":5},{"task":"/task/classification","name":"General Classification","papers":5},{"task":"/task/management","name":"Management","papers":5},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":5},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":5},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":4},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":4}],"tasks_shown":20,"n_tasks":193,"usage_by_year":[{"year":"2017","papers":1},{"year":"2018","papers":3},{"year":"2019","papers":9},{"year":"2020","papers":26},{"year":"2021","papers":33},{"year":"2022","papers":28},{"year":"2023","papers":36},{"year":"2024","papers":40},{"year":"2025","papers":21}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/gat"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=GAT","read_at":"2026-10-05T00:56:28+00:00","query":"GAT","kind":"paper","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1710.10903","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":true,"bearers_found":6,"served":null,"leading_other_bearer":{"arxiv_id":"2011.14969","title":"Guided Adversarial Attack for Evaluating and Enhancing Adversarial Defenses","citations":121,"named_by":["acronym_expansion"],"bearer_name":"Guided Adversarial Training (GAT)","ask_with":"have('2011.14969')"},"n_other_bearers_listed":5,"note":"Nothing resolved to 'GAT' by name, but 6 thing(s) here DECLARE that name -- most cited: 'Guided Adversarial Training (GAT)', a method in 'Guided Adversarial Attack for Evaluating and Enhancing Adversarial Defenses' (arXiv:2011.14969, 121 citations). That is a RESOLUTION miss, not a coverage gap: the corpus holds the name under a spelling the lookup did not reach. Ask again with an entry of `also_named`."},"name_competition_text":"Nothing resolved to this name, but 6 entries in Syntology's graph carry it; the most cited is “Guided Adversarial Training (GAT)”, a method in the paper “Guided Adversarial Attack for Evaluating and Enhancing Adversarial Defenses” (arXiv:2011.14969, 121 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach.","near_matches":["HR-GAT","HR-GAT","CT-GAT","HIA-GAT","HSO-GAT","MRC-GAT","GAT-MDN","GAT-NeRF"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"872b79a90b9932929144834252c297ac7ff72fb6567fa927603b7a9623093cd9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}