{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T15:29:01Z","timestamp":1787758141179,"version":"build-2784847793"},"publisher-location":"New York, NY, USA","reference-count":71,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-2414308, IIS-2144285, CCF-2230161, CCF-2230162"],"award-info":[{"award-number":["IIS-2414308, IIS-2144285, CCF-2230161, CCF-2230162"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Air Force Office of Scientific Researche","award":["FA9550-22-1-0362"],"award-info":[{"award-number":["FA9550-22-1-0362"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,4,22]]},"DOI":"10.1145\/3696410.3714586","type":"proceedings-article","created":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T22:52:18Z","timestamp":1745362338000},"page":"1273-1291","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Generalization Performance of Hypergraph Neural Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6312-4663","authenticated-orcid":false,"given":"Yifan","family":"Wang","sequence":"first","affiliation":[{"name":"University of Delaware, Newark, DE, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7163-7111","authenticated-orcid":false,"given":"Gonzalo R.","family":"Arce","sequence":"additional","affiliation":[{"name":"University of Delaware, Newark, DE, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3247-4019","authenticated-orcid":false,"given":"Guangmo","family":"Tong","sequence":"additional","affiliation":[{"name":"University of Delaware, Newark, DE, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","article-title":"Community detection and stochastic block models: recent developments","volume":"18","author":"Abbe Emmanuel","year":"2018","unstructured":"Emmanuel Abbe. 2018. Community detection and stochastic block models: recent developments. Journal of Machine Learning Research, Vol. 18, 177 (2018), 1--86.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3605776"},{"key":"e_1_3_2_1_3_1","volume-title":"Hypersage: Generalizing inductive representation learning on hypergraphs. arXiv preprint arXiv:2010.04558","author":"Arya Devanshu","year":"2020","unstructured":"Devanshu Arya, Deepak K Gupta, Stevan Rudinac, and Marcel Worring. 2020. Hypersage: Generalizing inductive representation learning on hypergraphs. arXiv preprint arXiv:2010.04558 (2020)."},{"key":"e_1_3_2_1_4_1","unstructured":"Waiss Azizian and marc lelarge. 2021. Expressive Power of Invariant and Equivariant Graph Neural Networks. In ICLR. https:\/\/openreview.net\/forum?id=lxHgXYN4bwl"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107637"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44581-1_15"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-021-09975-1"},{"key":"e_1_3_2_1_8_1","unstructured":"Cristian Bodnar Fabrizio Frasca Yuguang Wang Nina Otter Guido F Montufar Pietro Lio and Michael Bronstein. 2021. Weisfeiler and lehman go topological: Message passing simplicial networks. In ICML. PMLR 1026--1037."},{"key":"e_1_3_2_1_9_1","volume-title":"Graph structure in the web. Computer networks","author":"Broder Andrei","year":"2000","unstructured":"Andrei Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, and Janet Wiener. 2000. Graph structure in the web. Computer networks, Vol. 33, 1--6 (2000), 309--320."},{"key":"e_1_3_2_1_10_1","unstructured":"Eli Chien Chao Pan Jianhao Peng and Olgica Milenkovic. 2022. You are AllSet: A Multiset Function Framework for Hypergraph Neural Networks. In ICLR. https:\/\/openreview.net\/forum?id=hpBTIv2uy_E"},{"key":"e_1_3_2_1_11_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 871--879","author":"Chien I","year":"2018","unstructured":"I Chien, Chung-Yi Lin, and I-Hsiang Wang. 2018. Community detection in hypergraphs: Optimal statistical limit and efficient algorithms. In International Conference on Artificial Intelligence and Statistics. PMLR, 871--879."},{"key":"e_1_3_2_1_12_1","first-page":"1713","article-title":"Reconstruction for powerful graph representations","volume":"34","author":"Cotta Leonardo","year":"2021","unstructured":"Leonardo Cotta, Christopher Morris, and Bruno Ribeiro. 2021. Reconstruction for powerful graph representations. Advances in Neural Information Processing Systems, Vol. 34 (2021), 1713--1726.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_13_1","series-title":"SIAM Journal on computing","volume-title":"An optimal algorithm for Monte Carlo estimation","author":"Dagum Paul","year":"2000","unstructured":"Paul Dagum, Richard Karp, Michael Luby, and Sheldon Ross. 2000. An optimal algorithm for Monte Carlo estimation. SIAM Journal on computing, Vol. 29, 5 (2000), 1484--1496."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2024.109538"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403060"},{"key":"e_1_3_2_1_16_1","volume-title":"Hnhn: Hypergraph networks with hyperedge neurons. arXiv preprint arXiv:2006.12278","author":"Dong Yihe","year":"2020","unstructured":"Yihe Dong, Will Sawin, and Yoshua Bengio. 2020. Hnhn: Hypergraph networks with hyperedge neurons. arXiv preprint arXiv:2006.12278 (2020)."},{"key":"e_1_3_2_1_17_1","volume-title":"Graph neural tangent kernel: Fusing graph neural networks with graph kernels. Advances in neural information processing systems","author":"Du Simon S","year":"2019","unstructured":"Simon S Du, Kangcheng Hou, Russ R Salakhutdinov, Barnabas Poczos, Ruosong Wang, and Keyulu Xu. 2019. Graph neural tangent kernel: Fusing graph neural networks with graph kernels. Advances in neural information processing systems, Vol. 32 (2019)."},{"key":"e_1_3_2_1_18_1","volume-title":"Advances in Neural Information Processing Systems","volume":"36","author":"Duta Iulia","year":"2024","unstructured":"Iulia Duta, Giulia Cassar\u00e0, Fabrizio Silvestri, and Pietro Li\u00f2. 2024. Sheaf hypergraph networks. Advances in Neural Information Processing Systems, Vol. 36 (2024)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"David Easley Jon Kleinberg et al. 2010. Networks crowds and markets: Reasoning about a highly connected world. Vol. 1. Cambridge university press Cambridge.","DOI":"10.1017\/CBO9780511761942"},{"key":"e_1_3_2_1_20_1","first-page":"27043","article-title":"Learning theory can (sometimes) explain generalisation in graph neural networks","volume":"34","author":"Esser Pascal","year":"2021","unstructured":"Pascal Esser, Leena Chennuru Vankadara, and Debarghya Ghoshdastidar. 2021. Learning theory can (sometimes) explain generalisation in graph neural networks. NeurIPS, Vol. 34 (2021), 27043--27056.","journal-title":"NeurIPS"},{"key":"e_1_3_2_1_21_1","volume-title":"Oh (Eds.)","volume":"35","author":"Feng Jiarui","year":"2022","unstructured":"Jiarui Feng, Yixin Chen, Fuhai Li, Anindya Sarkar, and Muhan Zhang. 2022. How Powerful are K-hop Message Passing Graph Neural Networks. In NeurIPS, S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, and A. Oh (Eds.), Vol. 35. Curran Associates, Inc., 4776--4790. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2022\/file\/1ece70d2259b8e9510e2d4ca8754cecf-Paper-Conference.pdf"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/279943.279985"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3182052"},{"key":"e_1_3_2_1_25_1","first-page":"2548","article-title":"Hypergraph learning: Methods and practices","volume":"44","author":"Gao Yue","year":"2020","unstructured":"Yue Gao, Zizhao Zhang, Haojie Lin, Xibin Zhao, Shaoyi Du, and Changqing Zou. 2020. Hypergraph learning: Methods and practices. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 44, 5 (2020), 2548--2566.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_2_1_26_1","volume-title":"The expressive power of kth-order invariant graph networks. arXiv preprint arXiv:2007.12035","author":"Geerts Floris","year":"2020","unstructured":"Floris Geerts. 2020. The expressive power of kth-order invariant graph networks. arXiv preprint arXiv:2007.12035 (2020)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298638"},{"key":"e_1_3_2_1_30_1","unstructured":"Yinan Huang Xingang Peng Jianzhu Ma and Muhan Zhang. 2023. Boosting the Cycle Counting Power of Graph Neural Networks. In ICLR. https:\/\/openreview.net\/forum?id=kDSmxOspsXQ"},{"key":"e_1_3_2_1_31_1","volume-title":"The International Congress of Mathematicians.","author":"Jegelka Stefanie","year":"2022","unstructured":"Stefanie Jegelka. 2022. Theory of graph neural networks: Representation and learning. In The International Congress of Mathematicians."},{"key":"e_1_3_2_1_32_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 6314--6341","author":"Ju Haotian","year":"2023","unstructured":"Haotian Ju, Dongyue Li, Aneesh Sharma, and Hongyang R Zhang. 2023. Generalization in graph neural networks: Improved pac-bayesian bounds on graph diffusion. In International Conference on Artificial Intelligence and Statistics. PMLR, 6314--6341."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jjimei.2021.100056"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335170"},{"key":"e_1_3_2_1_35_1","volume-title":"Advances in neural information processing systems","author":"Langford John","year":"2002","unstructured":"John Langford and John Shawe-Taylor. 2002. PAC-Bayes & margins. Advances in neural information processing systems, Vol. 15 (2002)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i7.26019"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450010"},{"key":"e_1_3_2_1_38_1","volume-title":"ICLR. https:\/\/openreview.net\/forum?id=TR-Nj6nFx42","author":"Liao Renjie","unstructured":"Renjie Liao, Raquel Urtasun, and Richard Zemel. 2021. A PAC-Bayesian Approach to Generalization Bounds for Graph Neural Networks. In ICLR. https:\/\/openreview.net\/forum?id=TR-Nj6nFx42"},{"key":"e_1_3_2_1_39_1","volume-title":"International Conference on Machine Learning. PMLR, 22249--22265","author":"Liu Biao","year":"2023","unstructured":"Biao Liu, Ning Xu, Jiaqi Lv, and Xin Geng. 2023. Revisiting pseudo-label for single-positive multi-label learning. In International Conference on Machine Learning. PMLR, 22249--22265."},{"key":"e_1_3_2_1_40_1","volume-title":"On the Expressiveness and Generalization of Hypergraph Neural Networks. In The First Learning on Graphs Conference. https:\/\/openreview.net\/forum?id=4FlyRlNSUh","author":"Luo Zhezheng","year":"2022","unstructured":"Zhezheng Luo, Jiayuan Mao, Joshua B. Tenenbaum, and Leslie Pack Kaelbling. 2022. On the Expressiveness and Generalization of Hypergraph Neural Networks. In The First Learning on Graphs Conference. https:\/\/openreview.net\/forum?id=4FlyRlNSUh"},{"key":"e_1_3_2_1_41_1","unstructured":"Haggai Maron Heli Ben-Hamu Nadav Shamir and Yaron Lipman. 2019. Invariant and Equivariant Graph Networks. In ICLR. https:\/\/openreview.net\/forum?id=Syx72jC9tm"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45167-9_16"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/279943.279989"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/307400.307435"},{"key":"e_1_3_2_1_45_1","first-page":"21824","article-title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","volume":"33","author":"Morris Christopher","year":"2020","unstructured":"Christopher Morris, Gaurav Rattan, and Petra Mutzel. 2020. Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings. NeurIPS, Vol. 33 (2020), 21824--21840.","journal-title":"NeurIPS"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"e_1_3_2_1_48_1","unstructured":"Behnam Neyshabur Srinadh Bhojanapalli and Nathan Srebro. 2018. A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks. In ICLR."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.07.008"},{"key":"e_1_3_2_1_50_1","volume-title":"2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, 398--409","author":"Pan Shirui","year":"2013","unstructured":"Shirui Pan, Xingquan Zhu, Chengqi Zhang, and S Yu Philip. 2013. Graph stream classification using labeled and unlabeled graphs. In 2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, 398--409."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2023.3276687"},{"key":"e_1_3_2_1_52_1","first-page":"21030","article-title":"Ordered subgraph aggregation networks","volume":"35","author":"Qian Chendi","year":"2022","unstructured":"Chendi Qian, Gaurav Rattan, Floris Geerts, Mathias Niepert, and Christopher Morris. 2022. Ordered subgraph aggregation networks. Advances in Neural Information Processing Systems, Vol. 35 (2022), 21030--21045.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_53_1","volume-title":"Smoothing and differentiation of data by simplified least squares procedures. Analytical chemistry","author":"Savitzky Abraham","year":"1964","unstructured":"Abraham Savitzky and Marcel JE Golay. 1964. Smoothing and differentiation of data by simplified least squares procedures. Analytical chemistry, Vol. 36, 8 (1964), 1627--1639."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2018.08.010"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2005.67"},{"key":"e_1_3_2_1_56_1","volume-title":"PAC-Bayesian Adversarially Robust Generalization Bounds for Graph Neural Network. arXiv preprint arXiv:2402.04038","author":"Sun Tan","year":"2024","unstructured":"Tan Sun and Junhong Lin. 2024. PAC-Bayesian Adversarially Robust Generalization Bounds for Graph Neural Network. arXiv preprint arXiv:2402.04038 (2024)."},{"key":"e_1_3_2_1_57_1","unstructured":"Vladimir Vapnik. 1968. On the uniform convergence of relative frequencies of events to their probabilities. In Doklady Akademii Nauk USSR. 781--787."},{"key":"e_1_3_2_1_58_1","volume-title":"T-HyperGNNs: Hypergraph neural networks via tensor representations","author":"Wang Fuli","year":"2024","unstructured":"Fuli Wang, Karelia Pena-Pena, Wei Qian, and Gonzalo R Arce. 2024a. T-HyperGNNs: Hypergraph neural networks via tensor representations. IEEE Transactions on Neural Networks and Learning Systems (2024)."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978032.15"},{"key":"e_1_3_2_1_60_1","unstructured":"Yifan Wang Gonzalo R. Arce and Guangmo Tong. 2025. Generalization Performance of Hypergraph Neural Networks. arxiv: 2501.12554 [cs.LG] https:\/\/arxiv.org\/abs\/2501.12554"},{"key":"e_1_3_2_1_61_1","volume-title":"Hypergraph convolution on nodes-hyperedges network for semi-supervised node classification. ACM Transactions on Knowledge Discovery from Data (TKDD)","author":"Wu Hanrui","year":"2022","unstructured":"Hanrui Wu and Michael K Ng. 2022. Hypergraph convolution on nodes-hyperedges network for semi-supervised node classification. ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 16, 4 (2022), 1--19."},{"key":"e_1_3_2_1_62_1","unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks?. In ICLR. https:\/\/openreview.net\/forum?id=ryGs6iA5Km"},{"key":"e_1_3_2_1_63_1","volume-title":"Ken ichi Kawarabayashi, and Stefanie Jegelka","author":"Xu Keyulu","year":"2020","unstructured":"Keyulu Xu, Jingling Li, Mozhi Zhang, Simon S. Du, Ken ichi Kawarabayashi, and Stefanie Jegelka. 2020. What Can Neural Networks Reason About?. In ICLR. https:\/\/openreview.net\/forum?id=rJxbJeHFPS"},{"key":"e_1_3_2_1_64_1","first-page":"21765","article-title":"One positive label is sufficient: Single-positive multi-label learning with label enhancement","volume":"35","author":"Xu Ning","year":"2022","unstructured":"Ning Xu, Congyu Qiao, Jiaqi Lv, Xin Geng, and Min-Ling Zhang. 2022. One positive label is sufficient: Single-positive multi-label learning with label enhancement. Advances in Neural Information Processing Systems, Vol. 35 (2022), 21765--21776.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_65_1","volume-title":"NeurIPS","volume":"32","author":"Yadati Naganand","year":"2019","unstructured":"Naganand Yadati, Madhav Nimishakavi, Prateek Yadav, Vikram Nitin, Anand Louis, and Partha Talukdar. 2019. Hypergcn: A new method for training graph convolutional networks on hypergraphs. NeurIPS, Vol. 32 (2019)."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_2_1_67_1","first-page":"5199","article-title":"Multi-label classification with label-specific feature generation: A wrapped approach","volume":"44","author":"Yu Ze-Bang","year":"2021","unstructured":"Ze-Bang Yu and Min-Ling Zhang. 2021. Multi-label classification with label-specific feature generation: A wrapped approach. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 44, 9 (2021), 5199--5210.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_2_1_68_1","volume-title":"Deep sets. Advances in neural information processing systems","author":"Zaheer Manzil","year":"2017","unstructured":"Manzil Zaheer, Satwik Kottur, Siamak Ravanbakhsh, Barnabas Poczos, Russ R Salakhutdinov, and Alexander J Smola. 2017. Deep sets. Advances in neural information processing systems, Vol. 30 (2017)."},{"key":"e_1_3_2_1_69_1","volume-title":"Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness. In The Twelfth International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=HSKaGOi7Ar","author":"Zhang Bohang","year":"2024","unstructured":"Bohang Zhang, Jingchu Gai, Yiheng Du, Qiwei Ye, Di He, and Liwei Wang. 2024. Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness. In The Twelfth International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=HSKaGOi7Ar"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11780"},{"key":"e_1_3_2_1_71_1","unstructured":"Ruochi Zhang Yuesong Zou and Jian Ma. 2020. Hyper-SAGNN: a self-attention based graph neural network for hypergraphs. In ICLR. https:\/\/openreview.net\/forum?id=ryeHuJBtPH"},{"key":"e_1_3_2_1_72_1","volume-title":"NeurIPS","volume":"19","author":"Zhou Dengyong","year":"2006","unstructured":"Dengyong Zhou, Jiayuan Huang, and Bernhard Sch\u00f6lkopf. 2006. Learning with hypergraphs: Clustering, classification, and embedding. NeurIPS, Vol. 19 (2006)."}],"event":{"name":"WWW '25: The ACM Web Conference 2025","location":"Sydney NSW Australia","acronym":"WWW '25","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM on Web Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714586","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3696410.3714586","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:33Z","timestamp":1750295913000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714586"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":71,"alternative-id":["10.1145\/3696410.3714586","10.1145\/3696410"],"URL":"https:\/\/doi.org\/10.1145\/3696410.3714586","relation":{},"subject":[],"published":{"date-parts":[[2025,4,22]]},"assertion":[{"value":"2025-04-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}