{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:51:07Z","timestamp":1773481867960,"version":"3.50.1"},"reference-count":84,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T00:00:00Z","timestamp":1710201600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,3,12]]},"abstract":"<jats:p>Recently, the growing memory demands of embedding tables in Deep Learning Recommendation Models (DLRMs) pose great challenges for model training and deployment. Existing embedding compression solutions cannot simultaneously meet three key design requirements: memory efficiency, low latency, and adaptability to dynamic data distribution. This paper presents CAFE, a Compact, Adaptive, and Fast Embedding compression framework that addresses the above requirements. The design philosophy of CAFE is to dynamically allocate more memory resources to important features (called hot features), and allocate less memory to unimportant ones. In CAFE, we propose a fast and lightweight sketch data structure, named HotSketch, to capture feature importance and report hot features in real time. For each reported hot feature, we assign it a unique embedding. For the non-hot features, we allow multiple features to share one embedding by using hash embedding technique. Guided by our design philosophy, we further propose a multi-level hash embedding framework to optimize the embedding tables of non-hot features. We theoretically analyze the accuracy of HotSketch, and analyze the model convergence against deviation. Extensive experiments show that CAFE significantly outperforms existing embedding compression methods, yielding 3.92% and 3.68% superior testing AUC on Criteo Kaggle dataset and CriteoTB dataset at a compression ratio of 10000x. The source codes of CAFE are available at GitHub.<\/jats:p>","DOI":"10.1145\/3639306","type":"journal-article","created":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T18:51:32Z","timestamp":1711479092000},"page":"1-28","source":"Crossref","is-referenced-by-count":11,"title":["CAFE: Towards Compact, Adaptive, and Fast Embedding for Large-scale Recommendation Models"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-4188-7742","authenticated-orcid":false,"given":"Hailin","family":"Zhang","sequence":"first","affiliation":[{"name":"Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9062-6565","authenticated-orcid":false,"given":"Zirui","family":"Liu","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3719-2685","authenticated-orcid":false,"given":"Boxuan","family":"Chen","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2495-7774","authenticated-orcid":false,"given":"Yikai","family":"Zhao","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7201-2152","authenticated-orcid":false,"given":"Tong","family":"Zhao","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2402-5854","authenticated-orcid":false,"given":"Tong","family":"Yang","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1681-4677","authenticated-orcid":false,"given":"Bin","family":"Cui","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2024,3,26]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Aden and Yi Wang. 2012. KDD Cup 2012 Track 2. https:\/\/kaggle.com\/competitions\/kddcup2012-track2."},{"key":"e_1_2_2_2_1","volume-title":"Proceedings of the 34th International Conference on Machine Learning (ICML).","author":"Allen-Zhu Zeyuan","year":"2017","unstructured":"Zeyuan Allen-Zhu. 2017. Natasha: Faster Non-Convex Stochastic Optimization via Strongly Non-Convex Parameter. In Proceedings of the 34th International Conference on Machine Learning (ICML)."},{"key":"e_1_2_2_3_1","volume-title":"29th International Colloquium (ICALP).","author":"Charikar Moses","year":"2002","unstructured":"Moses Charikar, Kevin C. Chen, and Martin Farach-Colton. 2002. Finding Frequent Items in Data Streams. In Automata, Languages and Programming, 29th International Colloquium (ICALP)."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3587136.3587150"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2988450.2988454"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476287"},{"key":"e_1_2_2_7_1","volume-title":"Notes from the AI frontier: Insights from hundreds of use cases","author":"Chui Michael","year":"2018","unstructured":"Michael Chui, James Manyika, Mehdi Miremadi, Nicolaus Henke, Rita Chung, Pieter Nel, and Sankalp Malhotra. 2018. Notes from the AI frontier: Insights from hundreds of use cases. McKinsey Global Institute, Vol. 2 (2018). https:\/\/www.mckinsey.com\/west-coast\/ \/media\/McKinsey\/Featured%20Insights\/Artificial%20Intelligence\/Notes%20from%20the%20AI%20frontier%20Applications%20and%20value%20of%20deep%20learning\/Notes-from-the-AI-frontier-Insights-from-hundreds-of-use-cases-Discussion-paper.pdf"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_2_2_9_1","volume-title":"New estimation algorithms for streaming data: Count-min can do more. Webdocs. Cs. Ualberta. Ca","author":"Deng Fan","year":"2007","unstructured":"Fan Deng and Davood Rafiei. 2007. New estimation algorithms for streaming data: Count-min can do more. Webdocs. Cs. Ualberta. Ca (2007)."},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441727"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341431.1341433"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-021-1048-y"},{"key":"e_1_2_2_13_1","doi-asserted-by":"crossref","first-page":"1454","DOI":"10.14778\/3236187.3236198","article-title":"Distributed Representations of Tuples for Entity Resolution","volume":"11","author":"Ebraheem Muhammad","year":"2018","unstructured":"Muhammad Ebraheem, Saravanan Thirumuruganathan, Shafiq R. Joty, Mourad Ouzzani, and Nan Tang. 2018. Distributed Representations of Tuples for Entity Resolution. Proceedings of the VLDB Endowment, Vol. 11, 11 (2018), 1454--1467.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633056"},{"key":"e_1_2_2_15_1","volume-title":"22nd IEEE International Symposium on Parallel and Distributed Processing (IPDPS).","author":"Fan Yao-Chung","unstructured":"Yao-Chung Fan and Arbee L. P. Chen. 2008. Efficient and robust sensor data aggregation using linear counting sketches. In 22nd IEEE International Symposium on Parallel and Distributed Processing (IPDPS)."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3524938.3525247"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517710"},{"key":"e_1_2_2_18_1","volume-title":"Proceedings of the 33nd International Conference on Machine Learning (ICML).","author":"Gopal Siddharth","year":"2016","unstructured":"Siddharth Gopal. 2016. Adaptive Sampling for SGD by Exploiting Side Information. In Proceedings of the 33nd International Conference on Machine Learning (ICML)."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/239"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA45697.2020.00084"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00047"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-022-1152-7"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380754"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452840"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3326937.3341255"},{"key":"e_1_2_2_26_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning (ICML).","author":"Katharopoulos Angelos","year":"2018","unstructured":"Angelos Katharopoulos and Francc ois Fleuret. 2018. Not All Samples Are Created Equal: Deep Learning with Importance Sampling. In Proceedings of the 35th International Conference on Machine Learning (ICML)."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401970"},{"key":"e_1_2_2_28_1","volume-title":"Adam: A Method for Stochastic Optimization. In 3rd International Conference on Learning Representations (ICLR).","author":"Diederik","unstructured":"Diederik P. Kingma and Jimmy Ba. 2015. Adam: A Method for Stochastic Optimization. In 3rd International Conference on Learning Representations (ICLR)."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3494124.3494144"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3186387"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551859"},{"key":"e_1_2_2_32_1","unstructured":"Criteo Labs. 2013. Download Terabyte Click Logs. https:\/\/labs.criteo.com\/2013\/12\/download-terabyte-click-logs\/."},{"key":"e_1_2_2_33_1","unstructured":"Criteo Labs. 2014. Kaggle display advertising challenge dataset. https:\/\/labs.criteo.com\/2014\/02\/kaggle-display-advertising-challenge-dataset\/."},{"key":"e_1_2_2_34_1","volume-title":"AdaEmbed: Adaptive Embedding for Large-Scale Recommendation Models. In 17th USENIX Symposium on Operating Systems Design and Implementation (OSDI).","author":"Lai Fan","year":"2023","unstructured":"Fan Lai, Wei Zhang, Rui Liu, William Tsai, Xiaohan Wei, Yuxi Hu, Sabin Devkota, Jianyu Huang, Jongsoo Park, Xing Liu, Zeliang Chen, Ellie Wen, Paul Rivera, Jie You, Chun-cheng Jason Chen, and Mosharaf Chowdhury. 2023. AdaEmbed: Adaptive Embedding for Large-Scale Recommendation Models. In 17th USENIX Symposium on Operating Systems Design and Implementation (OSDI)."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403208"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25564"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2192447"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539070"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476254"},{"key":"e_1_2_2_40_1","volume-title":"HyperCalm Sketch: One-Pass Mining Periodic Batches in Data Streams. In 39th IEEE International Conference on Data Engineering (ICDE).","author":"Liu Zirui","year":"2023","unstructured":"Zirui Liu, Chaozhe Kong, Kaicheng Yang, Tong Yang, Ruijie Miao, Qizhi Chen, Yikai Zhao, Yaofeng Tu, and Bin Cui. 2023 a. HyperCalm Sketch: One-Pass Mining Periodic Batches in Data Streams. In 39th IEEE International Conference on Data Engineering (ICDE)."},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588910"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557411"},{"key":"e_1_2_2_43_1","volume-title":"Topkapi: Parallel and Fast Sketches for Finding Top-K Frequent Elements. In Advances in Neural Information Processing Systems 31 (NeurIPS).","author":"Mandal Ankush","year":"2018","unstructured":"Ankush Mandal, He Jiang, Anshumali Shrivastava, and Vivek Sarkar. 2018. Topkapi: Parallel and Fast Sketches for Finding Top-K Frequent Elements. In Advances in Neural Information Processing Systems 31 (NeurIPS)."},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-023-00228-5"},{"key":"e_1_2_2_45_1","volume-title":"Efficient Computation of Frequent and Top-k Elements in Data Streams. In International Conference on Database Theory.","author":"Metwally Ahmed","year":"2005","unstructured":"Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. 2005. Efficient Computation of Frequent and Top-k Elements in Data Streams. In International Conference on Database Theory."},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-022-3581-9"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517902"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489511"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3470496.3533727"},{"key":"e_1_2_2_50_1","volume-title":"Deep Learning Training in Facebook Data Centers: Design of Scale-up and Scale-out Systems. CoRR","author":"Naumov Maxim","year":"2020","unstructured":"Maxim Naumov, John Kim, Dheevatsa Mudigere, Srinivas Sridharan, Xiaodong Wang, Whitney Zhao, Serhat Yilmaz, Changkyu Kim, Hector Yuen, Mustafa Ozdal, Krishnakumar Nair, Isabel Gao, Bor-Yiing Su, Jiyan Yang, and Mikhail Smelyanskiy. 2020. Deep Learning Training in Facebook Data Centers: Design of Scale-up and Scale-out Systems. CoRR, Vol. abs\/2003.09518 (2020)."},{"key":"e_1_2_2_51_1","unstructured":"Maxim Naumov Dheevatsa Mudigere Hao-Jun Michael Shi Jianyu Huang Narayanan Sundaraman Jongsoo Park Xiaodong Wang Udit Gupta Carole-Jean Wu Alisson G. Azzolini Dmytro Dzhulgakov Andrey Mallevich Ilia Cherniavskii Yinghai Lu Raghuraman Krishnamoorthi Ansha Yu Volodymyr Kondratenko Stephanie Pereira Xianjie Chen Wenlin Chen Vijay Rao Bill Jia Liang Xiong and Misha Smelyanskiy. 2019. Deep Learning Recommendation Model for Personalization and Recommendation Systems. CoRR Vol. abs\/1906.00091 (2019)."},{"key":"e_1_2_2_52_1","volume-title":"Proceedings of Machine Learning and Systems (MLSys).","author":"Pansare Niketan","year":"2022","unstructured":"Niketan Pansare, Jay Katukuri, Aditya Arora, Frank Cipollone, Riyaaz Shaik, Noyan Tokgozoglu, and Chandru Venkataraman. 2022. Learning Compressed Embeddings for On-Device Inference. In Proceedings of Machine Learning and Systems (MLSys)."},{"key":"e_1_2_2_53_1","volume-title":"International Symposium on Web AlGorithms.","author":"Pitel Guillaume","year":"2015","unstructured":"Guillaume Pitel and Geoffroy Fouquier. 2015. Count-Min-Log sketch: Approximately counting with approximate counters. In International Symposium on Web AlGorithms."},{"key":"e_1_2_2_54_1","unstructured":"NVIDIA AI platform. 2020. MLPerf Benchmark. https:\/\/mlperf.org."},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882948"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-020-3404-y"},{"key":"e_1_2_2_57_1","volume-title":"Proceedings of the International Conference on Management of Data (SIGMOD).","author":"Shi Benwei","unstructured":"Benwei Shi, Zhuoyue Zhao, Yanqing Peng, Feifei Li, and Jeff M. Phillips. 2021. At-the-time and Back-in-time Persistent Sketches. In Proceedings of the International Conference on Management of Data (SIGMOD)."},{"key":"e_1_2_2_58_1","volume-title":"Proceedings of the 26th ACM SIGKDD Conference on Knowledge Discovery & Data Mining (KDD).","author":"Michael Shi Hao-Jun","year":"2020","unstructured":"Hao-Jun Michael Shi, Dheevatsa Mudigere, Maxim Naumov, and Jiyan Yang. 2020. Compositional Embeddings Using Complementary Partitions for Memory-Efficient Recommendation Systems. In Proceedings of the 26th ACM SIGKDD Conference on Knowledge Discovery & Data Mining (KDD)."},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183759"},{"key":"e_1_2_2_60_1","volume-title":"Use cases of recommendation systems in business--current applications and methods. Emerj","author":"Underwood Corinna","year":"2019","unstructured":"Corinna Underwood. 2019. Use cases of recommendation systems in business--current applications and methods. Emerj (2019). https:\/\/emerj.com\/ai-sector-overviews\/use-cases-recommendation-systems\/"},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3124749.3124754"},{"key":"e_1_2_2_62_1","unstructured":"Steve Wang and Will Cukierski. 2014. Avazu Click-Through Rate Prediction. https:\/\/kaggle.com\/competitions\/avazu-ctr-prediction."},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3523227.3547405"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553516"},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00025"},{"key":"e_1_2_2_66_1","volume-title":"Personalized recommendation systems: Five hot research topics you must know. Microsoft Research Lab-Asia","author":"Xie Xing","year":"2018","unstructured":"Xing Xie, Jianxun Lian, Zheng Liu, Xiting Wang, Fangzhao Wu, Hongwei Wang, and Zhongxia Chen. 2018. Personalized recommendation systems: Five hot research topics you must know. Microsoft Research Lab-Asia (2018). https:\/\/www.microsoft.com\/en-us\/research\/lab\/microsoft-research-asia\/articles\/personalized-recommendation-systems\/"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457236"},{"key":"e_1_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482065"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.14778\/3421424.3421430"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219978"},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"e_1_2_2_72_1","volume-title":"Proceedings of Machine Learning and Systems (MLSys).","author":"Yin Chunxing","year":"2021","unstructured":"Chunxing Yin, Bilge Acun, Carole-Jean Wu, and Xing Liu. 2021. TT-Rec: Tensor Train Compression for Deep Learning Recommendation Models. In Proceedings of Machine Learning and Systems (MLSys)."},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-023-00217-8"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412227"},{"key":"e_1_2_2_75_1","unstructured":"Hailin Zhang Zirui Liu and Boxuan Chen. 2023 a. Source codes related to CAFE. https:\/\/github.com\/HugoZHL\/CAFE."},{"key":"e_1_2_2_76_1","volume-title":"2023 b. Experimental Analysis of Large-scale Learnable Vector Storage Compression. CoRR","author":"Zhang Hailin","year":"2023","unstructured":"Hailin Zhang, Penghao Zhao, Xupeng Miao, Yingxia Shao, Zirui Liu, Tong Yang, and Bin Cui. 2023 b. Experimental Analysis of Large-scale Learnable Vector Storage Compression. CoRR, Vol. abs\/2311.15578 (2023)."},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767711"},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472892"},{"key":"e_1_2_2_79_1","volume-title":"Proceedings of Machine Learning and Systems (MLSys).","author":"Zhao Weijie","year":"2020","unstructured":"Weijie Zhao, Deping Xie, Ronglai Jia, Yulei Qian, Ruiquan Ding, Mingming Sun, and Ping Li. 2020. Distributed Hierarchical GPU Parameter Server for Massive Scale Deep Learning Ads Systems. In Proceedings of Machine Learning and Systems (MLSys)."},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358045"},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450124"},{"key":"e_1_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.14778\/3529337.3529349"},{"key":"e_1_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219823"},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482486"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639306","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3639306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T15:13:05Z","timestamp":1755789185000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,12]]},"references-count":84,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3,12]]}},"alternative-id":["10.1145\/3639306"],"URL":"https:\/\/doi.org\/10.1145\/3639306","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,12]]}}}