{"list":"other","total":60,"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":"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":"1606.09375","title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","created":"2016-06-30","cited_by_count":2089},{"id":"1312.6203","title":"Spectral Networks and Locally Connected Networks on Graphs","created":"2013-12-21","cited_by_count":1102},{"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":"1611.08402","title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","created":"2016-11-25","cited_by_count":468},{"id":"1905.11136","title":"Provably Powerful Graph Networks","created":"2019-05-27","cited_by_count":389},{"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":"2002.04025","title":"Can Graph Neural Networks Count Substructures?","created":"2020-02-10","cited_by_count":236},{"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":"2002.03155","title":"Random Features Strengthen Graph Neural Networks","created":"2020-02-08","cited_by_count":186},{"id":"2208.09481","title":"Graph neural networks for materials science and chemistry","created":"2022-08-05","cited_by_count":182},{"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":"2005.03675","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","created":"2020-05-07","cited_by_count":156},{"id":"1905.04497","title":"Stability Properties of Graph Neural Networks","created":"2019-05-11","cited_by_count":127},{"id":"2112.09992","title":"Weisfeiler and Leman go Machine Learning: The Story so far","created":"2021-12-18","cited_by_count":122},{"id":"1805.00165","title":"Convolutional Neural Network Architectures for Signals Supported on Graphs","created":"2018-05-01","cited_by_count":95},{"id":"2104.14624","title":"The Logic of Graph Neural Networks","created":"2021-04-29","cited_by_count":85},{"id":"2006.01868","title":"Convergence and Stability of Graph Convolutional Networks on Large Random Graphs","created":"2020-06-02","cited_by_count":76},{"id":"2204.04661","title":"Expressiveness and Approximation Properties of Graph Neural Networks","created":"2022-04-10","cited_by_count":64},{"id":"1811.04801","title":"On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties","created":"2018-11-09","cited_by_count":63},{"id":"2202.00645","title":"Generalization Analysis of Message Passing Neural Networks on Large Random Graphs","created":"2022-02-01","cited_by_count":59},{"id":"2109.10096","title":"Transferability of Graph Neural Networks: an Extended Graphon Approach","created":"2021-09-21","cited_by_count":53},{"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":"2210.01906","title":"Tree Mover's Distance: Bridging Graph Metrics and Stability of Graph Neural Networks","created":"2022-10-04","cited_by_count":41},{"id":"2003.12590","title":"word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data","created":"2020-03-27","cited_by_count":38},{"id":"2302.11556","title":"Equivariant Polynomials for Graph Neural Networks","created":"2023-02-22","cited_by_count":38},{"id":"2003.05030","title":"Graphon Signal Processing","created":"2020-03-10","cited_by_count":37},{"id":"2203.13913","title":"SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks","created":"2022-03-25","cited_by_count":37},{"id":"2007.12035","title":"The expressive power of kth-order invariant graph networks","created":"2020-07-23","cited_by_count":34},{"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":"2303.04613","title":"The Descriptive Complexity of Graph Neural Networks","created":"2023-03-08","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":"2211.03232","title":"Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks","created":"2022-11-06","cited_by_count":21},{"id":"2302.11603","title":"Some Might Say All You Need Is Sum","created":"2023-02-22","cited_by_count":21},{"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":"2105.05911","title":"The Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs","created":"2021-05-12","cited_by_count":19},{"id":"1704.01023","title":"On the Combinatorial Power of the Weisfeiler-Lehman Algorithm","created":"2017-04-04","cited_by_count":18},{"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":"2202.02495","title":"Weisfeiler-Lehman meets Gromov-Wasserstein","created":"2022-02-05","cited_by_count":14},{"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":"1605.03480","title":"Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic","created":"2016-05-11","cited_by_count":7},{"id":"2302.00713","title":"The Weisfeiler-Lehman Distance: Reinterpretation and Connection with GNNs","created":"2023-02-01","cited_by_count":7},{"id":"1905.03008","title":"Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm","created":"2019-05-08","cited_by_count":5},{"id":"1908.05268","title":"The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs","created":"2019-08-14","cited_by_count":4},{"id":"2003.10935","title":"Deep Weisfeiler Leman","created":"2020-03-24","cited_by_count":4},{"id":"2301.13317","title":"The Iteration Number of the Weisfeiler-Leman Algorithm","created":"2023-01-30","cited_by_count":2}],"next_cursor":null}