{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T04:06:59Z","timestamp":1746504419589,"version":"3.40.4"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"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":["12227901","62402472"],"award-info":[{"award-number":["12227901","62402472"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK.20240460","BK.20240461"],"award-info":[{"award-number":["BK.20240460","BK.20240461"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011131","name":"State Key Laboratory of Resources and Environmental Information System","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011131","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/tkde.2025.3544696","type":"journal-article","created":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T17:43:13Z","timestamp":1741628593000},"page":"3684-3699","source":"Crossref","is-referenced-by-count":0,"title":["RayE-Sub: Countering Subgraph Degradation via Perfect Reconstruction"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3346-5130","authenticated-orcid":false,"given":"Kuo","family":"Yang","sequence":"first","affiliation":[{"name":"University of Science and Technology of China (USTC), Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4728-7347","authenticated-orcid":false,"given":"Zhengyang","family":"Zhou","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China (USTC), Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1492-3477","authenticated-orcid":false,"given":"Xu","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China (USTC), Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2680-4563","authenticated-orcid":false,"given":"Pengkun","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China (USTC), Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7328-9473","authenticated-orcid":false,"given":"Limin","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China (USTC), Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6079-7053","authenticated-orcid":false,"given":"Yang","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China (USTC), Hefei, China"}]}],"member":"263","reference":[{"key":"ref1","first-page":"12964","article-title":"Learning substructure invariance for out-of-distribution molecular representations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yang"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/3485447.3512182"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TKDE.2020.3034312"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/3535101"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/3539597.3570484"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.3390\/su151511893"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/s10489-021-02587-w"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TVCG.2022.3209435"},{"key":"ref9","first-page":"12096","article-title":"Does GNN pretraining help molecular representation?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Sun"},{"year":"2018","author":"Xu","article-title":"How powerful are graph neural networks?","key":"ref10"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1609\/aaai.v33i01.33014602"},{"year":"2023","author":"Zhang","article-title":"Rethinking the expressive power of GNNs via graph biconnectivity","key":"ref12"},{"key":"ref13","first-page":"15524","article-title":"Interpretable and generalizable graph learning via stochastic attention mechanism","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Miao"},{"key":"ref14","first-page":"1713","article-title":"Reconstruction for powerful graph representations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Cotta"},{"key":"ref15","first-page":"31376","article-title":"Understanding and extending subgraph GNNs by rethinking their symmetries","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Frasca"},{"key":"ref16","first-page":"1","article-title":"Equivariant subgraph aggregation networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Bevilacqua"},{"year":"2021","author":"Zhao","article-title":"From stars to subgraphs: Uplifting any GNN with local structure awareness","key":"ref17"},{"key":"ref18","first-page":"21618","article-title":"Rethinking graph transformers with spectral attention","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kreuzer"},{"key":"ref19","first-page":"4776","article-title":"How powerful are k-hop message passing graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Feng"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/TPAMI.2022.3154319"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1145\/3587254"},{"key":"ref22","first-page":"22131","article-title":"Learning causally invariant representations for out-of-distribution generalization on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref23","first-page":"4839","article-title":"Hierarchical generation of molecular graphs using structural motifs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jin"},{"key":"ref24","first-page":"47","article-title":"Spectral and algebraic graph theory","volume":"4","author":"Spielman","year":"2019","journal-title":"Yale Lecture Notes, Draft December"},{"year":"2020","author":"Yu","article-title":"Graph information bottleneck for subgraph recognition","key":"ref25"},{"year":"2022","author":"Wu","article-title":"Discovering invariant rationales for graph neural networks","key":"ref26"},{"key":"ref27","first-page":"11828","article-title":"Learning invariant graph representations for out-of-distribution generalization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Li"},{"volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gui","article-title":"Joint learning of label and environment causal independence for graph out-of-distribution generalization","key":"ref28"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1145\/3580305.3599339"},{"key":"ref30","first-page":"1026","article-title":"Weisfeiler and lehman go topological: Message passing simplicial networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bodnar"},{"key":"ref31","first-page":"21824","article-title":"Weisfeiler and leman go sparse: Towards scalable higher-order graph embeddings","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Morris"},{"key":"ref32","first-page":"10383","article-title":"Can graph neural networks count substructures?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen"},{"year":"2020","author":"Puny","article-title":"Global attention improves graph networks generalization","key":"ref33"},{"year":"2021","author":"Dwivedi","article-title":"Graph neural networks with learnable structural and positional representations","key":"ref34"},{"key":"ref35","first-page":"28877","article-title":"Do transformers really perform badly for graph representation?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ying"},{"key":"ref36","first-page":"33156","article-title":"Feature expansion for graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Sun"},{"key":"ref37","first-page":"8017","article-title":"Subgraph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Alsentzer"},{"key":"ref38","first-page":"12241","article-title":"On explainability of graph neural networks via subgraph explorations","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yuan"},{"key":"ref39","first-page":"4465","article-title":"Distance encoding: Design provably more powerful neural networks for graph representation learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref40","first-page":"20437","article-title":"Graph information bottleneck","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wu"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1007\/s00214-003-0460-4"},{"key":"ref42","first-page":"41019","article-title":"A complete expressiveness hierarchy for subgraph GNNs via subgraph weisfeiler-lehman tests","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref43","first-page":"19620","article-title":"Parameterized explainer for graph neural network","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Luo"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1021\/jm00106a046"},{"key":"ref45","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hu"},{"year":"2016","author":"Kipf","article-title":"Semi-supervised classification with graph convolutional networks","key":"ref46"},{"key":"ref47","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kong","article-title":"MAG-GNN: Reinforcement learning boosted graph neural network","key":"ref48"},{"volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhou","article-title":"Distance-restricted folklore weisfeiler-leman GNNs with provable cycle counting power","key":"ref49"},{"volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhou","article-title":"Facilitating graph neural networks with random walk on simplicial complexes","key":"ref50"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1109\/TKDE.2024.3364059"},{"issue":"11","key":"ref52","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"Van der Maaten","year":"2008","journal-title":"J. Mach. Learn. Res."}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10981836\/10919162.pdf?arnumber=10919162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T18:28:24Z","timestamp":1746469704000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10919162\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":52,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3544696","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":[[2025,6]]}}}