{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:28:15Z","timestamp":1773246495569,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"French National Research Agency","award":["JCJC Project GraphIA (ANR-20-CE23- 0009-01)"],"award-info":[{"award-number":["JCJC Project GraphIA (ANR-20-CE23- 0009-01)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,17]]},"DOI":"10.1145\/3511808.3557353","type":"proceedings-article","created":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T01:29:57Z","timestamp":1665883797000},"page":"426-435","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Higher-order Clustering and Pooling for Graph Neural Networks"],"prefix":"10.1145","author":[{"given":"Alexandre","family":"Duval","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, CentraleSup\u00e9lec, Inria, Gif-sur-Yvette, France"}]},{"given":"Fragkiskos","family":"Malliaros","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, CentraleSup\u00e9lec, Inria, Gif-sur-Yvette, France"}]}],"member":"320","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Gianmarco De Francisci Morales, and Ashraf Aboulnaga","author":"AbuOda Ghadeer","year":"2019","unstructured":"Ghadeer AbuOda , Gianmarco De Francisci Morales, and Ashraf Aboulnaga . 2019 . Link prediction via higher-order motif features. arXiv preprint arXiv:1902.06679 (2019). Ghadeer AbuOda, Gianmarco De Francisci Morales, and Ashraf Aboulnaga. 2019. Link prediction via higher-order motif features. arXiv preprint arXiv:1902.06679 (2019)."},{"key":"e_1_3_2_1_2_1","unstructured":"James Atwood and Don Towsley. 2016. Diffusion-convolutional neural networks. In Advances in neural information processing systems. 1993--2001.  James Atwood and Don Towsley. 2016. Diffusion-convolutional neural networks. In Advances in neural information processing systems. 1993--2001."},{"key":"e_1_3_2_1_3_1","volume-title":"Accurate Learning of Graph Representations with Graph Multiset Pooling. arXiv preprint arXiv:2102.11533","author":"Baek Jinheon","year":"2021","unstructured":"Jinheon Baek , Minki Kang , and Sung Ju Hwang . 2021. Accurate Learning of Graph Representations with Graph Multiset Pooling. arXiv preprint arXiv:2102.11533 ( 2021 ). Jinheon Baek, Minki Kang, and Sung Ju Hwang. 2021. Accurate Learning of Graph Representations with Graph Multiset Pooling. arXiv preprint arXiv:2102.11533 (2021)."},{"key":"e_1_3_2_1_4_1","volume-title":"Science","volume":"353","author":"Benson Austin R","year":"2016","unstructured":"Austin R Benson , David F Gleich , and Jure Leskovec . 2016 . Higher-order organization of complex networks . Science , Vol. 353 , 6295 (2016), 163--166. Austin R Benson, David F Gleich, and Jure Leskovec. 2016. Higher-order organization of complex networks. Science, Vol. 353, 6295 (2016), 163--166."},{"key":"e_1_3_2_1_5_1","volume-title":"International Conference on Machine Learning. PMLR, 874--883","author":"Bianchi Filippo Maria","year":"2020","unstructured":"Filippo Maria Bianchi , Daniele Grattarola , and Cesare Alippi . 2020 . Spectral clustering with graph neural networks for graph pooling . In International Conference on Machine Learning. PMLR, 874--883 . Filippo Maria Bianchi, Daniele Grattarola, and Cesare Alippi. 2020. Spectral clustering with graph neural networks for graph pooling. In International Conference on Machine Learning. PMLR, 874--883."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403045"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of ICCM","volume":"2","author":"Chung Fan","year":"2007","unstructured":"Fan Chung . 2007 . Four proofs for the Cheeger inequality and graph partition algorithms . In Proceedings of ICCM , Vol. 2 . Citeseer, 378. Fan Chung. 2007. Four proofs for the Cheeger inequality and graph partition algorithms. In Proceedings of ICCM, Vol. 2. Citeseer, 378."},{"key":"e_1_3_2_1_9_1","volume-title":"Convolutional neural networks on graphs with fast localized spectral filtering. Advances in neural information processing systems","author":"Defferrard Micha\u00ebl","year":"2016","unstructured":"Micha\u00ebl Defferrard , Xavier Bresson , and Pierre Vandergheynst . 2016. Convolutional neural networks on graphs with fast localized spectral filtering. Advances in neural information processing systems , Vol. 29 ( 2016 ), 3844--3852. Micha\u00ebl Defferrard, Xavier Bresson, and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. Advances in neural information processing systems, Vol. 29 (2016), 3844--3852."},{"key":"e_1_3_2_1_10_1","volume-title":"Edge contraction pooling for graph neural networks. arXiv preprint arXiv:1905.10990","author":"Diehl Frederik","year":"2019","unstructured":"Frederik Diehl . 2019. Edge contraction pooling for graph neural networks. arXiv preprint arXiv:1905.10990 ( 2019 ). Frederik Diehl. 2019. Edge contraction pooling for graph neural networks. arXiv preprint arXiv:1905.10990 (2019)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3379997"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00097"},{"key":"e_1_3_2_1_13_1","volume-title":"international conference on machine learning. PMLR","author":"Gao Hongyang","year":"2019","unstructured":"Hongyang Gao and Shuiwang Ji . 2019 . Graph u-nets . In international conference on machine learning. PMLR , 2083--2092. Hongyang Gao and Shuiwang Ji. 2019. Graph u-nets. In international conference on machine learning. PMLR, 2083--2092."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems. 1025--1035","author":"Hamilton William L","year":"2017","unstructured":"William L Hamilton , Rex Ying , and Jure Leskovec . 2017 . Inductive representation learning on large graphs . In Proceedings of the 31st International Conference on Neural Information Processing Systems. 1025--1035 . William L Hamilton, Rex Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Proceedings of the 31st International Conference on Neural Information Processing Systems. 1025--1035."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa775"},{"key":"e_1_3_2_1_16_1","volume-title":"A probabilistic approach for optimizing spectral clustering. Advances in neural information processing systems","author":"Jin Rong","year":"2005","unstructured":"Rong Jin , Feng Kang , and Chris Ding . 2005. A probabilistic approach for optimizing spectral clustering. Advances in neural information processing systems , Vol. 18 ( 2005 ), 571--578. Rong Jin, Feng Kang, and Chris Ding. 2005. A probabilistic approach for optimizing spectral clustering. Advances in neural information processing systems, Vol. 18 (2005), 571--578."},{"key":"e_1_3_2_1_17_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 ( 2016 ). Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_1_18_1","volume-title":"Using triangles to improve community detection in directed networks. arXiv preprint arXiv:1404.5874","author":"Klymko Christine","year":"2014","unstructured":"Christine Klymko , David Gleich , and Tamara G Kolda . 2014. Using triangles to improve community detection in directed networks. arXiv preprint arXiv:1404.5874 ( 2014 ). Christine Klymko, David Gleich, and Tamara G Kolda. 2014. Using triangles to improve community detection in directed networks. arXiv preprint arXiv:1404.5874 (2014)."},{"key":"e_1_3_2_1_19_1","volume-title":"International Conference on Machine Learning. PMLR, 3734--3743","author":"Lee Junhyun","year":"2019","unstructured":"Junhyun Lee , Inyeop Lee , and Jaewoo Kang . 2019 . Self-attention graph pooling . In International Conference on Machine Learning. PMLR, 3734--3743 . Junhyun Lee, Inyeop Lee, and Jaewoo Kang. 2019. Self-attention graph pooling. In International Conference on Machine Learning. PMLR, 3734--3743."},{"key":"e_1_3_2_1_20_1","volume-title":"Higher-order graph convolutional networks. arXiv preprint arXiv:1809.07697","author":"Lee John Boaz","year":"2018","unstructured":"John Boaz Lee , Ryan A Rossi , Xiangnan Kong , Sungchul Kim , Eunyee Koh , and Anup Rao . 2018. Higher-order graph convolutional networks. arXiv preprint arXiv:1809.07697 ( 2018 ). John Boaz Lee, Ryan A Rossi, Xiangnan Kong, Sungchul Kim, Eunyee Koh, and Anup Rao. 2018. Higher-order graph convolutional networks. arXiv preprint arXiv:1809.07697 (2018)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3074654"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3133646"},{"key":"e_1_3_2_1_24_1","volume-title":"Clique pooling for graph classification. arXiv preprint arXiv:1904.00374","author":"Luzhnica Enxhell","year":"2019","unstructured":"Enxhell Luzhnica , Ben Day , and Pietro Lio . 2019. Clique pooling for graph classification. arXiv preprint arXiv:1904.00374 ( 2019 ). Enxhell Luzhnica, Ben Day, and Pietro Lio. 2019. Clique pooling for graph classification. arXiv preprint arXiv:1904.00374 (2019)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330982"},{"key":"e_1_3_2_1_26_1","volume-title":"Birds of a feather: Homophily in social networks. Annual review of sociology","author":"McPherson Miller","year":"2001","unstructured":"Miller McPherson , Lynn Smith-Lovin , and James M Cook . 2001. Birds of a feather: Homophily in social networks. Annual review of sociology , Vol. 27 , 1 ( 2001 ), 415--444. Miller McPherson, Lynn Smith-Lovin, and James M Cook. 2001. Birds of a feather: Homophily in social networks. Annual review of sociology, Vol. 27, 1 (2001), 415--444."},{"key":"e_1_3_2_1_27_1","volume-title":"Rethinking pooling in graph neural networks. arXiv preprint arXiv:2010.11418","author":"Mesquita Diego","year":"2020","unstructured":"Diego Mesquita , Amauri H Souza , and Samuel Kaski . 2020. Rethinking pooling in graph neural networks. arXiv preprint arXiv:2010.11418 ( 2020 ). Diego Mesquita, Amauri H Souza, and Samuel Kaski. 2020. Rethinking pooling in graph neural networks. arXiv preprint arXiv:2010.11418 (2020)."},{"key":"e_1_3_2_1_28_1","volume-title":"Science","volume":"298","author":"Milo Ron","year":"2002","unstructured":"Ron Milo , Shai Shen-Orr , Shalev Itzkovitz , Nadav Kashtan , Dmitri Chklovskii , and Uri Alon . 2002 . Network motifs: simple building blocks of complex networks . Science , Vol. 298 , 5594 (2002), 824--827. Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002. Network motifs: simple building blocks of complex networks. Science, Vol. 298, 5594 (2002), 824--827."},{"key":"e_1_3_2_1_29_1","volume-title":"Tudataset: A collection of benchmark datasets for learning with graphs. arXiv preprint arXiv:2007.08663","author":"Morris Christopher","year":"2020","unstructured":"Christopher Morris , Nils M Kriege , Franka Bause , Kristian Kersting , Petra Mutzel , and Marion Neumann . 2020 . Tudataset: A collection of benchmark datasets for learning with graphs. arXiv preprint arXiv:2007.08663 (2020). Christopher Morris, Nils M Kriege, Franka Bause, Kristian Kersting, Petra Mutzel, and Marion Neumann. 2020. Tudataset: A collection of benchmark datasets for learning with graphs. arXiv preprint arXiv:2007.08663 (2020)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463074"},{"key":"e_1_3_2_1_32_1","volume-title":"GRAPHSHAP: Motif-based Explanations for Black-box Graph Classifiers. arXiv preprint arXiv:2202.08815","author":"Perotti Alan","year":"2022","unstructured":"Alan Perotti , Paolo Bajardi , Francesco Bonchi , and Andr\u00e9 Panisson . 2022 . GRAPHSHAP: Motif-based Explanations for Black-box Graph Classifiers. arXiv preprint arXiv:2202.08815 (2022). Alan Perotti, Paolo Bajardi, Francesco Bonchi, and Andr\u00e9 Panisson. 2022. GRAPHSHAP: Motif-based Explanations for Black-box Graph Classifiers. arXiv preprint arXiv:2202.08815 (2022)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5997"},{"key":"e_1_3_2_1_34_1","volume-title":"Higher-order ranking and link prediction: From closing triangles to closing higher-order motifs. arXiv preprint arXiv:1906.05059","author":"Rossi Ryan A","year":"2019","unstructured":"Ryan A Rossi , Anup Rao , Sungchul Kim , Eunyee Koh , Nesreen K Ahmed , and Gang Wu. 2019. Higher-order ranking and link prediction: From closing triangles to closing higher-order motifs. arXiv preprint arXiv:1906.05059 ( 2019 ). Ryan A Rossi, Anup Rao, Sungchul Kim, Eunyee Koh, Nesreen K Ahmed, and Gang Wu. 2019. Higher-order ranking and link prediction: From closing triangles to closing higher-order motifs. arXiv preprint arXiv:1906.05059 (2019)."},{"key":"e_1_3_2_1_35_1","volume-title":"Graph clustering. Computer science review","author":"Schaeffer Satu Elisa","year":"2007","unstructured":"Satu Elisa Schaeffer . 2007. Graph clustering. Computer science review , Vol. 1 , 1 ( 2007 ), 27--64. Satu Elisa Schaeffer. 2007. Graph clustering. Computer science review, Vol. 1, 1 (2007), 27--64."},{"key":"e_1_3_2_1_36_1","volume-title":"Higher-order explanations of graph neural networks via relevant walks. arXiv preprint arXiv:2006.03589","author":"Schnake Thomas","year":"2020","unstructured":"Thomas Schnake , Oliver Eberle , Jonas Lederer , Shinichi Nakajima , Kristof T Sch\u00fctt , Klaus-Robert M\u00fcller , and Gr\u00e9goire Montavon . 2020. Higher-order explanations of graph neural networks via relevant walks. arXiv preprint arXiv:2006.03589 ( 2020 ). Thomas Schnake, Oliver Eberle, Jonas Lederer, Shinichi Nakajima, Kristof T Sch\u00fctt, Klaus-Robert M\u00fcller, and Gr\u00e9goire Montavon. 2020. Higher-order explanations of graph neural networks via relevant walks. arXiv preprint arXiv:2006.03589 (2020)."},{"key":"e_1_3_2_1_37_1","volume-title":"Higher-Order Relations Skew Link Prediction in Graphs. arXiv preprint arXiv:2111.00271","author":"Sharma Govind","year":"2021","unstructured":"Govind Sharma , Aditya Challa , Paarth Gupta , and M Narasimha Murty . 2021. Higher-Order Relations Skew Link Prediction in Graphs. arXiv preprint arXiv:2111.00271 ( 2021 ). Govind Sharma, Aditya Challa, Paarth Gupta, and M Narasimha Murty. 2021. Higher-Order Relations Skew Link Prediction in Graphs. arXiv preprint arXiv:2111.00271 (2021)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.11"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467260"},{"key":"e_1_3_2_1_41_1","volume-title":"Graph clustering with graph neural networks. arXiv preprint arXiv:2006.16904","author":"Tsitsulin Anton","year":"2020","unstructured":"Anton Tsitsulin , John Palowitch , Bryan Perozzi , and Emmanuel M\u00fcller . 2020. Graph clustering with graph neural networks. arXiv preprint arXiv:2006.16904 ( 2020 ). Anton Tsitsulin, John Palowitch, Bryan Perozzi, and Emmanuel M\u00fcller. 2020. Graph clustering with graph neural networks. arXiv preprint arXiv:2006.16904 (2020)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052653"},{"key":"e_1_3_2_1_43_1","volume-title":"A tutorial on spectral clustering. Statistics and computing","author":"Luxburg Ulrike Von","year":"2007","unstructured":"Ulrike Von Luxburg . 2007. A tutorial on spectral clustering. Statistics and computing , Vol. 17 , 4 ( 2007 ), 395--416. Ulrike Von Luxburg. 2007. A tutorial on spectral clustering. Statistics and computing, Vol. 17, 4 (2007), 395--416."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57182-5_65"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.382983"},{"key":"e_1_3_2_1_46_1","volume-title":"International conference on machine learning. PMLR, 9952--9962","author":"Wang Yu Guang","year":"2020","unstructured":"Yu Guang Wang , Ming Li , Zheng Ma , Guido Montufar , Xiaosheng Zhuang , and Yanan Fan . 2020 . Haar graph pooling . In International conference on machine learning. PMLR, 9952--9962 . Yu Guang Wang, Ming Li, Zheng Ma, Guido Montufar, Xiaosheng Zhuang, and Yanan Fan. 2020. Haar graph pooling. In International conference on machine learning. PMLR, 9952--9962."},{"key":"e_1_3_2_1_47_1","volume-title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu , Weihua Hu , Jure Leskovec , and Stefanie Jegelka . 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 ( 2018 ). Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3169219"},{"key":"e_1_3_2_1_49_1","volume-title":"Hierarchical graph representation learning with differentiable pooling. arXiv preprint arXiv:1806.08804","author":"Ying Rex","year":"2018","unstructured":"Rex Ying , Jiaxuan You , Christopher Morris , Xiang Ren , William L Hamilton , and Jure Leskovec . 2018. Hierarchical graph representation learning with differentiable pooling. arXiv preprint arXiv:1806.08804 ( 2018 ). Rex Ying, Jiaxuan You, Christopher Morris, Xiang Ren, William L Hamilton, and Jure Leskovec. 2018. Hierarchical graph representation learning with differentiable pooling. arXiv preprint arXiv:1806.08804 (2018)."},{"key":"e_1_3_2_1_50_1","volume-title":"GSAPool: Gated Structure Aware Pooling for Graph Representation Learning. In 2021 International Joint Conference on Neural Networks (IJCNN). 1--8. https:\/\/doi.org\/10","author":"Yu Hualei","year":"2021","unstructured":"Hualei Yu , Jinliang Yuan , Hao Cheng , Meng Cao , and Chongjun Wang . 2021 . GSAPool: Gated Structure Aware Pooling for Graph Representation Learning. In 2021 International Joint Conference on Neural Networks (IJCNN). 1--8. https:\/\/doi.org\/10 .1109\/IJCNN52387.2021.9534320 10.1109\/IJCNN52387.2021.9534320 Hualei Yu, Jinliang Yuan, Hao Cheng, Meng Cao, and Chongjun Wang. 2021. GSAPool: Gated Structure Aware Pooling for Graph Representation Learning. In 2021 International Joint Conference on Neural Networks (IJCNN). 1--8. https:\/\/doi.org\/10.1109\/IJCNN52387.2021.9534320"},{"key":"e_1_3_2_1_51_1","volume-title":"Proceedings of the 8th International Conference on Learning Representations.","author":"Yuan Hao","year":"2020","unstructured":"Hao Yuan and Shuiwang Ji . 2020 . Structpool: Structured graph pooling via conditional random fields . In Proceedings of the 8th International Conference on Learning Representations. Hao Yuan and Shuiwang Ji. 2020. Structpool: Structured graph pooling via conditional random fields. In Proceedings of the 8th International Conference on Learning Representations."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"}],"event":{"name":"CIKM '22: The 31st ACM International Conference on Information and Knowledge Management","location":"Atlanta GA USA","acronym":"CIKM '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 31st ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557353","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3511808.3557353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:29Z","timestamp":1750182569000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":53,"alternative-id":["10.1145\/3511808.3557353","10.1145\/3511808"],"URL":"https:\/\/doi.org\/10.1145\/3511808.3557353","relation":{},"subject":[],"published":{"date-parts":[[2022,10,17]]},"assertion":[{"value":"2022-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}