{"list":"other","total":60,"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":"1912.01703","title":"PyTorch: An Imperative Style, High-Performance Deep Learning Library","created":"2019-12-03","cited_by_count":20305},{"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":"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":"2005.00687","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","created":"2020-05-02","cited_by_count":2163},{"id":"1607.00653","title":"node2vec: Scalable Feature Learning for Networks","created":"2016-07-03","cited_by_count":1918},{"id":"1403.6652","title":"DeepWalk: Online Learning of Social Representations","created":"2014-03-26","cited_by_count":1547},{"id":"1806.01261","title":"Relational inductive biases, deep learning, and graph networks","created":"2018-06-04","cited_by_count":1360},{"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":"1703.00564","title":"MoleculeNet: A Benchmark for Molecular Machine Learning","created":"2017-03-02","cited_by_count":1051},{"id":"2002.04745","title":"On Layer Normalization in the Transformer Architecture","created":"2020-02-12","cited_by_count":922},{"id":"1810.02244","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","created":"2018-10-04","cited_by_count":881},{"id":"2105.14491","title":"How Attentive are Graph Attention Networks?","created":"2021-05-30","cited_by_count":835},{"id":"1903.03894","title":"GNNExplainer: Generating Explanations for Graph Neural Networks","created":"2019-03-10","cited_by_count":737},{"id":"2007.08663","title":"TUDataset: A collection of benchmark datasets for learning with graphs","created":"2020-07-16","cited_by_count":728},{"id":"2003.00982","title":"Benchmarking Graph Neural Networks","created":"2020-03-02","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":"1905.07953","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","created":"2019-05-20","cited_by_count":541},{"id":"1904.03751","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?","created":"2019-04-07","cited_by_count":527},{"id":"2004.05718","title":"Principal Neighbourhood Aggregation for Graph Nets","created":"2020-04-12","cited_by_count":478},{"id":"1905.11136","title":"Provably Powerful Graph Networks","created":"2019-05-27","cited_by_count":389},{"id":"2110.07875","title":"Graph Neural Networks with Learnable Structural and Positional Representations","created":"2021-10-15","cited_by_count":333},{"id":"2006.09252","title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","created":"2020-06-16","cited_by_count":313},{"id":"2007.09296","title":"Towards Deeper Graph Neural Networks","created":"2020-07-18","cited_by_count":296},{"id":"1912.09893","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","created":"2019-12-20","cited_by_count":244},{"id":"2106.12575","title":"Weisfeiler and Lehman Go Cellular: CW Networks","created":"2021-06-23","cited_by_count":218},{"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":"2002.03155","title":"Random Features Strengthen Graph Neural Networks","created":"2020-02-08","cited_by_count":186},{"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":"2106.07476","title":"Training Graph Neural Networks with 1000 Layers","created":"2021-06-14","cited_by_count":169},{"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":"2010.02863","title":"Directional Graph Networks","created":"2020-10-06","cited_by_count":133},{"id":"2111.06283","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","created":"2021-11-11","cited_by_count":118},{"id":"2006.15107","title":"Building powerful and equivariant graph neural networks with structural message-passing","created":"2020-06-26","cited_by_count":97},{"id":"2010.11418","title":"Rethinking pooling in graph neural networks","created":"2020-10-22","cited_by_count":73},{"id":"2110.00577","title":"Reconstruction for Powerful Graph Representations","created":"2021-10-01","cited_by_count":65},{"id":"2204.04661","title":"Expressiveness and Approximation Properties of Graph Neural Networks","created":"2022-04-10","cited_by_count":64},{"id":"2006.12179","title":"Hierarchical Inter-Message Passing for Learning on Molecular Graphs","created":"2020-06-22","cited_by_count":59},{"id":"2201.07083","title":"A Short Tutorial on The Weisfeiler-Lehman Test And Its Variants","created":"2022-01-18","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":"2202.11097","title":"Message passing all the way up","created":"2022-02-22","cited_by_count":47},{"id":"2110.14363","title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","created":"2021-10-27","cited_by_count":39},{"id":"2203.13913","title":"SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks","created":"2022-03-25","cited_by_count":37},{"id":"1603.07504","title":"A General Framework for Estimating Graphlet Statistics via Random Walk","created":"2016-03-24","cited_by_count":10},{"id":"1504.00954","title":"Approximately Counting Triangles in Sublinear Time","created":"2015-04-03","cited_by_count":6},{"id":"2006.11947","title":"How to Count Triangles, without Seeing the Whole Graph","created":"2020-06-22","cited_by_count":6},{"id":"2006.09499","title":"Walk Message Passing Neural Networks and Second-Order Graph Neural Networks","created":"2020-06-16","cited_by_count":4},{"id":"1605.03719","title":"Distributed Testing of Excluded Subgraphs","created":"2016-05-12","cited_by_count":1},{"id":"1705.04033","title":"Distributed Property Testing for Subgraph-Freeness Revisited","created":"2017-05-11","cited_by_count":1}],"next_cursor":null}