[{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","status":"public","_id":"276","file_date_updated":"2020-07-14T12:45:45Z","department":[{"_id":"MiSi"}],"date_updated":"2023-09-13T09:00:15Z","ddc":["570"],"scopus_import":"1","intvolume":" 13","month":"06","abstract":[{"lang":"eng","text":"Directed migration of cells relies on their ability to sense directional guidance cues and to interact with pericellular structures in order to transduce contractile cytoskeletal- into mechanical forces. These biomechanical processes depend highly on microenvironmental factors such as exposure to 2D surfaces or 3D matrices. In vivo, the majority of cells are exposed to 3D environments. Data on 3D cell migration are mostly derived from intravital microscopy or collagen-based in vitro assays. Both approaches offer only limited controlla-bility of experimental conditions. Here, we developed an automated microfluidic system that allows positioning of cells in 3D microenvironments containing highly controlled diffusion-based chemokine gradients. Tracking migration in such gradients was feasible in real time at the single cell level. Moreover, the setup allowed on-chip immunocytochemistry and thus linking of functional with phenotypical properties in individual cells. Spatially defined retrieval of cells from the device allows down-stream off-chip analysis. Using dendritic cells as a model, our setup specifically allowed us for the first time to quantitate key migration characteristics of cells exposed to identical gradients of the chemokine CCL19 yet placed on 2D vs in 3D environments. Migration properties between 2D and 3D migration were distinct. Morphological features of cells migrating in an in vitro 3D environment were similar to those of cells migrating in animal tissues, but different from cells migrating on a surface. Our system thus offers a highly controllable in vitro-mimic of a 3D environment that cells traffic in vivo."}],"oa_version":"Published Version","issue":"6","volume":13,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_id":"5709","checksum":"95fc5dc3938b3ad3b7697d10c83cc143","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-17T14:10:32Z","file_name":"2018_Plos_Frick.pdf","date_updated":"2020-07-14T12:45:45Z","file_size":7682167,"creator":"dernst"}],"article_number":"e0198330","external_id":{"isi":["000434384900031"]},"article_processing_charge":"No","author":[{"first_name":"Corina","last_name":"Frick","full_name":"Frick, Corina"},{"first_name":"Philip","full_name":"Dettinger, Philip","last_name":"Dettinger"},{"first_name":"Jörg","id":"3F0587C8-F248-11E8-B48F-1D18A9856A87","full_name":"Renkawitz, Jörg","orcid":"0000-0003-2856-3369","last_name":"Renkawitz"},{"first_name":"Annaïse","last_name":"Jauch","full_name":"Jauch, Annaïse"},{"last_name":"Berger","full_name":"Berger, Christoph","first_name":"Christoph"},{"first_name":"Mike","last_name":"Recher","full_name":"Recher, Mike"},{"last_name":"Schroeder","full_name":"Schroeder, Timm","first_name":"Timm"},{"first_name":"Matthias","last_name":"Mehling","full_name":"Mehling, Matthias"}],"publist_id":"7626","title":"Nano-scale microfluidics to study 3D chemotaxis at the single cell level","citation":{"chicago":"Frick, Corina, Philip Dettinger, Jörg Renkawitz, Annaïse Jauch, Christoph Berger, Mike Recher, Timm Schroeder, and Matthias Mehling. “Nano-Scale Microfluidics to Study 3D Chemotaxis at the Single Cell Level.” PLoS One. Public Library of Science, 2018. https://doi.org/10.1371/journal.pone.0198330.","ista":"Frick C, Dettinger P, Renkawitz J, Jauch A, Berger C, Recher M, Schroeder T, Mehling M. 2018. Nano-scale microfluidics to study 3D chemotaxis at the single cell level. PLoS One. 13(6), e0198330.","mla":"Frick, Corina, et al. “Nano-Scale Microfluidics to Study 3D Chemotaxis at the Single Cell Level.” PLoS One, vol. 13, no. 6, e0198330, Public Library of Science, 2018, doi:10.1371/journal.pone.0198330.","apa":"Frick, C., Dettinger, P., Renkawitz, J., Jauch, A., Berger, C., Recher, M., … Mehling, M. (2018). Nano-scale microfluidics to study 3D chemotaxis at the single cell level. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0198330","ama":"Frick C, Dettinger P, Renkawitz J, et al. Nano-scale microfluidics to study 3D chemotaxis at the single cell level. PLoS One. 2018;13(6). doi:10.1371/journal.pone.0198330","short":"C. Frick, P. Dettinger, J. Renkawitz, A. Jauch, C. Berger, M. Recher, T. Schroeder, M. Mehling, PLoS One 13 (2018).","ieee":"C. Frick et al., “Nano-scale microfluidics to study 3D chemotaxis at the single cell level,” PLoS One, vol. 13, no. 6. Public Library of Science, 2018."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"quality_controlled":"1","publisher":"Public Library of Science","acknowledgement":"This work was supported by the Swiss National Science Foundation (MD-PhD fellowships, 323530_164221 to C.F.; and 323630_151483 to A.J.; grant PZ00P3_144863 to M.R, grant 31003A_156431 to T.S.; PZ00P3_148000 to C.T.B.; PZ00P3_154733 to M.M.), a Novartis “FreeNovation” grant to M.M. and T.S. and an EMBO long-term fellowship (ALTF 1396-2014) co-funded by the European Commission (LTFCOFUND2013, GA-2013-609409) to J.R.. M.R. was supported by the Gebert Rüf Foundation (GRS 058/14). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","date_created":"2018-12-11T11:45:34Z","doi":"10.1371/journal.pone.0198330","date_published":"2018-06-07T00:00:00Z","year":"2018","has_accepted_license":"1","isi":1,"publication":"PLoS One","day":"07"},{"issue":"1","volume":8,"file":[{"creator":"dernst","file_size":1855324,"date_updated":"2020-07-14T12:45:49Z","file_name":"2018_ScientificReports_Ceinos.pdf","date_created":"2018-12-17T13:04:46Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"9c3942d772f84f3df032ffde0ed9a8ea","file_id":"5707"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"06","intvolume":" 8","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Light represents the principal signal driving circadian clock entrainment. However, how light influences the evolution of the clock remains poorly understood. The cavefish Phreatichthys andruzzii represents a fascinating model to explore how evolution under extreme aphotic conditions shapes the circadian clock, since in this species the clock is unresponsive to light. We have previously demonstrated that loss-of-function mutations targeting non-visual opsins contribute in part to this blind clock phenotype. Here, we have compared orthologs of two core clock genes that play a key role in photic entrainment, cry1a and per2, in both zebrafish and P. andruzzii. We encountered aberrantly spliced variants for the P. andruzzii per2 transcript. The most abundant transcript encodes a truncated protein lacking the C-terminal Cry binding domain and incorporating an intronic, transposon-derived coding sequence. We demonstrate that the transposon insertion leads to a predominantly cytoplasmic localization of the cavefish Per2 protein in contrast to the zebrafish ortholog which is distributed in both the nucleus and cytoplasm. Thus, it seems that during evolution in complete darkness, the photic entrainment pathway of the circadian clock has been subject to mutation at multiple levels, extending from opsin photoreceptors to nuclear effectors."}],"file_date_updated":"2020-07-14T12:45:49Z","department":[{"_id":"EvBe"}],"ddc":["570"],"date_updated":"2023-09-13T08:59:27Z","status":"public","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"283","doi":"10.1038/s41598-018-27080-2","date_published":"2018-06-08T00:00:00Z","date_created":"2018-12-11T11:45:36Z","day":"08","publication":"Scientific Reports","isi":1,"has_accepted_license":"1","year":"2018","quality_controlled":"1","publisher":"Nature Publishing Group","oa":1,"title":"Mutations in blind cavefish target the light regulated circadian clock gene period 2","publist_id":"7616","author":[{"last_name":"Ceinos","full_name":"Ceinos, Rosa Maria","first_name":"Rosa Maria"},{"full_name":"Frigato, Elena","last_name":"Frigato","first_name":"Elena"},{"first_name":"Cristina","last_name":"Pagano","full_name":"Pagano, Cristina"},{"full_name":"Frohlich, Nadine","last_name":"Frohlich","first_name":"Nadine"},{"first_name":"Pietro","full_name":"Negrini, Pietro","last_name":"Negrini"},{"first_name":"Nicola","id":"457160E6-F248-11E8-B48F-1D18A9856A87","full_name":"Cavallari, Nicola","last_name":"Cavallari"},{"first_name":"Daniela","full_name":"Vallone, Daniela","last_name":"Vallone"},{"first_name":"Silvia","full_name":"Fuselli, Silvia","last_name":"Fuselli"},{"last_name":"Bertolucci","full_name":"Bertolucci, Cristiano","first_name":"Cristiano"},{"last_name":"Foulkes","full_name":"Foulkes, Nicholas S","first_name":"Nicholas S"}],"article_processing_charge":"No","external_id":{"isi":["000434640800008"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Ceinos, Rosa Maria, Elena Frigato, Cristina Pagano, Nadine Frohlich, Pietro Negrini, Nicola Cavallari, Daniela Vallone, Silvia Fuselli, Cristiano Bertolucci, and Nicholas S Foulkes. “Mutations in Blind Cavefish Target the Light Regulated Circadian Clock Gene Period 2.” Scientific Reports. Nature Publishing Group, 2018. https://doi.org/10.1038/s41598-018-27080-2.","ista":"Ceinos RM, Frigato E, Pagano C, Frohlich N, Negrini P, Cavallari N, Vallone D, Fuselli S, Bertolucci C, Foulkes NS. 2018. Mutations in blind cavefish target the light regulated circadian clock gene period 2. Scientific Reports. 8(1), 8754.","mla":"Ceinos, Rosa Maria, et al. “Mutations in Blind Cavefish Target the Light Regulated Circadian Clock Gene Period 2.” Scientific Reports, vol. 8, no. 1, 8754, Nature Publishing Group, 2018, doi:10.1038/s41598-018-27080-2.","apa":"Ceinos, R. M., Frigato, E., Pagano, C., Frohlich, N., Negrini, P., Cavallari, N., … Foulkes, N. S. (2018). Mutations in blind cavefish target the light regulated circadian clock gene period 2. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-018-27080-2","ama":"Ceinos RM, Frigato E, Pagano C, et al. Mutations in blind cavefish target the light regulated circadian clock gene period 2. Scientific Reports. 2018;8(1). doi:10.1038/s41598-018-27080-2","short":"R.M. Ceinos, E. Frigato, C. Pagano, N. Frohlich, P. Negrini, N. Cavallari, D. Vallone, S. Fuselli, C. Bertolucci, N.S. Foulkes, Scientific Reports 8 (2018).","ieee":"R. M. Ceinos et al., “Mutations in blind cavefish target the light regulated circadian clock gene period 2,” Scientific Reports, vol. 8, no. 1. Nature Publishing Group, 2018."},"article_number":"8754"},{"alternative_title":["LNCS"],"scopus_import":"1","intvolume":" 11022","month":"08","abstract":[{"text":"We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider extends linear temporal logic (LTL) with clock variables and reset quantifiers, providing a mechanism to specify real-time constraints. We first describe a general monitoring algorithm based on an exhaustive computation of the set of satisfying clock assignments as a finite union of zones. We then propose a specialized monitoring algorithm for the one-variable case using a partition of the time domain based on the notion of region equivalence, whose complexity is linear in the length of the signal, thereby generalizing a known result regarding the monitoring of metric temporal logic (MTL). The region and zone representations of time constraints are known from timed automata verification and can also be used in the discrete-time case. Our prototype implementation appears to outperform previous discrete-time implementations of TPTL monitoring,","lang":"eng"}],"oa_version":"Submitted Version","volume":11022,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_id":"8638","checksum":"e5d81c9b50a6bd9d8a2c16953aad7e23","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2020-10-09T06:24:21Z","file_name":"2018_LNCS_Elgyuett.pdf","date_updated":"2020-10-09T06:24:21Z","file_size":537219,"creator":"dernst"}],"conference":{"end_date":"2018-09-06","location":"Beijing, China","start_date":"2018-09-04","name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"type":"conference","status":"public","_id":"81","department":[{"_id":"ToHe"}],"file_date_updated":"2020-10-09T06:24:21Z","date_updated":"2023-09-13T08:58:34Z","ddc":["000"],"oa":1,"publisher":"Springer","quality_controlled":"1","page":"53 - 70","date_created":"2018-12-11T11:44:31Z","doi":"10.1007/978-3-030-00151-3_4","date_published":"2018-08-26T00:00:00Z","year":"2018","has_accepted_license":"1","isi":1,"day":"26","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"external_id":{"isi":["000884993200004"]},"article_processing_charge":"No","author":[{"last_name":"Elgyütt","full_name":"Elgyütt, Adrian","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian"},{"orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","last_name":"Ferrere","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"publist_id":"7973","title":"Monitoring temporal logic with clock variables","citation":{"ama":"Elgyütt A, Ferrere T, Henzinger TA. Monitoring temporal logic with clock variables. In: Vol 11022. Springer; 2018:53-70. doi:10.1007/978-3-030-00151-3_4","apa":"Elgyütt, A., Ferrere, T., & Henzinger, T. A. (2018). Monitoring temporal logic with clock variables (Vol. 11022, pp. 53–70). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-030-00151-3_4","short":"A. Elgyütt, T. Ferrere, T.A. Henzinger, in:, Springer, 2018, pp. 53–70.","ieee":"A. Elgyütt, T. Ferrere, and T. A. Henzinger, “Monitoring temporal logic with clock variables,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China, 2018, vol. 11022, pp. 53–70.","mla":"Elgyütt, Adrian, et al. Monitoring Temporal Logic with Clock Variables. Vol. 11022, Springer, 2018, pp. 53–70, doi:10.1007/978-3-030-00151-3_4.","ista":"Elgyütt A, Ferrere T, Henzinger TA. 2018. Monitoring temporal logic with clock variables. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 53–70.","chicago":"Elgyütt, Adrian, Thomas Ferrere, and Thomas A Henzinger. “Monitoring Temporal Logic with Clock Variables,” 11022:53–70. Springer, 2018. https://doi.org/10.1007/978-3-030-00151-3_4."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"oa":1,"quality_controlled":"1","publisher":"Springer","publication":"Distributed Computing","day":"12","year":"2018","isi":1,"has_accepted_license":"1","date_created":"2018-12-11T11:44:30Z","date_published":"2018-09-12T00:00:00Z","doi":"10.1007/s00446-018-0342-6","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Lenzen C, Rybicki J. 2018. Near-optimal self-stabilising counting and firing squads. Distributed Computing.","chicago":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-018-0342-6.","short":"C. Lenzen, J. Rybicki, Distributed Computing (2018).","ieee":"C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” Distributed Computing. Springer, 2018.","ama":"Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads. Distributed Computing. 2018. doi:10.1007/s00446-018-0342-6","apa":"Lenzen, C., & Rybicki, J. (2018). Near-optimal self-stabilising counting and firing squads. Distributed Computing. Springer. https://doi.org/10.1007/s00446-018-0342-6","mla":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing, Springer, 2018, doi:10.1007/s00446-018-0342-6."},"title":"Near-optimal self-stabilising counting and firing squads","article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000475627800005"]},"publist_id":"7978","author":[{"first_name":"Christoph","full_name":"Lenzen, Christoph","last_name":"Lenzen"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","last_name":"Rybicki"}],"oa_version":"Published Version","abstract":[{"text":"Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a counter that is increased by one modulo C in each round for given C>1. In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external “go” signal as input, then all correct nodes should agree on a round (in the not-too-distant future) in which to jointly output a “fire” signal. Moreover, no node should generate a “fire” signal without some correct node having previously received a “go” signal as input. We present a framework reducing both tasks to binary consensus at very small cost. For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f<n/3, asymptotically optimal stabilisation and response time O(f), and message size O(log f). As our framework does not restrict the type of consensus routines used, we also obtain efficient randomised solutions.","lang":"eng"}],"month":"09","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5711","checksum":"872db70bba9b401500abe3c6ae2f1a61","file_size":799337,"date_updated":"2020-07-14T12:48:01Z","creator":"dernst","file_name":"2018_DistributedComputing_Lenzen.pdf","date_created":"2018-12-17T14:21:22Z"}],"publication_status":"published","_id":"76","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","ddc":["000"],"date_updated":"2023-09-13T09:01:06Z","department":[{"_id":"DaAl"}],"file_date_updated":"2020-07-14T12:48:01Z"},{"oa":1,"publisher":"Elsevier","quality_controlled":"1","date_created":"2018-12-11T11:46:59Z","doi":"10.1016/j.comgeo.2017.06.014","date_published":"2018-03-01T00:00:00Z","page":"119 - 133","publication":"Computational Geometry: Theory and Applications","day":"01","year":"2018","has_accepted_license":"1","isi":1,"project":[{"call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","name":"Topological Complex Systems"}],"title":"Multiple covers with balls I: Inclusion–exclusion","external_id":{"isi":["000415778300010"]},"article_processing_charge":"No","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","first_name":"Mabel","full_name":"Iglesias Ham, Mabel","last_name":"Iglesias Ham"}],"publist_id":"7289","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Edelsbrunner H, Iglesias Ham M. Multiple covers with balls I: Inclusion–exclusion. Computational Geometry: Theory and Applications. 2018;68:119-133. doi:10.1016/j.comgeo.2017.06.014","apa":"Edelsbrunner, H., & Iglesias Ham, M. (2018). Multiple covers with balls I: Inclusion–exclusion. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2017.06.014","ieee":"H. Edelsbrunner and M. Iglesias Ham, “Multiple covers with balls I: Inclusion–exclusion,” Computational Geometry: Theory and Applications, vol. 68. Elsevier, pp. 119–133, 2018.","short":"H. Edelsbrunner, M. Iglesias Ham, Computational Geometry: Theory and Applications 68 (2018) 119–133.","mla":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “Multiple Covers with Balls I: Inclusion–Exclusion.” Computational Geometry: Theory and Applications, vol. 68, Elsevier, 2018, pp. 119–33, doi:10.1016/j.comgeo.2017.06.014.","ista":"Edelsbrunner H, Iglesias Ham M. 2018. Multiple covers with balls I: Inclusion–exclusion. Computational Geometry: Theory and Applications. 68, 119–133.","chicago":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “Multiple Covers with Balls I: Inclusion–Exclusion.” Computational Geometry: Theory and Applications. Elsevier, 2018. https://doi.org/10.1016/j.comgeo.2017.06.014."},"intvolume":" 68","month":"03","scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Inclusion–exclusion is an effective method for computing the volume of a union of measurable sets. We extend it to multiple coverings, proving short inclusion–exclusion formulas for the subset of Rn covered by at least k balls in a finite set. We implement two of the formulas in dimension n=3 and report on results obtained with our software."}],"ec_funded":1,"volume":68,"language":[{"iso":"eng"}],"file":[{"file_size":708357,"date_updated":"2020-07-14T12:46:38Z","creator":"dernst","file_name":"2018_Edelsbrunner.pdf","date_created":"2019-02-12T06:47:52Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"1c8d58cd489a66cd3e2064c1141c8c5e","file_id":"5953"}],"publication_status":"published","status":"public","type":"journal_article","_id":"530","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:46:38Z","ddc":["000"],"date_updated":"2023-09-13T08:59:00Z"}]