{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T00:34:26Z","timestamp":1768696466369,"version":"3.49.0"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Innovation Foundation of Science and Technology of Dalian","award":["2018J11CY010"],"award-info":[{"award-number":["2018J11CY010"]}]},{"name":"Innovation Foundation of Science and Technology of Dalian","award":["2019J12GX037"],"award-info":[{"award-number":["2019J12GX037"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072069"],"award-info":[{"award-number":["62072069"]}],"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":["U1811463"],"award-info":[{"award-number":["U1811463"]}],"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":["U19B2039"],"award-info":[{"award-number":["U19B2039"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tkde.2022.3168070","type":"journal-article","created":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T19:36:28Z","timestamp":1650396988000},"page":"1-1","source":"Crossref","is-referenced-by-count":5,"title":["Breaking the Expression Bottleneck of Graph Neural Networks"],"prefix":"10.1109","author":[{"given":"Mingqi","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renjian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanming","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heng","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baocai","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"ref3","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref4","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"ref6","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref7","first-page":"2224","article-title":"Convolutional networks on graphs for learning molecular fingerprints","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Duvenaud"},{"key":"ref8","article-title":"A survey on the expressive power of graph neural networks","author":"Sato","year":"2020"},{"issue":"9","key":"ref9","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"2","author":"Leman","year":"1968","journal-title":"Nauchno-Technicheskaya Informatsiya"},{"key":"ref10","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"ref12","first-page":"2156","article-title":"Provably powerful graph networks","volume-title":"Proc. 33rd Int. Conf. Neural Inf. Process. Syst.","author":"Maron"},{"key":"ref13","first-page":"15 868","article-title":"On the equivalence between graph isomorphism testing and function approximation with gnns","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref14","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":"ref15","first-page":"14143","article-title":"Building powerful and equivariant graph neural networks with structural message-passing","volume-title":"Proc. Adv. Neural Informat. Process. Syst.","author":"Vignac"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"ref17","first-page":"10945","article-title":"Break the ceiling: Stronger multi-scale deep graph convolutional networks","volume-title":"Proc. Adv. Neural Informat. Process. Syst.","author":"Luan"},{"key":"ref18","first-page":"3391","article-title":"Deep sets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zaheer"},{"key":"ref19","first-page":"15 413","article-title":"Understanding the representation power of graph neural networks in learning graph topology","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Dehmamy"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019120016X"},{"key":"ref21","first-page":"13 260","article-title":"Principal neighbourhood aggregation for graph nets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Corso"},{"key":"ref22","article-title":"Janossy pooling: Learning deep permutation-invariant functions for variable-size inputs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Murphy"},{"key":"ref23","first-page":"4663","article-title":"Relational pooling for graph representations","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Murphy"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511778810"},{"key":"ref25","article-title":"Node masking: Making graph neural networks generalize and scale better","author":"Mishra","year":"2020"},{"key":"ref26","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Rong"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449953"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3490478"},{"key":"ref29","article-title":"Benchmark data sets for graph kernels","author":"Kersting","year":"2016"},{"key":"ref30","article-title":"Open graph benchmark: Datasets for machine learning on graphs","author":"Hu","year":"2020"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1038\/sdata.2014.22"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1039\/C7SC02664A"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1021\/ci300415d"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref35","first-page":"4800","article-title":"Hierarchical graph representation learning with differentiable pooling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ying"},{"key":"ref36","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref37","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref38","article-title":"DeeperGCN: All you need to train deeper GCNs","author":"Li","year":"2020"},{"key":"ref39","article-title":"Hierarchical inter-message passing for learning on molecular graphs","volume-title":"Proc. Int. Conf. Mach. Learn. Graph Representation Learn. Beyond Workhop","author":"Fey"},{"key":"ref40","article-title":"Wasserstein embedding for graph learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kolouri"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref42","first-page":"2014","article-title":"Learning convolutional neural networks for graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Niepert"},{"key":"ref43","first-page":"2186","article-title":"Anonymous walk embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ivanov"},{"key":"ref44","article-title":"Capsule graph neural network","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xinyi"},{"key":"ref45","first-page":"448","article-title":"Batch normalization: Accelerating deep network training by reducing internal covariate shift","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ioffe"},{"key":"ref46","article-title":"FLAG: Adversarial data augmentation for graph neural networks","author":"Kong","year":"2020"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09759979.pdf?arnumber=9759979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T21:03:14Z","timestamp":1705957394000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9759979\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/tkde.2022.3168070","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}