{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T23:20:05Z","timestamp":1779232805994,"version":"3.51.4"},"reference-count":61,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:00:00Z","timestamp":1705017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2021ZD0111501"],"award-info":[{"award-number":["2021ZD0111501"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100014717","name":"National Science Fund for Excellent Young Scholars","doi-asserted-by":"crossref","award":["62122022"],"award-info":[{"award-number":["62122022"]}],"id":[{"id":"10.13039\/100014717","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61876043, 61976052"],"award-info":[{"award-number":["61876043, 61976052"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Science and Technology Planning Project of Guangzhou","award":["201902010058"],"award-info":[{"award-number":["201902010058"]}]},{"name":"Guangdong Provincial Science and Technology Innovation Strategy Fund","award":["2019B121203012"],"award-info":[{"award-number":["2019B121203012"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,4,30]]},"abstract":"<jats:p>\n            Recent years have witnessed tremendous interest in deep learning on graph-structured data. Due to the high cost of collecting labeled graph-structured data, domain adaptation is important to supervised graph learning tasks with limited samples. However, current graph domain adaptation methods are generally adopted from traditional domain adaptation tasks, and the properties of graph-structured data are not well utilized. For example, the observed social networks on different platforms are controlled not only by the different crowds or communities but also by domain-specific policies and background noise. Based on these properties in graph-structured data, we first assume that the graph-structured data generation process is controlled by three independent types of latent variables, i.e., the semantic latent variables, the domain latent variables, and the random latent variables. Based on this assumption, we propose a disentanglement-based unsupervised domain adaptation method for the graph-structured data, which applies variational graph auto-encoders to recover these latent variables and disentangles them via three supervised learning modules. Extensive experimental results on two real-world datasets in the graph classification task reveal that our method not only significantly outperforms the traditional domain adaptation methods and the disentangled-based domain adaptation methods but also outperforms the state-of-the-art graph domain adaptation algorithms. The code is available at\n            <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/github.com\/rynewu224\/GraphDA\">https:\/\/github.com\/rynewu224\/GraphDA<\/jats:ext-link>\n            .\n          <\/jats:p>","DOI":"10.1145\/3631712","type":"journal-article","created":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T11:32:31Z","timestamp":1699961551000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Graph Domain Adaptation: A Generative View"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8972-167X","authenticated-orcid":false,"given":"Ruichu","family":"Cai","sequence":"first","affiliation":[{"name":"School of Computers, Guangdong University of Technology and Guangdong Provincial Key Laboratory of Public Finance and Taxation with Big Data Application, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8602-3755","authenticated-orcid":false,"given":"Fengzhu","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computers, Guangdong University of Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3964-3789","authenticated-orcid":false,"given":"Zijian","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computers, Guangdong University of Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8093-0803","authenticated-orcid":false,"given":"Pengfei","family":"Wei","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8809-7676","authenticated-orcid":false,"given":"Lingling","family":"Yi","sequence":"additional","affiliation":[{"name":"Tencent Technology (SZ) Co., Ltd, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0738-9958","authenticated-orcid":false,"given":"Kun","family":"Zhang","sequence":"additional","affiliation":[{"name":"the Department of Philosophy, Carnegie Mellon University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,1,12]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_4_2","article-title":"An O (m) algorithm for cores decomposition of networks","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik. 2003. An O (m) algorithm for cores decomposition of networks. arXiv:cs\/0310049. Retrieved from https:\/\/arxiv.org\/abs\/cs\/0310049","journal-title":"arXiv:cs\/0310049"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.50"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1086\/228631"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16846"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.5555\/3367243.3367325"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2556724"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/2.781636"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04161-5"},{"key":"e_1_3_2_12_2","article-title":"Graph transfer learning via adversarial domain adaptation with graph convolution","author":"Dai Quanyu","year":"2022","unstructured":"Quanyu Dai, Xiao-Ming Wu, Jiaren Xiao, Xiao Shen, and Dan Wang. 2022. Graph transfer learning via adversarial domain adaptation with graph convolution. IEEE Trans. Knowl. Data Eng. 35, 5 (2022), 4908\u20134922.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_2_13_2","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","author":"Defferrard Micha\u00ebl","year":"2016","unstructured":"Micha\u00ebl Defferrard, Xavier Bresson, and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. arXiv:1606.09375. Retrieved from https:\/\/arxiv.org\/abs\/1606.09375","journal-title":"arXiv:1606.09375"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098036"},{"key":"e_1_3_2_15_2","first-page":"1180","volume-title":"Proceedings of the 32nd International Conference on International Conference on Machine Learning-Volume 37","author":"Ganin Yaroslav","year":"2015","unstructured":"Yaroslav Ganin and Victor Lempitsky. 2015. Unsupervised domain adaptation by backpropagation. In Proceedings of the 32nd International Conference on International Conference on Machine Learning-Volume 37. 1180\u20131189."},{"key":"e_1_3_2_16_2","first-page":"1","article-title":"Domain-adversarial training of neural networks","volume":"17","author":"Ganin Yaroslav","year":"2016","unstructured":"Yaroslav Ganin, Evgeniya Ustinova, Hana Ajakan, Pascal Germain, Hugo Larochelle, Fran\u00e7ois Laviolette, Mario Marchand, and Victor Lempitsky. 2016. Domain-adversarial training of neural networks. J. Mach. Learn. Res. 17 (2016), 1\u201335.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_17_2","first-page":"2083","volume-title":"International Conference on Machine Learning","author":"Gao Hongyang","year":"2019","unstructured":"Hongyang Gao and Shuiwang Ji. 2019. Graph u-nets. In International Conference on Machine Learning. PMLR, 2083\u20132092."},{"key":"e_1_3_2_18_2","volume-title":"Proceedings of the International Conference on Machine Learning (ICML \u201917)","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 Proceedings of the International Conference on Machine Learning (ICML \u201917)."},{"key":"e_1_3_2_19_2","first-page":"2672","article-title":"Generative adversarial nets","volume":"27","author":"Goodfellow Ian","year":"2014","unstructured":"Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. 2014. Generative adversarial nets. Adv. Neural Inf. Process. Syst. 27 (2014), 2672\u20132680.","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"e_1_3_2_20_2","article-title":"Inductive representation learning on large graphs","author":"Hamilton William L.","year":"2017","unstructured":"William L. Hamilton, Rex Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. arXiv:1706.02216. Retrieved from https:\/\/arxiv.org\/abs\/1706.02216","journal-title":"arXiv:1706.02216"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.11.017"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_2_23_2","first-page":"6480","volume-title":"Proceedings of the IEEE\/CVF International Conference on Computer Vision","author":"Huang Jingjia","year":"2019","unstructured":"Jingjia Huang, Zhangheng Li, Nannan Li, Shan Liu, and Ge Li. 2019. Attpool: Towards hierarchical feature representation in graph convolutional networks via attention mechanism. In Proceedings of the IEEE\/CVF International Conference on Computer Vision. 6480\u20136489."},{"key":"e_1_3_2_24_2","first-page":"322","volume-title":"Medical Imaging with Deep Learning","author":"Ilse Maximilian","year":"2020","unstructured":"Maximilian Ilse, Jakub M. Tomczak, Christos Louizos, and Max Welling. 2020. Diva: Domain invariant variational autoencoders. In Medical Imaging with Deep Learning. PMLR, 322\u2013348."},{"key":"e_1_3_2_25_2","article-title":"Memory-based graph networks","author":"Khasahmadi Amir Hosein","year":"2020","unstructured":"Amir Hosein Khasahmadi, Kaveh Hassani, Parsa Moradi, Leo Lee, and Quaid Morris. 2020. Memory-based graph networks. arXiv:2002.09518. Retrieved from https:\/\/arxiv.org\/abs\/2002.09518","journal-title":"arXiv:2002.09518"},{"key":"e_1_3_2_26_2","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf Thomas N.","year":"2016","unstructured":"Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv:1609.02907. Retrieved from https:\/\/arxiv.org\/abs\/1609.02907","journal-title":"arXiv:1609.02907"},{"key":"e_1_3_2_27_2","article-title":"Variational graph auto-encoders","author":"Kipf Thomas N.","year":"2016","unstructured":"Thomas N. Kipf and Max Welling. 2016. Variational graph auto-encoders. arXiv:1611.07308. Retrieved from https:\/\/arxiv.org\/abs\/1611.07308","journal-title":"arXiv:1611.07308"},{"key":"e_1_3_2_28_2","first-page":"3734","volume-title":"International Conference on Machine Learning","author":"Lee Junhyun","year":"2019","unstructured":"Junhyun Lee, Inyeop Lee, and Jaewoo Kang. 2019. Self-attention graph pooling. In International Conference on Machine Learning. PMLR, 3734\u20133743."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3445033"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1226"},{"key":"e_1_3_2_31_2","first-page":"97","volume-title":"International Conference on Machine Learning","author":"Long Mingsheng","year":"2015","unstructured":"Mingsheng Long, Yue Cao, Jianmin Wang, and Michael Jordan. 2015. Learning transferable features with deep adaptation networks. In International Conference on Machine Learning. PMLR, 97\u2013105."},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.5555\/3305890.3305909"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330982"},{"key":"e_1_3_2_34_2","first-page":"735","volume-title":"Proceedings of the European Conference on Computer Vision Workshops (ECCV \u201922 Workshops)), Part VII","author":"Mahapatra Dwarikanath","year":"2023","unstructured":"Dwarikanath Mahapatra, Steven Korevaar, Behzad Bozorgtabar, and Ruwan Tennakoon. 2023. Unsupervised domain adaptation using feature disentanglement and GCNs for medical image classification. In Proceedings of the European Conference on Computer Vision Workshops (ECCV \u201922 Workshops)), Part VII. Springer, 735\u2013748."},{"key":"e_1_3_2_35_2","article-title":"Rethinking pooling in graph neural networks","author":"Mesquita Diego","year":"2020","unstructured":"Diego Mesquita, Amauri H. Souza, and Samuel Kaski. 2020. Rethinking pooling in graph neural networks. arXiv:2010.11418. Retrieved from https:\/\/arxiv.org\/abs\/2010.11418","journal-title":"arXiv:2010.11418"},{"key":"e_1_3_2_36_2","volume-title":"Proceedings of the International Conference on Machine Learning (ICML \u201910)","author":"Nair Vinod","year":"2010","unstructured":"Vinod Nair and Geoffrey E. Hinton. 2010. Rectified linear units improve restricted boltzmann machines. In Proceedings of the International Conference on Machine Learning (ICML \u201910)."},{"key":"e_1_3_2_37_2","volume-title":"The PageRank Citation Ranking: Bringing Order to the Web.","author":"Page Lawrence","year":"1999","unstructured":"Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank Citation Ranking: Bringing Order to the Web.Technical Report. Stanford InfoLab."},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_39_2","article-title":"Domain adaptation on graphs by learning aligned graph bases","author":"Pilanci Mehmet","year":"2020","unstructured":"Mehmet Pilanci and Elif Vural. 2020. Domain adaptation on graphs by learning aligned graph bases. IEEE Trans. Knowl. Data Eng. (2020).","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159706"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220077"},{"key":"e_1_3_2_42_2","volume-title":"International Conference on Learning Representations","author":"Rong Yu","year":"2019","unstructured":"Yu Rong, Wenbing Huang, Tingyang Xu, and Junzhou Huang. 2019. Dropedge: Towards deep graph convolutional networks on node classification. In International Conference on Learning Representations."},{"key":"e_1_3_2_43_2","article-title":"Adversarial deep network embedding for cross-network node classification","author":"Shen Xiao","year":"2020","unstructured":"Xiao Shen, Quanyu Dai, Fu-lai Chung, Wei Lu, and Kup-Sze Choi. 2020. Adversarial deep network embedding for cross-network node classification. arXiv:2002.07366. Retrieved from https:\/\/arxiv.org\/abs\/2002.07366","journal-title":"arXiv:2002.07366"},{"key":"e_1_3_2_44_2","article-title":"Aggregating from multiple target-shifted sources","author":"Shui Changjian","year":"2021","unstructured":"Changjian Shui, Zijian Li, Jiaqi Li, Christian Gagn\u00e9, Charles Ling, and Boyu Wang. 2021. Aggregating from multiple target-shifted sources. arXiv:2105.04051. Retrieved from https:\/\/arxiv.org\/abs\/2105.04051","journal-title":"arXiv:2105.04051"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_46_2","article-title":"Deep domain confusion: Maximizing for domain invariance","author":"Tzeng Eric","year":"2014","unstructured":"Eric Tzeng, Judy Hoffman, Ning Zhang, Kate Saenko, and Trevor Darrell. 2014. Deep domain confusion: Maximizing for domain invariance. arXiv:1412.3474. Retrieved from https:\/\/arxiv.org\/abs\/1412.3474","journal-title":"arXiv:1412.3474"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1116502109"},{"key":"e_1_3_2_48_2","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107 Petar","year":"2017","unstructured":"Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv:1710.10903. Retrieved from https:\/\/arxiv.org\/abs\/1710.10903","journal-title":"arXiv:1710.10903"},{"key":"e_1_3_2_49_2","article-title":"Order matters: Sequence to sequence for sets","author":"Vinyals Oriol","year":"2015","unstructured":"Oriol Vinyals, Samy Bengio, and Manjunath Kudlur. 2015. Order matters: Sequence to sequence for sets. arXiv:1511.06391. Retrieved from https:\/\/arxiv.org\/abs\/1511.06391","journal-title":"arXiv:1511.06391"},{"issue":"3","key":"e_1_3_2_50_2","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.3906\/elk-1812-124","article-title":"Domain adaptation on graphs by learning graph topologies: theoretical analysis and an algorithm","volume":"27","author":"Vural Elif","year":"2019","unstructured":"Elif Vural. 2019. Domain adaptation on graphs by learning graph topologies: theoretical analysis and an algorithm. Turk. J. Electr. Eng. Comput. Sci. 27, 3 (2019), 1619\u20131635.","journal-title":"Turk. J. Electr. Eng. Comput. Sci."},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015345"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_54_2","first-page":"1457","volume-title":"Proceedings of the Web Conference","author":"Wu Man","year":"2020","unstructured":"Man Wu, Shirui Pan, Chuan Zhou, Xiaojun Chang, and Xingquan Zhu. 2020. Unsupervised domain adaptive graph convolutional networks. In Proceedings of the Web Conference. 1457\u20131467."},{"key":"e_1_3_2_55_2","article-title":"How powerful are graph neural networks?","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? arXiv:1810.00826. Retrieved from https:\/\/arxiv.org\/abs\/1810.00826","journal-title":"arXiv:1810.00826"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_58_2","first-page":"4800","volume-title":"Advances in Neural Information Processing Systems","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. 4800\u20134810."},{"key":"e_1_3_2_59_2","article-title":"A causal view on robustness of neural networks","author":"Zhang Cheng","year":"2020","unstructured":"Cheng Zhang, Kun Zhang, and Yingzhen Li. 2020. A causal view on robustness of neural networks. arXiv:2005.01095. Retrieved from https:\/\/arxiv.org\/abs\/2005.01095","journal-title":"arXiv:2005.01095"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"e_1_3_2_61_2","first-page":"7404","volume-title":"International Conference on Machine Learning","author":"Zhang Yuchen","year":"2019","unstructured":"Yuchen Zhang, Tianle Liu, Mingsheng Long, and Michael Jordan. 2019. Bridging theory and algorithm for domain adaptation. In International Conference on Machine Learning. 7404\u20137413."},{"key":"e_1_3_2_62_2","first-page":"4362","volume-title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence","author":"Zhang Yizhou","year":"2019","unstructured":"Yizhou Zhang, Guojie Song, Lun Du, Shuwen Yang, and Yilun Jin. 2019. DANE: Domain adaptive network embedding. In Proceedings of the 28th International Joint Conference on Artificial Intelligence. AAAI Press, 4362\u20134368."}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3631712","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3631712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:35:43Z","timestamp":1750178143000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3631712"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,12]]},"references-count":61,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4,30]]}},"alternative-id":["10.1145\/3631712"],"URL":"https:\/\/doi.org\/10.1145\/3631712","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,12]]},"assertion":[{"value":"2022-09-21","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-22","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}