{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T03:40:13Z","timestamp":1771299613837,"version":"3.50.1"},"reference-count":88,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T00:00:00Z","timestamp":1737158400000},"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":["2023YFA1008704"],"award-info":[{"award-number":["2023YFA1008704"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62376275"],"award-info":[{"award-number":["62376275"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>Nowadays, optimized cost-per-click (OCPC) has been widely adopted in online advertising. In OCPC, the advertiser sets an expected cost-per-conversion and pays per click, while the platform automatically adjusts the bid on each click to meet advertiser\u2019s constraint. Existing bidding methods are based on feedback control, adjusting bids to keep the current cost-per-conversion close to the expected cost-per-conversion to avoid compensation. However, they overlook the conversion lag phenomenon: There always exists a time interval between the ad\u2019s click time and conversion time. This interval makes existing methods overestimate the cost-per-conversion and results in over conservative bidding policies which finally hurts the revenue. To address the issue, this article proposes a novel bidding method, Bidding with Delayed Conversions (Bid-DC) which predicts the conversion probability of the clicked ads and used it to adjust the cost-per-conversion values. To ensure the bidding model can satisfy the advertiser\u2019s constraint, constrained Markov decision process (CMDP) is adapted to automatically learn the optimal parameters from the log data. Both online and offline experiments demonstrate that Bid-DC outperforms the state-of-the-art baselines in terms of improving revenue. Empirical analysis also showed Bid-DC can accurately estimate the cost-per-conversion and make more stable bids.<\/jats:p>","DOI":"10.1145\/3706420","type":"journal-article","created":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T13:16:09Z","timestamp":1732886169000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Adapting Constrained Markov Decision Process for OCPC Bidding with Delayed Conversions"],"prefix":"10.1145","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7420-4367","authenticated-orcid":false,"given":"Leping","family":"Zhang","sequence":"first","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7397-5632","authenticated-orcid":false,"given":"Xiao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7053-8269","authenticated-orcid":false,"given":"Yichao","family":"Wang","sequence":"additional","affiliation":[{"name":"Huawei Noah\u2019s Ark Lab, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7258-1835","authenticated-orcid":false,"given":"Xuan","family":"Li","sequence":"additional","affiliation":[{"name":"Huawei AppGallery Development Department, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2231-4663","authenticated-orcid":false,"given":"Zhenhua","family":"Dong","sequence":"additional","affiliation":[{"name":"Huawei Noah\u2019s Ark Lab, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7170-111X","authenticated-orcid":false,"given":"Jun","family":"Xu","sequence":"additional","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,1,18]]},"reference":[{"key":"e_1_3_3_2_2","first-page":"22","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Achiam Joshua","year":"2017","unstructured":"Joshua Achiam, David Held, Aviv Tamar, and Pieter Abbeel. 2017. Constrained policy optimization. In Proceedings of the International Conference on Machine Learning. PMLR, 22\u201331."},{"key":"e_1_3_3_3_2","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Andrychowicz Marcin","year":"2020","unstructured":"Marcin Andrychowicz, Anton Raichuk, Piotr Sta\u0144czyk, Manu Orsini, Sertan Girgin, Rapha\u00ebl Marinier, Leonard Hussenot, Matthieu Geist, Olivier Pietquin, Marcin Michalski, et al. 2020. What matters for on-policy deep actor-critic methods? A large-scale study. In Proceedings of the International Conference on Learning Representations."},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3374210"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1287\/isre.1110.0391"},{"key":"e_1_3_3_6_2","first-page":"158","volume-title":"Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases (ECML PKDD \u201920)","author":"Bender Andreas","year":"2020","unstructured":"Andreas Bender, David R\u00fcgamer, Fabian Scheipl, and Bernd Bischl. 2020. A general machine learning framework for survival analysis. In Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases (ECML PKDD \u201920). Springer, 158\u2013173."},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/37.248006"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2805844"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018702"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098150"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623634"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357819"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020604"},{"key":"e_1_3_3_14_2","first-page":"167","article-title":"Risk-constrained reinforcement learning with percentile risk criteria","volume":"18","author":"Chow Yinlam","year":"2018","unstructured":"Yinlam Chow, Mohammad Ghavamzadeh, Lucas Janson, and Marco Pavone. 2018. Risk-constrained reinforcement learning with percentile risk criteria. Journal of Machine Learning Research 18, 167 (2018), 1\u201351.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_15_2","first-page":"8103","article-title":"A lyapunov-based approach to safe reinforcement learning","volume":"31","author":"Chow Yinlam","year":"2018","unstructured":"Yinlam Chow, Ofir Nachum, Edgar Duenez-Guzman, and Mohammad Ghavamzadeh. 2018. A lyapunov-based approach to safe reinforcement learning. Advances in Neural Information Processing Systems 31 (2018), 8103\u20138112.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00055565"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/2988128"},{"key":"e_1_3_3_18_2","first-page":"1096","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Dabney Will","year":"2018","unstructured":"Will Dabney, Georg Ostrovski, David Silver, and R\u00e9mi Munos. 2018. Implicit quantile networks for distributional reinforcement learning. In Proceedings of the International Conference on Machine Learning. PMLR, 1096\u20131105."},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3614856"},{"key":"e_1_3_3_20_2","unstructured":"Bernard W Dezotell. 1936. Water level controller. US Patent 2 043 530."},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3124749.3124752"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.3390\/jmse11010194"},{"key":"e_1_3_3_23_2","first-page":"142","article-title":"Optimal real-time bidding strategies","volume":"1","author":"Fernandez-Tapia Joaquin","year":"2017","unstructured":"Joaquin Fernandez-Tapia, Olivier Gu\u00e9ant, and Jean-Michel Lasry. 2017. Optimal real-time bidding strategies. Applied Mathematics Research Express 2017, 1 (2017), 142\u2013183.","journal-title":"Applied Mathematics Research Express"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.5555\/2789272.2886795"},{"key":"e_1_3_3_25_2","unstructured":"Tuomas Haarnoja Aurick Zhou Kristian Hartikainen George Tucker Sehoon Ha Jie Tan Vikash Kumar Henry Zhu Abhishek Gupta Pieter Abbeel et al. 2018. Soft actor-critic algorithms and applications. arXiv:1812.05905. Retrieved from https:\/\/arxiv.org\/abs\/1812.05905"},{"key":"e_1_3_3_26_2","unstructured":"Joshua Hare. 2019. Dealing with sparse rewards in reinforcement learning. arXiv:1910.09281. Retrieved from https:\/\/arxiv.org\/abs\/1910.09281"},{"key":"e_1_3_3_27_2","unstructured":"Mohammadhosein Hasanbeig Alessandro Abate and Daniel Kroening. 2018. Logically-constrained reinforcement learning. arXiv:1801.08099. Retrieved from https:\/\/arxiv.org\/abs\/1801.08099"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467199"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2007.366913"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.5194\/gmd-15-5481-2022"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2010.470"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.3390\/a13120342"},{"key":"e_1_3_3_33_2","unstructured":"Aditya Jain and Sahil Khan. 2021. Optimizing cost per click for digital advertising campaigns. arXiv:2108.00747. Retrieved from https:\/\/arxiv.org\/abs\/2108.00747"},{"key":"e_1_3_3_34_2","first-page":"24432","article-title":"Model-based safe deep reinforcement learning via a constrained proximal policy optimization algorithm","volume":"35","author":"Jayant Ashish K","year":"2022","unstructured":"Ashish K Jayant and Shalabh Bhatnagar. 2022. Model-based safe deep reinforcement learning via a constrained proximal policy optimization algorithm. Advances in Neural Information Processing Systems 35 (2022), 24432\u201324445.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_35_2","first-page":"652","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Jiang Nan","year":"2016","unstructured":"Nan Jiang and Lihong Li. 2016. Doubly robust off-policy value evaluation for reinforcement learning. In Proceedings of the International Conference on Machine Learning. PMLR, 652\u2013661."},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_8"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.5555\/1622737.1622748"},{"key":"e_1_3_3_38_2","first-page":"1531","article-title":"A natural policy gradient","volume":"14","author":"Kakade Sham M.","year":"2001","unstructured":"Sham M. Kakade. 2001. A natural policy gradient. Advances in Neural Information Processing Systems 14 (2001), 1531\u20131538.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.51519\/journalisi.v5i3.518"},{"key":"e_1_3_3_40_2","first-page":"1008","article-title":"Actor-critic algorithms","volume":"12","author":"Konda Vijay","year":"1999","unstructured":"Vijay Konda and John Tsitsiklis. 1999. Actor-critic algorithms. Advances in Neural Information Processing Systems 12 (1999), 1008\u20131014.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_41_2","unstructured":"Ilya Kostrikov Ashvin Nair and Sergey Levine. 2021. Offline reinforcement learning with implicit Q-learning. arXiv:2110.06169. Retrieved from https:\/\/arxiv.org\/abs\/2110.06169"},{"key":"e_1_3_3_42_2","first-page":"1179","article-title":"Conservative Q-learning for offline reinforcement learning","volume":"33","author":"Kumar Aviral","year":"2020","unstructured":"Aviral Kumar, Aurick Zhou, George Tucker, and Sergey Levine. 2020. Conservative Q-learning for offline reinforcement learning. Advances in Neural Information Processing Systems 33 (2020), 1179\u20131191.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645534"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN52387.2021.9534126"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/2648584.2648590"},{"key":"e_1_3_3_46_2","unstructured":"Timothy P. Lillicrap Jonathan J. Hunt Alexander Pritzel Nicolas Heess Tom Erez Yuval Tassa David Silver and Daan Wierstra. 2015. Continuous control with deep reinforcement learning. arXiv:1509.02971. Retrieved from https:\/\/arxiv.org\/abs\/1509.02971"},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358027"},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.hlc.2023.06.724"},{"key":"e_1_3_3_49_2","unstructured":"Zhiyu Mou Yusen Huo Rongquan Bai Mingzhou Xie Chuan Yu Jian Xu and Bo Zheng. 2022. Sustainable online reinforcement learning for auto-bidding. arXiv:2210.07006. Retrieved from https:\/\/arxiv.org\/abs\/2210.07006"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1287\/msom.2014.0491"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3628603"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599799"},{"key":"e_1_3_3_53_2","first-page":"307","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Pirotta Matteo","year":"2013","unstructured":"Matteo Pirotta, Marcello Restelli, Alessio Pecorino, and Daniele Calandriello. 2013. Safe policy iteration. In Proceedings of the International Conference on Machine Learning. PMLR, 307\u2013315."},{"key":"e_1_3_3_54_2","unstructured":"Matthias Plappert Rein Houthooft Prafulla Dhariwal Szymon Sidor Richard Y Chen Xi Chen Tamim Asfour Pieter Abbeel and Marcin Andrychowicz. 2017. Parameter space noise for exploration. arXiv:1706.01905. Retrieved from https:\/\/arxiv.org\/abs\/1706.01905"},{"key":"e_1_3_3_55_2","unstructured":"David Pollard. 2000. Asymptopia: An Exposition of Statistical Asymptotic Theory. Retrieved from http:\/\/www.stat.yale.edu\/pollard\/Books\/Asymptopia"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3579354"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/3233770"},{"key":"e_1_3_3_58_2","first-page":"1889","article-title":"Trust region policy optimization","author":"Schulman John","year":"2015","unstructured":"John Schulman, Sergey Levine, Pieter Abbeel, Michael Jordan, and Philipp Moritz. 2015. Trust region policy optimization. In International Conference on Machine Learning. PMLR, 1889\u20131897.","journal-title":"International Conference on Machine Learning"},{"key":"e_1_3_3_59_2","unstructured":"John Schulman Philipp Moritz Sergey Levine Michael Jordan and Pieter Abbeel. 2015. High-dimensional continuous control using generalized advantage estimation. arXiv:1506.02438. Retrieved from https:\/\/arxiv.org\/abs\/1506.02438"},{"key":"e_1_3_3_60_2","doi-asserted-by":"publisher","DOI":"10.5555\/3398761.3398918"},{"key":"e_1_3_3_61_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1474-6670(17)33342-6"},{"key":"e_1_3_3_62_2","doi-asserted-by":"publisher","DOI":"10.1109\/DEVLRN.2007.4354030"},{"key":"e_1_3_3_63_2","doi-asserted-by":"publisher","DOI":"10.1109\/INMIC50486.2020.9318195"},{"key":"e_1_3_3_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39415-8"},{"key":"e_1_3_3_65_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.petrol.2018.03.048"},{"key":"e_1_3_3_66_2","first-page":"35","article-title":"Advertising strategy management in Internet marketing","volume":"13","author":"Voronenko Iryna","year":"2021","unstructured":"Iryna Voronenko, Maryna Nehrey, Serhiy Kostenko, Iryna Lashchyk, and Viktoriia Niziaieva. 2021. Advertising strategy management in Internet marketing. Journal of Information Technology Management 13, Special Issue: Advanced Innovation Topics in Business and Management (2021), 35\u201347.","journal-title":"Journal of Information Technology Management"},{"key":"e_1_3_3_67_2","first-page":"9797","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Wachi Akifumi","year":"2020","unstructured":"Akifumi Wachi and Yanan Sui. 2020. Safe reinforcement learning in constrained Markov decision processes. In Proceedings of the International Conference on Machine Learning. PMLR, 9797\u20139806."},{"key":"e_1_3_3_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/3214306"},{"key":"e_1_3_3_69_2","unstructured":"Yu Wang Jiayi Liu Yuxiang Liu Jun Hao Yang He Jinghe Hu Weipeng P. Yan and Mantian Li. 2017. Ladder: A human-level bidding agent for large-scale real-time online auctions. arXiv:1708.05565. Retrieved from https:\/\/arxiv.org\/abs\/1708.05565"},{"key":"e_1_3_3_70_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591844"},{"key":"e_1_3_3_71_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271748"},{"key":"e_1_3_3_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3615208"},{"key":"e_1_3_3_73_2","first-page":"15737","article-title":"Error bounds of imitating policies and environments","volume":"33","author":"Xu Tian","year":"2020","unstructured":"Tian Xu, Ziniu Li, and Yang Yu. 2020. Error bounds of imitating policies and environments. Advances in Neural Information Processing Systems 33 (2020), 15737\u201315749.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_74_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17272"},{"key":"e_1_3_3_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330681"},{"key":"e_1_3_3_76_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330782"},{"key":"e_1_3_3_77_2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380032"},{"key":"e_1_3_3_78_2","first-page":"25636","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Yu Dongjie","year":"2022","unstructured":"Dongjie Yu, Haitong Ma, Shengbo Li, and Jianyu Chen. 2022. Reachability constrained reinforcement learning. In Proceedings of the International Conference on Machine Learning. PMLR, 25636\u201325655."},{"key":"e_1_3_3_79_2","doi-asserted-by":"publisher","DOI":"10.1145\/2501040.2501980"},{"key":"e_1_3_3_80_2","doi-asserted-by":"publisher","DOI":"10.1109\/SOLI.2014.6960761"},{"issue":"3","key":"e_1_3_3_81_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3003725","article-title":"Targeted advertising in public transportation systems with quantitative evaluation","volume":"35","author":"Zhang Dongxiang","year":"2017","unstructured":"Dongxiang Zhang, Long Guo, Liqiang Nie, Jie Shao, Sai Wu, and Heng Tao Shen. 2017. Targeted advertising in public transportation systems with quantitative evaluation. ACM Transactions on Information Systems 35, 3 (2017), 1\u201329.","journal-title":"ACM Transactions on Information Systems"},{"key":"e_1_3_3_82_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.iot.2023.100921"},{"key":"e_1_3_3_83_2","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835843"},{"key":"e_1_3_3_84_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623633"},{"key":"e_1_3_3_85_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462892"},{"key":"e_1_3_3_86_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219918"},{"key":"e_1_3_3_87_2","doi-asserted-by":"publisher","DOI":"10.1145\/3320496.3320500"},{"key":"e_1_3_3_88_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.01964"},{"key":"e_1_3_3_89_2","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098134"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3706420","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3706420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:04Z","timestamp":1750295884000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3706420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,18]]},"references-count":88,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3,31]]}},"alternative-id":["10.1145\/3706420"],"URL":"https:\/\/doi.org\/10.1145\/3706420","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,18]]},"assertion":[{"value":"2024-04-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-19","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}