{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T05:46:26Z","timestamp":1777873586428,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":69,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100006374","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2023A1515011280;2025A1515010439"],"award-info":[{"award-number":["2023A1515011280;2025A1515010439"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Ant Group","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Shenzhen Research Institute of Big Data","doi-asserted-by":"publisher","award":["SIF20240004"],"award-info":[{"award-number":["SIF20240004"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Provincial Key Laboratory of Big Data Computing"},{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62302421;62302397"],"award-info":[{"award-number":["62302421;62302397"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Laboratory for Advanced Computing and Intelligence Engineering","award":["No. 2023-LYJJ-01-021"],"award-info":[{"award-number":["No. 2023-LYJJ-01-021"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,3]]},"DOI":"10.1145\/3711896.3737170","type":"proceedings-article","created":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T13:32:14Z","timestamp":1754055134000},"page":"95-106","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["UnG-MoCha: Neural Motif Counting in Uncertain Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9049-6739","authenticated-orcid":false,"given":"Lujie","family":"Ban","sequence":"first","affiliation":[{"name":"School of Data Science, The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4347-1692","authenticated-orcid":false,"given":"Xiaolin","family":"Han","sequence":"additional","affiliation":[{"name":"School of Computer Science, The Northwestern Polytechnical University, Xi'an, Shaanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7003-2153","authenticated-orcid":false,"given":"Jinyang","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3243-8512","authenticated-orcid":false,"given":"Chenhao","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Data Science, The Chinese University of Hong Kong, Shenzhen, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38724"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.141"},{"key":"e_1_3_2_2_4_1","volume-title":"Predicting protein complex membership using probabilistic network reliability. Genome research","author":"Asthana Saurabh","year":"2004","unstructured":"Saurabh Asthana, Oliver D King, Francis D Gibbons, and Frederick P Roth. 2004. Predicting protein complex membership using probabilistic network reliability. Genome research, Vol. 14, 6 (2004), 1170-1175."},{"key":"e_1_3_2_2_5_1","unstructured":"Manuel Bodirsky. 2015. Graph homomorphisms and universal algebra course notes. TU Dresden(2015)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Paolo Boldi Francesco Bonchi Aris Gionis and Tamir Tassa. 2012. Injecting uncertainty in graphs for identity obfuscation. arXiv preprint arXiv:1208.4145(2012).","DOI":"10.14778\/2350229.2350254"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018732"},{"key":"e_1_3_2_2_8_1","volume-title":"Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3","author":"Carletti Vincenzo","year":"2017","unstructured":"Vincenzo Carletti, Pasquale Foggia, Alessia Saggese, and Mario Vento. 2017. Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3. IEEE transactions on pattern analysis and machine intelligence, Vol. 40, 4 (2017), 804-818."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18224-7_17"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00161"},{"key":"e_1_3_2_2_11_1","volume-title":"Mining graphlet counts in online social networks. ACM Transactions on Knowledge Discovery from Data (TKDD)","author":"Chen Xiaowei","year":"2018","unstructured":"Xiaowei Chen and John CS Lui. 2018. Mining graphlet counts in online social networks. ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 12, 4 (2018), 1-38."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.88"},{"key":"e_1_3_2_2_13_1","unstructured":"OpenStreetMap Contributors. 2017. Roadnet Data. https:\/\/www.openstreetmap.org"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.12.114"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/00949657908810285"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0165-4896(82)90076-2"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-022-00956-y"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.201"},{"key":"e_1_3_2_2_19_1","volume-title":"International conference on machine learning. PMLR, 1263-1272","author":"Gilmer Justin","year":"2017","unstructured":"Justin Gilmer, Samuel S Schoenholz, Patrick F Riley, Oriol Vinyals, and George E Dahl. 2017. Neural message passing for quantum chemistry. In International conference on machine learning. PMLR, 1263-1272."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00943"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable Feature Learning for Networks. arxiv:1607.00653 [cs.SI]","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737791"},{"key":"e_1_3_2_2_23_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_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_3_2_2_25_1","unstructured":"Weihua Hu Bowen Liu Joseph Gomes Marinka Zitnik Percy Liang Vijay Pande and Jure Leskovec. 2019. Strategies for pre-training graph neural networks. arXiv preprint arXiv:1905.12265(2019)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4380-9_35"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.11.015"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0507841103"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00749-x"},{"key":"e_1_3_2_2_32_1","unstructured":"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_33_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature04670"},{"key":"e_1_3_2_2_34_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_35_1","doi-asserted-by":"crossref","unstructured":"Claude Lemar\u00e9chal. 2001. Lagrangian relaxation. Computational combinatorial optimization: optimal or provably near-optimal solutions(2001) 112-156.","DOI":"10.1007\/3-540-45586-8_4"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3417440"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403247"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20725"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364330"},{"key":"e_1_3_2_2_41_1","unstructured":"Samuel Madden. 2004. Intel lab data. http:\/\/db.csail.mit.edu\/labdata\/labdata.html"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx758"},{"key":"e_1_3_2_2_43_1","first-page":"824","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_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687738"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2819651"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11671"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16112-9_2"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824115"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551803"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"crossref","unstructured":"Zhao Sun Hongzhi Wang Haixun Wang Bin Shao and Jianzhong Li. 2012. Efficient subgraph matching on billion node graphs. arXiv preprint arXiv:1205.6691(2012).","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_3_2_2_52_1","volume-title":"Canonical correlation analysis: Uses and interpretation. Number 47","author":"Thompson Bruce","unstructured":"Bruce Thompson. 1984. Canonical correlation analysis: Uses and interpretation. Number 47. Sage."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2808719.2808731"},{"key":"e_1_3_2_2_54_1","volume-title":"Kwok Pui Choi, and Louxin Zhang","author":"Tran Ngoc Hieu","year":"2013","unstructured":"Ngoc Hieu Tran, Kwok Pui Choi, and Louxin Zhang. 2013. Counting motifs in the human interactome. Nature communications, Vol. 4, 1 (2013), 2241."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_2_56_1","unstructured":"Petar Velickovic 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_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526163"},{"key":"e_1_3_2_2_58_1","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_59_1","doi-asserted-by":"publisher","DOI":"10.1002\/pmic.200300636"},{"key":"e_1_3_2_2_60_1","unstructured":"Xingtong Yu Zemin Liu Yuan Fang and Xinming Zhang. 2023. Learning to count isomorphisms with graph neural networks. arXiv preprint arXiv:2302.03266(2023)."},{"key":"e_1_3_2_2_61_1","volume-title":"International Conference on Machine Learning. PMLR, 7154-7163","author":"Yu Yue","year":"2019","unstructured":"Yue Yu, Jie Chen, Tian Gao, and Mo Yu. 2019. DAG-GNN: DAG structure learning with graph neural networks. In International Conference on Machine Learning. PMLR, 7154-7163."},{"key":"e_1_3_2_2_62_1","first-page":"76","article-title":"From canonical correlation analysis to self-supervised graph neural networks","volume":"34","author":"Zhang Hengrui","year":"2021","unstructured":"Hengrui Zhang, Qitian Wu, Junchi Yan, David Wipf, and Philip S Yu. 2021. From canonical correlation analysis to self-supervised graph neural networks. Advances in Neural Information Processing Systems, Vol. 34 (2021), 76-89.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/594"},{"key":"e_1_3_2_2_64_1","first-page":"15734","article-title":"Nested graph neural networks","volume":"34","author":"Zhang Muhan","year":"2021","unstructured":"Muhan Zhang and Pan Li. 2021. Nested graph neural networks. Advances in Neural Information Processing Systems, Vol. 34 (2021), 15734-15747.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_65_1","unstructured":"Zhen Zhang Jiajun Bu Martin Ester Jianfeng Zhang Chengwei Yao Zhi Yu and Can Wang. 2019a. Hierarchical Graph Pooling with Structure Learning. arXiv preprint arXiv:1911.05954(2019)."},{"key":"e_1_3_2_2_66_1","volume-title":"Qiyan Li, Hao Zhang, and Yu Rong.","author":"Zhao Kangfei","year":"2023","unstructured":"Kangfei Zhao, Jeffrey Xu Yu, Qiyan Li, Hao Zhang, and Yu Rong. 2023. Learned sketch for subgraph counting: a holistic approach. The VLDB Journal(2023), 1-26."},{"key":"e_1_3_2_2_67_1","volume-title":"International Conference on Machine Learning. PMLR, 11458-11468","author":"Zheng Cheng","year":"2020","unstructured":"Cheng Zheng, Bo Zong, Wei Cheng, Dongjin Song, Jingchao Ni, Wenchao Yu, Haifeng Chen, and Wei Wang. 2020. Robust graph representation learning via neural sparsification. In International Conference on Machine Learning. PMLR, 11458-11468."},{"key":"e_1_3_2_2_68_1","unstructured":"Alexander Zhou Yue Wang and Lei Chen. 2023. Butterfly counting and bitruss decomposition on uncertain bipartite graphs. The VLDB Journal(2023) 1-24."},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3681975"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711896.3737170","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T18:04:57Z","timestamp":1777572297000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711896.3737170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"references-count":69,"alternative-id":["10.1145\/3711896.3737170","10.1145\/3711896"],"URL":"https:\/\/doi.org\/10.1145\/3711896.3737170","relation":{},"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"2025-08-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}