{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T06:02:05Z","timestamp":1767679325224,"version":"3.48.0"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62476245"],"award-info":[{"award-number":["62476245"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LTGG23F030005"],"award-info":[{"award-number":["LTGG23F030005"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1109\/tkde.2025.3630440","type":"journal-article","created":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T18:12:03Z","timestamp":1762539123000},"page":"1028-1039","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing Graph Condensation via Key Information Reconstruction"],"prefix":"10.1109","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0138-3250","authenticated-orcid":false,"given":"Hongjia","family":"Xu","sequence":"first","affiliation":[{"name":"Zhejiang Key Laboratory of Accessible Perception and Intelligent Systems, College of Computer Science and Technology, Zhejiang University, Hangzhou, China"}],"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 Key Laboratory of Accessible Perception and Intelligent Systems, College of Computer Science and Technology, 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 Key Laboratory of Accessible Perception and Intelligent Systems, College of Computer Science and Technology, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8999-968X","authenticated-orcid":false,"given":"Qiaoyu","family":"Tan","sequence":"additional","affiliation":[{"name":"College of Computer Science, New York University (Shanghai), Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4752-2629","authenticated-orcid":false,"given":"Jiawei","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, 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 Key Laboratory of Accessible Perception and Intelligent Systems, College of Computer Science and Technology, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"6533","article-title":"Protein interface prediction using graph convolutional networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Fout","year":"2017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29659-3_1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3523700"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-022-00890-9"},{"key":"ref6","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton","year":"2017"},{"key":"ref7","first-page":"8058","article-title":"A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation","volume-title":"Proc. 33rd Int. Joint Conf. Artif. Intell.","author":"Hashemi","year":"2024"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2025.3535877"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3729427"},{"key":"ref10","article-title":"Graph condensation for graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Jin","year":"2021"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539429"},{"article-title":"Attend who is weak: Enhancing graph condensation via cross-free adversarial training","year":"2023","author":"Li","key":"ref12"},{"key":"ref13","first-page":"53201","article-title":"Does graph distillation see like vision dataset counterpart","volume-title":"Proc. 37th Conf. Neural Inf. Process. Syst.","author":"Yang","year":"2023"},{"key":"ref14","first-page":"6026","article-title":"Structure-free graph condensation: From large-scale graphs to condensed graph-free data","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zheng","year":"2024"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/icde60146.2024.00237"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110904"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3362863"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467256"},{"key":"ref19","first-page":"30702","article-title":"Graph distillation with eigenbasis matching","volume-title":"Proc. 41st Int. Conf. Mach. Learn.","author":"Liu","year":"2024"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3485691"},{"article-title":"Two trades is not baffled: Condense graph via crafting rational gradient matching","year":"2024","author":"Zhang","key":"ref21"},{"key":"ref22","first-page":"60379","article-title":"Navigating complexity: Toward lossless graph condensation via expanding window matching","volume-title":"Proc. 41st Int. Conf. Mach. Learn.","author":"Zhang","year":"2024"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2025.3569629"},{"article-title":"Graph condensation via receptive field distribution matching","year":"2022","author":"Liu","key":"ref24"},{"key":"ref25","first-page":"37900","article-title":"GC-bench: An open and unified benchmark for graph condensation","volume-title":"Proc. 38th Conf. Neural Inf. Process. Syst. Datasets Benchmarks Track","author":"Sun","year":"2024"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3746252.3761654"},{"article-title":"Gc4nc: A benchmark framework for graph condensation on node classification with new insights","year":"2024","author":"Gong","key":"ref27"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00008"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3298490"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/s0304-3975(98)00075-9"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3323376"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01045"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1042-4"},{"key":"ref34","first-page":"7736","article-title":"A unifying framework for spectrum-preserving graph sparsification and coarsening","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hermsdorff","year":"2019"},{"issue":"116","key":"ref35","first-page":"1","article-title":"Graph reduction with spectral and cut guarantees","volume":"20","author":"Loukas","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref36","article-title":"Graphzoom: A multi-level spectral approach for accurate and scalable graph embedding","volume-title":"Proc. 8th Int. Conf. Learn. Representations","author":"Deng","year":"2020"},{"key":"ref37","first-page":"4452","article-title":"Graph coarsening with preserved spectral properties","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Jin","year":"2020"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645452"},{"key":"ref39","first-page":"56946","article-title":"Better with less: A data-active perspective on pre-training graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Xu","year":"2023"},{"key":"ref40","first-page":"17953","article-title":"Featured graph coarsening with similarity guarantees","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kumar","year":"2023"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/icde65448.2025.00172"},{"key":"ref42","article-title":"Faster hyperparameter search on graphs via calibrated dataset condensation","volume-title":"Proc. NeurIPS 2022 Workshop: New Front. Graph Learn.","author":"Ding","year":"2022"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645551"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.3390\/app13169166"},{"article-title":"Tinygraph: Joint feature and node condensation for graph neural networks","year":"2024","author":"Liu","key":"ref45"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i12.33417"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599398"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645694"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671682"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714851"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-70344-7_4"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2025.3638465"},{"key":"ref53","first-page":"80644","article-title":"Fair graph distillation","volume-title":"Proc. 37th Conf. Neural Inf. Process. Syst.","author":"Feng","year":"2023"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3052710"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3436076"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441734"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.11.016"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.124289"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2292894"},{"key":"ref61","first-page":"60379","article-title":"Navigating complexity: Toward lossless graph condensation via expanding window matching","volume-title":"Proc. 41st Int. Conf. Mach. Learn.","author":"Zhang","year":"2024"},{"key":"ref62","first-page":"24","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Representations","author":"Kipf","year":"2017"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11329113\/11235556.pdf?arnumber=11235556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:58:02Z","timestamp":1767679082000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11235556\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":62,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3630440","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2026,2]]}}}