{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:43:14Z","timestamp":1779896594351,"version":"3.53.1"},"reference-count":75,"publisher":"Association for Computing Machinery (ACM)","issue":"1","funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["390696704"],"award-info":[{"award-number":["390696704"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2026,3,31]]},"abstract":"<jats:p>\n                    Bigraphs provide a versatile modeling framework by combining spatial and connectivity relationships, making them valuable in graph transformations, model transformations, the design of programming languages, and the simulation of reactive systems. However, practical approaches to bigraph rewriting often rely on constraint satisfaction or SAT-solving techniques, which can be computationally intensive and limit usability in large-scale applications. This article addresses the challenge of efficient bigraph rewriting by leveraging the graph transformation engine\n                    <jats:sc>GrGen.NET<\/jats:sc>\n                    . We propose a novel approach to translate bigraphical rules into SPO-based graph transformation rules, enabling fast bigraph rewriting. Our solution is implemented in the tool\n                    <jats:sc>BiGGer<\/jats:sc>\n                    , which includes a command-line interface and a Java library for seamless integration. Through experimental evaluation, we demonstrate the correctness of our approach and its ability to significantly improve execution efficiency. Additionally, we implemented tracking rules that maintain semantic fidelity during the translation process and enable identity tracing across reactions, adding a feature to bigraphs that extends their applicability beyond static analysis.\n                  <\/jats:p>","DOI":"10.1145\/3736704","type":"journal-article","created":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T07:12:37Z","timestamp":1749107557000},"page":"1-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Improving Bigraph Rewriting with GrGen.NET to Enable Efficient System Simulation"],"prefix":"10.1145","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6334-2356","authenticated-orcid":false,"given":"Dominik","family":"Grzelak","sequence":"first","affiliation":[{"name":"Chair of Software Technology, Technische Universit\u00e4t Dresden","place":["Dresden, Germany"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-8346-1749","authenticated-orcid":false,"given":"Markus","family":"Hamann","sequence":"additional","affiliation":[{"name":"Chair of Software Technology, Technische Universit\u00e4t Dresden","place":["Dresden, Germany"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CP.2021.15"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51372-6_1"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","unstructured":"Blair Archibald Muffy Calder Michele Sevegnani and Mengwei Xu. 2022. Modelling and verifying BDI agents with bigraphs. Science of Computer Programming 215 (2022) 102760. DOI:10.1016\/j.scico.2021.102760","DOI":"10.1016\/j.scico.2021.102760"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-33170-1_15"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","unstructured":"Blair Archibald G\u00e9za Kulcs\u00e1r and Michele Sevegnani. 2021b. A tale of two graph models: A case study in wireless sensor networks. Formal Aspects of Computing 33 6 (2021) 1249\u20131277. DOI:10.1007\/s00165-021-00558-z","DOI":"10.1007\/s00165-021-00558-z"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-64285-2_2"},{"key":"e_1_3_3_8_1","first-page":"33","volume-title":"CTIT Workshop Proceedings WP 2010-05","volume":"3","author":"Bacci Giorgio","year":"2010","unstructured":"Giorgio Bacci and Davide Grohmann. 2010. On decidability of bigraphical sortings. In CTIT Workshop Proceedings WP 2010-05 (Enschede, Netherlands, 2010), Vol. 3. 33\u201347. Retrieved from https:\/\/vbn.aau.dk\/en\/publications\/on-decidability-of-bigraphical-sortings"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03741-2_28"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45917-1_2"},{"key":"e_1_3_3_11_1","unstructured":"Roswitha Bardohl Hartmut Ehrig Juan Lara Olga Runge Gabi Taentzer and Ingo Weinhold. 2003. Node Type Inheritance Concept for Typed Graph Transformation."},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","unstructured":"Roswitha Bardohl Hartmut Ehrig Juan de Lara and Gabriele Taentzer. 2004. Integrating meta-modelling aspects with graph transformation for efficient visual language definition and model manipulation. In Fundamental Approaches to Software Engineering 7th International Conference FASE 2004 Held as Part of the Joint European Conferences on Theory and Practice of Software ETAPS 2004 Barcelona Spain March 29 - april 2 2004 Proceedings Michel Wermelinger and Tiziana Margaria (Eds.). (Lecture Notes in Computer Science) Springer 214\u2013228. DOI:10.1007\/978-3-540-24721-0_16","DOI":"10.1007\/978-3-540-24721-0_16"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","unstructured":"Enrico Biermann Claudia Ermel and Gabriele Taentzer. 2012. Formal foundation of consistent EMF model transformations by algebraic graph transformation. Software & Systems Modeling 11 2 (2012) 227\u2013250. DOI:10.1007\/s10270-011-0199-7","DOI":"10.1007\/s10270-011-0199-7"},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","unstructured":"Lars Birkedal Troels Christoffer Damgaard Arne John Glenstrup and Robin Milner. 2007. Matching of bigraphs. Electronic Notes in Theoretical Computer Science 175 4 (2007) 3\u201319. DOI:10.1016\/j.entcs.2007.04.013","DOI":"10.1016\/j.entcs.2007.04.013"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","unstructured":"Filippo Bonchi and Ugo Montanari. 2008. A coalgebraic theory of reactive systems. Electronic Notes in Theoretical Computer Science 209 (2008) 201\u2013215. DOI:10.1016\/j.entcs.2009.02.012","DOI":"10.1016\/j.entcs.2009.02.012"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","unstructured":"Muffy Calder and Michele Sevegnani. 2014. Modelling IEEE 802.11 CSMA\/CA RTS\/CTS with stochastic bigraphs with sharing. Formal Aspects of Computing 26 3 (2014) 537\u2013561. DOI:10.1007\/s00165-012-0270-3","DOI":"10.1007\/s00165-012-0270-3"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","unstructured":"Gian Luca Cattani James J. Leifer and Robin Milner. 2000. Contexts and Embeddings for Closed Shallow Action Graphs. University of Cambridge Computer Laboratory. DOI:10.48456\/tr-496","DOI":"10.48456\/tr-496"},{"key":"e_1_3_3_18_1","unstructured":"Prud\u2019homme Charles Fages Jean-Guillaume and Lorca Xavier. 2017. Choco Documentation. Retrieved from http:\/\/www.choco-solver.org"},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51372-6_3"},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","unstructured":"Alessio Chiapperini Marino Miculan and Marco Peressotti. 2022. Computing (optimal) embeddings of directed bigraphs. Science of Computer Programming 221 (2022) 102842. DOI:10.1016\/j.scico.2022.102842","DOI":"10.1016\/j.scico.2022.102842"},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21145-9_3"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812384720_0003"},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","unstructured":"Piotr Cybulski and Zbigniew Zieli\u0144ski. 2021. UAV swarms behavior modeling using tracking bigraphical reactive systems. Sensors 21 2 (2021) 622. DOI:10.3390\/s21020622","DOI":"10.3390\/s21020622"},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","unstructured":"K. Czarnecki and S. Helsen. 2006. Feature-based survey of model transformation approaches. IBM Systems Journal 45 3 (2006) 621\u2013645. DOI:10.1147\/sj.453.0621","DOI":"10.1147\/sj.453.0621"},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","unstructured":"Troels C. Damgaard Arne J. Glenstrup Lars Birkedal and Robin Milner. 2013. An inductive characterization of matching in binding bigraphs. Formal Aspects of Computing 25 2 (2013) 257\u2013288. DOI:10.1007\/s00165-011-0184-5","DOI":"10.1007\/s00165-011-0184-5"},{"key":"e_1_3_3_26_1","volume-title":"Sortings & Bigraphs","author":"Debois S\u00f8ren","year":"2007","unstructured":"S\u00f8ren Debois. 2007. Sortings & Bigraphs. Ph. D. Dissertation. IT University of Copenhagen."},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812562494_0038"},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31188-2"},{"key":"e_1_3_3_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47980-3"},{"key":"e_1_3_3_30_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812384720_0004"},{"key":"e_1_3_3_31_1","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation: Vol. 3: Concurrency, Parallelism, and Distribution","author":"Ehrig H.","year":"1999","unstructured":"H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg (Eds.). 1999. Handbook of Graph Grammars and Computing by Graph Transformation: Vol. 3: Concurrency, Parallelism, and Distribution. World Scientific Publishing Co., Inc."},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","unstructured":"Alexander John Faithfull Gian Perrone and Thomas T. Hildebrandt. 2013. Big red: A development environment for bigraphs. Electronic Communications of the EASST 61 0 (2013) 1\u201310. DOI:10.14279\/tuj.eceasst.61.835","DOI":"10.14279\/tuj.eceasst.61.835"},{"key":"e_1_3_3_33_1","doi-asserted-by":"crossref","unstructured":"Brendan Fong and David I. Spivak. 2018. Seven sketches in compositionality: An invitation to applied category theory. Retrieved from https:\/\/arxiv.org\/abs\/1803.05316","DOI":"10.1017\/9781108668804"},{"key":"e_1_3_3_34_1","doi-asserted-by":"publisher","unstructured":"Amal Gassara. 2016. Encoding bigraphical reactive systems into graph transformation systems. Electronic Notes in Discrete Mathematics 55 (2016) 207\u2013210. DOI:10.1016\/j.endm.2016.10.051","DOI":"10.1016\/j.endm.2016.10.051"},{"key":"e_1_3_3_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3019612.3019802"},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","unstructured":"Amal Gassara Ismael Bouassida Rodriguez Mohamed Jmaiel and Khalil Drira. 2019. Executing bigraphical reactive systems. Discrete Applied Mathematics 253 (2019) 73\u201392. DOI:10.1016\/j.dam.2018.07.006","DOI":"10.1016\/j.dam.2018.07.006"},{"key":"e_1_3_3_37_1","first-page":"383","volume-title":"Graph Transformations (Lecture Notes in Computer Science)","author":"Gei\u00df Rubino","year":"2006","unstructured":"Rubino Gei\u00df, Gernot Veit Batz, Daniel Grund, Sebastian Hack, and Adam Szalkowski. 2006. GrGen: A fast SPO-based graph rewriting tool. In Graph Transformations (Lecture Notes in Computer Science). Andrea Corradini, Hartmut Ehrig, Ugo Montanari, Leila Ribeiro, and Grzegorz Rozenberg (Eds.). Springer Berlin, 383\u2013397."},{"key":"e_1_3_3_38_1","doi-asserted-by":"publisher","DOI":"10.5445\/IR\/1000007369"},{"key":"e_1_3_3_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89020-1_38"},{"key":"e_1_3_3_40_1","unstructured":"Arne John Glenstrup Troels Christoffer Damgaard Lars Birkedal and Espen H\u00f8jsgaard. 2010. An Implementation of Bigraph Matching (TR 2010-135 ed.). IT-Universitetet i K\u00f8benhavn Denmark."},{"key":"e_1_3_3_41_1","volume-title":"Bigraphical Domain-specific Language (BDSL): User Manual","author":"Grzelak Dominik","year":"2021","unstructured":"Dominik Grzelak. 2021. Bigraphical Domain-specific Language (BDSL): User Manual. Technical Report. Technische Universit\u00e4t Dresden. Retrieved from https:\/\/nbn-resolving.org\/urn:nbn:de:bsz:14-qucosa2-752170"},{"key":"e_1_3_3_42_1","unstructured":"Dominik Grzelak. 2023. Bigraph Ecore Metamodel (BEM): An EMOF-Compliant Specification for Bigraphs. Retrieved from https:\/\/zenodo.org\/records\/10043063"},{"key":"e_1_3_3_43_1","doi-asserted-by":"publisher","unstructured":"Dominik Grzelak. 2024a. BiGGer: A model transformation tool written in Java for bigraph rewriting in GrGen.NET. Journal of Open Source Software 9 98 (2024) 6491. DOI:10.21105\/joss.06491","DOI":"10.21105\/joss.06491"},{"key":"e_1_3_3_44_1","volume-title":"Model-Oriented Programming with Bigraphical Reactive Systems: Theory and Implementation","author":"Grzelak Dominik","year":"2024","unstructured":"Dominik Grzelak. 2024b. Model-Oriented Programming with Bigraphical Reactive Systems: Theory and Implementation. Ph. D. Dissertation. Technische Universit\u00e4t Dresden. Retrieved from https:\/\/nbn-resolving.org\/urn:nbn:de:bsz:14-qucosa2-910504"},{"key":"e_1_3_3_45_1","doi-asserted-by":"publisher","unstructured":"Dominik Grzelak and Uwe A\u00dfmann. 2021. A canonical string encoding for pure bigraphs. SN Computer Science 2 4 (2021) 246. DOI:10.1007\/s42979-021-00552-5","DOI":"10.1007\/s42979-021-00552-5"},{"key":"e_1_3_3_46_1","unstructured":"Dominik Grzelak Martin Lindner Mikhail Belov Uwe A\u00dfmann Oleksandr Husak and Hartmut Fricke. 2024. A Bigraphical Framework for Modeling and Simulation of UAV-based Inspection Scenarios. Preprint (Revised). Technische Universit\u00e4t Dresden. Retrieved from https:\/\/nbn-resolving.org\/urn:nbn:de:bsz:14-qucosa2-908655"},{"key":"e_1_3_3_47_1","volume-title":"Bigraphical Languages and Their Simulation","author":"H\u00f8jsgaard Espen","year":"2012","unstructured":"Espen H\u00f8jsgaard. 2012. Bigraphical Languages and Their Simulation. Ph. D. Dissertation. IT University of Copenhagen. Retrieved from https:\/\/core.ac.uk\/download\/pdf\/50526631.pdf"},{"key":"e_1_3_3_48_1","volume-title":"GrGen.NET","author":"Jakumeit Edgar","year":"2023","unstructured":"Edgar Jakumeit. 2023. GrGen.NET. Retrieved from https:\/\/grgen.de\/"},{"key":"e_1_3_3_49_1","unstructured":"Edgar Jakumeit Jakob Blomer and Rubino Gei\u00df. 2023. The GrGen.NET user manual: Refers to GrGen.NET Release 6.7. Retrieved from https:\/\/www.grgen.de\/GrGenNET-Manual.pdf"},{"key":"e_1_3_3_50_1","doi-asserted-by":"publisher","unstructured":"Edgar Jakumeit Sebastian Buchwald and Moritz Kroll. 2010. GrGen.NET. International Journal on Software Tools for Technology Transfer 12 3 (2010) 263\u2013271. DOI:10.1007\/s10009-010-0148-8","DOI":"10.1007\/s10009-010-0148-8"},{"key":"e_1_3_3_51_1","doi-asserted-by":"publisher","unstructured":"Timo Kehrer Christos Tsigkanos and Carlo Ghezzi. 2016. An EMOF-compliant abstract syntax for bigraphs. Electronic Proceedings in Theoretical Computer Science 231 (2016) 16\u201330. DOI:10.4204\/EPTCS.231.2","DOI":"10.4204\/EPTCS.231.2"},{"key":"e_1_3_3_52_1","unstructured":"G. M. Kelly. 2005. Basic concepts of enriched category theory. Reprints in Theory and Applications of Categories10 (2005) vi+137. Retrieved from http:\/\/www.tac.mta.ca\/tac\/reprints\/articles\/10\/tr10abs.html"},{"key":"e_1_3_3_53_1","doi-asserted-by":"publisher","unstructured":"Jean Krivine Robin Milner and Angelo Troina. 2008. Stochastic bigraphs. Electronic Notes in Theoretical Computer Science 218 (2008) 73\u201396. DOI:10.1016\/j.entcs.2008.10.006","DOI":"10.1016\/j.entcs.2008.10.006"},{"key":"e_1_3_3_54_1","volume-title":"yComp","author":"Kroll Moritz","year":"2007","unstructured":"Moritz Kroll, Michael Beck, Rubino Gei\u00df, Sebastian Hack, and Philipp Lei\u00df. 2007. yComp. Retrieved from https:\/\/pp.ipd.kit.edu\/firm\/yComp.html"},{"key":"e_1_3_3_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-75396-6_5"},{"key":"e_1_3_3_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44618-4_19"},{"key":"e_1_3_3_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-43345-0_7"},{"key":"e_1_3_3_58_1","doi-asserted-by":"publisher","unstructured":"Michael L\u00f6we. 1993. Algebraic approach to single-pushout graph transformation. Theoretical Computer Science 109 1 (1993) 181\u2013224. DOI:10.1016\/0304-3975(93)90068-5","DOI":"10.1016\/0304-3975(93)90068-5"},{"key":"e_1_3_3_59_1","unstructured":"Marino Miculan and Marco Peressotti. 2014. A CSP Implementation of the Bigraph Embedding Problem. (2014). arXiv:1412.1042. Retrieved from https:\/\/arxiv.org\/abs\/1412.1042"},{"key":"e_1_3_3_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27755-2_19"},{"key":"e_1_3_3_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31847-7_20"},{"key":"e_1_3_3_62_1","doi-asserted-by":"publisher","unstructured":"Robin Milner. 2006. Pure bigraphs: Structure and dynamics. Information and Computation 204 1 (2006) 60\u2013122. DOI:10.1016\/j.ic.2005.07.003","DOI":"10.1016\/j.ic.2005.07.003"},{"key":"e_1_3_3_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04081-8_3"},{"key":"e_1_3_3_64_1","doi-asserted-by":"publisher","DOI":"10.5555\/1540607"},{"key":"e_1_3_3_65_1","volume-title":"Domain-Specific Modelling Languages in Bigraphs","author":"Perrone Gian","year":"2013","unstructured":"Gian Perrone. 2013. Domain-Specific Modelling Languages in Bigraphs. Ph. D. Dissertation. IT University of Copenhagen."},{"key":"e_1_3_3_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30203-2_17"},{"key":"e_1_3_3_67_1","doi-asserted-by":"publisher","unstructured":"Vladimiro Sassone and Pawel Sobocinski. 2003. Deriving bisimulation congruences: 2-Categories vs. precategories. BRICS Report Series 10 1 (Jan.2003). DOI:10.7146\/brics.v10i1.21772","DOI":"10.7146\/brics.v10i1.21772"},{"key":"e_1_3_3_68_1","doi-asserted-by":"publisher","unstructured":"Vladimiro Sassone and Pawel Soboci\u0144ski. 2002. Deriving bisimulation congruences: A 2-Categorical approach. Electronic Notes in Theoretical Computer Science 68 2 (2002) 105\u2013123. DOI:10.1016\/S1571-0661(05)80367-6","DOI":"10.1016\/S1571-0661(05)80367-6"},{"key":"e_1_3_3_69_1","doi-asserted-by":"publisher","unstructured":"Michele Sevegnani and Muffy Calder. 2015. Bigraphs with sharing. Theoretical Computer Science 577 (2015) 43\u201373. DOI:10.1016\/j.tcs.2015.02.011","DOI":"10.1016\/j.tcs.2015.02.011"},{"key":"e_1_3_3_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41540-6_27"},{"key":"e_1_3_3_71_1","first-page":"27","volume-title":"A SAT Based Algorithm for the Matching Problem in Bigraphs with Sharing","author":"Sevegnani Michele","year":"2010","unstructured":"Michele Sevegnani, Chris Unsworth, and Muffy Calder. 2010. A SAT Based Algorithm for the Matching Problem in Bigraphs with Sharing. Technical Report TR-2010-311. Department of Computing Science, University of Glasgow. 27 pages."},{"key":"e_1_3_3_72_1","volume-title":"EMF: Eclipse Modeling Framework (2nd revised edition ed.)","author":"Steinberg Dave","year":"2008","unstructured":"Dave Steinberg, Frank Budinsky, and Marcelo Paternostro. 2008. EMF: Eclipse Modeling Framework (2nd revised edition ed.). Addison-Wesley Professional."},{"key":"e_1_3_3_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43916-3"},{"key":"e_1_3_3_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31984-9_6"},{"key":"e_1_3_3_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/VLHCC.2005.23"},{"key":"e_1_3_3_76_1","doi-asserted-by":"publisher","unstructured":"Shane \u00d3 Conch\u00fair. 2009. Kind bigraphs. Electronic Notes in Theoretical Computer Science 225 (2009) 361\u2013377. DOI:10.1016\/j.entcs.2008.12.086","DOI":"10.1016\/j.entcs.2008.12.086"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3736704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T11:48:45Z","timestamp":1771242525000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3736704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,13]]},"references-count":75,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3,31]]}},"alternative-id":["10.1145\/3736704"],"URL":"https:\/\/doi.org\/10.1145\/3736704","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,13]]},"assertion":[{"value":"2024-03-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-17","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}