{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:13:50Z","timestamp":1775913230140,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":74,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China","award":["62072205, 61932004, U2241211, 62072034"],"award-info":[{"award-number":["62072205, 61932004, U2241211, 62072034"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,25]]},"DOI":"10.1145\/3637528.3671666","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T04:55:12Z","timestamp":1724561712000},"page":"1793-1803","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2194-8146","authenticated-orcid":false,"given":"Longlong","family":"Lin","sequence":"first","affiliation":[{"name":"College of Computer and Information Science, Southwest University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2337-2857","authenticated-orcid":false,"given":"Tao","family":"Jia","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Southwest University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5053-5201","authenticated-orcid":false,"given":"Zeli","family":"Wang","sequence":"additional","affiliation":[{"name":"Chongqing University of Post and Telecommunications, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4217-7886","authenticated-orcid":false,"given":"Jin","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8658-6599","authenticated-orcid":false,"given":"Rong-Hua","family":"Li","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Technology & Beijing Institute of Technology, Shenzhen, China"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90092-9"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/41\/22\/224001"},{"key":"e_1_3_2_2_3_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_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."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/070683933"},{"key":"e_1_3_2_2_6_1","volume-title":"Fast unfolding of communities in large networks: 15 years later. CoRR","author":"Blondel Vincent D.","year":"2023","unstructured":"Vincent D. Blondel, Jean-Loup Guillaume, and Renaud Lambiotte. 2023. Fast unfolding of communities in large networks: 15 years later. CoRR, Vol. abs\/2311.06047 (2023)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Aldo G. Carranza Ryan A. Rossi Anup Rao and Eunyee Koh. 2020. Higher-order Clustering in Complex Heterogeneous Networks. In KDD. 25--35.","DOI":"10.1145\/3394486.3403045"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00241"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Lu Chen Yunjun Gao Yuanliang Zhang Christian S. Jensen and Bolong Zheng. 2019. Efficient and Incremental Clustering Algorithms on Star-Schema Heterogeneous Graphs. In ICDE. 256--267.","DOI":"10.1109\/ICDE.2019.00031"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Wei-Lin Chiang Xuanqing Liu Si Si Yang Li Samy Bengio and Cho-Jui Hsieh. 2019. Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks. In KDD. 257--266.","DOI":"10.1145\/3292500.3330925"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Karen D. Devine Erik G. Boman and George Karypis. 2006. Partitioning and Load Balancing for Emerging Parallel Applications and Architectures. In Parallel Processing for Scientific Computing. 99--126.","DOI":"10.1137\/1.9780898718133.ch6"},{"key":"e_1_3_2_2_13_1","volume-title":"Malliaros","author":"Duval Alexandre","year":"2022","unstructured":"Alexandre Duval and Fragkiskos D. Malliaros. 2022. Higher-order Clustering and Pooling for Graph Neural Networks. In CIKM. 426--435."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.21136\/CPM.1969.108598"},{"key":"e_1_3_2_2_15_1","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erdos Paul","year":"1960","unstructured":"Paul Erdos, 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_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_3_2_2_18_1","volume-title":"Community detection in networks: A user guide. CoRR","author":"Fortunato Santo","year":"2016","unstructured":"Santo Fortunato and Darko Hric. 2016. Community detection in networks: A user guide. CoRR, Vol. abs\/1608.00163 (2016)."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Dongqi Fu Dawei Zhou and Jingrui He. 2020. Local Motif Clustering on Time-Evolving Graphs. In KDD. 390--400.","DOI":"10.1145\/3394486.3403081"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Dongqi Fu Dawei Zhou Ross Maciejewski Arie Croitoru Marcus Boyd and Jingrui He. 2023. Fairness-Aware Clique-Preserving Spectral Clustering of Temporal Graphs. In WWW. 3755--3765.","DOI":"10.1145\/3543507.3583423"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2831360.2831370"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Sen Gao Rong-Hua Li Hongchao Qin Hongzhi Chen Ye Yuan and Guoren Wang. 2022. Colorful h-star Core Decomposition. In ICDE.","DOI":"10.1109\/ICDE53745.2022.00239"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"David F. Gleich and C. Seshadhri. 2012. Vertex neighborhoods low conductance cuts and good seeds for local community methods. In KDD5.","DOI":"10.1145\/2339530.2339628"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Manish Gupta Jing Gao Yizhou Sun and Jiawei Han. 2012. Integrating community matching and outlier detection for mining evolutionary community outliers. In KDD. 859--867.","DOI":"10.1145\/2339530.2339667"},{"key":"e_1_3_2_2_25_1","volume-title":"Proceedings of the 7th Python in Science Conference. 11--15","author":"Hagberg Aric A.","unstructured":"Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. 2008. Exploring Network Structure, Dynamics, and Function using NetworkX. In Proceedings of the 7th Python in Science Conference. 11--15."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123915"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588923"},{"key":"e_1_3_2_2_28_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_29_1","doi-asserted-by":"crossref","unstructured":"Ling Huang Hong-Yang Chao and Guangqiang Xie. 2020. MuMod: A Micro-Unit Connection Approach for Hybrid-Order Community Detection. In AAAI. 107--114.","DOI":"10.1609\/aaai.v34i01.5340"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2956532"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Shixun Huang Yuchen Li Zhifeng Bao and Zhao Li. 2021. Towards Efficient Motif-based Graph Partitioning: An Adaptive Sampling Approach. In ICDE. 528--539.","DOI":"10.1109\/ICDE51399.2021.00052"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Zengfeng Huang Shengzhong Zhang Chong Xi Tang Liu and Min Zhou. 2021. Scaling Up Graph Neural Networks Via Graph Coarsening. In KDD. 675--684.","DOI":"10.1145\/3447548.3467256"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401969"},{"key":"e_1_3_2_2_34_1","volume-title":"DMCS: Density Modularity based Community Search. In SIGMOD. 889--903.","author":"Kim Junghoon","year":"2022","unstructured":"Junghoon Kim, Siqiang Luo, Gao Cong, and Wenyuan Yu. 2022. DMCS: Density Modularity based Community Search. In SIGMOD. 889--903."},{"key":"e_1_3_2_2_35_1","first-page":"784","article-title":"System and method for analyzing and dispositioning money laundering suspicious activity alerts","volume":"12","author":"Kloostra Brian James","year":"2009","unstructured":"Brian James Kloostra, Chaitanya Dalvi, and Brookton Noah Behm. 2009. System and method for analyzing and dispositioning money laundering suspicious activity alerts. US Patent App. 12\/258,784.","journal-title":"US Patent App."},{"key":"e_1_3_2_2_36_1","volume-title":"Kolda","author":"Klymko Christine","year":"2014","unstructured":"Christine Klymko, David F. Gleich, and Tamara G. Kolda. 2014. Using Triangles to Improve Community Detection in Directed Networks. CoRR, Vol. abs\/1404.5874 (2014)."},{"key":"e_1_3_2_2_37_1","volume-title":"Detecting the overlapping and hierarchical community structure in complex networks. New journal of physics","author":"Lancichinetti Andrea","year":"2009","unstructured":"Andrea Lancichinetti, Santo Fortunato, and J\u00e1nos Kert\u00e9sz. 2009. Detecting the overlapping and hierarchical community structure in complex networks. New journal of physics, Vol. 11, 3 (2009), 033015."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Pei-Zhen Li Ling Huang Chang-Dong Wang and Jian-Huang Lai. 2019. EdMot: An Edge Enhancement Approach for Motif-aware Community Detection. In KDD. 479--487.","DOI":"10.1145\/3292500.3330882"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407843"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Longlong Lin Ronghua Li and Tao Jia. 2023. Scalable and Effective Conductance-Based Graph Clustering. In AAAI. 4471--4478.","DOI":"10.1609\/aaai.v37i4.25568"},{"key":"e_1_3_2_2_41_1","first-page":"1537","article-title":"Mining Diversified Top-textdollarrtextdollarr Lasting Cohesive Subgraphs on Temporal Networks","volume":"8","author":"Lin Longlong","year":"2022","unstructured":"Longlong Lin, Pingpeng Yuan, Rong-Hua Li, and Hai Jin. 2022. Mining Diversified Top-textdollarrtextdollarr Lasting Cohesive Subgraphs on Temporal Networks. IEEE Trans. Big Data, Vol. 8, 6 (2022), 1537--1549.","journal-title":"IEEE Trans. Big Data"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2021.3071721"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3648160.3648163"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2133841100"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"R. Milo S. Shen-Orr S. Itzkovitz N. Kashtan D. Chklovskii and U. Alon. 2002. Network motifs: simple building blocks of complex networks. Science (2002).","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_2_46_1","volume-title":"Finding and evaluating community structure in networks. Physical review E","author":"Newman Mark EJ","year":"2004","unstructured":"Mark EJ Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Physical review E, Vol. 69, 2 (2004), 026113."},{"key":"e_1_3_2_2_47_1","volume-title":"Silva","author":"Ribeiro Pedro","year":"2022","unstructured":"Pedro Ribeiro, Pedro Paredes, Miguel E. P. Silva, David Apar\u00edcio, and Fernando M. A. Silva. 2022. A Survey on Subgraph Counting: Concepts, Algorithms, and Applications to Network Motifs and Graphlets. ACM Comput. Surv., Vol. 54, 2 (2022), 28:1--28:36."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"Ahmet Erdem Sariy\u00fcce. 2021. Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks. In WWW. 379--390.","DOI":"10.1145\/3442381.3450055"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Jianbo Shi and Jitendra Malik. 1997. Normalized Cuts and Image Segmentation. In CVPR. 731--737.","DOI":"10.1109\/CVPR.1997.609407"},{"key":"e_1_3_2_2_51_1","volume-title":"Fast Algorithm for Modularity-Based Graph Clustering","author":"Shiokawa Hiroaki","unstructured":"Hiroaki Shiokawa, Yasuhiro Fujiwara, and Makoto Onizuka. 2013. Fast Algorithm for Modularity-Based Graph Clustering. In AAAI. AAAI Press, 1170--1176."},{"key":"e_1_3_2_2_52_1","volume-title":"Tsourakakis","author":"Sotiropoulos Konstantinos","year":"2021","unstructured":"Konstantinos Sotiropoulos and Charalampos E. Tsourakakis. 2021. Triangle-aware Spectral Sparsifiers and Community Detection. In KDD,, Feida Zhu, Beng Chin Ooi, and Chunyan Miao (Eds.). 1501--1509."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401962"},{"key":"e_1_3_2_2_54_1","volume-title":"Lecture notes on graph partitioning, expanders and spectral methods","author":"Trevisan Luca","year":"2016","unstructured":"Luca Trevisan. 2017. Lecture notes on graph partitioning, expanders and spectral methods. University of California, Berkeley, https:\/\/people. eecs. berkeley. edu\/luca\/books\/expanders-2016. pdf (2017)."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"crossref","unstructured":"Charalampos E. Tsourakakis. 2015. The K-clique Densest Subgraph Problem. In WWW. 1122--1132.","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Charalampos E. Tsourakakis Jakub Pachocki and Michael Mitzenmacher. 2017. Scalable Motif-aware Graph Clustering. In WWW. 1451--1460.","DOI":"10.1145\/3038912.3052653"},{"key":"e_1_3_2_2_57_1","first-page":"436","article-title":"On an extremal problem in graph theory","volume":"48","author":"Turan P","year":"1941","unstructured":"P Turan. 1941. On an extremal problem in graph theory. Mat. Fiz. Lapok, Vol. 48, 137 (1941), 436--452.","journal-title":"Mat. Fiz. Lapok"},{"key":"e_1_3_2_2_58_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."},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098072"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"crossref","unstructured":"Zhewei Wei Xiaodong He Xiaokui Xiao Sibo Wang Shuo Shang and Ji-Rong Wen. 2018. TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs. In SIGMOD. 441--456.","DOI":"10.1145\/3183713.3196920"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2013.777436"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3108974"},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"crossref","unstructured":"Renchi Yang Jieming Shi Yin Yang Keke Huang Shiqi Zhang and Xiaokui Xiao. 2021. Effective and Scalable Clustering on Massive Attributed Graphs. In WWW. 3675--3687.","DOI":"10.1145\/3442381.3449875"},{"key":"e_1_3_2_2_64_1","volume-title":"Revealing the hidden language of complex networks. Scientific reports","author":"Yaverouglu \u00d6mer Nebil","year":"2014","unstructured":"\u00d6mer Nebil Yaverouglu, No\u00ebl Malod-Dognin, Darren Davis, Zoran Levnajic, Vuk Janjic, Rasa Karapandza, Aleksandar Stojmirovic, and Natavsa Prvzulj. 2014. Revealing the hidden language of complex networks. Scientific reports, Vol. 4, 1 (2014), 4547."},{"key":"e_1_3_2_2_65_1","volume-title":"Jure Leskovec, and David F. Gleich.","author":"Yin Hao","year":"2017","unstructured":"Hao Yin, Austin R. Benson, Jure Leskovec, and David F. Gleich. 2017. Local Higher-Order Graph Clustering. In KDD. 555--564."},{"key":"e_1_3_2_2_66_1","unstructured":"Zhitao Ying Jiaxuan You Christopher Morris Xiang Ren William L. Hamilton and Jure Leskovec. 2018. Hierarchical Graph Representation Learning with Differentiable Pooling. In NeurIPS. 4805--4815."},{"key":"e_1_3_2_2_67_1","volume-title":"Bo Xu, and Feng Xia.","author":"Yu Shuo","year":"2020","unstructured":"Shuo Yu, Yufan Feng, Da Zhang, Hayat Dino Bedru, Bo Xu, and Feng Xia. 2020. Motif discovery in networks: A survey. Comput. Sci. Rev. (2020)."},{"key":"e_1_3_2_2_68_1","volume-title":"SCE: Scalable Network Embedding from Sparsest Cut. In kdd. 257--265.","author":"Zhang Shengzhong","year":"2020","unstructured":"Shengzhong Zhang, Zengfeng Huang, Haicang Zhou, and Ziang Zhou. 2020. SCE: Scalable Network Embedding from Sparsest Cut. In kdd. 257--265."},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"crossref","unstructured":"Yifei Zhang Longlong Lin Pingpeng Yuan and Hai Jin. 2022. Significant Engagement Community Search on Temporal Networks. In DASFAA. 250--258.","DOI":"10.1007\/978-3-031-00123-9_20"},{"key":"e_1_3_2_2_70_1","unstructured":"Yilin Zhang and Karl Rohe. 2018. Understanding Regularized Spectral Clustering via Graph Conductance. In NeurIPS. 10654--10663."},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"crossref","unstructured":"Chen Zhe Aixin Sun and Xiaokui Xiao. 2019. Community Detection on Large Complex Attribute Network. In KDD. 2041--2049.","DOI":"10.1145\/3292500.3330721"},{"key":"e_1_3_2_2_72_1","volume-title":"Scott Alcorn, Hanghang Tong, Hasan Davulcu, and Jingrui He.","author":"Zhou Dawei","year":"2017","unstructured":"Dawei Zhou, Si Zhang, Mehmet Yigit Yildirim, Scott Alcorn, Hanghang Tong, Hasan Davulcu, and Jingrui He. 2017. A Local Algorithm for Structure-Preserving Graph Cut. In KDD. 655--664."},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3425637"},{"key":"e_1_3_2_2_74_1","volume-title":"Discovering Cohesive Temporal Subgraphs with Temporal Density Aware Exploration. Journal of Computer Science and Technology","author":"Zhu Chunxue","year":"2022","unstructured":"Chunxue Zhu, Longlong Lin, Pingpeng Yuan, and Hai Jin. 2022. Discovering Cohesive Temporal Subgraphs with Temporal Density Aware Exploration. Journal of Computer Science and Technology (2022)."}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Barcelona Spain","acronym":"KDD '24","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671666","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3671666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:00Z","timestamp":1750291560000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":74,"alternative-id":["10.1145\/3637528.3671666","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3671666","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}