{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T17:02:16Z","timestamp":1787936536239,"version":"build-2784847793"},"reference-count":60,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:00:00Z","timestamp":1699833600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NIST CSAFE","award":["70NANB15H176, 70NANB20H019"],"award-info":[{"award-number":["70NANB15H176, 70NANB20H019"]}]},{"name":"NSF","award":["CNS-1527579, CNS-1619201, CNS-1730275, DEB-1924178, ECCS-2030249, NSF 2130889, 2232461, 2229654, NIFA 2021-67021-33775"],"award-info":[{"award-number":["CNS-1527579, CNS-1619201, CNS-1730275, DEB-1924178, ECCS-2030249, NSF 2130889, 2232461, 2229654, NIFA 2021-67021-33775"]}]},{"name":"NPRP","award":["#12C-33905-SP-165"],"award-info":[{"award-number":["#12C-33905-SP-165"]}]},{"DOI":"10.13039\/100008982","name":"Qatar National Research Fund","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100008982","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Priv. Secur."],"published-print":{"date-parts":[[2023,11,30]]},"abstract":"<jats:p>\n            <jats:italic>Information leakage<\/jats:italic>\n            is usually defined as the logarithmic increment in the adversary\u2019s probability of correctly guessing the legitimate user\u2019s private data or some arbitrary function of the private data when presented with the legitimate user\u2019s publicly disclosed information. However, this definition of information leakage implicitly assumes that both the privacy mechanism and the prior probability of the original data are entirely known to the attacker. In reality, the assumption of complete knowledge of the privacy mechanism for an attacker is often impractical. The attacker can usually have access to only an approximate version of the correct privacy mechanism, computed from a limited set of the disclosed data, for which they can access the corresponding un-distorted data. In this scenario, the conventional definition of leakage no longer has an operational meaning. To address this problem, in this article, we propose novel meaningful information-theoretic metrics for information leakage when the attacker has\n            <jats:italic>incomplete information<\/jats:italic>\n            about the privacy mechanism\u2014we call them\n            <jats:italic>average subjective leakage<\/jats:italic>\n            ,\n            <jats:italic>average confidence boost<\/jats:italic>\n            , and\n            <jats:italic>average objective leakage<\/jats:italic>\n            , respectively. For the simplest, binary scenario, we demonstrate how to find an optimized privacy mechanism that minimizes the worst-case value of either of these leakages.\n          <\/jats:p>","DOI":"10.1145\/3624982","type":"journal-article","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T11:36:24Z","timestamp":1695123384000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Measures of Information Leakage for Incomplete Statistical Information: Application to a Binary Privacy Mechanism"],"prefix":"10.1145","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5043-3061","authenticated-orcid":false,"given":"Shahnewaz Karim","family":"Sakib","sequence":"first","affiliation":[{"name":"Iowa State University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4471-6425","authenticated-orcid":false,"given":"George T","family":"Amariucai","sequence":"additional","affiliation":[{"name":"Kansas State University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0445-1848","authenticated-orcid":false,"given":"Yong","family":"Guan","sequence":"additional","affiliation":[{"name":"Iowa State University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,13]]},"reference":[{"key":"e_1_3_1_2_2","first-page":"6878","volume-title":"Conference on Advances in Neural Information Processing Systems","author":"Acharya Jayadev","year":"2018","unstructured":"Jayadev Acharya, Ziteng Sun, and Huanyu Zhang. 2018. Differentially private testing of identity and closeness of discrete distributions. In Conference on Advances in Neural Information Processing Systems. 6878\u20136891."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.3390\/fi10120114"},{"key":"e_1_3_1_4_2","first-page":"39","volume-title":"International Workshop on Formal Aspects in Security and Trust","author":"Alvim M\u00e1rio S.","year":"2011","unstructured":"M\u00e1rio S. Alvim, Miguel E. Andr\u00e9s, Konstantinos Chatzikokolakis, Pierpaolo Degano, and Catuscia Palamidessi. 2011. Differential privacy: On the trade-off between utility and information leakage. In International Workshop on Formal Aspects in Security and Trust. Springer, 39\u201354."},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.3390\/e20050382"},{"key":"e_1_3_1_6_2","first-page":"77","volume-title":"EEE 29th Computer Security Foundations Symposium (CSF\u201916)","author":"Alvim M\u00e1rio S.","year":"2016","unstructured":"M\u00e1rio S. Alvim, Konstantinos Chatzikokolakis, Annabelle McIver, Carroll Morgan, Catuscia Palamidessi, and Geoffrey Smith. 2016. Axioms for information leakage. In EEE 29th Computer Security Foundations Symposium (CSF\u201916). IEEE, 77\u201392."},{"key":"e_1_3_1_7_2","first-page":"191","volume-title":"IEEE 24th Computer Security Foundations Symposium","author":"Barthe Gilles","year":"2011","unstructured":"Gilles Barthe and Boris Kopf. 2011. Information-theoretic bounds for differentially private mechanisms. In IEEE 24th Computer Security Foundations Symposium. IEEE, 191\u2013204."},{"key":"e_1_3_1_8_2","article-title":"Revisiting leakage abuse attacks","author":"Blackstone Laura","year":"2019","unstructured":"Laura Blackstone, Seny Kamara, and Tarik Moataz. 2019. Revisiting leakage abuse attacks. Cryptology ePrint Archive (2019).","journal-title":"Cryptology ePrint Archive"},{"key":"e_1_3_1_9_2","doi-asserted-by":"crossref","unstructured":"Christelle Braun Konstantinos Chatzikokolakis and Catuscia Palamidessi. 2009. Quantitative notions of leakage for one-try attacks. Electronic Notes in Theoretical Computer Science 249 (2009) 75\u201391.","DOI":"10.1016\/j.entcs.2009.07.085"},{"key":"e_1_3_1_10_2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/FOCS.2010.13","volume-title":"IEEE 51st Annual Symposium on Foundations of Computer Science","author":"Brenner Hai","year":"2010","unstructured":"Hai Brenner and Kobbi Nissim. 2010. Impossibility of differentially private universally optimal mechanisms. In IEEE 51st Annual Symposium on Foundations of Computer Science. IEEE, 71\u201380."},{"key":"e_1_3_1_11_2","article-title":"Dynamic searchable encryption in very-large databases: Data structures and implementation","author":"Cash David","year":"2014","unstructured":"David Cash, Joseph Jaeger, Stanislaw Jarecki, Charanjit Jutla, Hugo Krawczyk, Marcel-C\u0103t\u0103lin Ro\u015fu, and Michael Steiner. 2014. Dynamic searchable encryption in very-large databases: Data structures and implementation. Cryptology ePrint Archive (2014).","journal-title":"Cryptology ePrint Archive"},{"key":"e_1_3_1_12_2","first-page":"390","volume-title":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","author":"Chatzikokolakis Konstantinos","year":"2010","unstructured":"Konstantinos Chatzikokolakis, Tom Chothia, and Apratim Guha. 2010. Statistical measurement of information leakage. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer, 390\u2013404."},{"key":"e_1_3_1_13_2","first-page":"835","volume-title":"IEEE Symposium on Security and Privacy (SP\u201919)","author":"Cherubin Giovanni","year":"2019","unstructured":"Giovanni Cherubin, Konstantinos Chatzikokolakis, and Catuscia Palamidessi. 2019. F-BLEAU: Fast black-box leakage estimation. In IEEE Symposium on Security and Privacy (SP\u201919). IEEE, 835\u2013852."},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.5555\/1662658.1662660"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978308"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"e_1_3_1_17_2","article-title":"SoK: Differential privacies","author":"Desfontaines Damien","year":"2019","unstructured":"Damien Desfontaines and Bal\u00e1zs Pej\u00f3. 2019. SoK: Differential privacies. arXiv preprint arXiv:1906.01337 (2019).","journal-title":"arXiv preprint arXiv:1906.01337"},{"key":"e_1_3_1_18_2","article-title":"Local privacy, data processing inequalities, and statistical minimax rates","author":"Duchi John C.","year":"2013","unstructured":"John C. Duchi, Michael I. Jordan, and Martin J. Wainwright. 2013. Local privacy, data processing inequalities, and statistical minimax rates. arXiv preprint arXiv:1302.3203 (2013).","journal-title":"arXiv preprint arXiv:1302.3203"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_1_20_2","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork and Aaron Roth. 2014. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science 9 3\u20134 (2014) 211\u2013407.","DOI":"10.1561\/0400000042"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2013.03.005"},{"key":"e_1_3_1_22_2","first-page":"443","volume-title":"ACM SIGSAC Conference on Computer and Communications Security","author":"Falzon Francesca","year":"2020","unstructured":"Francesca Falzon, Evangelia Anna Markatou, Akshima, David Cash, Adam Rivkin, Jesse Stern, and Roberto Tamassia. 2020. Full database reconstruction in two dimensions. In ACM SIGSAC Conference on Computer and Communications Security. 443\u2013460."},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2018.10.012"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-0493-8_1"},{"issue":"7","key":"e_1_3_1_25_2","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s11199-013-0266-3","article-title":"Gender roles and pressure to be truthful: The bogus pipeline modifies gender differences in sexual but not non-sexual behavior","volume":"68","author":"Fisher Terri D.","year":"2013","unstructured":"Terri D. Fisher. 2013. Gender roles and pressure to be truthful: The bogus pipeline modifies gender differences in sexual but not non-sexual behavior. Sex Roles 68, 7 (2013), 401\u2013414.","journal-title":"Sex Roles"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1137\/09076828X"},{"key":"e_1_3_1_27_2","doi-asserted-by":"crossref","unstructured":"Zichen Gui Kenneth G. Paterson and Sikhar Patranabis. 2023. Rethinking searchable symmetric encryption. In 2023 IEEE Symposium on Security and Privacy (SP) . IEEE 1401\u20131418.","DOI":"10.1109\/SP46215.2023.10179460"},{"key":"e_1_3_1_28_2","first-page":"111","volume-title":"IEEE International Symposium on Information Theory","author":"Gunduz Deniz","year":"2008","unstructured":"Deniz Gunduz, Elza Erkip, and H. Vincent Poor. 2008. Lossless compression with security constraints. In IEEE International Symposium on Information Theory. IEEE, 111\u2013115."},{"key":"e_1_3_1_29_2","first-page":"135","volume-title":"29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems","author":"Gupte Mangesh","year":"2010","unstructured":"Mangesh Gupte and Mukund Sundararajan. 2010. Universally optimal privacy mechanisms for minimax agents. In 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. 135\u2013146."},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2017.03.013"},{"key":"e_1_3_1_31_2","first-page":"234","volume-title":"Annual Conference on Information Science and Systems (CISS\u201916)","author":"Issa Ibrahim","year":"2016","unstructured":"Ibrahim Issa, Sudeep Kamath, and Aaron B. Wagner. 2016. An operational measure of information leakage. In Annual Conference on Information Science and Systems (CISS\u201916). IEEE, 234\u2013239."},{"key":"e_1_3_1_32_2","first-page":"769","volume-title":"IEEE International Symposium on Information Theory (ISIT\u201917)","author":"Issa Ibrahim","year":"2017","unstructured":"Ibrahim Issa and Aaron B. Wagner. 2017. Operational definitions for some common information leakage metrics. In IEEE International Symposium on Information Theory (ISIT\u201917). IEEE, 769\u2013773."},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2831619"},{"key":"e_1_3_1_34_2","first-page":"90","volume-title":"IEEE 7th European Symposium on Security and Privacy (EuroS&P\u201922)","author":"Kamara Seny","year":"2022","unstructured":"Seny Kamara, Abdelkarim Kati, Tarik Moataz, Thomas Schneider, Amos Treiber, and Michael Yonli. 2022. SoK: Cryptanalysis of encrypted search with LEAKER\u2013A framework for LEakage AttacK evaluation on real-world data. In IEEE 7th European Symposium on Security and Privacy (EuroS&P\u201922). IEEE, 90\u2013108."},{"key":"e_1_3_1_35_2","first-page":"1829","volume-title":"ACM SIGSAC Conference on Computer and Communications Security","author":"Kornaropoulos Evgenios M.","year":"2022","unstructured":"Evgenios M. Kornaropoulos, Nathaniel Moyer, Charalampos Papamanthou, and Alexandros Psomas. 2022. Leakage inversion: Towards quantifying privacy in searchable encryption. In ACM SIGSAC Conference on Computer and Communications Security. 1829\u20131842."},{"key":"e_1_3_1_36_2","first-page":"123","volume-title":"29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems","author":"Li Chao","year":"2010","unstructured":"Chao Li, Michael Hay, Vibhor Rastogi, Gerome Miklau, and Andrew McGregor. 2010. Optimizing linear counting queries under differential privacy. In 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. 123\u2013134."},{"issue":"5","key":"e_1_3_1_37_2","doi-asserted-by":"crossref","first-page":"3679","DOI":"10.1109\/TIT.2018.2809005","article-title":"Information-theoretic privacy for smart metering systems with a rechargeable battery","volume":"64","author":"Li Simon","year":"2018","unstructured":"Simon Li, Ashish Khisti, and Aditya Mahajan. 2018. Information-theoretic privacy for smart metering systems with a rechargeable battery. IEEE Trans. Inf. Theor 64, 5 (2018), 3679\u20133695.","journal-title":"IEEE Trans. Inf. Theor"},{"key":"e_1_3_1_38_2","first-page":"701","volume-title":"IEEE International Symposium on Information Theory (ISIT\u201918)","author":"Liao Jiachun","year":"2018","unstructured":"Jiachun Liao, Oliver Kosut, Lalitha Sankar, and Flavio P. Calmon. 2018. A tunable measure for information leakage. In IEEE International Symposium on Information Theory (ISIT\u201918). IEEE, 701\u2013705."},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.02.006"},{"key":"e_1_3_1_40_2","first-page":"91","volume-title":"42nd Annual International Cryptology Conference: Advances in Cryptology (CRYPTO\u201922)","author":"Minaud Brice","year":"2022","unstructured":"Brice Minaud and Michael Reichle. 2022. Dynamic local searchable symmetric encryption. In 42nd Annual International Cryptology Conference: Advances in Cryptology (CRYPTO\u201922). Springer, 91\u2013120."},{"key":"e_1_3_1_41_2","article-title":"10 Facebook Statistics Every Marketer Should Know in 2021 [Infographic]","author":"Mohsin Maryam","year":"2021","unstructured":"Maryam Mohsin. 2021. 10 Facebook Statistics Every Marketer Should Know in 2021 [Infographic]. Retrieved from https:\/\/www.oberlo.com\/blog\/facebook-statistics","journal-title":"R"},{"key":"e_1_3_1_42_2","first-page":"265","volume-title":"IEEE 25th Computer Security Foundations Symposium","author":"M\u2019rio S. Alvim","year":"2012","unstructured":"S. Alvim M\u2019rio, Kostas Chatzikokolakis, Catuscia Palamidessi, and Geoffrey Smith. 2012. Measuring information leakage using generalized gain functions. In IEEE 25th Computer Security Foundations Symposium. IEEE, 265\u2013279."},{"key":"e_1_3_1_43_2","volume-title":"Iterative Solutions of Linear Systems","author":"Qiu Jingmei","year":"2012","unstructured":"Jingmei Qiu. 2012.Iterative Solutions of Linear Systems. Retrieved from https:\/\/www.math.uh.edu\/jingqiu\/math4364\/iterative_linear_system.pdf"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2903658"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.190"},{"key":"e_1_3_1_46_2","volume-title":"Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Contributions to the Theory of Statistics","author":"R\u00e9nyi Alfr\u00e9d","year":"1961","unstructured":"Alfr\u00e9d R\u00e9nyi et\u00a0al. 1961. On measures of entropy and information. In Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Contributions to the Theory of Statistics. The Regents of the University of California."},{"key":"e_1_3_1_47_2","first-page":"697","volume-title":"ACM SIGSAC Conference on Computer and Communications Security","author":"Romanelli Marco","year":"2020","unstructured":"Marco Romanelli, Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Pablo Piantanida. 2020. Estimating g-leakage via machine learning. In ACM SIGSAC Conference on Computer and Communications Security. 697\u2013716."},{"key":"e_1_3_1_48_2","first-page":"1","volume-title":"IEEE International Conference on Communications (ICC\u201921)","author":"Sakib Shahnewaz Karim","year":"2021","unstructured":"Shahnewaz Karim Sakib, George T. Amariucai, and Yong Guan. 2021. Information leakage metrics for adversaries with incomplete information: Binary privacy mechanism. In IEEE International Conference on Communications (ICC\u201921). IEEE, 1\u20137."},{"key":"e_1_3_1_49_2","first-page":"95","volume-title":"IEEE 36th Computer Security Foundations Symposium (CSF\u201923)","author":"Sakib Shahnewaz Karim","year":"2022","unstructured":"Shahnewaz Karim Sakib, George T. Amariucai, and Yong Guan. 2022. Variations and extensions of information leakage metrics with applications to privacy problems with imperfect statistical information. In IEEE 36th Computer Security Foundations Symposium (CSF\u201923). IEEE Computer Society, 95\u2013110."},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2253320"},{"key":"e_1_3_1_51_2","unstructured":"Shahnewaz. 2023. ACM_TOPS_Codes. Retrieved from https:\/\/github.com\/Shahanewaz\/ACM_TOPS_Codes.git"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00596-1_21"},{"key":"e_1_3_1_53_2","first-page":"44","volume-title":"IEEE Symposium on Security and Privacy (S&P\u201900)","author":"Song Dawn Xiaoding","year":"2000","unstructured":"Dawn Xiaoding Song, David Wagner, and Adrian Perrig. 2000. Practical techniques for searches on encrypted data. In IEEE Symposium on Security and Privacy (S&P\u201900). IEEE, 44\u201355."},{"key":"e_1_3_1_54_2","first-page":"685","volume-title":"43rd Annual ACM Symposium on Theory of Computing","author":"Valiant Gregory","year":"2011","unstructured":"Gregory Valiant and Paul Valiant. 2011. Estimating the unseen: An n\/log (n)-sample estimator for entropy and support size, shown optimal via new CLTs. In 43rd Annual ACM Symposium on Theory of Computing. 685\u2013694."},{"key":"e_1_3_1_55_2","first-page":"2157","volume-title":"Conference on Advances in Neural Information Processing Systems","author":"Valiant Paul","year":"2013","unstructured":"Paul Valiant and Gregory Valiant. 2013. Estimating the unseen: Improved estimators for entropy and other properties. In Conference on Advances in Neural Information Processing Systems. 2157\u20132165."},{"key":"e_1_3_1_56_2","first-page":"706","volume-title":"IEEE International Symposium on Information Theory (ISIT\u201918)","author":"Wang Hao","year":"2018","unstructured":"Hao Wang, Mario Diaz, Flavio P. Calmon, and Lalitha Sankar. 2018. The utility cost of robust privacy guarantees. In IEEE International Symposium on Information Theory (ISIT\u201918). IEEE, 706\u2013710."},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2934414"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2584610"},{"key":"e_1_3_1_59_2","doi-asserted-by":"crossref","unstructured":"Anita Whiting and David Williams. 2013. Why people use social media: a uses and gratifications approach. Qualitative Market Research: an International Journal 16 4 (2013) 362\u2013369.","DOI":"10.1108\/QMR-06-2013-0041"},{"issue":"365","key":"e_1_3_1_60_2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1080\/01621459.1979.10481639","article-title":"Warner\u2019s randomized response model: A Bayesian approach","volume":"74","author":"Winkler Robert L.","year":"1979","unstructured":"Robert L. Winkler and Leroy A. Franklin. 1979. Warner\u2019s randomized response model: A Bayesian approach. J. Am. Stat. Assoc. 74, 365 (1979), 207\u2013214.","journal-title":"J. Am. Stat. Assoc."},{"key":"e_1_3_1_61_2","first-page":"1","volume-title":"16th Canadian Workshop on Information Theory (CWIT\u201919)","author":"Xiao Tianrui","year":"2019","unstructured":"Tianrui Xiao and Ashish Khisti. 2019. Maximal information leakage based privacy preserving data disclosure mechanisms. In 16th Canadian Workshop on Information Theory (CWIT\u201919). IEEE, 1\u20136."}],"container-title":["ACM Transactions on Privacy and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624982","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3624982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:35:45Z","timestamp":1750178145000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,13]]},"references-count":60,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,11,30]]}},"alternative-id":["10.1145\/3624982"],"URL":"https:\/\/doi.org\/10.1145\/3624982","relation":{},"ISSN":["2471-2566","2471-2574"],"issn-type":[{"value":"2471-2566","type":"print"},{"value":"2471-2574","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,13]]},"assertion":[{"value":"2022-12-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-09-12","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-11-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}