{"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/gatv2","slug":"gatv2","name":"GATv2","full_name":"Graph Attention Network v2","full_name_withheld":false,"description_markdown":"The __GATv2__ operator from the [“How Attentive are Graph Attention Networks?”](https://arxiv.org/abs/2105.14491) paper, which fixes the static attention problem of the standard [GAT](https://paperswithcode.com/method/gat) layer: since the linear layers in the standard GAT are applied right after each other, the ranking of attended nodes is unconditioned on the query node. In contrast, in GATv2, every node can attend to any other node.\r\n\r\nGATv2 scoring function:\r\n\r\n$e_{i,j} =\\mathbf{a}^{\\top}\\mathrm{LeakyReLU}\\left(\\mathbf{W}[\\mathbf{h}_i \\, \\Vert \\,\\mathbf{h}_j]\\right)$","description_state":"present","introduced_year":null,"introduced_by":{"title":"How Attentive are Graph Attention Networks?","paper":"/paper/how-attentive-are-graph-attention-networks","first_author":"Shaked Brody","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/how-attentive-are-graph-attention-networks"},"source":{"url":"https://arxiv.org/abs/2105.14491v3","title":"How Attentive are 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":9,"archive_num_papers":9,"papers_newest_first":[{"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":"/paper/perceived-text-relevance-estimation-using","slug":"perceived-text-relevance-estimation-using","title":"Perceived Text Relevance Estimation Using Scanpaths and GNNs","date":"2024-11-04","arxiv_id":null,"n_code_links":1,"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":"/paper/on-the-power-of-graph-neural-networks-and","slug":"on-the-power-of-graph-neural-networks-and","title":"On the Power of Graph Neural Networks and Feature Augmentation Strategies to Classify Social Networks","date":"2024-01-11","arxiv_id":"2401.06048","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":"gradient-derivation-for-learnable-parameters","title":"Gradient Derivation for Learnable Parameters in Graph Attention Networks","date":"2023-04-21","arxiv_id":"2304.10939","n_code_links":0,"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":"distance-geometric-graph-attention-network-dg","title":"Distance-Geometric Graph Attention Network (DG-GAT) for 3D Molecular Geometry","date":"2022-07-16","arxiv_id":"2207.08023","n_code_links":0,"syntology":null},{"paper":"/paper/how-attentive-are-graph-attention-networks","slug":"how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","arxiv_id":"2105.14491","n_code_links":8,"syntology":{"ran":11,"of":16,"n_ran_checked":10,"n_instrument":1,"unverified":5,"pointer_only":1,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","official":{"repos":["tech-srl/how_attentive_are_gats"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":9,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":9,"with_a_code_link":6,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":9,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"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":2,"papers_where_code_ran_first_page":"/method/gatv2/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":"ran","page":1,"of":1,"url":"/method/gatv2/papers/ran/1","json":"/method/gatv2/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/graph-attention","name":"Graph Attention","papers":5},{"task":"/task/graph-classification","name":"Graph Classification","papers":2},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":2},{"task":"/task/anomaly-detection","name":"Anomaly Detection","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/demand-forecasting","name":"Demand Forecasting","papers":1},{"task":"/task/drug-discovery","name":"Drug Discovery","papers":1},{"task":"/task/graph-learning","name":"Graph Learning","papers":1},{"task":"/task/graph-property-prediction","name":"Graph Property Prediction","papers":1},{"task":"/task/graph-regression","name":"Graph Regression","papers":1},{"task":"/task/link-prediction","name":"Link Prediction","papers":1},{"task":"/task/molecular-property-prediction","name":"Molecular Property Prediction","papers":1},{"task":"/task/node-classification","name":"Node Classification","papers":1},{"task":"/task/node-property-prediction","name":"Node Property Prediction","papers":1},{"task":"/task/product-categorization","name":"Product Categorization","papers":1},{"task":"/task/product-relation-classification","name":"Product Relation Classification","papers":1},{"task":"/task/product-relation-detection","name":"Product Relation Detection","papers":1},{"task":"/task/production-forecasting","name":"Production Forecasting","papers":1},{"task":"/task/representation-learning","name":"Representation Learning","papers":1},{"task":"/task/specificity","name":"Specificity","papers":1}],"tasks_shown":20,"n_tasks":21,"usage_by_year":[{"year":"2021","papers":1},{"year":"2022","papers":2},{"year":"2023","papers":2},{"year":"2024","papers":4}],"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/gatv2"},"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=GATv2","read_at":"2026-10-05T00:56:31+00:00","query":"GATv2","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"GATv2","origin_arxiv_id":"2105.14491"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2105.14491","repositories":{"listed":5,"in_graph":9,"list_truncated":true,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2105.14491","citations":2025},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'GATv2'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2105.14491","page":"/paper/how-attentive-are-graph-attention-networks","syntology_url":"https://syntology.ai/paper/2105.14491","in_graph_layer":true,"samples":16,"ran":11,"n_ran_checked":10,"n_instrument":1,"unverified":5,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 5 listed of 9 in the graph, strongest link: official). This answer is about arXiv:2105.14491, the paper the archive credits with this method.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"ebbfba62f5adba2c2ffa623831edeb801dce7bdabe6f59100a0be1465fd104e3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}