{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:06:35Z","timestamp":1780765595514,"version":"3.54.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","funder":[{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1934979"],"award-info":[{"award-number":["1934979"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-17-2-0112"],"award-info":[{"award-number":["FA8750-17-2-0112"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["2113099"],"award-info":[{"award-number":["2113099"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tpami.2021.3104733","type":"journal-article","created":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T20:18:02Z","timestamp":1628885882000},"page":"1-1","source":"Crossref","is-referenced-by-count":7,"title":["A Simple Spectral Failure Mode for Graph Convolutional Networks"],"prefix":"10.1109","author":[{"given":"Carey E.","family":"Priebe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cencheng","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ningyuan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianyi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.03.022"},{"key":"ref2","article-title":"What can neural networks reason about?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref3","volume-title":"A Probabilistic Theory of Pattern Recognition, ser. Stochastic Modelling and Applied Probability","author":"Devroye","year":"1997"},{"issue":"226","key":"ref4","first-page":"1","article-title":"Statistical inference on random dot product graphs: A survey","volume":"18","author":"Athreya","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1112"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2012.699795"},{"key":"ref7","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"key":"ref8","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3007673"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2200\/S01045ED1V01Y202009AIM046"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOS1752"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005141"},{"key":"ref16","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"ref18","first-page":"15868","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":"ref19","article-title":"Can graph neural networks count substructures?","author":"Chen","year":"2020"},{"key":"ref20","first-page":"5723","article-title":"Graph neural tangent kernel: Fusing graph neural networks with graph kernels","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Du"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref22","first-page":"1","article-title":"Graph neural networks exponentially lose expressive power for node classification","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Oono"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3026980"},{"key":"ref24","first-page":"1","article-title":"Transferability of spectral graph convolutional neural networks","volume-title":"Proc. 13th Int. Conf. Sampling Theory Appl.","author":"Levie"},{"key":"ref25","first-page":"1","article-title":"Graphon neural networks and the transferability of graph neural networks","volume-title":"Proc. 34th Conf. Neural Inf. Process. Syst.","author":"Ruiz"},{"key":"ref26","article-title":"What graph neural networks cannot learn: Depth vs width","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Loukas"},{"key":"ref27","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref28","article-title":"Auto-encoding variational bayes","author":"Kingma","year":"2013"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.09.069"},{"key":"ref30","article-title":"Semi-supervised learning literature survey","author":"Zhu","year":"2005"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref32","article-title":"Consistency of adjacency spectral embedding for the mixed membership stochastic blockmodel","author":"Rubin-Delanchy","year":"2017"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1036"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/p18-1187"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403117"},{"key":"ref36","article-title":"A survey on the expressive power of graph neural networks","author":"Sato","year":"2020"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1814462116"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/4359286\/09513556.pdf?arnumber=9513556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T22:56:22Z","timestamp":1705013782000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9513556\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/tpami.2021.3104733","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":[[2021]]}}}