{"list":"other","total":51,"rows":[{"id":"1609.02907","title":"Semi-Supervised Classification with Graph Convolutional Networks","created":"2016-09-09","cited_by_count":11361},{"id":"1710.10903","title":"Graph Attention Networks","created":"2017-10-30","cited_by_count":8923},{"id":"1706.02216","title":"Inductive Representation Learning on Large Graphs","created":"2017-06-07","cited_by_count":6320},{"id":"1810.00826","title":"How Powerful are Graph Neural Networks?","created":"2018-10-01","cited_by_count":4393},{"id":"1704.01212","title":"Neural Message Passing for Quantum Chemistry","created":"2017-04-04","cited_by_count":3487},{"id":"2106.01946","title":"Convex optimization","created":"2021-06-03","cited_by_count":2515},{"id":"2005.00687","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","created":"2020-05-02","cited_by_count":2163},{"id":"1902.07153","title":"Simplifying Graph Convolutional Networks","created":"2019-02-19","cited_by_count":1477},{"id":"2010.13902","title":"Graph Contrastive Learning with Augmentations","created":"2020-10-22","cited_by_count":1208},{"id":"1809.10341","title":"Deep Graph Infomax","created":"2018-09-27","cited_by_count":1106},{"id":"1811.05868","title":"Pitfalls of Graph Neural Network Evaluation","created":"2018-11-14","cited_by_count":1007},{"id":"1711.02257","title":"GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networks","created":"2017-11-07","cited_by_count":834},{"id":"2007.08663","title":"TUDataset: A collection of benchmark datasets for learning with graphs","created":"2020-07-16","cited_by_count":728},{"id":"2205.12454","title":"Recipe for a General, Powerful, Scalable Graph Transformer","created":"2022-05-25","cited_by_count":713},{"id":"1907.10903","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","created":"2019-07-25","cited_by_count":680},{"id":"2006.05205","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","created":"2020-06-09","cited_by_count":631},{"id":"1907.04931","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","created":"2019-07-10","cited_by_count":618},{"id":"1801.10247","title":"FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling","created":"2018-01-30","cited_by_count":584},{"id":"1904.03751","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?","created":"2019-04-07","cited_by_count":527},{"id":"2011.02260","title":"Graph Neural Networks in Recommender Systems: A Survey","created":"2020-11-04","cited_by_count":494},{"id":"2111.14522","title":"Understanding over-squashing and bottlenecks on graphs via curvature","created":"2021-11-29","cited_by_count":478},{"id":"2106.03893","title":"Rethinking Graph Transformers with Spectral Attention","created":"2021-06-07","cited_by_count":473},{"id":"1905.00067","title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","created":"2019-04-30","cited_by_count":443},{"id":"1911.05485","title":"Diffusion Improves Graph Learning","created":"2019-10-28","cited_by_count":414},{"id":"2106.07594","title":"Graph Contrastive Learning Automated","created":"2021-06-10","cited_by_count":287},{"id":"2206.08164","title":"Long Range Graph Benchmark","created":"2022-06-16","cited_by_count":263},{"id":"1603.00856","title":"Molecular Graph Convolutions: Moving Beyond Fingerprints","created":"2016-03-02","cited_by_count":238},{"id":"2005.11079","title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","created":"2020-05-22","cited_by_count":213},{"id":"2006.08149","title":"GNNGuard: Defending Graph Neural Networks against Adversarial Attacks","created":"2020-06-15","cited_by_count":195},{"id":"2102.06514","title":"Large-Scale Representation Learning on Graphs via Bootstrapping","created":"2021-02-12","cited_by_count":186},{"id":"2110.02910","title":"Equivariant Subgraph Aggregation Networks","created":"2021-10-06","cited_by_count":154},{"id":"2111.06283","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","created":"2021-11-11","cited_by_count":118},{"id":"2210.11790","title":"FoSR: First-order spectral rewiring for addressing oversquashing in GNNs","created":"2022-10-21","cited_by_count":105},{"id":"1902.08226","title":"Graph Adversarial Training: Dynamically Regularizing Based on Graph Structure","created":"2019-02-20","cited_by_count":93},{"id":"2406.08993","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","created":"2024-06-13","cited_by_count":85},{"id":"2305.08018","title":"DRew: Dynamically Rewired Message Passing with Delay","created":"2023-05-13","cited_by_count":82},{"id":"2206.07369","title":"DiffWire: Inductive Graph Rewiring via the Lov\\'asz Bound","created":"2022-06-15","cited_by_count":79},{"id":"2301.11956","title":"On the Connection Between MPNN and Graph Transformer","created":"2023-01-27","cited_by_count":61},{"id":"1907.06051","title":"k-hop Graph Neural Networks","created":"2019-07-13","cited_by_count":57},{"id":"2310.01668","title":"Locality-Aware Graph-Rewiring in GNNs","created":"2023-10-02","cited_by_count":56},{"id":"2009.14332","title":"Multi-hop Attention Graph Neural Network","created":"2020-09-29","cited_by_count":53},{"id":"2206.01003","title":"Shortest Path Networks for Graph Property Prediction","created":"2022-06-02","cited_by_count":46},{"id":"2201.12674","title":"Rewiring with Positional Encodings for Graph Neural Networks","created":"2022-01-29","cited_by_count":36},{"id":"2310.00800","title":"GraphPatcher: Mitigating Degree Bias for Graph Neural Networks via Test-time Augmentation","created":"2023-10-01","cited_by_count":31},{"id":"2204.10037","title":"DropMessage: Unifying Random Dropping for Graph Neural Networks","created":"2022-04-21","cited_by_count":29},{"id":"2007.12374","title":"A Survey on Graph Neural Networks for Knowledge Graph Completion","created":"2020-07-24","cited_by_count":26},{"id":"2206.12004","title":"Sampling Enclosing Subgraphs for Link Prediction","created":"2022-06-23","cited_by_count":9},{"id":"2301.12562","title":"Simplifying Subgraph Representation Learning for Scalable Link Prediction","created":"2023-01-29","cited_by_count":7},{"id":"2304.08556","title":"Stochastic Subgraph Neighborhood Pooling for Subgraph Classification","created":"2023-04-17","cited_by_count":3},{"id":"2505.20840","title":"Aggregation Buffer: Revisiting DropEdge with a New Parameter Block","created":"2025-05-27","cited_by_count":3},{"id":"2406.11714","title":"Scalable Expressiveness through Preprocessed Graph Perturbations","created":"2024-06-17","cited_by_count":2}],"next_cursor":null}