{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T08:52:54Z","timestamp":1769763174842,"version":"3.49.0"},"reference-count":104,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T00:00:00Z","timestamp":1694476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["IIS-1956096 and CAREER IIS-1762268"],"award-info":[{"award-number":["IIS-1956096 and CAREER IIS-1762268"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2023,9,30]]},"abstract":"<jats:p>\n            Modern data lakes are heterogeneous in the vocabulary that is used to describe data. We study a problem of disambiguation in data lakes:\n            <jats:italic>How can we determine if a data value occurring more than once in the lake has different meanings and is therefore a homograph?<\/jats:italic>\n            While word and entity disambiguation have been well studied in computational linguistics, data management, and data science, we show that data lakes provide a new opportunity for disambiguation of data values, because tables implicitly define a massive network of interconnected values. We introduce\n            <jats:monospace>DomainNet<\/jats:monospace>\n            , which efficiently represents this network, and investigate to what extent it can be used to disambiguate values without requiring any supervision.\n          <\/jats:p>\n          <jats:p>\n            <jats:monospace>DomainNet<\/jats:monospace>\n            leverages network-centrality measures on a bipartite graph whose nodes represent data values and attributes to determine if a value is a homograph. A thorough experimental evaluation demonstrates that state-of-the-art techniques in domain discovery cannot be re-purposed to compete with our method. Specifically, using a domain discovery method to identify homographs achieves an F1-score of 0.38 versus 0.69 for\n            <jats:monospace>DomainNet<\/jats:monospace>\n            , which separates homographs well from data values that have a unique meaning. On a real data lake, our top-100 precision is 93%. Given a homograph, we also present a novel method for determining the number of meanings of the homograph and for assigning its data lake attributes to a meaning. We show the influence of homographs on two downstream tasks: entity-matching and domain discovery.\n          <\/jats:p>","DOI":"10.1145\/3612919","type":"journal-article","created":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T09:58:42Z","timestamp":1691229522000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["DomainNet: Homograph Detection and Understanding in Data Lake Disambiguation"],"prefix":"10.1145","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7229-3936","authenticated-orcid":false,"given":"Aristotelis","family":"Leventidis","sequence":"first","affiliation":[{"name":"Northeastern University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8134-909X","authenticated-orcid":false,"given":"Laura","family":"Di Rocco","sequence":"additional","affiliation":[{"name":"Northeastern University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9614-0504","authenticated-orcid":false,"given":"Wolfgang","family":"Gatterbauer","sequence":"additional","affiliation":[{"name":"Northeastern University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1484-4787","authenticated-orcid":false,"given":"Ren\u00e9e J.","family":"Miller","sequence":"additional","affiliation":[{"name":"Northeastern University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6102-7472","authenticated-orcid":false,"given":"Mirek","family":"Riedewald","sequence":"additional","affiliation":[{"name":"Northeastern University, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,9,12]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2015.04.006"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00567-8"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.05.003"},{"issue":"1","key":"e_1_3_2_5_2","article-title":"A survey of topic modeling in text mining","volume":"6","author":"Alghamdi Rubayyi","year":"2015","unstructured":"Rubayyi Alghamdi and Khalid Alfalqi. 2015. A survey of topic modeling in text mining. Int. J. Adv. Comput. Sci. Appl. 6, 1 (2015).","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-1797-2_6"},{"key":"e_1_3_2_7_2","article-title":"On embeddings in relational databases","volume":"2005","author":"Arora Siddhant","year":"2020","unstructured":"Siddhant Arora and Srikanta Bedathur. 2020. On embeddings in relational databases. CoRR abs\/2005.06437 (2020).","journal-title":"CoRR"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_10"},{"key":"e_1_3_2_9_2","article-title":"Survey and taxonomy of lossless graph compression and space-efficient graph representations","volume":"1806","author":"Besta Maciej","year":"2018","unstructured":"Maciej Besta and Torsten Hoefler. 2018. Survey and taxonomy of lossless graph compression and space-efficient graph representations. CoRR abs\/1806.01799 (2018).","journal-title":"CoRR"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217304"},{"key":"e_1_3_2_11_2","first-page":"287","volume-title":"Annual Meeting of the Association for Computational Linguistics","author":"Bhattacharya Indrajit","year":"2004","unstructured":"Indrajit Bhattacharya, Lise Getoor, and Yoshua Bengio. 2004. Unsupervised sense disambiguation using bilingual probabilistic models. In Annual Meeting of the Association for Computational Linguistics. ACL, 287\u2013294."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336667"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376746"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_15_2","first-page":"463","volume-title":"International Conference on Extending Database Technology","author":"Brunner Ursin","year":"2020","unstructured":"Ursin Brunner and Kurt Stockinger. 2020. Entity matching with transformer architectures\u2014A step forward in data integration. In International Conference on Extending Database Technology. OpenProceedings.org, 463\u2013473."},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00220"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389742"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.76"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3091106"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxu003"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-020-00647-6"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3418896"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.43"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055549"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-020-00289-9"},{"key":"e_1_3_2_26_2","volume-title":"Language Resources and Evaluation Conference","author":"Damljanovic Danica","year":"2008","unstructured":"Danica Damljanovic, Valentin Tablan, and Kalina Bontcheva. 2008. A text-based query interface to OWL ontologies. In Language Resources and Evaluation Conference. European Language Resources Association."},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N19-1423"},{"key":"e_1_3_2_28_2","article-title":"Efficient joinable table discovery in data lakes: A high-dimensional similarity-based approach","volume":"2010","author":"Dong Yuyang","year":"2020","unstructured":"Yuyang Dong, Kunihiro Takeoka, Chuan Xiao, and Masafumi Oyamada. 2020. Efficient joinable table discovery in data lakes: A high-dimensional similarity-based approach. CoRR abs\/2010.13273 (2020).","journal-title":"CoRR"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-34129-3_19"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/2500410.2500413"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/2791347.2791353"},{"key":"e_1_3_2_32_2","first-page":"226","volume-title":"2nd International Conference on Knowledge Discovery and Data Mining (KDD\u201996)","author":"Ester Martin","year":"1996","unstructured":"Martin Ester, Hans-Peter Kriegel, J\u00f6rg Sander, and Xiaowei Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In 2nd International Conference on Knowledge Discovery and Data Mining (KDD\u201996). AAAI Press, 226\u2013231. Retrieved from http:\/\/www.aaai.org\/Library\/KDD\/1996\/kdd96-037.php"},{"key":"e_1_3_2_33_2","first-page":"1190","volume-title":"International Conference on Data Engineering","author":"Fernandez Raul Castro","year":"2019","unstructured":"Raul Castro Fernandez, Jisoo Min, Demitri Nava, and Samuel Madden. 2019. Lazo: A cardinality-based method for coupled estimation of Jaccard similarity and containment. In International Conference on Data Engineering. IEEE, 1190\u20131201."},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/2350036.2350040"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063626"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972887.9"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367564"},{"key":"e_1_3_2_39_2","volume-title":"14th International Conference on Artificial Intelligence (ICAI\u201912)","author":"Goel Aman","year":"2012","unstructured":"Aman Goel, Craig A. Knoblock, and Kristina Lerman. 2012. Exploiting structure within data for accurate labeling using conditional random fields. In 14th International Conference on Artificial Intelligence (ICAI\u201912)."},{"key":"e_1_3_2_40_2","first-page":"25","volume-title":"10th International Workshop on Ontology Matching (CEUR Workshop Proceedings)","author":"Hassanzadeh Oktie","year":"2015","unstructured":"Oktie Hassanzadeh, Michael Jeffrey Ward, Mariano Rodriguez-Muro, and Kavitha Srinivas. 2015. Understanding a large corpus of web tables through matching with knowledge bases: An empirical study. In 10th International Workshop on Ontology Matching (CEUR Workshop Proceedings). CEUR-WS.org, 25\u201334. Retrieved from http:\/\/ceur-ws.org\/Vol-1545\/om2015_TLpaper3.pdf"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.66"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3290605.3300892"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908075"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330993"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/p16-1085"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2018.02.011"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0283-9"},{"key":"e_1_3_2_48_2","first-page":"1","volume-title":"4th European Semantic Web Conference","author":"Kaufmann Esther","year":"2007","unstructured":"Esther Kaufmann, Abraham Bernstein, and Lorenz Fischer. 2007. NLP-reduce: A naive but domain independent natural language interface for querying ontologies. In 4th European Semantic Web Conference. Springer, 1\u20132."},{"key":"e_1_3_2_49_2","first-page":"980","volume-title":"5th International Semantic Web Conference (ISWC\u201906)","author":"Kaufmann Esther","year":"2006","unstructured":"Esther Kaufmann, Abraham Bernstein, and Renato Zumstein. 2006. Querix: A natural language interface to query ontologies based on clarification dialogs. In 5th International Semantic Web Conference (ISWC\u201906). Citeseer, 980\u2013981."},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.2307\/2332226"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064012"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2865785"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-018-1246-2"},{"key":"e_1_3_2_54_2","volume-title":"International Conference on Extending Database Technology","author":"Koutras Christos","year":"2020","unstructured":"Christos Koutras, Marios Fragkoulis, Asterios Katsifodimos, and Christoph Lofi. 2020. REMA: Graph embeddings-based relational schema matching. In International Conference on Extending Database Technology."},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.3233\/SW-140134"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/2872518.2889386"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.5441\/002\/edbt.2021.03"},{"issue":"2","key":"e_1_3_2_58_2","first-page":"183","article-title":"Evaluating the use of social networks in author name disambiguation in digital libraries","volume":"1","author":"Levin Felipe Hoppe","year":"2010","unstructured":"Felipe Hoppe Levin and Carlos A. Heuser. 2010. Evaluating the use of social networks in author name disambiguation in digital libraries. J. Inf. Data Manag. 1, 2 (2010), 183\u2013198. Retrieved from http:\/\/seer.lcc.ufmg.br\/index.php\/jidm\/article\/view\/35","journal-title":"J. Inf. Data Manag."},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/2949741.2949744"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.14778\/3421424.3421431"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921005"},{"key":"e_1_3_2_62_2","article-title":"RoBERTa: A robustly optimized BERT pretraining approach","volume":"1907","author":"Liu Yinhan","year":"2019","unstructured":"Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike Lewis, Luke Zettlemoyer, and Veselin Stoyanov. 2019. RoBERTa: A robustly optimized BERT pretraining approach. CoRR abs\/1907.11692 (2019).","journal-title":"CoRR"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3186727"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2866424"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939856"},{"key":"e_1_3_2_66_2","article-title":"A survey on methods and systems for graph compression","volume":"1504","author":"Maneth Sebastian","year":"2015","unstructured":"Sebastian Maneth and Fabian Peternek. 2015. A survey on methods and systems for graph compression. CoRR abs\/1504.00616 (2015).","journal-title":"CoRR"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3240491"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352116"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.14778\/3192965.3192973"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1145\/1459352.1459355"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1093\/ACPROF:OSO\/9780199206650.001.0001"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384346"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380577"},{"key":"e_1_3_2_74_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2020.101565"},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.14778\/2947618.2947624"},{"key":"e_1_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.1162\/COLI_a_00202"},{"key":"e_1_3_2_77_2","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1971.10482356"},{"key":"e_1_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0468-8"},{"key":"e_1_3_2_79_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0423-0"},{"key":"e_1_3_2_80_2","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883017"},{"key":"e_1_3_2_81_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0165-9"},{"key":"e_1_3_2_82_2","article-title":"DistilBERT, a distilled version of BERT: Smaller, faster, cheaper and lighter","volume":"1910","author":"Sanh Victor","year":"2019","unstructured":"Victor Sanh, Lysandre Debut, Julien Chaumond, and Thomas Wolf. 2019. DistilBERT, a distilled version of BERT: Smaller, faster, cheaper and lighter. CoRR abs\/1910.01108 (2019).","journal-title":"CoRR"},{"key":"e_1_3_2_83_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0075-9"},{"key":"e_1_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994533"},{"key":"e_1_3_2_85_2","doi-asserted-by":"publisher","DOI":"10.1145\/2633044"},{"key":"e_1_3_2_86_2","doi-asserted-by":"publisher","DOI":"10.1002\/aris.2009.1440430113"},{"key":"e_1_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25010-6_2"},{"key":"e_1_3_2_88_2","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2016.20"},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"key":"e_1_3_2_90_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301281"},{"key":"e_1_3_2_91_2","first-page":"7567","volume-title":"Annual Meeting of the Association for Computational Linguistics","author":"Wang Bailin","year":"2020","unstructured":"Bailin Wang, Richard Shin, Xiaodong Liu, Oleksandr Polozov, and Matthew Richardson. 2020. RAT-SQL: Relation-aware schema encoding and linking for text-to-SQL parsers. In Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics, 7567\u20137578."},{"key":"e_1_3_2_92_2","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_93_2","doi-asserted-by":"publisher","DOI":"10.1145\/2501654.2501657"},{"key":"e_1_3_2_94_2","first-page":"2145","volume-title":"International Conference on Computational Linguistics","author":"Yadav Vikas","year":"2018","unstructured":"Vikas Yadav and Steven Bethard. 2018. A survey on recent advances in named entity recognition from deep learning models. In International Conference on Computational Linguistics. ACL, 2145\u20132158. Retrieved from https:\/\/www.aclweb.org\/anthology\/C18-1182\/"},{"key":"e_1_3_2_95_2","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433471"},{"key":"e_1_3_2_96_2","article-title":"XLNet: Generalized autoregressive pretraining for language understanding","volume":"1906","author":"Yang Zhilin","year":"2019","unstructured":"Zhilin Yang, Zihang Dai, Yiming Yang, Jaime G. Carbonell, Ruslan Salakhutdinov, and Quoc V. Le. 2019. XLNet: Generalized autoregressive pretraining for language understanding. CoRR abs\/1906.08237 (2019).","journal-title":"CoRR"},{"key":"e_1_3_2_97_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271697"},{"key":"e_1_3_2_98_2","doi-asserted-by":"publisher","DOI":"10.14778\/3402755.3402793"},{"key":"e_1_3_2_99_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1425"},{"key":"e_1_3_2_100_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2009.07.005"},{"key":"e_1_3_2_101_2","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407793"},{"key":"e_1_3_2_102_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447830"},{"key":"e_1_3_2_103_2","article-title":"Seq2SQL: Generating structured queries from natural language using reinforcement learning","volume":"1709","author":"Zhong Victor","year":"2017","unstructured":"Victor Zhong, Caiming Xiong, and Richard Socher. 2017. Seq2SQL: Generating structured queries from natural language using reinforcement learning. CoRR abs\/1709.00103 (2017).","journal-title":"CoRR"},{"key":"e_1_3_2_104_2","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300065"},{"key":"e_1_3_2_105_2","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994534"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3612919","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3612919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:29:18Z","timestamp":1750285758000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3612919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,12]]},"references-count":104,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9,30]]}},"alternative-id":["10.1145\/3612919"],"URL":"https:\/\/doi.org\/10.1145\/3612919","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,12]]},"assertion":[{"value":"2021-09-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-09-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}