{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:08:02Z","timestamp":1781258882626,"version":"3.54.1"},"reference-count":58,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2024,7,31]]},"abstract":"<jats:p>Function layout, also known as function reordering or function placement, is one of the most effective profile-guided compiler optimizations. By reordering functions in a binary, compilers can improve the performance of large-scale applications or reduce the compressed size of mobile applications. Although the technique has been extensively studied in the context of large-scale binaries, no study has thoroughly investigated function layout algorithms on mobile applications.<\/jats:p>\n          <jats:p>\n            In this article, we develop the first principled solution for optimizing function layouts in the mobile space. To this end, we identify two key optimization goals: reducing the compressed code size and improving the cold start-up time of a mobile application. Then, we propose a formal model for the layout problem, whose objective closely matches our goals, and a novel algorithm for optimizing the layout. The method is inspired by the classic balanced graph partitioning problem. We have carefully engineered and implemented the algorithm in an open-source compiler, Low-level Virtual Machine (LLVM). An extensive evaluation of the new method on large commercial mobile applications demonstrates improvements in start-up time and compressed size compared to the state-of-the-art approach.\n            <jats:xref ref-type=\"fn\">\n              <jats:sup>1<\/jats:sup>\n            <\/jats:xref>\n          <\/jats:p>","DOI":"10.1145\/3660635","type":"journal-article","created":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T10:23:05Z","timestamp":1713608585000},"page":"1-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Reordering Functions in Mobiles Apps for Reduced Size and Faster Start-Up"],"prefix":"10.1145","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3853-1889","authenticated-orcid":false,"given":"Ellis","family":"Hoag","sequence":"first","affiliation":[{"name":"Meta, Menlo Park, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9127-7261","authenticated-orcid":false,"given":"Kyungwoo","family":"Lee","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4948-2998","authenticated-orcid":false,"given":"Julian","family":"Mestre","sequence":"additional","affiliation":[{"name":"The University of Sydney, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4089-673X","authenticated-orcid":false,"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4162-2483","authenticated-orcid":false,"given":"Yongkang","family":"Zhu","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,10]]},"reference":[{"key":"e_1_3_3_2_2","first-page":"857","volume-title":"Proceedings of the International Conference on Programming Language Design and Implementation","author":"Ahmadi Ali","year":"2022","unstructured":"Ali Ahmadi, Majid Daliri, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. 2022. Efficient approximations for cache-conscious data placement. In Proceedings of the International Conference on Programming Language Design and Implementation, Ranjit Jhala and Isil Dillig (Eds.). ACM, 857\u2013871. 10.1145\/3519939.3523436"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1350-7"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/9781118601181"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"e_1_3_3_6_2","first-page":"363","volume-title":"Proceedings of the International Symposium on Code Generation and Optimization","author":"Chabbi Milind","year":"2021","unstructured":"Milind Chabbi, Jin Lin, and Raj Barik. 2021. An experience with code-size optimization for production iOS mobile applications. In Proceedings of the International Symposium on Code Generation and Optimization, Jae W. Lee, Mary Lou Soffa, and Ayal Zaks (Eds.). IEEE, 363\u2013377. 10.1109\/CGO51591.2021.9370306"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3290366"},{"key":"e_1_3_3_8_2","first-page":"12","volume-title":"Proceedings of the International Symposium on Code Generation and Optimization","author":"Chen Dehao","year":"2016","unstructured":"Dehao Chen, Tipp Moseley, and David Xinliang Li. 2016. AutoFDO: Automatic feedback-directed optimization for warehouse-scale applications. In Proceedings of the International Symposium on Code Generation and Optimization. ACM, 12\u201323. 10.1145\/2854038.2854044"},{"key":"e_1_3_3_9_2","first-page":"219","volume-title":"Proceedings of the Conference on Knowledge Discovery and Data Mining","author":"Chierichetti Flavio","year":"2009","unstructured":"Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, and Prabhakar Raghavan. 2009. On compressing social networks. In Proceedings of the Conference on Knowledge Discovery and Data Mining. ACM, 219\u2013228. 10.1145\/1557019.1557049"},{"key":"e_1_3_3_10_2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/3475061.3475081","volume-title":"Proceedings of the 25th Brazilian Symposium on Programming Languages","author":"Dam\u00e1sio Tha\u00eds","year":"2021","unstructured":"Tha\u00eds Dam\u00e1sio, Vin\u00edcius Pacheco, Fabr\u00edcio Goes, Fernando Pereira, and Rodrigo Rocha. 2021. Inlining for code size reduction. In Proceedings of the 25th Brazilian Symposium on Programming Languages. ACM, 17\u201324. 10.1145\/3475061.3475081"},{"key":"e_1_3_3_11_2","volume-title":"App Startup Time","author":"Developers Google","year":"2022","unstructured":"Google Developers. 2022. App Startup Time. Retrieved from https:\/\/developer.android.com\/topic\/performance\/vitals\/launch-time"},{"key":"e_1_3_3_12_2","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1145\/2939672.2939862","volume-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201916)","author":"Dhulipala Laxman","year":"2016","unstructured":"Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergey Pupyrev, and Alon Shalita. 2016. Compressing graphs and indexes with recursive graph bisection. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201916). ACM, New York, NY, 1535\u20131544. 10.1145\/2939672.2939862"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359634"},{"key":"e_1_3_3_14_2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1145\/1718487.1718536","volume-title":"Proceedings of the International Conference on Web Search and Data Mining","author":"Ferragina Paolo","year":"2010","unstructured":"Paolo Ferragina and Giovanni Manzini. 2010. On compressing the textual web. In Proceedings of the International Conference on Web Search and Data Mining. ACM, New York, NY, 391\u2013400. 10.1145\/1718487.1718536"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90041-V"},{"key":"e_1_3_3_16_2","first-page":"47","volume-title":"Proceedings of the 6th Annual ACM Symposium on Theory of Computing","author":"Garey Michael R.","year":"1974","unstructured":"Michael R. Garey, David S. Johnson, and Larry Stockmeyer. 1974. Some simplified NP-complete problems. In Proceedings of the 6th Annual ACM Symposium on Theory of Computing. ACM, New York, NY, 47\u201363. 10.1145\/800119.803884"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/330249.330254"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/258915.258931"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3498714"},{"key":"e_1_3_3_20_2","first-page":"52","volume-title":"Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems","author":"Hoag Ellis","year":"2023","unstructured":"Ellis Hoag, Kyungwoo Lee, Juli\u00e1n Mestre, and Sergey Pupyrev. 2023. Optimizing function layout for mobile applications. In Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems. ACM, New York, NY, 52\u201363. 10.1145\/3589610.3596277"},{"key":"e_1_3_3_21_2","volume-title":"Reducing Your App\u2019s Launch Time","author":"Inc. Apple","year":"2022","unstructured":"Apple Inc.2022. Reducing Your App\u2019s Launch Time. Retrieved from https:\/\/developer.apple.com\/documentation\/xcode\/reducing-your-app-s-launch-time"},{"key":"e_1_3_3_22_2","volume-title":"Optimizing Facebook for iOS Start Time","author":"Inc. Facebook","year":"2015","unstructured":"Facebook Inc.2015. Optimizing Facebook for iOS Start Time. Retrieved from https:\/\/engineering.fb.com\/2015\/11\/20\/ios\/optimizing-facebook-for-ios-start-time"},{"key":"e_1_3_3_23_2","volume-title":"Redex: A Bytecode Optimizer for Android Apps","author":"Inc Facebook","year":"2021","unstructured":"Facebook Inc. 2021. Redex: A Bytecode Optimizer for Android Apps. Retrieved from https:\/\/fbredex.com"},{"key":"e_1_3_3_24_2","volume-title":"Superpack: Pushing the Limits of Compression in Facebook\u2019s Mobile Apps","author":"Inc. Facebook","year":"2021","unstructured":"Facebook Inc.2021. Superpack: Pushing the Limits of Compression in Facebook\u2019s Mobile Apps. Retrieved from https:\/\/engineering.fb.com\/2021\/09\/13\/core-data\/superpack\/"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137650"},{"key":"e_1_3_3_26_2","first-page":"244","volume-title":"Proceedings of the Conference on High-Performance Computer Architecture","author":"Kalamationos J.","year":"1998","unstructured":"J. Kalamationos and David R. Kaeli. 1998. Temporal-based procedure reordering for improved instruction cache performance. In Proceedings of the Conference on High-Performance Computer Architecture. IEEE Computer Society, 244\u2013253. 10.1109\/HPCA.1998.650563"},{"issue":"2","key":"e_1_3_3_27_2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan Brian W.","year":"1970","unstructured":"Brian W. Kernighan and Shen Lin. 1970. An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 2 (1970), 291\u2013307.","journal-title":"Bell Syst. Tech. J."},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3224382"},{"key":"e_1_3_3_29_2","first-page":"75","volume-title":"Proceedings of the International Symposium on Code Generation and Optimization","author":"Lattner Chris","year":"2004","unstructured":"Chris Lattner and Vikram Adve. 2004. LLVM: A compilation framework for lifelong program analysis & transformation. In Proceedings of the International Symposium on Code Generation and Optimization. IEEE Computer Society, 75. 10.1109\/CGO.2004.1281665"},{"key":"e_1_3_3_30_2","first-page":"232","volume-title":"Proceedings of the Symposium on Principles of Programming Languages","author":"Lavaee Rahman","year":"2016","unstructured":"Rahman Lavaee. 2016. The hardness of data packing. In Proceedings of the Symposium on Principles of Programming Languages. ACM, 232\u2013242. 10.1145\/2837614.2837669"},{"key":"e_1_3_3_31_2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/3302516.3307358","volume-title":"Proceedings of the 28th International Conference on Compiler Construction","author":"Lavaee Rahman","year":"2019","unstructured":"Rahman Lavaee, John Criswell, and Chen Ding. 2019. Codestitcher: Inter-procedural basic block layout optimization. In Proceedings of the 28th International Conference on Compiler Construction, Jos\u00e9 Nelson Amaral and Milind Kulkarni (Eds.). ACM, 65\u201375. 10.1145\/3302516.3307358"},{"key":"e_1_3_3_32_2","volume-title":"ABC Optimizer: Affinity Based Code Layout Optimization","author":"Lavaee Rahman","year":"2014","unstructured":"Rahman Lavaee and Chen Ding. 2014. ABC Optimizer: Affinity Based Code Layout Optimization. Technical Report. University of Rochester."},{"key":"e_1_3_3_33_2","first-page":"243","volume-title":"Proceedings of the International Conference on Compiler Construction","author":"Lee Kyungwoo","year":"2022","unstructured":"Kyungwoo Lee, Ellis Hoag, and Nikolai Tillmann. 2022. Efficient profile-guided size optimization for native mobile applications. In Proceedings of the International Conference on Compiler Construction. ACM, 243\u2013253. 10.1145\/3497776.3517764"},{"key":"e_1_3_3_34_2","first-page":"116","volume-title":"Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems","author":"Lee Kyungwoo","year":"2022","unstructured":"Kyungwoo Lee, Manman Ren, and Shane Nay. 2022. Scalable size inliner for mobile applications (WIP). In Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems. ACM, 116\u2013120. 10.1145\/3519941.3535074"},{"key":"e_1_3_3_35_2","first-page":"257","volume-title":"Proceedings of the USENIX Conference on File and Storage Technologies (FAST\u201914)","author":"Lin Xing","year":"2014","unstructured":"Xing Lin, Guanlin Lu, Fred Douglis, Philip Shilane, and Grant Wallace. 2014. Migratory compression: Coarse-grained data reordering to improve compressibility. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST\u201914). USENIX, Santa Clara, CA, USA, 257\u2013271."},{"key":"e_1_3_3_36_2","first-page":"168","volume-title":"Proceedings of the International Conference on Compiler Construction","author":"Liu Gai","year":"2023","unstructured":"Gai Liu, Umar Farooq, Chengyan Zhao, Xia Liu, and Nian Sun. 2023. Linker code size optimization for native mobile applications. In Proceedings of the International Conference on Compiler Construction. ACM, New York, NY, 168\u2013179. 10.1145\/3578360.3580256"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3208902"},{"key":"e_1_3_3_38_2","volume-title":"Understanding Cold, Hot, and Warm App Launch Time","author":"Mansour Nezar","year":"2020","unstructured":"Nezar Mansour. 2020. Understanding Cold, Hot, and Warm App Launch Time. Retrieved from https:\/\/blog.instabug.com\/understanding-cold-hot-and-warm-app-launch-time\/"},{"key":"e_1_3_3_39_2","series-title":"LIPIcs","first-page":"42:1\u201342:14","volume-title":"Proceedings of the 32nd International Symposium on Algorithms and Computation","volume":"212","author":"Mestre Juli\u00e1n","year":"2021","unstructured":"Juli\u00e1n Mestre, Sergey Pupyrev, and Seeun William Umboh. 2021. On the extended TSP problem. In Proceedings of the 32nd International Symposium on Algorithms and Computation(LIPIcs, Vol. 212), Hee-Kap Ahn and Kunihiko Sadakane (Eds.). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 42:1\u201342:14. 10.4230\/LIPIcs.ISAAC.2021.42"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.2982888"},{"key":"e_1_3_3_41_2","first-page":"233","volume-title":"Proceedings of the International Symposium on Code Generation and Optimization","author":"Ottoni Guilherme","year":"2017","unstructured":"Guilherme Ottoni and Bertrand Maher. 2017. Optimizing function placement for large-scale data-center applications. In Proceedings of the International Symposium on Code Generation and Optimization. IEEE Press, 233\u2013244. 10.1109\/CGO.2017.7863743"},{"key":"e_1_3_3_42_2","first-page":"2","volume-title":"Proceedings of the International Symposium on Code Generation and Optimization","author":"Panchenko Maksim","year":"2019","unstructured":"Maksim Panchenko, Rafael Auler, Bill Nell, and Guilherme Ottoni. 2019. BOLT: A practical binary optimizer for data centers and beyond. In Proceedings of the International Symposium on Code Generation and Optimization. IEEE, Washington, DC, 2\u201314. 10.1109\/CGO.2019.8661201"},{"issue":"3","key":"e_1_3_3_43_2","first-page":"275","article-title":"The hardness of cache conscious data placement","volume":"12","author":"Petrank Erez","year":"2005","unstructured":"Erez Petrank and Dror Rawitz. 2005. The hardness of cache conscious data placement. Nordic J. Comput. 12, 3 (2005), 275\u2013307.","journal-title":"Nordic J. Comput."},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/989393.989433"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9618-6"},{"key":"e_1_3_3_46_2","volume-title":"Effect of Mobile App Size on Downloads","author":"Reinhardt Peter","year":"2016","unstructured":"Peter Reinhardt. 2016. Effect of Mobile App Size on Downloads. Retrieved from https:\/\/segment.com\/blog\/mobile-app-size-effect-on-downloads\/"},{"key":"e_1_3_3_47_2","first-page":"217","volume-title":"Proceedings of the International Symposium on Code Generation and Optimization","author":"Rocha Rodrigo C. O.","year":"2022","unstructured":"Rodrigo C. O. Rocha, Pavlos Petoumenos, Bj\u00f6rn Franke, Pramod Bhatotia, and Michael O\u2019Boyle. 2022. Loop rolling for code size reduction. In Proceedings of the International Symposium on Code Generation and Optimization, Jae W. Lee, Sebastian Hack, and Tatiana Shpeisman (Eds.). IEEE, 217\u2013229. 10.1109\/CGO53902.2022.9741256"},{"key":"e_1_3_3_48_2","first-page":"110","volume-title":"Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems","author":"Rocha Rodrigo C. O.","year":"2021","unstructured":"Rodrigo C. O. Rocha, Pavlos Petoumenos, Zheng Wang, Murray Cole, Kim Hazelwood, and Hugh Leather. 2021. HyFM: Function merging for free. In Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems, J\u00f6rg Henkel and Xu Liu (Eds.). ACM, 110\u2013121. 10.1145\/3461648.3463852"},{"key":"e_1_3_3_49_2","first-page":"854","volume-title":"Proceedings of the International Conference on Programming Language Design and Implementation","author":"Rocha Rodrigo C. O.","year":"2020","unstructured":"Rodrigo C. O. Rocha, Pavlos Petoumenos, Zheng Wang, Murray Cole, and Hugh Leather. 2020. Effective function merging in the SSA form. In Proceedings of the International Conference on Programming Language Design and Implementation, Alastair F. Donaldson and Emina Torlak (Eds.). ACM, 854\u2013868. 10.1145\/3385412.3386030"},{"key":"e_1_3_3_50_2","first-page":"1","volume-title":"Proceedings of the Workshop on Binary Rewriting","author":"Schwarz Benjamin","year":"2001","unstructured":"Benjamin Schwarz, Saumya Debray, Gregory Andrews, and Matthew Legendre. 2001. PLTO: A link-time optimizer for the Intel IA-32 architecture. In Proceedings of the Workshop on Binary Rewriting. 1\u20137."},{"key":"e_1_3_3_51_2","first-page":"617","volume-title":"Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems","author":"Shen Han","year":"2023","unstructured":"Han Shen, Krzysztof Pszeniczny, Rahman Lavaee, Snehasish Kumar, Sriraman Tallam, and Xinliang David Li. 2023. Propeller: A profile guided, relinking optimizer for warehouse-scale applications. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems. ACM, 617\u2013631. 10.1145\/3575693.3575727"},{"issue":"2","key":"e_1_3_3_52_2","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator Daniel D.","year":"1985","unstructured":"Daniel D. Sleator and Robert E. Tarjan. 1985. Amortized efficiency of list update and paging rules. Commun. ACM 28, 2 (1985), 202\u2013208.","journal-title":"Commun. ACM"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303755"},{"key":"e_1_3_3_55_2","first-page":"113","volume-title":"Proceedings of the 10th International Conference on Mobile Systems, Applications, and Services","author":"Yan Tingxin","year":"2012","unstructured":"Tingxin Yan, David Chu, Deepak Ganesan, Aman Kansal, and Jie Liu. 2012. Fast app launching for mobile devices using predictive user context. In Proceedings of the 10th International Conference on Mobile Systems, Applications, and Services. ACM, 113\u2013126. 10.1145\/2307636.2307648"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-2864-4_267"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"e_1_3_3_58_2","unstructured":"LZFSE compression algorithm. 2024.Retrieved from https:\/\/en.wikipedia.org\/wiki\/LZFSE"},{"key":"e_1_3_3_59_2","unstructured":"ZSTD compression algorithm. 2024.Retrieved from https:\/\/en.wikipedia.org\/wiki\/Zstd"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3660635","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3660635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:21Z","timestamp":1750287021000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3660635"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,7,31]]}},"alternative-id":["10.1145\/3660635"],"URL":"https:\/\/doi.org\/10.1145\/3660635","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2023-10-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-10","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}