{"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":"1706.02216","title":"Inductive Representation Learning on Large Graphs","created":"2017-06-07","cited_by_count":6320},{"id":"1704.01212","title":"Neural Message Passing for Quantum Chemistry","created":"2017-04-04","cited_by_count":3487},{"id":"1901.00596","title":"A Comprehensive Survey on Graph Neural Networks","created":"2019-01-03","cited_by_count":2919},{"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":"1902.07153","title":"Simplifying Graph Convolutional Networks","created":"2019-02-19","cited_by_count":1477},{"id":"1810.05997","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","created":"2018-10-14","cited_by_count":993},{"id":"1907.04931","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","created":"2019-07-10","cited_by_count":618},{"id":"2006.05929","title":"Dataset Condensation with Gradient Matching","created":"2020-06-10","cited_by_count":516},{"id":"2203.11932","title":"Dataset Distillation by Matching Training Trajectories","created":"2022-03-22","cited_by_count":442},{"id":"1908.01000","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","created":"2019-07-31","cited_by_count":441},{"id":"1911.05485","title":"Diffusion Improves Graph Learning","created":"2019-10-28","cited_by_count":414},{"id":"2110.04181","title":"Dataset Condensation with Distribution Matching","created":"2021-10-08","cited_by_count":365},{"id":"2011.00050","title":"Dataset Meta-Learning from Kernel Ridge-Regression","created":"2020-10-30","cited_by_count":230},{"id":"2110.07580","title":"Graph Condensation for Graph Neural Networks","created":"2021-10-14","cited_by_count":150},{"id":"1601.02513","title":"How to learn a graph from smooth signals","created":"2016-01-11","cited_by_count":146},{"id":"2202.08235","title":"Data Augmentation for Deep Graph Learning: A Survey","created":"2022-02-16","cited_by_count":133},{"id":"2301.07014","title":"Dataset Distillation: A Comprehensive Review","created":"2023-01-17","cited_by_count":127},{"id":"2011.14867","title":"A Survey on Heterogeneous Graph Embedding: Methods, Techniques, Applications and Sources","created":"2020-11-30","cited_by_count":126},{"id":"2102.06790","title":"A Unified Lottery Ticket Hypothesis for Graph Neural Networks","created":"2021-02-12","cited_by_count":118},{"id":"2301.05603","title":"A Comprehensive Survey of Dataset Distillation","created":"2023-01-13","cited_by_count":115},{"id":"2206.07746","title":"Condensing Graphs via One-Step Gradient Matching","created":"2022-06-15","cited_by_count":100},{"id":"2002.06755","title":"Unifying Graph Convolutional Neural Networks and Label Propagation","created":"2020-02-17","cited_by_count":98},{"id":"2203.15876","title":"Self-Supervised Learning for Recommender Systems: A Survey","created":"2022-03-29","cited_by_count":95},{"id":"2106.05150","title":"Scaling Up Graph Neural Networks Via Graph Coarsening","created":"2021-06-09","cited_by_count":80},{"id":"2306.02664","title":"Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Data","created":"2023-06-05","cited_by_count":71},{"id":"2206.01535","title":"Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination","created":"2022-06-03","cited_by_count":69},{"id":"2206.13697","title":"Graph Condensation via Receptive Field Distribution Matching","created":"2022-06-28","cited_by_count":60},{"id":"2402.03358","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","created":"2024-01-29","cited_by_count":57},{"id":"1802.07510","title":"Spectrally approximating large graphs with smaller graphs","created":"2018-02-21","cited_by_count":56},{"id":"2102.01350","title":"Graph Coarsening with Neural Networks","created":"2021-02-02","cited_by_count":55},{"id":"2309.09455","title":"CaT: Balanced Continual Graph Learning with Graph Condensation","created":"2023-09-18","cited_by_count":52},{"id":"2110.14377","title":"Node Dependent Local Smoothing for Scalable Graph Learning","created":"2021-10-27","cited_by_count":45},{"id":"2310.09192","title":"Does Graph Distillation See Like Vision Dataset Counterpart?","created":"2023-10-13","cited_by_count":45},{"id":"2212.09034","title":"Graph Neural Networks are Inherently Good Generalizers: Insights by Bridging GNNs and MLPs","created":"2022-12-18","cited_by_count":42},{"id":"2310.11046","title":"Fast Graph Condensation with Structure-based Neural Tangent Kernel","created":"2023-10-17","cited_by_count":36},{"id":"1902.09702","title":"A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening","created":"2019-02-26","cited_by_count":31},{"id":"2307.15967","title":"Graph Condensation for Inductive Node Representation Learning","created":"2023-07-29","cited_by_count":31},{"id":"2402.05011","title":"Navigating Complexity: Toward Lossless Graph Condensation via Expanding Window Matching","created":"2024-02-07","cited_by_count":28},{"id":"2212.11440","title":"Self-supervised Hypergraph Representation Learning for Sociological Analysis","created":"2022-12-22","cited_by_count":27},{"id":"2305.02190","title":"Rethinking Graph Lottery Tickets: Graph Sparsity Matters","created":"2023-05-03","cited_by_count":23},{"id":"2401.11720","title":"Graph Condensation: A Survey","created":"2024-01-22","cited_by_count":23},{"id":"2402.05962","title":"EXGC: Bridging Efficiency and Explainability in Graph Condensation","created":"2024-02-05","cited_by_count":20},{"id":"2403.07294","title":"Graph Data Condensation via Self-expressive Graph Structure Reconstruction","created":"2024-03-12","cited_by_count":18},{"id":"2312.15520","title":"Graph Coarsening via Convolution Matching for Scalable Graph Neural Network Training","created":"2023-12-24","cited_by_count":12},{"id":"2401.12231","title":"Disentangled Condensation for Large-scale Graphs","created":"2024-01-18","cited_by_count":10},{"id":"2311.15772","title":"Attend Who is Weak: Enhancing Graph Condensation via Cross-Free Adversarial Training","created":"2023-11-27","cited_by_count":9},{"id":"2402.02000","title":"A Survey on Graph Condensation","created":"2024-02-03","cited_by_count":9},{"id":"2402.04924","title":"Two Trades is not Baffled: Condensing Graph via Crafting Rational Gradient Matching","created":"2024-02-07","cited_by_count":8},{"id":"2403.14951","title":"Simple Graph Condensation","created":"2024-03-22","cited_by_count":8},{"id":"2003.13212","title":"Temporal Network Representation Learning via Historical Neighborhoods Aggregation","created":"2020-03-30","cited_by_count":3},{"id":"2209.10286","title":"Influence Maximization in Real-World Closed Social Networks","created":"2022-09-21","cited_by_count":2}],"next_cursor":null}