{"list":"other","total":60,"rows":[{"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":"1502.03167","title":"Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift","created":"2015-02-11","cited_by_count":7005},{"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":"1903.02428","title":"Fast Graph Representation Learning with PyTorch Geometric","created":"2019-03-06","cited_by_count":2434},{"id":"1703.00564","title":"MoleculeNet: A Benchmark for Molecular Machine Learning","created":"2017-03-02","cited_by_count":1051},{"id":"1611.08097","title":"Geometric deep learning: going beyond Euclidean data","created":"2016-11-24","cited_by_count":1048},{"id":"1905.12265","title":"Strategies for Pre-training Graph Neural Networks","created":"2019-05-29","cited_by_count":971},{"id":"1810.02244","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","created":"2018-10-04","cited_by_count":881},{"id":"1902.07243","title":"Graph Neural Networks for Social Recommendation","created":"2019-02-19","cited_by_count":714},{"id":"2003.00982","title":"Benchmarking Graph Neural Networks","created":"2020-03-02","cited_by_count":680},{"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":"1711.07553","title":"Residual Gated Graph ConvNets","created":"2017-11-20","cited_by_count":346},{"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":"2206.08164","title":"Long Range Graph Benchmark","created":"2022-06-16","cited_by_count":263},{"id":"2002.04025","title":"Can Graph Neural Networks Count Substructures?","created":"2020-02-10","cited_by_count":236},{"id":"2106.12575","title":"Weisfeiler and Lehman Go Cellular: CW Networks","created":"2021-06-23","cited_by_count":218},{"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":"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":"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":"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":"1902.06673","title":"Fake News Detection on Social Media using Geometric Deep Learning","created":"2019-02-10","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":"2106.04319","title":"Breaking the Limits of Message Passing Graph Neural Networks","created":"2021-06-08","cited_by_count":101},{"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":"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":"2006.12179","title":"Hierarchical Inter-Message Passing for Learning on Molecular Graphs","created":"2020-06-22","cited_by_count":59},{"id":"2206.11168","title":"Ordered Subgraph Aggregation Networks","created":"2022-06-22","cited_by_count":57},{"id":"2210.13978","title":"Boosting the Cycle Counting Power of Graph Neural Networks with I$^2$-GNNs","created":"2022-10-22","cited_by_count":56},{"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":"2206.01003","title":"Shortest Path Networks for Graph Property Prediction","created":"2022-06-02","cited_by_count":46},{"id":"2401.08514","title":"Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness","created":"2024-01-16","cited_by_count":39},{"id":"2304.07702","title":"An Empirical Study of Realized GNN Expressiveness","created":"2023-04-16","cited_by_count":33},{"id":"2306.05955","title":"Path Neural Networks: Expressive and Accurate Graph Neural Networks","created":"2023-06-09","cited_by_count":32},{"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":"2210.15956","title":"Generalized Laplacian Positional Encoding for Graph Representation Learning","created":"2022-10-28","cited_by_count":21},{"id":"2402.08595","title":"Homomorphism Counts for Graph Neural Networks: All About That Basis","created":"2024-02-13","cited_by_count":16},{"id":"1705.01595","title":"Homomorphisms Are a Good Basis for Counting Small Subgraphs","created":"2017-05-03","cited_by_count":14},{"id":"2309.04941","title":"Distance-Restricted Folklore Weisfeiler-Leman GNNs with Provable Cycle Counting Power","created":"2023-09-10","cited_by_count":12},{"id":"2307.01180","title":"PlanE: Representation Learning over Planar Graphs","created":"2023-07-03","cited_by_count":11},{"id":"2306.05838","title":"Expectation-Complete Graph Representations with Homomorphisms","created":"2023-06-09","cited_by_count":10},{"id":"2309.17053","title":"On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters","created":"2023-09-29","cited_by_count":6},{"id":"1907.08252","title":"Message passing on networks with loops","created":"2019-07-18","cited_by_count":2}],"next_cursor":null}