{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T18:10:17Z","timestamp":1772302217614,"version":"3.50.1"},"reference-count":66,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"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":["62020106015"],"award-info":[{"award-number":["62020106015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976209"],"award-info":[{"award-number":["61976209"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Chinese Association for Artificial Intelligence"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1109\/tpami.2023.3336315","type":"journal-article","created":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T19:12:43Z","timestamp":1701198763000},"page":"2838-2851","source":"Crossref","is-referenced-by-count":4,"title":["Growing Like a Tree: Finding Trunks From Graph Skeleton Trees"],"prefix":"10.1109","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0085-5848","authenticated-orcid":false,"given":"Zhongyu","family":"Huang","sequence":"first","affiliation":[{"name":"Laboratory of Brain Atlas and Brain-Inspired Intelligence, State Key Laboratory of Multimodal Artificial Intelligence Systems, Institute of Automation, Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4828-4757","authenticated-orcid":false,"given":"Yingheng","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9867-1712","authenticated-orcid":false,"given":"Chaozhuo","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Social Computing, Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0684-1711","authenticated-orcid":false,"given":"Huiguang","family":"He","sequence":"additional","affiliation":[{"name":"Laboratory of Brain Atlas and Brain-Inspired Intelligence, State Key Laboratory of Multimodal Artificial Intelligence Systems, Institute of Automation, Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref2","article-title":"Message passing all the way up","volume-title":"Proc. Workshop Geometrical Topological Representation Learn.","author":"Veli\u010dkovi\u0107"},{"key":"ref3","first-page":"4800","article-title":"Hierarchical graph representation learning with differentiable pooling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ying"},{"key":"ref4","article-title":"How powerful are graph neural networks?","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref5","first-page":"10383","article-title":"Can graph neural networks count substructures?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref7","article-title":"On the bottleneck of graph neural networks and its practical implications","volume-title":"Proc. 9th Int. Conf. Learn. Representations","author":"Alon"},{"key":"ref8","first-page":"942","article-title":"Stochastic training of graph convolutional networks with variance reduction","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref9","first-page":"8017","article-title":"Subgraph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Alsentzer"},{"key":"ref10","article-title":"Graph neural networks with learnable structural and positional representations","volume-title":"Proc. 10th Int. Conf. Learn. Representations","author":"Dwivedi"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2019.8852103"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00142"},{"key":"ref13","volume-title":"Soils and Soil Fertility","author":"Whitson","year":"1912"},{"key":"ref14","first-page":"19746","article-title":"Graph neural networks with adaptive readouts","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Buterez"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-35995-8_28"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570445"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.31390\/gradschool_dissertations.4601"},{"key":"ref19","article-title":"Empirical evaluation of gated recurrent neural networks on sequence modeling","volume-title":"Proc. NIPS Workshop Deep Learn. Representation Learn.","author":"Chung"},{"key":"ref20","article-title":"Understanding over-squashing and bottlenecks on graphs via curvature","volume-title":"Proc. 10th Int. Conf. Learn. Representations","author":"Topping"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton49937.2022.9929363"},{"key":"ref22","article-title":"Expander graph propagation","volume-title":"Proc. 1st Learn. Graphs Conf.","author":"Deac"},{"key":"ref23","article-title":"FoSR: First-order spectral rewiring for addressing oversquashing in GNNs","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Karhadkar"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref25","article-title":"A generalization of transformer networks to graphs","volume-title":"Proc. AAAI Workshop Deep Learn. Graphs: Methods Appl.","author":"Dwivedi"},{"key":"ref26","first-page":"21618","article-title":"Rethinking graph Transformers with spectral attention","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kreuzer"},{"key":"ref27","first-page":"2323","article-title":"Junction tree variational autoencoder for molecular graph generation","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Jin"},{"key":"ref28","article-title":"Hierarchical inter-message passing for learning on molecular graphs","volume-title":"Proc. Workshop Graph Representation Learn. Beyond","author":"Fey"},{"key":"ref29","first-page":"26395","article-title":"Neural trees for learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Talak"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482487"},{"key":"ref31","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhu"},{"issue":"77","key":"ref32","first-page":"2539","article-title":"Weisfeiler-Lehman graph kernels","volume":"12","author":"Shervashidze","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref33","first-page":"12241","article-title":"On explainability of graph neural networks via subgraph explorations","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Yuan"},{"key":"ref34","article-title":"DT GNN: A fully explainable graph neural network using decision trees","author":"M\u00fcller","year":"2022"},{"key":"ref35","first-page":"1037","article-title":"Weisfeiler and Leman go hyperbolic: Learning distance preserving node representations","volume-title":"Proc. 26th Int. Conf. Artif. Intell. Statist.","author":"Nikolentzos"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014424"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/569"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1088\/2632-2153\/abf5b8"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/310"},{"key":"ref41","first-page":"5878","article-title":"pathGCN: Learning general graph spatial operators from paths","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Eliasof"},{"key":"ref42","first-page":"6354","article-title":"Distributed, egocentric representations of graphs for detecting critical structures","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Tzeng"},{"key":"ref43","first-page":"25280","article-title":"Graph neural networks with local graph parameters","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Barcel\u00f3"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3154319"},{"key":"ref45","first-page":"1026","article-title":"Weisfeiler and Lehman go topological: Message passing simplicial networks","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Bodnar"},{"key":"ref46","first-page":"2625","article-title":"Weisfeiler and Lehman go cellular: CW networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bodnar"},{"key":"ref47","article-title":"From stars to subgraphs: Uplifting any GNN with local structure awareness","volume-title":"Proc. 10th Int. Conf. Learn. Representations","author":"Zhao"},{"key":"ref48","article-title":"Equivariant subgraph aggregation networks","volume-title":"Proc. 10th Int. Conf. Learn. Representations","author":"Bevilacqua"},{"key":"ref49","first-page":"31\u2009376","article-title":"Understanding and extending subgraph GNNs by rethinking their symmetries","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Frasca"},{"key":"ref50","first-page":"21030","article-title":"Ordered subgraph aggregation networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Qian"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3188911"},{"key":"ref52","volume-title":"Introduction to Graph Theory","author":"West","year":"2001"},{"key":"ref53","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref54","first-page":"5862","article-title":"Graph meta learning via local subgraphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Huang"},{"key":"ref55","article-title":"TUDataset: A collection of benchmark datasets for learning with graphs","volume-title":"Proc. Workshop Graph Representation Learn. Beyond","author":"Morris"},{"key":"ref56","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref57","first-page":"22326","article-title":"Long range graph benchmark","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Dwivedi"},{"key":"ref58","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref59","article-title":"Residual gated graph convnets","author":"Bresson","year":"2017"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref61","article-title":"Invariant and equivariant graph networks","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Maron"},{"key":"ref62","first-page":"2156","article-title":"Provably powerful graph networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Maron"},{"key":"ref63","first-page":"13354","article-title":"Diffusion improves graph learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gasteiger"},{"key":"ref64","first-page":"3636","article-title":"Natural graph networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"de Haan"},{"key":"ref65","article-title":"Wasserstein embedding for graph learning","volume-title":"Proc. 9th Int. Conf. Learn. Representations","author":"Kolouri"},{"key":"ref66","article-title":"Graph attention networks","volume-title":"Proc. 6th Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/10490207\/10330013.pdf?arnumber=10330013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T19:35:37Z","timestamp":1712691337000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10330013\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":66,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2023.3336315","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5]]}}}