{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T18:38:20Z","timestamp":1776883100248,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":94,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T00:00:00Z","timestamp":1709510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Beijing National Research Center For Information Science And Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U19B2019, 62325405, U21B2031, 61832007, 62104128, 62204164"],"award-info":[{"award-number":["U19B2019, 62325405, U21B2031, 61832007, 62104128, 62204164"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Tsinghua-Meituan Joint Institute for Digital Life"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,3,4]]},"DOI":"10.1145\/3616855.3635788","type":"proceedings-article","created":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T18:18:12Z","timestamp":1709576292000},"page":"218-227","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3508-1755","authenticated-orcid":false,"given":"Tianyu","family":"Fu","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-8815-7948","authenticated-orcid":false,"given":"Chiyue","family":"Wei","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6108-5157","authenticated-orcid":false,"given":"Yu","family":"Wang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5856-5229","authenticated-orcid":false,"given":"Rex","family":"Ying","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, Connecticut, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,3,4]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl039"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.141"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433496"},{"key":"e_1_3_2_2_4_1","volume-title":"Topology of evolving networks: local events and universality. Physical review letters","author":"Albert R\u00e9ka","year":"2000","unstructured":"R\u00e9ka Albert and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 2000. Topology of evolving networks: local events and universality. Physical review letters, Vol. 85, 24 (2000), 5234."},{"key":"e_1_3_2_2_5_1","volume-title":"Graph partitioning and graph clustering","author":"Bader David A","unstructured":"David A Bader, Henning Meyerhenke, Peter Sanders, and Dorothea Wagner. 2013. Graph partitioning and graph clustering. Vol. 588. American Mathematical Society Providence, RI."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-4-2"},{"key":"e_1_3_2_2_7_1","volume-title":"Emergence of scaling in random networks. science","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. science, Vol. 286, 5439 (1999), 509--512."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1890\/05-0101"},{"key":"e_1_3_2_2_9_1","volume-title":"Noise reduction in speech processing","author":"Benesty Jacob","unstructured":"Jacob Benesty, Jingdong Chen, Yiteng Huang, and Israel Cohen. 2009. Pearson correlation coefficient. In Noise reduction in speech processing. Springer, 1--4."},{"key":"e_1_3_2_2_10_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."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"e_1_3_2_2_12_1","volume-title":"A subgraph isomorphism algorithm and its application to biochemical data. BMC bioinformatics","author":"Bonnici Vincenzo","year":"2013","unstructured":"Vincenzo Bonnici, Rosalba Giugno, Alfredo Pulvirenti, Dennis Shasha, and Alfredo Ferro. 2013. A subgraph isomorphism algorithm and its application to biochemical data. BMC bioinformatics, Vol. 14, 7 (2013), 1--13."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"e_1_3_2_2_14_1","volume-title":"Motif counting beyond five nodes. ACM Transactions on Knowledge Discovery from Data (TKDD)","author":"Bressan Marco","year":"2018","unstructured":"Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, and Alessandro Panconesi. 2018. Motif counting beyond five nodes. ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 12, 4 (2018), 1--25."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342640"},{"key":"e_1_3_2_2_16_1","volume-title":"Faster motif counting via succinct color coding and adaptive sampling. ACM Transactions on Knowledge Discovery from Data (TKDD)","author":"Bressan Marco","year":"2021","unstructured":"Marco Bressan, Stefano Leucci, and Alessandro Panconesi. 2021. Faster motif counting via succinct color coding and adaptive sampling. ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 15, 6 (2021), 1--27."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.07.018"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2019.20"},{"key":"e_1_3_2_2_19_1","volume-title":"Dwarvesgraph: A high-performance graph mining system with pattern decomposition. arXiv preprint arXiv:2008.09682","author":"Chen Jingji","year":"2020","unstructured":"Jingji Chen and Xuehai Qian. 2020. Dwarvesgraph: A high-performance graph mining system with pattern decomposition. arXiv preprint arXiv:2008.09682 (2020)."},{"key":"e_1_3_2_2_20_1","volume-title":"Can graph neural networks count substructures? ArXiv","author":"Chen Zhengdao","year":"2020","unstructured":"Zhengdao Chen, Lei Chen, Soledad Villar, and Joan Bruna. 2020. Can graph neural networks count substructures? ArXiv , Vol. abs\/2002.04025 (2020)."},{"key":"e_1_3_2_2_21_1","volume-title":"Carlo Sansone, and Mario Vento","author":"Cordella Luigi P","year":"2004","unstructured":"Luigi P Cordella, Pasquale Foggia, Carlo Sansone, and Mario Vento. 2004. A (sub) graph isomorphism algorithm for matching large graphs. IEEE transactions on pattern analysis and machine intelligence, Vol. 26, 10 (2004), 1367--1372."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1021\/jm00106a046"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0061183"},{"key":"e_1_3_2_2_24_1","volume-title":"Triangle Counting with A Multi-Core Computer. 2018 IEEE High Performance extreme Computing Conference (HPEC)","author":"Donato Evan","year":"2018","unstructured":"Evan Donato, Ming Ouyang, and Cristian Peguero-Isalguez. 2018. Triangle Counting with A Multi-Core Computer. 2018 IEEE High Performance extreme Computing Conference (HPEC) (2018), 1--7."},{"key":"e_1_3_2_2_25_1","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Paul","year":"1960","unstructured":"Paul ErdHo s, Alfr\u00e9d R\u00e9nyi, et al. 1960. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci, Vol. 5, 1 (1960), 17--60.","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2010.03.004"},{"key":"e_1_3_2_2_27_1","volume-title":"Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds.","author":"Fey Matthias","unstructured":"Matthias Fey and Jan E. Lenssen. 2019. Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.001"},{"key":"e_1_3_2_2_29_1","volume-title":"LessMine: Reducing Sample Space and Data Access for Dense Pattern Mining. In 2020 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, 1--7.","author":"Fu Tianyu","year":"2020","unstructured":"Tianyu Fu, Ziqian Wan, Guohao Dai, Yu Wang, and Huazhong Yang. 2020. LessMine: Reducing Sample Space and Data Access for Dense Pattern Mining. In 2020 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, 1--7."},{"key":"e_1_3_2_2_30_1","volume-title":"Testing for global network structure using small subgraph statistics. arXiv preprint arXiv:1710.00862","author":"Gao Chao","year":"2017","unstructured":"Chao Gao and John Lafferty. 2017. Testing for global network structure using small subgraph statistics. arXiv preprint arXiv:1710.00862 (2017)."},{"key":"e_1_3_2_2_31_1","unstructured":"Aric Hagberg Pieter Swart and Daniel S Chult. 2008. Exploring network structure dynamics and function using NetworkX. Technical Report. Los Alamos National Lab.(LANL) Los Alamos NM (United States)."},{"key":"e_1_3_2_2_32_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)."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"e_1_3_2_2_35_1","volume-title":"Local structure in social networks. Sociological methodology","author":"Holland Paul W","year":"1976","unstructured":"Paul W Holland and Samuel Leinhardt. 1976. Local structure in social networks. Sociological methodology , Vol. 7 (1976), 1--45."},{"key":"e_1_3_2_2_36_1","volume-title":"Growing scale-free networks with tunable clustering. Physical review E","author":"Holme Petter","year":"2002","unstructured":"Petter Holme and Beom Jun Kim. 2002. Growing scale-free networks with tunable clustering. Physical review E, Vol. 65, 2 (2002), 026107."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803390"},{"key":"e_1_3_2_2_38_1","volume-title":"13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18)","author":"Iyer Anand Padmanabha","year":"2018","unstructured":"Anand Padmanabha Iyer, Zaoxing Liu, Xin Jin, Shivaram Venkataraman, Vladimir Braverman, and Ion Stoica. 2018. $$ASAP$$: Fast, approximate graph pattern mining at scale. In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18). 745--761."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_2_40_1","volume-title":"Psychological predispositions and network structure: The relationship between individual predispositions, structural holes and network closure. Social networks","author":"Kalish Yuval","year":"2006","unstructured":"Yuval Kalish and Garry Robins. 2006. Psychological predispositions and network structure: The relationship between individual predispositions, structural holes and network closure. Social networks, Vol. 28, 1 (2006), 56--84."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth163"},{"key":"e_1_3_2_2_42_1","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 AA","year":"1968","unstructured":"AA Leman and Boris Weisfeiler. 1968. A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsiya, Vol. 2, 9 (1968), 12--16.","journal-title":"Nauchno-Technicheskaya Informatsiya"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_2_44_1","volume-title":"Network motif discovery: A GPU approach","author":"Lin Wenqing","year":"2016","unstructured":"Wenqing Lin, Xiaokui Xiao, Xing Xie, and Xiao-Li Li. 2016. Network motif discovery: A GPU approach. IEEE transactions on knowledge and data engineering, Vol. 29, 3 (2016), 513--528."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403247"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20725"},{"key":"e_1_3_2_2_47_1","volume-title":"Provably powerful graph networks. Advances in neural information processing systems","author":"Maron Haggai","year":"2019","unstructured":"Haggai Maron, Heli Ben-Hamu, Hadar Serviansky, and Yaron Lipman. 2019. Provably powerful graph networks. Advances in neural information processing systems , Vol. 32 (2019)."},{"key":"e_1_3_2_2_48_1","volume-title":"Graphzero: Breaking symmetry for efficient graph mining. arXiv preprint arXiv:1911.12877","author":"Mawhirter Daniel","year":"2019","unstructured":"Daniel Mawhirter, Sam Reinehr, Connor Holmes, Tongping Liu, and Bo Wu. 2019. Graphzero: Breaking symmetry for efficient graph mining. arXiv preprint arXiv:1911.12877 (2019)."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359633"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"e_1_3_2_2_51_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."},{"key":"e_1_3_2_2_52_1","volume-title":"Gaurav Rattan, and Martin Grohe.","author":"Morris Christopher","year":"2019","unstructured":"Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe. 2019. Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks. ArXiv , Vol. abs\/1810.02244 (2019)."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5517-9"},{"key":"e_1_3_2_2_54_1","volume-title":"k-hop Graph Neural Networks. Neural networks : the official journal of the International Neural Network Society","author":"Nikolentzos Giannis","year":"2020","unstructured":"Giannis Nikolentzos, George Dasoulas, and Michalis Vazirgiannis. 2020. k-hop Graph Neural Networks. Neural networks : the official journal of the International Neural Network Society , Vol. 130 (2020), 195--205."},{"key":"e_1_3_2_2_55_1","volume-title":"Revisiting graph neural networks: All we have is low-pass filters. arXiv preprint arXiv:1905.09550","author":"Nt Hoang","year":"2019","unstructured":"Hoang Nt and Takanori Maehara. 2019. Revisiting graph neural networks: All we have is low-pass filters. arXiv preprint arXiv:1905.09550 (2019)."},{"key":"e_1_3_2_2_56_1","volume-title":"Efficient orbit-aware triad and quad census in directed and undirected graphs. Applied network science","author":"Ortmann Mark","year":"2017","unstructured":"Mark Ortmann and Ulrik Brandes. 2017. Efficient orbit-aware triad and quad census in directed and undirected graphs. Applied network science, Vol. 2, 1 (2017), 1--17."},{"key":"e_1_3_2_2_57_1","volume-title":"Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems","author":"Paszke Adam","year":"2019","unstructured":"Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, et al. 2019. Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems , Vol. 32 (2019)."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.6084\/m9.figshare.1164194"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_2_2_60_1","first-page":"4","article-title":"Looking at social capital through triad structures","volume":"28","author":"Prell Christina","year":"2008","unstructured":"Christina Prell and John Skvoretz. 2008. Looking at social capital through triad structures. Connections, Vol. 28, 2 (2008), 4--16.","journal-title":"Connections"},{"key":"e_1_3_2_2_61_1","volume-title":"An atlas of graphs","author":"Read Ronald C","unstructured":"Ronald C Read and Robin J Wilson. 1998. An atlas of graphs. Vol. 21. Clarendon Press Oxford."},{"key":"e_1_3_2_2_62_1","volume-title":"Shaping graph pattern mining for financial risk. Neurocomputing","author":"Ribeiro Bernardete","year":"2017","unstructured":"Bernardete Ribeiro, Ning Chen, and Alexander Kovacec. 2017. Shaping graph pattern mining for financial risk. Neurocomputing (2017)."},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3433652"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15294-8_20"},{"key":"e_1_3_2_2_65_1","volume-title":"Ahmed","author":"Rossi Ryan A.","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. https:\/\/networkrepository.com"},{"key":"e_1_3_2_2_66_1","volume-title":"Finding network motifs using MCMC sampling","author":"Saha Tanay Kumar","unstructured":"Tanay Kumar Saha and Mohammad Al Hasan. 2015. Finding network motifs using MCMC sampling. In Complex Networks VI. Springer, 13--24."},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00104"},{"key":"e_1_3_2_2_68_1","volume-title":"A handbook of integer sequences","author":"Alexander Sloane Neil James","unstructured":"Neil James Alexander Sloane. 2014. A handbook of integer sequences. Academic Press."},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2007.1108"},{"key":"e_1_3_2_2_70_1","volume-title":"a curated reference set of aqueous solubility and 2D descriptors for a diverse set of compounds. Scientific data","author":"Sorkun Murat Cihan","year":"2019","unstructured":"Murat Cihan Sorkun, Abhishek Khetan, and S\u00fcleyman Er. 2019. AqSolDB, a curated reference set of aqueous solubility and 2D descriptors for a diverse set of compounds. Scientific data, Vol. 6, 1 (2019), 143."},{"key":"e_1_3_2_2_71_1","volume-title":"Motifs in brain networks. PLoS biology","author":"Sporns Olaf","year":"2004","unstructured":"Olaf Sporns, Rolf K\u00f6tter, and Karl J Friston. 2004. Motifs in brain networks. PLoS biology, Vol. 2, 11 (2004), e369."},{"key":"e_1_3_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380581"},{"key":"e_1_3_2_2_73_1","volume-title":"Graph mining: procedure, application to drug discovery and recent advances. Drug discovery today","author":"Takigawa Ichigaku","year":"2013","unstructured":"Ichigaku Takigawa and Hiroshi Mamitsuka. 2013. Graph mining: procedure, application to drug discovery and recent advances. Drug discovery today, Vol. 18, 1--2 (2013), 50--57."},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052653"},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.4236\/sn.2013.21004"},{"key":"e_1_3_2_2_76_1","series-title":"SIAM J. Comput. (1979)","volume-title":"The complexity of enumeration and reliability problems","author":"Valiant Leslie G","unstructured":"Leslie G Valiant. 1979. The complexity of enumeration and reliability problems. SIAM J. Comput. (1979)."},{"key":"e_1_3_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.026107"},{"key":"e_1_3_2_2_78_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_2_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2756836"},{"key":"e_1_3_2_2_80_1","doi-asserted-by":"crossref","unstructured":"Stanley Wasserman Katherine Faust et al. 1994. Social network analysis: Methods and applications. (1994).","DOI":"10.1017\/CBO9780511815478"},{"key":"e_1_3_2_2_81_1","volume-title":"Collective dynamics of \"small-world'networks. nature","author":"Watts Duncan J","year":"1998","unstructured":"Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of \"small-world'networks. nature, Vol. 393, 6684 (1998), 440--442."},{"key":"e_1_3_2_2_82_1","unstructured":"Melanie Weber. 2019. Curvature and Representation Learning: Identifying Embedding Spaces for Relational Data."},{"key":"e_1_3_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl038"},{"key":"e_1_3_2_2_84_1","volume-title":"Biological network motif detection: principles and practice. Briefings in bioinformatics","author":"Wong Elisabeth","year":"2012","unstructured":"Elisabeth Wong, Brittany Baur, Saad Quader, and Chun-Hsi Huang. 2012. Biological network motif detection: principles and practice. Briefings in bioinformatics, Vol. 13, 2 (2012), 202--215."},{"key":"e_1_3_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2803738"},{"key":"e_1_3_2_2_86_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)."},{"key":"e_1_3_2_2_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91452-7_18"},{"key":"e_1_3_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-015-1763-7"},{"key":"e_1_3_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290991"},{"key":"e_1_3_2_2_91_1","volume-title":"Garnett (Eds.)","volume":"31","author":"Ying Zhitao","year":"2018","unstructured":"Zhitao Ying, Jiaxuan You, Christopher Morris, Xiang Ren, Will Hamilton, and Jure Leskovec. 2018. Hierarchical Graph Representation Learning with Differentiable Pooling. In Advances in Neural Information Processing Systems, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (Eds.), Vol. 31. Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2018\/file\/e77dbaf6759253c7c6d0efc5690369c7-Paper.pdf"},{"key":"e_1_3_2_2_92_1","volume-title":"Identity-aware graph neural networks. arXiv preprint arXiv:2101.10320","author":"You Jiaxuan","year":"2021","unstructured":"Jiaxuan You, Jonathan Gomes-Selman, Rex Ying, and Jure Leskovec. 2021. Identity-aware graph neural networks. arXiv preprint arXiv:2101.10320 (2021)."},{"key":"e_1_3_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457289"},{"key":"e_1_3_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17332"}],"event":{"name":"WSDM '24: The 17th ACM International Conference on Web Search and Data Mining","location":"Merida Mexico","acronym":"WSDM '24","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 17th ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3616855.3635788","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3616855.3635788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:55:23Z","timestamp":1755824123000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3616855.3635788"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,4]]},"references-count":94,"alternative-id":["10.1145\/3616855.3635788","10.1145\/3616855"],"URL":"https:\/\/doi.org\/10.1145\/3616855.3635788","relation":{},"subject":[],"published":{"date-parts":[[2024,3,4]]},"assertion":[{"value":"2024-03-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}