{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T06:30:04Z","timestamp":1763706604214,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Project of Stable Support for Youth Team in Basic Research Field, CAS","award":["No.YSBR-005"],"award-info":[{"award-number":["No.YSBR-005"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.62072427, No.12227901"],"award-info":[{"award-number":["No.62072427, No.12227901"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Academic Leaders Cultivation Program, USTC"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599339","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:10:58Z","timestamp":1691172658000},"page":"2953-2964","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["EXTRACT and REFINE: Finding a Support Subgraph Set for Graph Representation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3346-5130","authenticated-orcid":false,"given":"Kuo","family":"Yang","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4728-7347","authenticated-orcid":false,"given":"Zhengyang","family":"Zhou","sequence":"additional","affiliation":[{"name":"Suzhou Institute for Advanced Research, University of Science and Technology of China, Suzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5827-3787","authenticated-orcid":false,"given":"Wei","family":"Sun","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2680-4563","authenticated-orcid":false,"given":"Pengkun","family":"Wang","sequence":"additional","affiliation":[{"name":"Suzhou Institute for Advanced Research, University of Science and Technology of China, Suzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1492-3477","authenticated-orcid":false,"given":"Xu","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6079-7053","authenticated-orcid":false,"given":"Yang","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Deep variational information bottleneck. arXiv preprint arXiv:1612.00410","author":"Alemi Alexander A","year":"2016","unstructured":"Alexander A Alemi , Ian Fischer , Joshua V Dillon , and Kevin Murphy . 2016. Deep variational information bottleneck. arXiv preprint arXiv:1612.00410 ( 2016 ). Alexander A Alemi, Ian Fischer, Joshua V Dillon, and Kevin Murphy. 2016. Deep variational information bottleneck. arXiv preprint arXiv:1612.00410 (2016)."},{"key":"e_1_3_2_2_2_1","first-page":"8017","article-title":"Subgraph neural networks","volume":"33","author":"Alsentzer Emily","year":"2020","unstructured":"Emily Alsentzer , Samuel Finlayson , Michelle Li , and Marinka Zitnik . 2020 . Subgraph neural networks . Advances in Neural Information Processing Systems , Vol. 33 (2020), 8017 -- 8029 . Emily Alsentzer, Samuel Finlayson, Michelle Li, and Marinka Zitnik. 2020. Subgraph neural networks. Advances in Neural Information Processing Systems, Vol. 33 (2020), 8017--8029.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_3_1","volume-title":"International Conference on Machine Learning. PMLR, 588--598","author":"Bai Yunsheng","year":"2021","unstructured":"Yunsheng Bai , Derek Xu , Yizhou Sun , and Wei Wang . 2021 . Glsearch: Maximum common subgraph detection via learning to search . In International Conference on Machine Learning. PMLR, 588--598 . Yunsheng Bai, Derek Xu, Yizhou Sun, and Wei Wang. 2021. Glsearch: Maximum common subgraph detection via learning to search. In International Conference on Machine Learning. PMLR, 588--598."},{"key":"e_1_3_2_2_4_1","first-page":"25280","article-title":"Graph neural networks with local graph parameters","volume":"34","author":"Barcel\u00f3 Pablo","year":"2021","unstructured":"Pablo Barcel\u00f3 , Floris Geerts , Juan Reutter , and Maksimilian Ryschkov . 2021 . Graph neural networks with local graph parameters . Advances in Neural Information Processing Systems , Vol. 34 (2021), 25280 -- 25293 . Pablo Barcel\u00f3, Floris Geerts, Juan Reutter, and Maksimilian Ryschkov. 2021. Graph neural networks with local graph parameters. Advances in Neural Information Processing Systems, Vol. 34 (2021), 25280--25293.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_5_1","volume-title":"Equivariant Subgraph Aggregation Networks. In International Conference on Learning Representations.","author":"Bevilacqua Beatrice","year":"2022","unstructured":"Beatrice Bevilacqua , Fabrizio Frasca , Derek Lim , Balasubramaniam Srinivasan , Chen Cai , Gopinath Balamurugan , Michael M Bronstein , and Haggai Maron . 2022 . Equivariant Subgraph Aggregation Networks. In International Conference on Learning Representations. Beatrice Bevilacqua, Fabrizio Frasca, Derek Lim, Balasubramaniam Srinivasan, Chen Cai, Gopinath Balamurugan, Michael M Bronstein, and Haggai Maron. 2022. Equivariant Subgraph Aggregation Networks. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3094"},{"key":"e_1_3_2_2_9_1","first-page":"13260","article-title":"Principal neighbourhood aggregation for graph nets","volume":"33","author":"Corso Gabriele","year":"2020","unstructured":"Gabriele Corso , Luca Cavalleri , Dominique Beaini , Pietro Li\u00f2 , and Petar Velivc kovi\u0107. 2020 . Principal neighbourhood aggregation for graph nets . Advances in Neural Information Processing Systems , Vol. 33 (2020), 13260 -- 13271 . Gabriele Corso, Luca Cavalleri, Dominique Beaini, Pietro Li\u00f2, and Petar Velivc kovi\u0107. 2020. Principal neighbourhood aggregation for graph nets. Advances in Neural Information Processing Systems, Vol. 33 (2020), 13260--13271.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1021\/jm00106a046"},{"key":"e_1_3_2_2_11_1","volume-title":"DISCOVERING AND EXPLAINING THE REPRESENTATION BOTTLENECK OF DNNS. In International Conference on Learning Representations.","author":"Deng Huiqi","year":"2021","unstructured":"Huiqi Deng , Qihan Ren , Hao Zhang , and Quanshi Zhang . 2021 . DISCOVERING AND EXPLAINING THE REPRESENTATION BOTTLENECK OF DNNS. In International Conference on Learning Representations. Huiqi Deng, Qihan Ren, Hao Zhang, and Quanshi Zhang. 2021. DISCOVERING AND EXPLAINING THE REPRESENTATION BOTTLENECK OF DNNS. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512201"},{"key":"e_1_3_2_2_13_1","volume-title":"Benchmarking graph neural networks. arXiv preprint arXiv:2003.00982","author":"Dwivedi Vijay Prakash","year":"2020","unstructured":"Vijay Prakash Dwivedi , Chaitanya K Joshi , Thomas Laurent , Yoshua Bengio , and Xavier Bresson . 2020. Benchmarking graph neural networks. arXiv preprint arXiv:2003.00982 ( 2020 ). Vijay Prakash Dwivedi, Chaitanya K Joshi, Thomas Laurent, Yoshua Bengio, and Xavier Bresson. 2020. Benchmarking graph neural networks. arXiv preprint arXiv:2003.00982 (2020)."},{"key":"e_1_3_2_2_14_1","volume-title":"Laks VS Lakshmanan, and Xuemin Lin","author":"Fang Yixiang","year":"2019","unstructured":"Yixiang Fang , Kaiqiang Yu , Reynold Cheng , Laks VS Lakshmanan, and Xuemin Lin . 2019 . Efficient algorithms for densest subgraph discovery. arXiv preprint arXiv:1906.00341 (2019). Yixiang Fang, Kaiqiang Yu, Reynold Cheng, Laks VS Lakshmanan, and Xuemin Lin. 2019. Efficient algorithms for densest subgraph discovery. arXiv preprint arXiv:1906.00341 (2019)."},{"key":"e_1_3_2_2_15_1","first-page":"31376","article-title":"Understanding and extending subgraph gnns by rethinking their symmetries","volume":"35","author":"Frasca Fabrizio","year":"2022","unstructured":"Fabrizio Frasca , Beatrice Bevilacqua , Michael Bronstein , and Haggai Maron . 2022 . Understanding and extending subgraph gnns by rethinking their symmetries . Advances in Neural Information Processing Systems , Vol. 35 (2022), 31376 -- 31390 . Fabrizio Frasca, Beatrice Bevilacqua, Michael Bronstein, and Haggai Maron. 2022. Understanding and extending subgraph gnns by rethinking their symmetries. Advances in Neural Information Processing Systems, Vol. 35 (2022), 31376--31390.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_16_1","volume-title":"Clustering by passing messages between data points. science","author":"Frey Brendan J","year":"2007","unstructured":"Brendan J Frey and Delbert Dueck . 2007. Clustering by passing messages between data points. science , Vol. 315 , 5814 ( 2007 ), 972--976. Brendan J Frey and Delbert Dueck. 2007. Clustering by passing messages between data points. science, Vol. 315, 5814 (2007), 972--976."},{"key":"e_1_3_2_2_17_1","volume-title":"Inductive representation learning on large graphs. Advances in neural information processing systems","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton , Zhitao Ying , and Jure Leskovec . 2017. Inductive representation learning on large graphs. Advances in neural information processing systems , Vol. 30 ( 2017 ). Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. Advances in neural information processing systems, Vol. 30 (2017)."},{"key":"e_1_3_2_2_18_1","volume-title":"Hongzhi Chen, and Ming-Chang Yang.","author":"Hou Yifan","year":"2022","unstructured":"Yifan Hou , Jian Zhang , James Cheng , Kaili Ma , Richard TB Ma , Hongzhi Chen, and Ming-Chang Yang. 2022 . Measuring and improving the use of graph information in graph neural networks. arXiv preprint arXiv:2206.13170 (2022). Yifan Hou, Jian Zhang, James Cheng, Kaili Ma, Richard TB Ma, Hongzhi Chen, and Ming-Chang Yang. 2022. Measuring and improving the use of graph information in graph neural networks. arXiv preprint arXiv:2206.13170 (2022)."},{"key":"e_1_3_2_2_19_1","volume-title":"International conference on machine learning. PMLR, 4839--4848","author":"Jin Wengong","year":"2020","unstructured":"Wengong Jin , Regina Barzilay , and Tommi Jaakkola . 2020 a. Hierarchical generation of molecular graphs using structural motifs . In International conference on machine learning. PMLR, 4839--4848 . Wengong Jin, Regina Barzilay, and Tommi Jaakkola. 2020a. Hierarchical generation of molecular graphs using structural motifs. In International conference on machine learning. PMLR, 4839--4848."},{"key":"e_1_3_2_2_20_1","volume-title":"International conference on machine learning. PMLR, 4849--4859","author":"Jin Wengong","year":"2020","unstructured":"Wengong Jin , Regina Barzilay , and Tommi Jaakkola . 2020 b. Multi-objective molecule generation using interpretable substructures . In International conference on machine learning. PMLR, 4849--4859 . Wengong Jin, Regina Barzilay, and Tommi Jaakkola. 2020b. Multi-objective molecule generation using interpretable substructures. In International conference on machine learning. PMLR, 4849--4859."},{"key":"e_1_3_2_2_21_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_2_22_1","first-page":"21618","article-title":"Rethinking graph transformers with spectral attention","volume":"34","author":"Kreuzer Devin","year":"2021","unstructured":"Devin Kreuzer , Dominique Beaini , Will Hamilton , Vincent L\u00e9tourneau , and Prudencio Tossou . 2021 . Rethinking graph transformers with spectral attention . Advances in Neural Information Processing Systems , Vol. 34 (2021), 21618 -- 21629 . Devin Kreuzer, Dominique Beaini, Will Hamilton, Vincent L\u00e9tourneau, and Prudencio Tossou. 2021. Rethinking graph transformers with spectral attention. Advances in Neural Information Processing Systems, Vol. 34 (2021), 21618--21629.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1982-0664049-X"},{"key":"e_1_3_2_2_24_1","volume-title":"Paul erdos is eighty","author":"Lov\u00e1sz L\u00e1szl\u00f3","year":"1993","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz . 1993. Random walks on graphs. Combinatorics , Paul erdos is eighty , Vol. 2 , 1--46 ( 1993 ), 4. L\u00e1szl\u00f3 Lov\u00e1sz. 1993. Random walks on graphs. Combinatorics, Paul erdos is eighty, Vol. 2, 1--46 (1993), 4."},{"key":"e_1_3_2_2_25_1","volume-title":"Parameterized explainer for graph neural network. Advances in neural information processing systems","author":"Luo Dongsheng","year":"2020","unstructured":"Dongsheng Luo , Wei Cheng , Dongkuan Xu , Wenchao Yu , Bo Zong , Haifeng Chen , and Xiang Zhang . 2020. Parameterized explainer for graph neural network. Advances in neural information processing systems , Vol. 33 ( 2020 ), 19620--19631. Dongsheng Luo, Wei Cheng, Dongkuan Xu, Wenchao Yu, Bo Zong, Haifeng Chen, and Xiang Zhang. 2020. Parameterized explainer for graph neural network. Advances in neural information processing systems, Vol. 33 (2020), 19620--19631."},{"key":"e_1_3_2_2_26_1","volume-title":"International Conference on Machine Learning. PMLR, 15524--15543","author":"Miao Siqi","year":"2022","unstructured":"Siqi Miao , Mia Liu , and Pan Li . 2022 . Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanism . In International Conference on Machine Learning. PMLR, 15524--15543 . Siqi Miao, Mia Liu, and Pan Li. 2022. Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanism. In International Conference on Machine Learning. PMLR, 15524--15543."},{"key":"e_1_3_2_2_27_1","volume-title":"International Conference on Machine Learning. PMLR, 8140--8151","author":"Nguyen Dung","year":"2021","unstructured":"Dung Nguyen and Anil Vullikanti . 2021 . Differentially private densest subgraph detection . In International Conference on Machine Learning. PMLR, 8140--8151 . Dung Nguyen and Anil Vullikanti. 2021. Differentially private densest subgraph detection. In International Conference on Machine Learning. PMLR, 8140--8151."},{"key":"e_1_3_2_2_28_1","first-page":"16211","article-title":"Random walk graph neural networks","volume":"33","author":"Nikolentzos Giannis","year":"2020","unstructured":"Giannis Nikolentzos and Michalis Vazirgiannis . 2020 . Random walk graph neural networks . Advances in Neural Information Processing Systems , Vol. 33 (2020), 16211 -- 16222 . Giannis Nikolentzos and Michalis Vazirgiannis. 2020. Random walk graph neural networks. Advances in Neural Information Processing Systems, Vol. 33 (2020), 16211--16222.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512194"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539366"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449822"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_3_2_2_34_1","volume-title":"Graph Attention Networks. In International Conference on Learning Representations.","author":"Veli\u010dkovi\u0107 Petar","year":"2018","unstructured":"Petar Veli\u010dkovi\u0107 , Guillem Cucurull , Arantxa Casanova , Adriana Romero , Pietro Li\u00f2 , and Yoshua Bengio . 2018 . Graph Attention Networks. In International Conference on Learning Representations. Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph Attention Networks. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_35_1","volume-title":"Equivariant and stable positional encoding for more powerful graph neural networks. arXiv preprint arXiv:2203.00199","author":"Wang Haorui","year":"2022","unstructured":"Haorui Wang , Haoteng Yin , Muhan Zhang , and Pan Li. 2022. Equivariant and stable positional encoding for more powerful graph neural networks. arXiv preprint arXiv:2203.00199 ( 2022 ). Haorui Wang, Haoteng Yin, Muhan Zhang, and Pan Li. 2022. Equivariant and stable positional encoding for more powerful graph neural networks. arXiv preprint arXiv:2203.00199 (2022)."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3093881"},{"key":"e_1_3_2_2_37_1","first-page":"20437","article-title":"Graph information bottleneck","volume":"33","author":"Wu Tailin","year":"2020","unstructured":"Tailin Wu , Hongyu Ren , Pan Li , and Jure Leskovec . 2020 . Graph information bottleneck . Advances in Neural Information Processing Systems , Vol. 33 (2020), 20437 -- 20448 . Tailin Wu, Hongyu Ren, Pan Li, and Jure Leskovec. 2020. Graph information bottleneck. Advances in Neural Information Processing Systems, Vol. 33 (2020), 20437--20448.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_38_1","volume-title":"MoleculeNet: a benchmark for molecular machine learning. Chemical science","author":"Wu Zhenqin","year":"2018","unstructured":"Zhenqin Wu , Bharath Ramsundar , Evan N Feinberg , Joseph Gomes , Caleb Geniesse , Aneesh S Pappu , Karl Leswing , and Vijay Pande . 2018. MoleculeNet: a benchmark for molecular machine learning. Chemical science , Vol. 9 , 2 ( 2018 ), 513--530. Zhenqin Wu, Bharath Ramsundar, Evan N Feinberg, Joseph Gomes, Caleb Geniesse, Aneesh S Pappu, Karl Leswing, and Vijay Pande. 2018. MoleculeNet: a benchmark for molecular machine learning. Chemical science, Vol. 9, 2 (2018), 513--530."},{"key":"e_1_3_2_2_39_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_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2018.8508729"},{"key":"e_1_3_2_2_42_1","unstructured":"Nianzu Yang Kaipeng Zeng Qitian Wu Xiaosong Jia and Junchi Yan. 2022. Learning substructure invariance for out-of-distribution molecular representations. In Advances in Neural Information Processing Systems.  Nianzu Yang Kaipeng Zeng Qitian Wu Xiaosong Jia and Junchi Yan. 2022. Learning substructure invariance for out-of-distribution molecular representations. In Advances in Neural Information Processing Systems."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01879"},{"key":"e_1_3_2_2_44_1","volume-title":"Graph information bottleneck for subgraph recognition. arXiv preprint arXiv:2010.05563","author":"Yu Junchi","year":"2020","unstructured":"Junchi Yu , Tingyang Xu , Yu Rong , Yatao Bian , Junzhou Huang , and Ran He. 2020. Graph information bottleneck for subgraph recognition. arXiv preprint arXiv:2010.05563 ( 2020 ). Junchi Yu, Tingyang Xu, Yu Rong, Yatao Bian, Junzhou Huang, and Ran He. 2020. Graph information bottleneck for subgraph recognition. arXiv preprint arXiv:2010.05563 (2020)."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403085"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512182"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20898"},{"key":"e_1_3_2_2_48_1","volume-title":"From stars to subgraphs: Uplifting any GNN with local structure awareness. arXiv preprint arXiv:2110.03753","author":"Zhao Lingxiao","year":"2021","unstructured":"Lingxiao Zhao , Wei Jin , Leman Akoglu , and Neil Shah . 2021. From stars to subgraphs: Uplifting any GNN with local structure awareness. arXiv preprint arXiv:2110.03753 ( 2021 ). Lingxiao Zhao, Wei Jin, Leman Akoglu, and Neil Shah. 2021. From stars to subgraphs: Uplifting any GNN with local structure awareness. arXiv preprint arXiv:2110.03753 (2021)."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5480"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17332"}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Long Beach CA USA","acronym":"KDD '23"},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599339","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:47Z","timestamp":1750178267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":50,"alternative-id":["10.1145\/3580305.3599339","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599339","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}