{"list":"other","total":54,"rows":[{"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":"1907.10902","title":"Optuna: A Next-generation Hyperparameter Optimization Framework","created":"2019-07-25","cited_by_count":2501},{"id":"2005.00687","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","created":"2020-05-02","cited_by_count":2163},{"id":"1902.07153","title":"Simplifying Graph Convolutional Networks","created":"2019-02-19","cited_by_count":1477},{"id":"1809.10341","title":"Deep Graph Infomax","created":"2018-09-27","cited_by_count":1106},{"id":"1811.05868","title":"Pitfalls of Graph Neural Network Evaluation","created":"2018-11-14","cited_by_count":1007},{"id":"1810.05997","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","created":"2018-10-14","cited_by_count":993},{"id":"2007.02133","title":"Simple and Deep Graph Convolutional Networks","created":"2020-07-04","cited_by_count":860},{"id":"2105.14491","title":"How Attentive are Graph Attention Networks?","created":"2021-05-30","cited_by_count":835},{"id":"1802.09691","title":"Link Prediction Based on Graph Neural Networks","created":"2018-02-27","cited_by_count":832},{"id":"1907.04931","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","created":"2019-07-10","cited_by_count":618},{"id":"2109.02846","title":"Datasets: A Community Library for Natural Language Processing","created":"2021-09-07","cited_by_count":530},{"id":"2302.11640","title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","created":"2023-02-22","cited_by_count":343},{"id":"1707.03815","title":"Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking","created":"2017-07-12","cited_by_count":335},{"id":"1802.06893","title":"Learning Word Vectors for 157 Languages","created":"2018-02-19","cited_by_count":280},{"id":"2007.02901","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","created":"2020-07-06","cited_by_count":260},{"id":"2002.01169","title":"Graph Representation Learning via Graphical Mutual Information Maximization","created":"2020-02-04","cited_by_count":217},{"id":"2106.06134","title":"Is Homophily a Necessity for Graph Neural Networks?","created":"2021-06-11","cited_by_count":182},{"id":"2202.07082","title":"Graph Neural Networks for Graphs with Heterophily: A Survey","created":"2022-02-14","cited_by_count":175},{"id":"2210.07606","title":"Revisiting Heterophily For Graph Neural Networks","created":"2022-10-14","cited_by_count":169},{"id":"2206.04910","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","created":"2022-06-10","cited_by_count":137},{"id":"2102.11391","title":"MagNet: A Neural Network for Directed Graphs","created":"2021-02-22","cited_by_count":107},{"id":"2305.10498","title":"Edge Directionality Improves Learning on Heterophilic Graphs","created":"2023-05-17","cited_by_count":90},{"id":"1911.05954","title":"Hierarchical Graph Pooling with Structure Learning","created":"2019-11-14","cited_by_count":81},{"id":"2004.13970","title":"Directed Graph Convolutional Network","created":"2020-04-29","cited_by_count":73},{"id":"2302.00049","title":"Transformers Meet Directed Graphs","created":"2023-01-31","cited_by_count":40},{"id":"2302.12432","title":"Graph Neural Networks with Learnable and Optimal Polynomial Bases","created":"2023-02-24","cited_by_count":36},{"id":"2011.02255","title":"On Self-Distilling Graph Neural Network","created":"2020-11-04","cited_by_count":35},{"id":"2303.09778","title":"SE-GSL: A General and Effective Graph Structure Learning Framework through Structural Entropy Optimization","created":"2023-03-17","cited_by_count":35},{"id":"2209.00546","title":"MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplacian","created":"2022-09-01","cited_by_count":28},{"id":"2212.12488","title":"Bring Your Own View: Graph Neural Networks for Link Prediction with Personalized Subgraph Selection","created":"2022-12-23","cited_by_count":26},{"id":"2112.07160","title":"A New Perspective on the Effects of Spectrum in Graph Neural Networks","created":"2021-12-14","cited_by_count":24},{"id":"2206.06561","title":"FreeKD: Free-direction Knowledge Distillation for Graph Neural Networks","created":"2022-06-14","cited_by_count":23},{"id":"2202.12449","title":"Directed Graph Auto-Encoders","created":"2022-02-25","cited_by_count":22},{"id":"2310.04987","title":"Data-centric Graph Learning: A Survey","created":"2023-10-08","cited_by_count":22},{"id":"2010.12609","title":"Iterative Graph Self-Distillation","created":"2020-10-23","cited_by_count":21},{"id":"2201.05540","title":"Compact Graph Structure Learning via Mutual Information Compression","created":"2022-01-14","cited_by_count":20},{"id":"2310.02232","title":"HoloNets: Spectral Convolutions do extend to Directed Graphs","created":"2023-10-03","cited_by_count":20},{"id":"2303.10108","title":"Data-Centric Learning from Unlabeled Graphs with Diffusion Model","created":"2023-03-17","cited_by_count":19},{"id":"2312.04111","title":"Breaking the Entanglement of Homophily and Heterophily in Semi-supervised Node Classification","created":"2023-12-07","cited_by_count":19},{"id":"2107.11789","title":"ROD: Reception-aware Online Distillation for Sparse Graphs","created":"2021-07-25","cited_by_count":18},{"id":"2202.10793","title":"PyTorch Geometric Signed Directed: A Software Package on Graph Neural Networks for Signed and Directed Graphs","created":"2022-02-22","cited_by_count":18},{"id":"2311.17373","title":"The Devil is in the Data: Learning Fair Graph Neural Networks via Partial Knowledge Distillation","created":"2023-11-29","cited_by_count":16},{"id":"2402.06128","title":"Rethinking Node-wise Propagation for Large-scale Graph Learning","created":"2024-02-09","cited_by_count":16},{"id":"2106.05194","title":"DIGRAC: Digraph Clustering Based on Flow Imbalance","created":"2021-06-09","cited_by_count":15},{"id":"2309.10979","title":"Towards Data-centric Graph Machine Learning: Review and Outlook","created":"2023-09-20","cited_by_count":15},{"id":"2206.08583","title":"NAFS: A Simple yet Tough-to-beat Baseline for Graph Representation Learning","created":"2022-06-17","cited_by_count":11},{"id":"2210.10993","title":"A Magnetic Framelet-Based Convolutional Neural Network for Directed Graphs","created":"2022-10-20","cited_by_count":11},{"id":"2401.11772","title":"LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning","created":"2024-01-22","cited_by_count":11},{"id":"2002.00775","title":"Finding large balanced subgraphs in signed networks","created":"2020-02-03","cited_by_count":10},{"id":"2112.11734","title":"D-HYPR: Harnessing Neighborhood Modeling and Asymmetry Preservation for Digraph Representation Learning","created":"2021-12-22","cited_by_count":8},{"id":"2110.07570","title":"MGC: A Complex-Valued Graph Convolutional Network for Directed Graphs","created":"2021-10-14","cited_by_count":7},{"id":"2302.05889","title":"USER: Unsupervised Structural Entropy-based Robust Graph Neural Network","created":"2023-02-12","cited_by_count":5}],"next_cursor":null}