{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:00:12Z","timestamp":1750309212644,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":76,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC-2020-CoG 863818"],"award-info":[{"award-number":["ERC-2020-CoG 863818"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3662158.3662768","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:38:06Z","timestamp":1717598286000},"page":"40-49","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Game Dynamics and Equilibrium Computation in the Population Protocol Model"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3650-940X","authenticated-orcid":false,"given":"Dan","family":"Alistarh","sequence":"first","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4561-241X","authenticated-orcid":false,"given":"Krishnendu","family":"Chatterjee","sequence":"additional","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5253-9170","authenticated-orcid":false,"given":"Mehrdad","family":"Karrabi","sequence":"additional","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9548-6098","authenticated-orcid":false,"given":"John","family":"Lazarsfeld","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039855"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 29th ACM-SIAM Symposium on Discrete Algorithms ((SODA)). 2221--2239","author":"Alistarh Dan","year":"2018","unstructured":"Dan Alistarh, James Aspnes, and Rati Gelashvili. 2018. Space-optimal majority in population protocols. In Proceedings of the 29th ACM-SIAM Symposium on Discrete Algorithms ((SODA)). 2221--2239."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Dan Alistarh Krishnendu Chatterjee Mehrdad Karrabi and John Lazarsfeld. 2024. Game Dynamics and Equilibrium Computation in the Population Protocol Model. arXiv:2307.07297 [cs.DC]","DOI":"10.1145\/3662158.3662768"},{"volume-title":"Automata, Languages, and Programming","author":"Alistarh Dan","key":"e_1_3_2_1_4_1","unstructured":"Dan Alistarh and Rati Gelashvili. 2015. Polylogarithmic-time leader election in population protocols. In Automata, Languages, and Programming. Springer, 479--491."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767429"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. 55--65","author":"Alistarh Dan","year":"2021","unstructured":"Dan Alistarh, Martin T\u00f6pfer, and Przemys\u0142aw Uzna\u0144ski. 2021. Comparison dynamics in population protocols. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. 55--65."},{"key":"e_1_3_2_1_7_1","volume-title":"Evolutionary dynamics on any population structure. Nature 544, 7649","author":"Allen Benjamin","year":"2017","unstructured":"Benjamin Allen, Gabor Lippner, Yu-Ting Chen, Babak Fotouhi, Naghmeh Momeni, Shing-Tung Yau, and Martin A Nowak. 2017. Evolutionary dynamics on any population structure. Nature 544, 7649 (2017), 227--230."},{"key":"e_1_3_2_1_8_1","volume-title":"Approximate majority with catalytic inputs. arXiv preprint arXiv:2009.08847","author":"Amir Talley","year":"2020","unstructured":"Talley Amir, James Aspnes, and John Lazarsfeld. 2020. Approximate majority with catalytic inputs. arXiv preprint arXiv:2009.08847 (2020)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0138-3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0067-z"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0059-z"},{"key":"e_1_3_2_1_12_1","volume-title":"Correlated equilibrium as an expression of Bayesian rationality. Econometrica: Journal of the Econometric Society","author":"Aumann Robert J","year":"1987","unstructured":"Robert J Aumann. 1987. Correlated equilibrium as an expression of Bayesian rationality. Econometrica: Journal of the Econometric Society (1987), 1--18."},{"key":"e_1_3_2_1_13_1","volume-title":"The evolution of cooperation. Science 211, 4489","author":"Axelrod Robert","year":"1981","unstructured":"Robert Axelrod and William D Hamilton. 1981. The evolution of cooperation. Science 211, 4489 (1981), 1390--1396."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1774--1791","author":"Basu Riddhipratim","year":"2014","unstructured":"Riddhipratim Basu, Jonathan Hermon, and Yuval Peres. 2014. Characterization of cutoff for reversible Markov chains. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1774--1791."},{"key":"e_1_3_2_1_15_1","volume-title":"Average whenever you meet: Opportunistic protocols for community detection. arXiv preprint arXiv:1703.05045","author":"Becchetti Luca","year":"2017","unstructured":"Luca Becchetti, Andrea Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, and Luca Trevisan. 2017. Average whenever you meet: Opportunistic protocols for community detection. arXiv preprint arXiv:1703.05045 (2017)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3388392.3388403"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 371--390","author":"Becchetti Luca","year":"2014","unstructured":"Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, and Riccardo Silvestri. 2014. Plurality consensus in the gossip model. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 371--390."},{"key":"e_1_3_2_1_18_1","volume-title":"Loosely-stabilizing phase clocks and the adaptive majority problem. arXiv preprint arXiv:2106.13002","author":"Berenbrink Petra","year":"2021","unstructured":"Petra Berenbrink, Felix Biermeier, Christopher Hahn, and Dominik Kaaser. 2021. Loosely-stabilizing phase clocks and the adaptive majority problem. arXiv preprint arXiv:2106.13002 (2021)."},{"key":"e_1_3_2_1_19_1","volume-title":"Plurality Consensus via Shuffling: Lessons Learned from Load Balancing. arXiv preprint arXiv:1602.01342","author":"Berenbrink Petra","year":"2016","unstructured":"Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, and Chris Wastell. 2016. Plurality Consensus via Shuffling: Lessons Learned from Load Balancing. arXiv preprint arXiv:1602.01342 (2016)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384312"},{"key":"e_1_3_2_1_21_1","volume-title":"Playing with population protocols. arXiv preprint arXiv:0906.3256","author":"Bournez Olivier","year":"2009","unstructured":"Olivier Bournez, J\u00e9r\u00e9mie Chalopin, Johanne Cohen, and Xavier Koegler. 2009. Playing with population protocols. arXiv preprint arXiv:0906.3256 (2009)."},{"key":"e_1_3_2_1_22_1","first-page":"1","article-title":"Population Protocols that Correspond to Symmetric","volume":"9","author":"Bournez Olivier","year":"2013","unstructured":"Olivier Bournez, J\u00e9r\u00e9mie Chalopin, Johanne Cohen, Xavier Koegler, and Mikael Rabie. 2013. Population Protocols that Correspond to Symmetric Games. Int. J. Unconv. Comput. 9, 1-2 (2013), 5--36.","journal-title":"Games. Int. J. Unconv. Comput."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.104.3.898"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms. SIAM, 217--234","author":"Cai Yang","year":"2011","unstructured":"Yang Cai and Constantinos Daskalakis. 2011. On minmax theorems for multi-player games. In Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms. SIAM, 217--234."},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the 22nd International Conference on DNA Computing and Molecular Programming (DNA22)","author":"Cardelli Luca","year":"2016","unstructured":"Luca Cardelli, Marta Kwiatkowska, and Luca Laurenti. 2016. Programming discrete distributions with chemical reaction networks. In Proceedings of the 22nd International Conference on DNA Computing and Molecular Programming (DNA22). Springer, 35--51."},{"volume-title":"Prediction, learning, and games","author":"Cesa-Bianchi Nicolo","key":"e_1_3_2_1_26_1","unstructured":"Nicolo Cesa-Bianchi and G\u00e1bor Lugosi. 2006. Prediction, learning, and games. Cambridge university press."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-015-0255-6"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1038\/nnano.2013.189"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1461928.1461951"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2014.02.002"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","first-page":"930","DOI":"10.2307\/3215318","article-title":"On a generalization of the Ehrenfest urn model","volume":"31","author":"Dette Holger","year":"1994","unstructured":"Holger Dette. 1994. On a generalization of the Ehrenfest urn model. Journal of applied probability 31, 4 (1994), 930--939.","journal-title":"Journal of applied probability"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10955-011-0284-x","article-title":"The mathematics of mixing things up","volume":"144","author":"Diaconis Persi","year":"2011","unstructured":"Persi Diaconis. 2011. The mathematics of mixing things up. Journal of Statistical Physics 144, 3 (2011), 445--458.","journal-title":"Journal of Statistical Physics"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010105"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634131"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00104"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0281-z"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/110823018"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","unstructured":"Bart\u0142omiej Dudek and Adrian Kosowski. 2018. Universal protocols for information dissemination using emergent signals. In STOC. 87--99. 10.1145\/3188745.3188818","DOI":"10.1145\/3188745.3188818"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1017\/S096354830100503X"},{"key":"e_1_3_2_1_41_1","unstructured":"Paul Ehrenfest and Tatjana Ehrenfest-Afanassjewa. 1907. \u00dcber zwei bekannte Einw\u00e4nde gegen das Boltzmannsche H-Theorem. Hirzel."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00182-007-0095-0"},{"volume-title":"Principles of Distributed Systems","author":"Fischer Michael","key":"e_1_3_2_1_43_1","unstructured":"Michael Fischer and Hong Jiang. 2006. Self-stabilizing leader election in networks of finite-state anonymous agents. In Principles of Distributed Systems. Springer, 395--409."},{"key":"e_1_3_2_1_44_1","volume-title":"Proceedings of the 29th ACM-SIAM Symposium on Discrete Algorithms ((SODA)). 2653--2667","author":"G\u0105sieniec Leszek","year":"2018","unstructured":"Leszek G\u0105sieniec and Grzegorz Stachowiak. 2018. Fast Space Optimal Leader Election in Population Protocols. In Proceedings of the 29th ACM-SIAM Symposium on Discrete Algorithms ((SODA)). 2653--2667."},{"key":"e_1_3_2_1_45_1","volume-title":"Proceedings of the 35th ACM Symposium on Principles of Distributed Computing ((PODC)). 117--126","author":"Ghaffari Mohsen","year":"2016","unstructured":"Mohsen Ghaffari and Merav Parter. 2016. A polylogarithmic gossip algorithm for plurality consensus. In Proceedings of the 35th ACM Symposium on Principles of Distributed Computing ((PODC)). 117--126."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933117"},{"key":"e_1_3_2_1_47_1","volume-title":"Tight last-iterate convergence rates for no-regret learning in multi-player games. Advances in neural information processing systems 33","author":"Golowich Noah","year":"2020","unstructured":"Noah Golowich, Sarath Pattathil, and Constantinos Daskalakis. 2020. Tight last-iterate convergence rates for no-regret learning in multi-player games. Advances in neural information processing systems 33 (2020), 20766--20778."},{"volume-title":"Probability and random processes","author":"Grimmett Geoffrey","key":"e_1_3_2_1_48_1","unstructured":"Geoffrey Grimmett and David Stirzaker. 2020. Probability and random processes. Oxford university press."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1214834110"},{"volume-title":"Evolutionary games and population dynamics","author":"Hofbauer Josef","key":"e_1_3_2_1_50_1","unstructured":"Josef Hofbauer and Karl Sigmund. 1998. Evolutionary games and population dynamics. Cambridge university press."},{"key":"e_1_3_2_1_51_1","volume-title":"Thirty-seventh Conference on Neural Information Processing Systems.","author":"Hu Shuyue","year":"2023","unstructured":"Shuyue Hu, Harold Soh, and Georgios Piliouras. 2023. The Best of Both Worlds in Network Population Games: Reaching Consensus and Convergence to Equilibrium. In Thirty-seventh Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1511366112"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1947.11990189"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.2307\/3212199"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","first-page":"964","DOI":"10.2307\/3214525","article-title":"Mean passage times for tridiagonal transition matrices and a two-parameter Ehrenfest urn model","volume":"30","author":"Krafft Olaf","year":"1993","unstructured":"Olaf Krafft and Martin Schaefer. 1993. Mean passage times for tridiagonal transition matrices and a two-parameter Ehrenfest urn model. Journal of Applied Probability 30, 4 (1993), 964--970.","journal-title":"Journal of Applied Probability"},{"volume-title":"Markov chains and mixing times","author":"Levin David A","key":"e_1_3_2_1_56_1","unstructured":"David A Levin and Yuval Peres. 2017. Markov chains and mixing times. Vol. 107. American Mathematical Soc."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03204"},{"key":"e_1_3_2_1_58_1","volume-title":"International Conference on Machine Learning. PMLR, 6161--6171","author":"Lin Tianyi","year":"2020","unstructured":"Tianyi Lin, Zhengyuan Zhou, Panayotis Mertikopoulos, and Michael Jordan. 2020. Finite-time last-iterate convergence for multi-agent learning in games. In International Conference on Machine Learning. PMLR, 6161--6171."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1016\/j.jtbi.2009.07.008","article-title":"The donation game with roles played between relatives","volume":"260","author":"Marshall James AR","year":"2009","unstructured":"James AR Marshall. 2009. The donation game with roles played between relatives. Journal of Theoretical Biology 260, 3 (2009), 386--391.","journal-title":"Journal of Theoretical Biology"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"crossref","first-page":"e35135","DOI":"10.1371\/journal.pone.0035135","article-title":"Generosity pays in the presence of direct reciprocity: A comprehensive study of 2 \u00d7 2 repeated games","volume":"7","author":"Martinez-Vaquero Luis A","year":"2012","unstructured":"Luis A Martinez-Vaquero, Jose A Cuesta, and Angel Sanchez. 2012. Generosity pays in the presence of direct reciprocity: A comprehensive study of 2 \u00d7 2 repeated games. PLoS One 7, 4 (2012), e35135.","journal-title":"PLoS One"},{"volume-title":"Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis","author":"Mitzenmacher Michael","key":"e_1_3_2_1_61_1","unstructured":"Michael Mitzenmacher and Eli Upfal. 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge university press."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1177\/0022002785029004004"},{"key":"e_1_3_2_1_63_1","volume-title":"Non-cooperative games. Annals of mathematics","author":"Nash John","year":"1951","unstructured":"John Nash. 1951. Non-cooperative games. Annals of mathematics (1951), 286--295."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481"},{"key":"e_1_3_2_1_65_1","volume-title":"A strategy of win-stay, lose-shift that outperforms tit-for-tat in the Prisoner's Dilemma game. Nature 364, 6432","author":"Nowak Martin","year":"1993","unstructured":"Martin Nowak and Karl Sigmund. 1993. A strategy of win-stay, lose-shift that outperforms tit-for-tat in the Prisoner's Dilemma game. Nature 364, 6432 (1993), 56--58."},{"volume-title":"Evolutionary dynamics: exploring the equations of life","author":"Nowak Martin A","key":"e_1_3_2_1_66_1","unstructured":"Martin A Nowak. 2006. Evolutionary dynamics: exploring the equations of life. Harvard university press."},{"key":"e_1_3_2_1_67_1","volume-title":"Tit for tat in heterogeneous populations. Nature 355, 6357","author":"Nowak Martin A","year":"1992","unstructured":"Martin A Nowak and Karl Sigmund. 1992. Tit for tat in heterogeneous populations. Nature 355, 6357 (1992), 250--253."},{"volume-title":"A course in game theory","author":"Osborne Martin J","key":"e_1_3_2_1_68_1","unstructured":"Martin J Osborne and Ariel Rubinstein. 1994. A course in game theory. MIT press."},{"volume-title":"Game theory","author":"Owen Guillermo","key":"e_1_3_2_1_69_1","unstructured":"Guillermo Owen. 2013. Game theory. Emerald Group Publishing."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062181"},{"key":"e_1_3_2_1_71_1","volume-title":"The evolution of cooperation","author":"Robert Axelrod","year":"1984","unstructured":"Axelrod Robert. 1984. The evolution of cooperation. Basic Books (1984)."},{"volume-title":"Twenty lectures on algorithmic game theory","author":"Roughgarden Tim","key":"e_1_3_2_1_72_1","unstructured":"Tim Roughgarden. 2016. Twenty lectures on algorithmic game theory. Cambridge University Press."},{"volume-title":"Population games and evolutionary dynamics","author":"Sandholm William H","key":"e_1_3_2_1_73_1","unstructured":"William H Sandholm. 2010. Population games and evolutionary dynamics. MIT press."},{"volume-title":"Evolution and the Theory of Games","author":"Smith John Maynard","key":"e_1_3_2_1_74_1","unstructured":"John Maynard Smith. 1982. Evolution and the Theory of Games. Cambridge University Press."},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1306246110"},{"key":"e_1_3_2_1_76_1","volume-title":"Mathematical Proceedings of the Cambridge Philosophical Society","volume":"86","author":"Tak\u00e1cs Lajos","year":"1979","unstructured":"Lajos Tak\u00e1cs. 1979. On an urn problem of Paul and Tatiana Ehrenfest. In Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 86. Cambridge University Press, 127--130."}],"event":{"name":"PODC '24: 43rd ACM Symposium on Principles of Distributed Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Nantes France","acronym":"PODC '24"},"container-title":["Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662768","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:41Z","timestamp":1750290221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":76,"alternative-id":["10.1145\/3662158.3662768","10.1145\/3662158"],"URL":"https:\/\/doi.org\/10.1145\/3662158.3662768","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}