{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,15]],"date-time":"2026-11-15T11:48:19Z","timestamp":1794743299251,"version":"4.9.1"},"reference-count":74,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T00:00:00Z","timestamp":1785110400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Beijing Natural Science Foundation","award":["4254083"],"award-info":[{"award-number":["4254083"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U23A20299, 62502521)"],"award-info":[{"award-number":["U23A20299, 62502521)"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"PCL-CMCC Foundation for Science and Innovation","award":["2024ZY1C0030"],"award-info":[{"award-number":["2024ZY1C0030"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2026,8,31]]},"abstract":"<jats:p>Approximate Nearest Neighbor Search (ANNS) plays a key role in database and AI infrastructure. It exhibits extremely high memory intensity with a ~1:1 compute-to-memory access ratio. Commodity Processing-in-Memory (PIM) hardware, such as the first real-world commercial product (UPMEM), is promising for overcoming the memory wall in ANNS. However, its reuse of the system DDR bus prevents the CPU and PIM cores from accessing memory simultaneously. This necessitates batch scheduling in existing systems, which, in turn, leads to severe underutilization in two scenarios: (1) inter-batch, where PIM remains idle while the CPU is copying data, and (2) intra-batch, caused by uneven load distribution of PIM cores in a batch.<\/jats:p>\n                  <jats:p>\n                    This article proposes an efficient PIM-capable ANNS system named\n                    <jats:sc>PIMANN<\/jats:sc>\n                    . We observe that each PIM core has an additional, undocumented, and little-known control interface (originally used for control commands like launching PIM kernels), which could be retrofitted for fine-grained arbitration of DDR bus access. Thus,\n                    <jats:sc>PIMANN<\/jats:sc>\n                    can break the traditional batching scheduling paradigm and adopt a fine-grained scheduling paradigm . With this key idea,\n                    <jats:sc>PIMANN<\/jats:sc>\n                    introduces (1) a persistent PIM kernel to eliminate inter-batch idling, (2) per-PU query dispatching to balance real-time load across cores, and (3) microarchitecture-aware per-PU optimization to overcome inherent PU-level hardware constraints. Experiments show that\n                    <jats:sc>PIMANN<\/jats:sc>\n                    can boost throughput by 2.5-11.1\u00d7 compared to existing ANNS systems on CPU or GPU. The implementation of\n                    <jats:sc>PIMANN<\/jats:sc>\n                    is available at https:\/\/github.com\/cds-ruc\/PIM-ANNS.\n                  <\/jats:p>","DOI":"10.1145\/3806055","type":"journal-article","created":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T11:26:02Z","timestamp":1775647562000},"page":"1-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Unlocking PIM-Core Capabilities for Efficient ANNS on Commodity Processing-in-Memory Hardware"],"prefix":"10.1145","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-7380-4090","authenticated-orcid":false,"given":"Puqing","family":"Wu","sequence":"first","affiliation":[{"name":"Renmin University of China","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6684-8336","authenticated-orcid":false,"given":"Minhui","family":"Xie","sequence":"additional","affiliation":[{"name":"Renmin University of China","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-6792-5141","authenticated-orcid":false,"given":"Enrui","family":"Zhao","sequence":"additional","affiliation":[{"name":"Renmin University of China","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-0021-5173","authenticated-orcid":false,"given":"Dafang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Renmin University of China","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3653-7013","authenticated-orcid":false,"given":"Jing","family":"Wang","sequence":"additional","affiliation":[{"name":"Renmin University of China","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9577-864X","authenticated-orcid":false,"given":"Xiao","family":"Liang","sequence":"additional","affiliation":[{"name":"Beijing Kuaishou Technology Co Ltd","place":["Haidian, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4183-9172","authenticated-orcid":false,"given":"Kai","family":"Ren","sequence":"additional","affiliation":[{"name":"Kuaishou","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3286-9259","authenticated-orcid":false,"given":"Yunpeng","family":"Chai","sequence":"additional","affiliation":[{"name":"Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education","place":["Beijing, China"]},{"name":"School of Information, Renmin University of China","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,27]]},"reference":[{"key":"e_1_3_4_2_2","unstructured":"2021. SPACEV1B: A billion-Scale vector dataset for text descriptors. Retrieved April 2026 from https:\/\/github.com\/microsoft\/SPTAG\/tree\/main\/datasets\/SPACEV1B"},{"key":"e_1_3_4_3_2","unstructured":"2022. Microsoft Research talk: Approximate nearest neighbor search systems at scale. [EB\/OL]. Retrieved April 2026 from https:\/\/www.youtube.com\/watch?v=BnYNdSIKibQ"},{"key":"e_1_3_4_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICFPT47387.2019.00019"},{"key":"e_1_3_4_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750386"},{"key":"e_1_3_4_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2872887.2750385"},{"key":"e_1_3_4_7_2","doi-asserted-by":"publisher","DOI":"10.1006\/cviu.1999.0767"},{"key":"e_1_3_4_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13222-023-00456-z"},{"key":"e_1_3_4_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW58674.2023.00035"},{"key":"e_1_3_4_10_2","first-page":"1","volume-title":"Proceedings of the 2023 International Conference on Management of Data (SIGMOD)","author":"Besta Maciej","year":"2023","unstructured":"Maciej Besta, Valeria Cardellini, Nika Gg, R\u00e9my Gerstenberger, Katarzyna Grolinger, Juan G\u00f3mez-Luna Javier Herruzo, Mario Iacono, Torsten Kurth, Luca Nici, Artur Podobas, et\u00a0al. 2023. Analysis of real processing-in-memory hardware. In Proceedings of the 2023 International Conference on Management of Data (SIGMOD). ACM, 1\u201314."},{"key":"e_1_3_4_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3307650.3322266"},{"key":"e_1_3_4_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2016.2577557"},{"key":"e_1_3_4_13_2","unstructured":"Mingkai Chen Tianhua Han Cheng Liu Shengwen Liang Kuai Yu Lei Dai Ziming Yuan Ying Wang Lei Zhang Huawei Li and Xiaowei Li. 2024. DRIM-ANN: An approximate nearest neighbor search engine based on commercial DRAM-PIMs. arXiv:2410.15621 (2024). Retrieved from https:\/\/arxiv.org\/abs\/2410.15621"},{"key":"e_1_3_4_14_2","unstructured":"Sitian Chen Amelie Chi Zhou Yucheng Shi Yusen Li and Xin Yao. 2024. MemANNS: Enhancing billion-scale ANNS efficiency with practical PIM hardware. arXiv:2410.23805 (2024). Retrieved from https:\/\/arxiv.org\/abs\/2410.23805"},{"key":"e_1_3_4_15_2","unstructured":"Rongxin Cheng Yifan Peng Xingda Wei Hongrui Xie Rong Chen Sijie Shen and Haibo Chen. 2024. Characterizing the dilemma of performance and index size in billion-scale vector search and breaking it with second-tier memory. arXiv:2405.03267 (2024). Retrieved from https:\/\/arxiv.org\/abs\/2405.03267"},{"key":"e_1_3_4_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3476146"},{"key":"e_1_3_4_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/SOCC56010.2022.9908126"},{"key":"e_1_3_4_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.490743"},{"key":"e_1_3_4_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3470496.3527431"},{"key":"e_1_3_4_20_2","unstructured":"T. Dharani and I. Laurence Aroquiaraj. 2013. Content based image retrieval system using feature classification with modified KNN algorithm. arXiv:1307.4717 (2013). Retrieved from https:\/\/arxiv.org\/abs\/1307.4717"},{"key":"e_1_3_4_21_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btad155"},{"key":"e_1_3_4_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"e_1_3_4_23_2","unstructured":"Matthijs Douze Alexandr Guzhva Chengqi Deng Jeff Johnson Gergely Szilvasy Pierre-Emmanuel Mazar\u00e9 Maria Lomeli Lucas Hosseini and Herv\u00e9 J\u00e9gou. 2024. The faiss library. arXiv:2401.08281 (2024). Retrieved from https:\/\/arxiv.org\/abs\/2401.08281"},{"key":"e_1_3_4_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/54.748803"},{"key":"e_1_3_4_25_2","first-page":"155","volume-title":"Proceedings of the European Conference on Parallel Processing","author":"Falevoz Yann","year":"2023","unstructured":"Yann Falevoz and Julien Legriel. 2023. Energy efficiency impact of processing in memory: A comprehensive review of workloads on the UPMEM architecture. In Proceedings of the European Conference on Parallel Processing. Springer, 155\u2013166."},{"key":"e_1_3_4_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3508041"},{"key":"e_1_3_4_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00031"},{"key":"e_1_3_4_28_2","unstructured":"Juan G\u00f3mez-Luna Yuxin Guo Geraldo F. Oliveira Mohammad Sadrosadati and Onur Mutlu. 2023. TransPimLib: A library for efficient transcendental functions on processing-in-memory systems. arXiv:2304.01951 (2023). Retrieved from https:\/\/arxiv.org\/abs\/2304.01951"},{"key":"e_1_3_4_29_2","unstructured":"Juan G\u00f3mez-Luna Izzat El Hajj Ivan Fernandez Christina Giannoula Geraldo F. Oliveira and Onur Mutlu. 2021. Benchmarking a new paradigm: An experimental analysis of a real processing-in-memory architecture. arXiv:2105.03814 (2021). Retrieved from https:\/\/arxiv.org\/abs\/2105.03814"},{"key":"e_1_3_4_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446749"},{"key":"e_1_3_4_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3620666.3651380"},{"key":"e_1_3_4_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3007787.3001159"},{"key":"e_1_3_4_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2016.7753257"},{"key":"e_1_3_4_34_2","volume-title":"Data Storage 2030","year":"2024","unstructured":"Huawei. 2024. Data Storage 2030. Huawei Technologies Co. Ltd. Technical Report. Retrieved from https:\/\/www.huawei.com\/cn\/giv\/data-storage-2030"},{"key":"e_1_3_4_35_2","first-page":"585","volume-title":"Proceedings of the 2023 USENIX Annual Technical Conference (USENIX ATC 23)","author":"Jang Junhyeok","year":"2023","unstructured":"Junhyeok Jang, Hanjin Choi, Hanyeoreum Bae, Seungjun Lee, Miryeong Kwon, and Myoungsoo Jung. 2023. \\(\\lbrace\\) CXL-ANNS \\(\\rbrace\\) : \\(\\lbrace\\) Software-hardware \\(\\rbrace\\) collaborative memory disaggregation and computation for \\(\\lbrace\\) Billion-Scale \\(\\rbrace\\) approximate nearest neighbor search. In Proceedings of the 2023 USENIX Annual Technical Conference (USENIX ATC 23). 585\u2013600."},{"key":"e_1_3_4_36_2","article-title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node","volume":"32","author":"Subramanya Suhas Jayaram","year":"2019","unstructured":"Suhas Jayaram Subramanya, Fnu Devvrit, Harsha Vardhan Simhadri, Ravishankar Krishnawamy, and Rohan Kadekodi. 2019. Diskann: Fast accurate billion-point nearest neighbor search on a single node. Advances in Neural Information Processing Systems 32 (2019), 13771\u201313781.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_4_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"e_1_3_4_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3581784.3607045"},{"key":"e_1_3_4_40_2","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574275"},{"key":"e_1_3_4_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591070"},{"key":"e_1_3_4_42_2","unstructured":"Saim Khan Somesh Singh Harsha Vardhan Simhadri Jyothi Vedurada et\u00a0al. 2024. BANG: Billion-scale approximate nearest neighbor search using a single GPU. arXiv:2401.11324 (2024). Retrieved from https:\/\/arxiv.org\/abs\/2401.11324"},{"key":"e_1_3_4_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/EPEPS47316.2019.193209"},{"key":"e_1_3_4_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/HCS59251.2023.10254717"},{"key":"e_1_3_4_45_2","volume-title":"BLAST on UPMEM","author":"Lavenier Dominique","year":"2016","unstructured":"Dominique Lavenier, Charles Deltel, David Furodet, and Jean-Fran\u00e7ois Roy. 2016. BLAST on UPMEM. Ph. D. Dissertation. INRIA Rennes-Bretagne Atlantique."},{"key":"e_1_3_4_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO61859.2024.00053"},{"key":"e_1_3_4_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA52012.2021.00013"},{"key":"e_1_3_4_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC42614.2022.9731711"},{"key":"e_1_3_4_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3698827"},{"key":"e_1_3_4_50_2","first-page":"9459","article-title":"Retrieval-augmented generation for knowledge-intensive nlp tasks","volume":"33","author":"Lewis Patrick","year":"2020","unstructured":"Patrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Naman Goyal, Heinrich K\u00fcttler, Mike Lewis, Wen-tau Yih, Tim Rockt\u00e4schel, et\u00a0al. 2020. Retrieval-augmented generation for knowledge-intensive nlp tasks. Advances in Neural Information Processing Systems 33 (2020), 9459\u20139474.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3620665.3640376"},{"key":"e_1_3_4_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3489517.3530560"},{"key":"e_1_3_4_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3589258"},{"key":"e_1_3_4_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA59077.2024.00036"},{"key":"e_1_3_4_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2435018"},{"key":"e_1_3_4_56_2","unstructured":"Si Ung Noh Junguk Hong Chaemin Lim Seongyeon Park Jeehyun Kim Hanjun Kim Youngsok Kim and Jinho Lee. 2024. PID-Comm: A fast and flexible collective communication framework for commodity processing-in-DIMM devices. arXiv:2404.08871 (2024). Retrieved from https:\/\/arxiv.org\/abs\/2404.08871"},{"key":"e_1_3_4_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00323"},{"key":"e_1_3_4_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/3620665.3640422"},{"key":"e_1_3_4_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA57654.2024.00078"},{"key":"e_1_3_4_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA57654.2024.00078"},{"key":"e_1_3_4_61_2","doi-asserted-by":"publisher","DOI":"10.1109\/ECOWS.2005.5"},{"key":"e_1_3_4_62_2","first-page":"10672","article-title":"HM-ANN: Efficient billion-point nearest neighbor search on heterogeneous memory","volume":"33","author":"Ren Jie","year":"2020","unstructured":"Jie Ren, Minjia Zhang, and Dong Li. 2020. HM-ANN: Efficient billion-point nearest neighbor search on heterogeneous memory. Advances in Neural Information Processing Systems 33 (2020), 10672\u201310684.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_63_2","unstructured":"Samsung. 2017. 8Gb C-die DDR4 SDRAM x16. Retrieved January 9 2025 from https:\/\/download.semiconductor.samsung.com\/resources\/user-manual\/x16%20only_8G_C_DDR4_Samsung_Spec_Rev1.5_Apr.17.pdf"},{"key":"e_1_3_4_64_2","first-page":"177","volume-title":"Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track","author":"Simhadri Harsha Vardhan","year":"2022","unstructured":"Harsha Vardhan Simhadri, George Williams, Martin Aum\u00fcller, Matthijs Douze, Artem Babenko, Dmitry Baranchuk, Qi Chen, Lucas Hosseini, Ravishankar Krishnaswamny, Gopal Srinivasa, et\u00a0al. 2022. Results of the NeurIPS\u201921 challenge on billion-scale approximate nearest neighbor search. In Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track. PMLR, 177\u2013189."},{"key":"e_1_3_4_65_2","first-page":"1135","volume-title":"Proceedings of the 2024 USENIX Annual Technical Conference (USENIX ATC 24)","author":"Tian Bing","year":"2024","unstructured":"Bing Tian, Haikun Liu, Zhuohui Duan, Xiaofei Liao, Hai Jin, and Yu Zhang. 2024. Scalable billion-point approximate nearest neighbor search using \\(\\lbrace\\) SmartSSDs \\(\\rbrace\\) . In Proceedings of the 2024 USENIX Annual Technical Conference (USENIX ATC 24). 1135\u20131150."},{"key":"e_1_3_4_66_2","unstructured":"S. M. Tonmoy S. M. Zaman Vinija Jain Anku Rani Vipula Rawte Aman Chadha and Amitava Das. 2024. A comprehensive survey of hallucination mitigation techniques in large language models. arXiv:2401.01313 (2024). Retrieved from https:\/\/arxiv.org\/abs\/2401.01313"},{"key":"e_1_3_4_67_2","unstructured":"UPMEM. 2024. UPMEM Software Development Kit (SDK) 2024.2.0. Retrieved April 2026 from https:\/\/sdk.upmem.com\/"},{"key":"e_1_3_4_68_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-5309-7_8"},{"key":"e_1_3_4_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457550"},{"key":"e_1_3_4_70_2","unstructured":"Mengzhao Wang Xiaoliang Xu Qiang Yue and Yuxiang Wang. 2021. A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search. arXiv:2101.12631 (2021). Retrieved from https:\/\/arxiv.org\/abs\/2101.12631"},{"key":"e_1_3_4_71_2","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415541"},{"key":"e_1_3_4_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/3613424.3614292"},{"key":"e_1_3_4_73_2","first-page":"23","volume-title":"Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI 24)","author":"Zhang Zili","year":"2024","unstructured":"Zili Zhang, Fangyue Liu, Gang Huang, Xuanzhe Liu, and Xin Jin. 2024. Fast vector query processing for large datasets beyond \\(\\lbrace\\) GPU \\(\\rbrace\\) memory with reordered pipelining. In Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI 24). 23\u201340."},{"key":"e_1_3_4_74_2","first-page":"1","volume-title":"Proceedings of the 2023 International Conference on Management of Data (SIGMOD)","author":"Zheng Jianbin","year":"2023","unstructured":"Jianbin Zheng, Junjie Gao, Xiaoliang Wang, Tao Wang, Ying Zhao, and Kai Zheng. 2023. High-dimensional approximate nearest neighbor search: with reliable and efficient distance comparison operations. In Proceedings of the 2023 International Conference on Management of Data (SIGMOD). ACM, 1\u201313."},{"key":"e_1_3_4_75_2","volume-title":"Proceedings of the 2025 International Conference on Management of Data (SIGMOD)","author":"Zheng Jianbin","year":"2025","unstructured":"Jianbin Zheng, Junjie Gao, Xiaoliang Wang, Tao Wang, Ying Zhao, and Kai Zheng. 2025. PDX: A data layout for vector similarity search. In Proceedings of the 2025 International Conference on Management of Data (SIGMOD). ACM."}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3806055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T16:22:27Z","timestamp":1785169347000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3806055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,27]]},"references-count":74,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,8,31]]}},"alternative-id":["10.1145\/3806055"],"URL":"https:\/\/doi.org\/10.1145\/3806055","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"value":"1553-3077","type":"print"},{"value":"1553-3093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,27]]},"assertion":[{"value":"2025-10-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-28","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-07-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}