{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T19:58:31Z","timestamp":1776887911690,"version":"3.51.2"},"reference-count":84,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T00:00:00Z","timestamp":1747872000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62476245"],"award-info":[{"award-number":["62476245"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LTGG23F030005"],"award-info":[{"award-number":["LTGG23F030005"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2025,6,30]]},"abstract":"<jats:p>\n                    Graph data, prevalent across domains like social networks, biological systems, and recommendation systems, presents significant challenges due to its large scale and complex structure. The advent of Graph Neural Networks (GNNs) has revolutionized graph data mining by effectively capturing node dependencies and neighborhood information. However, the computational complexity of processing large-scale graphs remains a major hurdle, as real-world graphs often consist of millions or even billions of nodes and edges. Efficient techniques like message passing and sampling have helped mitigate this issue, but memory and processing constraints persist. A promising approach to addressing these challenges is learning to reduce the size of large-scale graphs while retaining essential information, thus facilitating faster and more efficient graph data mining tasks, such as graph condensation, reduction, coarsening, summarization, and so on. Despite the differences in terminology, approaches under these topics share the same motivation: to generate smaller yet informative graphs that can replace the original large-scale datasets. In this article, we unify these approaches under the concept of Graph Scaling (GS), highlighting the shared motivation across multiple topics. Alongside this definition, to clarify the question of what principles should be followed when scaling a graph and how a scaled graph was formulated, we propose a taxonomy to methodically categorize and understand existing methods. Moreover, by organizing the dataset and evaluation metrics, we aim to provide a more comprehensive understanding of the GS methods from a practical perspective. Moving forward, we delve into the limitations and challenges of GS methods, identifying the shortcomings and potential in the literature. Finally, we conclude this article by outlining future directions and offering concise guidelines to inspire future research in this field. A full paper list and online resources about GS are available at\n                    <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/Frostland12138\/Awesome-Graph-Scaling\">https:\/\/github.com\/Frostland12138\/Awesome-Graph-Scaling<\/jats:ext-link>\n                    .\n                  <\/jats:p>","DOI":"10.1145\/3729427","type":"journal-article","created":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T12:25:46Z","timestamp":1744719946000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning to Reduce the Scale of Large Graphs: A Comprehensive Survey"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0138-3250","authenticated-orcid":false,"given":"Hongjia","family":"Xu","sequence":"first","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7101-7312","authenticated-orcid":false,"given":"Liangliang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute, Troy, New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4985-8724","authenticated-orcid":false,"given":"Yao","family":"Ma","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute, Troy, New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3645-1041","authenticated-orcid":false,"given":"Sheng","family":"Zhou","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7326-7945","authenticated-orcid":false,"given":"Zhuonan","family":"Zheng","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1097-2044","authenticated-orcid":false,"given":"Jiajun","family":"Bu","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,5,22]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1256"},{"key":"e_1_3_2_3_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"30","author":"Fout Alex","year":"2017","unstructured":"Alex Fout, Jonathon Byrd, Basir Shariat, and Asa Ben-Hur. 2017. Protein interface prediction using graph convolutional networks. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 30."},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29659-3_1"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"issue":"5","key":"e_1_3_2_9_2","first-page":"5782","article-title":"Explainability in graph neural networks: A taxonomic survey","volume":"45","author":"Yuan Hao","year":"2022","unstructured":"Hao Yuan, Haiyang Yu, Shurui Gui, and Shuiwang Ji. 2022. Explainability in graph neural networks: A taxonomic survey. IEEE Transactions on Pattern Analysis and Machine Intelligence 45, 5 (2022), 5782\u20135799.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-022-00890-9"},{"key":"e_1_3_2_11_2","first-page":"5376","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"35","author":"Duan Keyu","year":"2022","unstructured":"Keyu Duan, Zirui Liu, Peihao Wang, Wenqing Zheng, Kaixiong Zhou, Tianlong Chen, Xia Hu, and Zhangyang Wang. 2022. A comprehensive study on large-scale graph training: Benchmarking and rethinking. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 35, 5376\u20135389."},{"key":"e_1_3_2_12_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"30","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 30."},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3323376"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM58522.2023.00141"},{"key":"e_1_3_2_15_2","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence","author":"Gao Yang","year":"2021","unstructured":"Yang Gao, Hong Yang, Peng Zhang, Chuan Zhou, and Yue Hu. 2021. Graph neural architecture search. In Proceedings of the International Joint Conference on Artificial Intelligence."},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2021.1004311"},{"key":"e_1_3_2_17_2","first-page":"569","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Baker Daniel","year":"2020","unstructured":"Daniel Baker, Vladimir Braverman, Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, and Xuan Wu. 2020. Coresets for clustering in graphs of bounded treewidth. In Proceedings of the International Conference on Machine Learning. PMLR, 569\u2013579."},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993647"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1454"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2024.3350545"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/752"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2025.3535877"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2024\/891"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/s40324-021-00282-x"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3627816"},{"key":"e_1_3_2_26_2","volume-title":"Proceedings of the 37th Conference on Neural Information Processing Systems","author":"Yang Beining","year":"2023","unstructured":"Beining Yang, Kai Wang, Qingyun Sun, Cheng Ji, Xingcheng Fu, Hao Tang, Yang You, and Jianxin Li. 2023. Does graph distillation see like vision dataset counterpart? In Proceedings of the 37th Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_27_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems, Vol","volume":"32","author":"Bravo Hermsdorff Gecia","year":"2019","unstructured":"Gecia Bravo Hermsdorff and Lee Gunderson. 2019. A unifying framework for spectrum-preserving graph sparsification and coarsening. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 32."},{"issue":"116","key":"e_1_3_2_28_2","first-page":"1","article-title":"Graph reduction with spectral and cut guarantees","volume":"20","author":"Loukas Andreas","year":"2019","unstructured":"Andreas Loukas. 2019. Graph reduction with spectral and cut guarantees. Journal of Machine Learning Research 20, 116 (2019), 1\u201342.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467256"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.5555\/3692070.3693307"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2004.05.005"},{"key":"e_1_3_2_32_2","unstructured":"Xingcheng Fu Yisen Gao Beining Yang Yuxuan Wu Haodong Qian Qingyun Sun and Xianxian Li. 2024. Bi-directional multi-scale graph dataset condensation via information bottleneck. arXiv:2412.17355. Retrieved from https:\/\/arxiv.org\/abs\/2412.17355"},{"key":"e_1_3_2_33_2","unstructured":"Xinyi Gao Yayong Li Tong Chen Guanhua Ye Wentao Zhang and Hongzhi Yin. 2024. Contrastive graph condensation: Advancing data versatility through self-supervised learning. arXiv:2411.17063. Retrieved from https:\/\/arxiv.org\/abs\/2411.17063"},{"key":"e_1_3_2_34_2","first-page":"4452","volume-title":"Proceedings of the International Conference on Artificial Intelligence and Statistics","author":"Jin Yu","year":"2020","unstructured":"Yu Jin, Andreas Loukas, and Joseph JaJa. 2020. Graph coarsening with preserved spectral properties. In Proceedings of the International Conference on Artificial Intelligence and Statistics. PMLR, 4452\u20134462."},{"key":"e_1_3_2_35_2","volume-title":"Proceedings of the 8th International Conference on Learning Representations (ICLR \u201920)","author":"Deng Chenhui","year":"2020","unstructured":"Chenhui Deng, Zhiqiang Zhao, Yongyu Wang, Zhiru Zhang, and Zhuo Feng. 2020. GraphZoom: A multi-level spectral approach for accurate and scalable graph embedding. In Proceedings of the 8th International Conference on Learning Representations (ICLR \u201920). OpenReview.net."},{"key":"e_1_3_2_36_2","first-page":"56946","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"36","author":"Xu Jiarong","year":"2023","unstructured":"Jiarong Xu, Renhong Huang, Xin Jiang, Yuxuan Cao, Carl Yang, Chunping Wang, and Yang Yang. 2023. Better with less: A data-active perspective on pre-training graph neural networks. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 36, 56946\u201356978."},{"key":"e_1_3_2_37_2","first-page":"17953","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Kumar Manoj","year":"2023","unstructured":"Manoj Kumar, Anurag Sharma, Shashwat Saxena, and Sandeep Kumar. 2023. Featured graph coarsening with similarity guarantees. In Proceedings of the International Conference on Machine Learning. PMLR, 17953\u201317975."},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v15i1.18067"},{"key":"e_1_3_2_39_2","unstructured":"Yuxuan Liang Wentao Zhang Xinyi Gao Ling Yang Chong Chen Hongzhi Yin Yunhai Tong and Bin Cui. 2024. Training-free heterogeneous graph condensation via data selection. arXiv:2412.16250. Retrieved from. https:\/\/arxiv.org\/abs\/2412.16250"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570385"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i10.17072"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00237"},{"key":"e_1_3_2_43_2","volume-title":"Proceedings of the 37th Conference on Neural Information Processing Systems","author":"Feng Qizhang","year":"2023","unstructured":"Qizhang Feng, Zhimeng Jiang, Ruiquan Li, Yicheng Wang, Na Zou, Jiang Bian, and Xia Hu. 2023. Fair graph distillation. In Proceedings of the 37th Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_44_2","unstructured":"Tianle Zhang Yuchen Zhang Kun Wang Kai Wang Beining Yang Kaipeng Zhang Wenqi Shao Ping Liu Joey Tianyi Zhou and Yang You. 2024. Two trades is not baffled: Condense graph via crafting rational gradient matching. arXiv:2402.04924. Retrieved from https:\/\/arxiv.org\/abs\/2402.04924"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3362863"},{"key":"e_1_3_2_46_2","first-page":"1992","volume-title":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","author":"Liu Zhanyu","year":"2024","unstructured":"Zhanyu Liu, Chaolv Zeng, and Guanjie Zheng. 2024. Graph data condensation via self-expressive graph structure reconstruction. In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 1992\u20132002."},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645452"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_49_2","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Jin Wei","year":"2021","unstructured":"Wei Jin, Lingxiao Zhao, Shichang Zhang, Yozen Liu, Jiliang Tang, and Neil Shah. 2021. Graph condensation for graph neural networks. In Proceedings of the International Conference on Learning Representations."},{"key":"e_1_3_2_50_2","unstructured":"Jiahao Wu Ning Lu Zeiyu Dai Wenqi Fan Shengcai Liu Qing Li and Ke Tang. 2024. Backdoor graph condensation. arXiv:2407.11025. Retrieved from https:\/\/arxiv.org\/abs\/2407.11025"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539429"},{"key":"e_1_3_2_52_2","volume-title":"Proceedings of the NeurIPS 2022 Workshop: New Frontiers in Graph Learning","author":"Ding Mucong","year":"2022","unstructured":"Mucong Ding, Xiaoyu Liu, Tahseen Rabbani, and Furong Huang. 2022. Faster hyperparameter search on graphs via calibrated dataset condensation. In Proceedings of the NeurIPS 2022 Workshop: New Frontiers in Graph Learning."},{"key":"e_1_3_2_53_2","unstructured":"Xinglin Li Kun Wang Hanhui Deng Yuxuan Liang and Di Wu. 2023. Attend who is weak: Enhancing graph condensation via cross-free adversarial training. arXiv:2311.15772. Retrieved from https:\/\/arxiv.org\/abs\/2311.15772"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645551"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.3390\/app13169166"},{"key":"e_1_3_2_56_2","unstructured":"Yezi Liu and Yanning Shen. 2024. TinyGraph: Joint feature and node condensation for graph neural networks. arXiv:2407.08064. Retrieved from https:\/\/arxiv.org\/abs\/2407.08064"},{"key":"e_1_3_2_57_2","unstructured":"Bo Yan. 2024. Federated graph condensation with information bottleneck principles. arXiv:2405.03911. Retrieved from https:\/\/arxiv.org\/abs\/2405.03911"},{"key":"e_1_3_2_58_2","unstructured":"Xinyi Gao Hongzhi Yin Tong Chen Guanhua Ye Wentao Zhang and Bin Cui. 2024. RobGC: Towards robust graph condensation. arXiv:2406.13200. Retrieved from https:\/\/arxiv.org\/abs\/2406.13200"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110904"},{"key":"e_1_3_2_60_2","volume-title":"Proceedings of the 41stInternational Conference on Machine Learning (ICML \u201924)","author":"Zhang Yuchen","year":"2024","unstructured":"Yuchen Zhang, Tianle Zhang, Kai Wang, Ziyao Guo, Yuxuan Liang, Xavier Bresson, Wei Jin, and Yang You. 2024. Navigating complexity: Toward lossless graph condensation via expanding window matching. In Proceedings of the 41st International Conference on Machine Learning (ICML \u201924). OpenReview.net."},{"key":"e_1_3_2_61_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"36","author":"Zheng Xin","year":"2024","unstructured":"Xin Zheng, Miao Zhang, Chunyang Chen, Quoc Viet Hung Nguyen, Xingquan Zhu, and Shirui Pan. 2024. Structure-free graph condensation: From large-scale graphs to condensed graph-free data. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 36."},{"key":"e_1_3_2_62_2","volume-title":"Proceedings of the 9th International Conference on Learning Representations (ICLR \u201921)","author":"Zhao Bo","year":"2021","unstructured":"Bo Zhao, Konda Reddy Mopuri, and Hakan Bilen. 2021. Dataset condensation with gradient matching. In Proceedings of the 9th International Conference on Learning Representations (ICLR \u201921). OpenReview.net."},{"key":"e_1_3_2_63_2","volume-title":"Proceedings of the 38th Conference on Neural Information Processing Systems Datasets and Benchmarks Track","author":"Sun Qingyun","year":"2024","unstructured":"Qingyun Sun, Ziying Chen, Beining Yang, Cheng Ji, Xingcheng Fu, Sheng Zhou, Hao Peng, Jianxin Li, and S. Yu Philip. 2024. GC-bench: An open and unified benchmark for graph condensation. In Proceedings of the 38th Conference on Neural Information Processing Systems Datasets and Benchmarks Track."},{"key":"e_1_3_2_64_2","unstructured":"Shengbo Gong Juntong Ni Noveen Sachdeva Carl Yang and Wei Jin. 2024. GC4NC: A benchmark framework for graph condensation on node classification with new insights. arXiv:2406.16715. Retrieved from https:\/\/arxiv.org\/abs\/2406.16715"},{"key":"e_1_3_2_65_2","unstructured":"Yilun Liu Ruihong Qiu and Zi Huang. 2024. GCondenser: Benchmarking graph condensation. arXiv:2405.14246. Retrieved from https:\/\/arxiv.org\/abs\/2405.14246"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599398"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645694"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671682"},{"key":"e_1_3_2_69_2","first-page":"851","volume-title":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","author":"Gao Xinyi","year":"2024","unstructured":"Xinyi Gao, Tong Chen, Wentao Zhang, Yayong Li, Xiangguo Sun, and Hongzhi Yin. 2024. Graph condensation for open-world graph learning. In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 851\u2013862."},{"key":"e_1_3_2_70_2","volume-title":"Proceedings of the NeurIPS 2023 Workshop: New Frontiers in Graph Learning","author":"Pan Qiying","year":"2023","unstructured":"Qiying Pan, Ruofan Wu, Liu Tengfei, Tianyi Zhang, Yifei Zhu, and Weiqiang Wang. 2023. FedGKD: Unleashing the power of collaboration in federated graph neural networks. In Proceedings of the NeurIPS 2023 Workshop: New Frontiers in Graph Learning."},{"key":"e_1_3_2_71_2","unstructured":"Zhenbang Xiao Shunyu Liu Yu Wang Tongya Zheng and Mingli Song. 2024. Disentangled condensation for large-scale graphs. arXiv:2401.12231. Retrieved from https:\/\/arxiv.org\/abs\/2401.12231"},{"key":"e_1_3_2_72_2","unstructured":"Fan Li Xiaoyang Wang Dawei Cheng Wenjie Zhang Ying Zhang and Xuemin Lin. 2024. TCGU: Data-centric graph unlearning based on transferable condensation. arXiv:2410.06480. Retrieved from https:\/\/arxiv.org\/abs\/2410.06480"},{"key":"e_1_3_2_73_2","unstructured":"Mengyang Liu Shanchuan Li X. Chen and S. Le. 2022. Graph condensation via receptive field distribution matching. arXiv:2206.13697. Retrieved from https:\/\/arxiv.org\/abs\/2206.13697"},{"key":"e_1_3_2_74_2","doi-asserted-by":"publisher","DOI":"10.1145\/3589335.3651920"},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-70344-7_4"},{"key":"e_1_3_2_76_2","unstructured":"Xinyi Gao Tong Chen Wentao Zhang Junliang Yu Guanhua Ye Quoc Viet Hung Nguyen and Hongzhi Yin. 2024. Rethinking and accelerating graph condensation: A training-free approach with class partition. arXiv:2405.13707. Retrieved from https:\/\/arxiv.org\/abs\/2405.13707"},{"key":"e_1_3_2_77_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3485691"},{"key":"e_1_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450025"},{"key":"e_1_3_2_79_2","volume-title":"Proceedings of the 12th International Conference on Learning Representations (ICLR \u201924)","author":"Gupta Mridul","year":"2024","unstructured":"Mridul Gupta, Sahil Manchanda, Hariprasad Kodamana, and Sayan Ranu. 2024. Mirage: Model-agnostic graph distillation for graph classification. In Proceedings of the 12th International Conference on Learning Representations (ICLR \u201924). OpenReview.net."},{"key":"e_1_3_2_80_2","first-page":"9240","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"32","author":"Ying Zhitao","year":"2019","unstructured":"Zhitao Ying, Dylan Bourgeois, Jiaxuan You, Marinka Zitnik, and Jure Leskovec. 2019. GNNExplainer: Generating explanations for graph neural networks. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 32, 9240\u20139251."},{"key":"e_1_3_2_81_2","first-page":"15524","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Miao Siqi","year":"2022","unstructured":"Siqi Miao, Mia Liu, and Pan Li. 2022. Interpretable and generalizable graph learning via stochastic attention mechanism. In Proceedings of the International Conference on Machine Learning. PMLR, 15524\u201315543."},{"key":"e_1_3_2_82_2","doi-asserted-by":"publisher","DOI":"10.5555\/3455716.3455786"},{"key":"e_1_3_2_83_2","unstructured":"Liangliang Zhang Haoran Bao and Yao Ma. 2024. Extending graph condensation to multi-label datasets: A benchmark study. arXiv:2412.17961. Retrieved from https:\/\/arxiv.org\/abs\/2412.17961"},{"key":"e_1_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441720"},{"key":"e_1_3_2_85_2","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Ma Yao","year":"2021","unstructured":"Yao Ma, Xiaorui Liu, Neil Shah, and Jiliang Tang. 2021. Is homophily a necessity for graph neural networks? In Proceedings of the International Conference on Learning Representations."}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3729427","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3729427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T21:47:40Z","timestamp":1772228860000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3729427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,22]]},"references-count":84,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,6,30]]}},"alternative-id":["10.1145\/3729427"],"URL":"https:\/\/doi.org\/10.1145\/3729427","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,22]]},"assertion":[{"value":"2024-06-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}