[{"external_id":{"isi":["000947350400036"],"arxiv":["2104.07278"]},"status":"public","oa":1,"acknowledgement":"We are grateful to the anonymous reviewers of LICS 2021 and of a previous version of this paper for insightful comments that helped improving the presentation. This research was partially supported by the grant ERC CoG 863818 (ForM-SMArt).","publication_identifier":{"eisbn":["978-1-6654-4895-6"],"issn":["1043-6871"],"isbn":["978-1-6654-4896-3"]},"citation":{"ama":"Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470595","ista":"Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470595.","ieee":"K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470595.","apa":"Chatterjee, K., & Doyen, L. (2021). Stochastic processes with expected stopping time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470595"},"type":"conference","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","page":"1-13","year":"2021","_id":"10004","arxiv":1,"abstract":[{"lang":"eng","text":"Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected total reward. Quite surprisingly we establish inter-reducibility of the expected stopping-time problem for Markov chains with the Positivity problem (which is related to the well-known Skolem problem), for which establishing either decidability or undecidability would be a major breakthrough. Given the hardness of the exact problem, we consider the approximate version of the problem: we show that it can be solved in exponential time for Markov chains and in exponential space for MDPs."}],"publisher":"Institute of Electrical and Electronics Engineers","department":[{"_id":"KrCh"}],"title":"Stochastic processes with expected stopping time","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","oa_version":"Preprint","date_created":"2021-09-12T22:01:25Z","ec_funded":1,"day":"07","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"month":"07","isi":1,"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.07278"}],"doi":"10.1109/LICS52264.2021.9470595","date_updated":"2025-07-14T09:10:08Z","article_processing_charge":"No","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"date_published":"2021-07-07T00:00:00Z","quality_controlled":"1","scopus_import":"1","keyword":["Computer science","Heuristic algorithms","Memory management","Automata","Markov processes","Probability distribution","Complexity theory"],"conference":{"start_date":"2021-06-29","location":"Rome, Italy","end_date":"2021-07-02","name":"LICS: Symposium on Logic in Computer Science"}},{"quality_controlled":"1","scopus_import":"1","keyword":["Nonlinear parabolic systems","implicit constitutive theory","weak solutions","existence","uniqueness"],"doi":"10.1142/S0218202521500457","date_updated":"2023-09-04T11:43:45Z","article_processing_charge":"No","date_published":"2021-08-25T00:00:00Z","author":[{"last_name":"Bulíček","first_name":"Miroslav","full_name":"Bulíček, Miroslav"},{"full_name":"Maringová, Erika","id":"dbabca31-66eb-11eb-963a-fb9c22c880b4","first_name":"Erika","last_name":"Maringová"},{"full_name":"Málek, Josef","last_name":"Málek","first_name":"Josef"}],"language":[{"iso":"eng"}],"project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"}],"isi":1,"month":"08","day":"25","publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/2009.06917","open_access":"1"}],"intvolume":" 31","abstract":[{"lang":"eng","text":"We study systems of nonlinear partial differential equations of parabolic type, in which the elliptic operator is replaced by the first-order divergence operator acting on a flux function, which is related to the spatial gradient of the unknown through an additional implicit equation. This setting, broad enough in terms of applications, significantly expands the paradigm of nonlinear parabolic problems. Formulating four conditions concerning the form of the implicit equation, we first show that these conditions describe a maximal monotone p-coercive graph. We then establish the global-in-time and large-data existence of a (weak) solution and its uniqueness. To this end, we adopt and significantly generalize Minty’s method of monotone mappings. A unified theory, containing several novel tools, is developed in a way to be tractable from the point of view of numerical approximations."}],"arxiv":1,"oa_version":"Preprint","date_created":"2021-09-12T22:01:25Z","publisher":"World Scientific","title":"On nonlinear problems of parabolic type with implicit constitutive equations involving flux","department":[{"_id":"JuFi"}],"publication":"Mathematical Models and Methods in Applied Sciences","publication_identifier":{"issn":["0218-2025"],"eissn":["1793-6314"]},"citation":{"ieee":"M. Bulíček, E. Maringová, and J. Málek, “On nonlinear problems of parabolic type with implicit constitutive equations involving flux,” Mathematical Models and Methods in Applied Sciences, vol. 31, no. 09. World Scientific, 2021.","chicago":"Bulíček, Miroslav, Erika Maringová, and Josef Málek. “On Nonlinear Problems of Parabolic Type with Implicit Constitutive Equations Involving Flux.” Mathematical Models and Methods in Applied Sciences. World Scientific, 2021. https://doi.org/10.1142/S0218202521500457.","apa":"Bulíček, M., Maringová, E., & Málek, J. (2021). On nonlinear problems of parabolic type with implicit constitutive equations involving flux. Mathematical Models and Methods in Applied Sciences. World Scientific. https://doi.org/10.1142/S0218202521500457","ama":"Bulíček M, Maringová E, Málek J. On nonlinear problems of parabolic type with implicit constitutive equations involving flux. Mathematical Models and Methods in Applied Sciences. 2021;31(09). doi:10.1142/S0218202521500457","mla":"Bulíček, Miroslav, et al. “On Nonlinear Problems of Parabolic Type with Implicit Constitutive Equations Involving Flux.” Mathematical Models and Methods in Applied Sciences, vol. 31, no. 09, World Scientific, 2021, doi:10.1142/S0218202521500457.","short":"M. Bulíček, E. Maringová, J. Málek, Mathematical Models and Methods in Applied Sciences 31 (2021).","ista":"Bulíček M, Maringová E, Málek J. 2021. On nonlinear problems of parabolic type with implicit constitutive equations involving flux. Mathematical Models and Methods in Applied Sciences. 31(09)."},"external_id":{"arxiv":["2009.06917"],"isi":["000722222900004"]},"article_type":"original","issue":"09","acknowledgement":"M. Bulíček and J. Málek acknowledge the support of the project No. 18-12719S financed by the Czech\r\nScience foundation (GAČR). E. Maringová acknowledges support from Charles University Research program \r\nUNCE/SCI/023, the grant SVV-2020-260583 by the Ministry of Education, Youth and Sports, Czech Republic\r\nand from the Austrian Science Fund (FWF), grants P30000, W1245, and F65. M. Bulíček and J. Málek are\r\nmembers of the Nečas Center for Mathematical Modelling.\r\n","status":"public","oa":1,"year":"2021","_id":"10005","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":31},{"publication_identifier":{"issn":["2663-337X"]},"citation":{"apa":"Hensel, S. (2021). Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10007","ieee":"S. Hensel, “Curvature driven interface evolution: Uniqueness properties of weak solution concepts,” Institute of Science and Technology Austria, 2021.","chicago":"Hensel, Sebastian. “Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10007.","ista":"Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria.","short":"S. Hensel, Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts, Institute of Science and Technology Austria, 2021.","mla":"Hensel, Sebastian. Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10007.","ama":"Hensel S. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. 2021. doi:10.15479/at:ista:10007"},"status":"public","oa":1,"year":"2021","has_accepted_license":"1","_id":"10007","supervisor":[{"orcid":"0000-0002-0479-558X","last_name":"Fischer","first_name":"Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","full_name":"Fischer, Julian L"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"dissertation","page":"300","abstract":[{"text":"The present thesis is concerned with the derivation of weak-strong uniqueness principles for curvature driven interface evolution problems not satisfying a comparison principle. The specific examples being treated are two-phase Navier-Stokes flow with surface tension, modeling the evolution of two incompressible, viscous and immiscible fluids separated by a sharp interface, and multiphase mean curvature flow, which serves as an idealized model for the motion of grain boundaries in an annealing polycrystalline material. Our main results - obtained in joint works with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation of geometric singularities due to topology changes, the weak solution concept of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial Differential Equations 55, 2016) to multiphase mean curvature flow (for networks in R^2 or double bubbles in R^3) represents the unique solution to these interface evolution problems within the class of classical solutions, respectively. To the best of the author's knowledge, for interface evolution problems not admitting a geometric comparison principle the derivation of a weak-strong uniqueness principle represented an open problem, so that the works contained in the present thesis constitute the first positive results in this direction. The key ingredient of our approach consists of the introduction of a novel concept of relative entropies for a class of curvature driven interface evolution problems, for which the associated energy contains an interfacial contribution being proportional to the surface area of the evolving (network of) interface(s). The interfacial part of the relative entropy gives sufficient control on the interface error between a weak and a classical solution, and its time evolution can be computed, at least in principle, for any energy dissipating weak solution concept. A resulting stability estimate for the relative entropy essentially entails the above mentioned weak-strong uniqueness principles. The present thesis contains a detailed introduction to our relative entropy approach, which in particular highlights potential applications to other problems in curvature driven interface evolution not treated in this thesis.","lang":"eng"}],"date_created":"2021-09-13T11:12:34Z","ec_funded":1,"oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","title":"Curvature driven interface evolution: Uniqueness properties of weak solution concepts","department":[{"_id":"GradSch"},{"_id":"JuFi"}],"month":"09","project":[{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"name":"Bridging Scales in Random Materials","grant_number":"948819","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"ddc":["515"],"day":"14","file":[{"content_type":"application/x-zip-compressed","date_created":"2021-09-13T11:03:24Z","relation":"source_file","creator":"shensel","access_level":"closed","file_size":15022154,"checksum":"c8475faaf0b680b4971f638f1db16347","file_name":"thesis_final_Hensel.zip","date_updated":"2021-09-15T14:37:30Z","file_id":"10008"},{"creator":"shensel","access_level":"open_access","relation":"main_file","date_created":"2021-09-13T14:18:56Z","content_type":"application/pdf","file_id":"10014","date_updated":"2021-09-14T09:52:47Z","file_name":"thesis_final_Hensel.pdf","checksum":"1a609937aa5275452822f45f2da17f07","file_size":6583638}],"publication_status":"published","degree_awarded":"PhD","article_processing_charge":"No","date_updated":"2023-09-07T13:30:45Z","alternative_title":["ISTA Thesis"],"related_material":{"record":[{"id":"10012","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"10013"},{"id":"7489","status":"public","relation":"part_of_dissertation"}]},"doi":"10.15479/at:ista:10007","author":[{"id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","full_name":"Hensel, Sebastian","orcid":"0000-0001-7252-8072","last_name":"Hensel","first_name":"Sebastian"}],"date_published":"2021-09-14T00:00:00Z","file_date_updated":"2021-09-15T14:37:30Z"},{"date_updated":"2023-05-03T10:34:38Z","doi":"10.48550/arXiv.2109.04233","article_processing_charge":"No","arxiv":1,"date_published":"2021-09-09T00:00:00Z","author":[{"id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","full_name":"Hensel, Sebastian","orcid":"0000-0001-7252-8072","last_name":"Hensel","first_name":"Sebastian"},{"full_name":"Laux, Tim","first_name":"Tim","last_name":"Laux"}],"abstract":[{"lang":"eng","text":"We propose a new weak solution concept for (two-phase) mean curvature flow which enjoys both (unconditional) existence and (weak-strong) uniqueness properties. These solutions are evolving varifolds, just as in Brakke's formulation, but are coupled to the phase volumes by a simple transport equation. First, we show that, in the exact same setup as in Ilmanen's proof [J. Differential Geom. 38, 417-461, (1993)], any limit point of solutions to the Allen-Cahn equation is a varifold solution in our sense. Second, we prove that any calibrated flow in the sense of Fischer et al. [arXiv:2003.05478] - and hence any classical solution to mean curvature flow - is unique in the class of our new varifold solutions. This is in sharp contrast to the case of Brakke flows, which a priori may disappear at any given time and are therefore fatally non-unique. Finally, we propose an extension of the solution concept to the multi-phase case which is at least guaranteed to satisfy a weak-strong uniqueness principle."}],"keyword":["Mean curvature flow","gradient flows","varifolds","weak solutions","weak-strong uniqueness","calibrated geometry","gradient-flow calibrations"],"article_number":"2109.04233","title":"A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness","department":[{"_id":"JuFi"}],"publication":"arXiv","oa_version":"Preprint","ec_funded":1,"date_created":"2021-09-13T12:17:10Z","day":"09","external_id":{"arxiv":["2109.04233"]},"oa":1,"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813. The content of this paper was developed and parts of it were written during a visit of the first author to the Hausdorff Center of Mathematics (HCM), University of Bonn. The hospitality and the support of HCM are gratefully acknowledged.","status":"public","language":[{"iso":"eng"}],"project":[{"grant_number":"948819","name":"Bridging Scales in Random Materials","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","call_identifier":"H2020"}],"month":"09","citation":{"ama":"Hensel S, Laux T. A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness. arXiv. doi:10.48550/arXiv.2109.04233","mla":"Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean Curvature Flow: Convergence of the Allen-Cahn Equation and Weak-Strong Uniqueness.” ArXiv, 2109.04233, doi:10.48550/arXiv.2109.04233.","ista":"Hensel S, Laux T. A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness. arXiv, 2109.04233.","short":"S. Hensel, T. Laux, ArXiv (n.d.).","chicago":"Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean Curvature Flow: Convergence of the Allen-Cahn Equation and Weak-Strong Uniqueness.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2109.04233.","ieee":"S. Hensel and T. Laux, “A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness,” arXiv. .","apa":"Hensel, S., & Laux, T. (n.d.). A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness. arXiv. https://doi.org/10.48550/arXiv.2109.04233"},"type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"submitted","year":"2021","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2109.04233"}],"_id":"10011"},{"language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","grant_number":"948819","name":"Bridging Scales in Random Materials","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d"}],"month":"08","citation":{"chicago":"Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2108.01733.","ieee":"S. Hensel and T. Laux, “Weak-strong uniqueness for the mean curvature flow of double bubbles,” arXiv. .","apa":"Hensel, S., & Laux, T. (n.d.). Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv. https://doi.org/10.48550/arXiv.2108.01733","ama":"Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv. doi:10.48550/arXiv.2108.01733","short":"S. Hensel, T. Laux, ArXiv (n.d.).","mla":"Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” ArXiv, 2108.01733, doi:10.48550/arXiv.2108.01733.","ista":"Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv, 2108.01733."},"day":"03","external_id":{"arxiv":["2108.01733"]},"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.","oa":1,"status":"public","publication_status":"submitted","year":"2021","main_file_link":[{"url":"https://arxiv.org/abs/2108.01733","open_access":"1"}],"_id":"10013","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We derive a weak-strong uniqueness principle for BV solutions to multiphase mean curvature flow of triple line clusters in three dimensions. Our proof is based on the explicit construction of a gradient-flow calibration in the sense of the recent work of Fischer et al. [arXiv:2003.05478] for any such cluster. This extends the two-dimensional construction to the three-dimensional case of surfaces meeting along triple junctions.","lang":"eng"}],"date_updated":"2023-09-07T13:30:45Z","doi":"10.48550/arXiv.2108.01733","related_material":{"record":[{"id":"13043","status":"public","relation":"later_version"},{"status":"public","relation":"dissertation_contains","id":"10007"}]},"article_processing_charge":"No","arxiv":1,"date_published":"2021-08-03T00:00:00Z","author":[{"last_name":"Hensel","orcid":"0000-0001-7252-8072","first_name":"Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","full_name":"Hensel, Sebastian"},{"first_name":"Tim","last_name":"Laux","full_name":"Laux, Tim"}],"oa_version":"Preprint","date_created":"2021-09-13T12:17:11Z","ec_funded":1,"article_number":"2108.01733","department":[{"_id":"JuFi"}],"title":"Weak-strong uniqueness for the mean curvature flow of double bubbles","publication":"arXiv"},{"author":[{"full_name":"Nikonorova, N","last_name":"Nikonorova","first_name":"N"},{"full_name":"Murphy, E","first_name":"E","last_name":"Murphy"},{"last_name":"Fonseca de Lima","first_name":"CF","full_name":"Fonseca de Lima, CF"},{"first_name":"S","last_name":"Zhu","full_name":"Zhu, S"},{"first_name":"B","last_name":"van de Cotte","full_name":"van de Cotte, B"},{"full_name":"Vu, LD","last_name":"Vu","first_name":"LD"},{"full_name":"Balcerowicz, D","last_name":"Balcerowicz","first_name":"D"},{"id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","full_name":"Li, Lanxin","last_name":"Li","orcid":"0000-0002-5607-272X","first_name":"Lanxin"},{"first_name":"X","last_name":"Kong","full_name":"Kong, X"},{"first_name":"G","last_name":"De Rop","full_name":"De Rop, G"},{"full_name":"Beeckman, T","last_name":"Beeckman","first_name":"T"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří"},{"first_name":"K","last_name":"Vissenberg","full_name":"Vissenberg, K"},{"first_name":"PC","last_name":"Morris","full_name":"Morris, PC"},{"full_name":"Ding, Z","last_name":"Ding","first_name":"Z"},{"full_name":"De Smet, I","last_name":"De Smet","first_name":"I"}],"date_published":"2021-07-02T00:00:00Z","article_processing_charge":"Yes","doi":"10.3390/cells10071665","date_updated":"2024-10-29T10:22:44Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10083"}]},"alternative_title":["Protein Phosphorylation and Cell Signaling in Plants"],"keyword":["primary root","(phospho)proteomics","auxin","(receptor) kinase"],"quality_controlled":"1","file_date_updated":"2021-09-16T09:07:06Z","article_number":"1665 ","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"pmid":1,"ddc":["575"],"day":"02","isi":1,"month":"07","project":[{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"}],"language":[{"iso":"eng"}],"intvolume":" 10","file":[{"creator":"cchlebak","access_level":"open_access","relation":"main_file","date_created":"2021-09-16T09:07:06Z","success":1,"content_type":"application/pdf","file_id":"10021","date_updated":"2021-09-16T09:07:06Z","checksum":"2a9f534b9c2200e72e2cde95afaf4eed","file_name":"2021_Cells_Nikonorova.pdf","file_size":2667848}],"publication_status":"published","abstract":[{"lang":"eng","text":"Auxin plays a dual role in growth regulation and, depending on the tissue and concentration of the hormone, it can either promote or inhibit division and expansion processes in plants. Recent studies have revealed that, beyond transcriptional reprogramming, alternative auxincontrolled mechanisms regulate root growth. Here, we explored the impact of different concentrations of the synthetic auxin NAA that establish growth-promoting and -repressing conditions on the root tip proteome and phosphoproteome, generating a unique resource. From the phosphoproteome data, we pinpointed (novel) growth regulators, such as the RALF34-THE1 module. Our results, together with previously published studies, suggest that auxin, H+-ATPases, cell wall modifications and cell wall sensing receptor-like kinases are tightly embedded in a pathway regulating cell elongation. Furthermore, our study assigned a novel role to MKK2 as a regulator of primary root growth and a (potential) regulator of auxin biosynthesis and signalling, and suggests the importance of the MKK2\r\nThr31 phosphorylation site for growth regulation in the Arabidopsis root tip."}],"publication":"Cells","title":"The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators","department":[{"_id":"JiFr"}],"publisher":"MDPI","ec_funded":1,"date_created":"2021-09-14T11:36:20Z","oa_version":"Published Version","status":"public","oa":1,"acknowledgement":"We thank the Nottingham Stock Centre for seeds, Frank Van Breusegem for the phb3 mutant, and Herman Höfte for the the1 mutant. Open Access Funding by the Austrian Science Fund (FWF).","article_type":"original","external_id":{"pmid":["34359847"],"isi":["000676604700001"]},"citation":{"chicago":"Nikonorova, N, E Murphy, CF Fonseca de Lima, S Zhu, B van de Cotte, LD Vu, D Balcerowicz, et al. “The Arabidopsis Root Tip (Phospho)Proteomes at Growth-Promoting versus Growth-Repressing Conditions Reveal Novel Root Growth Regulators.” Cells. MDPI, 2021. https://doi.org/10.3390/cells10071665.","ieee":"N. Nikonorova et al., “The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators,” Cells, vol. 10. MDPI, 2021.","apa":"Nikonorova, N., Murphy, E., Fonseca de Lima, C., Zhu, S., van de Cotte, B., Vu, L., … De Smet, I. (2021). The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators. Cells. MDPI. https://doi.org/10.3390/cells10071665","ama":"Nikonorova N, Murphy E, Fonseca de Lima C, et al. The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators. Cells. 2021;10. doi:10.3390/cells10071665","mla":"Nikonorova, N., et al. “The Arabidopsis Root Tip (Phospho)Proteomes at Growth-Promoting versus Growth-Repressing Conditions Reveal Novel Root Growth Regulators.” Cells, vol. 10, 1665, MDPI, 2021, doi:10.3390/cells10071665.","ista":"Nikonorova N, Murphy E, Fonseca de Lima C, Zhu S, van de Cotte B, Vu L, Balcerowicz D, Li L, Kong X, De Rop G, Beeckman T, Friml J, Vissenberg K, Morris P, Ding Z, De Smet I. 2021. The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators. Cells. 10, 1665.","short":"N. Nikonorova, E. Murphy, C. Fonseca de Lima, S. Zhu, B. van de Cotte, L. Vu, D. Balcerowicz, L. Li, X. Kong, G. De Rop, T. Beeckman, J. Friml, K. Vissenberg, P. Morris, Z. Ding, I. De Smet, Cells 10 (2021)."},"publication_identifier":{"issn":["2073-4409"]},"volume":10,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","_id":"10015","has_accepted_license":"1","year":"2021"},{"arxiv":1,"abstract":[{"text":"We study the temporal dissipation of variance and relative entropy for ergodic Markov Chains in continuous time, and compute explicitly the corresponding dissipation rates. These are identified, as is well known, in the case of the variance in terms of an appropriate Hilbertian norm; and in the case of the relative entropy, in terms of a Dirichlet form which morphs into a version of the familiar Fisher information under conditions of detailed balance. Here we obtain trajectorial versions of these results, valid along almost every path of the random motion and most transparent in the backwards direction of time. Martingale arguments and time reversal play crucial roles, as in the recent work of Karatzas, Schachermayer and Tschiderer for conservative diffusions. Extensions are developed to general “convex divergences” and to countable state-spaces. The steepest descent and gradient flow properties for the variance, the relative entropy, and appropriate generalizations, are studied along with their respective geometries under conditions of detailed balance, leading to a very direct proof for the HWI inequality of Otto and Villani in the present context.","lang":"eng"}],"department":[{"_id":"JaMa"}],"title":"Trajectorial dissipation and gradient flow for the relative entropy in Markov chains","publication":"Communications in Information and Systems","publisher":"International Press","oa_version":"Preprint","ec_funded":1,"date_created":"2021-09-19T08:53:19Z","oa":1,"status":"public","acknowledgement":"I.K. acknowledges support from the U.S. National Science Foundation under Grant NSF-DMS-20-04997. J.M. acknowledges support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 716117) and from the Austrian Science Fund (FWF) through project F65. W.S. acknowledges support from the Austrian Science Fund (FWF) under grant P28861 and by the Vienna Science and Technology Fund (WWTF) through projects MA14-008 and MA16-021.","external_id":{"arxiv":["2005.14177"]},"article_type":"original","issue":"4","citation":{"chicago":"Karatzas, Ioannis, Jan Maas, and Walter Schachermayer. “Trajectorial Dissipation and Gradient Flow for the Relative Entropy in Markov Chains.” Communications in Information and Systems. International Press, 2021. https://doi.org/10.4310/CIS.2021.v21.n4.a1.","ieee":"I. Karatzas, J. Maas, and W. Schachermayer, “Trajectorial dissipation and gradient flow for the relative entropy in Markov chains,” Communications in Information and Systems, vol. 21, no. 4. International Press, pp. 481–536, 2021.","apa":"Karatzas, I., Maas, J., & Schachermayer, W. (2021). Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. Communications in Information and Systems. International Press. https://doi.org/10.4310/CIS.2021.v21.n4.a1","ama":"Karatzas I, Maas J, Schachermayer W. Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. Communications in Information and Systems. 2021;21(4):481-536. doi:10.4310/CIS.2021.v21.n4.a1","short":"I. Karatzas, J. Maas, W. Schachermayer, Communications in Information and Systems 21 (2021) 481–536.","mla":"Karatzas, Ioannis, et al. “Trajectorial Dissipation and Gradient Flow for the Relative Entropy in Markov Chains.” Communications in Information and Systems, vol. 21, no. 4, International Press, 2021, pp. 481–536, doi:10.4310/CIS.2021.v21.n4.a1.","ista":"Karatzas I, Maas J, Schachermayer W. 2021. Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. Communications in Information and Systems. 21(4), 481–536."},"publication_identifier":{"issn":["1526-7555"]},"page":"481-536","volume":21,"type":"journal_article","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10023","year":"2021","date_published":"2021-06-04T00:00:00Z","author":[{"first_name":"Ioannis","last_name":"Karatzas","full_name":"Karatzas, Ioannis"},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Maas, Jan","last_name":"Maas","orcid":"0000-0002-0845-1338","first_name":"Jan"},{"last_name":"Schachermayer","first_name":"Walter","full_name":"Schachermayer, Walter"}],"doi":"10.4310/CIS.2021.v21.n4.a1","date_updated":"2021-09-20T12:51:18Z","article_processing_charge":"No","keyword":["Markov Chain","relative entropy","time reversal","steepest descent","gradient flow"],"quality_controlled":"1","day":"04","project":[{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020"},{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"language":[{"iso":"eng"}],"month":"06","main_file_link":[{"url":"https://arxiv.org/abs/2005.14177","open_access":"1"}],"intvolume":" 21","publication_status":"published"},{"ec_funded":1,"date_created":"2021-09-19T22:01:25Z","oa_version":"Published Version","publisher":"Elsevier","publication":"Stochastic Processes and their Applications","title":"Hydrodynamics for the partial exclusion process in random environment","department":[{"_id":"JaMa"}],"abstract":[{"lang":"eng","text":"In this paper, we introduce a random environment for the exclusion process in obtained by assigning a maximal occupancy to each site. This maximal occupancy is allowed to randomly vary among sites, and partial exclusion occurs. Under the assumption of ergodicity under translation and uniform ellipticity of the environment, we derive a quenched hydrodynamic limit in path space by strengthening the mild solution approach initiated in Nagy (2002) and Faggionato (2007). To this purpose, we prove, employing the technology developed for the random conductance model, a homogenization result in the form of an arbitrary starting point quenched invariance principle for a single particle in the same environment, which is a result of independent interest. The self-duality property of the partial exclusion process allows us to transfer this homogenization result to the particle system and, then, apply the tightness criterion in Redig et al. (2020)."}],"arxiv":1,"has_accepted_license":"1","year":"2021","_id":"10024","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","volume":142,"page":"124-158","publication_identifier":{"issn":["0304-4149"]},"citation":{"chicago":"Floreani, Simone, Frank Redig, and Federico Sau. “Hydrodynamics for the Partial Exclusion Process in Random Environment.” Stochastic Processes and Their Applications. Elsevier, 2021. https://doi.org/10.1016/j.spa.2021.08.006.","ieee":"S. Floreani, F. Redig, and F. Sau, “Hydrodynamics for the partial exclusion process in random environment,” Stochastic Processes and their Applications, vol. 142. Elsevier, pp. 124–158, 2021.","apa":"Floreani, S., Redig, F., & Sau, F. (2021). Hydrodynamics for the partial exclusion process in random environment. Stochastic Processes and Their Applications. Elsevier. https://doi.org/10.1016/j.spa.2021.08.006","ama":"Floreani S, Redig F, Sau F. Hydrodynamics for the partial exclusion process in random environment. Stochastic Processes and their Applications. 2021;142:124-158. doi:10.1016/j.spa.2021.08.006","short":"S. Floreani, F. Redig, F. Sau, Stochastic Processes and Their Applications 142 (2021) 124–158.","mla":"Floreani, Simone, et al. “Hydrodynamics for the Partial Exclusion Process in Random Environment.” Stochastic Processes and Their Applications, vol. 142, Elsevier, 2021, pp. 124–58, doi:10.1016/j.spa.2021.08.006.","ista":"Floreani S, Redig F, Sau F. 2021. Hydrodynamics for the partial exclusion process in random environment. Stochastic Processes and their Applications. 142, 124–158."},"article_type":"original","external_id":{"arxiv":["1911.12564"],"isi":["000697748500005"]},"oa":1,"acknowledgement":"The authors would like to thank Marek Biskup and Alberto Chiarini for useful suggestions and Cristian Giardina, Frank den Hollander and Shubhamoy Nandan for inspiring discussions. S.F. acknowledges Simona Villa for her help in creating the picture. Furthermore, the authors thank two anonymous referees for the careful reading of the manuscript. S.F. acknowledges financial support from NWO, The Netherlands via the grant TOP1.17.019. F.S. acknowledges financial support from NWO via the TOP1 grant 613.001.552 as well as funding from the European Union’s Horizon 2020 research and innovation programme under the Marie-Skłodowska-Curie grant agreement No. 754411.","status":"public","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file_date_updated":"2022-05-13T07:55:50Z","quality_controlled":"1","keyword":["hydrodynamic limit","random environment","random conductance model","arbitrary starting point quenched invariance principle","duality","mild solution"],"scopus_import":"1","article_processing_charge":"Yes","date_updated":"2023-08-14T06:52:43Z","doi":"10.1016/j.spa.2021.08.006","author":[{"last_name":"Floreani","first_name":"Simone","full_name":"Floreani, Simone"},{"full_name":"Redig, Frank","last_name":"Redig","first_name":"Frank"},{"full_name":"Sau, Federico","id":"E1836206-9F16-11E9-8814-AEFDE5697425","first_name":"Federico","last_name":"Sau"}],"date_published":"2021-08-27T00:00:00Z","file":[{"date_updated":"2022-05-13T07:55:50Z","file_id":"11370","file_size":2115791,"checksum":"56768c553d7218ee5714902ffec90ec4","file_name":"2021_StochasticProcessesAppl_Floreani.pdf","relation":"main_file","access_level":"open_access","creator":"dernst","content_type":"application/pdf","date_created":"2022-05-13T07:55:50Z","success":1}],"publication_status":"published","intvolume":" 142","isi":1,"month":"08","language":[{"iso":"eng"}],"project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"ddc":["519"],"day":"27"},{"date_updated":"2023-08-14T07:04:06Z","doi":"10.1038/s41586-021-03938-w","related_material":{"link":[{"url":"https://doi.org/10.1038/s41586-021-04181-z","relation":"erratum"}]},"article_processing_charge":"No","author":[{"first_name":"Haoxin","last_name":"Zhou","full_name":"Zhou, Haoxin"},{"full_name":"Xie, Tian","last_name":"Xie","first_name":"Tian"},{"first_name":"Areg","orcid":"0000-0001-9666-3543","last_name":"Ghazaryan","full_name":"Ghazaryan, Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Holder, Tobias","last_name":"Holder","first_name":"Tobias"},{"full_name":"Ehrets, James R.","last_name":"Ehrets","first_name":"James R."},{"last_name":"Spanton","first_name":"Eric M.","full_name":"Spanton, Eric M."},{"first_name":"Takashi","last_name":"Taniguchi","full_name":"Taniguchi, Takashi"},{"full_name":"Watanabe, Kenji","last_name":"Watanabe","first_name":"Kenji"},{"full_name":"Berg, Erez","first_name":"Erez","last_name":"Berg"},{"first_name":"Maksym","orcid":"0000-0002-2399-5827","last_name":"Serbyn","full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Young","first_name":"Andrea F.","full_name":"Young, Andrea F."}],"date_published":"2021-09-01T00:00:00Z","quality_controlled":"1","scopus_import":"1","keyword":["condensed matter - mesoscale and nanoscale physics","condensed matter - strongly correlated electrons","multidisciplinary"],"day":"01","language":[{"iso":"eng"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"month":"09","isi":1,"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.00653"}],"arxiv":1,"abstract":[{"text":"Ferromagnetism is most common in transition metal compounds but may also arise in low-density two-dimensional electron systems, with signatures observed in silicon, III-V semiconductor systems, and graphene moiré heterostructures. Here we show that gate-tuned van Hove singularities in rhombohedral trilayer graphene drive the spontaneous ferromagnetic polarization of the electron system into one or more spin- and valley flavors. Using capacitance measurements on graphite-gated van der Waals heterostructures, we find a cascade of density- and electronic displacement field tuned phase transitions marked by negative electronic compressibility. The transitions define the boundaries between phases where quantum oscillations have either four-fold, two-fold, or one-fold degeneracy, associated with a spin and valley degenerate normal metal, spin-polarized `half-metal', and spin and valley polarized `quarter metal', respectively. For electron doping, the salient features are well captured by a phenomenological Stoner model with a valley-anisotropic Hund's coupling, likely arising from interactions at the lattice scale. For hole filling, we observe a richer phase diagram featuring a delicate interplay of broken symmetries and transitions in the Fermi surface topology. Finally, by rotational alignment of a hexagonal boron nitride substrate to induce a moiré superlattice, we find that the superlattice perturbs the preexisting isospin order only weakly, leaving the basic phase diagram intact while catalyzing the formation of topologically nontrivial gapped states whenever itinerant half- or quarter metal states occur at half- or quarter superlattice band filling. Our results show that rhombohedral trilayer graphene is an ideal platform for well-controlled tests of many-body theory and reveal magnetism in moiré materials to be fundamentally itinerant in nature.","lang":"eng"}],"publisher":"Springer Nature","department":[{"_id":"MaSe"},{"_id":"MiLe"}],"title":"Half and quarter metals in rhombohedral trilayer graphene","publication":"Nature","oa_version":"Preprint","date_created":"2021-09-19T22:01:25Z","ec_funded":1,"external_id":{"arxiv":["2104.00653"],"isi":["000706977400002"]},"article_type":"original","status":"public","acknowledgement":"The authors acknowledge discussions with A. Macdonald, L. Fu, F. Wang and M. Zaletel. AFY acknowledges support of the National Science Foundation under DMR1654186, and the Gordon and Betty Moore Foundation under award GBMF9471. The authors acknowledge the use of the research facilities within the California NanoSystems Institute, supported by the University of California, Santa Barbara and the University of California, Office of the President.\r\nK.W. and T.T. acknowledge support from the Elemental Strategy Initiative conducted by the MEXT, Japan, Grant Number JPMXP0112101001 and JSPS KAKENHI, Grant Number JP20H00354. EB and TH were supported by the European Research Council (ERC) under grant HQMAT (Grant Agreement No. 817799). A.G. acknowledges support by the European Unions Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement\r\nNo. 754411.\r\n","oa":1,"publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"citation":{"ista":"Zhou H, Xie T, Ghazaryan A, Holder T, Ehrets JR, Spanton EM, Taniguchi T, Watanabe K, Berg E, Serbyn M, Young AF. 2021. Half and quarter metals in rhombohedral trilayer graphene. Nature.","short":"H. Zhou, T. Xie, A. Ghazaryan, T. Holder, J.R. Ehrets, E.M. Spanton, T. Taniguchi, K. Watanabe, E. Berg, M. Serbyn, A.F. Young, Nature (2021).","mla":"Zhou, Haoxin, et al. “Half and Quarter Metals in Rhombohedral Trilayer Graphene.” Nature, Springer Nature, 2021, doi:10.1038/s41586-021-03938-w.","ama":"Zhou H, Xie T, Ghazaryan A, et al. Half and quarter metals in rhombohedral trilayer graphene. Nature. 2021. doi:10.1038/s41586-021-03938-w","apa":"Zhou, H., Xie, T., Ghazaryan, A., Holder, T., Ehrets, J. R., Spanton, E. M., … Young, A. F. (2021). Half and quarter metals in rhombohedral trilayer graphene. Nature. Springer Nature. https://doi.org/10.1038/s41586-021-03938-w","chicago":"Zhou, Haoxin, Tian Xie, Areg Ghazaryan, Tobias Holder, James R. Ehrets, Eric M. Spanton, Takashi Taniguchi, et al. “Half and Quarter Metals in Rhombohedral Trilayer Graphene.” Nature. Springer Nature, 2021. https://doi.org/10.1038/s41586-021-03938-w.","ieee":"H. Zhou et al., “Half and quarter metals in rhombohedral trilayer graphene,” Nature. Springer Nature, 2021."},"type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","year":"2021","_id":"10025"},{"article_processing_charge":"No","related_material":{"record":[{"id":"10851","relation":"later_version","status":"public"},{"id":"9636","status":"public","relation":"research_data"}]},"date_updated":"2024-02-21T12:36:52Z","date_published":"2021-07-08T00:00:00Z","author":[{"id":"29C8C0B4-F248-11E8-B48F-1D18A9856A87","full_name":"Phan, Duc T","last_name":"Phan","first_name":"Duc T"},{"full_name":"Senior, Jorden L","id":"5479D234-2D30-11EA-89CC-40953DDC885E","first_name":"Jorden L","orcid":"0000-0002-0672-9295","last_name":"Senior"},{"first_name":"Areg","orcid":"0000-0001-9666-3543","last_name":"Ghazaryan","full_name":"Ghazaryan, Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"M.","last_name":"Hatefipour","full_name":"Hatefipour, M."},{"last_name":"Strickland","first_name":"W. M.","full_name":"Strickland, W. M."},{"last_name":"Shabani","first_name":"J.","full_name":"Shabani, J."},{"first_name":"Maksym","last_name":"Serbyn","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Higginbotham, Andrew P","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","first_name":"Andrew P","last_name":"Higginbotham","orcid":"0000-0003-2607-2363"}],"arxiv":1,"abstract":[{"text":"Superconductor-semiconductor hybrids are platforms for realizing effective p-wave superconductivity. Spin-orbit coupling, combined with the proximity effect, causes the two-dimensional semiconductor to inherit p±ip intraband pairing, and application of magnetic field can then result in transitions to the normal state, partial Bogoliubov Fermi surfaces, or topological phases with Majorana modes. Experimentally probing the hybrid superconductor-semiconductor interface is challenging due to the shunting effect of the conventional superconductor. Consequently, the nature of induced pairing remains an open question. Here, we use the circuit quantum electrodynamics architecture to probe induced superconductivity in a two dimensional Al-InAs hybrid system. We observe a strong suppression of superfluid density and enhanced dissipation driven by magnetic field, which cannot be accounted for by the depairing theory of an s-wave superconductor. These observations are explained by a picture of independent intraband p±ip superconductors giving way to partial Bogoliubov Fermi surfaces, and allow for the first characterization of key properties of the hybrid superconducting system.","lang":"eng"}],"article_number":"2107.03695","publication":"arXiv","department":[{"_id":"MaSe"},{"_id":"AnHi"},{"_id":"MiLe"}],"title":"Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"date_created":"2021-09-21T08:41:02Z","ec_funded":1,"oa_version":"Preprint","day":"08","external_id":{"arxiv":["2107.03695"]},"acknowledgement":"This research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication facility. JS and AG were supported by funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No.754411.","status":"public","oa":1,"month":"07","language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"citation":{"apa":"Phan, D. T., Senior, J. L., Ghazaryan, A., Hatefipour, M., Strickland, W. M., Shabani, J., … Higginbotham, A. P. (n.d.). Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid. arXiv.","chicago":"Phan, Duc T, Jorden L Senior, Areg Ghazaryan, M. Hatefipour, W. M. Strickland, J. Shabani, Maksym Serbyn, and Andrew P Higginbotham. “Breakdown of Induced P±ip Pairing in a Superconductor-Semiconductor Hybrid.” ArXiv, n.d.","ieee":"D. T. Phan et al., “Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid,” arXiv. .","ista":"Phan DT, Senior JL, Ghazaryan A, Hatefipour M, Strickland WM, Shabani J, Serbyn M, Higginbotham AP. Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid. arXiv, 2107.03695.","short":"D.T. Phan, J.L. Senior, A. Ghazaryan, M. Hatefipour, W.M. Strickland, J. Shabani, M. Serbyn, A.P. Higginbotham, ArXiv (n.d.).","mla":"Phan, Duc T., et al. “Breakdown of Induced P±ip Pairing in a Superconductor-Semiconductor Hybrid.” ArXiv, 2107.03695.","ama":"Phan DT, Senior JL, Ghazaryan A, et al. Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid. arXiv."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","year":"2021","publication_status":"submitted","main_file_link":[{"url":"https://arxiv.org/abs/2107.03695","open_access":"1"}],"_id":"10029"},{"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"file_date_updated":"2022-03-10T12:14:42Z","degree_awarded":"PhD","date_published":"2021-09-22T00:00:00Z","author":[{"full_name":"Portinale, Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","first_name":"Lorenzo","last_name":"Portinale"}],"alternative_title":["ISTA Thesis"],"date_updated":"2023-09-07T13:31:06Z","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"10022"},{"id":"9792","relation":"part_of_dissertation","status":"public"},{"id":"7573","relation":"part_of_dissertation","status":"public"}]},"doi":"10.15479/at:ista:10030","article_processing_charge":"No","publication_status":"published","file":[{"file_id":"10032","date_updated":"2022-03-10T12:14:42Z","file_name":"tex_and_pictures.zip","checksum":"8cd60dcb8762e8f21867e21e8001e183","file_size":3876668,"creator":"cchlebak","access_level":"closed","relation":"source_file","date_created":"2021-09-21T09:17:34Z","content_type":"application/x-zip-compressed"},{"date_created":"2021-09-27T11:14:31Z","content_type":"application/pdf","access_level":"open_access","creator":"cchlebak","relation":"main_file","file_name":"thesis_portinale_Final (1).pdf","checksum":"9789e9d967c853c1503ec7f307170279","file_size":2532673,"file_id":"10047","date_updated":"2021-09-27T11:14:31Z"}],"project":[{"call_identifier":"FWF","_id":"260788DE-B435-11E9-9278-68D0E5697425","name":"Dissipation and Dispersion in Nonlinear Partial Differential Equations"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"}],"language":[{"iso":"eng"}],"month":"09","day":"22","ddc":["515"],"oa_version":"Published Version","date_created":"2021-09-21T09:14:15Z","department":[{"_id":"GradSch"},{"_id":"JaMa"}],"title":"Discrete-to-continuum limits of transport problems and gradient flows in the space of measures","publisher":"Institute of Science and Technology Austria","abstract":[{"lang":"eng","text":"This PhD thesis is primarily focused on the study of discrete transport problems, introduced for the first time in the seminal works of Maas [Maa11] and Mielke [Mie11] on finite state Markov chains and reaction-diffusion equations, respectively. More in detail, my research focuses on the study of transport costs on graphs, in particular the convergence and the stability of such problems in the discrete-to-continuum limit. This thesis also includes some results concerning\r\nnon-commutative optimal transport. The first chapter of this thesis consists of a general introduction to the optimal transport problems, both in the discrete, the continuous, and the non-commutative setting. Chapters 2 and 3 present the content of two works, obtained in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have been able to show the convergence of discrete transport costs on periodic graphs to suitable continuous ones, which can be described by means of a homogenisation result. We first focus on the particular case of quadratic costs on the real line and then extending the result to more general costs in arbitrary dimension. Our results are the first complete characterisation of limits of transport costs on periodic graphs in arbitrary dimension which do not rely on any additional symmetry. In Chapter 4 we turn our attention to one of the intriguing connection between evolution equations and optimal transport, represented by the theory of gradient flows. We show that discrete gradient flow structures associated to a finite volume approximation of a certain class of diffusive equations (Fokker–Planck) is stable in the limit of vanishing meshes, reproving the convergence of the scheme via the method of evolutionary Γ-convergence and exploiting a more variational point of view on the problem. This is based on a collaboration with Dominik Forkert and Jan Maas. Chapter 5 represents a change of perspective, moving away from the discrete world and reaching the non-commutative one. As in the discrete case, we discuss how classical tools coming from the commutative optimal transport can be translated into the setting of density matrices. In particular, in this final chapter we present a non-commutative version of the Schrödinger problem (or entropic regularised optimal transport problem) and discuss existence and characterisation of minimisers, a duality result, and present a non-commutative version of the well-known Sinkhorn algorithm to compute the above mentioned optimisers. This is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally, Appendix A and B contain some additional material and discussions, with particular attention to Harnack inequalities and the regularity of flows on discrete spaces."}],"supervisor":[{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Maas, Jan","last_name":"Maas","orcid":"0000-0002-0845-1338","first_name":"Jan"}],"_id":"10030","has_accepted_license":"1","year":"2021","type":"dissertation","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"apa":"Portinale, L. (2021). Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10030","ieee":"L. Portinale, “Discrete-to-continuum limits of transport problems and gradient flows in the space of measures,” Institute of Science and Technology Austria, 2021.","chicago":"Portinale, Lorenzo. “Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10030.","short":"L. Portinale, Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures, Institute of Science and Technology Austria, 2021.","mla":"Portinale, Lorenzo. Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10030.","ista":"Portinale L. 2021. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria.","ama":"Portinale L. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. 2021. doi:10.15479/at:ista:10030"},"publication_identifier":{"issn":["2663-337X"]},"acknowledgement":"The author gratefully acknowledges support by the Austrian Science Fund (FWF), grants No W1245.","status":"public","oa":1},{"external_id":{"arxiv":["1610.00212"],"isi":["000707040300031"]},"article_type":"original","acknowledgement":"The author would like to express his gratitude to D. Gaitsgory, without whose tireless guidance and encouragement in pursuing this problem, this work would not have been possible. The author is grateful to his advisor B.C. Ngô for many years of patient guidance and support. This paper is revised while the author is a postdoc in Hausel group at IST Austria. We thank him and the group for providing a wonderful research environment. The author also gratefully acknowledges the support of the Lise Meitner fellowship “Algebro-Geometric Applications of Factorization Homology,” Austrian Science Fund (FWF): M 2751.","status":"public","oa":1,"publication_identifier":{"issn":["0001-8708"],"eissn":["1090-2082"]},"citation":{"apa":"Ho, Q. P. (2021). The Atiyah-Bott formula and connectivity in chiral Koszul duality. Advances in Mathematics. Elsevier. https://doi.org/10.1016/j.aim.2021.107992","chicago":"Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul Duality.” Advances in Mathematics. Elsevier, 2021. https://doi.org/10.1016/j.aim.2021.107992.","ieee":"Q. P. Ho, “The Atiyah-Bott formula and connectivity in chiral Koszul duality,” Advances in Mathematics, vol. 392. Elsevier, 2021.","mla":"Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul Duality.” Advances in Mathematics, vol. 392, 107992, Elsevier, 2021, doi:10.1016/j.aim.2021.107992.","short":"Q.P. Ho, Advances in Mathematics 392 (2021).","ista":"Ho QP. 2021. The Atiyah-Bott formula and connectivity in chiral Koszul duality. Advances in Mathematics. 392, 107992.","ama":"Ho QP. The Atiyah-Bott formula and connectivity in chiral Koszul duality. Advances in Mathematics. 2021;392. doi:10.1016/j.aim.2021.107992"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","volume":392,"year":"2021","has_accepted_license":"1","_id":"10033","arxiv":1,"abstract":[{"text":"The ⊗*-monoidal structure on the category of sheaves on the Ran space is not pro-nilpotent in the sense of [3]. However, under some connectivity assumptions, we prove that Koszul duality induces an equivalence of categories and that this equivalence behaves nicely with respect to Verdier duality on the Ran space and integrating along the Ran space, i.e. taking factorization homology. Based on ideas sketched in [4], we show that these results also offer a simpler alternative to one of the two main steps in the proof of the Atiyah-Bott formula given in [7] and [5].","lang":"eng"}],"publisher":"Elsevier","publication":"Advances in Mathematics","title":"The Atiyah-Bott formula and connectivity in chiral Koszul duality","department":[{"_id":"TaHa"}],"date_created":"2021-09-21T15:58:59Z","oa_version":"Published Version","ddc":["514"],"day":"21","isi":1,"month":"09","language":[{"iso":"eng"}],"project":[{"name":"Algebro-Geometric Applications of Factorization Homology","grant_number":"M02751","_id":"26B96266-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"file":[{"date_created":"2021-09-21T15:58:52Z","content_type":"application/pdf","access_level":"open_access","creator":"qho","relation":"main_file","checksum":"f3c0086d41af11db31c00014efb38072","file_name":"1-s2.0-S000187082100431X-main.pdf","file_size":840635,"date_updated":"2021-09-21T15:58:52Z","file_id":"10034"}],"publication_status":"published","intvolume":" 392","article_processing_charge":"Yes (via OA deal)","doi":"10.1016/j.aim.2021.107992","date_updated":"2023-08-14T06:54:35Z","date_published":"2021-09-21T00:00:00Z","author":[{"first_name":"Quoc P","orcid":"0000-0001-6889-1418","last_name":"Ho","full_name":"Ho, Quoc P","id":"3DD82E3C-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","keyword":["Chiral algebras","Chiral homology","Factorization algebras","Koszul duality","Ran space"],"scopus_import":"1","article_number":"107992","file_date_updated":"2021-09-21T15:58:52Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"publisher":"Institute of Science and Technology Austria","title":"On the adaptive security of graph-based games","department":[{"_id":"GradSch"},{"_id":"KrPi"}],"ec_funded":1,"date_created":"2021-09-23T07:31:44Z","oa_version":"Published Version","abstract":[{"text":"Many security definitions come in two flavors: a stronger “adaptive” flavor, where the adversary can arbitrarily make various choices during the course of the attack, and a weaker “selective” flavor where the adversary must commit to some or all of their choices a-priori. For example, in the context of identity-based encryption, selective security requires the adversary to decide on the identity of the attacked party at the very beginning of the game whereas adaptive security allows the attacker to first see the master public key and some secret keys before making this choice. Often, it appears to be much easier to achieve selective security than it is to achieve adaptive security. A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption [Pan07][FJP15], constrained PRFs [FKPR14], and Yao’s garbled circuits [JW16]. Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework (published at Crypto ’17 [JKK+17a]) that connects all of these works and allows us to present them in a unified and simplified fashion. Having the framework in place, we show how to achieve adaptive security for proxy re-encryption schemes (published at PKC ’19 [FKKP19]) and provide the first adaptive security proofs for continuous group key agreement protocols (published at S&P ’21 [KPW+21]). Questioning optimality of our framework, we then show that currently used proof techniques cannot lead to significantly better security guarantees for \"graph-building\" games (published at TCC ’21 [KKPW21a]). These games cover generalized selective decryption, as well as the security of prominent constructions for constrained PRFs, continuous group key agreement, and proxy re-encryption. Finally, we revisit the adaptive security of Yao’s garbled circuits and extend the analysis of Jafargholi and Wichs in two directions: While they prove adaptive security only for a modified construction with increased online complexity, we provide the first positive results for the original construction by Yao (published at TCC ’21 [KKP21a]). On the negative side, we prove that the results of Jafargholi and Wichs are essentially optimal by showing that no black-box reduction can provide a significantly better security bound (published at Crypto ’21 [KKPW21c]).","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"dissertation","page":"276","has_accepted_license":"1","year":"2021","supervisor":[{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"}],"_id":"10035","status":"public","acknowledgement":"I want to acknowledge the funding by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).\r\n","oa":1,"publication_identifier":{"issn":["2663-337X"]},"citation":{"chicago":"Klein, Karen. “On the Adaptive Security of Graph-Based Games.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10035.","ieee":"K. Klein, “On the adaptive security of graph-based games,” Institute of Science and Technology Austria, 2021.","apa":"Klein, K. (2021). On the adaptive security of graph-based games. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10035","ama":"Klein K. On the adaptive security of graph-based games. 2021. doi:10.15479/at:ista:10035","ista":"Klein K. 2021. On the adaptive security of graph-based games. Institute of Science and Technology Austria.","mla":"Klein, Karen. On the Adaptive Security of Graph-Based Games. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10035.","short":"K. Klein, On the Adaptive Security of Graph-Based Games, Institute of Science and Technology Austria, 2021."},"file_date_updated":"2022-03-10T12:15:18Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"No","doi":"10.15479/at:ista:10035","related_material":{"record":[{"id":"10044","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"10049"},{"status":"public","relation":"part_of_dissertation","id":"637"},{"id":"10041","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"6430"},{"relation":"part_of_dissertation","status":"public","id":"10048"}]},"date_updated":"2023-10-17T09:24:07Z","alternative_title":["ISTA Thesis"],"date_published":"2021-09-23T00:00:00Z","author":[{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen","last_name":"Klein","first_name":"Karen"}],"degree_awarded":"PhD","file":[{"success":1,"date_created":"2021-10-04T12:22:33Z","content_type":"application/pdf","access_level":"open_access","creator":"cchlebak","relation":"main_file","file_name":"thesis_pdfa.pdf","checksum":"73a44345c683e81f3e765efbf86fdcc5","file_size":2104726,"file_id":"10082","date_updated":"2021-10-04T12:22:33Z"},{"file_id":"10085","date_updated":"2022-03-10T12:15:18Z","file_name":"thesis_final (1).zip","checksum":"7b80df30a0e686c3ef6a56d4e1c59e29","file_size":9538359,"creator":"cchlebak","access_level":"closed","relation":"source_file","date_created":"2021-10-05T07:04:37Z","content_type":"application/x-zip-compressed"}],"publication_status":"published","ddc":["519"],"day":"23","month":"09","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"language":[{"iso":"eng"}]},{"day":"11","month":"08","language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/945"}],"intvolume":" 12826","publication_status":"published","date_published":"2021-08-11T00:00:00Z","author":[{"last_name":"Kamath Hosdurg","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen","last_name":"Klein","first_name":"Karen"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"},{"first_name":"Daniel","last_name":"Wichs","full_name":"Wichs, Daniel"}],"article_processing_charge":"No","date_updated":"2023-09-07T13:32:11Z","alternative_title":["LCNS"],"related_material":{"record":[{"id":"10035","relation":"dissertation_contains","status":"public"}]},"doi":"10.1007/978-3-030-84245-1_17","quality_controlled":"1","conference":{"location":"Virtual","start_date":"2021-08-16","name":"CRYPTO: Annual International Cryptology Conference","end_date":"2021-08-20"},"oa":1,"status":"public","acknowledgement":"We would like to thank the anonymous reviewers of Crypto’21 whose detailed comments helped us considerably improve the presentation of the paper.","citation":{"ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security of Yao’s Garbling. In: 41st Annual International Cryptology Conference, Part II . Vol 12826. Cham: Springer Nature; 2021:486-515. doi:10.1007/978-3-030-84245-1_17","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International Cryptology Conference, Part II , Springer Nature, Cham, 2021, pp. 486–515.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive Security of Yao’s Garbling. 41st Annual International Cryptology Conference, Part II . CRYPTO: Annual International Cryptology Conference, LCNS, vol. 12826, 486–515.","mla":"Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.” 41st Annual International Cryptology Conference, Part II , vol. 12826, Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17.","chicago":"Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel Wichs. “Limits on the Adaptive Security of Yao’s Garbling.” In 41st Annual International Cryptology Conference, Part II , 12826:486–515. Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-84245-1_17.","ieee":"C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and D. Wichs, “Limits on the Adaptive Security of Yao’s Garbling,” in 41st Annual International Cryptology Conference, Part II , Virtual, 2021, vol. 12826, pp. 486–515.","apa":"Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Wichs, D. (2021). Limits on the Adaptive Security of Yao’s Garbling. In 41st Annual International Cryptology Conference, Part II (Vol. 12826, pp. 486–515). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-84245-1_17"},"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["978-3-030-84245-1"],"isbn":["978-3-030-84244-4"]},"volume":12826,"page":"486-515","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"conference","place":"Cham","_id":"10041","year":"2021","abstract":[{"lang":"eng","text":"Yao’s garbling scheme is one of the most fundamental cryptographic constructions. Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security in the selective setting where the adversary chooses the challenge inputs before seeing the garbled circuit assuming secure symmetric-key encryption (and hence one-way functions). This was followed by results, both positive and negative, concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto 2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s scheme (where the output mapping is sent in the online phase, together with the garbled input) that circumvents this negative result, and proved that it is adaptively secure, at least for shallow circuits. In particular, they showed that for the class of circuits of depth δ , the loss in security is at most exponential in δ . The above results all concern the simulation-based notion of security. In this work, we show that the upper bound of Jafargholi and Wichs is basically optimal in a strong sense. As our main result, we show that there exists a family of Boolean circuits, one for each depth δ∈N , such that any black-box reduction proving the adaptive indistinguishability of the natural adaptation of Yao’s scheme from any symmetric-key encryption has to lose a factor that is exponential in δ√ . Since indistinguishability is a weaker notion than simulation, our bound also applies to adaptive simulation. To establish our results, we build on the recent approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction with oracle separations to prove fine-grained lower bounds on loss in cryptographic security."}],"publication":"41st Annual International Cryptology Conference, Part II ","title":"Limits on the Adaptive Security of Yao’s Garbling","department":[{"_id":"KrPi"}],"publisher":"Springer Nature","date_created":"2021-09-23T14:06:15Z","ec_funded":1,"oa_version":"Preprint"},{"_id":"10044","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/926"}],"year":"2021","publication_status":"published","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"conference","citation":{"ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference, 2021/926.","mla":"Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th Theory of Cryptography Conference 2021, 2021/926, International Association for Cryptologic Research, 2021.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research; 2021.","apa":"Kamath Hosdurg, C., Klein, K., & Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In 19th Theory of Cryptography Conference 2021. Raleigh, NC, United States: International Association for Cryptologic Research.","ieee":"C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators and Yao’s garbling,” in 19th Theory of Cryptography Conference 2021, Raleigh, NC, United States, 2021.","chicago":"Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.” In 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research, 2021."},"month":"07","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"status":"public","oa":1,"acknowledgement":"We would like to thank Daniel Wichs for helpful discussions on the landscape of adaptive security of Yao’s garbling. ","day":"08","conference":{"location":"Raleigh, NC, United States","start_date":"2021-11-08","name":"TCC: Theory of Cryptography Conference","end_date":"2021-11-11"},"ec_funded":1,"date_created":"2021-09-24T12:01:34Z","oa_version":"Preprint","publication":"19th Theory of Cryptography Conference 2021","department":[{"_id":"KrPi"}],"title":"On treewidth, separators and Yao's garbling","article_number":"2021/926","publisher":"International Association for Cryptologic Research","abstract":[{"lang":"eng","text":"We show that Yao’s garbling scheme is adaptively indistinguishable for the class of Boolean circuits of size S and treewidth w with only a S^O(w) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly O(d w log(S)), d being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity."}],"quality_controlled":"1","author":[{"first_name":"Chethan","last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Klein","first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen"},{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"}],"date_published":"2021-07-08T00:00:00Z","article_processing_charge":"No","related_material":{"record":[{"id":"10409","status":"public","relation":"later_version"},{"id":"10035","relation":"dissertation_contains","status":"public"}]},"date_updated":"2023-09-07T13:32:11Z"},{"_id":"10045","has_accepted_license":"1","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","citation":{"ista":"Dvorak M, Kolmogorov V. Generalized minimum 0-extension problem and discrete convexity. arXiv, 2109.10203.","short":"M. Dvorak, V. Kolmogorov, ArXiv (n.d.).","mla":"Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.” ArXiv, 2109.10203, doi:10.48550/arXiv.2109.10203.","ama":"Dvorak M, Kolmogorov V. Generalized minimum 0-extension problem and discrete convexity. arXiv. doi:10.48550/arXiv.2109.10203","apa":"Dvorak, M., & Kolmogorov, V. (n.d.). Generalized minimum 0-extension problem and discrete convexity. arXiv. https://doi.org/10.48550/arXiv.2109.10203","chicago":"Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2109.10203.","ieee":"M. Dvorak and V. Kolmogorov, “Generalized minimum 0-extension problem and discrete convexity,” arXiv. ."},"status":"public","oa":1,"external_id":{"arxiv":["2109.10203"]},"date_created":"2021-09-27T10:48:23Z","oa_version":"Preprint","publication":"arXiv","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"title":"Generalized minimum 0-extension problem and discrete convexity","abstract":[{"lang":"eng","text":"Given a fixed finite metric space (V,μ), the {\\em minimum 0-extension problem}, denoted as 0-Ext[μ], is equivalent to the following optimization problem: minimize function of the form minx∈Vn∑ifi(xi)+∑ijcijμ(xi,xj) where cij,cvi are given nonnegative costs and fi:V→R are functions given by fi(xi)=∑v∈Vcviμ(xi,v). The computational complexity of 0-Ext[μ] has been recently established by Karzanov and by Hirai: if metric μ is {\\em orientable modular} then 0-Ext[μ] can be solved in polynomial time, otherwise 0-Ext[μ] is NP-hard. To prove the tractability part, Hirai developed a theory of discrete convex functions on orientable modular graphs generalizing several known classes of functions in discrete convex analysis, such as L♮-convex functions. We consider a more general version of the problem in which unary functions fi(xi) can additionally have terms of the form cuv;iμ(xi,{u,v}) for {u,v}∈F, where set F⊆(V2) is fixed. We extend the complexity classification above by providing an explicit condition on (μ,F) for the problem to be tractable. In order to prove the tractability part, we generalize Hirai's theory and define a larger class of discrete convex functions. It covers, in particular, another well-known class of functions, namely submodular functions on an integer lattice. Finally, we improve the complexity of Hirai's algorithm for solving 0-Ext on orientable modular graphs.\r\n"}],"arxiv":1,"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2109.10203"}],"file":[{"file_id":"10046","date_updated":"2021-09-27T10:54:51Z","file_size":603672,"checksum":"e7e83065f7bc18b9c188bf93b5ca5db6","file_name":"Generalized-0-Ext.pdf","relation":"main_file","access_level":"open_access","creator":"mdvorak","content_type":"application/pdf","date_created":"2021-09-27T10:54:51Z","success":1}],"publication_status":"submitted","month":"09","language":[{"iso":"eng"}],"ddc":["004"],"day":"21","file_date_updated":"2021-09-27T10:54:51Z","article_number":"2109.10203","keyword":["minimum 0-extension problem","metric labeling problem","discrete metric spaces","metric extensions","computational complexity","valued constraint satisfaction problems","discrete convex analysis","L-convex functions"],"date_published":"2021-09-21T00:00:00Z","author":[{"id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","full_name":"Dvorak, Martin","last_name":"Dvorak","orcid":"0000-0001-5293-214X","first_name":"Martin"},{"first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","date_updated":"2023-05-03T10:40:16Z","doi":"10.48550/arXiv.2109.10203"},{"abstract":[{"lang":"eng","text":"The security of cryptographic primitives and protocols against adversaries that are allowed to make adaptive choices (e.g., which parties to corrupt or which queries to make) is notoriously difficult to establish. A broad theoretical\r\nframework was introduced by Jafargholi et al. [Crypto’17] for this purpose. In this paper we initiate the study of lower bounds on loss in adaptive security for certain cryptographic protocols considered in the framework. We prove lower\r\nbounds that almost match the upper bounds (proven using the framework) for proxy re-encryption, prefix-constrained PRFs and generalized selective decryption, a security game that captures the security of certain group messaging and\r\nbroadcast encryption schemes. Those primitives have in common that their security game involves an underlying graph that can be adaptively built by the adversary. Some of our lower bounds only apply to a restricted class of black-box reductions which we term “oblivious” (the existing upper bounds are of this restricted type), some apply to the broader but still restricted class of non-rewinding reductions, while our lower bound for proxy re-encryption applies to all black-box reductions. The fact that some of our lower bounds seem to crucially rely on obliviousness or at least a non-rewinding reduction hints to the exciting possibility that the existing upper bounds can be improved by using more sophisticated reductions. Our main conceptual contribution is a two-player multi-stage game called the Builder-Pebbler Game. We can translate bounds on the winning probabilities for various instantiations of this game into cryptographic lower bounds for the above-mentioned primitives using oracle separation techniques.\r\n"}],"quality_controlled":"1","date_published":"2021-07-08T00:00:00Z","author":[{"first_name":"Chethan","last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Karen","last_name":"Klein","full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z"},{"orcid":"0000-0003-3186-2482","last_name":"Walter","first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","full_name":"Walter, Michael"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"10410"},{"id":"10035","status":"public","relation":"dissertation_contains"}]},"date_updated":"2023-10-17T09:24:08Z","article_processing_charge":"No","oa_version":"Preprint","conference":{"name":"TCC: Theory of Cryptography Conference","end_date":"2021-11-11","location":"Raleigh, NC, United States","start_date":"2021-11-08"},"date_created":"2021-09-27T12:52:05Z","title":"The cost of adaptivity in security games on graphs","department":[{"_id":"KrPi"}],"publication":"19th Theory of Cryptography Conference 2021","publisher":"International Association for Cryptologic Research","citation":{"ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in security games on graphs. In: 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research; 2021.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity in security games on graphs. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference.","mla":"Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.","ieee":"C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “The cost of adaptivity in security games on graphs,” in 19th Theory of Cryptography Conference 2021, Raleigh, NC, United States, 2021.","chicago":"Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “The Cost of Adaptivity in Security Games on Graphs.” In 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research, 2021.","apa":"Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Walter, M. (2021). The cost of adaptivity in security games on graphs. In 19th Theory of Cryptography Conference 2021. Raleigh, NC, United States: International Association for Cryptologic Research."},"language":[{"iso":"eng"}],"month":"07","status":"public","oa":1,"day":"08","_id":"10048","main_file_link":[{"open_access":"1","url":"https://ia.cr/2021/059"}],"publication_status":"published","year":"2021","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"title":"Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement","department":[{"_id":"KrPi"},{"_id":"DaAl"}],"publication":"2021 IEEE Symposium on Security and Privacy ","publisher":"IEEE","oa_version":"Preprint","ec_funded":1,"date_created":"2021-09-27T13:46:27Z","abstract":[{"lang":"eng","text":"While messaging systems with strong security guarantees are widely used in practice, designing a protocol that scales efficiently to large groups and enjoys similar security guarantees remains largely open. The two existing proposals to date are ART (Cohn-Gordon et al., CCS18) and TreeKEM (IETF, The Messaging Layer Security Protocol, draft). TreeKEM is the currently considered candidate by the IETF MLS working group, but dynamic group operations (i.e. adding and removing users) can cause efficiency issues. In this paper we formalize and analyze a variant of TreeKEM which we term Tainted TreeKEM (TTKEM for short). The basic idea underlying TTKEM was suggested by Millican (MLS mailing list, February 2018). This version is more efficient than TreeKEM for some natural distributions of group operations, we quantify this through simulations.Our second contribution is two security proofs for TTKEM which establish post compromise and forward secrecy even against adaptive attackers. The security loss (to the underlying PKE) in the Random Oracle Model is a polynomial factor, and a quasipolynomial one in the Standard Model. Our proofs can be adapted to TreeKEM as well. Before our work no security proof for any TreeKEM-like protocol establishing tight security against an adversary who can adaptively choose the sequence of operations was known. We also are the first to prove (or even formalize) active security where the server can arbitrarily deviate from the protocol specification. Proving fully active security – where also the users can arbitrarily deviate – remains open."}],"page":"268-284","type":"conference","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10049","year":"2021","oa":1,"acknowledgement":"The first three authors contributed equally to this work. Funded by the European Research Council (ERC) under the European Union’s Horizon2020 research and innovation programme (682815-TOCNeT). Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.665385.","status":"public","citation":{"ista":"Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium on Security and Privacy . SP: Symposium on Security and Privacy, 268–284.","short":"K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.","mla":"Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.","ama":"Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: 2021 IEEE Symposium on Security and Privacy . IEEE; 2021:268-284. doi:10.1109/sp40001.2021.00035","apa":"Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M., Cueto Noval, M., … Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In 2021 IEEE Symposium on Security and Privacy (pp. 268–284). San Francisco, CA, United States: IEEE. https://doi.org/10.1109/sp40001.2021.00035","ieee":"K. Klein et al., “Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement,” in 2021 IEEE Symposium on Security and Privacy , San Francisco, CA, United States, 2021, pp. 268–284.","chicago":"Klein, Karen, Guillermo Pascual Perez, Michael Walter, Chethan Kamath Hosdurg, Margarita Capretto, Miguel Cueto Noval, Ilia Markov, Michelle X Yeo, Joel F Alwen, and Krzysztof Z Pietrzak. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” In 2021 IEEE Symposium on Security and Privacy , 268–84. IEEE, 2021. https://doi.org/10.1109/sp40001.2021.00035."},"conference":{"end_date":"2021-05-27","name":"SP: Symposium on Security and Privacy","start_date":"2021-05-24","location":"San Francisco, CA, United States"},"date_published":"2021-08-26T00:00:00Z","author":[{"full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen","last_name":"Klein"},{"id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","full_name":"Pascual Perez, Guillermo","orcid":"0000-0001-8630-415X","last_name":"Pascual Perez","first_name":"Guillermo"},{"last_name":"Walter","orcid":"0000-0003-3186-2482","first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","full_name":"Walter, Michael"},{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan","last_name":"Kamath Hosdurg","first_name":"Chethan"},{"first_name":"Margarita","last_name":"Capretto","full_name":"Capretto, Margarita"},{"last_name":"Cueto Noval","first_name":"Miguel","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","full_name":"Cueto Noval, Miguel"},{"last_name":"Markov","first_name":"Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","full_name":"Markov, Ilia"},{"last_name":"Yeo","first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","full_name":"Yeo, Michelle X"},{"last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-09-07T13:32:11Z","doi":"10.1109/sp40001.2021.00035","related_material":{"record":[{"id":"10035","relation":"dissertation_contains","status":"public"}]},"article_processing_charge":"No","quality_controlled":"1","main_file_link":[{"url":"https://eprint.iacr.org/2019/1489","open_access":"1"}],"publication_status":"published","day":"26","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020"},{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"month":"08"},{"date_published":"2021-09-15T00:00:00Z","author":[{"last_name":"Butola","first_name":"Tanvi","full_name":"Butola, Tanvi"},{"first_name":"Theocharis","last_name":"Alvanos","full_name":"Alvanos, Theocharis"},{"full_name":"Hintze, Anika","first_name":"Anika","last_name":"Hintze"},{"id":"3B8B25A8-F248-11E8-B48F-1D18A9856A87","full_name":"Koppensteiner, Peter","last_name":"Koppensteiner","orcid":"0000-0002-3509-1948","first_name":"Peter"},{"full_name":"Kleindienst, David","id":"42E121A4-F248-11E8-B48F-1D18A9856A87","first_name":"David","last_name":"Kleindienst"},{"first_name":"Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wichmann, Carolin","first_name":"Carolin","last_name":"Wichmann"},{"first_name":"Tobias","last_name":"Moser","full_name":"Moser, Tobias"}],"article_processing_charge":"No","date_updated":"2023-08-14T06:56:30Z","doi":"10.1523/JNEUROSCI.0586-21.2021","scopus_import":"1","quality_controlled":"1","file_date_updated":"2022-05-31T09:10:15Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"pmid":1,"ddc":["570"],"day":"15","month":"09","isi":1,"language":[{"iso":"eng"}],"intvolume":" 41","file":[{"creator":"dernst","access_level":"open_access","relation":"main_file","success":1,"date_created":"2022-05-31T09:10:15Z","content_type":"application/pdf","file_id":"11423","date_updated":"2022-05-31T09:10:15Z","file_name":"2021_JourNeuroscience_Butola.pdf","checksum":"769ab627c7355a50ccfd445e43a5f351","file_size":11571961}],"publication_status":"published","abstract":[{"text":"Rab-interacting molecule (RIM)-binding protein 2 (BP2) is a multidomain protein of the presynaptic active zone (AZ). By binding to RIM, bassoon (Bsn), and voltage-gated Ca2+ channels (CaV), it is considered to be a central organizer of the topography of CaV and release sites of synaptic vesicles (SVs) at the AZ. Here, we used RIM-BP2 knock-out (KO) mice and their wild-type (WT) littermates of either sex to investigate the role of RIM-BP2 at the endbulb of Held synapse of auditory nerve fibers (ANFs) with bushy cells (BCs) of the cochlear nucleus, a fast relay of the auditory pathway with high release probability. Disruption of RIM-BP2 lowered release probability altering short-term plasticity and reduced evoked EPSCs. Analysis of SV pool dynamics during high-frequency train stimulation indicated a reduction of SVs with high release probability but an overall normal size of the readily releasable SV pool (RRP). The Ca2+-dependent fast component of SV replenishment after RRP depletion was slowed. Ultrastructural analysis by superresolution light and electron microscopy revealed an impaired topography of presynaptic CaV and a reduction of docked and membrane-proximal SVs at the AZ. We conclude that RIM-BP2 organizes the topography of CaV, and promotes SV tethering and docking. This way RIM-BP2 is critical for establishing a high initial release probability as required to reliably signal sound onset information that we found to be degraded in BCs of RIM-BP2-deficient mice in vivo. SIGNIFICANCE STATEMENT: Rab-interacting molecule (RIM)-binding proteins (BPs) are key organizers of the active zone (AZ). Using a multidisciplinary approach to the calyceal endbulb of Held synapse that transmits auditory information at rates of up to hundreds of Hertz with submillisecond precision we demonstrate a requirement for RIM-BP2 for normal auditory signaling. Endbulb synapses lacking RIM-BP2 show a reduced release probability despite normal whole-terminal Ca2+ influx and abundance of the key priming protein Munc13-1, a reduced rate of SV replenishment, as well as an altered topography of voltage-gated (CaV)2.1 Ca2+ channels, and fewer docked and membrane proximal synaptic vesicles (SVs). This hampers transmission of sound onset information likely affecting downstream neural computations such as of sound localization.","lang":"eng"}],"publication":"Journal of Neuroscience","department":[{"_id":"RySh"}],"title":"RIM-binding protein 2 organizes Ca21 channel topography and regulates release probability and vesicle replenishment at a fast central synapse","publisher":"Society for Neuroscience","date_created":"2021-09-27T14:33:13Z","oa_version":"Published Version","oa":1,"status":"public","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the Collaborative Sensory Research Center 1286 [to C.W. (A4) and T.M. (B5)] and under Germany’s Excellence Strategy Grant EXC 2067/1-390729940. We thank S. Gerke, A.J. Goldak, and C. Senger-Freitag for expert technical assistance; G. Hoch for developing image analysis routines; and S. Chepurwar and N. Strenzke for technical support and discussion regarding in vivo experiments. We also thank Dr. Christian Rosenmund, Dr. Katharina Grauel, and Dr. Stephan Sigrist for providing RIM-BP2 KO mice and Dr. Masahiko Watanabe for providing the anti-neurexin-antibody, and Dr. Toshihisa Ohtsuka for the anti-ELKS-antibody. J. Neef for help with the STED imaging and image analysis; E. Neher and S. Rizzoli for discussion and comments on the manuscript; K. Eguchi for help with the statistical analysis; and C. H. Huang and J. Neef for constant support and scientific discussion.","issue":"37","external_id":{"isi":["000752287700005"],"pmid":["34353898"]},"article_type":"original","citation":{"chicago":"Butola, Tanvi, Theocharis Alvanos, Anika Hintze, Peter Koppensteiner, David Kleindienst, Ryuichi Shigemoto, Carolin Wichmann, and Tobias Moser. “RIM-Binding Protein 2 Organizes Ca21 Channel Topography and Regulates Release Probability and Vesicle Replenishment at a Fast Central Synapse.” Journal of Neuroscience. Society for Neuroscience, 2021. https://doi.org/10.1523/JNEUROSCI.0586-21.2021.","ieee":"T. Butola et al., “RIM-binding protein 2 organizes Ca21 channel topography and regulates release probability and vesicle replenishment at a fast central synapse,” Journal of Neuroscience, vol. 41, no. 37. Society for Neuroscience, pp. 7742–7767, 2021.","apa":"Butola, T., Alvanos, T., Hintze, A., Koppensteiner, P., Kleindienst, D., Shigemoto, R., … Moser, T. (2021). RIM-binding protein 2 organizes Ca21 channel topography and regulates release probability and vesicle replenishment at a fast central synapse. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.0586-21.2021","ama":"Butola T, Alvanos T, Hintze A, et al. RIM-binding protein 2 organizes Ca21 channel topography and regulates release probability and vesicle replenishment at a fast central synapse. Journal of Neuroscience. 2021;41(37):7742-7767. doi:10.1523/JNEUROSCI.0586-21.2021","mla":"Butola, Tanvi, et al. “RIM-Binding Protein 2 Organizes Ca21 Channel Topography and Regulates Release Probability and Vesicle Replenishment at a Fast Central Synapse.” Journal of Neuroscience, vol. 41, no. 37, Society for Neuroscience, 2021, pp. 7742–67, doi:10.1523/JNEUROSCI.0586-21.2021.","ista":"Butola T, Alvanos T, Hintze A, Koppensteiner P, Kleindienst D, Shigemoto R, Wichmann C, Moser T. 2021. RIM-binding protein 2 organizes Ca21 channel topography and regulates release probability and vesicle replenishment at a fast central synapse. Journal of Neuroscience. 41(37), 7742–7767.","short":"T. Butola, T. Alvanos, A. Hintze, P. Koppensteiner, D. Kleindienst, R. Shigemoto, C. Wichmann, T. Moser, Journal of Neuroscience 41 (2021) 7742–7767."},"publication_identifier":{"eissn":["1529-2401"],"issn":["0270-6474"]},"volume":41,"page":"7742-7767","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","_id":"10051","has_accepted_license":"1","year":"2021"},{"quality_controlled":"1","scopus_import":"1","date_updated":"2022-05-13T08:12:52Z","doi":"10.4230/LIPIcs.CONCUR.2021.18","alternative_title":["LIPIcs"],"article_processing_charge":"No","author":[{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R","last_name":"Jecker","first_name":"Ismael R"},{"full_name":"Mazzocchi, Nicolas","first_name":"Nicolas","last_name":"Mazzocchi"},{"last_name":"Wolf","first_name":"Petra","full_name":"Wolf, Petra"}],"date_published":"2021-08-13T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"conference":{"start_date":"2021-08-23","location":"Paris, France","end_date":"2021-08-27","name":"CONCUR: Conference on Concurrency Theory"},"article_number":"18","file_date_updated":"2021-10-01T11:10:53Z","language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"month":"08","day":"13","ddc":["000"],"publication_status":"published","file":[{"relation":"main_file","creator":"cchlebak","access_level":"open_access","content_type":"application/pdf","success":1,"date_created":"2021-10-01T11:10:53Z","file_id":"10064","date_updated":"2021-10-01T11:10:53Z","file_size":1003552,"file_name":"2021_CONCUR_Jecker.pdf","checksum":"4722c81be82265cf45e78adf9db91250"}],"intvolume":" 203","abstract":[{"lang":"eng","text":"A deterministic finite automaton (DFA) 𝒜 is composite if its language L(𝒜) can be decomposed into an intersection ⋂_{i = 1}^k L(𝒜_i) of languages of smaller DFAs. Otherwise, 𝒜 is prime. This notion of primality was introduced by Kupferman and Mosheiff in 2013, and while they proved that we can decide whether a DFA is composite, the precise complexity of this problem is still open, with a doubly-exponential gap between the upper and lower bounds. In this work, we focus on permutation DFAs, i.e., those for which the transition monoid is a group. We provide an NP algorithm to decide whether a permutation DFA is composite, and show that the difficulty of this problem comes from the number of non-accepting states of the instance: we give a fixed-parameter tractable algorithm with the number of rejecting states as the parameter. Moreover, we investigate the class of commutative permutation DFAs. Their structural properties allow us to decide compositionality in NL, and even in LOGSPACE if the alphabet size is fixed. Despite this low complexity, we show that complex behaviors still arise in this class: we provide a family of composite DFAs each requiring polynomially many factors with respect to its size. We also consider the variant of the problem that asks whether a DFA is k-factor composite, that is, decomposable into k smaller DFAs, for some given integer k ∈ ℕ. We show that, for commutative permutation DFAs, restricting the number of factors makes the decision computationally harder, and yields a problem with tight bounds: it is NP-complete. Finally, we show that in general, this problem is in PSPACE, and it is in LOGSPACE for DFAs with a singleton alphabet."}],"arxiv":1,"oa_version":"Published Version","date_created":"2021-09-27T14:33:14Z","ec_funded":1,"publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","department":[{"_id":"KrCh"}],"title":"Decomposing permutation automata","publication":"32nd International Conference on Concurrency Theory","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7203-7"]},"citation":{"chicago":"Jecker, Ismael R, Nicolas Mazzocchi, and Petra Wolf. “Decomposing Permutation Automata.” In 32nd International Conference on Concurrency Theory, Vol. 203. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18.","ieee":"I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in 32nd International Conference on Concurrency Theory, Paris, France, 2021, vol. 203.","apa":"Jecker, I. R., Mazzocchi, N., & Wolf, P. (2021). Decomposing permutation automata. In 32nd International Conference on Concurrency Theory (Vol. 203). Paris, France: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18","ama":"Jecker IR, Mazzocchi N, Wolf P. Decomposing permutation automata. In: 32nd International Conference on Concurrency Theory. Vol 203. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.CONCUR.2021.18","short":"I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","mla":"Jecker, Ismael R., et al. “Decomposing Permutation Automata.” 32nd International Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.","ista":"Jecker IR, Mazzocchi N, Wolf P. 2021. Decomposing permutation automata. 32nd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 203, 18."},"external_id":{"arxiv":["2107.04683"]},"oa":1,"acknowledgement":"Ismaël Jecker: Marie Skłodowska-Curie Grant Agreement No. 754411. Nicolas Mazzocchi: BOSCO project PGC2018-102210-B-I00 (MCIU/AEI/FEDER, UE), BLOQUESCM project S2018/TCS-4339, and MINECO grant RYC-2016-20281.\r\nPetra Wolf : DFG project FE 560/9-1.\r\n","status":"public","year":"2021","has_accepted_license":"1","_id":"10052","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":203}]