{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:08:46Z","timestamp":1750219726482,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":78,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T00:00:00Z","timestamp":1699660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,12]]},"DOI":"10.1145\/3581784.3607057","type":"proceedings-article","created":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T21:47:06Z","timestamp":1699998426000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimizing Reconfigurable Optical Datacenters: The Power of Randomization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2453-7772","authenticated-orcid":false,"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[{"name":"University of Wroclaw, Wroclaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1966-6331","authenticated-orcid":false,"given":"David","family":"Fuchssteiner","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,11,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00116-9"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3579312"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90178-5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394205"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. International Symposium on Distributed Computing (DISC).","author":"Avin Chen","year":"2017","unstructured":"Chen Avin , Kaushik Mondal , and Stefan Schmid . 2017 . Demand-aware network designs of bounded degree . In Proc. International Symposium on Distributed Computing (DISC). Chen Avin, Kaushik Mondal, and Stefan Schmid. 2017. Demand-aware network designs of bounded degree. In Proc. International Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.3"},{"volume-title":"Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication, 782--797","author":"Hitesh","key":"e_1_3_2_1_7_1","unstructured":"Hitesh Ballani et al. 2020. Sirius: a flat datacenter network with nanosecond optical switching . In Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication, 782--797 . Hitesh Ballani et al. 2020. Sirius: a flat datacenter network with nanosecond optical switching. In Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication, 782--797."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339123.2339126"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. 38th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE).","author":"Bienkowski Marcin","year":"2020","unstructured":"Marcin Bienkowski , David Fuchssteiner , Jan Marcinkowski , and Stefan Schmid . 2020 . Online dynamic b-matching with applications to reconfigurable datacenter networks . In Proc. 38th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE). Marcin Bienkowski, David Fuchssteiner, Jan Marcinkowski, and Stefan Schmid. 2020. Online dynamic b-matching with applications to reconfigurable datacenter networks. In Proc. 38th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.05.014"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360443.1360462"},{"volume-title":"Online Computation and Competitive Analysis","author":"Borodin Allan","key":"e_1_3_2_1_13_1","unstructured":"Allan Borodin and Ran El-Yaniv . 1998. Online Computation and Competitive Analysis . Cambridge University Press . Allan Borodin and Ran El-Yaniv. 1998. Online Computation and Competitive Analysis. Cambridge University Press."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75520-3_24"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536506"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253120"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253120"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/3154630.3154678"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.772430"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13731-0_39"},{"volume-title":"Proc. 44th ACM Symp. on Theory of Computing (STOC), 137--144","author":"Nikhil","key":"e_1_3_2_1_22_1","unstructured":"Nikhil R. Devanur and Kamal Jain. 2012. Online matching with concave returns . In Proc. 44th ACM Symp. on Theory of Computing (STOC), 137--144 . Nikhil R. Devanur and Kamal Jain. 2012. Online matching with concave returns. In Proc. 44th ACM Symp. on Theory of Computing (STOC), 137--144."},{"key":"e_1_3_2_1_23_1","volume-title":"Kleinberg","author":"Devanur Nikhil R.","year":"2013","unstructured":"Nikhil R. Devanur , Kamal Jain , and Robert D . Kleinberg . 2013 . Randomized primal-dual analysis of RANKING for online bipartite matching. In Proc. 24th ACM-SIAM Symp . on Discrete Algorithms (SODA), 101--107. Nikhil R. Devanur, Kamal Jain, and Robert D. Kleinberg. 2013. Randomized primal-dual analysis of RANKING for online bipartite matching. In Proc. 24th ACM-SIAM Symp. on Discrete Algorithms (SODA), 101--107."},{"volume-title":"IEEE Conference on Computer Communications (INFOCOM), 1043--1052","author":"Dinitz M.","key":"e_1_3_2_1_24_1","unstructured":"M. Dinitz and B. Moseley . 2020. Scheduling for weighted flow and completion times in reconfigurable networks . In IEEE Conference on Computer Communications (INFOCOM), 1043--1052 . M. Dinitz and B. Moseley. 2020. Scheduling for weighted flow and completion times in reconfigurable networks. In IEEE Conference on Computer Communications (INFOCOM), 1043--1052."},{"key":"e_1_3_2_1_25_1","volume-title":"Josephine Micallef, Marc Pucci, Alex Aiken, Maarten Hattink, Mingoo Seok, and Keren Bergman.","author":"Douglis Fred","year":"2021","unstructured":"Fred Douglis , Seth Robertson , Eric Van den Berg , Josephine Micallef, Marc Pucci, Alex Aiken, Maarten Hattink, Mingoo Seok, and Keren Bergman. 2021 . Fleet---fast lanes for expedited execution at 10 terabits: program overview. IEEE Internet Computing . Fred Douglis, Seth Robertson, Eric Van den Berg, Josephine Micallef, Marc Pucci, Alex Aiken, Maarten Hattink, Mingoo Seok, and Keren Bergman. 2021. Fleet---fast lanes for expedited execution at 10 terabits: program overview. IEEE Internet Computing."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22006-7\\_17"},{"volume-title":"ACM SIGCOMM Computer Communication Review number 4.","author":"Al-Fares Mohammad","key":"e_1_3_2_1_27_1","unstructured":"Mohammad Al-Fares , Alexander Loukissas , and Amin Vahdat . 2008. A scalable, commodity data center network architecture . In ACM SIGCOMM Computer Communication Review number 4. Vol. 38 . ACM , 63--74. Mohammad Al-Fares, Alexander Loukissas, and Amin Vahdat. 2008. A scalable, commodity data center network architecture. In ACM SIGCOMM Computer Communication Review number 4. Vol. 38. ACM, 63--74."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851223"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90041-V"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230718.3230722"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583410"},{"key":"e_1_3_2_1_32_1","volume-title":"Efficient algorithms for finding maximum matching in graphs. ACM Comput. Surv., 18, 1, (Mar","author":"Galil Zvi","year":"1986","unstructured":"Zvi Galil . 1986. Efficient algorithms for finding maximum matching in graphs. ACM Comput. Surv., 18, 1, (Mar . 1986 ), 23--38. Zvi Galil. 1986. Efficient algorithms for finding maximum matching in graphs. ACM Comput. Surv., 18, 1, (Mar. 1986), 23--38."},{"volume-title":"Proceedings of the 2016 ACM SIGCOMM Conference. ACM, 216--229","author":"Monia","key":"e_1_3_2_1_33_1","unstructured":"Monia Ghobadi et al. 2016. Projector: agile reconfigurable data center interconnect . In Proceedings of the 2016 ACM SIGCOMM Conference. ACM, 216--229 . Monia Ghobadi et al. 2016. Projector: agile reconfigurable data center interconnect. In Proceedings of the 2016 ACM SIGCOMM Conference. ACM, 216--229."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.INS.2017.09.020"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3489048.3522635"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592577"},{"volume-title":"Optical Switching and Networking (OSN)","author":"Hall Matthew Nance","key":"e_1_3_2_1_37_1","unstructured":"Matthew Nance Hall , Klaus-Tycho Foerster , Stefan Schmid , and Ramakrishnan Durairajan . 2021. A survey of reconfigurable optical networks . In Optical Switching and Networking (OSN) , Elsevier . Matthew Nance Hall, Klaus-Tycho Foerster, Stefan Schmid, and Ramakrishnan Durairajan. 2021. A survey of reconfigurable optical networks. In Optical Switching and Networking (OSN), Elsevier."},{"volume-title":"ACM SIGCOMM Computer Communication Review number 4.","author":"Hamedazimi Navid","key":"e_1_3_2_1_38_1","unstructured":"Navid Hamedazimi , Zafar Qazi , Himanshu Gupta , Vyas Sekar , Samir R Das , Jon P Longtin , Himanshu Shah , and Ashish Tanwer . 2014. Firefly: a reconfigurable wireless data center fabric using free-space optics . In ACM SIGCOMM Computer Communication Review number 4. Vol. 44 . ACM , 319--330. Navid Hamedazimi, Zafar Qazi, Himanshu Gupta, Vyas Sekar, Samir R Das, Jon P Longtin, Himanshu Shah, and Ashish Tanwer. 2014. Firefly: a reconfigurable wireless data center fabric using free-space optics. In ACM SIGCOMM Computer Communication Review number 4. Vol. 44. ACM, 319--330."},{"volume-title":"Reconfigurable optical networks will move super-computerdata 100x faster","author":"Hampson Michelle","key":"e_1_3_2_1_39_1","unstructured":"Michelle Hampson . 2021. Reconfigurable optical networks will move super-computerdata 100x faster . In IEEE Spectrum . Michelle Hampson. 2021. Reconfigurable optical networks will move super-computerdata 100x faster. In IEEE Spectrum."},{"volume-title":"Dynamic demand-aware link scheduling for reconfigurable datacenters","author":"Hanauer Kathrin","key":"e_1_3_2_1_40_1","unstructured":"Kathrin Hanauer , Monika Henzinger , Lara Ost , and Stefan Schmid . 2023. Dynamic demand-aware link scheduling for reconfigurable datacenters . In IEEE INFOCOM. Kathrin Hanauer, Monika Henzinger, Lara Ost, and Stefan Schmid. 2023. Dynamic demand-aware link scheduling for reconfigurable datacenters. In IEEE INFOCOM."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796921"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00140-1"},{"volume-title":"Proc. 22nd ACM Symp. on Theory of Computing (STOC), 352--358","author":"Karp Richard M.","key":"e_1_3_2_1_44_1","unstructured":"Richard M. Karp , Umesh V. Vazirani , and Vijay V. Vazirani . 1990. An optimal algorithm for on-line bipartite matching . In Proc. 22nd ACM Symp. on Theory of Computing (STOC), 352--358 . Richard M. Karp, Umesh V. Vazirani, and Vijay V. Vazirani. 1990. An optimal algorithm for on-line bipartite matching. In Proc. 22nd ACM Symp. on Theory of Computing (STOC), 352--358."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098836"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2895553"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461786"},{"volume-title":"Proceedings of the ACM Special Interest Group on Data Communication, 44--58","author":"Yuliang","key":"e_1_3_2_1_48_1","unstructured":"Yuliang Li et al. 2019. Hpcc: high precision congestion control . In Proceedings of the ACM Special Interest Group on Data Communication, 44--58 . Yuliang Li et al. 2019. Hpcc: high precision congestion control. In Proceedings of the ACM Special Interest Group on Data Communication, 44--58."},{"key":"e_1_3_2_1_49_1","volume-title":"Anderson","author":"Liu Vincent","year":"2013","unstructured":"Vincent Liu , Daniel Halperin , Arvind Krishnamurthy , and Thomas E . Anderson . 2013 . F10: A fault-tolerant engineered network. In NSDI , 399--412. Vincent Liu, Daniel Halperin, Arvind Krishnamurthy, and Thomas E. Anderson. 2013. F10: A fault-tolerant engineered network. In NSDI, 399--412."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626332"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993716"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759073"},{"volume-title":"The islip scheduling algorithm for input-queued switches","author":"McKeown Nick","key":"e_1_3_2_1_53_1","unstructured":"Nick McKeown . 1999. The islip scheduling algorithm for input-queued switches . IEEE\/ACM transactions on networking, 7, 2, 188--201. Nick McKeown. 1999. The islip scheduling algorithm for input-queued switches. IEEE\/ACM transactions on networking, 7, 2, 188--201."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000057"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"volume-title":"17th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 20), 1--18.","author":"Mellette William M","key":"e_1_3_2_1_56_1","unstructured":"William M Mellette , Rajdeep Das , Yibo Guo , Rob McGuinness , Alex C Snoeren , and George Porter . 2020. Expanding across time to deliver bandwidth efficiency and low latency . In 17th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 20), 1--18. William M Mellette, Rajdeep Das, Yibo Guo, Rob McGuinness, Alex C Snoeren, and George Porter. 2020. Expanding across time to deliver bandwidth efficiency and low latency. In 17th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 20), 1--18."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_21"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Pooria Namyar Sucha Supittayapornpong Mingyang Zhang Minlan Yu and Ramesh Govindan. 2021. A throughput-centric view of the performance of datacenter topologies. In To appear in Proceedings of the ACM SIGCOMM 2021 conference.  Pooria Namyar Sucha Supittayapornpong Mingyang Zhang Minlan Yu and Ramesh Govindan. 2021. A throughput-centric view of the performance of datacenter topologies. In To appear in Proceedings of the ACM SIGCOMM 2021 conference.","DOI":"10.1145\/3452296.3472913"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764482"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063952"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.4"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486007"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787472"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2410313"},{"key":"e_1_3_2_1_66_1","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and combinatorics","author":"Schrijver Alexander","year":"2003","unstructured":"Alexander Schrijver . 2003 . Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and combinatorics . Springer . Alexander Schrijver. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and combinatorics. Springer."},{"key":"e_1_3_2_1_67_1","unstructured":"Roy Schwartz Mohit Singh and Sina Yazdanbod. 2019. Online and offline greedy algorithms for routing with switching costs. arXiv preprint arXiv:1905.02800.  Roy Schwartz Mohit Singh and Sina Yazdanbod. 2019. Online and offline greedy algorithms for routing with switching costs. arXiv preprint arXiv:1905.02800."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787508"},{"key":"e_1_3_2_1_69_1","unstructured":"Ankit Singla Chi-Yao Hong Lucian Popa and Philip Brighten Godfrey. 2012. Jellyfish: networking data centers randomly. In NSDI 225--238.  Ankit Singla Chi-Yao Hong Lucian Popa and Philip Brighten Godfrey. 2012. Jellyfish: networking data centers randomly. In NSDI 225--238."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868447.1868455"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1364\/JOCN.379487"},{"key":"e_1_3_2_1_72_1","first-page":"3","article-title":"Costly circuits, submodular schedules and approximate carath\u00e9odory theorems","volume":"88","author":"Venkatakrishnan Shaileshh Bojja","year":"2018","unstructured":"Shaileshh Bojja Venkatakrishnan , Mohammad Alizadeh , and Pramod Viswanath . 2018 . Costly circuits, submodular schedules and approximate carath\u00e9odory theorems . Queueing Systems , 88 , 3 -- 4 , 311--347. Shaileshh Bojja Venkatakrishnan, Mohammad Alizadeh, and Pramod Viswanath. 2018. Costly circuits, submodular schedules and approximate carath\u00e9odory theorems. Queueing Systems, 88, 3--4, 311--347.","journal-title":"Queueing Systems"},{"key":"e_1_3_2_1_73_1","first-page":"327","article-title":"C-through: part-time optics in data centers","volume":"41","author":"Wang Guohui","year":"2011","unstructured":"Guohui Wang , David G Andersen , Michael Kaminsky , Konstantina Papagiannaki , TS Ng , Michael Kozuch , and Michael Ryan . 2011 . C-through: part-time optics in data centers . ACM SIGCOMM Computer Communication Review , 41 , 4, 327 -- 338 . Guohui Wang, David G Andersen, Michael Kaminsky, Konstantina Papagiannaki, TS Ng, Michael Kozuch, and Michael Ryan. 2011. C-through: part-time optics in data centers. ACM SIGCOMM Computer Communication Review, 41, 4, 327--338.","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658943"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.5555\/127787.127832"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01189992"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3579449"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377761"}],"event":{"name":"SC '23: International Conference for High Performance Computing, Networking, Storage and Analysis","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"],"location":"Denver CO USA","acronym":"SC '23"},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3581784.3607057","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3581784.3607057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:23Z","timestamp":1750178183000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3581784.3607057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,11]]},"references-count":78,"alternative-id":["10.1145\/3581784.3607057","10.1145\/3581784"],"URL":"https:\/\/doi.org\/10.1145\/3581784.3607057","relation":{},"subject":[],"published":{"date-parts":[[2023,11,11]]},"assertion":[{"value":"2023-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}