{"list":"other","total":110,"rows":[{"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":"1612.00593","title":"PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation","created":"2016-12-02","cited_by_count":5248},{"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":"2005.00687","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","created":"2020-05-02","cited_by_count":2163},{"id":"1606.09375","title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","created":"2016-06-30","cited_by_count":2089},{"id":"1812.08434","title":"Graph Neural Networks: A Review of Methods and Applications","created":"2018-12-20","cited_by_count":1576},{"id":"1703.06114","title":"Deep Sets","created":"2017-03-10","cited_by_count":1421},{"id":"2104.13478","title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","created":"2021-04-27","cited_by_count":1167},{"id":"1602.07576","title":"Group Equivariant Convolutional Networks","created":"2016-02-24","cited_by_count":1165},{"id":"1312.6203","title":"Spectral Networks and Locally Connected Networks on Graphs","created":"2013-12-21","cited_by_count":1102},{"id":"1703.00564","title":"MoleculeNet: A Benchmark for Molecular Machine Learning","created":"2017-03-02","cited_by_count":1051},{"id":"1810.02244","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","created":"2018-10-04","cited_by_count":881},{"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":"2006.05205","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","created":"2020-06-09","cited_by_count":631},{"id":"2003.03123","title":"Directional Message Passing for Molecular Graphs","created":"2020-03-06","cited_by_count":561},{"id":"1611.08402","title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","created":"2016-11-25","cited_by_count":468},{"id":"1701.02426","title":"Scene Graph Generation by Iterative Message Passing","created":"2017-01-10","cited_by_count":462},{"id":"1905.11136","title":"Provably Powerful Graph Networks","created":"2019-05-27","cited_by_count":389},{"id":"1812.09902","title":"Invariant and Equivariant Graph Networks","created":"2018-12-24","cited_by_count":346},{"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":"2007.09296","title":"Towards Deeper Graph Neural Networks","created":"2020-07-18","cited_by_count":296},{"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":"1904.12787","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects","created":"2019-04-29","cited_by_count":205},{"id":"1705.07664","title":"CayleyNets: Graph Convolutional Neural Networks with Complex Rational Spectral Filters","created":"2017-05-22","cited_by_count":203},{"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":"1905.12560","title":"On the equivalence between graph isomorphism testing and function approximation with GNNs","created":"2019-05-29","cited_by_count":172},{"id":"1711.08920","title":"SplineCNN: Fast Geometric Deep Learning with Continuous B-Spline Kernels","created":"2017-11-24","cited_by_count":161},{"id":"1905.13211","title":"What Can Neural Networks Reason About?","created":"2019-05-30","cited_by_count":159},{"id":"2005.03675","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","created":"2020-05-07","cited_by_count":156},{"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":"1901.09342","title":"On the Universality of Invariant Networks","created":"2019-01-27","cited_by_count":152},{"id":"1903.02541","title":"Relational Pooling for Graph Representations","created":"2019-03-06","cited_by_count":150},{"id":"1903.11835","title":"A Survey on Graph Kernels","created":"2019-03-28","cited_by_count":148},{"id":"1702.08389","title":"Equivariance Through Parameter-Sharing","created":"2017-02-27","cited_by_count":141},{"id":"2110.13197","title":"Nested Graph Neural Networks","created":"2021-10-25","cited_by_count":137},{"id":"2010.02863","title":"Directional Graph Networks","created":"2020-10-06","cited_by_count":133},{"id":"1804.10306","title":"Universal approximations of invariant maps by neural networks","created":"2018-04-26","cited_by_count":127},{"id":"2111.06283","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","created":"2021-11-11","cited_by_count":118},{"id":"1906.01277","title":"Wasserstein Weisfeiler-Lehman Graph Kernels","created":"2019-06-04","cited_by_count":104},{"id":"2106.04319","title":"Breaking the Limits of Message Passing Graph Neural Networks","created":"2021-06-08","cited_by_count":101},{"id":"1811.01900","title":"Janossy Pooling: Learning Deep Permutation-Invariant Functions for Variable-Size Inputs","created":"2018-11-05","cited_by_count":98},{"id":"2002.08599","title":"On Learning Sets of Symmetric Elements","created":"2020-02-20","cited_by_count":98},{"id":"2106.01798","title":"Implicit MLE: Backpropagating Through Discrete Exponential Family Distributions","created":"2021-06-03","cited_by_count":98},{"id":"2006.15107","title":"Building powerful and equivariant graph neural networks with structural message-passing","created":"2020-06-26","cited_by_count":97},{"id":"1805.00165","title":"Convolutional Neural Network Architectures for Signals Supported on Graphs","created":"2018-05-01","cited_by_count":95},{"id":"2102.10333","title":"Provably Strict Generalisation Benefit for Equivariant Models","created":"2021-02-20","cited_by_count":91},{"id":"1808.05689","title":"SimGNN: A Neural Network Approach to Fast Graph Similarity Computation","created":"2018-08-16","cited_by_count":90},{"id":"2102.13219","title":"Learning with invariances in random features and kernel models","created":"2021-02-25","cited_by_count":89},{"id":"2102.07835","title":"Topological Graph Neural Networks","created":"2021-02-15","cited_by_count":87},{"id":"2001.09621","title":"Deep Graph Matching Consensus","created":"2020-01-27","cited_by_count":85},{"id":"2012.07690","title":"A PAC-Bayesian Approach to Generalization Bounds for Graph Neural Networks","created":"2020-12-14","cited_by_count":85},{"id":"2104.14624","title":"The Logic of Graph Neural Networks","created":"2021-04-29","cited_by_count":85},{"id":"1709.05454","title":"Statistical inference on random dot product graphs: a survey","created":"2017-09-16","cited_by_count":70},{"id":"2110.00577","title":"Reconstruction for Powerful Graph Representations","created":"2021-10-01","cited_by_count":65},{"id":"2011.03854","title":"Graph Kernels: State-of-the-Art and Future Challenges","created":"2020-11-07","cited_by_count":63},{"id":"2006.12179","title":"Hierarchical Inter-Message Passing for Learning on Molecular Graphs","created":"2020-06-22","cited_by_count":59},{"id":"2105.04550","title":"Optimization of Graph Neural Networks: Implicit Acceleration by Skip Connections and More Depth","created":"2021-05-10","cited_by_count":55},{"id":"1801.02144","title":"Covariant Compositional Networks For Learning Graphs","created":"2018-01-07","cited_by_count":54},{"id":"1912.06058","title":"Coloring graph neural networks for node disambiguation","created":"2019-12-12","cited_by_count":52},{"id":"2106.06707","title":"Graph Neural Networks with Local Graph Parameters","created":"2021-06-12","cited_by_count":52},{"id":"1606.01141","title":"On Valid Optimal Assignment Kernels and Applications to Graph Classification","created":"2016-06-03","cited_by_count":49},{"id":"2002.02912","title":"Universal Equivariant Multilayer Perceptrons","created":"2020-02-07","cited_by_count":49},{"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":"1809.04440","title":"Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching","created":"2018-09-10","cited_by_count":46},{"id":"1910.02421","title":"On Universal Equivariant Set Networks","created":"2019-10-06","cited_by_count":45},{"id":"1802.05451","title":"Mapping Images to Scene Graphs with Permutation-Invariant Structured Prediction","created":"2018-02-15","cited_by_count":44},{"id":"1610.04574","title":"Generalization Error of Invariant Classifiers","created":"2016-10-14","cited_by_count":42},{"id":"2103.01710","title":"Autobahn: Automorphism-based Graph Neural Nets","created":"2021-03-02","cited_by_count":39},{"id":"2007.12035","title":"The expressive power of kth-order invariant graph networks","created":"2020-07-23","cited_by_count":34},{"id":"1603.06186","title":"The Multiscale Laplacian Graph Kernel","created":"2016-03-20","cited_by_count":31},{"id":"1610.00064","title":"Faster Kernels for Graphs with Continuous Attributes via Hashing","created":"2016-10-01","cited_by_count":31},{"id":"1802.08876","title":"Lov\\'asz Meets Weisfeiler and Leman","created":"2018-02-24","cited_by_count":27},{"id":"2005.01214","title":"Graph Homomorphism Convolution","created":"2020-05-03","cited_by_count":27},{"id":"2105.13099","title":"On the Universality of Graph Neural Networks on Large Random Graphs","created":"2021-05-27","cited_by_count":26},{"id":"2004.02593","title":"Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework","created":"2020-04-06","cited_by_count":24},{"id":"1512.03547","title":"Graph Isomorphism in Quasipolynomial Time","created":"2015-12-11","cited_by_count":19},{"id":"1910.03802","title":"A Simple Proof of the Universality of Invariant/Equivariant Graph Neural Networks","created":"2019-10-09","cited_by_count":19},{"id":"1905.11460","title":"Incidence Networks for Geometric Deep Learning","created":"2019-05-27","cited_by_count":17},{"id":"2107.10957","title":"Ego-GNNs: Exploiting Ego Structures in Graph Neural Networks","created":"2021-07-22","cited_by_count":17},{"id":"1509.08251","title":"Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement","created":"2015-09-28","cited_by_count":16},{"id":"1802.05908","title":"Recognizing Cuneiform Signs Using Graph Based Methods","created":"2018-02-16","cited_by_count":14},{"id":"1901.05179","title":"A Functional Representation for Graph Matching","created":"2019-01-16","cited_by_count":13},{"id":"2005.10182","title":"The Iteration Number of Colour Refinement","created":"2020-05-20","cited_by_count":12},{"id":"1503.08792","title":"Graphs Identified by Logics with Counting","created":"2015-03-30","cited_by_count":11},{"id":"1708.07354","title":"The Weisfeiler-Leman Dimension of Planar Graphs is at most 3","created":"2017-08-24","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":"2006.07846","title":"Global Attention Improves Graph Networks Generalization","created":"2020-06-14","cited_by_count":9},{"id":"1605.03480","title":"Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic","created":"2016-05-11","cited_by_count":7}],"next_cursor":"100"}