[{"_id":"197","type":"dissertation","pubrep_id":"1021","status":"public","date_updated":"2023-09-07T12:51:46Z","supervisor":[{"first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"ddc":["004"],"department":[{"_id":"ChLa"}],"file_date_updated":"2020-07-14T12:45:22Z","abstract":[{"text":"Modern computer vision systems heavily rely on statistical machine learning models, which typically require large amounts of labeled data to be learned reliably. Moreover, very recently computer vision research widely adopted techniques for representation learning, which further increase the demand for labeled data. However, for many important practical problems there is relatively small amount of labeled data available, so it is problematic to leverage full potential of the representation learning methods. One way to overcome this obstacle is to invest substantial resources into producing large labelled datasets. Unfortunately, this can be prohibitively expensive in practice. In this thesis we focus on the alternative way of tackling the aforementioned issue. We concentrate on methods, which make use of weakly-labeled or even unlabeled data. Specifically, the first half of the thesis is dedicated to the semantic image segmentation task. We develop a technique, which achieves competitive segmentation performance and only requires annotations in a form of global image-level labels instead of dense segmentation masks. Subsequently, we present a new methodology, which further improves segmentation performance by leveraging tiny additional feedback from a human annotator. By using our methods practitioners can greatly reduce the amount of data annotation effort, which is required to learn modern image segmentation models. In the second half of the thesis we focus on methods for learning from unlabeled visual data. We study a family of autoregressive models for modeling structure of natural images and discuss potential applications of these models. Moreover, we conduct in-depth study of one of these applications, where we develop the state-of-the-art model for the probabilistic image colorization task.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"05","degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5113","checksum":"bc678e02468d8ebc39dc7267dfb0a1c4","creator":"system","file_size":12918758,"date_updated":"2020-07-14T12:45:22Z","file_name":"IST-2018-1021-v1+1_thesis-unsigned-pdfa.pdf","date_created":"2018-12-12T10:14:57Z"},{"content_type":"application/zip","relation":"source_file","access_level":"closed","checksum":"bc66973b086da5a043f1162dcfb1fde4","file_id":"6225","file_size":55973760,"date_updated":"2020-07-14T12:45:22Z","creator":"dernst","file_name":"2018_Thesis_Kolesnikov_source.zip","date_created":"2019-04-05T09:34:49Z"}],"ec_funded":1,"project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding"}],"citation":{"mla":"Kolesnikov, Alexander. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1021.","short":"A. Kolesnikov, Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images, Institute of Science and Technology Austria, 2018.","ieee":"A. Kolesnikov, “Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images,” Institute of Science and Technology Austria, 2018.","ama":"Kolesnikov A. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. 2018. doi:10.15479/AT:ISTA:th_1021","apa":"Kolesnikov, A. (2018). Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1021","chicago":"Kolesnikov, Alexander. “Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1021.","ista":"Kolesnikov A. 2018. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. Institute of Science and Technology Austria."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","publist_id":"7718","author":[{"first_name":"Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","last_name":"Kolesnikov","full_name":"Kolesnikov, Alexander"}],"title":"Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images","acknowledgement":"I also gratefully acknowledge the support of NVIDIA Corporation with the donation of the GPUs used for this research.","oa":1,"publisher":"Institute of Science and Technology Austria","year":"2018","has_accepted_license":"1","day":"25","page":"113","date_created":"2018-12-11T11:45:09Z","doi":"10.15479/AT:ISTA:th_1021","date_published":"2018-05-25T00:00:00Z"},{"intvolume":" 2","month":"12","oa_version":"Published Version","abstract":[{"lang":"eng","text":"A central problem of algebraic topology is to understand the homotopy groups 𝜋𝑑(𝑋) of a topological space X. For the computational version of the problem, it is well known that there is no algorithm to decide whether the fundamental group 𝜋1(𝑋) of a given finite simplicial complex X is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex X that is simply connected (i.e., with 𝜋1(𝑋) trivial), compute the higher homotopy group 𝜋𝑑(𝑋) for any given 𝑑≥2 . However, these algorithms come with a caveat: They compute the isomorphism type of 𝜋𝑑(𝑋) , 𝑑≥2 as an abstract finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of 𝜋𝑑(𝑋) . Converting elements of this abstract group into explicit geometric maps from the d-dimensional sphere 𝑆𝑑 to X has been one of the main unsolved problems in the emerging field of computational homotopy theory. Here we present an algorithm that, given a simply connected space X, computes 𝜋𝑑(𝑋) and represents its elements as simplicial maps from a suitable triangulation of the d-sphere 𝑆𝑑 to X. For fixed d, the algorithm runs in time exponential in size(𝑋) , the number of simplices of X. Moreover, we prove that this is optimal: For every fixed 𝑑≥2 , we construct a family of simply connected spaces X such that for any simplicial map representing a generator of 𝜋𝑑(𝑋) , the size of the triangulation of 𝑆𝑑 on which the map is defined, is exponential in size(𝑋) ."}],"license":"https://creativecommons.org/licenses/by/4.0/","issue":"3-4","volume":2,"related_material":{"record":[{"id":"6681","status":"public","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"file":[{"checksum":"cf9e7fcd2a113dd4828774fc75cdb7e8","file_id":"6775","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2018_JourAppliedComputTopology_Filakovsky.pdf","date_created":"2019-08-08T06:55:21Z","creator":"dernst","file_size":1056278,"date_updated":"2020-07-14T12:47:40Z"}],"publication_status":"published","publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"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)"},"article_type":"original","type":"journal_article","_id":"6774","department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:47:40Z","ddc":["514"],"date_updated":"2023-09-07T13:10:36Z","oa":1,"quality_controlled":"1","publisher":"Springer","date_created":"2019-08-08T06:47:40Z","date_published":"2018-12-01T00:00:00Z","doi":"10.1007/s41468-018-0021-5","page":"177-231","publication":"Journal of Applied and Computational Topology","day":"01","year":"2018","has_accepted_license":"1","project":[{"name":"Robust invariants of Nonlinear Systems","grant_number":"M01980","_id":"25F8B9BC-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","name":"FWF Open Access Fund"}],"title":"Computing simplicial representatives of homotopy group elements","author":[{"full_name":"Filakovský, Marek","last_name":"Filakovský","first_name":"Marek","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87","last_name":"Franek","orcid":"0000-0001-8878-8397","full_name":"Franek, Peter"},{"last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"},{"id":"3AA52972-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan Y","last_name":"Zhechev","full_name":"Zhechev, Stephan Y"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Filakovský, M., Franek, P., Wagner, U., & Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. Springer. https://doi.org/10.1007/s41468-018-0021-5","ama":"Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5","ieee":"M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial representatives of homotopy group elements,” Journal of Applied and Computational Topology, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.","short":"M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.","mla":"Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.","ista":"Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4), 177–231.","chicago":"Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology. Springer, 2018. https://doi.org/10.1007/s41468-018-0021-5."}},{"date_updated":"2023-09-07T13:18:00Z","ddc":["000"],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:44:44Z","_id":"133","type":"conference","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)"},"conference":{"name":"CONCUR: International Conference on Concurrency Theory","location":"Beijing, China","end_date":"2018-09-07","start_date":"2018-09-04"},"status":"public","pubrep_id":"1039","publication_identifier":{"issn":["18688969"]},"publication_status":"published","file":[{"file_id":"5368","checksum":"c90895f4c5fafc18ddc54d1c8848077e","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:18:46Z","file_name":"IST-2018-853-v2+2_concur2018.pdf","date_updated":"2020-07-14T12:44:44Z","file_size":745438,"creator":"system"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"6426","relation":"earlier_version"},{"relation":"dissertation_contains","id":"8332","status":"public"}]},"volume":118,"abstract":[{"lang":"eng","text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent computation threads. We present synchronization, a new proof rule that simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Modular verification is enabled via pending asynchronous calls in atomic summaries, and a complementary proof rule that eliminates pending asynchronous calls when components and their specifications are composed. We evaluate synchronization in the context of a multi-layer refinement verification methodology on a collection of benchmark programs."}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"month":"08","intvolume":" 118","citation":{"chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the Asynchronous,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21.","ista":"Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 118, 21.","mla":"Kragl, Bernhard, et al. Synchronizing the Asynchronous. Vol. 118, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.21.","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Synchronizing the asynchronous,” presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","apa":"Kragl, B., Qadeer, S., & Henzinger, T. A. (2018). Synchronizing the asynchronous (Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21","ama":"Kragl B, Qadeer S, Henzinger TA. Synchronizing the asynchronous. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.21"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","last_name":"Kragl"},{"last_name":"Qadeer","full_name":"Qadeer, Shaz","first_name":"Shaz"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"publist_id":"7790","title":"Synchronizing the asynchronous","article_number":"21","project":[{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","year":"2018","day":"13","date_published":"2018-08-13T00:00:00Z","doi":"10.4230/LIPIcs.CONCUR.2018.21","date_created":"2018-12-11T11:44:48Z","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1},{"article_number":"34","project":[{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"citation":{"mla":"Edelsbrunner, Herbert, and Georg F. Osang. The Multi-Cover Persistence of Euclidean Balls. Vol. 99, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.34.","short":"H. Edelsbrunner, G.F. Osang, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ieee":"H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean balls,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.","ama":"Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.34","apa":"Edelsbrunner, H., & Osang, G. F. (2018). The multi-cover persistence of Euclidean balls (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.34","chicago":"Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence of Euclidean Balls,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.34.","ista":"Edelsbrunner H, Osang GF. 2018. The multi-cover persistence of Euclidean balls. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 34."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"464B40D6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg F","last_name":"Osang","full_name":"Osang, Georg F","orcid":"0000-0002-8882-5116"}],"publist_id":"7732","title":"The multi-cover persistence of Euclidean balls","acknowledgement":"This work is partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","year":"2018","has_accepted_license":"1","day":"11","date_created":"2018-12-11T11:45:05Z","date_published":"2018-06-11T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2018.34","_id":"187","conference":{"end_date":"2018-06-14","location":"Budapest, Hungary","start_date":"2018-06-11","name":"SoCG: Symposium on Computational Geometry"},"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":"conference","status":"public","date_updated":"2023-09-07T13:29:00Z","ddc":["516"],"file_date_updated":"2020-07-14T12:45:19Z","department":[{"_id":"HeEd"}],"abstract":[{"text":"Given a locally finite X ⊆ ℝd and a radius r ≥ 0, the k-fold cover of X and r consists of all points in ℝd that have k or more points of X within distance r. We consider two filtrations - one in scale obtained by fixing k and increasing r, and the other in depth obtained by fixing r and decreasing k - and we compute the persistence diagrams of both. While standard methods suffice for the filtration in scale, we need novel geometric and topological concepts for the filtration in depth. In particular, we introduce a rhomboid tiling in ℝd+1 whose horizontal integer slices are the order-k Delaunay mosaics of X, and construct a zigzag module from Delaunay mosaics that is isomorphic to the persistence module of the multi-covers. ","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"intvolume":" 99","month":"06","publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-18T09:27:22Z","file_name":"2018_LIPIcs_Edelsbrunner_Osang.pdf","date_updated":"2020-07-14T12:45:19Z","file_size":528018,"creator":"dernst","checksum":"d8c0533ad0018eb4ed1077475eb8fc18","file_id":"5738","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"volume":99,"related_material":{"record":[{"relation":"later_version","id":"9317","status":"public"},{"relation":"dissertation_contains","id":"9056","status":"public"}]}},{"oa_version":"Published Version","abstract":[{"text":"We consider families of confocal conics and two pencils of Apollonian circles having the same foci. We will show that these families of curves generate trivial 3-webs and find the exact formulas describing them.","lang":"eng"}],"month":"06","intvolume":" 194","scopus_import":"1","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"1febcfc1266486053a069e3425ea3713","file_id":"7222","creator":"kschuh","file_size":1140860,"date_updated":"2020-07-14T12:47:44Z","file_name":"2018_Springer_Akopyan.pdf","date_created":"2020-01-03T11:35:08Z"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"1","volume":194,"ec_funded":1,"_id":"692","status":"public","article_type":"original","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)"},"ddc":["510"],"date_updated":"2023-09-08T11:40:29Z","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:47:44Z","quality_controlled":"1","publisher":"Springer","oa":1,"day":"01","publication":"Geometriae Dedicata","has_accepted_license":"1","isi":1,"year":"2018","date_published":"2018-06-01T00:00:00Z","doi":"10.1007/s10711-017-0265-6","date_created":"2018-12-11T11:47:57Z","page":"55 - 64","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"apa":"Akopyan, A. (2018). 3-Webs generated by confocal conics and circles. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0265-6","ama":"Akopyan A. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 2018;194(1):55-64. doi:10.1007/s10711-017-0265-6","short":"A. Akopyan, Geometriae Dedicata 194 (2018) 55–64.","ieee":"A. Akopyan, “3-Webs generated by confocal conics and circles,” Geometriae Dedicata, vol. 194, no. 1. Springer, pp. 55–64, 2018.","mla":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae Dedicata, vol. 194, no. 1, Springer, 2018, pp. 55–64, doi:10.1007/s10711-017-0265-6.","ista":"Akopyan A. 2018. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 194(1), 55–64.","chicago":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0265-6."},"title":"3-Webs generated by confocal conics and circles","publist_id":"7014","author":[{"orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","last_name":"Akopyan","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000431418800004"]}},{"oa_version":"Published Version","abstract":[{"text":"Holes confined in quantum dots have gained considerable interest in the past few years due to their potential as spin qubits. Here we demonstrate two-axis control of a spin 3/2 qubit in natural Ge. The qubit is formed in a hut wire double quantum dot device. The Pauli spin blockade principle allowed us to demonstrate electric dipole spin resonance by applying a radio frequency electric field to one of the electrodes defining the double quantum dot. Coherent hole spin oscillations with Rabi frequencies reaching 140 MHz are demonstrated and dephasing times of 130 ns are measured. The reported results emphasize the potential of Ge as a platform for fast and electrically tunable hole spin qubit devices.","lang":"eng"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"month":"09","intvolume":" 9","scopus_import":"1","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5687","checksum":"e7148c10a64497e279c4de570b6cc544","file_size":1063469,"date_updated":"2020-07-14T12:48:02Z","creator":"dernst","file_name":"2018_NatureComm_Watzinger.pdf","date_created":"2018-12-17T10:28:30Z"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"3902 ","volume":9,"related_material":{"record":[{"id":"7977","relation":"popular_science"},{"status":"public","id":"7996","relation":"dissertation_contains"}]},"ec_funded":1,"_id":"77","status":"public","article_type":"original","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)"},"ddc":["530"],"date_updated":"2023-09-08T11:44:02Z","file_date_updated":"2020-07-14T12:48:02Z","department":[{"_id":"GeKa"}],"quality_controlled":"1","publisher":"Nature Publishing Group","oa":1,"day":"25","publication":"Nature Communications","has_accepted_license":"1","isi":1,"year":"2018","doi":"10.1038/s41467-018-06418-4","date_published":"2018-09-25T00:00:00Z","date_created":"2018-12-11T11:44:30Z","project":[{"grant_number":"335497","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","call_identifier":"FP7","_id":"25517E86-B435-11E9-9278-68D0E5697425"},{"grant_number":"Y00715","name":"Loch Spin-Qubits und Majorana-Fermionen in Germanium","_id":"2552F888-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Watzinger H, Kukucka J, Vukušić L, Gao F, Wang T, Schäffler F, Zhang J, Katsaros G. 2018. A germanium hole spin qubit. Nature Communications. 9(3902).","chicago":"Watzinger, Hannes, Josip Kukucka, Lada Vukušić, Fei Gao, Ting Wang, Friedrich Schäffler, Jian Zhang, and Georgios Katsaros. “A Germanium Hole Spin Qubit.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-06418-4.","ieee":"H. Watzinger et al., “A germanium hole spin qubit,” Nature Communications, vol. 9, no. 3902. Nature Publishing Group, 2018.","short":"H. Watzinger, J. Kukucka, L. Vukušić, F. Gao, T. Wang, F. Schäffler, J. Zhang, G. Katsaros, Nature Communications 9 (2018).","apa":"Watzinger, H., Kukucka, J., Vukušić, L., Gao, F., Wang, T., Schäffler, F., … Katsaros, G. (2018). A germanium hole spin qubit. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-018-06418-4","ama":"Watzinger H, Kukucka J, Vukušić L, et al. A germanium hole spin qubit. Nature Communications. 2018;9(3902). doi:10.1038/s41467-018-06418-4","mla":"Watzinger, Hannes, et al. “A Germanium Hole Spin Qubit.” Nature Communications, vol. 9, no. 3902, Nature Publishing Group, 2018, doi:10.1038/s41467-018-06418-4."},"title":"A germanium hole spin qubit","author":[{"id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","first_name":"Hannes","last_name":"Watzinger","full_name":"Watzinger, Hannes"},{"first_name":"Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","full_name":"Kukucka, Josip","last_name":"Kukucka"},{"first_name":"Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","last_name":"Vukusic","orcid":"0000-0003-2424-8636","full_name":"Vukusic, Lada"},{"full_name":"Gao, Fei","last_name":"Gao","first_name":"Fei"},{"full_name":"Wang, Ting","last_name":"Wang","first_name":"Ting"},{"first_name":"Friedrich","full_name":"Schäffler, Friedrich","last_name":"Schäffler"},{"first_name":"Jian","full_name":"Zhang, Jian","last_name":"Zhang"},{"orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios","last_name":"Katsaros","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"isi":["000445560800010"]},"article_processing_charge":"Yes"},{"external_id":{"isi":["000428165400009"]},"article_processing_charge":"No","publist_id":"7427","author":[{"last_name":"Qin","full_name":"Qin, Xiang","first_name":"Xiang"},{"id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","first_name":"Edouard B","last_name":"Hannezo","full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561"},{"first_name":"Thomas","last_name":"Mangeat","full_name":"Mangeat, Thomas"},{"full_name":"Liu, Chang","last_name":"Liu","first_name":"Chang"},{"full_name":"Majumder, Pralay","last_name":"Majumder","first_name":"Pralay"},{"first_name":"Jjiaying","last_name":"Liu","full_name":"Liu, Jjiaying"},{"full_name":"Choesmel Cadamuro, Valerie","last_name":"Choesmel Cadamuro","first_name":"Valerie"},{"first_name":"Jocelyn","last_name":"Mcdonald","full_name":"Mcdonald, Jocelyn"},{"first_name":"Yinyao","full_name":"Liu, Yinyao","last_name":"Liu"},{"first_name":"Bin","full_name":"Yi, Bin","last_name":"Yi"},{"last_name":"Wang","full_name":"Wang, Xiaobo","first_name":"Xiaobo"}],"title":"A biochemical network controlling basal myosin oscillation","citation":{"ista":"Qin X, Hannezo EB, Mangeat T, Liu C, Majumder P, Liu J, Choesmel Cadamuro V, Mcdonald J, Liu Y, Yi B, Wang X. 2018. A biochemical network controlling basal myosin oscillation. Nature Communications. 9(1), 1210.","chicago":"Qin, Xiang, Edouard B Hannezo, Thomas Mangeat, Chang Liu, Pralay Majumder, Jjiaying Liu, Valerie Choesmel Cadamuro, et al. “A Biochemical Network Controlling Basal Myosin Oscillation.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-03574-5.","ieee":"X. Qin et al., “A biochemical network controlling basal myosin oscillation,” Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018.","short":"X. Qin, E.B. Hannezo, T. Mangeat, C. Liu, P. Majumder, J. Liu, V. Choesmel Cadamuro, J. Mcdonald, Y. Liu, B. Yi, X. Wang, Nature Communications 9 (2018).","ama":"Qin X, Hannezo EB, Mangeat T, et al. A biochemical network controlling basal myosin oscillation. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-03574-5","apa":"Qin, X., Hannezo, E. B., Mangeat, T., Liu, C., Majumder, P., Liu, J., … Wang, X. (2018). A biochemical network controlling basal myosin oscillation. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-018-03574-5","mla":"Qin, Xiang, et al. “A Biochemical Network Controlling Basal Myosin Oscillation.” Nature Communications, vol. 9, no. 1, 1210, Nature Publishing Group, 2018, doi:10.1038/s41467-018-03574-5."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_number":"1210","date_created":"2018-12-11T11:46:16Z","date_published":"2018-03-23T00:00:00Z","doi":"10.1038/s41467-018-03574-5","year":"2018","isi":1,"has_accepted_license":"1","publication":"Nature Communications","day":"23","oa":1,"publisher":"Nature Publishing Group","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:22Z","department":[{"_id":"EdHa"}],"date_updated":"2023-09-08T11:41:45Z","ddc":["539","570"],"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","pubrep_id":"996","status":"public","_id":"401","issue":"1","volume":9,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_id":"4902","checksum":"87a427bc2e8724be3dd22a4efdd21a33","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2018-996-v1+1_2018_Hannezo_A-biochemical.pdf","date_created":"2018-12-12T10:11:45Z","creator":"system","file_size":3780491,"date_updated":"2020-07-14T12:46:22Z"}],"scopus_import":"1","intvolume":" 9","month":"03","abstract":[{"lang":"eng","text":"The actomyosin cytoskeleton, a key stress-producing unit in epithelial cells, oscillates spontaneously in a wide variety of systems. Although much of the signal cascade regulating myosin activity has been characterized, the origin of such oscillatory behavior is still unclear. Here, we show that basal myosin II oscillation in Drosophila ovarian epithelium is not controlled by actomyosin cortical tension, but instead relies on a biochemical oscillator involving ROCK and myosin phosphatase. Key to this oscillation is a diffusive ROCK flow, linking junctional Rho1 to medial actomyosin cortex, and dynamically maintained by a self-activation loop reliant on ROCK kinase activity. In response to the resulting myosin II recruitment, myosin phosphatase is locally enriched and shuts off ROCK and myosin II signals. Coupling Drosophila genetics, live imaging, modeling, and optogenetics, we uncover an intrinsic biochemical oscillator at the core of myosin II regulatory network, shedding light on the spatio-temporal dynamics of force generation."}],"oa_version":"Published Version"},{"department":[{"_id":"MiSi"}],"date_updated":"2023-09-08T11:42:28Z","status":"public","type":"journal_article","_id":"318","issue":"4","volume":44,"language":[{"iso":"eng"}],"publication_status":"published","month":"02","intvolume":" 44","scopus_import":"1","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/29486189","open_access":"1"}],"pmid":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The insect’s fat body combines metabolic and immunological functions. In this issue of Developmental Cell, Franz et al. (2018) show that in Drosophila, cells of the fat body are not static, but can actively “swim” toward sites of epithelial injury, where they physically clog the wound and locally secrete antimicrobial peptides."}],"title":"A fat lot of good for wound healing","publist_id":"7547","author":[{"last_name":"Casano","orcid":"0000-0002-6009-6804","full_name":"Casano, Alessandra M","first_name":"Alessandra M","id":"3DBA3F4E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sixt","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K"}],"external_id":{"pmid":["29486189"],"isi":["000426150700002"]},"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Casano AM, Sixt MK. 2018. A fat lot of good for wound healing. Developmental Cell. 44(4), 405–406.","chicago":"Casano, Alessandra M, and Michael K Sixt. “A Fat Lot of Good for Wound Healing.” Developmental Cell. Cell Press, 2018. https://doi.org/10.1016/j.devcel.2018.02.009.","short":"A.M. Casano, M.K. Sixt, Developmental Cell 44 (2018) 405–406.","ieee":"A. M. Casano and M. K. Sixt, “A fat lot of good for wound healing,” Developmental Cell, vol. 44, no. 4. Cell Press, pp. 405–406, 2018.","apa":"Casano, A. M., & Sixt, M. K. (2018). A fat lot of good for wound healing. Developmental Cell. Cell Press. https://doi.org/10.1016/j.devcel.2018.02.009","ama":"Casano AM, Sixt MK. A fat lot of good for wound healing. Developmental Cell. 2018;44(4):405-406. doi:10.1016/j.devcel.2018.02.009","mla":"Casano, Alessandra M., and Michael K. Sixt. “A Fat Lot of Good for Wound Healing.” Developmental Cell, vol. 44, no. 4, Cell Press, 2018, pp. 405–06, doi:10.1016/j.devcel.2018.02.009."},"doi":"10.1016/j.devcel.2018.02.009","date_published":"2018-02-26T00:00:00Z","date_created":"2018-12-11T11:45:47Z","page":"405 - 406","day":"26","publication":"Developmental Cell","isi":1,"year":"2018","publisher":"Cell Press","quality_controlled":"1","oa":1,"acknowledgement":"Short Survey"},{"department":[{"_id":"MaJö"}],"file_date_updated":"2020-07-14T12:46:23Z","date_updated":"2023-09-08T11:48:39Z","ddc":["571","572"],"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)"},"status":"public","pubrep_id":"994","_id":"410","volume":8,"issue":"1","publication_status":"published","file":[{"date_created":"2018-12-12T10:10:42Z","file_name":"IST-2018-994-v1+1_2018_Joesch_A-micro-CT-based.pdf","date_updated":"2020-07-14T12:46:23Z","file_size":2359430,"creator":"system","checksum":"653fcb852f899c75b00ceee2a670d738","file_id":"4831","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"03","intvolume":" 8","abstract":[{"lang":"eng","text":"Lesion verification and quantification is traditionally done via histological examination of sectioned brains, a time-consuming process that relies heavily on manual estimation. Such methods are particularly problematic in posterior cortical regions (e.g. visual cortex), where sectioning leads to significant damage and distortion of tissue. Even more challenging is the post hoc localization of micro-electrodes, which relies on the same techniques, suffers from similar drawbacks and requires even higher precision. Here, we propose a new, simple method for quantitative lesion characterization and electrode localization that is less labor-intensive and yields more detailed results than conventional methods. We leverage staining techniques standard in electron microscopy with the use of commodity micro-CT imaging. We stain whole rat and zebra finch brains in osmium tetroxide, embed these in resin and scan entire brains in a micro-CT machine. The scans result in 3D reconstructions of the brains with section thickness dependent on sample size (12–15 and 5–6 microns for rat and zebra finch respectively) that can be segmented manually or automatically. Because the method captures the entire intact brain volume, comparisons within and across studies are more tractable, and the extent of lesions and electrodes may be studied with higher accuracy than with current methods."}],"oa_version":"Published Version","author":[{"last_name":"Masís","full_name":"Masís, Javier","first_name":"Javier"},{"first_name":"David","last_name":"Mankus","full_name":"Mankus, David"},{"full_name":"Wolff, Steffen","last_name":"Wolff","first_name":"Steffen"},{"last_name":"Guitchounts","full_name":"Guitchounts, Grigori","first_name":"Grigori"},{"id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","first_name":"Maximilian A","last_name":"Jösch","full_name":"Jösch, Maximilian A","orcid":"0000-0002-3937-1330"},{"full_name":"Cox, David","last_name":"Cox","first_name":"David"}],"publist_id":"7419","external_id":{"isi":["000428234100005"]},"article_processing_charge":"No","title":"A micro-CT-based method for quantitative brain lesion characterization and electrode localization","citation":{"short":"J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M.A. Jösch, D. Cox, Scientific Reports 8 (2018).","ieee":"J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M. A. Jösch, and D. Cox, “A micro-CT-based method for quantitative brain lesion characterization and electrode localization,” Scientific Reports, vol. 8, no. 1. Nature Publishing Group, 2018.","apa":"Masís, J., Mankus, D., Wolff, S., Guitchounts, G., Jösch, M. A., & Cox, D. (2018). A micro-CT-based method for quantitative brain lesion characterization and electrode localization. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-018-23247-z","ama":"Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. A micro-CT-based method for quantitative brain lesion characterization and electrode localization. Scientific Reports. 2018;8(1). doi:10.1038/s41598-018-23247-z","mla":"Masís, Javier, et al. “A Micro-CT-Based Method for Quantitative Brain Lesion Characterization and Electrode Localization.” Scientific Reports, vol. 8, no. 1, 5184, Nature Publishing Group, 2018, doi:10.1038/s41598-018-23247-z.","ista":"Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. 2018. A micro-CT-based method for quantitative brain lesion characterization and electrode localization. Scientific Reports. 8(1), 5184.","chicago":"Masís, Javier, David Mankus, Steffen Wolff, Grigori Guitchounts, Maximilian A Jösch, and David Cox. “A Micro-CT-Based Method for Quantitative Brain Lesion Characterization and Electrode Localization.” Scientific Reports. Nature Publishing Group, 2018. https://doi.org/10.1038/s41598-018-23247-z."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_number":"5184","doi":"10.1038/s41598-018-23247-z","date_published":"2018-03-26T00:00:00Z","date_created":"2018-12-11T11:46:19Z","isi":1,"has_accepted_license":"1","year":"2018","day":"26","publication":"Scientific Reports","publisher":"Nature Publishing Group","quality_controlled":"1","oa":1},{"_id":"277","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-09-08T13:21:05Z","ddc":["580"],"file_date_updated":"2020-07-14T12:45:45Z","department":[{"_id":"EvBe"}],"abstract":[{"text":"Arabidopsis and human ARM protein interact with telomerase. Deregulated mRNA levels of DNA repair and ribosomal protein genes in an Arabidopsis arm mutant suggest non-telomeric ARM function. The human homolog ARMC6 interacts with hTRF2. Abstract: Telomerase maintains telomeres and has proposed non-telomeric functions. We previously identified interaction of the C-terminal domain of Arabidopsis telomerase reverse transcriptase (AtTERT) with an armadillo/β-catenin-like repeat (ARM) containing protein. Here we explore protein–protein interactions of the ARM protein, AtTERT domains, POT1a, TRF-like family and SMH family proteins, and the chromatin remodeling protein CHR19 using bimolecular fluorescence complementation (BiFC), yeast two-hybrid (Y2H) analysis, and co-immunoprecipitation. The ARM protein interacts with both the N- and C-terminal domains of AtTERT in different cellular compartments. ARM interacts with CHR19 and TRF-like I family proteins that also bind AtTERT directly or through interaction with POT1a. The putative human ARM homolog co-precipitates telomerase activity and interacts with hTRF2 protein in vitro. Analysis of Arabidopsis arm mutants shows no obvious changes in telomere length or telomerase activity, suggesting that ARM is not essential for telomere maintenance. The observed interactions with telomerase and Myb-like domain proteins (TRF-like family I) may therefore reflect possible non-telomeric functions. Transcript levels of several DNA repair and ribosomal genes are affected in arm mutants, and ARM, likely in association with other proteins, suppressed expression of XRCC3 and RPSAA promoter constructs in luciferase reporter assays. In conclusion, ARM can participate in non-telomeric functions of telomerase, and can also perform its own telomerase-independent functions.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","month":"06","intvolume":" 97","publication_status":"published","file":[{"file_name":"2018_PlantMolecBio_Dokladal.pdf","date_created":"2020-05-14T12:23:08Z","creator":"dernst","file_size":1150679,"date_updated":"2020-07-14T12:45:45Z","file_id":"7834","checksum":"451ae47616e6af2533099f596b2a47fb","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"volume":97,"issue":"5","citation":{"ama":"Dokládal L, Benková E, Honys D, et al. An armadillo-domain protein participates in a telomerase interaction network. Plant Molecular Biology. 2018;97(5):407-420. doi:10.1007/s11103-018-0747-4","apa":"Dokládal, L., Benková, E., Honys, D., Dupláková, N., Lee, L., Gelvin, S., & Sýkorová, E. (2018). An armadillo-domain protein participates in a telomerase interaction network. Plant Molecular Biology. Springer. https://doi.org/10.1007/s11103-018-0747-4","ieee":"L. Dokládal et al., “An armadillo-domain protein participates in a telomerase interaction network,” Plant Molecular Biology, vol. 97, no. 5. Springer, pp. 407–420, 2018.","short":"L. Dokládal, E. Benková, D. Honys, N. Dupláková, L. Lee, S. Gelvin, E. Sýkorová, Plant Molecular Biology 97 (2018) 407–420.","mla":"Dokládal, Ladislav, et al. “An Armadillo-Domain Protein Participates in a Telomerase Interaction Network.” Plant Molecular Biology, vol. 97, no. 5, Springer, 2018, pp. 407–20, doi:10.1007/s11103-018-0747-4.","ista":"Dokládal L, Benková E, Honys D, Dupláková N, Lee L, Gelvin S, Sýkorová E. 2018. An armadillo-domain protein participates in a telomerase interaction network. Plant Molecular Biology. 97(5), 407–420.","chicago":"Dokládal, Ladislav, Eva Benková, David Honys, Nikoleta Dupláková, Lan Lee, Stanton Gelvin, and Eva Sýkorová. “An Armadillo-Domain Protein Participates in a Telomerase Interaction Network.” Plant Molecular Biology. Springer, 2018. https://doi.org/10.1007/s11103-018-0747-4."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Ladislav","last_name":"Dokládal","full_name":"Dokládal, Ladislav"},{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","last_name":"Benková"},{"first_name":"David","last_name":"Honys","full_name":"Honys, David"},{"first_name":"Nikoleta","full_name":"Dupláková, Nikoleta","last_name":"Dupláková"},{"full_name":"Lee, Lan","last_name":"Lee","first_name":"Lan"},{"first_name":"Stanton","full_name":"Gelvin, Stanton","last_name":"Gelvin"},{"last_name":"Sýkorová","full_name":"Sýkorová, Eva","first_name":"Eva"}],"publist_id":"7625","article_processing_charge":"No","external_id":{"isi":["000438981700009"]},"title":"An armadillo-domain protein participates in a telomerase interaction network","quality_controlled":"1","publisher":"Springer","oa":1,"isi":1,"has_accepted_license":"1","year":"2018","day":"12","publication":"Plant Molecular Biology","page":"407 - 420","doi":"10.1007/s11103-018-0747-4","date_published":"2018-06-12T00:00:00Z","date_created":"2018-12-11T11:45:34Z"}]