{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T23:28:39Z","timestamp":1774308519172,"version":"3.50.1"},"reference-count":84,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T00:00:00Z","timestamp":1724025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Horizon Europe RIA \u201cEFRA \u2013 Extreme Food Risk Analytics\u201d","award":["101093026"],"award-info":[{"award-number":["101093026"]}]},{"name":"PNRR\u2013M4C2\u2013Investimento 1.3, Partenariato Esteso","award":["PE00000013"],"award-info":[{"award-number":["PE00000013"]}]},{"name":"European Commission under the NextGeneration EU program"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2024,11,30]]},"abstract":"<jats:p>\n            Maximum inner product search (MIPS) over dense and sparse vectors have progressed independently in a bifurcated literature for decades; the latter is better known as top-\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(k\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            retrieval in Information Retrieval. This duality exists because sparse and dense vectors serve different end goals. That is despite the fact that they are manifestations of the same mathematical problem. In this work, we ask if algorithms for dense vectors could be applied effectively to sparse vectors, particularly those that violate the assumptions underlying top-\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(k\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            retrieval methods. We study clustering-based approximate MIPS where vectors are partitioned into clusters and only a fraction of clusters are searched during retrieval. We conduct a comprehensive analysis of dimensionality reduction for sparse vectors, and examine standard and spherical\n            <jats:italic>k<\/jats:italic>\n            -means for partitioning. Our experiments demonstrate that clustering-based retrieval serves as an efficient solution for sparse MIPS. As byproducts, we identify two research opportunities and explore their potential. First, we cast the clustering-based paradigm as dynamic pruning and turn that insight into a novel organization of the inverted index for approximate MIPS over general sparse vectors. Second, we offer a unified regime for MIPS over vectors that have dense and sparse subspaces, that is robust to query distributions.\n          <\/jats:p>","DOI":"10.1145\/3665324","type":"journal-article","created":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T12:53:34Z","timestamp":1715950414000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Bridging Dense and Sparse Maximum Inner Product Search"],"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, New York, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3183-334X","authenticated-orcid":false,"given":"Franco Maria","family":"Nardini","sequence":"additional","affiliation":[{"name":"ISTI-CNR, Pisa, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6639-8240","authenticated-orcid":false,"given":"Amir","family":"Ingber","sequence":"additional","affiliation":[{"name":"Pinecone, Tel Aviv, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3132-2785","authenticated-orcid":false,"given":"Edo","family":"Liberty","sequence":"additional","affiliation":[{"name":"Pinecone, New York, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,8,19]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/060673096"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133053"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/2483699.2483701"},{"key":"e_1_3_3_6_2","first-page":"1027","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Arthur David","year":"2007","unstructured":"David Arthur and Sergei Vassilvitskii. 2007. K-Means++: The Advantages of Careful Seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms. 1027\u20131035."},{"key":"e_1_3_3_7_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_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484132"},{"key":"e_1_3_3_9_2","unstructured":"Alex Auvolat Sarath Chandar Pascal Vincent Hugo Larochelle and Yoshua Bengio. 2015. Clustering is efficient for approximate maximum inner product search. arXiv:1507.05910 [cs.LG]"},{"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 [cs.IR]"},{"key":"e_1_3_3_11_2","first-page":"1289","article-title":"The Johnson-Lindenstrauss Lemma Meets Compressed Sensing","volume":"52","author":"Baraniuk Richard","year":"2006","unstructured":"Richard Baraniuk, M. Davenport, Ronald DeVore, and M. Wakin. 2006. The Johnson-Lindenstrauss Lemma Meets Compressed Sensing. IEEE Transactions on Information Theory 52 (January 2006), 1289\u20131306.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956944"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-55182-6"},{"issue":"1","key":"e_1_3_3_14_2","first-page":"35","article-title":"An Analysis of Fusion Functions for Hybrid Retrieval","volume":"42","author":"Bruch Sebastian","year":"2023","unstructured":"Sebastian Bruch, Siyu Gai, and Amir Ingber. 2023. An Analysis of Fusion Functions for Hybrid Retrieval. ACM Transactions on Information Systems 42, 1, Article 20 (August 2023), 35 pages.","journal-title":"ACM Transactions on Information Systems"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531704"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1561\/1500000071"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591922"},{"issue":"2","key":"e_1_3_3_18_2","first-page":"43","article-title":"An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors","volume":"42","author":"Bruch Sebastian","year":"2023","unstructured":"Sebastian Bruch, Franco Maria Nardini, Amir Ingber, and Edo Liberty. 2023. An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors. ACM Transactions on Information Systems 42, 2, Article 42 (November 2023), 43 pages.","journal-title":"ACM Transactions on Information Systems"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99736-6_7"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018726"},{"key":"e_1_3_3_21_2","doi-asserted-by":"crossref","unstructured":"Nick Craswell Bhaskar Mitra Emine Yilmaz and Daniel Campos. 2021. Overview of the Trec 2020 deep learning track. arXiv:2102.07662 [cs.IR]","DOI":"10.6028\/NIST.SP.1266.deep-overview"},{"key":"e_1_3_3_22_2","doi-asserted-by":"crossref","unstructured":"Nick Craswell Bhaskar Mitra Emine Yilmaz Daniel Campos and Ellen M. Voorhees. 2020. Overview of the Trec 2019 deep learning track. arXiv:2003.07820 [cs.IR]","DOI":"10.6028\/NIST.SP.1266.deep-overview"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401204"},{"key":"e_1_3_3_24_2","first-page":"4171","volume-title":"Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics","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 2019 Conference of the North American Chapter of the Association for Computational Linguistics. 4171\u20134186."},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.5555\/599609.599630"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433412"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010048"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531857"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463098"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.naacl-main.241"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080789"},{"key":"e_1_3_3_32_2","first-page":"3887","volume-title":"Proceedings of the 37th International Conference on Machine Learning (Proceedings of Machine Learning Research)","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). 3887\u20133896."},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113288"},{"key":"e_1_3_3_40_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 [cs.IR]"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531833"},{"key":"e_1_3_3_42_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 [cs.IR]"},{"key":"e_1_3_3_43_2","doi-asserted-by":"crossref","unstructured":"Jimmy Lin Rodrigo Nogueira and Andrew Yates. 2021. Pretrained transformers for text ranking: BERT and beyond. arXiv:2010.06467 [cs.IR]","DOI":"10.1007\/978-3-031-02181-7"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/2808194.2809477"},{"key":"e_1_3_3_45_2","doi-asserted-by":"crossref","unstructured":"Jie Liu Xiao Yan Xinyan Dai Zhirong Li James Cheng and Ming-Chang Yang. 2019. Understanding and improving proximity graph based maximum inner product search. arXiv:1909.13459 [cs.IR]","DOI":"10.1609\/aaai.v34i01.5344"},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482132"},{"key":"e_1_3_3_47_2","unstructured":"Ji Ma Ivan Korotkov Keith Hall and Ryan T. McDonald. 2020. Hybrid First-stage Retrieval Models for Biomedical Literature. In Working Notes of Conference and Labs of the Evaluation Forum (CLEF \u201920). DOI: https:\/\/ceur-ws.org\/Vol-2696\/paper_92.pdf"},{"key":"e_1_3_3_48_2","unstructured":"Xueguang Ma Kai Sun Ronak Pradeep and Jimmy J. Lin. 2021. A replication study of dense passage retriever. arXiv:2104.05740 [cs.IR]"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.findings-emnlp.205"},{"issue":"1","key":"e_1_3_3_50_2","first-page":"32","article-title":"Anytime Ranking on Document-Ordered Indexes","volume":"40","author":"Mackenzie Joel","year":"2021","unstructured":"Joel Mackenzie, Matthias Petri, and Alistair Moffat. 2021. Anytime Ranking on Document-Ordered Indexes. ACM Transactions on Information Systems 40, 1, Article 13 (September 2021), 32 pages.","journal-title":"ACM Transactions on Information Systems"},{"key":"e_1_3_3_51_2","unstructured":"Joel Mackenzie Andrew Trotman and Jimmy Lin. 2021. Wacky weights in learned sparse representations and the revenge of score-at-a-time query evaluation. arXiv:2110.11540 [cs.IR]"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3576922"},{"key":"e_1_3_3_53_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 [cs.DS]"},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463030"},{"key":"e_1_3_3_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531774"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080780"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-15712-8_52"},{"key":"e_1_3_3_58_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","author":"Morozov Stanislav","year":"2018","unstructured":"Stanislav Morozov and Artem Babenko. 2018. Non-Metric Similarity Graphs for Maximum Inner Product Search. In Proceedings of the Advances in Neural Information Processing Systems."},{"key":"e_1_3_3_59_2","first-page":"1926","volume-title":"Proceedings of the 32nd International Conference on International Conference on Machine Learning","volume":"37","author":"Neyshabur Behnam","year":"2015","unstructured":"Behnam Neyshabur and Nathan Srebro. 2015. On Symmetric and Asymmetric LSHs for Inner Product Search. In Proceedings of the 32nd International Conference on International Conference on Machine Learning, Vol. 37. 1926\u20131934."},{"key":"e_1_3_3_60_2","unstructured":"Tri Nguyen Mir Rosenberg Xia Song Jianfeng Gao Saurabh Tiwary Rangan Majumder and Li Deng. 2016. MS MARCO: A Human Generated MAchine Reading COmprehension Dataset. (November 2016)."},{"key":"e_1_3_3_61_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2017.2705068"},{"key":"e_1_3_3_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331207"},{"issue":"6","key":"e_1_3_3_63_2","first-page":"36","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 Computing Surveys 53, 6, Article 125 (December 2020), 36 pages.","journal-title":"ACM Computing Surveys"},{"key":"e_1_3_3_64_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00061"},{"key":"e_1_3_3_65_2","first-page":"109","volume-title":"Proceedings of the Overview of the Third Text REtrieval Conference (Trec \u201994)","volume":"500","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 Proceedings of the Overview of the Third Text REtrieval Conference (Trec \u201994), Vol. 500-225. National Institute of Standards and Technology, 109\u2013126."},{"key":"e_1_3_3_66_2","first-page":"2321","volume-title":"Proceedings of the 27th International Conference on Neural Information Processing Systems","volume":"2","author":"Shrivastava Anshumali","year":"2014","unstructured":"Anshumali Shrivastava and Ping Li. 2014. Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS). In Proceedings of the 27th International Conference on Neural Information Processing Systems, Vol. 2. 2321\u20132329."},{"key":"e_1_3_3_67_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00143"},{"key":"e_1_3_3_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467412"},{"key":"e_1_3_3_69_2","volume-title":"Proceedings of the 35th Conference on Neural Information Processing Systems Datasets and Benchmarks Track (Round 2)","author":"Thakur Nandan","year":"2021","unstructured":"Nandan Thakur, Nils Reimers, Andreas R\u00fcckl\u00e9, Abhishek Srivastava, and Iryna Gurevych. 2021. BEIR: A Heterogeneous Benchmark for Zero-shot Evaluation of Information Retrieval Models. In Proceedings of the 35th Conference on Neural Information Processing Systems Datasets and Benchmarks Track (Round 2)."},{"key":"e_1_3_3_70_2","unstructured":"Mo Tiwari Ryan Kang Je-Yong Lee Donghyun Lee Chris Piech Sebastian Thrun Ilan Shomorony and Martin Jinye Zhang. 2023. Faster maximum inner product search in high dimensions. arXiv:2212.07551 [cs.LG]"},{"key":"e_1_3_3_71_2","doi-asserted-by":"publisher","DOI":"10.1561\/1500000057"},{"key":"e_1_3_3_72_2","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(95)00020-H"},{"key":"e_1_3_3_73_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-021-00815-y"},{"key":"e_1_3_3_74_2","doi-asserted-by":"publisher","DOI":"10.1145\/3471158.3472233"},{"key":"e_1_3_3_75_2","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"e_1_3_3_76_2","unstructured":"Xiang Wu Ruiqi Guo Sanjiv Kumar and David Simcha. 2019. Local orthogonal decomposition for maximum inner product search. arXiv:1903.10391 [cs.LG]"},{"key":"e_1_3_3_77_2","unstructured":"Xiang Wu Ruiqi Guo David Simcha Dave Dopson and Sanjiv Kumar. 2019. Efficient inner product approximation in hybrid spaces. arXiv:1903.08690 [cs.LG]"},{"key":"e_1_3_3_78_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_79_2","doi-asserted-by":"publisher","DOI":"10.5555\/3327144.3327218"},{"key":"e_1_3_3_80_2","unstructured":"Jheng-Hong Yang Xueguang Ma and Jimmy Lin. 2021. Sparsifying sparse representations for passage retrieval by top- \\(k\\) masking. arXiv:2112.09628 [cs.IR]"},{"key":"e_1_3_3_81_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271800"},{"key":"e_1_3_3_82_2","unstructured":"Wengang Zhou Houqiang Li and Qi Tian. 2017. Recent advance in content-based image retrieval: A literature survey. arXiv:1706.06064 [cs.MM]"},{"key":"e_1_3_3_83_2","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3455025"},{"key":"e_1_3_3_84_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."},{"key":"e_1_3_3_85_2","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3665324","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3665324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:19Z","timestamp":1750291399000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3665324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,19]]},"references-count":84,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11,30]]}},"alternative-id":["10.1145\/3665324"],"URL":"https:\/\/doi.org\/10.1145\/3665324","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,19]]},"assertion":[{"value":"2023-09-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-29","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}