{"list":"other","total":60,"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":"1901.00596","title":"A Comprehensive Survey on Graph Neural Networks","created":"2019-01-03","cited_by_count":2919},{"id":"1611.01144","title":"Categorical Reparameterization with Gumbel-Softmax","created":"2016-11-03","cited_by_count":2739},{"id":"1903.02428","title":"Fast Graph Representation Learning with PyTorch Geometric","created":"2019-03-06","cited_by_count":2434},{"id":"1801.07829","title":"Dynamic Graph CNN for Learning on Point Clouds","created":"2018-01-24","cited_by_count":2223},{"id":"1611.00712","title":"The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables","created":"2016-11-02","cited_by_count":1148},{"id":"1801.07606","title":"Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning","created":"2018-01-22","cited_by_count":1102},{"id":"1603.08861","title":"Revisiting Semi-Supervised Learning with Graph Embeddings","created":"2016-03-29","cited_by_count":976},{"id":"1810.02244","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","created":"2018-10-04","cited_by_count":881},{"id":"2007.02133","title":"Simple and Deep Graph Convolutional Networks","created":"2020-07-04","cited_by_count":860},{"id":"2002.05287","title":"Geom-GCN: Geometric Graph Convolutional Networks","created":"2020-02-13","cited_by_count":826},{"id":"1511.05493","title":"Gated Graph Sequence Neural Networks","created":"2015-11-17","cited_by_count":796},{"id":"1806.08804","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","created":"2018-06-22","cited_by_count":787},{"id":"1509.09292","title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","created":"2015-09-30","cited_by_count":754},{"id":"2007.08663","title":"TUDataset: A collection of benchmark datasets for learning with graphs","created":"2020-07-16","cited_by_count":728},{"id":"2012.09699","title":"A Generalization of Transformer Networks to Graphs","created":"2020-12-17","cited_by_count":661},{"id":"2006.05205","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","created":"2020-06-09","cited_by_count":631},{"id":"1911.06455","title":"Graph Transformer Networks","created":"2019-11-06","cited_by_count":523},{"id":"2009.03509","title":"Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification","created":"2020-09-08","cited_by_count":506},{"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":"1911.05485","title":"Diffusion Improves Graph Learning","created":"2019-10-28","cited_by_count":414},{"id":"1905.11136","title":"Provably Powerful Graph Networks","created":"2019-05-27","cited_by_count":389},{"id":"1711.07553","title":"Residual Gated Graph ConvNets","created":"2017-11-20","cited_by_count":346},{"id":"2302.11640","title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","created":"2023-02-22","cited_by_count":343},{"id":"2006.09252","title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","created":"2020-06-16","cited_by_count":313},{"id":"1704.02901","title":"Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs","created":"2017-04-10","cited_by_count":310},{"id":"1909.12223","title":"PairNorm: Tackling Oversmoothing in GNNs","created":"2019-09-26","cited_by_count":297},{"id":"2206.08164","title":"Long Range Graph Benchmark","created":"2022-06-16","cited_by_count":263},{"id":"1912.09893","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","created":"2019-12-20","cited_by_count":244},{"id":"1802.00543","title":"Modeling polypharmacy side effects with graph convolutional networks","created":"2018-02-02","cited_by_count":237},{"id":"2106.12575","title":"Weisfeiler and Lehman Go Cellular: CW Networks","created":"2021-06-23","cited_by_count":218},{"id":"2202.04579","title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","created":"2022-02-09","cited_by_count":214},{"id":"1907.03199","title":"What graph neural networks cannot learn: depth vs width","created":"2019-07-06","cited_by_count":201},{"id":"2010.01179","title":"The Surprising Power of Graph Neural Networks with Random Node Initialization","created":"2020-10-02","cited_by_count":198},{"id":"2101.10320","title":"Identity-aware Graph Neural Networks","created":"2021-01-25","cited_by_count":198},{"id":"2002.03155","title":"Random Features Strengthen Graph Neural Networks","created":"2020-02-08","cited_by_count":186},{"id":"1905.04943","title":"Universal Invariant and Equivariant Graph Neural Networks","created":"2019-05-13","cited_by_count":183},{"id":"2303.06147","title":"Exphormer: Sparse Transformers for Graphs","created":"2023-03-10","cited_by_count":170},{"id":"2302.02941","title":"On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topology","created":"2023-02-06","cited_by_count":166},{"id":"2110.02910","title":"Equivariant Subgraph Aggregation Networks","created":"2021-10-06","cited_by_count":154},{"id":"2305.17589","title":"Graph Inductive Biases in Transformers without Message Passing","created":"2023-05-27","cited_by_count":153},{"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":"2212.13350","title":"A Generalization of ViT/MLP-Mixer to Graphs","created":"2022-12-27","cited_by_count":93},{"id":"2309.00367","title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","created":"2023-09-01","cited_by_count":85},{"id":"2305.08018","title":"DRew: Dynamically Rewired Message Passing with Delay","created":"2023-05-13","cited_by_count":82},{"id":"2201.00232","title":"Towards Robust Graph Neural Networks for Noisy Graphs with Sparse Labels","created":"2022-01-01","cited_by_count":63},{"id":"2106.06707","title":"Graph Neural Networks with Local Graph Parameters","created":"2021-06-12","cited_by_count":52},{"id":"2210.00513","title":"Gradient Gating for Deep Multi-Rate Learning on Graphs","created":"2022-10-02","cited_by_count":49},{"id":"2006.15097","title":"Policy-GNN: Aggregation Optimization for Graph Neural Networks","created":"2020-06-26","cited_by_count":48},{"id":"2102.08786","title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","created":"2021-02-17","cited_by_count":47},{"id":"2206.01003","title":"Shortest Path Networks for Graph Property Prediction","created":"2022-06-02","cited_by_count":46},{"id":"2103.01710","title":"Autobahn: Automorphism-based Graph Neural Nets","created":"2021-03-02","cited_by_count":39},{"id":"2305.10544","title":"Tractable Probabilistic Graph Representation Learning with Graph-Induced Sum-Product Networks","created":"2023-05-17","cited_by_count":7},{"id":"2205.12245","title":"Asynchronous Neural Networks for Learning in Graphs","created":"2022-05-24","cited_by_count":4}],"next_cursor":null}