{"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/papers/2","list_of":"/method/gat","method":"GAT","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":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,197],"of":197,"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"},"first_page":"/method/gat","prev":"/method/gat","next":null,"papers":[{"paper":null,"slug":"mgadn-a-multi-task-graph-anomaly-detection","title":"MGADN: A Multi-task Graph Anomaly Detection Network for Multivariate Time Series","date":"2022-11-22","arxiv_id":"2211.12141","n_code_links":0,"syntology":null},{"paper":"/paper/learnable-graph-convolutional-attention","slug":"learnable-graph-convolutional-attention","title":"Learnable Graph Convolutional Attention Networks","date":"2022-11-21","arxiv_id":"2211.11853","n_code_links":1,"syntology":null},{"paper":"/paper/a-new-graph-node-classification-benchmark","slug":"a-new-graph-node-classification-benchmark","title":"A New Graph Node Classification Benchmark: Learning Structure from Histology Cell Graphs","date":"2022-11-11","arxiv_id":"2211.06292","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":["nellaker-group/placenta"],"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":"distgnn-mb-distributed-large-scale-graph","title":"DistGNN-MB: Distributed Large-Scale Graph Neural Network Training on x86 via Minibatch Sampling","date":"2022-11-11","arxiv_id":"2211.06385","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-attention-networks-unveil-determinants","title":"Graph Attention Networks Unveil Determinants of Intra- and Inter-city Health Disparity","date":"2022-10-18","arxiv_id":"2210.10142","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-graph-based-recommender-system-with","title":"Efficient Graph based Recommender System with Weighted Averaging of Messages","date":"2022-09-30","arxiv_id":"2209.15238","n_code_links":0,"syntology":null},{"paper":null,"slug":"semi-supervised-training-for-knowledge-base","title":"Semi-supervised Training for Knowledge Base Graph Self-attention Networks on Link Prediction","date":"2022-09-03","arxiv_id":"2209.01350","n_code_links":0,"syntology":null},{"paper":"/paper/heterogeneous-graph-tree-networks","slug":"heterogeneous-graph-tree-networks","title":"Heterogeneous Graph Tree Networks","date":"2022-09-01","arxiv_id":"2209.00610","n_code_links":1,"syntology":null},{"paper":"/paper/vigat-bottom-up-event-recognition-and","slug":"vigat-bottom-up-event-recognition-and","title":"ViGAT: Bottom-up event recognition and explanation in video using factorized graph attention network","date":"2022-07-20","arxiv_id":"2207.09927","n_code_links":1,"syntology":null},{"paper":"/paper/cova-exploiting-compressed-domain-analysis-to","slug":"cova-exploiting-compressed-domain-analysis-to","title":"CoVA: Exploiting Compressed-Domain Analysis to Accelerate Video Analytics","date":"2022-07-02","arxiv_id":"2207.00588","n_code_links":1,"syntology":null},{"paper":null,"slug":"prognnosis-a-data-driven-model-to-predict-gnn","title":"ProGNNosis: A Data-driven Model to Predict GNN Computation Time Using Graph Metrics","date":"2022-06-16","arxiv_id":"2206.08258","n_code_links":0,"syntology":null},{"paper":"/paper/graph-attention-multi-layer-perceptron-1","slug":"graph-attention-multi-layer-perceptron-1","title":"Graph Attention Multi-Layer Perceptron","date":"2022-06-09","arxiv_id":"2206.04355","n_code_links":1,"syntology":null},{"paper":null,"slug":"detecting-anomalous-cryptocurrency","title":"Detecting Anomalous Cryptocurrency Transactions: an AML/CFT Application of Machine Learning-based Forensics","date":"2022-06-07","arxiv_id":"2206.04803","n_code_links":0,"syntology":null},{"paper":null,"slug":"mean-field-inference-of-crfs-based-on-gat","title":"Mean Field inference of CRFs based on GAT","date":"2022-05-29","arxiv_id":"2205.15312","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-reinforcement-learning-on-graphs-for","title":"Robust Reinforcement Learning on Graphs for Logistics optimization","date":"2022-05-25","arxiv_id":"2205.12888","n_code_links":0,"syntology":null},{"paper":null,"slug":"dotin-dropping-task-irrelevant-nodes-for-gnns","title":"DOTIN: Dropping Task-Irrelevant Nodes for GNNs","date":"2022-04-28","arxiv_id":"2204.13429","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-robustness-of-language-models-from-1","title":"Improving robustness of language models from a geometry-aware perspective","date":"2022-04-28","arxiv_id":"2204.13309","n_code_links":0,"syntology":null},{"paper":null,"slug":"unified-gcns-towards-connecting-gcns-with","title":"Unified GCNs: Towards Connecting GCNs with CNNs","date":"2022-04-26","arxiv_id":"2204.12300","n_code_links":0,"syntology":null},{"paper":"/paper/m2n-mesh-movement-networks-for-pde-solvers","slug":"m2n-mesh-movement-networks-for-pde-solvers","title":"M2N: Mesh Movement Networks for PDE Solvers","date":"2022-04-24","arxiv_id":"2204.11188","n_code_links":1,"syntology":null},{"paper":"/paper/exploiting-neighbor-effect-conv-agnostic-gnns","slug":"exploiting-neighbor-effect-conv-agnostic-gnns","title":"Exploiting Neighbor Effect: Conv-Agnostic GNNs Framework for Graphs with Heterophily","date":"2022-03-19","arxiv_id":"2203.11200","n_code_links":1,"syntology":null},{"paper":null,"slug":"hyper-relationship-learning-network-for-scene","title":"Hyper-relationship Learning Network for Scene Graph Generation","date":"2022-02-15","arxiv_id":"2202.07271","n_code_links":0,"syntology":null},{"paper":"/paper/towards-compositional-adversarial-robustness","slug":"towards-compositional-adversarial-robustness","title":"Towards Compositional Adversarial Robustness: Generalizing Adversarial Training to Composite Semantic Perturbations","date":"2022-02-09","arxiv_id":"2202.04235","n_code_links":1,"syntology":null},{"paper":"/paper/decoupling-the-depth-and-scope-of-graph-1","slug":"decoupling-the-depth-and-scope-of-graph-1","title":"Decoupling the Depth and Scope of Graph Neural Networks","date":"2022-01-19","arxiv_id":"2201.07858","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["facebookresearch/shaDow_GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"wind-park-power-prediction-attention-based","title":"Wind Park Power Prediction: Attention-Based Graph Networks and Deep Learning to Capture Wake Losses","date":"2022-01-10","arxiv_id":"2201.03229","n_code_links":0,"syntology":null},{"paper":"/paper/gat-cadnet-graph-attention-network-for","slug":"gat-cadnet-graph-attention-network-for","title":"GAT-CADNet: Graph Attention Network for Panoptic Symbol Spotting in CAD Drawings","date":"2022-01-03","arxiv_id":"2201.00625","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":4,"phrase":"4 ran (of which 3 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) · 0 unverified","official":null}},{"paper":"/paper/are-we-really-making-much-progress-revisiting","slug":"are-we-really-making-much-progress-revisiting","title":"Are we really making much progress? Revisiting, benchmarking, and refining heterogeneous graph neural networks","date":"2021-12-30","arxiv_id":"2112.14936","n_code_links":2,"syntology":null},{"paper":"/paper/ccasgnn-collaborative-cascade-prediction","slug":"ccasgnn-collaborative-cascade-prediction","title":"CCasGNN: Collaborative Cascade Prediction Based on Graph Neural Networks","date":"2021-12-07","arxiv_id":"2112.03644","n_code_links":1,"syntology":null},{"paper":null,"slug":"distance-and-hop-wise-structures-encoding","title":"Distance and Hop-wise Structures Encoding Enhanced Graph Attention Networks","date":"2021-12-06","arxiv_id":"2112.02868","n_code_links":0,"syntology":null},{"paper":"/paper/sentiment-analysis-and-effect-of-covid-19","slug":"sentiment-analysis-and-effect-of-covid-19","title":"Sentiment Analysis and Effect of COVID-19 Pandemic using College SubReddit Data","date":"2021-11-30","arxiv_id":"2112.04351","n_code_links":1,"syntology":null},{"paper":"/paper/benchmarking-accuracy-and-generalizability-of","slug":"benchmarking-accuracy-and-generalizability-of","title":"Benchmarking Accuracy and Generalizability of Four Graph Neural Networks Using Large In Vitro ADME Datasets from Different Chemical Spaces","date":"2021-11-27","arxiv_id":"2111.13964","n_code_links":1,"syntology":null},{"paper":null,"slug":"improving-robustness-of-language-models-from","title":"Improving Robustness of Language Models from a Geometry-aware Perspective","date":"2021-11-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/cova-context-aware-visual-attention-for","slug":"cova-context-aware-visual-attention-for","title":"CoVA: Context-aware Visual Attention for Webpage Information Extraction","date":"2021-10-24","arxiv_id":"2110.12320","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":["kevalmorabia97/cova-web-object-detection"],"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":"/paper/fdgatii-fast-dynamic-graph-attention-with","slug":"fdgatii-fast-dynamic-graph-attention-with","title":"FDGATII : Fast Dynamic Graph Attention with Initial Residual and Identity Mapping","date":"2021-10-21","arxiv_id":"2110.11464","n_code_links":1,"syntology":null},{"paper":"/paper/geometry-attention-transformer-with-position","slug":"geometry-attention-transformer-with-position","title":"Geometry Attention Transformer with Position-aware LSTMs for Image Captioning","date":"2021-10-01","arxiv_id":"2110.00335","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-graph-tree-networks","title":"DEEP GRAPH TREE NETWORKS","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"sampling-before-training-rethinking-the","title":"Sampling Before Training: Rethinking the Effect of Edges in the Process of Training Graph Neural Networks","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"r-gat-relational-graph-attention-network-for","title":"r-GAT: Relational Graph Attention Network for Multi-Relational Graphs","date":"2021-09-13","arxiv_id":"2109.05922","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-attention-network-based-single-pixel","title":"Graph Attention Network Based Single-Pixel Compressive Direction of Arrival Estimation","date":"2021-09-12","arxiv_id":"2109.05466","n_code_links":0,"syntology":null},{"paper":"/paper/local-augmentation-for-graph-neural-networks","slug":"local-augmentation-for-graph-neural-networks","title":"Local Augmentation for Graph Neural Networks","date":"2021-09-08","arxiv_id":"2109.03856","n_code_links":1,"syntology":null},{"paper":"/paper/multivariate-and-propagation-graph-attention","slug":"multivariate-and-propagation-graph-attention","title":"Multivariate and Propagation Graph Attention Network for Spatial-Temporal Prediction with Outdoor Cellular Traffic","date":"2021-08-18","arxiv_id":"2108.08307","n_code_links":1,"syntology":null},{"paper":"/paper/multistream-graph-attention-networks-for-wind","slug":"multistream-graph-attention-networks-for-wind","title":"Multistream Graph Attention Networks for Wind Speed Forecasting","date":"2021-08-16","arxiv_id":"2108.07063","n_code_links":1,"syntology":null},{"paper":null,"slug":"generalizing-adversarial-training-to","title":"Generalizing Adversarial Training to Composite Semantic Perturbations","date":"2021-06-18","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"psycholinguistic-tripartite-graph-network-for","title":"Psycholinguistic Tripartite Graph Network for Personality Detection","date":"2021-06-09","arxiv_id":"2106.04963","n_code_links":0,"syntology":null},{"paper":null,"slug":"adagcn-adaptive-boosting-algorithm-for-graph","title":"Boosting-GNN: Boosting Algorithm for Graph Networks on Imbalanced Node Classification","date":"2021-05-25","arxiv_id":"2105.11625","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-attention-networks-with-positional","title":"Graph Attention Networks with Positional Embeddings","date":"2021-05-09","arxiv_id":"2105.04037","n_code_links":0,"syntology":null},{"paper":"/paper/user-preference-aware-fake-news-detection","slug":"user-preference-aware-fake-news-detection","title":"User Preference-aware Fake News Detection","date":"2021-04-25","arxiv_id":"2104.12259","n_code_links":2,"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":["safe-graph/GNN-FakeNews"],"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/qa-gnn-reasoning-with-language-models-and","slug":"qa-gnn-reasoning-with-language-models-and","title":"QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question Answering","date":"2021-04-13","arxiv_id":"2104.06378","n_code_links":6,"syntology":{"ran":8,"of":25,"n_ran_checked":8,"n_instrument":0,"unverified":17,"pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 17 unverified","official":{"repos":["michiyasunaga/qagnn","worksheets.codalab.org/worksheets/0xf215deb05edf44a2ac353c711f52a25f"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":13,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"graph-attention-networks-for-anti-spoofing","title":"Graph Attention Networks for Anti-Spoofing","date":"2021-04-08","arxiv_id":"2104.03654","n_code_links":0,"syntology":null},{"paper":"/paper/adaptive-filters-and-aggregator-fusion-for","slug":"adaptive-filters-and-aggregator-fusion-for","title":"Do We Need Anisotropic Graph Neural Networks?","date":"2021-04-03","arxiv_id":"2104.01481","n_code_links":2,"syntology":null},{"paper":null,"slug":"graph-attention-networks-for-channel","title":"Graph Attention Networks for Channel Estimation in RIS-assisted Satellite IoT Communications","date":"2021-04-01","arxiv_id":"2104.00735","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-transformer-for-video-understanding","title":"Enhancing Transformer for Video Understanding Using Gated Multi-Level Attention and Temporal Adversarial Training","date":"2021-03-18","arxiv_id":"2103.10043","n_code_links":0,"syntology":null},{"paper":null,"slug":"session-based-software-recommendation-with","title":"Session-based Social and Dependency-aware Software Recommendation","date":"2021-03-10","arxiv_id":"2103.06109","n_code_links":0,"syntology":null},{"paper":"/paper/lipschitz-normalization-for-self-attention","slug":"lipschitz-normalization-for-self-attention","title":"Lipschitz Normalization for Self-Attention Layers with Application to Graph Neural Networks","date":"2021-03-08","arxiv_id":"2103.04886","n_code_links":1,"syntology":null},{"paper":"/paper/extract-the-knowledge-of-graph-neural","slug":"extract-the-knowledge-of-graph-neural","title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","date":"2021-03-04","arxiv_id":"2103.02885","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"pointer_only":3,"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) · 1 unverified","official":{"repos":["BUPT-GAMMA/CPF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/bootstrapped-representation-learning-on","slug":"bootstrapped-representation-learning-on","title":"Large-Scale Representation Learning on Graphs via Bootstrapping","date":"2021-02-12","arxiv_id":"2102.06514","n_code_links":4,"syntology":{"ran":5,"of":8,"n_ran_checked":4,"n_instrument":1,"unverified":3,"pointer_only":7,"phrase":"5 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["nerdslab/bgrl"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"comparisons-of-graph-neural-networks-on","title":"Comparisons of Graph Neural Networks on Cancer Classification Leveraging a Joint of Phenotypic and Genetic Features","date":"2021-01-14","arxiv_id":"2101.05866","n_code_links":0,"syntology":null},{"paper":null,"slug":"geogat-graph-model-based-on-attention","title":"geoGAT: Graph Model Based on Attention Mechanism for Geographic Text Classification","date":"2021-01-13","arxiv_id":"2101.11424","n_code_links":0,"syntology":null},{"paper":null,"slug":"memory-augmented-design-of-graph-neural","title":"Memory Augmented Design of Graph Neural Networks","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/analyzing-and-improving-generative-1","slug":"analyzing-and-improving-generative-1","title":"Learning Energy-Based Models With Adversarial Training","date":"2020-12-11","arxiv_id":"2012.06568","n_code_links":1,"syntology":null},{"paper":"/paper/optimizing-large-scale-fleet-management-on-a","slug":"optimizing-large-scale-fleet-management-on-a","title":"Optimizing Large-Scale Fleet Management on a Road Network using Multi-Agent Deep Reinforcement Learning with Graph Neural Network","date":"2020-11-12","arxiv_id":"2011.06175","n_code_links":1,"syntology":null},{"paper":"/paper/single-node-attack-for-fooling-graph-neural-1","slug":"single-node-attack-for-fooling-graph-neural-1","title":"Single-Node Attacks for Fooling Graph Neural Networks","date":"2020-11-06","arxiv_id":"2011.03574","n_code_links":1,"syntology":null},{"paper":null,"slug":"channel-estimation-for-full-duplex-ris","title":"Channel Estimation for Full-Duplex RIS-assisted HAPS Backhauling with Graph Attention Networks","date":"2020-10-22","arxiv_id":"2010.12004","n_code_links":0,"syntology":null},{"paper":"/paper/metapath-and-entity-aware-graph-neural","slug":"metapath-and-entity-aware-graph-neural","title":"Metapath- and Entity-aware Graph Neural Network for Recommendation","date":"2020-10-22","arxiv_id":"2010.11793","n_code_links":1,"syntology":null},{"paper":"/paper/text-based-rl-agents-with-commonsense","slug":"text-based-rl-agents-with-commonsense","title":"Text-based RL Agents with Commonsense Knowledge: New Challenges, Environments and Baselines","date":"2020-10-08","arxiv_id":"2010.03790","n_code_links":2,"syntology":{"ran":11,"of":13,"n_ran_checked":11,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["IBM/commonsense-rl"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/a-unified-view-on-graph-neural-networks-as-1","slug":"a-unified-view-on-graph-neural-networks-as-1","title":"A Unified View on Graph Neural Networks as Graph Signal Denoising","date":"2020-10-05","arxiv_id":"2010.01777","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["alge24/ADA-UGNN"],"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/rogat-a-robust-gnn-combined-revised-gat-with","slug":"rogat-a-robust-gnn-combined-revised-gat-with","title":"A Robust graph attention network with dynamic adjusted Graph","date":"2020-09-28","arxiv_id":"2009.13038","n_code_links":1,"syntology":null},{"paper":"/paper/interpretable-recommender-system-with","slug":"interpretable-recommender-system-with","title":"Interpretable Recommender System With Heterogeneous Information: A Geometric Deep Learning Perspective","date":"2020-09-20","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/multivariate-time-series-anomaly-detection","slug":"multivariate-time-series-anomaly-detection","title":"Multivariate Time-series Anomaly Detection via Graph Attention Network","date":"2020-09-04","arxiv_id":"2009.02040","n_code_links":2,"syntology":{"ran":8,"of":8,"n_ran_checked":8,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 2 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":null,"slug":"multi-agent-reinforcement-learning-with-graph","title":"BGC: Multi-Agent Group Belief with Graph Clustering","date":"2020-08-20","arxiv_id":"2008.08808","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-graph-attention-networks-using-effective","title":"Fast Graph Attention Networks Using Effective Resistance Based Graph Sparsification","date":"2020-06-15","arxiv_id":"2006.08796","n_code_links":0,"syntology":null},{"paper":null,"slug":"implicit-kernel-attention","title":"Implicit Kernel Attention","date":"2020-06-11","arxiv_id":"2006.06147","n_code_links":0,"syntology":null},{"paper":"/paper/on-the-bottleneck-of-graph-neural-networks","slug":"on-the-bottleneck-of-graph-neural-networks","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","date":"2020-06-09","arxiv_id":"2006.05205","n_code_links":3,"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":["tech-srl/bottleneck"],"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":"/paper/graph-representation-learning-network-via","slug":"graph-representation-learning-network-via","title":"Graph Representation Learning Network via Adaptive Sampling","date":"2020-06-08","arxiv_id":"2006.04637","n_code_links":1,"syntology":null},{"paper":null,"slug":"spatial-temporal-dynamic-graph-attention","title":"Spatial-Temporal Dynamic Graph Attention Networks for Ride-hailing Demand Prediction","date":"2020-06-07","arxiv_id":"2006.05905","n_code_links":0,"syntology":null},{"paper":"/paper/graph-based-self-supervised-program-repair","slug":"graph-based-self-supervised-program-repair","title":"Graph-based, Self-Supervised Program Repair from Diagnostic Feedback","date":"2020-05-20","arxiv_id":"2005.10636","n_code_links":2,"syntology":{"ran":4,"of":6,"n_ran_checked":3,"n_instrument":1,"unverified":2,"pointer_only":0,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["michiyasunaga/DrRepair","worksheets.codalab.org/worksheets/0x01838644724a433c932bef4cb5c42fbd"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"neural-stochastic-block-model-scalable","title":"Neural Stochastic Block Model & Scalable Community-Based Graph Learning","date":"2020-05-16","arxiv_id":"2005.07855","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-structural-fingerprints-for-graph","title":"Adaptive Structural Fingerprints for Graph Attention Networks","date":"2020-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"gat-generative-adversarial-training-for","title":"GAT: Generative Adversarial Training for Adversarial Example Detection and Classification","date":"2020-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/contextualised-graph-attention-for-improved","slug":"contextualised-graph-attention-for-improved","title":"Contextualised Graph Attention for Improved Relation Extraction","date":"2020-04-22","arxiv_id":"2004.10624","n_code_links":1,"syntology":null},{"paper":"/paper/scattering-gcn-overcoming-oversmoothness-in","slug":"scattering-gcn-overcoming-oversmoothness-in","title":"Scattering GCN: Overcoming Oversmoothness in Graph Convolutional Networks","date":"2020-03-18","arxiv_id":"2003.08414","n_code_links":1,"syntology":null},{"paper":null,"slug":"spectral-graph-attention-network","title":"Spectral Graph Attention Network with Fast Eigen-approximation","date":"2020-03-16","arxiv_id":"2003.07450","n_code_links":0,"syntology":null},{"paper":"/paper/evaluating-logical-generalization-in-graph","slug":"evaluating-logical-generalization-in-graph","title":"Evaluating Logical Generalization in Graph Neural Networks","date":"2020-03-14","arxiv_id":"2003.06560","n_code_links":1,"syntology":null},{"paper":"/paper/global-attention-based-graph-convolutional","slug":"global-attention-based-graph-convolutional","title":"Global Attention based Graph Convolutional Neural Networks for Improved Materials Property Prediction","date":"2020-03-11","arxiv_id":"2003.13379","n_code_links":1,"syntology":null},{"paper":"/paper/bilinear-graph-neural-network-with-node","slug":"bilinear-graph-neural-network-with-node","title":"Bilinear Graph Neural Network with Neighbor Interactions","date":"2020-02-10","arxiv_id":"2002.03575","n_code_links":1,"syntology":null},{"paper":"/paper/semi-supervised-entity-alignment-via-joint","slug":"semi-supervised-entity-alignment-via-joint","title":"Semi-supervised Entity Alignment via Joint Knowledge Embedding Model and Cross-graph Model","date":"2019-11-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/dynamic-self-training-framework-for-graph","slug":"dynamic-self-training-framework-for-graph","title":"Effective Stabilized Self-Training on Few-Labeled Graph Data","date":"2019-10-07","arxiv_id":"1910.02684","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":null}},{"paper":"/paper/pairnorm-tackling-oversmoothing-in-gnns","slug":"pairnorm-tackling-oversmoothing-in-gnns","title":"PairNorm: Tackling Oversmoothing in GNNs","date":"2019-09-26","arxiv_id":"1909.12223","n_code_links":1,"syntology":null},{"paper":null,"slug":"190910248","title":"Heterogeneous-Temporal Graph Convolutional Networks: Make the Community Detection Much Better","date":"2019-09-23","arxiv_id":"1909.10248","n_code_links":0,"syntology":null},{"paper":"/paper/gresnet-graph-residuals-for-reviving-deep","slug":"gresnet-graph-residuals-for-reviving-deep","title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","date":"2019-09-12","arxiv_id":"1909.05729","n_code_links":2,"syntology":null},{"paper":null,"slug":"graph-neural-networks-for-small-graph-and","title":"Graph Neural Networks for Small Graph and Giant Network Representation Learning: An Overview","date":"2019-08-01","arxiv_id":"1908.00187","n_code_links":0,"syntology":null},{"paper":"/paper/signed-graph-attention-networks","slug":"signed-graph-attention-networks","title":"Signed Graph Attention Networks","date":"2019-06-26","arxiv_id":"1906.10958","n_code_links":1,"syntology":null},{"paper":null,"slug":"exploiting-edge-features-for-graph-neural","title":"Exploiting Edge Features for Graph Neural Networks","date":"2019-06-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"approximation-ratios-of-graph-neural-networks","title":"Approximation Ratios of Graph Neural Networks for Combinatorial Problems","date":"2019-05-24","arxiv_id":"1905.10261","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-robustness-of-attention-models-on","title":"A Regularized Attention Mechanism for Graph Attention Networks","date":"2018-11-01","arxiv_id":"1811.00181","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploiting-edge-features-in-graph-neural","title":"Exploiting Edge Features in Graph Neural Networks","date":"2018-09-07","arxiv_id":"1809.02709","n_code_links":0,"syntology":null},{"paper":null,"slug":"single-channel-speech-dereverberation-via","title":"Single-channel Speech Dereverberation via Generative Adversarial Training","date":"2018-06-25","arxiv_id":"1806.09325","n_code_links":0,"syntology":null},{"paper":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","n_code_links":93,"syntology":{"ran":61,"of":106,"n_ran_checked":52,"n_instrument":9,"unverified":45,"pointer_only":46,"phrase":"61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified","official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"c3035d0be7c458b9fd099f7205f823195c44b2a27544900f3a0af490baf1d1b9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}