{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:02:57Z","timestamp":1759334577073,"version":"build-2065373602"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T00:00:00Z","timestamp":1725062400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T00:00:00Z","timestamp":1725062400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Bergen"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stud Logica"],"published-print":{"date-parts":[[2025,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Communication within groups of agents has been lately the focus of research in dynamic epistemic logic. This paper studies a recently introduced form of <jats:italic>partial<\/jats:italic> (more precisely, <jats:italic>topic-based<\/jats:italic>) <jats:italic>communication<\/jats:italic>. This type of communication allows for modelling scenarios of multi-agent collaboration and negotiation, and it is particularly well-suited for situations in which sharing all information is not feasible\/advisable. The paper can be divided into two parts. In the first part, we present results on invariance and complexity of model checking. Moreover, we compare partial communication with the public announcement and arrow update settings in terms of both language-expressivity and update-expressivity. Regarding the former, the three settings are equivalent, their languages being equally expressive. Regarding the latter, all three modes of communication are incomparable in terms of update-expressivity. In the second part, we shift our attention to <jats:italic>strategic<\/jats:italic> topic-based communication. We do so by extending the language with a modality that quantifies over the topics the agents can \u2018talk about\u2019, thus allowing a form of <jats:italic>arbitrary partial communication<\/jats:italic>. For this new framework, we provide a complete axiomatisation, showing also that the new language\u2019s model checking problem is <jats:italic>PSPACE<\/jats:italic>-complete. Finally, we argue that, in terms of expressivity, this new language of arbitrary partial communication is incomparable to that of arbitrary public announcements and also to that of arbitrary arrow updates.<\/jats:p>","DOI":"10.1007\/s11225-024-10119-z","type":"journal-article","created":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T11:02:17Z","timestamp":1725102137000},"page":"1195-1243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Topic-Based Communication Between Agents"],"prefix":"10.1007","volume":"113","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4195-8189","authenticated-orcid":false,"given":"Rustam","family":"Galimullin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4457-1414","authenticated-orcid":false,"given":"Fernando R.","family":"Vel\u00e1zquez-Quesada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,31]]},"reference":[{"issue":"1","key":"10119_CR1","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/S10458-023-09601-0","volume":"37","author":"T \u00c5gotnes","year":"2023","unstructured":"\u00c5gotnes, T., and R. Galimullin, Quantifying over information change with common knowledge, Autonomous Agents and Multi-Agent Systems 37(1):40, 2023. https:\/\/doi.org\/10.1007\/S10458-023-09601-0.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"10119_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2017.07.002","volume":"252","author":"T \u00c5gotnes","year":"2017","unstructured":"\u00c5gotnes, T., and Y. N. W\u00e1ng. Resolving distributed knowledge, Artificial Intelligence 252:1\u201321, 2017. https:\/\/doi.org\/10.1016\/j.artint.2017.07.002.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10119_CR3","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jal.2008.12.002","volume":"8","author":"T \u00c5gotnes","year":"2010","unstructured":"\u00c5gotnes, T., P. Balbiani, H. van Ditmarsch, and P. Seban, Group announcement logic, Journal of Applied Logic 8(1):62\u201381, 2010. https:\/\/doi.org\/10.1016\/j.jal.2008.12.002.","journal-title":"Journal of Applied Logic"},{"key":"10119_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10849-022-09355-0","volume":"31","author":"T \u00c5gotnes","year":"2022","unstructured":"\u00c5gotnes, T., N. Alechina, and R. Galimullin, Logics with group announcements and distributed knowledge: Completeness and expressive power, Journal of Logic, Language and Information 31:141\u2013166, 2022. https:\/\/doi.org\/10.1007\/s10849-022-09355-0.","journal-title":"Journal of Logic, Language and Information"},{"issue":"4","key":"10119_CR5","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s10849-021-09339-6","volume":"30","author":"N Alechina","year":"2021","unstructured":"Alechina, N., H. van Ditmarsch, R. Galimullin, and T. Wang, Verification and strategy synthesis for coalition announcement logic, Journal of Logic, Language and Information 30(4):671\u2013700, 2021. https:\/\/doi.org\/10.1007\/s10849-021-09339-6.","journal-title":"Journal of Logic, Language and Information"},{"issue":"4","key":"10119_CR6","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1093\/JIGPAL\/JZV020","volume":"23","author":"C Areces","year":"2015","unstructured":"Areces, C., R. Fervari, and G. Hoffmann, Relation-changing modal operators, Logic Journal of the IGPL 23(4):601\u2013627, 2015. https:\/\/doi.org\/10.1093\/JIGPAL\/JZV020.","journal-title":"Logic Journal of the IGPL"},{"issue":"2","key":"10119_CR7","first-page":"65","volume":"8","author":"P Balbiani","year":"2015","unstructured":"Balbiani, P., and H. van Ditmarsch, A simple proof of the completeness of APAL, Studies in Logic 8(2):65\u201378, 2015.","journal-title":"Studies in Logic"},{"issue":"3","key":"10119_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1017\/S1755020308080210","volume":"1","author":"P Balbiani","year":"2008","unstructured":"Balbiani, P., A. Baltag, H. van Ditmarsch, A. Herzig, T. Hoshi, and T. de\u00a0Lima, \u2019Knowable\u2019 as \u2019known after an announcement\u2019, The Review of Symbolic Logic 1(3):305\u2013334, 2008. https:\/\/doi.org\/10.1017\/S1755020308080210.","journal-title":"The Review of Symbolic Logic"},{"key":"10119_CR9","unstructured":"Baltag, A., What is del good for? Workshop on Logic, Rationality and Intelligent Interaction, 2010. http:\/\/ai.stanford.edu\/~epacuit\/lograt\/esslli2010-slides\/copenhagenesslli.pdf."},{"key":"10119_CR10","doi-asserted-by":"publisher","unstructured":"Baltag, A., and S. Smets, Learning what others know, in E. Albert, and L. Kov\u00e1cs, (eds.), Proceedings of the 23rd LPAR, vol. 73 of EPiC Series in Computing, EasyChair, 2020, pp. 90\u2013119. https:\/\/doi.org\/10.29007\/plm4.","DOI":"10.29007\/plm4"},{"key":"10119_CR11","unstructured":"Baltag, A., and S. Smets, Learning what others know, CoRR, arXiv:2109.07255, 2021."},{"key":"10119_CR12","unstructured":"Baltag, A., L.\u00a0S. Moss, and S. Solecki, The logic of public announcements and common knowledge and private suspicions, in I. Gilboa, (ed.), Proceedings of the 7th TARK, 1998, pp. 43\u201356."},{"key":"10119_CR13","doi-asserted-by":"publisher","unstructured":"Blackburn, P., M. de\u00a0Rijke, and Y. Venema, Modal logic, no. 53 of Cambridge Tracts in Theoretical Computer Science, CUP, 2001. https:\/\/doi.org\/10.1017\/CBO9781107050884.","DOI":"10.1017\/CBO9781107050884"},{"key":"10119_CR14","unstructured":"Danto, A.\u00a0C., On knowing that we know, in [43], pp. 32\u201353."},{"key":"10119_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-9906-9","author":"B de Bruin","year":"2010","unstructured":"de Bruin, B., Explaining Games: The Epistemic Programme in Game Theory, Springer, 2010. https:\/\/doi.org\/10.1007\/978-1-4020-9906-9.","journal-title":"Springer"},{"key":"10119_CR16","doi-asserted-by":"publisher","unstructured":"Dolgorukov, V., and M. Gladyshev, Dynamic epistemic logic for budget-constrained agents, in C. Areces, and D. Costa, (eds.), Proceedings of the 4th DaL\u00ed, vol. 13780 of LNCS, Springer, 2022, pp. 56\u201372. https:\/\/doi.org\/10.1007\/978-3-031-26622-5_4.","DOI":"10.1007\/978-3-031-26622-5_4"},{"key":"10119_CR17","doi-asserted-by":"publisher","unstructured":"Dolgorukov, V., R. Galimullin, and M. Gladyshev, Dynamic epistemic logic of resource bounded information mining agents, in N. Alechina, V. Dignum, M. Dastani, and J.\u00a0S. Sichman, (eds.), Proceedings of the 23rd AAMAS, ACM, 2024. https:\/\/doi.org\/10.48550\/ARXIV.2401.13369.","DOI":"10.48550\/ARXIV.2401.13369"},{"issue":"2","key":"10119_CR18","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1145\/128749.150945","volume":"39","author":"R Fagin","year":"1992","unstructured":"Fagin, R., J.\u00a0Y. Halpern, and M.\u00a0Y. Vardi, What can machines know? On the properties of knowledge in distributed systems, Journal of the ACM 39(2):328\u2013376, 1992. https:\/\/doi.org\/10.1145\/128749.150945.","journal-title":"Journal of the ACM"},{"key":"10119_CR19","doi-asserted-by":"crossref","unstructured":"Fagin, R., J.\u00a0Y. Halpern, Y. Moses, and M.\u00a0Y. Vardi. Reasoning about knowledge, MIT Press, 1995.","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"10119_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jlamp.2019.06.005","volume":"108","author":"R Fervari","year":"2019","unstructured":"Fervari, R., and F.\u00a0R. Vel\u00e1zquez-Quesada, Introspection as an action in relational models, Journal of Logical and Algebraic Methods in Programming 108:1\u201323, 2019. https:\/\/doi.org\/10.1016\/j.jlamp.2019.06.005.","journal-title":"Journal of Logical and Algebraic Methods in Programming"},{"issue":"3","key":"10119_CR21","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10849-020-09327-2","volume":"30","author":"R Galimullin","year":"2021","unstructured":"Galimullin, R., Coalition and relativised group announcement logic, Journal of Logic, Language and Information 30(3):451\u2013489, 2021. https:\/\/doi.org\/10.1007\/s10849-020-09327-2.","journal-title":"Journal of Logic, Language and Information"},{"key":"10119_CR22","doi-asserted-by":"publisher","unstructured":"Galimullin, R., and T. \u00c5gotnes, Quantified announcements and common knowledge, in F. Dignum, A. Lomuscio, U. Endriss, and A. Now\u00e9, (eds.), Proceedings of the 20th AAMAS, ACM, 2021, pp. 528\u2013536. https:\/\/doi.org\/10.5555\/3463952.3464018.","DOI":"10.5555\/3463952.3464018"},{"key":"10119_CR23","doi-asserted-by":"publisher","unstructured":"Galimullin, R., and F.\u00a0R. Vel\u00e1zquez-Quesada, (Arbitrary) partial communication, in N. Agmon, B.\u00a0An, A. Ricci, and W. Yeoh, (eds.), Proceedings of the 22nd AAMAS, ACM, 2023, pp. 400\u2013408. https:\/\/doi.org\/10.5555\/3545946.3598663.","DOI":"10.5555\/3545946.3598663"},{"issue":"2","key":"10119_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1008222603071","volume":"6","author":"J Gerbrandy","year":"1997","unstructured":"Gerbrandy, J., and W. Groeneveld, Reasoning about information change, Journal of Logic, Language, and Information 6(2):147\u2013196, 1997. https:\/\/doi.org\/10.1023\/A:1008222603071.","journal-title":"Journal of Logic, Language, and Information"},{"key":"10119_CR25","doi-asserted-by":"publisher","unstructured":"Goldblatt, R., Axiomatising the Logic of Computer Programming, vol. 130 of LNCS, Springer, 1982. https:\/\/doi.org\/10.1007\/BFb0022481.","DOI":"10.1007\/BFb0022481"},{"key":"10119_CR26","doi-asserted-by":"publisher","unstructured":"Halpern, J. Y., and Y. Moses, Knowledge and common knowledge in a distributed environments, in Proceedings of the 3rd PODC, ACM, 1984, pp. 50\u201361. https:\/\/doi.org\/10.1145\/800222.806735.","DOI":"10.1145\/800222.806735"},{"key":"10119_CR27","unstructured":"Halpern, J.\u00a0Y., and Y. Moses, A guide to the modal logics of knowledge and belief: Preliminary draft, in A.\u00a0K. Joshi, (ed.), Proceedings of the 9th IJCAI, Morgan Kaufmann, 1985, pp. 480\u2013490. http:\/\/ijcai.org\/Proceedings\/85-1\/Papers\/094.pdf."},{"issue":"3","key":"10119_CR28","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"JY Halpern","year":"1990","unstructured":"Halpern, J. Y., and Y. Moses, Knowledge and common knowledge in a distributed environment, Journal of the ACM 37(3):549\u2013587, 1990. https:\/\/doi.org\/10.1145\/79147.79161.","journal-title":"Journal of the ACM"},{"issue":"2","key":"10119_CR29","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"JY Halpern","year":"1992","unstructured":"Halpern, J. Y., and Y. Moses, A guide to completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence 54(2):319\u2013379, 1992. https:\/\/doi.org\/10.1016\/0004-3702(92)90049-4.","journal-title":"Artificial Intelligence"},{"key":"10119_CR30","doi-asserted-by":"publisher","unstructured":"Harel, D., D. Kozen, and J. Tiuryn, Dynamic Logic, MIT Press, 2000. https:\/\/doi.org\/10.7551\/mitpress\/2516.001.0001.","DOI":"10.7551\/mitpress\/2516.001.0001"},{"issue":"1","key":"10119_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11098-005-4068-5","volume":"128","author":"VF Hendricks","year":"2006","unstructured":"Hendricks, V. F., Introduction: 8 Bridges between Formal and Mainstream Epistemology, Philosophical Studies 128(1):1\u20135, 2006.","journal-title":"Philosophical Studies"},{"issue":"1","key":"10119_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00455091.1977.10716173","volume":"7","author":"R Hilpinen","year":"1977","unstructured":"Hilpinen, R., Remarks on personal and impersonal knowledge, Canadian Journal of Philosophy 7(1):1\u20139, 1977. https:\/\/doi.org\/10.1080\/00455091.1977.10716173.","journal-title":"Canadian Journal of Philosophy"},{"key":"10119_CR33","unstructured":"Hintikka, J., Knowledge and Belief, Cornell University Press, 1962."},{"issue":"1","key":"10119_CR34","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"PC Kanellakis","year":"1990","unstructured":"Kanellakis, P.\u00a0C., and S.\u00a0A. Smolka, CCS expressions, finite state processes, and three problems of equivalence, Information and Computation 86(1):43\u201368, 1990. https:\/\/doi.org\/10.1016\/0890-5401(90)90025-D.","journal-title":"Information and Computation"},{"issue":"4","key":"10119_CR35","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1017\/S1755020311000189","volume":"4","author":"B Kooi","year":"2011","unstructured":"Kooi, B., and B. Renne, Arrow update logic, The Review of Symbolic Logic 4(4):536\u2013559, 2011. https:\/\/doi.org\/10.1017\/S1755020311000189.","journal-title":"The Review of Symbolic Logic"},{"key":"10119_CR36","unstructured":"Kuijer, L\u00a0B., An arrow-based dynamic logic of norms, in J. Gutierrez, F. Mogavero, A. Murano, and M. Wooldridge, (eds.), Proceedings of the 3rd SR, 2015, pp. 1\u201311."},{"key":"10119_CR37","unstructured":"Lemmon, E.\u00a0J., If I know, do I know?, in [43], pp. 54\u201383."},{"key":"10119_CR38","doi-asserted-by":"publisher","unstructured":"Lutz, C., Complexity and succinctness of public announcement logic, in H. Nakashima, M.\u00a0P. Wellman, G. Weiss, and P. Stone, (eds.), Proceedings of the 5th AAMAS, ACM, 2006, pp. 137\u2013143. https:\/\/doi.org\/10.1145\/1160633.1160657.","DOI":"10.1145\/1160633.1160657"},{"key":"10119_CR39","doi-asserted-by":"publisher","unstructured":"Meyer, J.-J. C., and W. van\u00a0der Hoek, Epistemic Logic for AI and Computer Science, CUP, 1995. https:\/\/doi.org\/10.1017\/CBO9780511569852.","DOI":"10.1017\/CBO9780511569852"},{"key":"10119_CR40","unstructured":"Plaza, J. A., Logics of public communications, in M.\u00a0L. Emrich, M.\u00a0S. Pfeifer, M.\u00a0Hadzikadic, and Z.\u00a0W. Ras, (eds.), Proceedings of the 4th ISMIS, 1989, pp. 201\u2013216."},{"key":"10119_CR41","unstructured":"Roelofsen, F., Bisimulation and distributed knowledge revisited, https:\/\/projects.illc.uva.nl\/lgc\/papers\/d-know.pdf, 2005."},{"issue":"2","key":"10119_CR42","doi-asserted-by":"publisher","first-page":"255","DOI":"10.3166\/jancl.17.255-273","volume":"17","author":"F Roelofsen","year":"2007","unstructured":"Roelofsen, F., Distributed knowledge, Journal of Applied Non-Classical Logics 17(2):255\u2013273, 2007. https:\/\/doi.org\/10.3166\/jancl.17.255-273.","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"10119_CR43","unstructured":"Stroll, A., (ed.), Epistemology. Harper and Rowe, 1967."},{"key":"10119_CR44","doi-asserted-by":"crossref","unstructured":"van Benthem, J., Logical Dynamics of Information and Interaction, CUP, 2011.","DOI":"10.1017\/CBO9780511974533"},{"issue":"2","key":"10119_CR45","doi-asserted-by":"publisher","first-page":"157","DOI":"10.3166\/jancl.17.157-182","volume":"17","author":"J van Benthem","year":"2007","unstructured":"van Benthem, J., and F. Liu, Dynamic logic of preference upgrade, Journal of Applied Non-Classical Logics 17(2):157\u2013182, 2007. https:\/\/doi.org\/10.3166\/jancl.17.157-182.","journal-title":"Journal of Applied Non-Classical Logics"},{"issue":"1","key":"10119_CR46","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1026168632319","volume":"75","author":"H van Ditmarsch","year":"2003","unstructured":"van Ditmarsch, H., The russian cards problem, Studia Logica 75(1):31\u201362, 2003. https:\/\/doi.org\/10.1023\/A:1026168632319.","journal-title":"Studia Logica"},{"key":"10119_CR47","doi-asserted-by":"publisher","unstructured":"van Ditmarsch, H., Dynamics of lying, Synthese 191(5):745\u2013777, 2014. https:\/\/doi.org\/10.1007\/s11229-013-0275-3.","DOI":"10.1007\/s11229-013-0275-3"},{"key":"10119_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2023.105026","volume":"292","author":"H van Ditmarsch","year":"2023","unstructured":"van Ditmarsch, H., To be announced, Information and Computation 292:105026, 2023. https:\/\/doi.org\/10.1016\/j.ic.2023.105026.","journal-title":"Information and Computation"},{"key":"10119_CR49","doi-asserted-by":"publisher","unstructured":"van Ditmarsch, H., W. van\u00a0der Hoek, and B. Kooi, Dynamic Epistemic Logic, Springer, 2008. https:\/\/doi.org\/10.1007\/978-1-4020-5839-4.","DOI":"10.1007\/978-1-4020-5839-4"},{"issue":"6","key":"10119_CR50","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1093\/logcom\/exs058","volume":"24","author":"H van Ditmarsch","year":"2014","unstructured":"van Ditmarsch, H., D. Fern\u00e1ndez-Duque, and W. van\u00a0der Hoek, On the definability of simulation and bisimulation in epistemic logic, Journal of Logic and Computation 24(6):1209\u20131227, 2014. https:\/\/doi.org\/10.1093\/logcom\/exs058.","journal-title":"Journal of Logic and Computation"},{"key":"10119_CR51","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.artint.2016.10.003","volume":"242","author":"H van Ditmarsch","year":"2017","unstructured":"van Ditmarsch, H., W. van\u00a0der Hoek, B. Kooi, and L.\u00a0B. Kuijer, Arbitrary arrow update logic, Artificial Intelligence 242:80\u2013106, 2017. https:\/\/doi.org\/10.1016\/j.artint.2016.10.003.","journal-title":"Artificial Intelligence"},{"key":"10119_CR52","unstructured":"Vel\u00e1zquez-Quesada, F. R., Communication between agents in dynamic epistemic logic, CoRR, 2022."},{"key":"10119_CR53","doi-asserted-by":"crossref","unstructured":"Wang, Y., and Q. Cao, On axiomatizations of public announcement logic, Synthese 190 (Supplement-1):103\u2013134, 2013.","DOI":"10.1007\/s11229-012-0233-5"},{"key":"10119_CR54","doi-asserted-by":"publisher","unstructured":"W\u00e1ng, Y. N., and T. \u00c5gotnes, Public announcement logic with distributed knowledge: Expressivity, completeness and complexity, Synthese 190(Supplement-1):135\u2013162, 2013. https:\/\/doi.org\/10.1007\/s11229-012-0243-3.","DOI":"10.1007\/s11229-012-0243-3"},{"key":"10119_CR55","doi-asserted-by":"publisher","unstructured":"Williamson, T., Knowledge and Limits, OUP, 2002. https:\/\/doi.org\/10.1093\/019925656X.001.0001.","DOI":"10.1093\/019925656X.001.0001"}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-024-10119-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11225-024-10119-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-024-10119-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T17:44:41Z","timestamp":1759254281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11225-024-10119-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,31]]},"references-count":55,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["10119"],"URL":"https:\/\/doi.org\/10.1007\/s11225-024-10119-z","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"type":"print","value":"0039-3215"},{"type":"electronic","value":"1572-8730"}],"subject":[],"published":{"date-parts":[[2024,8,31]]},"assertion":[{"value":"30 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}