{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:53:10Z","timestamp":1777733590338,"version":"3.51.4"},"reference-count":67,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T00:00:00Z","timestamp":1699401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2024,3,31]]},"abstract":"<jats:p>\n            Maximum Inner Product Search or top-\n            <jats:italic>k<\/jats:italic>\n            retrieval on sparse vectors is well understood in information retrieval, with a number of mature algorithms that solve it exactly. However, all existing algorithms are tailored to text and frequency-based similarity measures. To achieve optimal memory footprint and query latency, they rely on the near stationarity of documents and on laws governing natural languages. We consider, instead, a setup in which collections are streaming\u2014necessitating dynamic indexing\u2014and where indexing and retrieval must work with arbitrarily distributed real-valued vectors. As we show, existing algorithms are no longer competitive in this setup, even against na\u00efve solutions. We investigate this gap and present a novel\n            <jats:italic>approximate<\/jats:italic>\n            solution, called\n            <jats:sc>Sinnamon<\/jats:sc>\n            , that can efficiently retrieve the top-\n            <jats:italic>k<\/jats:italic>\n            results for sparse\n            <jats:italic>real valued<\/jats:italic>\n            vectors drawn from arbitrary distributions. Notably,\n            <jats:sc>Sinnamon<\/jats:sc>\n            offers levers to trade off memory consumption, latency, and accuracy, making the algorithm suitable for constrained applications and systems. We give theoretical results on the error introduced by the approximate nature of the algorithm and present an empirical evaluation of its performance on two hardware platforms and synthetic and real-valued datasets. We conclude by laying out concrete directions for future research on this general top-\n            <jats:italic>k<\/jats:italic>\n            retrieval problem over sparse vectors.\n          <\/jats:p>","DOI":"10.1145\/3609797","type":"journal-article","created":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T12:26:11Z","timestamp":1689596771000},"page":"1-43","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["An Approximate Algorithm\u00a0for Maximum Inner Product Search over Streaming Sparse Vectors"],"prefix":"10.1145","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2469-8242","authenticated-orcid":false,"given":"Sebastian","family":"Bruch","sequence":"first","affiliation":[{"name":"Pinecone, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3183-334X","authenticated-orcid":false,"given":"Franco Maria","family":"Nardini","sequence":"additional","affiliation":[{"name":"ISTI-CNR, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6639-8240","authenticated-orcid":false,"given":"Amir","family":"Ingber","sequence":"additional","affiliation":[{"name":"Pinecone, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3132-2785","authenticated-orcid":false,"given":"Edo","family":"Liberty","sequence":"additional","affiliation":[{"name":"Pinecone, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,11,8]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/060673096"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133053"},{"issue":"3","key":"e_1_3_3_4_2","first-page":"21","article-title":"An almost optimal unrestricted fast Johnson-Lindenstrauss transform","volume":"9","author":"Ailon Nir","year":"2013","unstructured":"Nir Ailon and Edo Liberty. 2013. An almost optimal unrestricted fast Johnson-Lindenstrauss transform. ACM Trans. Algor. 9, 3, Article 21 (June2013), 12 pages.","journal-title":"ACM Trans. Algor."},{"key":"e_1_3_3_5_2","volume-title":"Multi-stage Search Architectures for Streaming Documents","author":"Asadi Nima","year":"2013","unstructured":"Nima Asadi. 2013. Multi-stage Search Architectures for Streaming Documents. University of Maryland."},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398656"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484132"},{"issue":"3","key":"e_1_3_3_8_2","first-page":"13","article-title":"Fast candidate generation for real-time tweet search with Bloom filter chains","volume":"31","author":"Asadi Nima","year":"2013","unstructured":"Nima Asadi and Jimmy Lin. 2013. Fast candidate generation for real-time tweet search with Bloom filter chains. ACM Trans. Inf. Syst. 31, 3, Article 13 (Aug.2013), 36 pages.","journal-title":"ACM Trans. Inf. Syst."},{"key":"e_1_3_3_9_2","first-page":"688","article-title":"A work-efficient parallel sparse matrix-sparse vector multiplication algorithm","author":"Azad Ariful","year":"2017","unstructured":"Ariful Azad and Ayd\u0131n Bulu\u00e7. 2017. A work-efficient parallel sparse matrix-sparse vector multiplication algorithm. Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201917). 688\u2013697.","journal-title":"Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201917)"},{"key":"e_1_3_3_10_2","unstructured":"Yang Bai Xiaoguang Li Gang Wang Chaoliang Zhang Lifeng Shang Jun Xu Zhaowei Wang Fangshan Wang and Qun Liu. 2020. SparTerm: Learning Term-based Sparse Representation for Fast Text Retrieval. arxiv:2010.00768"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_3_12_2","first-page":"426","volume-title":"Proceedings of the 12th International Conference on Information and Knowledge Management","author":"Broder Andrei Z.","year":"2003","unstructured":"Andrei Z. Broder, David Carmel, Michael Herscovici, Aya Soffer, and Jason Zien. 2003. Efficient query evaluation using a two-level retrieval process. In Proceedings of the 12th International Conference on Information and Knowledge Management. 426\u2013434."},{"key":"e_1_3_3_13_2","unstructured":"Sebastian Bruch Siyu Gai and Amir Ingber. 2022. An Analysis of Fusion Functions for Hybrid Retrieval. arxiv:2210.11934"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2325"},{"key":"e_1_3_3_15_2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-3-030-99736-6_7","volume-title":"Proceedings of the 44th European Conference on IR Research: Advances in Information Retrieval","author":"Chen Tao","year":"2022","unstructured":"Tao Chen, Mingyang Zhang, Jing Lu, Michael Bendersky, and Marc Najork. 2022. Out-of-domain semantics to the rescue! Zero-shot hybrid retrieval models. In Proceedings of the 44th European Conference on IR Research: Advances in Information Retrieval. 95\u2013110."},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_3_17_2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/3018661.3018726","volume-title":"Proceedings of the 10th ACM International Conference on Web Search and Data Mining","author":"Crane Matt","year":"2017","unstructured":"Matt Crane, J. Shane Culpepper, Jimmy Lin, Joel Mackenzie, and Andrew Trotman. 2017. A comparison of document-at-a-time and score-at-a-time query evaluation. In Proceedings of the 10th ACM International Conference on Web Search and Data Mining. 201\u2013210."},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401204"},{"key":"e_1_3_3_19_2","first-page":"4171","volume-title":"Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies","author":"Devlin Jacob","year":"2019","unstructured":"Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of deep bidirectional transformers for language understanding. In Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. Association for Computational Linguistics, 4171\u20134186."},{"key":"e_1_3_3_20_2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/2433396.2433412","volume-title":"Proceedings of the 6th ACM International Conference on Web Search and Data Mining","author":"Dimopoulos Constantinos","year":"2013","unstructured":"Constantinos Dimopoulos, Sergey Nepomnyachiy, and Torsten Suel. 2013. Optimizing top-k document retrieval strategies for block-max indexes. In Proceedings of the 6th ACM International Conference on Web Search and Data Mining. 113\u2013122."},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010048"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531857"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463098"},{"key":"e_1_3_3_25_2","first-page":"36","volume-title":"Proceedings of the IEEE 22nd Annual International Symposium on Field-Programmable Custom Computing Machines","author":"Fowers Jeremy","year":"2014","unstructured":"Jeremy Fowers, Kalin Ovtcharov, Karin Strauss, Eric S. Chung, and Greg Stitt. 2014. A high memory bandwidth FPGA accelerator for sparse matrix-vector multiplication. In Proceedings of the IEEE 22nd Annual International Symposium on Field-Programmable Custom Computing Machines. IEEE, 36\u201343."},{"key":"e_1_3_3_26_2","first-page":"3030","volume-title":"Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies","author":"Gao Luyu","year":"2021","unstructured":"Luyu Gao, Zhuyun Dai, and Jamie Callan. 2021. COIL: Revisit exact lexical match in information retrieval with contextualized inverted list. In Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 3030\u20133042."},{"key":"e_1_3_3_27_2","first-page":"605","volume-title":"Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Goodwin Bob","year":"2017","unstructured":"Bob Goodwin, Michael Hopcroft, Dan Luu, Alex Clemmer, Mihaela Curmei, Sameh Elnikety, and Yuxiong He. 2017. BitFunnel: Revisiting signatures for search. In Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval. 605\u2013614."},{"key":"e_1_3_3_28_2","first-page":"3887","volume-title":"Proceedings of the 37th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 119)","author":"Guo Ruiqi","year":"2020","unstructured":"Ruiqi Guo, Philip Sun, Erik Lindgren, Quan Geng, David Simcha, Felix Chern, and Sanjiv Kumar. 2020. Accelerating large-scale inference with anisotropic vector quantization. In Proceedings of the 37th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 119). 3887\u20133896."},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_3_3_32_2","unstructured":"Aditya Krishnan and Edo Liberty. 2021. Projective Clustering Product Quantization. arXiv:2112.02179"},{"key":"e_1_3_3_33_2","unstructured":"Saar Kuzi Mingyang Zhang Cheng Li Michael Bendersky and Marc Najork. 2020. Leveraging semantic and lexical matching to improve the recall of document retrieval systems: A hybrid approach. arXiv:2010.01195"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531833"},{"key":"e_1_3_3_35_2","first-page":"238","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","author":"Li Jiajia","year":"2018","unstructured":"Jiajia Li, Jimeng Sun, and Richard Vuduc. 2018. HiCOO: Hierarchical storage of sparse tensors. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, 238\u2013252."},{"key":"e_1_3_3_36_2","unstructured":"Jimmy Lin and Xueguang Ma. 2021. A Few Brief Notes on DeepImpact COIL and a Conceptual Framework for Information Retrieval Techniques. arXiv:2106.14807"},{"key":"e_1_3_3_37_2","first-page":"301","volume-title":"Proceedings of the International Conference on The Theory of Information Retrieval","author":"Lin Jimmy","year":"2015","unstructured":"Jimmy Lin and Andrew Trotman. 2015. Anytime ranking for impact-ordered indexes. In Proceedings of the International Conference on The Theory of Information Retrieval. 301\u2013304."},{"key":"e_1_3_3_38_2","unstructured":"Yu A. Malkov and D. A. Yashunin. 2016. Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. arXiv:1603.09320"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463030"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080780"},{"key":"e_1_3_3_41_2","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1007\/978-3-030-15712-8_52","volume-title":"Proceedings of the Conference on Advances in Information Retrieval","author":"Mallia Antonio","year":"2019","unstructured":"Antonio Mallia and Elia Porciani. 2019. Faster BlockMax WAND with longer skipping. In Proceedings of the Conference on Advances in Information Retrieval. 771\u2013778."},{"key":"e_1_3_3_42_2","unstructured":"Tri Nguyen Mir Rosenberg Xia Song Jianfeng Gao Saurabh Tiwary Rangan Majumder and Li Deng. 2018. MS MARCO: A human generated machine reading comprehension dataset. arxiv:1611.09268"},{"key":"e_1_3_3_43_2","unstructured":"Rodrigo Nogueira and Kyunghyun Cho. 2020. Passage Re-ranking with BERT. arxiv:1901.04085"},{"key":"e_1_3_3_44_2","doi-asserted-by":"crossref","first-page":"708","DOI":"10.18653\/v1\/2020.findings-emnlp.63","volume-title":"Findings of the Association for Computational Linguistics: EMNLP 2020","author":"Nogueira Rodrigo","year":"2020","unstructured":"Rodrigo Nogueira, Zhiying Jiang, Ronak Pradeep, and Jimmy Lin. 2020. Document ranking with a pretrained sequence-to-sequence model. In Findings of the Association for Computational Linguistics: EMNLP 2020. Association for Computational Linguistics, 708\u2013718."},{"key":"e_1_3_3_45_2","first-page":"724","volume-title":"Proceedings of the IEEE International Symposium on High Performance Computer Architecture (HPCA\u201918)","author":"Pal Subhankar","year":"2018","unstructured":"Subhankar Pal, Jonathan Beaumont, Dong-Hyeon Park, Aporva Amarnath, Siying Feng, Chaitali Chakrabarti, Hun-Seok Kim, David Blaauw, Trevor Mudge, and Ronald Dreslinski. 2018. OuterSPACE: An outer product based sparse matrix multiplication accelerator. In Proceedings of the IEEE International Symposium on High Performance Computer Architecture (HPCA\u201918). 724\u2013736."},{"issue":"6","key":"e_1_3_3_46_2","first-page":"125","article-title":"Techniques for inverted index compression","volume":"53","author":"Pibiri Giulio Ermanno","year":"2020","unstructured":"Giulio Ermanno Pibiri and Rossano Venturini. 2020. Techniques for inverted index compression. ACM Comput. Surv. 53, 6, Article 125 (Dec.2020), 36 pages.","journal-title":"ACM Comput. Surv."},{"key":"e_1_3_3_47_2","first-page":"508","volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM\u201919)","author":"Pratap Rameshwar","year":"2019","unstructured":"Rameshwar Pratap, Debajyoti Bera, and Karthik Revanuru. 2019. Efficient sketching algorithm for sparse binary data. In Proceedings of the IEEE International Conference on Data Mining (ICDM\u201919). 508\u2013517."},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1410"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1561\/1500000019"},{"key":"e_1_3_3_50_2","series-title":"NIST Special Publication","first-page":"109","volume-title":"TREC","author":"Robertson Stephen E.","year":"1994","unstructured":"Stephen E. Robertson, Steve Walker, Susan Jones, Micheline Hancock-Beaulieu, and Mike Gatford. 1994. Okapi at TREC-3. In TREC(NIST Special Publication, Vol. 500-225), Donna K. Harman (Ed.). National Institute of Standards and Technology (NIST), 109\u2013126."},{"key":"e_1_3_3_51_2","unstructured":"Aditi Singh Suhas Jayaram Subramanya Ravishankar Krishnaswamy and Harsha Vardhan Simhadri. 2021. FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search. arXiv:2105.09613"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.27"},{"key":"e_1_3_3_53_2","first-page":"766","volume-title":"Proceedings of the 53rd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201920)","author":"Srivastava Nitish","year":"2020","unstructured":"Nitish Srivastava, Hanchen Jin, Jie Liu, David Albonesi, and Zhiru Zhang. 2020. MatRaptor: A sparse-sparse matrix multiplication accelerator based on row-wise product. In Proceedings of the 53rd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201920). 766\u2013780."},{"key":"e_1_3_3_54_2","first-page":"689","volume-title":"Proceedings of the IEEE International Symposium on High Performance Computer Architecture (HPCA\u201920)","author":"Srivastava Nitish","year":"2020","unstructured":"Nitish Srivastava, Hanchen Jin, Shaden Smith, Hongbo Rong, David Albonesi, and Zhiru Zhang. 2020. Tensaurus: A versatile accelerator for mixed sparse-dense tensor computations. In Proceedings of the IEEE International Symposium on High Performance Computer Architecture (HPCA\u201920). 689\u2013702."},{"key":"e_1_3_3_55_2","doi-asserted-by":"publisher","DOI":"10.1561\/1500000057"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-021-00815-y"},{"key":"e_1_3_3_57_2","first-page":"993","volume-title":"Proceedings of the ACM International Conference on Management of Data","author":"Wang Jianguo","year":"2017","unstructured":"Jianguo Wang, Chunbin Lin, Yannis Papakonstantinou, and Steven Swanson. 2017. An experimental study of bitmap compression vs. inverted list compression. In Proceedings of the ACM International Conference on Management of Data. 993\u20131008."},{"key":"e_1_3_3_58_2","first-page":"317","volume-title":"Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval","author":"Wang Shuai","year":"2021","unstructured":"Shuai Wang, Shengyao Zhuang, and Guido Zuccon. 2021. BERT-based dense retrievers require interpolation with BM25 for effective passage retrieval. In Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval. 317\u2013324."},{"key":"e_1_3_3_59_2","unstructured":"Yonghui Wu Mike Schuster Zhifeng Chen Quoc V. Le Mohammad Norouzi Wolfgang Macherey Maxim Krikun Yuan Cao Qin Gao Klaus Macherey Jeff Klingner Apurva Shah Melvin Johnson Xiaobing Liu \u0141ukasz Kaiser Stephan Gouws Yoshikiyo Kato Taku Kudo Hideto Kazawa Keith Stevens George Kurian Nishant Patil Wei Wang Cliff Young Jason Smith Jason Riesa Alex Rudnick Oriol Vinyals Greg Corrado Macduff Hughes and Jeffrey Dean. 2016. Google\u2019s Neural Machine Translation System: Bridging the Gap between Human and Machine Translation. arXiv:1609.08144"},{"key":"e_1_3_3_60_2","unstructured":"Jheng-Hong Yang Xueguang Ma and Jimmy Lin. 2021. Sparsifying Sparse Representations for Passage Retrieval by Top- k Masking. arXiv:2112.09628"},{"key":"e_1_3_3_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939677"},{"key":"e_1_3_3_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271800"},{"key":"e_1_3_3_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531722"},{"key":"e_1_3_3_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367550"},{"key":"e_1_3_3_65_2","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems","volume":"32","author":"Zhou Zhixin","year":"2019","unstructured":"Zhixin Zhou, Shulong Tan, Zhaozhuo Xu, and Ping Li. 2019. M\u00f6bius transformation for fast inner product search on graph. In Proceedings of the Conference on Advances in Neural Information Processing Systems, Vol. 32."},{"key":"e_1_3_3_66_2","volume-title":"Proceedings of the Workshop on Reaching Efficiency in Neural Information Retrieval, the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Zhuang Shengyao","year":"2022","unstructured":"Shengyao Zhuang and Guido Zuccon. 2022. Fast passage re-ranking with contextualized exact term matching and efficient passage expansion. In Proceedings of the Workshop on Reaching Efficiency in Neural Information Retrieval, the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval."},{"issue":"2","key":"e_1_3_3_67_2","first-page":"56","article-title":"Inverted files for text search engines","volume":"38","author":"Zobel Justin","year":"2006","unstructured":"Justin Zobel and Alistair Moffat. 2006. Inverted files for text search engines. ACM Comput. Surv. 38, 2 (July2006), 56 pages.","journal-title":"ACM Comput. Surv."},{"key":"e_1_3_3_68_2","first-page":"59","volume-title":"Proceedings of the 22nd International Conference on Data Engineering","author":"Zukowski Marcin","year":"2006","unstructured":"Marcin Zukowski, Sandor Heman, Niels Nes, and Peter Boncz. 2006. Super-scalar RAM-CPU cache compression. In Proceedings of the 22nd International Conference on Data Engineering. 59."}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3609797","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3609797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:38:01Z","timestamp":1750178281000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3609797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,8]]},"references-count":67,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3,31]]}},"alternative-id":["10.1145\/3609797"],"URL":"https:\/\/doi.org\/10.1145\/3609797","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,8]]},"assertion":[{"value":"2023-01-23","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-13","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-11-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}