[{"citation":{"chicago":"Erbar, Matthias, Jan Maas, and Melchior Wirth. “On the Geometry of Geodesics in Discrete Optimal Transport.” Calculus of Variations and Partial Differential Equations. Springer, 2019. https://doi.org/10.1007/s00526-018-1456-1.","ista":"Erbar M, Maas J, Wirth M. 2019. On the geometry of geodesics in discrete optimal transport. Calculus of Variations and Partial Differential Equations. 58(1), 19.","mla":"Erbar, Matthias, et al. “On the Geometry of Geodesics in Discrete Optimal Transport.” Calculus of Variations and Partial Differential Equations, vol. 58, no. 1, 19, Springer, 2019, doi:10.1007/s00526-018-1456-1.","ieee":"M. Erbar, J. Maas, and M. Wirth, “On the geometry of geodesics in discrete optimal transport,” Calculus of Variations and Partial Differential Equations, vol. 58, no. 1. Springer, 2019.","short":"M. Erbar, J. Maas, M. Wirth, Calculus of Variations and Partial Differential Equations 58 (2019).","ama":"Erbar M, Maas J, Wirth M. On the geometry of geodesics in discrete optimal transport. Calculus of Variations and Partial Differential Equations. 2019;58(1). doi:10.1007/s00526-018-1456-1","apa":"Erbar, M., Maas, J., & Wirth, M. (2019). On the geometry of geodesics in discrete optimal transport. Calculus of Variations and Partial Differential Equations. Springer. https://doi.org/10.1007/s00526-018-1456-1"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Erbar","full_name":"Erbar, Matthias","first_name":"Matthias"},{"first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","last_name":"Maas"},{"first_name":"Melchior","last_name":"Wirth","full_name":"Wirth, Melchior"}],"external_id":{"arxiv":["1805.06040"],"isi":["000452849400001"]},"article_processing_charge":"Yes (via OA deal)","title":"On the geometry of geodesics in discrete optimal transport","article_number":"19","project":[{"call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117"},{"_id":"260482E2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Taming Complexity in Partial Di erential Systems","grant_number":" F06504"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"isi":1,"has_accepted_license":"1","year":"2019","day":"01","publication":"Calculus of Variations and Partial Differential Equations","doi":"10.1007/s00526-018-1456-1","date_published":"2019-02-01T00:00:00Z","date_created":"2018-12-11T11:44:29Z","publisher":"Springer","quality_controlled":"1","oa":1,"date_updated":"2023-09-13T09:12:35Z","ddc":["510"],"department":[{"_id":"JaMa"}],"file_date_updated":"2020-07-14T12:47:55Z","_id":"73","type":"journal_article","article_type":"original","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)"},"status":"public","publication_identifier":{"issn":["09442669"]},"publication_status":"published","file":[{"file_name":"2018_Calculus_Erbar.pdf","date_created":"2019-01-28T15:37:11Z","file_size":645565,"date_updated":"2020-07-14T12:47:55Z","creator":"dernst","checksum":"ba05ac2d69de4c58d2cd338b63512798","file_id":"5895","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"issue":"1","volume":58,"ec_funded":1,"abstract":[{"text":"We consider the space of probability measures on a discrete set X, endowed with a dynamical optimal transport metric. Given two probability measures supported in a subset Y⊆X, it is natural to ask whether they can be connected by a constant speed geodesic with support in Y at all times. Our main result answers this question affirmatively, under a suitable geometric condition on Y introduced in this paper. The proof relies on an extension result for subsolutions to discrete Hamilton-Jacobi equations, which is of independent interest.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","month":"02","intvolume":" 58"},{"date_updated":"2023-09-15T12:19:31Z","department":[{"_id":"UlWa"}],"_id":"6982","status":"public","article_type":"original","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","issue":"4","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"309"}]},"volume":15,"oa_version":"Preprint","abstract":[{"text":"We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding ϕ : G → M of a graph G into a 2-manifold M maps the vertices in V(G) to distinct points and the edges in E(G) to interior-disjoint Jordan arcs between the corresponding vertices. In applications in clustering, cartography, and visualization, nearby vertices and edges are often bundled to the same point or overlapping arcs due to data compression or low resolution. This raises the computational problem of deciding whether a given map ϕ : G → M comes from an embedding. A map ϕ : G → M is a weak embedding if it can be perturbed into an embedding ψ ϵ : G → M with ‖ ϕ − ψ ϵ ‖ < ϵ for every ϵ > 0, where ‖.‖ is the unform norm.\r\nA polynomial-time algorithm for recognizing weak embeddings has recently been found by Fulek and Kynčl. It reduces the problem to solving a system of linear equations over Z2. It runs in O(n2ω)≤ O(n4.75) time, where ω ∈ [2,2.373) is the matrix multiplication exponent and n is the number of vertices and edges of G. We improve the running time to O(n log n). Our algorithm is also conceptually simpler: We perform a sequence of local operations that gradually “untangles” the image ϕ(G) into an embedding ψ(G) or reports that ϕ is not a weak embedding. It combines local constraints on the orientation of subgraphs directly, thereby eliminating the need for solving large systems of linear equations.\r\n","lang":"eng"}],"intvolume":" 15","month":"10","main_file_link":[{"url":"https://arxiv.org/abs/1709.09209","open_access":"1"}],"scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Akitaya, H., Fulek, R., & Tóth, C. (2019). Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. ACM. https://doi.org/10.1145/3344549","ama":"Akitaya H, Fulek R, Tóth C. Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. 2019;15(4). doi:10.1145/3344549","ieee":"H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,” ACM Transactions on Algorithms, vol. 15, no. 4. ACM, 2019.","short":"H. Akitaya, R. Fulek, C. Tóth, ACM Transactions on Algorithms 15 (2019).","mla":"Akitaya, Hugo, et al. “Recognizing Weak Embeddings of Graphs.” ACM Transactions on Algorithms, vol. 15, no. 4, 50, ACM, 2019, doi:10.1145/3344549.","ista":"Akitaya H, Fulek R, Tóth C. 2019. Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. 15(4), 50.","chicago":"Akitaya, Hugo, Radoslav Fulek, and Csaba Tóth. “Recognizing Weak Embeddings of Graphs.” ACM Transactions on Algorithms. ACM, 2019. https://doi.org/10.1145/3344549."},"title":"Recognizing weak embeddings of graphs","external_id":{"arxiv":["1709.09209"]},"author":[{"first_name":"Hugo","full_name":"Akitaya, Hugo","last_name":"Akitaya"},{"first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","last_name":"Fulek"},{"last_name":"Tóth","full_name":"Tóth, Csaba","first_name":"Csaba"}],"article_number":"50","project":[{"_id":"261FA626-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02281","name":"Eliminating intersections in drawings of graphs"}],"publication":"ACM Transactions on Algorithms","day":"01","year":"2019","date_created":"2019-11-04T15:45:17Z","date_published":"2019-10-01T00:00:00Z","doi":"10.1145/3344549","oa":1,"publisher":"ACM","quality_controlled":"1"},{"title":"Automatic time-unbounded reachability analysis of hybrid systems","author":[{"last_name":"Giacobbe","full_name":"Giacobbe, Mirco","orcid":"0000-0001-8180-0904","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","first_name":"Mirco"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Giacobbe, Mirco. Automatic Time-Unbounded Reachability Analysis of Hybrid Systems. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6894.","short":"M. Giacobbe, Automatic Time-Unbounded Reachability Analysis of Hybrid Systems, Institute of Science and Technology Austria, 2019.","ieee":"M. Giacobbe, “Automatic time-unbounded reachability analysis of hybrid systems,” Institute of Science and Technology Austria, 2019.","ama":"Giacobbe M. Automatic time-unbounded reachability analysis of hybrid systems. 2019. doi:10.15479/AT:ISTA:6894","apa":"Giacobbe, M. (2019). Automatic time-unbounded reachability analysis of hybrid systems. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6894","chicago":"Giacobbe, Mirco. “Automatic Time-Unbounded Reachability Analysis of Hybrid Systems.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6894.","ista":"Giacobbe M. 2019. Automatic time-unbounded reachability analysis of hybrid systems. Institute of Science and Technology Austria."},"publisher":"Institute of Science and Technology Austria","oa":1,"doi":"10.15479/AT:ISTA:6894","date_published":"2019-09-30T00:00:00Z","date_created":"2019-09-22T14:08:44Z","page":"132","day":"30","has_accepted_license":"1","year":"2019","status":"public","type":"dissertation","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":"6894","file_date_updated":"2020-07-14T12:47:43Z","department":[{"_id":"ToHe"}],"ddc":["000"],"supervisor":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"date_updated":"2023-09-19T09:30:43Z","month":"09","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"text":"Hybrid automata combine finite automata and dynamical systems, and model the interaction of digital with physical systems. Formal analysis that can guarantee the safety of all behaviors or rigorously witness failures, while unsolvable in general, has been tackled algorithmically using, e.g., abstraction, bounded model-checking, assisted theorem proving.\r\nNevertheless, very few methods have addressed the time-unbounded reachability analysis of hybrid automata and, for current sound and automatic tools, scalability remains critical. We develop methods for the polyhedral abstraction of hybrid automata, which construct coarse overapproximations and tightens them incrementally, in a CEGAR fashion. We use template polyhedra, i.e., polyhedra whose facets are normal to a given set of directions.\r\nWhile, previously, directions were given by the user, we introduce (1) the first method\r\nfor computing template directions from spurious counterexamples, so as to generalize and\r\neliminate them. The method applies naturally to convex hybrid automata, i.e., hybrid\r\nautomata with (possibly non-linear) convex constraints on derivatives only, while for linear\r\nODE requires further abstraction. Specifically, we introduce (2) the conic abstractions,\r\nwhich, partitioning the state space into appropriate (possibly non-uniform) cones, divide\r\ncurvy trajectories into relatively straight sections, suitable for polyhedral abstractions.\r\nFinally, we introduce (3) space-time interpolation, which, combining interval arithmetic\r\nand template refinement, computes appropriate (possibly non-uniform) time partitioning\r\nand template directions along spurious trajectories, so as to eliminate them.\r\nWe obtain sound and automatic methods for the reachability analysis over dense\r\nand unbounded time of convex hybrid automata and hybrid automata with linear ODE.\r\nWe build prototype tools and compare—favorably—our methods against the respective\r\nstate-of-the-art tools, on several benchmarks.","lang":"eng"}],"related_material":{"record":[{"status":"public","id":"631","relation":"part_of_dissertation"},{"status":"public","id":"647","relation":"part_of_dissertation"},{"status":"public","id":"140","relation":"part_of_dissertation"}]},"file":[{"creator":"mgiacobbe","file_size":4100685,"date_updated":"2020-07-14T12:47:43Z","file_name":"giacobbe_thesis.pdf","date_created":"2019-09-27T14:15:05Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"6916","checksum":"773beaf4a85dc2acc2c12b578fbe1965"},{"date_created":"2019-09-27T14:22:04Z","file_name":"giacobbe_thesis_src.tar.gz","creator":"mgiacobbe","date_updated":"2020-07-14T12:47:43Z","file_size":7959732,"checksum":"97f1c3da71feefd27e6e625d32b4c75b","file_id":"6917","access_level":"closed","relation":"source_file","content_type":"application/gzip"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2663-337X"]},"degree_awarded":"PhD","publication_status":"published"},{"_id":"9805","status":"public","type":"research_data_reference","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"mla":"Barton, Nicholas H. Data from: The Consequences of an Introgression Event. Dryad, 2019, doi:10.5061/dryad.2kb6fh4.","short":"N.H. Barton, (2019).","ieee":"N. H. Barton, “Data from: The consequences of an introgression event.” Dryad, 2019.","ama":"Barton NH. Data from: The consequences of an introgression event. 2019. doi:10.5061/dryad.2kb6fh4","apa":"Barton, N. H. (2019). Data from: The consequences of an introgression event. Dryad. https://doi.org/10.5061/dryad.2kb6fh4","chicago":"Barton, Nicholas H. “Data from: The Consequences of an Introgression Event.” Dryad, 2019. https://doi.org/10.5061/dryad.2kb6fh4.","ista":"Barton NH. 2019. Data from: The consequences of an introgression event, Dryad, 10.5061/dryad.2kb6fh4."},"date_updated":"2023-09-19T10:06:07Z","department":[{"_id":"NiBa"}],"title":"Data from: The consequences of an introgression event","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"}],"article_processing_charge":"No","oa_version":"Published Version","abstract":[{"text":"The spread of adaptive alleles is fundamental to evolution, and in theory, this process is well‐understood. However, only rarely can we follow this process—whether it originates from the spread of a new mutation, or by introgression from another population. In this issue of Molecular Ecology, Hanemaaijer et al. (2018) report on a 25‐year long study of the mosquitoes Anopheles gambiae (Figure 1) and Anopheles coluzzi in Mali, based on genotypes at 15 single‐nucleotide polymorphism (SNP). The species are usually reproductively isolated from each other, but in 2002 and 2006, bursts of hybridization were observed, when F1 hybrids became abundant. Alleles backcrossed from A. gambiae into A. coluzzi, but after the first event, these declined over the following years. In contrast, after 2006, an insecticide resistance allele that had established in A. gambiae spread into A. coluzzi, and rose to high frequency there, over 6 years (~75 generations). Whole genome sequences of 74 individuals showed that A. gambiae SNP from across the genome had become common in the A. coluzzi population, but that most of these were clustered in 34 genes around the resistance locus. A new set of SNP from 25 of these genes were assayed over time; over the 4 years since near‐fixation of the resistance allele; some remained common, whereas others declined. What do these patterns tell us about this introgression event?","lang":"eng"}],"month":"01","publisher":"Dryad","oa":1,"main_file_link":[{"url":"https://doi.org/10.5061/dryad.2kb6fh4","open_access":"1"}],"day":"09","year":"2019","related_material":{"record":[{"relation":"used_in_publication","id":"40","status":"public"}]},"date_published":"2019-01-09T00:00:00Z","doi":"10.5061/dryad.2kb6fh4","date_created":"2021-08-06T12:03:50Z"},{"project":[{"call_identifier":"FP7","_id":"2536F660-B435-11E9-9278-68D0E5697425","grant_number":"334077","name":"Investigating the role of transporters in invasive migration through junctions"}],"author":[{"first_name":"Guillaume","full_name":"Trébuchet, Guillaume","last_name":"Trébuchet"},{"first_name":"Pierre B","full_name":"Cattenoz, Pierre B","last_name":"Cattenoz"},{"last_name":"Zsámboki","full_name":"Zsámboki, János","first_name":"János"},{"full_name":"Mazaud, David","last_name":"Mazaud","first_name":"David"},{"last_name":"Siekhaus","full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353","first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fanto, Manolis","last_name":"Fanto","first_name":"Manolis"},{"first_name":"Angela","last_name":"Giangrande","full_name":"Giangrande, Angela"}],"publist_id":"8048","external_id":{"isi":["000455189900006"],"pmid":["30504274"]},"article_processing_charge":"No","title":"The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate","citation":{"ista":"Trébuchet G, Cattenoz PB, Zsámboki J, Mazaud D, Siekhaus DE, Fanto M, Giangrande A. 2019. The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. Journal of Neuroscience. 39(2), 238–255.","chicago":"Trébuchet, Guillaume, Pierre B Cattenoz, János Zsámboki, David Mazaud, Daria E Siekhaus, Manolis Fanto, and Angela Giangrande. “The Repo Homeodomain Transcription Factor Suppresses Hematopoiesis in Drosophila and Preserves the Glial Fate.” Journal of Neuroscience. Society for Neuroscience, 2019. https://doi.org/10.1523/JNEUROSCI.1059-18.2018.","apa":"Trébuchet, G., Cattenoz, P. B., Zsámboki, J., Mazaud, D., Siekhaus, D. E., Fanto, M., & Giangrande, A. (2019). The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.1059-18.2018","ama":"Trébuchet G, Cattenoz PB, Zsámboki J, et al. The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. Journal of Neuroscience. 2019;39(2):238-255. doi:10.1523/JNEUROSCI.1059-18.2018","ieee":"G. Trébuchet et al., “The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate,” Journal of Neuroscience, vol. 39, no. 2. Society for Neuroscience, pp. 238–255, 2019.","short":"G. Trébuchet, P.B. Cattenoz, J. Zsámboki, D. Mazaud, D.E. Siekhaus, M. Fanto, A. Giangrande, Journal of Neuroscience 39 (2019) 238–255.","mla":"Trébuchet, Guillaume, et al. “The Repo Homeodomain Transcription Factor Suppresses Hematopoiesis in Drosophila and Preserves the Glial Fate.” Journal of Neuroscience, vol. 39, no. 2, Society for Neuroscience, 2019, pp. 238–55, doi:10.1523/JNEUROSCI.1059-18.2018."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Society for Neuroscience","quality_controlled":"1","oa":1,"acknowledgement":"This work was supported by INSERM, CNRS, UDS, Ligue Régionale contre le Cancer, Hôpital de Strasbourg, Association pour la Recherche sur le Cancer (ARC) and Agence Nationale de la Recherche (ANR) grants. P.B.C. was funded by the ANR and by the ARSEP (Fondation pour l'Aide à la Recherche sur la Sclérose en Plaques), and G.T. by governmental and ARC fellowships. This work was also supported by grants from the Ataxia UK (2491) and the NC3R (NC/L000199/1) awarded to M.F. The Institut de Génétique et de Biologie Moléculaire et Cellulaire was also supported by a French state fund through the ANR labex. D.E.S. was funded by Marie Curie Grant CIG 334077/IRTIM. We thank B. Altenhein, K. Brückner, M. Crozatier, L. Waltzer, M. Logan, E. Kurant, R. Reuter, E. Kurucz, J.L Dimarcq, J. Hoffmann, C. Goodman, the DHSB, and the BDSC for reagents and flies. We also thank all of the laboratory members for comments on the manuscript; C. Diebold, C. Delaporte, M. Pezze, the fly, and imaging and antibody facilities for technical assistance; and D. Dembele for help with statistics. In addition, we thank Alison Brewer for help with Luciferase assays.","page":"238-255","doi":"10.1523/JNEUROSCI.1059-18.2018","date_published":"2019-01-09T00:00:00Z","date_created":"2018-12-11T11:44:07Z","isi":1,"has_accepted_license":"1","year":"2019","day":"09","publication":"Journal of Neuroscience","article_type":"original","type":"journal_article","status":"public","_id":"8","department":[{"_id":"DaSi"}],"file_date_updated":"2020-10-02T09:33:28Z","date_updated":"2023-09-19T10:10:55Z","ddc":["570"],"scopus_import":"1","month":"01","intvolume":" 39","abstract":[{"lang":"eng","text":"Despite their different origins, Drosophila glia and hemocytes are related cell populations that provide an immune function. Drosophila hemocytes patrol the body cavity and act as macrophages outside the nervous system whereas glia originate from the neuroepithelium and provide the scavenger population of the nervous system. Drosophila glia are hence the functional orthologs of vertebrate microglia, even though the latter are cells of immune origin that subsequently move into the brain during development. Interestingly, the Drosophila immune cells within (glia) and outside the nervous system (hemocytes) require the same transcription factor Glide/Gcm for their development. This raises the issue of how do glia specifically differentiate in the nervous system and hemocytes in the procephalic mesoderm. The Repo homeodomain transcription factor and pan-glial direct target of Glide/Gcm is known to ensure glial terminal differentiation. Here we show that Repo also takes center stage in the process that discriminates between glia and hemocytes. First, Repo expression is repressed in the hemocyte anlagen by mesoderm-specific factors. Second, Repo ectopic activation in the procephalic mesoderm is sufficient to repress the expression of hemocyte-specific genes. Third, the lack of Repo triggers the expression of hemocyte markers in glia. Thus, a complex network of tissue-specific cues biases the potential of Glide/Gcm. These data allow us to revise the concept of fate determinants and help us understand the bases of cell specification. Both sexes were analyzed.SIGNIFICANCE STATEMENTDistinct cell types often require the same pioneer transcription factor, raising the issue of how does one factor trigger different fates. In Drosophila, glia and hemocytes provide a scavenger activity within and outside the nervous system, respectively. While they both require the Glide/Gcm transcription factor, glia originate from the ectoderm, hemocytes from the mesoderm. Here we show that tissue-specific factors inhibit the gliogenic potential of Glide/Gcm in the mesoderm by repressing the expression of the homeodomain protein Repo, a major glial-specific target of Glide/Gcm. Repo expression in turn inhibits the expression of hemocyte-specific genes in the nervous system. These cell-specific networks secure the establishment of the glial fate only in the nervous system and allow cell diversification."}],"pmid":1,"oa_version":"Published Version","issue":"2","volume":39,"ec_funded":1,"publication_status":"published","file":[{"file_size":9455414,"date_updated":"2020-10-02T09:33:28Z","creator":"dernst","file_name":"2019_JournNeuroscience_Trebuchet.pdf","date_created":"2020-10-02T09:33:28Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"8596","checksum":"8f6925eb4cd1e8747d8ea25929c68de6"}],"language":[{"iso":"eng"}]}]