Introduces a method to design structure-specific relational inductive biases for a base transformer architecture, enabling end-to-end transcription of documents with intrinsic structures, demonstrated on sheet music, shape drawings, and mechanical engineering drawings.
super hub Canonical reference
Graph Attention Networks
Canonical reference. 70% of citing Pith papers cite this work as background.
217
Pith papers citing it
Background
70% of classified citations
abstract
We present graph attention networks (GATs), novel neural network architectures that operate on graph-structured data, leveraging masked self-attentional layers to address the shortcomings of prior methods based on graph convolutions or their approximations. By stacking layers in which nodes are able to attend over their neighborhoods' features, we enable (implicitly) specifying different weights to different nodes in a neighborhood, without requiring any kind of costly matrix operation (such as inversion) or depending on knowing the graph structure upfront. In this way, we address several key challenges of spectral-based graph neural networks simultaneously, and make our model readily applicable to inductive as well as transductive problems. Our GAT models have achieved or matched state-of-the-art results across four established transductive and inductive graph benchmarks: the Cora, Citeseer and Pubmed citation network datasets, as well as a protein-protein interaction dataset (wherein test graphs remain unseen during training).
hub tools
citation-role summary
background 15
method 3
baseline 2
citation-polarity summary
claims ledger
- abstract We present graph attention networks (GATs), novel neural network architectures that operate on graph-structured data, leveraging masked self-attentional layers to address the shortcomings of prior methods based on graph convolutions or their approximations. By stacking layers in which nodes are able to attend over their neighborhoods' features, we enable (implicitly) specifying different weights to different nodes in a neighborhood, without requiring any kind of costly matrix operation (such as inversion) or depending on knowing the graph structure upfront. In this way, we address several key
authors
co-cited works
representative citing papers
PromptGNN-sim uses GAT-based semantically aware neighborhood selection and structure-aware LLM prompts with bi-directional contrastive alignment to outperform prior GNN, LLM, and fusion methods on text-attributed graph datasets.
Proposes equation-grounded taxonomy (unexpected AIS activity, route deviation, close approach) and LLM-guided synthesis pipeline to generate timestamp-labeled anomalies for evaluating maritime detection models.
QuADA-GS learns to predict local complexity-driven Gaussian densification from low-resolution inputs and uses Hierarchical Pointer Convolution for efficient arbitrary-scale super-resolution.
GILP trains a parameterized backbone for valid actions and state predictions, then uses a consistency gate with LLM drafts to reduce hallucinated-state rate from 0.176 to 0.035 on GPT-4o-mini while raising success from 0.668 to 0.838.
GraphNPE recovers a significantly lower central density for Boötes I consistent with a core while Draco remains marginally cuspy, and demonstrates that higher-order velocity moments reduce bias in dynamical modeling.
SciTraj is the first claim-grounded typed citation graph with 32,559 papers and 573,126 edges across six relation types, plus a temporally split link-prediction benchmark.
DS-HGNN achieves lower RMSE for stress and displacement prediction on stiffened panels than six benchmark GNN models and matches top accuracy with 19-38% fewer training samples.
AGDN is a new GNN framework using a MixScore matrix and anisotropic graph diffusion to outperform prior methods on TSP instances across sizes and distributions.
A timestamp-aware spatio-temporal graph contrastive learning model for network intrusion detection outperforms other self-supervised methods on four datasets while matching supervised GNN performance.
SelfTICA reformulates collective-variable discovery as contrastive dynamical representation learning on time-lagged data, decoupling feature learning from slow-mode extraction to produce reusable collective variables from limited or biased trajectories.
Introduces Hypergraph U-Nets with PHPool and PHUnpool operators derived from hierarchical clustering dendrograms for hypergraph reconstruction, classification, and anomaly detection.
An agentic multi-fidelity learning method corrects numerical artifacts in GW-BSE excited-state calculations for 2D bilayers and improves quasiparticle gaps and exciton binding energies.
Benchmark of BINN, GraphPath, and PATH on 2622 TCGA patients shows PATH best for targeted therapy, BINN for survival, none useful for radiation, with GraphPath at 0.92 AUROC on prostate targeted therapy.
EpiFormer improves epitope prediction F1 score by over 40% via early-fusion cross-attention in GNN layers and sparsity-aware objectives, while recovering known biology as emergent behavior.
LightGBM models on citation and diversity features predict exogenous diffusion of quantum computing concepts with R² up to 0.78 while endogenous reinforcement remains largely unpredictable after growth controls, with replications in other fields.
AbstainGNN is a framework that jointly models prediction and abstention in GNNs for graph classification, using a PAC-Bayesian-derived unified objective and two-stage training to achieve better accuracy at given rejection rates than prior abstention methods.
ContrastAD achieves highest mean F1 on all five MTS benchmarks and highest AUC on three by building DTW-based sparse graph snapshots and contrasting divergent pairs with a stable anchor instead of enforcing invariance.
Gaussian Sheaf Neural Networks derive a sheaf Laplacian for Gaussian node features on graphs to preserve their geometric structure during message passing.
NeighborDiv detects graph anomalies via variance of inter-neighbor feature similarities under a new Neighbor-to-Neighbor Diversity Paradigm, achieving SOTA results with zero volatility in zero-shot cross-domain settings.
Contrastive Message Passing lets GNNs apply similarity-preserving transforms to positive edges and dissimilarity-inducing transforms to negative edges via soft positive semidefinite constraints on weights, yielding gains in low-label high-homophily regimes.
GraphIP-Bench is a new unified benchmark showing GNN model extraction succeeds at moderate query budgets while most defenses fail to prevent it or retain verification signals on surrogates.
TopoU-Net is a rank-path U-Net for combinatorial complexes that encodes by lifting cochains upward along incidences, decodes by transporting downward, and merges via skip connections at matched ranks.
CTQWformer fuses continuous-time quantum walks into a graph transformer and recurrent module to outperform standard GNNs and graph kernels on classification benchmarks.
citing papers explorer
-
SINA: A Fully Automated Circuit Schematic Image to Netlist Generator Using Artificial Intelligence
SINA converts circuit schematic images to netlists at 96.67% accuracy using deep learning, OCR, connected-component labeling, and a vision-language model, claimed 2.72x better than prior methods.
-
GRAPE: Graph-Augmented Prototype Explanations for Interactive Medical Image Diagnosis
GRAPE augments prototype medical image classifiers with graph attention for co-occurrence, a mismatch safety check, and open-vocabulary anchoring to support incremental addition of findings from single examples.
-
hia-gat: A Heterogeneous Interaction-Aware Graph Attention Network For Frame-Level Traffic Conflict Risk Prediction On Freeways
HIA-GAT, a heterogeneous graph attention network with conflict-type-aware gating, reports the highest AUC for frame-level risk prediction on NGSIM I-80 and US-101 datasets, with largest gains on lateral (PET) conflicts.
-
Scalable Message-Passing Quantum Graph Neural Networks in the Weisfeiler-Leman Hierarchy
The work constructs a permutation-equivariant quantum GNN that implements message passing at selectable Weisfeiler-Leman levels, supports pre-training on small graphs, and demonstrates readout scalability with simulations up to 56 qubits on synthetic, molecular, and TSP datasets.
-
Dynamic Resilience Assessment of Power Systems With Data Center Load Events Using Physics-Informed Neural Networks
Develops an unsupervised DAE-PINN with implicit backward Euler residual to predict post-disturbance trajectories and applies normalized multi-phase metrics to quantify resilience impacts on a modified IEEE 33-bus feeder.
-
MMGNN: Multi-level, multi-color graph neural networks for molecular property prediction
MMGNN decomposes molecular graphs into multi-color subgraphs by atom-type pairs and applies shared message-passing per subgraph, achieving top macro AUC-ROC of 0.838 on classification and best RMSE on ESOL and FreeSolv among tested models.
-
TimeProVe: Propose, then Verify for Efficient Long Video Temporal Reasoning in Activities of Daily Living
TimeProVe proposes a propose-then-verify framework using lightweight action-based candidate evidence generation followed by targeted VLM verification for efficient long video temporal reasoning, achieving 7.3% improvement on OTB with 75% fewer VLM calls.
-
NNNN: Neural Networks for Newtonian Noise Mitigation at the Einstein Telescope
Convolutional and graph neural networks outperform the Wiener filter by factors of 15-80 in predicting Newtonian noise from single seismic events on synthetic seismometer array data.
-
Learning Cardiac Electrophysiology Digital Twins Through Agentic Discovery of Hybrid Structure
LEADS is an LLM-agent framework that discovers hybrid models for cardiac EP digital twins by treating domain knowledge as an action space, outperforming human-designed and other LLM-based hybrids on synthetic and real data.
-
GraspLLM: Towards Zero-Shot Generalization on Text-Attributed Graphs with LLMs
GraspLLM extracts dataset-agnostic structural patterns via motif contrastive learning and aligns contextual subgraphs to LLM tokens, outperforming prior LLM-based methods on TAGs especially in zero-shot settings.
-
From Coarse to Fine: Managing Temporal Granularity in Spatio-Temporal Data for Fine-Grained Traffic Prediction
STRP is a granularity-aware model that predicts fine-grained spatio-temporal traffic from coarse inputs via tree convolution and inverse dilated convolution, outperforming baselines on six datasets in window-based and duration-based settings.
-
Knowledge-Inclusive Adaptive Physics-Informed Neural Network for Microbial Interaction Modelling
A knowledge-inclusive PINN framework integrates metagenomics literature and network structure with gLV equations to model microbial interactions, achieving up to 53% improvement over prior methods.
-
AIS-Based Vessel Trajectory Prediction Using Memory-Augmented Neural Networks
Memory-augmented neural networks produce consistent performance gains over standard deep learning baselines on AIS vessel trajectory data from the Gulf of Mexico and New York Bight.
-
Beyond Soft Masks: Hard-Perturbation Mixup Explainer for Robust GNN Explainability
HPME proposes hard-perturbation mixup explainer grounded in generalized Graph Information Bottleneck to extract discrete subgraphs and generate in-distribution explanations that outperform soft-mask approaches on synthetic and real datasets.
-
Graph Set Transformer
GST interleaves local graph feature propagation and set-level contextual modeling via gating, outperforming separate GNN+SetTransformer baselines on synthetic set-conditional reasoning and real benchmarks in chemistry and images.
-
Explainable Forecasting of Scientific Breakthroughs from Concept Network Dynamics
A two-stage LightGBM model on 59 features from concept networks forecasts link formation and intensity with ROC-AUC 0.95-0.967 across domains.
-
Bayesian Membership Privacy for Graph Neural Networks
Introduces Bayesian Membership Privacy (BMP) as a sampling-aware node-level privacy definition for GNNs quantified by posterior membership probability, plus an auditing method and benchmark experiments.
-
Deft Scheduling of Dynamic Cloud Workflows with Varying Deadlines via Mixture-of-Experts
DEFT is a Mixture-of-Experts DRL scheduler that uses deadline-sensitive expert routing via graph-adaptive gating to reduce execution cost and deadline violations in dynamic cloud workflows.
-
A Topological Characterization of Graph Neural Networks via Stochastic Block Model Embeddings on the n-Sphere
Trained MPNNs factor through bounded step-graphon-signals that embed via an explicit map into disjoint caps on the n-sphere, producing a topological fingerprint for model comparison and retrieval.
-
Can Subgraph Explanations Be Weaponized to Steal Graph Neural Networks?
The paper demonstrates a black-box model extraction attack on graph classification models that leverages binary subgraph explanations to guide Monte Carlo edge sensitivity estimation with concentration guarantees.
-
Forget Less, Generalize More: Unifying Temporal and Structural Adaptation for Dynamic Graphs
DSRD unifies temporal and structural adaptation for dynamic graphs via a single recurrent retentive state with learnable time-sensitivity parameters in the decay kernels.
-
AlphaTransit: Learning to Design City-scale Transit Routes
AlphaTransit pairs MCTS with a learned policy-value network to reach 54.6% and 82.1% service rates on a Bloomington transit benchmark, outperforming plain RL and plain MCTS baselines.
-
GraphReview: Scientific Paper Evaluation via LLM-Based Graph Message Passing
GraphReview models paper evaluation as LLM-driven message passing on a semantic paper graph that links intrinsic quality, contemporaneous papers, and prior work, then applies Personalized PageRank for ranking and review generation.
-
Learning Dynamic Graph Representations through Timespan View Contrasts
CLDG and CLDG++ learn node representations on dynamic graphs by contrasting timespan views under temporal translation invariance, with extensions for global context via diffusion and integration into anomaly detection.
-
Dynamic Link Prediction with Temporally Enhanced Signed Graph Neural Networks
Introduces HCIM framework with recency weighting, LSTM trajectories, and temporal attention to enhance static signed GNNs, showing statistically significant gains on Bitcoin, Reddit, and synthetic TSN datasets.
-
Invariant-Based Weight Sharing for Message Passing
ShareGNNs implement invariant-indexed weight sharing in an encoder-decoder MPNN, tying expressivity to the chosen invariants and reporting gains on synthetic, real-world, and subgraph counting tasks.
-
Rethinking Feature Alignment in Generalist Graph Anomaly Detection: A Relational Fingerprint-based Approach
ReFi-GAD uses a semantics-aware relational fingerprint and transformer-based model with SNR refinement to align heterogeneous features for generalist graph anomaly detection across unseen graphs.
-
MindAlign: Bridging EEG, Vision, and Language for Zero-Shot Visual Decoding
A tri-modal contrastive learning method for EEG-based zero-shot visual decoding reports 54.1% top-1 accuracy on the Things-EEG2 200-way benchmark, outperforming prior baselines of 32.4%.
-
fMRI-Diffusion: Generating fMRI Time Series Via a Temporal Transformer Diffusion Model for Major Depressive Disorder Diagnosis
fMRI-Diffusion generates synthetic ROI-level fMRI time series via a temporal transformer diffusion model with supervised pretraining, improving MDD diagnostic accuracy by up to 3.7 percentage points over prior FC-matrix synthesis methods on the REST-meta-MDD dataset.
-
Skinned Motion Retargeting with Spatially Adaptive Interaction Guidance
A geometry-aware retargeting method uses Transformer-refined adaptive anchors and a graph autoencoder to preserve interaction semantics like self-contact across characters with exaggerated proportions.
-
ArtifactLinker: Linking Scientific Artifacts for Automatic State-of-the-Art Discovery
ArtifactLinker frames SOTA discovery as missing-link prediction on an artifact graph of models and datasets, with a two-stage ranking-plus-verification pipeline and a new benchmark of 14k artifacts.
-
Virtual Nodes Guided Dynamic Graph Neural Network for Brain Tumor Segmentation with Missing Modalities
A one-stage graph framework with modality-specific virtual nodes and dynamic adjacency adjustment for robust brain tumor segmentation under arbitrary missing MRI modalities, outperforming SOTA on BRATS-2018 and BRATS-2020 incomplete subsets.
-
A finite-element-inspired bipartite graph learned simulator for manufacturability assessment in large-deformation sheet forming
CAttBiGNN is a bipartite GNN with edge-aware cross attention that predicts coupled nodal displacements and elemental thinning for autoregressive rollout of explicit dynamic FE simulations on dome and corner forming benchmarks, outperforming node-centered baselines.
-
CO-MAP: A Reinforcement Learning Approach to the Qubit Allocation Problem
Reinforcement learning policy for qubit mapping reduces SWAP overhead by 65-85% versus standard quantum compilers on MQTBench and Queko benchmark circuits.
-
Weather-Robust Cross-View Geo-Localization via Prototype-Based Semantic Part Discovery
SkyPart achieves state-of-the-art single-pass cross-view geo-localization on SUES-200, University-1652, and DenseUAV by using prototype-based part discovery, altitude-conditioned modulation, and Kendall-weighted loss, with widening gains under weather corruptions.
-
GRASP -- Graph-Based Anomaly Detection Through Self-Supervised Classification
GRASP detects anomalies in system provenance graphs via self-supervised executable prediction from two-hop neighborhoods, outperforming prior PIDS on DARPA datasets by identifying all documented attacks where behaviors are learnable plus additional unlabeled suspicious activity.
-
Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations
Mid-circuit stabilizer verification in six-qubit GSE-encoded Clifford Trotter steps reduces logical error rates by up to 54% on Barium ion hardware, with the gain vanishing if checks are deferred to circuit end.
-
GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model
GCCM prevents shortcut collapse in consistency models for graph prediction by using contrastive negative pairs and input feature perturbation, leading to better performance than deterministic baselines.
-
A Unified Benchmark for Evaluating Knowledge Graph Construction Methods and Graph Neural Networks
A dual-purpose benchmark supplies two text-derived knowledge graphs and one expert reference graph on the same biomedical corpus to jointly measure construction method quality and GNN robustness via semi-supervised node classification.
-
GEM: Graph-Enhanced Mixture-of-Experts with ReAct Agents for Dialogue State Tracking
GEM achieves 65.19% joint goal accuracy on MultiWOZ 2.2 by routing between a graph neural network expert for dialogue structure and a T5 expert for sequences, plus ReAct agents for value generation, outperforming prior SOTA methods.
-
Exploring Sparse Matrix Multiplication Kernels on the Cerebras CS-3
Cerebras CS-3 achieves up to 100x speedup over CPU for SpMM and 20x for SDDMM at 90% sparsity, with performance improving for larger matrices, but becomes slower than CPU beyond 99% sparsity.
-
Do Larger Models Really Win in Drug Discovery? A Benchmark Assessment of Model Scaling in AI-Driven Molecular Property and Activity Prediction
Benchmark across 78 endpoint-split entries finds classical ML winning 47.4% of best performances over pretrained models, GNNs, and LLMs, with performance depending on model-task-split fit rather than scale.
-
Qubit-Scalable CVRP via Lagrangian Knapsack Decomposition and Noise-Aware Quantum Execution
A hybrid quantum framework decomposes CVRP into bounded-width knapsack subproblems, trains a reinforcement learning controller for Lagrangian multipliers, and uses a contextual bandit to adapt quantum hardware execution, yielding improved routing quality on standard test instances.
-
ACT: Anti-Crosstalk Learning for Cross-Sectional Stock Ranking via Temporal Disentanglement and Structural Purification
ACT disentangles temporal scales in stock sequences and purifies structural relations in graphs to achieve state-of-the-art cross-sectional stock ranking on CSI300 and CSI500 with up to 74.25% improvement.
-
TACENR: Task-Agnostic Contrastive Explanations for Node Representations
TACENR introduces a contrastive-learning method that identifies the most influential attribute, proximity, and structural features in node representations in a task-agnostic manner.
-
LoReC: Rethinking Large Language Models for Graph Data Analysis
LoReC enhances LLMs for graph tasks via attention redistribution, graph re-injection into FFN, and logit rectification, yielding improvements over GraphLLM and GNN baselines on diverse datasets.
-
Program Structure-aware Language Models: Targeted Software Testing beyond Textual Semantics
GLMTest integrates code property graphs and GNNs with LLMs to steer test case generation toward targeted branches, raising branch accuracy from 27.4% to 50.2% on the TestGenEval benchmark.
-
TransXion: A High-Fidelity Graph Benchmark for Realistic Anti-Money Laundering
TransXion introduces a synthetic AML transaction benchmark with rich entity profiles and non-template adversarial anomaly synthesis that lowers detection model performance compared to prior benchmarks.
-
DuConTE: Dual-Granularity Text Encoder with Topology-Constrained Attention for Text-attributed Graphs
DuConTE is a dual-granularity text encoder that incorporates graph topology into language model attention for improved node representations in text-attributed graphs.
-
Region-Affinity Attention for Whole-Slide Breast Cancer Classification in Deep Ultraviolet Imaging
A novel Region-Affinity Attention mechanism classifies breast cancer on whole deep ultraviolet slides, achieving 92.67% accuracy and 95.97% AUC on 136 samples while outperforming standard attention methods.