{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:04:19Z","timestamp":1775815459124,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172187 and 62372209"],"award-info":[{"award-number":["62172187 and 62372209"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021YFF1201200"],"award-info":[{"award-number":["2021YFF1201200"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"European Union?s Horizon 2020 FET Proactive Project","award":["823783"],"award-info":[{"award-number":["823783"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645587","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"4249-4259","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A Simple but Effective Approach for Unsupervised Few-Shot Graph Classification"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8621-7144","authenticated-orcid":false,"given":"Yonghao","family":"Liu","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3233-3777","authenticated-orcid":false,"given":"Lan","family":"Huang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5186-0308","authenticated-orcid":false,"given":"Bowen","family":"Cao","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8190-5087","authenticated-orcid":false,"given":"Ximing","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5903-6150","authenticated-orcid":false,"given":"Fausto","family":"Giunchiglia","sequence":"additional","affiliation":[{"name":"Department of Information Engineering and Computer Science, University of Trento, Trento, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3954-1333","authenticated-orcid":false,"given":"Xiaoyue","family":"Feng","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7162-7826","authenticated-orcid":false,"given":"Renchu","family":"Guan","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Dong Bok Lee, and Sung Ju Hwang","author":"Baek Jinheon","year":"2020","unstructured":"Jinheon Baek, Dong Bok Lee, and Sung Ju Hwang. 2020. Learning to extrapolate knowledge: Transductive few-shot out-of-graph link prediction. In NeurIPS. 546--560."},{"key":"e_1_3_2_2_2_1","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","author":"Bartlett Peter L","year":"2002","unstructured":"Peter L Bartlett and Shahar Mendelson. 2002. Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research 3, Nov (2002), 463--482.","journal-title":"Journal of Machine Learning Research 3"},{"key":"e_1_3_2_2_3_1","unstructured":"Karsten M Borgwardt and Hans-Peter Kriegel. 2005. Shortest-path kernels on graphs. In ICDM."},{"key":"e_1_3_2_2_4_1","volume-title":"Weighted metalearning. arXiv preprint arXiv:2003.09465","author":"Cai Diana","year":"2020","unstructured":"Diana Cai, Rishit Sheth, Lester Mackey, and Nicolo Fusi. 2020. Weighted metalearning. arXiv preprint arXiv:2003.09465 (2020)."},{"key":"e_1_3_2_2_5_1","unstructured":"Jatin Chauhan Deepak Nathani and Manohar Kaul. 2020. Few-shot learning on graphs via super-classes based on graph spectral measures. In ICLR."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Mingyang Chen Wen Zhang Wei Zhang Qiang Chen and Huajun Chen. 2019. Meta Relational Learning for Few-Shot Link Prediction in Knowledge Graphs. In EMNLP-IJCNLP. 4217--4226.","DOI":"10.18653\/v1\/D19-1431"},{"key":"e_1_3_2_2_7_1","unstructured":"Donato Crisostomi Simone Antonelli Valentino Maiorca Luca Moschella Riccardo Marin and Emanuele Rodol\u00e0. 2022. Metric Based Few-Shot Graph Classification. In LoG."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Kaize Ding Jianling Wang Jundong Li Kai Shu Chenghao Liu and Huan Liu. 2020. Graph prototypical networks for few-shot learning on attributed networks. In CIKM. 295--304.","DOI":"10.1145\/3340531.3411922"},{"key":"e_1_3_2_2_9_1","volume-title":"Prompt tuning for graph neural networks. arXiv preprint arXiv:2209.15240","author":"Fang Taoran","year":"2022","unstructured":"Taoran Fang, Yunchao Zhang, Yang Yang, and Chunping Wang. 2022. Prompt tuning for graph neural networks. arXiv preprint arXiv:2209.15240 (2022)."},{"key":"e_1_3_2_2_10_1","unstructured":"Chelsea Finn Pieter Abbeel and Sergey Levine. 2017. Model-agnostic metalearning for fast adaptation of deep networks. In ICML. 1126--1135."},{"key":"e_1_3_2_2_11_1","unstructured":"Vikas Garg Stefanie Jegelka and Tommi Jaakkola. 2020. Generalization and representational limits of graph neural networks. In ICML. 3419--3430."},{"key":"e_1_3_2_2_12_1","volume-title":"PPT: Pre-trained Prompt Tuning for Few-shot Learning. In ACL. 8410--8423.","author":"Gu Yuxian","year":"2022","unstructured":"Yuxian Gu, Xu Han, Zhiyuan Liu, and Minlie Huang. 2022. PPT: Pre-trained Prompt Tuning for Few-shot Learning. In ACL. 8410--8423."},{"key":"e_1_3_2_2_13_1","volume-title":"Gene selection for cancer classification using support vector machines. Machine learning 46","author":"Guyon Isabelle","year":"2002","unstructured":"Isabelle Guyon, Jason Weston, Stephen Barnhill, and Vladimir Vapnik. 2002. Gene selection for cancer classification using support vector machines. Machine learning 46 (2002), 389--422."},{"key":"e_1_3_2_2_14_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS."},{"key":"e_1_3_2_2_15_1","unstructured":"Xiaotian Han Zhimeng Jiang Ninghao Liu and Xia Hu. 2022. G-Mixup: Graph Data Augmentation for Graph Classification. In ICML Kamalika Chaudhuri Stefanie Jegelka Le Song Csaba Szepesv\u00e1ri Gang Niu and Sivan Sabato (Eds.)."},{"key":"e_1_3_2_2_16_1","unstructured":"Kaveh Hassani and Amir Hosein Khasahmadi. 2020. Contrastive multi-view representation learning on graphs. In ICML. 4116--4126."},{"key":"e_1_3_2_2_17_1","unstructured":"Shengding Hu Ning Ding HuadongWang Zhiyuan Liu JingangWang Juanzi Li Wei Wu and Maosong Sun. 2022. Knowledgeable prompt-tuning: Incorporating knowledge into prompt verbalizer for text classification. In ACL."},{"key":"e_1_3_2_2_18_1","unstructured":"Weihua Hu Bowen Liu Joseph Gomes Marinka Zitnik Percy Liang Vijay Pande and Jure Leskovec. 2020. Strategies for pre-training graph neural networks. In ICLR."},{"key":"e_1_3_2_2_19_1","unstructured":"Kexin Huang and Marinka Zitnik. 2020. Graph meta learning via local subgraphs. In NeurIPS. 5862--5874."},{"key":"e_1_3_2_2_20_1","unstructured":"Sergey Ivanov and Evgeny Burnaev. 2018. Anonymous walk embeddings. In ICML. 2186--2195."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Menglin Jia Luming Tang Bor-Chun Chen Claire Cardie Serge Belongie Bharath Hariharan and Ser-Nam Lim. 2022. Visual prompt tuning. In ECCV. 709--727.","DOI":"10.1007\/978-3-031-19827-4_41"},{"key":"e_1_3_2_2_22_1","volume-title":"Adam: A method for stochastic optimization. In ICLR.","author":"Kingma Diederik P","year":"2015","unstructured":"Diederik P Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In ICLR."},{"key":"e_1_3_2_2_23_1","unstructured":"Thomas N Kipf and MaxWelling. 2017. Semi-supervised classification with graph convolutional networks. In ICLR."},{"key":"e_1_3_2_2_24_1","unstructured":"Boris Knyazev Graham W Taylor and Mohamed Amer. 2019. Understanding attention and generalization in graph neural networks. In NeurIPS."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0195-3"},{"key":"e_1_3_2_2_26_1","unstructured":"Junhyun Lee Inyeop Lee and Jaewoo Kang. 2019. Self-attention graph pooling. In ICML. 3734--3743."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Brian Lester Rami Al-Rfou and Noah Constant. 2022. The power of scale for parameter-efficient prompt tuning. In EMNLP.","DOI":"10.18653\/v1\/2021.emnlp-main.243"},{"key":"e_1_3_2_2_28_1","unstructured":"Hongyi Ling Zhimeng Jiang Meng Liu Shuiwang Ji and Na Zou. 2023. Graph Mixup with Soft Alignments. In ICML."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3560815"},{"key":"e_1_3_2_2_30_1","volume-title":"P-tuning: Prompt tuning can be comparable to fine-tuning across scales and tasks. In ACL. 61--68.","author":"Liu Xiao","year":"2022","unstructured":"Xiao Liu, Kaixuan Ji, Yicheng Fu, Weng Tam, Zhengxiao Du, Zhilin Yang, and Jie Tang. 2022. P-tuning: Prompt tuning can be comparable to fine-tuning across scales and tasks. In ACL. 61--68."},{"key":"e_1_3_2_2_31_1","volume-title":"Zhengxiao Du, Zhilin Yang, and Jie Tang.","author":"Liu Xiao","year":"2021","unstructured":"Xiao Liu, Kaixuan Ji, Yicheng Fu, Weng Lam Tam, Zhengxiao Du, Zhilin Yang, and Jie Tang. 2021. P-tuning v2: Prompt tuning can be comparable to fine-tuning universally across scales and tasks. arXiv preprint arXiv:2110.07602 (2021)."},{"key":"e_1_3_2_2_32_1","first-page":"857","article-title":"Self-supervised learning: Generative or contrastive","volume":"35","author":"Liu Xiao","year":"2021","unstructured":"Xiao Liu, Fanjin Zhang, Zhenyu Hou, Li Mian, Zhaoyu Wang, Jing Zhang, and Jie Tang. 2021. Self-supervised learning: Generative or contrastive. IEEE TKDE 35, 1 (2021), 857--876.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_2_33_1","unstructured":"Yonghao Liu Renchu Guan Fausto Giunchiglia Yanchun Liang and Xiaoyue Feng. 2021. Deep attention diffusion graph neural networks for text classification. In EMNLP. 8142--8152."},{"key":"e_1_3_2_2_34_1","unstructured":"Yonghao Liu Lan Huang Fausto Giunchiglia Xiaoyue Feng and Renchu Guan. 2024. Improved Graph Contrastive Learning for Short Text Classification. In AAAI."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Yonghao Liu Mengyu Li Ximing Li Fausto Giunchiglia Xiaoyue Feng and Renchu Guan. 2022. Few-shot node classification on attributed networks with graph meta-learning. In SIGIR. 471--481.","DOI":"10.1145\/3477495.3531978"},{"key":"e_1_3_2_2_36_1","unstructured":"Yonghao Liu Di Liang Fang Fang Sirui Wang Wei Wu and Rui Jiang. 2023. Time-aware Multiway Adaptive Fusion Network for Temporal Knowledge Graph Question Answering. In ICASSP."},{"key":"e_1_3_2_2_37_1","unstructured":"Yonghao Liu Di Liang Mengyu Li Fausto Giunchiglia Ximing Li Sirui Wang Wei Wu Lan Huang Xiaoyue Feng and Renchu Guan. 2023. Local and Global: Temporal Question Answering via Information Fusion. In IJCAI."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583386"},{"key":"e_1_3_2_2_39_1","unstructured":"Ning Ma Jiajun Bu Jieyu Yang Zhen Zhang Chengwei Yao Zhi Yu Sheng Zhou and Xifeng Yan. 2020. Adaptive-step graph meta-learner for few-shot graph classification. In CIKM."},{"key":"e_1_3_2_2_40_1","unstructured":"Tomas Mikolov Kai Chen Greg Corrado and Jeffrey Dean. 2013. Efficient estimation of word representations in vector space. In ICLR."},{"key":"e_1_3_2_2_41_1","volume-title":"Foundations of machine learning","author":"Mohri Mehryar","unstructured":"Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar. 2018. Foundations of machine learning. MIT press."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.2307\/1428011"},{"key":"e_1_3_2_2_43_1","volume-title":"graph2vec: Learning distributed representations of graphs. arXiv preprint arXiv:1707.05005","author":"Narayanan Annamalai","year":"2017","unstructured":"Annamalai Narayanan, Mahinthan Chandramohan, Rajasekar Venkatesan, Lihui Chen, Yang Liu, and Shantanu Jaiswal. 2017. graph2vec: Learning distributed representations of graphs. arXiv preprint arXiv:1707.05005 (2017)."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"Kaspar Riesen and Horst Bunke. 2008. IAM graph database repository for graph based pattern recognition and machine learning. In SSPR & SPR. 287--297.","DOI":"10.1007\/978-3-540-89689-0_33"},{"key":"e_1_3_2_2_45_1","first-page":"61","article-title":"The graph neural network model","volume":"20","author":"Scarselli Franco","year":"2008","unstructured":"Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and Gabriele Monfardini. 2008. The graph neural network model. IEEE TNNLS 20, 1 (2008), 61--80.","journal-title":"IEEE TNNLS"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh081"},{"key":"e_1_3_2_2_47_1","volume-title":"Kurt Mehlhorn, and Karsten M Borgwardt.","author":"Shervashidze Nino","year":"2011","unstructured":"Nino Shervashidze, Pascal Schweitzer, Erik Jan Van Leeuwen, Kurt Mehlhorn, and Karsten M Borgwardt. 2011. Weisfeiler-lehman graph kernels. JMLR 12, 9 (2011)."},{"key":"e_1_3_2_2_48_1","unstructured":"Nino Shervashidze SVN Vishwanathan Tobias Petri Kurt Mehlhorn and Karsten Borgwardt. 2009. Efficient graphlet kernels for large graph comparison. In AISTAS."},{"key":"e_1_3_2_2_49_1","unstructured":"Jake Snell Kevin Swersky and Richard Zemel. 2017. Prototypical networks for few-shot learning. In NeurIPS."},{"key":"e_1_3_2_2_50_1","volume-title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization. In ICLR.","author":"Sun Fan-Yun","year":"2020","unstructured":"Fan-Yun Sun, Jordan Hoffmann, Vikas Verma, and Jian Tang. 2020. Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization. In ICLR."},{"key":"e_1_3_2_2_51_1","volume-title":"Gppt: Graph pre-training and prompt tuning to generalize graph neural networks. In SIGKDD. 1717--1727.","author":"Sun Mingchen","year":"2022","unstructured":"Mingchen Sun, Kaixiong Zhou, Xin He, Ying Wang, and Xin Wang. 2022. Gppt: Graph pre-training and prompt tuning to generalize graph neural networks. In SIGKDD. 1717--1727."},{"key":"e_1_3_2_2_52_1","unstructured":"Xiangguo Sun Hong Cheng Jia Li Bo Liu and Jihong Guan. 2023. All in One: Multi-Task Prompting for Graph Neural Networks. In SIGKDD."},{"key":"e_1_3_2_2_53_1","volume-title":"Philip HS Torr, and Timothy M Hospedales","author":"Sung Flood","year":"2018","unstructured":"Flood Sung, Yongxin Yang, Li Zhang, Tao Xiang, Philip HS Torr, and Timothy M Hospedales. 2018. Learning to compare: Relation network for few-shot learning. In CVPR."},{"key":"e_1_3_2_2_54_1","unstructured":"Zhen Tan Ruocheng Guo Kaize Ding and Huan Liu. 2023. Virtual Node Tuning for Few-shot Node Classification. In SIGKDD."},{"key":"e_1_3_2_2_55_1","unstructured":"Zhen Tan SongWang Kaize Ding Jundong Li and Huan Liu. 2022. Transductive Linear Probing: A Novel Framework for Few-Shot Node Classification. In LoG."},{"key":"e_1_3_2_2_56_1","volume-title":"R\u00e9mi Munos, Petar Velickovic, and Michal Valko.","author":"Thakoor Shantanu","year":"2021","unstructured":"Shantanu Thakoor, Corentin Tallec, Mohammad Gheshlaghi Azar, R\u00e9mi Munos, Petar Velickovic, and Michal Valko. 2021. Bootstrapped representation learning on graphs. In ICLR."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"crossref","unstructured":"Yonglong Tian Yue Wang Dilip Krishnan Joshua B Tenenbaum and Phillip Isola. 2020. Rethinking few-shot image classification: a good embedding is all you need?. In ECCV. 266--282.","DOI":"10.1007\/978-3-030-58568-6_16"},{"key":"e_1_3_2_2_58_1","unstructured":"Petar Velickovic Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2018. Graph attention networks. In ICLR."},{"key":"e_1_3_2_2_59_1","unstructured":"Oriol Vinyals Charles Blundell Timothy Lillicrap Daan Wierstra et al. 2016. Matching networks for one shot learning. In NeurIPS."},{"key":"e_1_3_2_2_60_1","volume-title":"Faith: Few-shot graph classification with hierarchical task graphs. In IJCAI.","author":"Wang Song","year":"2022","unstructured":"Song Wang, Yushun Dong, Xiao Huang, Chen Chen, and Jundong Li. 2022. Faith: Few-shot graph classification with hierarchical task graphs. In IJCAI."},{"key":"e_1_3_2_2_61_1","volume-title":"Mixup for Node and Graph Classification. In The Web Conference.","author":"Wang Yiwei","year":"2021","unstructured":"Yiwei Wang, Wei Wang, Yuxuan Liang, Yujun Cai, and Bryan Hooi. 2021. Mixup for Node and Graph Classification. In The Web Conference."},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"crossref","unstructured":"Lingfei Wu Peng Cui Jian Pei Liang Zhao and Xiaojie Guo. 2022. Graph neural networks: foundation frontiers and applications. In SIGKDD. 4840--4841.","DOI":"10.1145\/3534678.3542609"},{"key":"e_1_3_2_2_63_1","unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2019. How powerful are graph neural networks?. In ICLR."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"crossref","unstructured":"Pinar Yanardag and SVN Vishwanathan. 2015. Deep graph kernels. In SIGKDD. 1365--1374.","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"crossref","unstructured":"Cheng Yang Chunchen Wang Yuanfu Lu Xumeng Gong Chuan Shi Wei Wang and Xu Zhang. 2022. Few-shot link prediction in dynamic networks. In WSDM. 1245--1255.","DOI":"10.1145\/3488560.3498417"},{"key":"e_1_3_2_2_66_1","unstructured":"Zhitao Ying Jiaxuan You Christopher Morris Xiang Ren Will Hamilton and Jure Leskovec. 2018. Hierarchical graph representation learning with differentiable pooling. NeurIPS 31."},{"key":"e_1_3_2_2_67_1","unstructured":"Yuning You Tianlong Chen Yongduo Sui Ting Chen Zhangyang Wang and Yang Shen. 2020. Graph contrastive learning with augmentations. In NeurIPS. 5812--5823."},{"key":"e_1_3_2_2_68_1","unstructured":"Hongyi Zhang Moustapha Cisse Yann N Dauphin and David Lopez-Paz. 2018. mixup: Beyond empirical risk minimization. In ICLR."},{"key":"e_1_3_2_2_69_1","unstructured":"Zaixi Zhang Qi Liu HaoWang Chengqiang Lu and Chee-Kong Lee. 2021. Motifbased graph self-supervised learning for molecular property prediction. In NeurIS. 15870--15882."},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358106"}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645587","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:23:46Z","timestamp":1755822226000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":70,"alternative-id":["10.1145\/3589334.3645587","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645587","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}