{"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":"/task/graph-attention/papers/4","list_of":"/task/graph-attention","task":"Graph Attention","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":4,"pages_in_order":11,"rows_per_page":100,"rows":[301,400],"of":1088,"counts":{"archive_papers_tagged":1088,"with_a_code_link":413,"where_syntology_ran_a_sample":60,"not_listed_spam_title":0,"listed":1088,"listed_where_code_ran":60,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":52,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":52,"listed_every_run_a_failure_of_syntologys_instrument":8,"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":"/task/graph-attention","prev":"/task/graph-attention/papers/3","next":"/task/graph-attention/papers/5","papers":[{"url":"/paper/multi-relation-aware-temporal-interaction","slug":"multi-relation-aware-temporal-interaction","title":"Multi-Relation Aware Temporal Interaction Network Embedding","date":"2021-10-09","arxiv_id":"2110.04503","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-enhanced-hierarchical-graph","slug":"knowledge-enhanced-hierarchical-graph","title":"Knowledge-Enhanced Hierarchical Graph Transformer Network for Multi-Behavior Recommendation","date":"2021-10-08","arxiv_id":"2110.04000","repositories_listed":1,"syntology":null},{"url":"/paper/perceived-and-intended-sarcasm-detection-with","slug":"perceived-and-intended-sarcasm-detection-with","title":"Perceived and Intended Sarcasm Detection with Graph Attention Networks","date":"2021-10-08","arxiv_id":"2110.04001","repositories_listed":1,"syntology":null},{"url":"/paper/know-your-action-set-learning-action","slug":"know-your-action-set-learning-action","title":"Know Your Action Set: Learning Action Relations for Reinforcement Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scalable-deeper-graph-neural-networks-for","slug":"scalable-deeper-graph-neural-networks-for","title":"Scalable deeper graph neural networks for high-performance materials property prediction","date":"2021-09-25","arxiv_id":"2109.12283","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/compare-to-the-knowledge-graph-neural-fake","slug":"compare-to-the-knowledge-graph-neural-fake","title":"Compare to The Knowledge: Graph Neural Fake News Detection with External Knowledge","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-entity-boundary-detection-for","slug":"enhancing-entity-boundary-detection-for","title":"Enhancing Entity Boundary Detection for Better Chinese Named Entity Recognition","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/space-efficient-context-encoding-for-non-task","slug":"space-efficient-context-encoding-for-non-task","title":"Space Efficient Context Encoding for Non-Task-Oriented Dialogue Generation with Graph Attention Transformer","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unlimited-neighborhood-interaction-for","slug":"unlimited-neighborhood-interaction-for","title":"Unlimited Neighborhood Interaction for Heterogeneous Trajectory Prediction","date":"2021-07-31","arxiv_id":"2108.00238","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-spectro-temporal-graph-attention","slug":"end-to-end-spectro-temporal-graph-attention","title":"End-to-End Spectro-Temporal Graph Attention Networks for Speaker Verification Anti-Spoofing and Speech Deepfake Detection","date":"2021-07-27","arxiv_id":"2107.12710","repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-interactive-graph-neural","slug":"structure-aware-interactive-graph-neural","title":"Structure-aware Interactive Graph Neural Networks for the Prediction of Protein-Ligand Binding Affinity","date":"2021-07-21","arxiv_id":"2107.10670","repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-long-short-term-memory","slug":"structure-aware-long-short-term-memory","title":"Structure-Aware Long Short-Term Memory Network for 3D Cephalometric Landmark Detection","date":"2021-07-21","arxiv_id":"2107.09899","repositories_listed":1,"syntology":null},{"url":"/paper/joint-implicit-image-function-for-guided","slug":"joint-implicit-image-function-for-guided","title":"Joint Implicit Image Function for Guided Depth Super-Resolution","date":"2021-07-19","arxiv_id":"2107.08717","repositories_listed":1,"syntology":null},{"url":"/paper/graph-kernel-attention-transformers","slug":"graph-kernel-attention-transformers","title":"From block-Toeplitz matrices to differential equations on graphs: towards a general theory for scalable masked Transformers","date":"2021-07-16","arxiv_id":"2107.07999","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-for-road-type","slug":"graph-representation-learning-for-road-type","title":"Graph Representation Learning for Road Type Classification","date":"2021-07-16","arxiv_id":"2107.07791","repositories_listed":1,"syntology":null},{"url":"/paper/drug-target-interaction-prediction-with-graph","slug":"drug-target-interaction-prediction-with-graph","title":"Drug-Target Interaction Prediction with Graph Attention networks","date":"2021-07-10","arxiv_id":"2107.06099","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_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","sample_list":"/paper/drug-target-interaction-prediction-with-graph#ran","syntology_url":"https://syntology.ai/paper/2107.06099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.06099"}},"official":{"repos":["Haiyang-W/DTI-GRAPH"],"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"]}}},{"url":"/paper/dualvgr-a-dual-visual-graph-reasoning-unit","slug":"dualvgr-a-dual-visual-graph-reasoning-unit","title":"DualVGR: A Dual-Visual Graph Reasoning Unit for Video Question Answering","date":"2021-07-10","arxiv_id":"2107.04768","repositories_listed":1,"syntology":null},{"url":"/paper/mass-multi-attentional-semantic-segmentation","slug":"mass-multi-attentional-semantic-segmentation","title":"MASS: Multi-Attentional Semantic Segmentation of LiDAR Data for Dense Top-View Understanding","date":"2021-07-01","arxiv_id":"2107.00346","repositories_listed":1,"syntology":null},{"url":"/paper/graphconfrec-a-graph-neural-network-based","slug":"graphconfrec-a-graph-neural-network-based","title":"GraphConfRec: A Graph Neural Network-Based Conference Recommender System","date":"2021-06-23","arxiv_id":"2106.12340","repositories_listed":1,"syntology":null},{"url":"/paper/disenhan-disentangled-heterogeneous-graph","slug":"disenhan-disentangled-heterogeneous-graph","title":"DisenHAN: Disentangled Heterogeneous Graph Attention Network for Recommendation","date":"2021-06-21","arxiv_id":"2106.10879","repositories_listed":1,"syntology":null},{"url":"/paper/fingat-financial-graph-attention-networks-for","slug":"fingat-financial-graph-attention-networks-for","title":"FinGAT: Financial Graph Attention Networks for Recommending Top-K Profitable Stocks","date":"2021-06-18","arxiv_id":"2106.10159","repositories_listed":1,"syntology":null},{"url":"/paper/adversarially-regularized-graph-attention","slug":"adversarially-regularized-graph-attention","title":"Adversarially Regularized Graph Attention Networks for Inductive Learning on Partially Labeled Graphs","date":"2021-06-07","arxiv_id":"2106.03393","repositories_listed":1,"syntology":null},{"url":"/paper/schedulenet-learn-to-solve-multi-agent","slug":"schedulenet-learn-to-solve-multi-agent","title":"ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning","date":"2021-06-06","arxiv_id":"2106.03051","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-deep-learning-for-communication","slug":"graph-based-deep-learning-for-communication","title":"Graph-based Deep Learning for Communication Networks: A Survey","date":"2021-06-04","arxiv_id":"2106.02533","repositories_listed":1,"syntology":null},{"url":"/paper/event-time-extraction-and-propagation-via","slug":"event-time-extraction-and-propagation-via","title":"Event Time Extraction and Propagation via Graph Attention Networks","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-syntax-and-semantics-in","slug":"incorporating-syntax-and-semantics-in","title":"Incorporating Syntax and Semantics in Coreference Resolution with Heterogeneous Graph Attention Network","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/solve-routing-problems-with-a-residual-edge","slug":"solve-routing-problems-with-a-residual-edge","title":"Solve routing problems with a residual edge-graph attention neural network","date":"2021-05-06","arxiv_id":"2105.02730","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-graph-neural-networks-for-sequential","slug":"dynamic-graph-neural-networks-for-sequential","title":"Dynamic Graph Neural Networks for Sequential Recommendation","date":"2021-04-15","arxiv_id":"2104.07368","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-aware-graph-enhanced-gpt-2-for","slug":"knowledge-aware-graph-enhanced-gpt-2-for","title":"Knowledge-Aware Graph-Enhanced GPT-2 for Dialogue State Tracking","date":"2021-04-09","arxiv_id":"2104.04466","repositories_listed":1,"syntology":null},{"url":"/paper/conversational-question-answering-over-1","slug":"conversational-question-answering-over-1","title":"Conversational Question Answering over Knowledge Graphs with Transformer and Graph Attention Networks","date":"2021-04-04","arxiv_id":"2104.01569","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/graph-joint-attention-networks-1","slug":"graph-joint-attention-networks-1","title":"Learning Conjoint Attentions for Graph Neural Nets","date":"2021-02-05","arxiv_id":"2102.03147","repositories_listed":1,"syntology":null},{"url":"/paper/spagan-shortest-path-graph-attention-network","slug":"spagan-shortest-path-graph-attention-network","title":"SPAGAN: Shortest Path Graph Attention Network","date":"2021-01-10","arxiv_id":"2101.03464","repositories_listed":1,"syntology":null},{"url":"/paper/co-gat-a-co-interactive-graph-attention","slug":"co-gat-a-co-interactive-graph-attention","title":"Co-GAT: A Co-Interactive Graph Attention Network for Joint Dialog Act Recognition and Sentiment Classification","date":"2020-12-24","arxiv_id":"2012.13260","repositories_listed":1,"syntology":null},{"url":"/paper/cooperative-policy-learning-with-pre-trained","slug":"cooperative-policy-learning-with-pre-trained","title":"Cooperative Policy Learning with Pre-trained Heterogeneous Observation Representations","date":"2020-12-24","arxiv_id":"2012.13099","repositories_listed":1,"syntology":null},{"url":"/paper/distance-aware-molecule-graph-attention","slug":"distance-aware-molecule-graph-attention","title":"Distance-aware Molecule Graph Attention Network for Drug-Target Binding Affinity Prediction","date":"2020-12-17","arxiv_id":"2012.09624","repositories_listed":1,"syntology":null},{"url":"/paper/katrec-knowledge-aware-attentive-sequential","slug":"katrec-knowledge-aware-attentive-sequential","title":"KATRec: Knowledge Aware aTtentive Sequential Recommendations","date":"2020-12-06","arxiv_id":"2012.03323","repositories_listed":1,"syntology":null},{"url":"/paper/graph-attention-network-with-memory-fusion","slug":"graph-attention-network-with-memory-fusion","title":"Graph Attention Network with Memory Fusion for Aspect-level Sentiment Analysis","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-knowledge-augmented-visual-question","slug":"towards-knowledge-augmented-visual-question","title":"Towards Knowledge-Augmented Visual Question Answering","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/message-aware-graph-attention-networks-for","slug":"message-aware-graph-attention-networks-for","title":"Message-Aware Graph Attention Networks for Large-Scale Multi-Robot Path Planning","date":"2020-11-26","arxiv_id":"2011.13219","repositories_listed":1,"syntology":null},{"url":"/paper/synonym-knowledge-enhanced-reader-for-chinese","slug":"synonym-knowledge-enhanced-reader-for-chinese","title":"Synonym Knowledge Enhanced Reader for Chinese Idiom Reading Comprehension","date":"2020-11-09","arxiv_id":"2011.04499","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-reinforcement-learning-for","slug":"multi-agent-reinforcement-learning-for","title":"Multi-Agent Reinforcement Learning for Visibility-based Persistent Monitoring","date":"2020-11-02","arxiv_id":"2011.01129","repositories_listed":1,"syntology":null},{"url":"/paper/relation-aware-graph-attention-networks-with","slug":"relation-aware-graph-attention-networks-with","title":"Relation-aware Graph Attention Networks with Relational Position Encodings for Emotion Recognition in Conversations","date":"2020-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pathfinder-discovery-networks-for-neural","slug":"pathfinder-discovery-networks-for-neural","title":"Pathfinder Discovery Networks for Neural Message Passing","date":"2020-10-24","arxiv_id":"2010.12878","repositories_listed":1,"syntology":null},{"url":"/paper/learning-dual-semantic-relations-with-graph","slug":"learning-dual-semantic-relations-with-graph","title":"Learning Dual Semantic Relations with Graph Attention for Image-Text Matching","date":"2020-10-22","arxiv_id":"2010.11550","repositories_listed":1,"syntology":null},{"url":"/paper/should-graph-convolution-trust-neighbors-a","slug":"should-graph-convolution-trust-neighbors-a","title":"Should Graph Convolution Trust Neighbors? A Simple Causal Inference Method","date":"2020-10-22","arxiv_id":"2010.11797","repositories_listed":1,"syntology":null},{"url":"/paper/gate-graph-attention-transformer-encoder-for","slug":"gate-graph-attention-transformer-encoder-for","title":"GATE: Graph Attention Transformer Encoder for Cross-lingual Relation and Event Extraction","date":"2020-10-06","arxiv_id":"2010.03009","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gate-graph-attention-transformer-encoder-for#ran","syntology_url":"https://syntology.ai/paper/2010.03009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03009"}},"official":null}},{"url":"/paper/program-enhanced-fact-verification-with","slug":"program-enhanced-fact-verification-with","title":"Program Enhanced Fact Verification with Verbalization and Graph Attention Network","date":"2020-10-06","arxiv_id":"2010.03084","repositories_listed":1,"syntology":null},{"url":"/paper/sentence-constituent-aware-aspect-category","slug":"sentence-constituent-aware-aspect-category","title":"Sentence Constituent-Aware Aspect-Category Sentiment Analysis with Graph Attention Networks","date":"2020-10-04","arxiv_id":"2010.01461","repositories_listed":1,"syntology":null},{"url":"/paper/multi-scale-receptive-fields-graph-attention","slug":"multi-scale-receptive-fields-graph-attention","title":"Multi-scale Receptive Fields Graph Attention Network for Point Cloud Classification","date":"2020-09-28","arxiv_id":"2009.13289","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/kg-bart-knowledge-graph-augmented-bart-for","slug":"kg-bart-knowledge-graph-augmented-bart-for","title":"KG-BART: Knowledge Graph-Augmented BART for Generative Commonsense Reasoning","date":"2020-09-26","arxiv_id":"2009.12677","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kg-bart-knowledge-graph-augmented-bart-for#ran","syntology_url":"https://syntology.ai/paper/2009.12677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.12677"}},"official":{"repos":["yeliu918/KG-BART"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/are-scene-graphs-good-enough-to-improve-image","slug":"are-scene-graphs-good-enough-to-improve-image","title":"Are scene graphs good enough to improve Image Captioning?","date":"2020-09-25","arxiv_id":"2009.12313","repositories_listed":1,"syntology":null},{"url":"/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,"repositories_listed":1,"syntology":null},{"url":"/paper/dialogue-relation-extraction-with-document","slug":"dialogue-relation-extraction-with-document","title":"Dialogue Relation Extraction with Document-level Heterogeneous Graph Attention Networks","date":"2020-09-10","arxiv_id":"2009.05092","repositories_listed":1,"syntology":null},{"url":"/paper/i-aid-identifying-actionable-information-from","slug":"i-aid-identifying-actionable-information-from","title":"I-AID: Identifying Actionable Information from Disaster-related Tweets","date":"2020-08-04","arxiv_id":"2008.13544","repositories_listed":1,"syntology":null},{"url":"/paper/jointly-cross-and-self-modal-graph-attention","slug":"jointly-cross-and-self-modal-graph-attention","title":"Jointly Cross- and Self-Modal Graph Attention Network for Query-Based Moment Localization","date":"2020-08-04","arxiv_id":"2008.01403","repositories_listed":1,"syntology":null},{"url":"/paper/ecnu-sensemaker-at-semeval-2020-task-4","slug":"ecnu-sensemaker-at-semeval-2020-task-4","title":"ECNU-SenseMaker at SemEval-2020 Task 4: Leveraging Heterogeneous Knowledge Resources for Commonsense Validation and Explanation","date":"2020-07-28","arxiv_id":"2007.14200","repositories_listed":1,"syntology":null},{"url":"/paper/aegcn-an-autoencoder-constrained-graph","slug":"aegcn-an-autoencoder-constrained-graph","title":"AEGCN: An Autoencoder-Constrained Graph Convolutional Network","date":"2020-07-03","arxiv_id":"2007.03424","repositories_listed":1,"syntology":null},{"url":"/paper/effective-inter-clause-modeling-for-end-to","slug":"effective-inter-clause-modeling-for-end-to","title":"Effective Inter-Clause Modeling for End-to-End Emotion-Cause Pair Extraction","date":"2020-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/molecule-edit-graph-attention-network","slug":"molecule-edit-graph-attention-network","title":"Molecule Edit Graph Attention Network: Modeling Chemical Reactions as Sequences of Graph Edits","date":"2020-06-27","arxiv_id":"2006.15426","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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) · 1 unverified","sample_list":"/paper/molecule-edit-graph-attention-network#ran","syntology_url":"https://syntology.ai/paper/2006.15426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15426"}},"official":{"repos":["molecule-one/megan"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gaining-insight-into-sars-cov-2-infection-and","slug":"gaining-insight-into-sars-cov-2-infection-and","title":"Gaining Insight into SARS-CoV-2 Infection and COVID-19 Severity Using Self-supervised Edge Features and Graph Neural Networks","date":"2020-06-23","arxiv_id":"2006.12971","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-edge-features-for-improved","slug":"self-supervised-edge-features-for-improved","title":"Self-supervised edge features for improved Graph Neural Network training","date":"2020-06-23","arxiv_id":"2007.04777","repositories_listed":1,"syntology":null},{"url":"/paper/forming-an-electoral-college-for-a-graph-a","slug":"forming-an-electoral-college-for-a-graph-a","title":"Heuristic Semi-Supervised Learning for Graph Generation Inspired by Electoral College","date":"2020-06-10","arxiv_id":"2006.06469","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-attention-networks-for-1","slug":"heterogeneous-graph-attention-networks-for-1","title":"Heterogeneous Graph Attention Networks for Early Detection of Rumors on Twitter","date":"2020-06-10","arxiv_id":"2006.05866","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-graph-neural-networks-from","slug":"understanding-graph-neural-networks-from","title":"Understanding Graph Neural Networks from Graph Signal Denoising Perspectives","date":"2020-06-08","arxiv_id":"2006.04386","repositories_listed":1,"syntology":null},{"url":"/paper/ac-vrnn-attentive-conditional-vrnn-for-multi","slug":"ac-vrnn-attentive-conditional-vrnn-for-multi","title":"AC-VRNN: Attentive Conditional-VRNN for Multi-Future Trajectory Prediction","date":"2020-05-17","arxiv_id":"2005.08307","repositories_listed":1,"syntology":null},{"url":"/paper/document-modeling-with-graph-attention","slug":"document-modeling-with-graph-attention","title":"Document Modeling with Graph Attention Networks for Multi-grained Machine Reading Comprehension","date":"2020-05-12","arxiv_id":"2005.05806","repositories_listed":1,"syntology":{"n":16,"n_ran":8,"n_constructed":8,"n_ran_checked":8,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":16,"phrase":"8 ran (of which 8 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified; every one of the 8 samples that ran constructed an object rather than computing a result","sample_list":"/paper/document-modeling-with-graph-attention#ran","syntology_url":"https://syntology.ai/paper/2005.05806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05806"}},"official":{"repos":["DancingSoul/NQ_BERT-DM"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":8,"n_ran_no_instrument_failure":8,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-learning-on-graphs-a-model-and","slug":"machine-learning-on-graphs-a-model-and","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","date":"2020-05-07","arxiv_id":"2005.03675","repositories_listed":1,"syntology":{"n":8,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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) · 6 unverified","sample_list":"/paper/machine-learning-on-graphs-a-model-and#ran","syntology_url":"https://syntology.ai/paper/2005.03675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03675"}},"official":{"repos":["google/gcnn-survey-paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-geo-contextual-embeddings-for","slug":"learning-geo-contextual-embeddings-for","title":"Learning Geo-Contextual Embeddings for Commuting Flow Prediction","date":"2020-05-04","arxiv_id":"2005.01690","repositories_listed":1,"syntology":null},{"url":"/paper/relational-graph-attention-network-for-aspect","slug":"relational-graph-attention-network-for-aspect","title":"Relational Graph Attention Network for Aspect-based Sentiment Analysis","date":"2020-04-26","arxiv_id":"2004.12362","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":1,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/relational-graph-attention-network-for-aspect#ran","syntology_url":"https://syntology.ai/paper/2004.12362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12362"}},"official":{"repos":["shenwzh3/RGAT-ABSA"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/iterative-context-aware-graph-inference-for","slug":"iterative-context-aware-graph-inference-for","title":"Iterative Context-Aware Graph Inference for Visual Dialog","date":"2020-04-05","arxiv_id":"2004.02194","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/gast-net-graph-attention-spatio-temporal","slug":"gast-net-graph-attention-spatio-temporal","title":"A Graph Attention Spatio-temporal Convolutional Network for 3D Human Pose Estimation in Video","date":"2020-03-11","arxiv_id":"2003.14179","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/gamma-reward-a-novel-multi-agent","slug":"gamma-reward-a-novel-multi-agent","title":"Learning Scalable Multi-Agent Coordination by Spatial Differentiation for Traffic Signal Control","date":"2020-02-27","arxiv_id":"2002.11874","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-typed-syntactic-dependencies-for","slug":"exploiting-typed-syntactic-dependencies-for","title":"Investigating Typed Syntactic Dependencies for Targeted Sentiment Classification Using Graph Attention Neural Network","date":"2020-02-22","arxiv_id":"2002.09685","repositories_listed":1,"syntology":null},{"url":"/paper/disease-state-prediction-from-single-cell","slug":"disease-state-prediction-from-single-cell","title":"Disease State Prediction From Single-Cell Data Using Graph Attention Networks","date":"2020-02-14","arxiv_id":"2002.07128","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/disease-state-prediction-from-single-cell#ran","syntology_url":"https://syntology.ai/paper/2002.07128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07128"}},"official":{"repos":["vandijklab/scGAT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/superpixel-image-classification-with-graph","slug":"superpixel-image-classification-with-graph","title":"Superpixel Image Classification with Graph Attention Networks","date":"2020-02-13","arxiv_id":"2002.05544","repositories_listed":1,"syntology":null},{"url":"/paper/edgenetsedge-varying-graph-neural-networks","slug":"edgenetsedge-varying-graph-neural-networks","title":"EdgeNets:Edge Varying Graph Neural Networks","date":"2020-01-21","arxiv_id":"2001.07620","repositories_listed":1,"syntology":null},{"url":"/paper/attributed-multi-relational-attention-network","slug":"attributed-multi-relational-attention-network","title":"Attributed Multi-Relational Attention Network for Fact-checking URL Recommendation","date":"2020-01-07","arxiv_id":"2001.02214","repositories_listed":1,"syntology":null},{"url":"/paper/towards-automated-statistical-physics-data","slug":"towards-automated-statistical-physics-data","title":"Deep learning reveals hidden interactions in complex systems","date":"2020-01-03","arxiv_id":"2001.02539","repositories_listed":1,"syntology":null},{"url":"/paper/coulgat-an-experiment-on-interpretability-of","slug":"coulgat-an-experiment-on-interpretability-of","title":"CoulGAT: An Experiment on Interpretability of Graph Attention Networks","date":"2019-12-18","arxiv_id":"1912.08409","repositories_listed":1,"syntology":null},{"url":"/paper/hyperbolic-graph-attention-network","slug":"hyperbolic-graph-attention-network","title":"Hyperbolic Graph Attention Network","date":"2019-12-06","arxiv_id":"1912.03046","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-graph-attention-networks","slug":"sparse-graph-attention-networks","title":"Sparse Graph Attention Networks","date":"2019-12-02","arxiv_id":"1912.00552","repositories_listed":1,"syntology":null},{"url":"/paper/stgrat-a-spatio-temporal-graph-attention","slug":"stgrat-a-spatio-temporal-graph-attention","title":"ST-GRAT: A Novel Spatio-temporal Graph Attention Network for Accurately Forecasting Dynamically Changing Road Speed","date":"2019-11-29","arxiv_id":"1911.13181","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-local-and-global-structure-for-1","slug":"exploiting-local-and-global-structure-for-1","title":"Exploiting Local and Global Structure for Point Cloud Semantic Segmentation with Contextual Point Representations","date":"2019-11-13","arxiv_id":"1911.05277","repositories_listed":1,"syntology":null},{"url":"/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,"repositories_listed":1,"syntology":null},{"url":"/paper/kernel-graph-attention-network-for-fact","slug":"kernel-graph-attention-network-for-fact","title":"Fine-grained Fact Verification with Kernel Graph Attention Network","date":"2019-10-22","arxiv_id":"1910.09796","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/kernel-graph-attention-network-for-fact#ran","syntology_url":"https://syntology.ai/paper/1910.09796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.09796"}},"official":{"repos":["thunlp/KernelGAT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/stgat-modeling-spatial-temporal-interactions","slug":"stgat-modeling-spatial-temporal-interactions","title":"STGAT: Modeling Spatial-Temporal Interactions for Human Trajectory Prediction","date":"2019-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graphmix-regularized-training-of-graph-neural","slug":"graphmix-regularized-training-of-graph-neural","title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","date":"2019-09-25","arxiv_id":"1909.11715","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-enriched-transformer-for-emotion","slug":"knowledge-enriched-transformer-for-emotion","title":"Knowledge-Enriched Transformer for Emotion Detection in Textual Conversations","date":"2019-09-24","arxiv_id":"1909.10681","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/knowledge-enriched-transformer-for-emotion#ran","syntology_url":"https://syntology.ai/paper/1909.10681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.10681"}},"official":{"repos":["zhongpeixiang/KET"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-based-reasoning-over-heterogeneous","slug":"graph-based-reasoning-over-heterogeneous","title":"Graph-Based Reasoning over Heterogeneous External Knowledge for Commonsense Question Answering","date":"2019-09-09","arxiv_id":"1909.05311","repositories_listed":1,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":7,"n_instrument":5,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/graph-based-reasoning-over-heterogeneous#ran","syntology_url":"https://syntology.ai/paper/1909.05311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.05311"}},"official":{"repos":["DecstionBack/AAAI_2020_CommonsenseQA"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/tgg-transferable-graph-generation-for-zero","slug":"tgg-transferable-graph-generation-for-zero","title":"TGG: Transferable Graph Generation for Zero-shot and Few-shot Learning","date":"2019-08-30","arxiv_id":"1908.11503","repositories_listed":1,"syntology":null},{"url":"/paper/urban-traffic-prediction-from-spatio-temporal","slug":"urban-traffic-prediction-from-spatio-temporal","title":"Urban Traffic Prediction from Spatio-Temporal Data Using Deep Meta Learning","date":"2019-07-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-via-hard-and","slug":"graph-representation-learning-via-hard-and","title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","date":"2019-07-05","arxiv_id":"1907.04652","repositories_listed":1,"syntology":null}],"record_sha256":"a08b6151b1836a87cf0cd50c48f6d320d2acb6079ddb7f2d3eeb1f1a73856620","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}