{"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","name":"Graph Attention","slug":"graph-attention","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":1088,"papers_with_code":413,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/nba-player-performance-prediction-dataset","name":"NBA player performance prediction dataset","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":11,"rows_per_page":100,"shown":100,"of":1088,"of_with_code":413,"tagged_in_all":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":51,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":51,"listed_every_run_a_failure_of_syntologys_instrument":9,"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"},"items":[{"url":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_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","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}},"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"]}}},{"url":"/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","repositories_listed":8,"syntology":{"n":16,"n_ran":11,"n_constructed":1,"n_ran_checked":10,"n_instrument":1,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_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","sample_list":"/paper/how-attentive-are-graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2105.14491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14491"}},"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"]}}},{"url":"/paper/graphsaint-graph-sampling-based-inductive","slug":"graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","arxiv_id":"1907.04931","repositories_listed":8,"syntology":null},{"url":"/paper/inductive-representation-learning-on-temporal-1","slug":"inductive-representation-learning-on-temporal-1","title":"Inductive Representation Learning on Temporal Graphs","date":"2020-02-19","arxiv_id":"2002.07962","repositories_listed":5,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/inductive-representation-learning-on-temporal-1#ran","syntology_url":"https://syntology.ai/paper/2002.07962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07962"}},"official":{"repos":["StatsDLMathsRecomSys/Inductive-representation-learning-on-temporal-graphs"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/graph-neural-networks-a-review-of-methods-and","slug":"graph-neural-networks-a-review-of-methods-and","title":"Graph Neural Networks: A Review of Methods and Applications","date":"2018-12-20","arxiv_id":"1812.08434","repositories_listed":5,"syntology":null},{"url":"/paper/representation-learning-on-graphs-with","slug":"representation-learning-on-graphs-with","title":"Representation Learning on Graphs with Jumping Knowledge Networks","date":"2018-06-09","arxiv_id":"1806.03536","repositories_listed":5,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"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, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/representation-learning-on-graphs-with#ran","syntology_url":"https://syntology.ai/paper/1806.03536","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.03536"}},"official":null}},{"url":"/paper/equiformer-equivariant-graph-attention","slug":"equiformer-equivariant-graph-attention","title":"Equiformer: Equivariant Graph Attention Transformer for 3D Atomistic Graphs","date":"2022-06-23","arxiv_id":"2206.11990","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/equiformer-equivariant-graph-attention#ran","syntology_url":"https://syntology.ai/paper/2206.11990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11990"}},"official":{"repos":["atomicarchitects/equiformer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/spatial-graph-attention-and-curiosity-driven","slug":"spatial-graph-attention-and-curiosity-driven","title":"Spatial Graph Attention and Curiosity-driven Policy for Antiviral Drug Discovery","date":"2021-06-04","arxiv_id":"2106.02190","repositories_listed":4,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/spatial-graph-attention-and-curiosity-driven#ran","syntology_url":"https://syntology.ai/paper/2106.02190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02190"}},"official":{"repos":["njchoma/DGAPN","yulun-rayn/dgapn","yulun-rayn/SGAnCP4ADD"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-network-for-traffic-forecasting","slug":"graph-neural-network-for-traffic-forecasting","title":"Graph Neural Network for Traffic Forecasting: A Survey","date":"2021-01-27","arxiv_id":"2101.11174","repositories_listed":4,"syntology":null},{"url":"/paper/visual-semantic-graph-attention-network-for","slug":"visual-semantic-graph-attention-network-for","title":"Visual-Semantic Graph Attention Networks for Human-Object Interaction Detection","date":"2020-01-07","arxiv_id":"2001.02302","repositories_listed":4,"syntology":null},{"url":"/paper/megan-multi-explanation-graph-attention","slug":"megan-multi-explanation-graph-attention","title":"MEGAN: Multi-Explanation Graph Attention Network","date":"2022-11-23","arxiv_id":"2211.13236","repositories_listed":3,"syntology":null},{"url":"/paper/raga-relation-aware-graph-attention-networks","slug":"raga-relation-aware-graph-attention-networks","title":"RAGA: Relation-aware Graph Attention Networks for Global Entity Alignment","date":"2021-03-01","arxiv_id":"2103.00791","repositories_listed":3,"syntology":null},{"url":"/paper/hats-a-hierarchical-graph-attention-network","slug":"hats-a-hierarchical-graph-attention-network","title":"HATS: A Hierarchical Graph Attention Network for Stock Movement Prediction","date":"2019-08-07","arxiv_id":"1908.07999","repositories_listed":3,"syntology":null},{"url":"/paper/gapnet-graph-attention-based-point-neural","slug":"gapnet-graph-attention-based-point-neural","title":"GAPNet: Graph Attention based Point Neural Network for Exploiting Local Feature of Point Cloud","date":"2019-05-21","arxiv_id":"1905.08705","repositories_listed":3,"syntology":null},{"url":"/paper/graph-matching-networks-for-learning-the-1","slug":"graph-matching-networks-for-learning-the-1","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects","date":"2019-04-29","arxiv_id":"1904.12787","repositories_listed":3,"syntology":null},{"url":"/paper/pldr-llm-large-language-model-from-power-law","slug":"pldr-llm-large-language-model-from-power-law","title":"PLDR-LLM: Large Language Model from Power Law Decoder Representations","date":"2024-10-22","arxiv_id":"2410.16703","repositories_listed":2,"syntology":null},{"url":"/paper/scvgae-a-novel-approach-using-zinb-based","slug":"scvgae-a-novel-approach-using-zinb-based","title":"scVGAE: A Novel Approach using ZINB-Based Variational Graph Autoencoder for Single-Cell RNA-Seq Imputation","date":"2024-03-13","arxiv_id":"2403.08959","repositories_listed":2,"syntology":null},{"url":"/paper/temporal-and-heterogeneous-graph-neural","slug":"temporal-and-heterogeneous-graph-neural","title":"Temporal and Heterogeneous Graph Neural Network for Financial Time Series Prediction","date":"2023-05-09","arxiv_id":"2305.08740","repositories_listed":2,"syntology":null},{"url":"/paper/transposed-variational-auto-encoder-with","slug":"transposed-variational-auto-encoder-with","title":"Transposed Variational Auto-encoder with Intrinsic Feature Learning for Traffic Forecasting","date":"2022-10-30","arxiv_id":"2211.00641","repositories_listed":2,"syntology":null},{"url":"/paper/how-to-find-your-friendly-neighborhood-graph-1","slug":"how-to-find-your-friendly-neighborhood-graph-1","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","date":"2022-04-11","arxiv_id":"2204.04879","repositories_listed":2,"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":1,"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/how-to-find-your-friendly-neighborhood-graph-1#ran","syntology_url":"https://syntology.ai/paper/2204.04879","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.04879"}},"official":{"repos":["dongkwan-kim/SuperGAT"],"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"]}}},{"url":"/paper/global-reasoned-multi-task-learning-model-for","slug":"global-reasoned-multi-task-learning-model-for","title":"Global-Reasoned Multi-Task Learning Model for Surgical Scene Understanding","date":"2022-01-28","arxiv_id":"2201.11957","repositories_listed":2,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"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) · 7 unverified","sample_list":"/paper/global-reasoned-multi-task-learning-model-for#ran","syntology_url":"https://syntology.ai/paper/2201.11957","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.11957"}},"official":{"repos":["lalithjets/global-reasoned-multi-task-model"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-joint-strategies-of-self","slug":"multi-task-joint-strategies-of-self","title":"Multi-task Joint Strategies of Self-supervised Representation Learning on Biomedical Networks for Drug Discovery","date":"2022-01-12","arxiv_id":"2201.04437","repositories_listed":2,"syntology":null},{"url":"/paper/face-presentation-attack-detection-using","slug":"face-presentation-attack-detection-using","title":"FRT-PAD: Effective Presentation Attack Detection Driven by Face Related Task","date":"2021-11-22","arxiv_id":"2111.11046","repositories_listed":2,"syntology":null},{"url":"/paper/aasist-audio-anti-spoofing-using-integrated","slug":"aasist-audio-anti-spoofing-using-integrated","title":"AASIST: Audio Anti-Spoofing using Integrated Spectro-Temporal Graph Attention Networks","date":"2021-10-04","arxiv_id":"2110.01200","repositories_listed":2,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 3 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/aasist-audio-anti-spoofing-using-integrated#ran","syntology_url":"https://syntology.ai/paper/2110.01200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.01200"}},"official":{"repos":["clovaai/aasist"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/disenkgat-knowledge-graph-embedding-with","slug":"disenkgat-knowledge-graph-embedding-with","title":"DisenKGAT: Knowledge Graph Embedding with Disentangled Graph Attention Network","date":"2021-08-22","arxiv_id":"2108.09628","repositories_listed":2,"syntology":null},{"url":"/paper/deepdds-deep-graph-neural-network-with","slug":"deepdds-deep-graph-neural-network-with","title":"DeepDDS: deep graph neural network with attention mechanism to predict synergistic drug combinations","date":"2021-07-06","arxiv_id":"2107.02467","repositories_listed":2,"syntology":null},{"url":"/paper/graph-attention-networks-with-lstm-based-path","slug":"graph-attention-networks-with-lstm-based-path","title":"Customizing Graph Neural Networks using Path Reweighting","date":"2021-06-21","arxiv_id":"2106.10866","repositories_listed":2,"syntology":null},{"url":"/paper/gipa-general-information-propagation","slug":"gipa-general-information-propagation","title":"GIPA: General Information Propagation Algorithm for Graph Learning","date":"2021-05-13","arxiv_id":"2105.06035","repositories_listed":2,"syntology":null},{"url":"/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","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 2 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multivariate-time-series-anomaly-detection#ran","syntology_url":"https://syntology.ai/paper/2009.02040","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.02040"}},"official":null}},{"url":"/paper/bandit-samplers-for-training-graph-neural","slug":"bandit-samplers-for-training-graph-neural","title":"Bandit Samplers for Training Graph Neural Networks","date":"2020-06-10","arxiv_id":"2006.05806","repositories_listed":2,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/bandit-samplers-for-training-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2006.05806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05806"}},"official":{"repos":["xavierzw/ogb-geniepath-bs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/structured-multimodal-attentions-for-textvqa","slug":"structured-multimodal-attentions-for-textvqa","title":"Structured Multimodal Attentions for TextVQA","date":"2020-06-01","arxiv_id":"2006.00753","repositories_listed":2,"syntology":null},{"url":"/paper/multi-label-text-classification-using","slug":"multi-label-text-classification-using","title":"Multi-Label Text Classification using Attention-based Graph Neural Network","date":"2020-03-22","arxiv_id":"2003.11644","repositories_listed":2,"syntology":null},{"url":"/paper/magnet-multi-label-text-classification-using","slug":"magnet-multi-label-text-classification-using","title":"MAGNET: Multi-Label Text Classification using Attention-based Graph Neural Network","date":"2020-02-24","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/learn-to-design-the-heuristics-for-vehicle","slug":"learn-to-design-the-heuristics-for-vehicle","title":"Learn to Design the Heuristics for Vehicle Routing Problem","date":"2020-02-20","arxiv_id":"2002.08539","repositories_listed":2,"syntology":null},{"url":"/paper/contextual-graph-attention-for-answering","slug":"contextual-graph-attention-for-answering","title":"Contextual Graph Attention for Answering Logical Queries over Incomplete Knowledge Graphs","date":"2019-09-30","arxiv_id":"1910.00084","repositories_listed":2,"syntology":null},{"url":"/paper/paperrobot-incremental-draft-generation-of","slug":"paperrobot-incremental-draft-generation-of","title":"PaperRobot: Incremental Draft Generation of Scientific Ideas","date":"2019-05-20","arxiv_id":"1905.07870","repositories_listed":2,"syntology":null},{"url":"/paper/relational-graph-attention-networks-1","slug":"relational-graph-attention-networks-1","title":"Relational Graph Attention Networks","date":"2019-04-11","arxiv_id":"1904.05811","repositories_listed":2,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_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","sample_list":"/paper/relational-graph-attention-networks-1#ran","syntology_url":"https://syntology.ai/paper/1904.05811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.05811"}},"official":{"repos":["Babylonpartners/rgat"],"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"]}}},{"url":"/paper/session-based-social-recommendation-via","slug":"session-based-social-recommendation-via","title":"Session-based Social Recommendation via Dynamic Graph Attention Networks","date":"2019-02-25","arxiv_id":"1902.09362","repositories_listed":2,"syntology":{"n":13,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":12,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/session-based-social-recommendation-via#ran","syntology_url":"https://syntology.ai/paper/1902.09362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.09362"}},"official":{"repos":["DeepGraphLearning/RecommenderSystems"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":12,"ran_from_kinds":["official"]}}},{"url":"/paper/watch-your-step-learning-node-embeddings-via","slug":"watch-your-step-learning-node-embeddings-via","title":"Watch Your Step: Learning Node Embeddings via Graph Attention","date":"2017-10-26","arxiv_id":"1710.09599","repositories_listed":2,"syntology":null},{"url":"/paper/following-the-clues-experiments-on-person-re","slug":"following-the-clues-experiments-on-person-re","title":"Following the Clues: Experiments on Person Re-ID using Cross-Modal Intelligence","date":"2025-07-02","arxiv_id":"2507.01504","repositories_listed":1,"syntology":null},{"url":"/paper/ast-enhanced-or-ast-overloaded-the-surprising","slug":"ast-enhanced-or-ast-overloaded-the-surprising","title":"AST-Enhanced or AST-Overloaded? The Surprising Impact of Hybrid Graph Representations on Code Clone Detection","date":"2025-06-17","arxiv_id":"2506.14470","repositories_listed":1,"syntology":null},{"url":"/paper/stamimputer-spatio-temporal-attention-moe-for","slug":"stamimputer-spatio-temporal-attention-moe-for","title":"STAMImputer: Spatio-Temporal Attention MoE for Traffic Data Imputation","date":"2025-06-09","arxiv_id":"2506.08054","repositories_listed":1,"syntology":null},{"url":"/paper/learning-pyramid-structured-long-range-1","slug":"learning-pyramid-structured-long-range-1","title":"Learning Pyramid-structured Long-range Dependencies for 3D Human Pose Estimation","date":"2025-06-03","arxiv_id":"2506.02853","repositories_listed":1,"syntology":null},{"url":"/paper/speaker-diarization-with-overlapping","slug":"speaker-diarization-with-overlapping","title":"Speaker Diarization with Overlapping Community Detection Using Graph Attention Networks and Label Propagation Algorithm","date":"2025-06-03","arxiv_id":"2506.02610","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-graph-clustering-with-deep","slug":"unsupervised-graph-clustering-with-deep","title":"Unsupervised Graph Clustering with Deep Structural Entropy","date":"2025-05-20","arxiv_id":"2505.14040","repositories_listed":1,"syntology":null},{"url":"/paper/gates-cost-aware-dynamic-workflow-scheduling","slug":"gates-cost-aware-dynamic-workflow-scheduling","title":"GATES: Cost-aware Dynamic Workflow Scheduling via Graph Attention Networks and Evolution Strategy","date":"2025-05-18","arxiv_id":"2505.12355","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gates-cost-aware-dynamic-workflow-scheduling#ran","syntology_url":"https://syntology.ai/paper/2505.12355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.12355"}},"official":{"repos":["yashen998/gates"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/must-multi-scale-structural-temporal-link","slug":"must-multi-scale-structural-temporal-link","title":"MUST: Multi-Scale Structural-Temporal Link Prediction Model for UAV Ad Hoc Networks","date":"2025-05-14","arxiv_id":"2505.09331","repositories_listed":1,"syntology":null},{"url":"/paper/as3d-2d-assisted-cross-modal-understanding","slug":"as3d-2d-assisted-cross-modal-understanding","title":"AS3D: 2D-Assisted Cross-Modal Understanding with Semantic-Spatial Scene Graphs for 3D Visual Grounding","date":"2025-05-07","arxiv_id":"2505.04058","repositories_listed":1,"syntology":null},{"url":"/paper/modality-guided-dynamic-graph-fusion-and","slug":"modality-guided-dynamic-graph-fusion-and","title":"Modality-Guided Dynamic Graph Fusion and Temporal Diffusion for Self-Supervised RGB-T Tracking","date":"2025-05-06","arxiv_id":"2505.03507","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":5,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"6 ran (of which 5 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/modality-guided-dynamic-graph-fusion-and#ran","syntology_url":"https://syntology.ai/paper/2505.03507","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.03507"}},"official":{"repos":["lishenglana/gdstrack"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/sa-gat-sr-self-adaptable-graph-attention","slug":"sa-gat-sr-self-adaptable-graph-attention","title":"SA-GAT-SR: Self-Adaptable Graph Attention Networks with Symbolic Regression for high-fidelity material property prediction","date":"2025-05-01","arxiv_id":"2505.00625","repositories_listed":1,"syntology":null},{"url":"/paper/unveiling-the-hidden-movie-genre-and-user","slug":"unveiling-the-hidden-movie-genre-and-user","title":"Unveiling the Hidden: Movie Genre and User Bias in Spoiler Detection","date":"2025-04-24","arxiv_id":"2504.17834","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-transceiver-design-for-multi-user","slug":"scalable-transceiver-design-for-multi-user","title":"Scalable Transceiver Design for Multi-User Communication in FDD Massive MIMO Systems via Deep Learning","date":"2025-04-15","arxiv_id":"2504.11162","repositories_listed":1,"syntology":null},{"url":"/paper/graph-attention-for-heterogeneous-graphs-with","slug":"graph-attention-for-heterogeneous-graphs-with","title":"Graph Attention for Heterogeneous Graphs with Positional Encoding","date":"2025-04-03","arxiv_id":"2504.02938","repositories_listed":1,"syntology":null},{"url":"/paper/finecausal-a-causal-based-framework-for","slug":"finecausal-a-causal-based-framework-for","title":"FineCausal: A Causal-Based Framework for Interpretable Fine-Grained Action Quality Assessment","date":"2025-03-31","arxiv_id":"2503.23911","repositories_listed":1,"syntology":null},{"url":"/paper/peer-disambiguation-in-self-reported-surveys","slug":"peer-disambiguation-in-self-reported-surveys","title":"Peer Disambiguation in Self-Reported Surveys using Graph Attention Networks","date":"2025-03-25","arxiv_id":"2503.20076","repositories_listed":1,"syntology":null},{"url":"/paper/multi-modality-representation-learning-for","slug":"multi-modality-representation-learning-for","title":"Multi-Modality Representation Learning for Antibody-Antigen Interactions Prediction","date":"2025-03-22","arxiv_id":"2503.17666","repositories_listed":1,"syntology":null},{"url":"/paper/weighted-graph-structure-learning-with","slug":"weighted-graph-structure-learning-with","title":"Weighted Graph Structure Learning with Attention Denoising for Node Classification","date":"2025-03-15","arxiv_id":"2503.12157","repositories_listed":1,"syntology":null},{"url":"/paper/from-pixels-to-histopathology-a-graph-based","slug":"from-pixels-to-histopathology-a-graph-based","title":"From Pixels to Histopathology: A Graph-Based Framework for Interpretable Whole Slide Image Analysis","date":"2025-03-14","arxiv_id":"2503.11846","repositories_listed":1,"syntology":null},{"url":"/paper/joint-masked-reconstruction-and-contrastive","slug":"joint-masked-reconstruction-and-contrastive","title":"Joint Masked Reconstruction and Contrastive Learning for Mining Interactions Between Proteins","date":"2025-03-06","arxiv_id":"2503.04650","repositories_listed":1,"syntology":null},{"url":"/paper/grain-exact-graph-reconstruction-from","slug":"grain-exact-graph-reconstruction-from","title":"GRAIN: Exact Graph Reconstruction from Gradients","date":"2025-03-03","arxiv_id":"2503.01838","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/grain-exact-graph-reconstruction-from#ran","syntology_url":"https://syntology.ai/paper/2503.01838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01838"}},"official":{"repos":["insait-institute/grain"],"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/cagn-gat-fusion-a-hybrid-contrastive","slug":"cagn-gat-fusion-a-hybrid-contrastive","title":"CAGN-GAT Fusion: A Hybrid Contrastive Attentive Graph Neural Network for Network Intrusion Detection","date":"2025-03-02","arxiv_id":"2503.00961","repositories_listed":1,"syntology":null},{"url":"/paper/multiview-graph-dual-attention-deep-learning","slug":"multiview-graph-dual-attention-deep-learning","title":"Multiview graph dual-attention deep learning and contrastive learning for multi-criteria recommender systems","date":"2025-02-26","arxiv_id":"2502.19271","repositories_listed":1,"syntology":null},{"url":"/paper/se-3-equivariant-ternary-complex-prediction","slug":"se-3-equivariant-ternary-complex-prediction","title":"SE(3)-Equivariant Ternary Complex Prediction Towards Target Protein Degradation","date":"2025-02-26","arxiv_id":"2502.18875","repositories_listed":1,"syntology":null},{"url":"/paper/pldr-llms-learn-a-generalizable-tensor","slug":"pldr-llms-learn-a-generalizable-tensor","title":"PLDR-LLMs Learn A Generalizable Tensor Operator That Can Replace Its Own Deep Neural Net At Inference","date":"2025-02-19","arxiv_id":"2502.13502","repositories_listed":1,"syntology":null},{"url":"/paper/enhanced-load-forecasting-with-gat-lstm","slug":"enhanced-load-forecasting-with-gat-lstm","title":"Enhanced Load Forecasting with GAT-LSTM: Leveraging Grid and Temporal Features","date":"2025-02-12","arxiv_id":"2502.08376","repositories_listed":1,"syntology":null},{"url":"/paper/neighborhood-order-learning-graph-attention","slug":"neighborhood-order-learning-graph-attention","title":"Neighborhood-Order Learning Graph Attention Network for Fake News Detection","date":"2025-02-10","arxiv_id":"2502.06927","repositories_listed":1,"syntology":null},{"url":"/paper/relgnn-composite-message-passing-for","slug":"relgnn-composite-message-passing-for","title":"RelGNN: Composite Message Passing for Relational Deep Learning","date":"2025-02-10","arxiv_id":"2502.06784","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/relgnn-composite-message-passing-for#ran","syntology_url":"https://syntology.ai/paper/2502.06784","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.06784"}},"official":{"repos":["snap-stanford/relgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/lidar-loop-closure-detection-using-semantic","slug":"lidar-loop-closure-detection-using-semantic","title":"LiDAR Loop Closure Detection using Semantic Graphs with Graph Attention Networks","date":"2025-01-31","arxiv_id":"2501.19382","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-functional-brain-connectome","slug":"rethinking-functional-brain-connectome","title":"Rethinking Functional Brain Connectome Analysis: Do Graph Deep Learning Models Help?","date":"2025-01-28","arxiv_id":"2501.17207","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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) · 0 unverified","sample_list":"/paper/rethinking-functional-brain-connectome#ran","syntology_url":"https://syntology.ai/paper/2501.17207","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.17207"}},"official":{"repos":["learningkeqi/rethinkingbca"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/grappa-a-hybrid-graph-neural-network-for","slug":"grappa-a-hybrid-graph-neural-network-for","title":"GRAPPA - A Hybrid Graph Neural Network for Predicting Pure Component Vapor Pressures","date":"2025-01-15","arxiv_id":"2501.08729","repositories_listed":1,"syntology":null},{"url":"/paper/halal-or-not-knowledge-graph-completion-for","slug":"halal-or-not-knowledge-graph-completion-for","title":"Halal or Not: Knowledge Graph Completion for Predicting Cultural Appropriateness of Daily Products","date":"2025-01-10","arxiv_id":"2501.05768","repositories_listed":1,"syntology":null},{"url":"/paper/graphite-graph-based-interpretable-tissue","slug":"graphite-graph-based-interpretable-tissue","title":"GRAPHITE: Graph-Based Interpretable Tissue Examination for Enhanced Explainability in Breast Cancer Histopathology","date":"2025-01-08","arxiv_id":"2501.04206","repositories_listed":1,"syntology":null},{"url":"/paper/a-decision-based-heterogenous-graph-attention","slug":"a-decision-based-heterogenous-graph-attention","title":"A Decision-Based Heterogenous Graph Attention Network for Multi-Class Fake News Detection","date":"2025-01-06","arxiv_id":"2501.03290","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/gat-rwos-graph-attention-guided-random-walk","slug":"gat-rwos-graph-attention-guided-random-walk","title":"GAT-RWOS: Graph Attention-Guided Random Walk Oversampling for Imbalanced Data Classification","date":"2024-12-20","arxiv_id":"2412.16394","repositories_listed":1,"syntology":null},{"url":"/paper/maclight-multi-scene-aggregation","slug":"maclight-multi-scene-aggregation","title":"MacLight: Multi-scene Aggregation Convolutional Learning for Traffic Signal Control","date":"2024-12-20","arxiv_id":"2412.15703","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-when-and-why-graph-attention","slug":"understanding-when-and-why-graph-attention","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","date":"2024-12-20","arxiv_id":"2412.15496","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":0,"n_no_contract":1,"n_pointer_only":1,"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","sample_list":"/paper/understanding-when-and-why-graph-attention#ran","syntology_url":"https://syntology.ai/paper/2412.15496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.15496"}},"official":{"repos":["mztmzt/gat_csbm"],"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"]}}},{"url":"/paper/exechecker-where-did-i-go-wrong","slug":"exechecker-where-did-i-go-wrong","title":"ExeChecker: Where Did I Go Wrong?","date":"2024-12-13","arxiv_id":"2412.10573","repositories_listed":1,"syntology":null},{"url":"/paper/towards-the-efficacy-of-federated-prediction","slug":"towards-the-efficacy-of-federated-prediction","title":"Towards the efficacy of federated prediction for epidemics on networks","date":"2024-12-03","arxiv_id":"2412.02161","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-heart-failure","slug":"graph-neural-networks-for-heart-failure","title":"Graph Neural Networks for Heart Failure Prediction on an EHR-Based Patient Similarity Graph","date":"2024-11-29","arxiv_id":"2411.19742","repositories_listed":1,"syntology":null},{"url":"/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,"repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-multi-graph-learning-with","slug":"contrastive-multi-graph-learning-with","title":"Contrastive Multi-graph Learning with Neighbor Hierarchical Sifting for Semi-supervised Text Classification","date":"2024-11-25","arxiv_id":"2411.16787","repositories_listed":1,"syntology":null},{"url":"/paper/geoai-enhanced-community-detection-on-spatial","slug":"geoai-enhanced-community-detection-on-spatial","title":"GeoAI-Enhanced Community Detection on Spatial Networks with Graph Deep Learning","date":"2024-11-23","arxiv_id":"2411.15428","repositories_listed":1,"syntology":null},{"url":"/paper/sag-vit-a-scale-aware-high-fidelity-patching","slug":"sag-vit-a-scale-aware-high-fidelity-patching","title":"SAG-ViT: A Scale-Aware, High-Fidelity Patching Approach with Graph Attention for Vision Transformers","date":"2024-11-14","arxiv_id":"2411.09420","repositories_listed":1,"syntology":null},{"url":"/paper/centrality-graph-shift-operators-for-graph","slug":"centrality-graph-shift-operators-for-graph","title":"Centrality Graph Shift Operators for Graph Neural Networks","date":"2024-11-07","arxiv_id":"2411.04655","repositories_listed":1,"syntology":null},{"url":"/paper/equivariant-graph-attention-networks-with","slug":"equivariant-graph-attention-networks-with","title":"Equivariant Graph Attention Networks with Structural Motifs for Predicting Cell Line-Specific Synergistic Drug Combinations","date":"2024-11-07","arxiv_id":"2411.04747","repositories_listed":1,"syntology":null},{"url":"/paper/hacd-harnessing-attribute-semantics-and","slug":"hacd-harnessing-attribute-semantics-and","title":"HACD: Harnessing Attribute Semantics and Mesoscopic Structure for Community Detection","date":"2024-11-04","arxiv_id":"2411.01947","repositories_listed":1,"syntology":null},{"url":"/paper/unsegmedgat-unsupervised-medical-image","slug":"unsegmedgat-unsupervised-medical-image","title":"UnSegMedGAT: Unsupervised Medical Image Segmentation using Graph Attention Networks Clustering","date":"2024-11-04","arxiv_id":"2411.01966","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-chess-reinforcement-learning-with","slug":"enhancing-chess-reinforcement-learning-with","title":"Enhancing Chess Reinforcement Learning with Graph Representation","date":"2024-10-31","arxiv_id":"2410.23753","repositories_listed":1,"syntology":null},{"url":"/paper/gates-graph-attention-network-with-global","slug":"gates-graph-attention-network-with-global","title":"GATES: Graph Attention Network with Global Expression Fusion for Deciphering Spatial Transcriptome Architectures","date":"2024-10-26","arxiv_id":"2410.20159","repositories_listed":1,"syntology":null},{"url":"/paper/disengcd-a-meta-multigraph-assisted","slug":"disengcd-a-meta-multigraph-assisted","title":"DisenGCD: A Meta Multigraph-assisted Disentangled Graph Learning Framework for Cognitive Diagnosis","date":"2024-10-23","arxiv_id":"2410.17564","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"6 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/disengcd-a-meta-multigraph-assisted#ran","syntology_url":"https://syntology.ai/paper/2410.17564","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.17564"}},"official":{"repos":["bimk/intelligent-education"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-graph-attention-networks","slug":"deep-graph-attention-networks","title":"Deep Graph Attention Networks","date":"2024-10-21","arxiv_id":"2410.15640","repositories_listed":1,"syntology":null},{"url":"/paper/a-heterogeneous-network-based-contrastive","slug":"a-heterogeneous-network-based-contrastive","title":"A Heterogeneous Network-based Contrastive Learning Approach for Predicting Drug-Target Interaction","date":"2024-10-20","arxiv_id":"2411.00801","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-weibull-graph-attention-autoencoder","slug":"scalable-weibull-graph-attention-autoencoder","title":"Scalable Weibull Graph Attention Autoencoder for Modeling Document Networks","date":"2024-10-13","arxiv_id":"2410.09696","repositories_listed":1,"syntology":null},{"url":"/paper/comparative-analysis-of-multi-omics","slug":"comparative-analysis-of-multi-omics","title":"Comparative Analysis of Multi-Omics Integration Using Advanced Graph Neural Networks for Cancer Classification","date":"2024-10-05","arxiv_id":"2410.05325","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-of-gene-regulatory-networks-from","slug":"analysis-of-gene-regulatory-networks-from","title":"Analysis of Gene Regulatory Networks from Gene Expression Using Graph Neural Networks","date":"2024-09-20","arxiv_id":"2409.13664","repositories_listed":1,"syntology":null},{"url":"/paper/gaprotonet-a-multi-head-graph-attention-based","slug":"gaprotonet-a-multi-head-graph-attention-based","title":"GAProtoNet: A Multi-head Graph Attention-based Prototypical Network for Interpretable Text Classification","date":"2024-09-20","arxiv_id":"2409.13312","repositories_listed":1,"syntology":null}],"syntology_records":20,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":60,"papers_where_code_ran_first_page":"/task/graph-attention/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":11,"url":"/task/graph-attention/papers/2","json":"/task/graph-attention/papers/2.json","rows":100},{"order":"archive","page":3,"of":11,"url":"/task/graph-attention/papers/3","json":"/task/graph-attention/papers/3.json","rows":100},{"order":"archive","page":4,"of":11,"url":"/task/graph-attention/papers/4","json":"/task/graph-attention/papers/4.json","rows":100},{"order":"archive","page":5,"of":11,"url":"/task/graph-attention/papers/5","json":"/task/graph-attention/papers/5.json","rows":100},{"order":"archive","page":6,"of":11,"url":"/task/graph-attention/papers/6","json":"/task/graph-attention/papers/6.json","rows":100},{"order":"archive","page":7,"of":11,"url":"/task/graph-attention/papers/7","json":"/task/graph-attention/papers/7.json","rows":100},{"order":"archive","page":8,"of":11,"url":"/task/graph-attention/papers/8","json":"/task/graph-attention/papers/8.json","rows":100},{"order":"archive","page":9,"of":11,"url":"/task/graph-attention/papers/9","json":"/task/graph-attention/papers/9.json","rows":100},{"order":"archive","page":10,"of":11,"url":"/task/graph-attention/papers/10","json":"/task/graph-attention/papers/10.json","rows":100},{"order":"archive","page":11,"of":11,"url":"/task/graph-attention/papers/11","json":"/task/graph-attention/papers/11.json","rows":88},{"order":"ran","page":1,"of":1,"url":"/task/graph-attention/papers/ran/1","json":"/task/graph-attention/papers/ran/1.json","rows":60}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"6e0560ae79d5b52131001da8bd91400a52d104e876aa86c24495c658a376a56d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}