{"list":"other","total":54,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"1412.6980","title":"Adam: A Method for Stochastic Optimization","created":"2014-12-22","cited_by_count":37240},{"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":"1607.06450","title":"Layer Normalization","created":"2016-07-21","cited_by_count":5669},{"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":"2003.00982","title":"Benchmarking Graph Neural Networks","created":"2020-03-02","cited_by_count":680},{"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":"2004.05718","title":"Principal Neighbourhood Aggregation for Graph Nets","created":"2020-04-12","cited_by_count":478},{"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":"1711.07553","title":"Residual Gated Graph ConvNets","created":"2017-11-20","cited_by_count":346},{"id":"2002.04025","title":"Can Graph Neural Networks Count Substructures?","created":"2020-02-10","cited_by_count":236},{"id":"2103.03212","title":"Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks","created":"2021-03-04","cited_by_count":221},{"id":"2002.06157","title":"Generalization and Representational Limits of Graph Neural Networks","created":"2020-02-14","cited_by_count":218},{"id":"2106.12575","title":"Weisfeiler and Lehman Go Cellular: CW Networks","created":"2021-06-23","cited_by_count":218},{"id":"1905.04943","title":"Universal Invariant and Equivariant Graph Neural Networks","created":"2019-05-13","cited_by_count":183},{"id":"2202.13013","title":"Sign and Basis Invariant Networks for Spectral Graph Representation Learning","created":"2022-02-25","cited_by_count":179},{"id":"1905.12560","title":"On the equivalence between graph isomorphism testing and function approximation with GNNs","created":"2019-05-29","cited_by_count":172},{"id":"2110.03753","title":"From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awareness","created":"2021-10-07","cited_by_count":155},{"id":"2110.02910","title":"Equivariant Subgraph Aggregation Networks","created":"2021-10-06","cited_by_count":154},{"id":"2110.13197","title":"Nested Graph Neural Networks","created":"2021-10-25","cited_by_count":137},{"id":"2112.09992","title":"Weisfeiler and Leman go Machine Learning: The Story so far","created":"2021-12-18","cited_by_count":122},{"id":"2111.06283","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","created":"2021-11-11","cited_by_count":118},{"id":"2206.11140","title":"Understanding and Extending Subgraph GNNs by Rethinking Their Symmetries","created":"2022-06-22","cited_by_count":112},{"id":"2003.04078","title":"A Survey on The Expressive Power of Graph Neural Networks","created":"2020-03-09","cited_by_count":111},{"id":"2106.04319","title":"Breaking the Limits of Message Passing Graph Neural Networks","created":"2021-06-08","cited_by_count":101},{"id":"2006.15646","title":"Expressive Power of Invariant and Equivariant Graph Neural Networks","created":"2020-06-28","cited_by_count":100},{"id":"2006.15107","title":"Building powerful and equivariant graph neural networks with structural message-passing","created":"2020-06-26","cited_by_count":97},{"id":"2205.13328","title":"How Powerful are K-hop Message Passing Graph Neural Networks","created":"2022-05-26","cited_by_count":90},{"id":"2102.07835","title":"Topological Graph Neural Networks","created":"2021-02-15","cited_by_count":87},{"id":"2210.01765","title":"One Transformer Can Understand Both 2D & 3D Molecular Data","created":"2022-10-04","cited_by_count":77},{"id":"2110.00577","title":"Reconstruction for Powerful Graph Representations","created":"2021-10-01","cited_by_count":65},{"id":"2203.04810","title":"Benchmarking Graphormer on Large-Scale Molecular Modeling Datasets","created":"2022-03-09","cited_by_count":64},{"id":"2204.04661","title":"Expressiveness and Approximation Properties of Graph Neural Networks","created":"2022-04-10","cited_by_count":64},{"id":"2206.11168","title":"Ordered Subgraph Aggregation Networks","created":"2022-06-22","cited_by_count":57},{"id":"2205.13401","title":"Your Transformer May Not be as Powerful as You Expect","created":"2022-05-26","cited_by_count":55},{"id":"2106.06707","title":"Graph Neural Networks with Local Graph Parameters","created":"2021-06-12","cited_by_count":52},{"id":"2201.12884","title":"A Theoretical Comparison of Graph Neural Network Extensions","created":"2022-01-30","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":"2202.11097","title":"Message passing all the way up","created":"2022-02-22","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":"2203.13913","title":"SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks","created":"2022-03-25","cited_by_count":37},{"id":"2007.08349","title":"Natural Graph Networks","created":"2020-07-16","cited_by_count":35},{"id":"2206.11941","title":"Affinity-Aware Graph Networks","created":"2022-06-23","cited_by_count":17},{"id":"2201.13410","title":"Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings","created":"2022-01-31","cited_by_count":15},{"id":"2105.07264","title":"Neural Trees for Learning on Graphs","created":"2021-05-15","cited_by_count":13},{"id":"2106.08279","title":"First Place Solution of KDD Cup 2021 & OGB Large-Scale Challenge Graph Prediction Track","created":"2021-06-15","cited_by_count":10},{"id":"1904.01543","title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","created":"2019-04-02","cited_by_count":9},{"id":"2009.00142","title":"Distance Encoding: Design Provably More Powerful Neural Networks for Graph Representation Learning","created":"2020-08-31","cited_by_count":9}],"next_cursor":null}