{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:09Z","timestamp":1750220289722,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3477314.3507100","type":"proceedings-article","created":{"date-parts":[[2022,5,7]],"date-time":"2022-05-07T00:37:36Z","timestamp":1651883856000},"page":"592-599","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Compact graph neural network models for node classification"],"prefix":"10.1145","author":[{"given":"Luca","family":"Pasa","sequence":"first","affiliation":[{"name":"University of Padua, Padova, Italy"}]},{"given":"Nicol\u00f2","family":"Navarin","sequence":"additional","affiliation":[{"name":"University of Padua, Padova, Italy"}]},{"given":"Alessandro","family":"Sperduti","sequence":"additional","affiliation":[{"name":"University of Padua, Padova, Italy"}]}],"member":"320","published-online":{"date-parts":[[2022,5,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Are powerful graph neural nets necessary? a dissection on graph classification. arXiv preprint arXiv:1905.04579","author":"Chen Ting","year":"2019","unstructured":"Ting Chen, Song Bian, and Yizhou Sun. 2019. Are powerful graph neural nets necessary? a dissection on graph classification. arXiv preprint arXiv:1905.04579 (2019)."},{"key":"e_1_3_2_1_2_1","unstructured":"Micha\u00ebl Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In NIPS. 3844--3852."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1051\/0004-6361\/201527329"},{"key":"e_1_3_2_1_4_1","volume-title":"Zemel","author":"Liao Renjie","year":"2019","unstructured":"Renjie Liao, Zhizhen Zhao, Raquel Urtasun, and Richard S. Zemel. 2019. Lanczos-Net: Multi-Scale Deep Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_1_5_1","unstructured":"Sitao Luan Mingde Zhao Xiao-Wen Chang and Doina Precup. 2019. Break the ceiling: Stronger multi-scale deep graph convolutional networks. In Advances in neural information processing systems. 10945--10955."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"e_1_3_2_1_7_1","volume-title":"Linear Graph Convolutional Networks. In 28th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2020","author":"Navarin Nicol\u00f2","year":"2020","unstructured":"Nicol\u00f2 Navarin, Wolfgang Erb, Luca Pasa, and Alessandro Sperduti. 2020. Linear Graph Convolutional Networks. In 28th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2020, Bruges, Belgium, October 2--4, 2020. 151--156. https:\/\/www.esann.org\/sites\/default\/files\/proceedings\/2020\/ES2020-96.pdf"},{"key":"e_1_3_2_1_8_1","volume-title":"Simple Graph Convolutional Networks. CoRR abs\/2106.05809","author":"Pasa Luca","year":"2021","unstructured":"Luca Pasa, Nicol\u00f2 Navarin, Wolfgang Erb, and Alessandro Sperduti. 2021. Simple Graph Convolutional Networks. CoRR abs\/2106.05809 (2021). arXiv:2106.05809 https:\/\/arxiv.org\/abs\/2106.05809"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3090503"},{"key":"e_1_3_2_1_10_1","volume-title":"Polynomial-based graph convolutional neural networks for graph classification. Machine Learning","author":"Pasa Luca","year":"2021","unstructured":"Luca Pasa, Nicol\u00f2 Navarin, and Alessandro Sperduti. 2021. Polynomial-based graph convolutional neural networks for graph classification. Machine Learning (2021), 1--33."},{"key":"e_1_3_2_1_11_1","volume-title":"Graph attention networks. arXiv preprint arXiv:1710.10903","author":"Veli\u010dkovi\u0107 Petar","year":"2017","unstructured":"Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)."},{"key":"e_1_3_2_1_12_1","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR."},{"key":"e_1_3_2_1_13_1","volume-title":"Highly-Performant Package for Graph Neural Networks. arXiv preprint arXiv:1909.01315","author":"Wang Minjie","year":"2019","unstructured":"Minjie Wang, Da Zheng, Zihao Ye, Quan Gan, Mufei Li, Xiang Song, Jinjing Zhou, Chao Ma, Lingfan Yu, Yu Gai, Tianjun Xiao, Tong He, George Karypis, Jinyang Li, and Zheng Zhang. 2019. Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks. arXiv preprint arXiv:1909.01315 (2019)."},{"key":"e_1_3_2_1_14_1","volume-title":"Christopher Fifty, Tao Yu, and Kilian Q. Weinberger.","author":"Wu Felix","year":"2019","unstructured":"Felix Wu, Tianyi Zhang, Amauri Holanda de Souza, Christopher Fifty, Tao Yu, and Kilian Q. Weinberger. 2019. Simplifying Graph Convolutional Networks. ICML (feb 2019)."}],"event":{"name":"SAC '22: The 37th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Virtual Event","acronym":"SAC '22"},"container-title":["Proceedings of the 37th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477314.3507100","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477314.3507100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:28Z","timestamp":1750188688000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477314.3507100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":14,"alternative-id":["10.1145\/3477314.3507100","10.1145\/3477314"],"URL":"https:\/\/doi.org\/10.1145\/3477314.3507100","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-05-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}