[{"date_updated":"2023-08-10T14:01:41Z","publication":"Plant Cell","page":"2981–3003","article_type":"original","oa":1,"year":"2021","publisher":"American Society of Plant Biologists","intvolume":" 33","quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"JiFr"}],"date_created":"2021-07-14T15:32:43Z","external_id":{"pmid":["34240197"],"isi":["000702165300012"]},"date_published":"2021-07-07T00:00:00Z","publication_identifier":{"issn":["1040-4651"],"eissn":["1532-298x"]},"publication_status":"published","status":"public","_id":"9657","title":"GmPIN-dependent polar auxin transport is involved in soybean nodule development","author":[{"first_name":"Z","full_name":"Gao, Z","last_name":"Gao"},{"full_name":"Chen, Z","last_name":"Chen","first_name":"Z"},{"first_name":"Y","full_name":"Cui, Y","last_name":"Cui"},{"first_name":"M","full_name":"Ke, M","last_name":"Ke"},{"last_name":"Xu","full_name":"Xu, H","first_name":"H"},{"full_name":"Xu, Q","last_name":"Xu","first_name":"Q"},{"first_name":"J","last_name":"Chen","full_name":"Chen, J"},{"first_name":"Y","last_name":"Li","full_name":"Li, Y"},{"last_name":"Huang","full_name":"Huang, L","first_name":"L"},{"full_name":"Zhao, H","last_name":"Zhao","first_name":"H"},{"last_name":"Huang","full_name":"Huang, D","first_name":"D"},{"full_name":"Mai, S","last_name":"Mai","first_name":"S"},{"first_name":"T","full_name":"Xu, T","last_name":"Xu"},{"full_name":"Liu, X","last_name":"Liu","first_name":"X"},{"full_name":"Li, S","last_name":"Li","first_name":"S"},{"last_name":"Guan","full_name":"Guan, Y","first_name":"Y"},{"first_name":"W","last_name":"Yang","full_name":"Yang, W"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jiří","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Petrášek","full_name":"Petrášek, J","first_name":"J"},{"first_name":"J","last_name":"Zhang","full_name":"Zhang, J"},{"first_name":"X","last_name":"Chen","full_name":"Chen, X"}],"doi":"10.1093/plcell/koab183","abstract":[{"lang":"eng","text":"To overcome nitrogen deficiency, legume roots establish symbiotic interactions with nitrogen-fixing rhizobia that is fostered in specialized organs (nodules). Similar to other organs, nodule formation is determined by a local maximum of the phytohormone auxin at the primordium site. However, how auxin regulates nodule development remains poorly understood. Here, we found that in soybean, (Glycine max), dynamic auxin transport driven by PIN-FORMED (PIN) transporter GmPIN1 is involved in nodule primordium formation. GmPIN1 was specifically expressed in nodule primordium cells and GmPIN1 was polarly localized in these cells. Two nodulation regulators, (iso)flavonoids trigger expanded distribution of GmPIN1b to root cortical cells, and cytokinin rearranges GmPIN1b polarity. Gmpin1abc triple mutants generated with CRISPR-Cas9 showed impaired establishment of auxin maxima in nodule meristems and aberrant divisions in the nodule primordium cells. Moreover, overexpression of GmPIN1 suppressed nodule primordium initiation. GmPIN9d, an ortholog of Arabidopsis thaliana PIN2, acts together with GmPIN1 later in nodule development to acropetally transport auxin in vascular bundles, fine-tuning the auxin supply for nodule enlargement. Our findings reveal how PIN-dependent auxin transport modulates different aspects of soybean nodule development and suggest that establishment of auxin gradient is a prerequisite for the proper interaction between legumes and rhizobia."}],"issue":"9","file":[{"date_created":"2021-07-19T12:13:34Z","file_id":"9691","creator":"cziletti","relation":"main_file","file_size":10566921,"file_name":"2021_PlantCell_Gao.pdf","date_updated":"2021-07-19T12:13:34Z","success":1,"content_type":"application/pdf","checksum":"6715712ec306c321f0204c817b7f8ae7","access_level":"open_access"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"article_processing_charge":"No","volume":33,"has_accepted_license":"1","month":"07","pmid":1,"file_date_updated":"2021-07-19T12:13:34Z","ddc":["580"],"citation":{"ista":"Gao Z, Chen Z, Cui Y, Ke M, Xu H, Xu Q, Chen J, Li Y, Huang L, Zhao H, Huang D, Mai S, Xu T, Liu X, Li S, Guan Y, Yang W, Friml J, Petrášek J, Zhang J, Chen X. 2021. GmPIN-dependent polar auxin transport is involved in soybean nodule development. Plant Cell. 33(9), 2981–3003.","short":"Z. Gao, Z. Chen, Y. Cui, M. Ke, H. Xu, Q. Xu, J. Chen, Y. Li, L. Huang, H. Zhao, D. Huang, S. Mai, T. Xu, X. Liu, S. Li, Y. Guan, W. Yang, J. Friml, J. Petrášek, J. Zhang, X. Chen, Plant Cell 33 (2021) 2981–3003.","ama":"Gao Z, Chen Z, Cui Y, et al. GmPIN-dependent polar auxin transport is involved in soybean nodule development. Plant Cell. 2021;33(9):2981–3003. doi:10.1093/plcell/koab183","ieee":"Z. Gao et al., “GmPIN-dependent polar auxin transport is involved in soybean nodule development,” Plant Cell, vol. 33, no. 9. American Society of Plant Biologists, pp. 2981–3003, 2021.","apa":"Gao, Z., Chen, Z., Cui, Y., Ke, M., Xu, H., Xu, Q., … Chen, X. (2021). GmPIN-dependent polar auxin transport is involved in soybean nodule development. Plant Cell. American Society of Plant Biologists. https://doi.org/10.1093/plcell/koab183","mla":"Gao, Z., et al. “GmPIN-Dependent Polar Auxin Transport Is Involved in Soybean Nodule Development.” Plant Cell, vol. 33, no. 9, American Society of Plant Biologists, 2021, pp. 2981–3003, doi:10.1093/plcell/koab183.","chicago":"Gao, Z, Z Chen, Y Cui, M Ke, H Xu, Q Xu, J Chen, et al. “GmPIN-Dependent Polar Auxin Transport Is Involved in Soybean Nodule Development.” Plant Cell. American Society of Plant Biologists, 2021. https://doi.org/10.1093/plcell/koab183."},"day":"07","oa_version":"Published Version"},{"project":[{"call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems","grant_number":"840605","_id":"26A5D39A-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"isbn":["9781450380706"]},"ec_funded":1,"publication_status":"published","acknowledgement":"We thank Orr Fischer, Juho Hirvonen, and Tuomo Lempiäinen for valuable discussions. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 840605.","status":"public","_id":"9678","title":"Efficient load-balancing through distributed token dropping","author":[{"first_name":"Sebastian","full_name":"Brandt, Sebastian","last_name":"Brandt"},{"last_name":"Keller","full_name":"Keller, Barbara","first_name":"Barbara"},{"orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel","full_name":"Rybicki, Joel","last_name":"Rybicki"},{"first_name":"Jukka","full_name":"Suomela, Jukka","last_name":"Suomela"},{"last_name":"Uitto","full_name":"Uitto, Jara","first_name":"Jara"}],"doi":"10.1145/3409964.3461785","abstract":[{"text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for stable orientations and more generally for locally optimal semi-matchings. The prior work by Czygrinow et al. (DISC 2012) finds a stable orientation in O(Δ^5) rounds in graphs of maximum degree Δ, while we improve it to O(Δ^4) and also prove a lower bound of Ω(Δ). For the more general problem of locally optimal semi-matchings, the prior upper bound is O(S^5) and our new algorithm runs in O(C · S^4) rounds, which is an improvement for C = o(S); here C and S are the maximum degrees of customers and servers, respectively.","lang":"eng"}],"arxiv":1,"article_processing_charge":"No","month":"07","citation":{"chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Efficient Load-Balancing through Distributed Token Dropping.” In Annual ACM Symposium on Parallelism in Algorithms and Architectures, 129–39, 2021. https://doi.org/10.1145/3409964.3461785.","mla":"Brandt, Sebastian, et al. “Efficient Load-Balancing through Distributed Token Dropping.” Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–39, doi:10.1145/3409964.3461785.","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2021. Efficient load-balancing through distributed token dropping. Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures , 129–139.","ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Efficient load-balancing through distributed token dropping. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. ; 2021:129-139. doi:10.1145/3409964.3461785","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–139.","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Efficient load-balancing through distributed token dropping,” in Annual ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, 2021, pp. 129–139.","apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., & Uitto, J. (2021). Efficient load-balancing through distributed token dropping. In Annual ACM Symposium on Parallelism in Algorithms and Architectures (pp. 129–139). Virtual Event, United States. https://doi.org/10.1145/3409964.3461785"},"day":"06","oa_version":"Preprint","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures ","location":" Virtual Event, United States","start_date":"2021-07-06","end_date":"2021-07-08"},"date_updated":"2024-03-05T07:13:12Z","publication":"Annual ACM Symposium on Parallelism in Algorithms and Architectures","page":"129-139","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"15074"}]},"oa":1,"year":"2021","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.07761"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","department":[{"_id":"DaAl"}],"date_created":"2021-07-18T22:01:22Z","scopus_import":"1","external_id":{"arxiv":["2005.07761"]},"date_published":"2021-07-06T00:00:00Z"},{"status":"public","acknowledgement":"We thank Aidan Tracy for his input during the initial stages of this project. We thank Nathan Harshman, Achim Richter, Wojciech Rzadkowski, and Dane Hudson Smith for helpful discussions and comments on the manuscript. This work has been supported by European Union's Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411 (AGV); by the German Aeronautics and Space Administration (DLR) through Grant No. 50 WM 1957 (OVM); by the Deutsche Forschungsgemeinschaft through Project VO 2437/1-1 (Project No. 413495248) (AGV and HWH); by the Deutsche Forschungsgemeinschaft through Collaborative Research Center SFB 1245 (Project No. 279384907) and by the Bundesministerium für Bildung und Forschung under Contract 05P18RDFN1 (HWH). HWH also thanks the ECT* for hospitality during the workshop 'Universal physics in Many-Body Quantum Systems—From Atoms to Quarks'. This infrastructure is part of a project that has received funding from the European Union's Horizon 2020 research and innovation program under Grant Agreement No. 824093. We acknowledge support by the Deutsche Forschungsgemeinschaft and the Open Access Publishing Fund of Technische Universität Darmstadt.","publication_status":"published","ec_funded":1,"publication_identifier":{"eissn":["13672630"]},"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"issue":"6","abstract":[{"lang":"eng","text":"The relative motion of three impenetrable particles on a ring, in our case two identical fermions and one impurity, is isomorphic to a triangular quantum billiard. Depending on the ratio κ of the impurity and fermion masses, the billiards can be integrable or non-integrable (also referred to in the main text as chaotic). To set the stage, we first investigate the energy level distributions of the billiards as a function of 1/κ ∈ [0, 1] and find no evidence of integrable cases beyond the limiting values 1/κ = 1 and 1/κ = 0. Then, we use machine learning tools to analyze properties of probability distributions of individual quantum states. We find that convolutional neural networks can correctly classify integrable and non-integrable states. The decisive features of the wave functions are the normalization and a large number of zero elements, corresponding to the existence of a nodal line. The network achieves typical accuracies of 97%, suggesting that machine learning tools can be used to analyze and classify the morphology of probability densities obtained in theory or experiment."}],"doi":"10.1088/1367-2630/ac0576","author":[{"full_name":"Huber, David","last_name":"Huber","first_name":"David"},{"last_name":"Marchukov","full_name":"Marchukov, Oleksandr V.","first_name":"Oleksandr V."},{"last_name":"Hammer","full_name":"Hammer, Hans Werner","first_name":"Hans Werner"},{"orcid":"0000-0003-0393-5525","last_name":"Volosniev","full_name":"Volosniev, Artem","first_name":"Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87"}],"title":"Morphology of three-body quantum states from machine learning","_id":"9679","has_accepted_license":"1","volume":23,"article_processing_charge":"Yes","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"file":[{"file_id":"9690","date_created":"2021-07-19T11:47:16Z","success":1,"date_updated":"2021-07-19T11:47:16Z","access_level":"open_access","content_type":"application/pdf","checksum":"e39164ce7ea228d287cf8924e1a0f9fe","file_name":"2021_NewJPhys_Huber.pdf","relation":"main_file","creator":"cziletti","file_size":3868445}],"oa_version":"Published Version","day":"23","citation":{"mla":"Huber, David, et al. “Morphology of Three-Body Quantum States from Machine Learning.” New Journal of Physics, vol. 23, no. 6, 065009, IOP Publishing, 2021, doi:10.1088/1367-2630/ac0576.","chicago":"Huber, David, Oleksandr V. Marchukov, Hans Werner Hammer, and Artem Volosniev. “Morphology of Three-Body Quantum States from Machine Learning.” New Journal of Physics. IOP Publishing, 2021. https://doi.org/10.1088/1367-2630/ac0576.","apa":"Huber, D., Marchukov, O. V., Hammer, H. W., & Volosniev, A. (2021). Morphology of three-body quantum states from machine learning. New Journal of Physics. IOP Publishing. https://doi.org/10.1088/1367-2630/ac0576","ieee":"D. Huber, O. V. Marchukov, H. W. Hammer, and A. Volosniev, “Morphology of three-body quantum states from machine learning,” New Journal of Physics, vol. 23, no. 6. IOP Publishing, 2021.","short":"D. Huber, O.V. Marchukov, H.W. Hammer, A. Volosniev, New Journal of Physics 23 (2021).","ista":"Huber D, Marchukov OV, Hammer HW, Volosniev A. 2021. Morphology of three-body quantum states from machine learning. New Journal of Physics. 23(6), 065009.","ama":"Huber D, Marchukov OV, Hammer HW, Volosniev A. Morphology of three-body quantum states from machine learning. New Journal of Physics. 2021;23(6). doi:10.1088/1367-2630/ac0576"},"month":"06","ddc":["530"],"file_date_updated":"2021-07-19T11:47:16Z","article_type":"original","article_number":"065009","publication":"New Journal of Physics","date_updated":"2023-08-10T13:58:09Z","year":"2021","oa":1,"isi":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"intvolume":" 23","publisher":"IOP Publishing","external_id":{"arxiv":["2102.04961"],"isi":["000664736300001"]},"date_published":"2021-06-23T00:00:00Z","scopus_import":"1","date_created":"2021-07-18T22:01:22Z","department":[{"_id":"MiLe"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"isi":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","publisher":"Association for Research in Vision and Ophthalmology","intvolume":" 62","date_published":"2021-08-16T00:00:00Z","external_id":{"isi":["000695230000014"],"pmid":["34398198"]},"date_created":"2021-09-12T22:01:23Z","scopus_import":"1","department":[{"_id":"SaSi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_number":"14","article_type":"original","publication":"Investigative Ophthalmology and Visual Science","date_updated":"2023-08-14T06:35:17Z","year":"2021","oa":1,"has_accepted_license":"1","volume":62,"article_processing_charge":"Yes","file":[{"date_created":"2022-05-13T07:40:15Z","file_id":"11369","relation":"main_file","creator":"dernst","file_size":19707796,"file_name":"2021_IOVS_Schmitt.pdf","date_updated":"2022-05-13T07:40:15Z","success":1,"checksum":"c430967746f653aa1ae84ee617f62b73","content_type":"application/pdf","access_level":"open_access"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"oa_version":"Published Version","citation":{"apa":"Schmitt, H. M., Fehrman, R. L., Maes, M. E., Yang, H., Guo, L. W., Schlamp, C. L., … Nickells, R. W. (2021). Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. Investigative Ophthalmology and Visual Science. Association for Research in Vision and Ophthalmology. https://doi.org/10.1167/IOVS.62.10.14","ieee":"H. M. Schmitt et al., “Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression,” Investigative Ophthalmology and Visual Science, vol. 62, no. 10. Association for Research in Vision and Ophthalmology, 2021.","short":"H.M. Schmitt, R.L. Fehrman, M.E. Maes, H. Yang, L.W. Guo, C.L. Schlamp, H.R. Pelzel, R.W. Nickells, Investigative Ophthalmology and Visual Science 62 (2021).","ama":"Schmitt HM, Fehrman RL, Maes ME, et al. Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. Investigative Ophthalmology and Visual Science. 2021;62(10). doi:10.1167/IOVS.62.10.14","ista":"Schmitt HM, Fehrman RL, Maes ME, Yang H, Guo LW, Schlamp CL, Pelzel HR, Nickells RW. 2021. Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. Investigative Ophthalmology and Visual Science. 62(10), 14.","chicago":"Schmitt, Heather M., Rachel L. Fehrman, Margaret E Maes, Huan Yang, Lian Wang Guo, Cassandra L. Schlamp, Heather R. Pelzel, and Robert W. Nickells. “Increased Susceptibility and Intrinsic Apoptotic Signaling in Neurons by Induced HDAC3 Expression.” Investigative Ophthalmology and Visual Science. Association for Research in Vision and Ophthalmology, 2021. https://doi.org/10.1167/IOVS.62.10.14.","mla":"Schmitt, Heather M., et al. “Increased Susceptibility and Intrinsic Apoptotic Signaling in Neurons by Induced HDAC3 Expression.” Investigative Ophthalmology and Visual Science, vol. 62, no. 10, 14, Association for Research in Vision and Ophthalmology, 2021, doi:10.1167/IOVS.62.10.14."},"day":"16","pmid":1,"month":"08","file_date_updated":"2022-05-13T07:40:15Z","ddc":["570"],"acknowledgement":"The authors thank Joel Dietz for maintaining the mice used in this study, Satoshi Kinoshita and the Translational Research Initiative in Pathology Laboratory at the University of Wisconsin-Madison for cutting retinal sections analyzed in this study, and Mark Banghart for statistical review of the data analysis. Supported by National Eye Institute Grants R01 EY012223 (RWN), R01 EY030123 (RWN), R01 EY029809 (LWG), R01 EY029809 (LWG) and a Vision Research CORE grant P30 EY016665, NRSA grant T32 GM081061, by an unrestricted research grant from Research to Prevent Blindness, Inc., and by a University of Wisconsin-Madison Vilas Life Cycle award and the Frederick A. Davis Research Chair (RWN). ","publication_status":"published","status":"public","publication_identifier":{"issn":["0146-0404"],"eissn":["1552-5783"]},"abstract":[{"lang":"eng","text":"Inhibition or targeted deletion of histone deacetylase 3 (HDAC3) is neuroprotective in a variety neurodegenerative conditions, including retinal ganglion cells (RGCs) after acute optic nerve damage. Consistent with this, induced HDAC3 expression in cultured cells shows selective toxicity to neurons. Despite an established role for HDAC3 in neuronal pathology, little is known regarding the mechanism of this pathology."}],"issue":"10","doi":"10.1167/IOVS.62.10.14","title":"Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression","author":[{"first_name":"Heather M.","last_name":"Schmitt","full_name":"Schmitt, Heather M."},{"first_name":"Rachel L.","full_name":"Fehrman, Rachel L.","last_name":"Fehrman"},{"orcid":"0000-0001-9642-1085","first_name":"Margaret E","id":"3838F452-F248-11E8-B48F-1D18A9856A87","last_name":"Maes","full_name":"Maes, Margaret E"},{"full_name":"Yang, Huan","last_name":"Yang","first_name":"Huan"},{"first_name":"Lian Wang","last_name":"Guo","full_name":"Guo, Lian Wang"},{"full_name":"Schlamp, Cassandra L.","last_name":"Schlamp","first_name":"Cassandra L."},{"last_name":"Pelzel","full_name":"Pelzel, Heather R.","first_name":"Heather R."},{"first_name":"Robert W.","last_name":"Nickells","full_name":"Nickells, Robert W."}],"_id":"10000"},{"article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","conference":{"name":"LICS: Symposium on Logic in Computer Science","end_date":"2021-07-02","start_date":"2021-06-29","location":"Rome, Italy"},"citation":{"ista":"Chatterjee K, Dvorak W, Henzinger MH, Svozil A. 2021. Symbolic time and space tradeoffs for probabilistic verification. 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, W. Dvorak, M.H. Henzinger, A. Svozil, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","ama":"Chatterjee K, Dvorak W, Henzinger MH, Svozil A. Symbolic time and space tradeoffs for probabilistic verification. 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.9470739","ieee":"K. Chatterjee, W. Dvorak, M. H. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.","apa":"Chatterjee, K., Dvorak, W., Henzinger, M. H., & Svozil, A. (2021). Symbolic time and space tradeoffs for probabilistic verification. 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.9470739","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorak, Monika H Henzinger, and Alexander Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” 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.9470739.","mla":"Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” 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.9470739."},"day":"07","month":"07","acknowledgement":"The authors are grateful to the anonymous referees for their valuable comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For M. H. the research leading to these results has received funding from the European Research Council under the European Unions Seventh Framework Programme (FP/2007–2013) / ERC Grant Agreement no. 340506.","publication_status":"published","status":"public","ec_funded":1,"publication_identifier":{"eisbn":["978-1-6654-4895-6"],"issn":["1043-6871"],"isbn":["978-1-6654-4896-3"]},"project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"abstract":[{"lang":"eng","text":"We present a faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision processes (MDPs). This problem generalizes the SCC decomposition problem of graphs and closed recurrent sets of Markov chains. The model of symbolic algorithms is widely used in formal verification and model-checking, where access to the input model is restricted to only symbolic operations (e.g., basic set operations and computation of one-step neighborhood). For an input MDP with n vertices and m edges, the classical symbolic algorithm from the 1990s for the MEC decomposition requires O(n2) symbolic operations and O(1) symbolic space. The only other symbolic algorithm for the MEC decomposition requires O(nm−−√) symbolic operations and O(m−−√) symbolic space. A main open question is whether the worst-case O(n2) bound for symbolic operations can be beaten. We present a symbolic algorithm that requires O˜(n1.5) symbolic operations and O˜(n−−√) symbolic space. Moreover, the parametrization of our algorithm provides a trade-off between symbolic operations and symbolic space: for all 0<ϵ≤1/2 the symbolic algorithm requires O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space ( O˜ hides poly-logarithmic factors). Using our techniques we present faster algorithms for computing the almost-sure winning regions of ω -regular objectives for MDPs. We consider the canonical parity objectives for ω -regular objectives, and for parity objectives with d -priorities we present an algorithm that computes the almost-sure winning region with O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space, for all 0<ϵ≤1/2 ."}],"doi":"10.1109/LICS52264.2021.9470739","title":"Symbolic time and space tradeoffs for probabilistic verification","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Wolfgang","last_name":"Dvorak","full_name":"Dvorak, Wolfgang"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"last_name":"Svozil","full_name":"Svozil, Alexander","first_name":"Alexander"}],"_id":"10002","isi":1,"language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","publisher":"Institute of Electrical and Electronics Engineers","main_file_link":[{"url":"https://arxiv.org/abs/2104.07466","open_access":"1"}],"date_published":"2021-07-07T00:00:00Z","external_id":{"isi":["000947350400089"],"arxiv":["2104.07466"]},"date_created":"2021-09-12T22:01:24Z","scopus_import":"1","department":[{"_id":"KrCh"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","page":"1-13","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","date_updated":"2025-07-14T09:10:07Z","year":"2021","keyword":["Computer science","Computational modeling","Markov processes","Probabilistic logic","Formal verification","Game Theory"],"oa":1},{"doi":"10.1109/LICS52264.2021.9470595","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."}],"_id":"10004","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"title":"Stochastic processes with expected stopping time","ec_funded":1,"publication_status":"published","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).","status":"public","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"publication_identifier":{"isbn":["978-1-6654-4896-3"],"eisbn":["978-1-6654-4895-6"],"issn":["1043-6871"]},"conference":{"location":"Rome, Italy","start_date":"2021-06-29","end_date":"2021-07-02","name":"LICS: Symposium on Logic in Computer Science"},"oa_version":"Preprint","month":"07","day":"07","citation":{"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.","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.","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","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."},"article_processing_charge":"No","arxiv":1,"keyword":["Computer science","Heuristic algorithms","Memory management","Automata","Markov processes","Probability distribution","Complexity theory"],"year":"2021","oa":1,"page":"1-13","date_updated":"2025-07-14T09:10:08Z","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","scopus_import":"1","date_created":"2021-09-12T22:01:25Z","date_published":"2021-07-07T00:00:00Z","external_id":{"isi":["000947350400036"],"arxiv":["2104.07278"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"KrCh"}],"type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.07278"}],"publisher":"Institute of Electrical and Electronics Engineers"},{"article_type":"original","publication":"Mathematical Models and Methods in Applied Sciences","date_updated":"2023-09-04T11:43:45Z","year":"2021","keyword":["Nonlinear parabolic systems","implicit constitutive theory","weak solutions","existence","uniqueness"],"oa":1,"isi":1,"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":" 31","main_file_link":[{"url":"https://arxiv.org/abs/2009.06917","open_access":"1"}],"publisher":"World Scientific","date_published":"2021-08-25T00:00:00Z","external_id":{"arxiv":["2009.06917"],"isi":["000722222900004"]},"scopus_import":"1","date_created":"2021-09-12T22:01:25Z","department":[{"_id":"JuFi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","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","publication_identifier":{"issn":["0218-2025"],"eissn":["1793-6314"]},"project":[{"grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems"}],"issue":"09","abstract":[{"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.","lang":"eng"}],"doi":"10.1142/S0218202521500457","author":[{"first_name":"Miroslav","full_name":"Bulíček, Miroslav","last_name":"Bulíček"},{"id":"dbabca31-66eb-11eb-963a-fb9c22c880b4","first_name":"Erika","full_name":"Maringová, Erika","last_name":"Maringová"},{"first_name":"Josef","last_name":"Málek","full_name":"Málek, Josef"}],"title":"On nonlinear problems of parabolic type with implicit constitutive equations involving flux","_id":"10005","volume":31,"article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","day":"25","citation":{"short":"M. Bulíček, E. Maringová, J. Málek, Mathematical Models and Methods in Applied Sciences 31 (2021).","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","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).","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.","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","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.","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."},"month":"08"},{"file":[{"date_created":"2021-09-13T11:03:24Z","file_id":"10008","relation":"source_file","file_size":15022154,"creator":"shensel","file_name":"thesis_final_Hensel.zip","checksum":"c8475faaf0b680b4971f638f1db16347","content_type":"application/x-zip-compressed","access_level":"closed","date_updated":"2021-09-15T14:37:30Z"},{"date_created":"2021-09-13T14:18:56Z","file_id":"10014","checksum":"1a609937aa5275452822f45f2da17f07","content_type":"application/pdf","access_level":"open_access","date_updated":"2021-09-14T09:52:47Z","relation":"main_file","file_size":6583638,"creator":"shensel","file_name":"thesis_final_Hensel.pdf"}],"degree_awarded":"PhD","article_processing_charge":"No","has_accepted_license":"1","month":"09","file_date_updated":"2021-09-15T14:37:30Z","ddc":["515"],"day":"14","citation":{"ieee":"S. Hensel, “Curvature driven interface evolution: Uniqueness properties of weak solution concepts,” Institute of Science and Technology Austria, 2021.","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","ista":"Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria.","ama":"Hensel S. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. 2021. doi:10.15479/at:ista:10007","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.","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."},"oa_version":"Published Version","project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"grant_number":"948819","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","name":"Bridging Scales in Random Materials","call_identifier":"H2020"}],"publication_identifier":{"issn":["2663-337X"]},"ec_funded":1,"status":"public","publication_status":"published","_id":"10007","author":[{"orcid":"0000-0001-7252-8072","first_name":"Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","last_name":"Hensel","full_name":"Hensel, Sebastian"}],"supervisor":[{"last_name":"Fischer","full_name":"Fischer, Julian L","first_name":"Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X"}],"title":"Curvature driven interface evolution: Uniqueness properties of weak solution concepts","doi":"10.15479/at:ista:10007","abstract":[{"lang":"eng","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."}],"publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"type":"dissertation","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"GradSch"},{"_id":"JuFi"}],"date_created":"2021-09-13T11:12:34Z","date_published":"2021-09-14T00:00:00Z","date_updated":"2023-09-07T13:30:45Z","page":"300","related_material":{"record":[{"id":"10012","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"10013"},{"relation":"part_of_dissertation","status":"public","id":"7489"}]},"oa":1,"alternative_title":["ISTA Thesis"],"year":"2021"},{"citation":{"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","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. .","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.).","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","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.","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."},"day":"09","department":[{"_id":"JuFi"}],"month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-09-09T00:00:00Z","external_id":{"arxiv":["2109.04233"]},"date_created":"2021-09-13T12:17:10Z","oa_version":"Preprint","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/2109.04233","open_access":"1"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"type":"preprint","oa":1,"title":"A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness","author":[{"orcid":"0000-0001-7252-8072","full_name":"Hensel, Sebastian","last_name":"Hensel","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian"},{"full_name":"Laux, Tim","last_name":"Laux","first_name":"Tim"}],"_id":"10011","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."}],"year":"2021","doi":"10.48550/arXiv.2109.04233","keyword":["Mean curvature flow","gradient flows","varifolds","weak solutions","weak-strong uniqueness","calibrated geometry","gradient-flow calibrations"],"publication":"arXiv","project":[{"_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","grant_number":"948819","name":"Bridging Scales in Random Materials","call_identifier":"H2020"}],"date_updated":"2023-05-03T10:34:38Z","publication_status":"submitted","status":"public","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.","article_number":"2109.04233","ec_funded":1},{"arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/2108.01733","open_access":"1"}],"language":[{"iso":"eng"}],"type":"preprint","article_processing_charge":"No","department":[{"_id":"JuFi"}],"day":"03","citation":{"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.","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.","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.).","ista":"Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. 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"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","date_published":"2021-08-03T00:00:00Z","external_id":{"arxiv":["2108.01733"]},"date_created":"2021-09-13T12:17:11Z","oa_version":"Preprint","publication":"arXiv","date_updated":"2023-09-07T13:30:45Z","project":[{"_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","grant_number":"948819","call_identifier":"H2020","name":"Bridging Scales in Random Materials"}],"publication_status":"submitted","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.","status":"public","related_material":{"record":[{"relation":"later_version","status":"public","id":"13043"},{"status":"public","relation":"dissertation_contains","id":"10007"}]},"ec_funded":1,"article_number":"2108.01733","author":[{"last_name":"Hensel","full_name":"Hensel, Sebastian","first_name":"Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7252-8072"},{"first_name":"Tim","last_name":"Laux","full_name":"Laux, Tim"}],"oa":1,"title":"Weak-strong uniqueness for the mean curvature flow of double bubbles","_id":"10013","year":"2021","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"}],"doi":"10.48550/arXiv.2108.01733"},{"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10083"}]},"article_type":"original","article_number":"1665 ","publication":"Cells","date_updated":"2024-10-29T10:22:44Z","alternative_title":["Protein Phosphorylation and Cell Signaling in Plants"],"year":"2021","keyword":["primary root","(phospho)proteomics","auxin","(receptor) kinase"],"oa":1,"isi":1,"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":" 10","publisher":"MDPI","external_id":{"pmid":["34359847"],"isi":["000676604700001"]},"date_published":"2021-07-02T00:00:00Z","date_created":"2021-09-14T11:36:20Z","department":[{"_id":"JiFr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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).","publication_status":"published","status":"public","ec_funded":1,"publication_identifier":{"issn":["2073-4409"]},"project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"name":"FWF Open Access Fund","call_identifier":"FWF","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"}],"abstract":[{"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.","lang":"eng"}],"doi":"10.3390/cells10071665","author":[{"full_name":"Nikonorova, N","last_name":"Nikonorova","first_name":"N"},{"first_name":"E","last_name":"Murphy","full_name":"Murphy, E"},{"full_name":"Fonseca de Lima, CF","last_name":"Fonseca de Lima","first_name":"CF"},{"first_name":"S","last_name":"Zhu","full_name":"Zhu, S"},{"full_name":"van de Cotte, B","last_name":"van de Cotte","first_name":"B"},{"first_name":"LD","last_name":"Vu","full_name":"Vu, LD"},{"last_name":"Balcerowicz","full_name":"Balcerowicz, D","first_name":"D"},{"orcid":"0000-0002-5607-272X","last_name":"Li","full_name":"Li, Lanxin","first_name":"Lanxin","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kong","full_name":"Kong, X","first_name":"X"},{"first_name":"G","full_name":"De Rop, G","last_name":"De Rop"},{"full_name":"Beeckman, T","last_name":"Beeckman","first_name":"T"},{"orcid":"0000-0002-8302-7596","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Friml, Jiří"},{"last_name":"Vissenberg","full_name":"Vissenberg, K","first_name":"K"},{"first_name":"PC","last_name":"Morris","full_name":"Morris, PC"},{"full_name":"Ding, Z","last_name":"Ding","first_name":"Z"},{"first_name":"I","last_name":"De Smet","full_name":"De Smet, I"}],"title":"The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators","_id":"10015","has_accepted_license":"1","volume":10,"article_processing_charge":"Yes","file":[{"checksum":"2a9f534b9c2200e72e2cde95afaf4eed","content_type":"application/pdf","access_level":"open_access","date_updated":"2021-09-16T09:07:06Z","success":1,"creator":"cchlebak","file_size":2667848,"relation":"main_file","file_name":"2021_Cells_Nikonorova.pdf","date_created":"2021-09-16T09:07:06Z","file_id":"10021"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","day":"02","citation":{"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","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).","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","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.","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."},"ddc":["575"],"file_date_updated":"2021-09-16T09:07:06Z","month":"07","pmid":1},{"page":"481-536","article_type":"original","publication":"Communications in Information and Systems","date_updated":"2021-09-20T12:51:18Z","year":"2021","keyword":["Markov Chain","relative entropy","time reversal","steepest descent","gradient flow"],"oa":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","publisher":"International Press","intvolume":" 21","main_file_link":[{"url":"https://arxiv.org/abs/2005.14177","open_access":"1"}],"external_id":{"arxiv":["2005.14177"]},"date_published":"2021-06-04T00:00:00Z","date_created":"2021-09-19T08:53:19Z","department":[{"_id":"JaMa"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","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.","status":"public","publication_status":"published","ec_funded":1,"publication_identifier":{"issn":["1526-7555"]},"project":[{"call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"},{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"}],"abstract":[{"lang":"eng","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."}],"issue":"4","doi":"10.4310/CIS.2021.v21.n4.a1","title":"Trajectorial dissipation and gradient flow for the relative entropy in Markov chains","author":[{"first_name":"Ioannis","full_name":"Karatzas, Ioannis","last_name":"Karatzas"},{"last_name":"Maas","full_name":"Maas, Jan","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338"},{"first_name":"Walter","last_name":"Schachermayer","full_name":"Schachermayer, Walter"}],"_id":"10023","article_processing_charge":"No","volume":21,"arxiv":1,"oa_version":"Preprint","citation":{"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.","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.","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","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.","short":"I. Karatzas, J. Maas, W. Schachermayer, Communications in Information and Systems 21 (2021) 481–536.","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.","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"},"day":"04","month":"06"},{"isi":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","intvolume":" 142","publisher":"Elsevier","external_id":{"isi":["000697748500005"],"arxiv":["1911.12564"]},"date_published":"2021-08-27T00:00:00Z","scopus_import":"1","date_created":"2021-09-19T22:01:25Z","department":[{"_id":"JaMa"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_type":"original","page":"124-158","publication":"Stochastic Processes and their Applications","date_updated":"2023-08-14T06:52:43Z","year":"2021","keyword":["hydrodynamic limit","random environment","random conductance model","arbitrary starting point quenched invariance principle","duality","mild solution"],"oa":1,"has_accepted_license":"1","volume":142,"article_processing_charge":"Yes","file":[{"relation":"main_file","creator":"dernst","file_size":2115791,"file_name":"2021_StochasticProcessesAppl_Floreani.pdf","checksum":"56768c553d7218ee5714902ffec90ec4","content_type":"application/pdf","access_level":"open_access","date_updated":"2022-05-13T07:55:50Z","success":1,"date_created":"2022-05-13T07:55:50Z","file_id":"11370"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"oa_version":"Published Version","day":"27","citation":{"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.","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.","short":"S. Floreani, F. Redig, F. Sau, Stochastic Processes and Their Applications 142 (2021) 124–158.","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","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.","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","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."},"file_date_updated":"2022-05-13T07:55:50Z","month":"08","ddc":["519"],"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","publication_status":"published","ec_funded":1,"publication_identifier":{"issn":["0304-4149"]},"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"abstract":[{"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).","lang":"eng"}],"doi":"10.1016/j.spa.2021.08.006","author":[{"first_name":"Simone","full_name":"Floreani, Simone","last_name":"Floreani"},{"first_name":"Frank","last_name":"Redig","full_name":"Redig, Frank"},{"last_name":"Sau","full_name":"Sau, Federico","first_name":"Federico","id":"E1836206-9F16-11E9-8814-AEFDE5697425"}],"title":"Hydrodynamics for the partial exclusion process in random environment","_id":"10024"},{"publisher":"Springer Nature","main_file_link":[{"url":"https://arxiv.org/abs/2104.00653","open_access":"1"}],"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"MaSe"},{"_id":"MiLe"}],"date_created":"2021-09-19T22:01:25Z","scopus_import":"1","external_id":{"isi":["000706977400002"],"arxiv":["2104.00653"]},"date_published":"2021-09-01T00:00:00Z","date_updated":"2023-08-14T07:04:06Z","publication":"Nature","article_type":"original","related_material":{"link":[{"url":"https://doi.org/10.1038/s41586-021-04181-z","relation":"erratum"}]},"oa":1,"keyword":["condensed matter - mesoscale and nanoscale physics","condensed matter - strongly correlated electrons","multidisciplinary"],"year":"2021","arxiv":1,"article_processing_charge":"No","month":"09","citation":{"ieee":"H. Zhou et al., “Half and quarter metals in rhombohedral trilayer graphene,” Nature. Springer Nature, 2021.","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","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).","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","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.","mla":"Zhou, Haoxin, et al. “Half and Quarter Metals in Rhombohedral Trilayer Graphene.” Nature, Springer Nature, 2021, doi: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."},"day":"01","oa_version":"Preprint","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"ec_funded":1,"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","publication_status":"published","status":"public","_id":"10025","title":"Half and quarter metals in rhombohedral trilayer graphene","author":[{"first_name":"Haoxin","full_name":"Zhou, Haoxin","last_name":"Zhou"},{"first_name":"Tian","last_name":"Xie","full_name":"Xie, Tian"},{"orcid":"0000-0001-9666-3543","last_name":"Ghazaryan","full_name":"Ghazaryan, Areg","first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tobias","full_name":"Holder, Tobias","last_name":"Holder"},{"full_name":"Ehrets, James R.","last_name":"Ehrets","first_name":"James R."},{"first_name":"Eric M.","last_name":"Spanton","full_name":"Spanton, Eric M."},{"full_name":"Taniguchi, Takashi","last_name":"Taniguchi","first_name":"Takashi"},{"first_name":"Kenji","last_name":"Watanabe","full_name":"Watanabe, Kenji"},{"last_name":"Berg","full_name":"Berg, Erez","first_name":"Erez"},{"first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn","full_name":"Serbyn, Maksym","orcid":"0000-0002-2399-5827"},{"first_name":"Andrea F.","full_name":"Young, Andrea F.","last_name":"Young"}],"doi":"10.1038/s41586-021-03938-w","abstract":[{"lang":"eng","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."}]},{"article_processing_charge":"No","type":"preprint","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2107.03695"}],"arxiv":1,"external_id":{"arxiv":["2107.03695"]},"date_published":"2021-07-08T00:00:00Z","oa_version":"Preprint","date_created":"2021-09-21T08:41:02Z","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"citation":{"ieee":"D. T. Phan et al., “Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid,” arXiv. .","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.","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.","ama":"Phan DT, Senior JL, Ghazaryan A, et al. Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid. arXiv.","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.","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."},"day":"08","department":[{"_id":"MaSe"},{"_id":"AnHi"},{"_id":"MiLe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","related_material":{"record":[{"status":"public","relation":"later_version","id":"10851"},{"status":"public","relation":"research_data","id":"9636"}]},"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.","publication_status":"submitted","status":"public","article_number":"2107.03695","ec_funded":1,"publication":"arXiv","date_updated":"2024-02-21T12:36:52Z","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"abstract":[{"lang":"eng","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."}],"year":"2021","oa":1,"title":"Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid","author":[{"full_name":"Phan, Duc T","last_name":"Phan","id":"29C8C0B4-F248-11E8-B48F-1D18A9856A87","first_name":"Duc T"},{"orcid":"0000-0002-0672-9295","full_name":"Senior, Jorden L","last_name":"Senior","id":"5479D234-2D30-11EA-89CC-40953DDC885E","first_name":"Jorden L"},{"orcid":"0000-0001-9666-3543","first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Ghazaryan","full_name":"Ghazaryan, Areg"},{"last_name":"Hatefipour","full_name":"Hatefipour, M.","first_name":"M."},{"first_name":"W. M.","full_name":"Strickland, W. M.","last_name":"Strickland"},{"first_name":"J.","last_name":"Shabani","full_name":"Shabani, J."},{"first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn","full_name":"Serbyn, Maksym","orcid":"0000-0002-2399-5827"},{"orcid":"0000-0003-2607-2363","last_name":"Higginbotham","full_name":"Higginbotham, Andrew P","first_name":"Andrew P","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87"}],"_id":"10029"},{"date_updated":"2023-09-07T13:31:06Z","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"10022"},{"status":"public","relation":"part_of_dissertation","id":"9792"},{"relation":"part_of_dissertation","status":"public","id":"7573"}]},"oa":1,"alternative_title":["ISTA Thesis"],"year":"2021","publisher":"Institute of Science and Technology Austria","type":"dissertation","language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"JaMa"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2021-09-22T00:00:00Z","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"date_created":"2021-09-21T09:14:15Z","publication_identifier":{"issn":["2663-337X"]},"project":[{"call_identifier":"FWF","name":"Dissipation and Dispersion in Nonlinear Partial Differential Equations","_id":"260788DE-B435-11E9-9278-68D0E5697425"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"}],"acknowledgement":"The author gratefully acknowledges support by the Austrian Science Fund (FWF), grants No W1245.","status":"public","publication_status":"published","author":[{"first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","last_name":"Portinale","full_name":"Portinale, Lorenzo"}],"title":"Discrete-to-continuum limits of transport problems and gradient flows in the space of measures","supervisor":[{"orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"_id":"10030","abstract":[{"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.","lang":"eng"}],"doi":"10.15479/at:ista:10030","degree_awarded":"PhD","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_name":"tex_and_pictures.zip","relation":"source_file","file_size":3876668,"creator":"cchlebak","date_updated":"2022-03-10T12:14:42Z","access_level":"closed","content_type":"application/x-zip-compressed","checksum":"8cd60dcb8762e8f21867e21e8001e183","file_id":"10032","date_created":"2021-09-21T09:17:34Z"},{"file_id":"10047","date_created":"2021-09-27T11:14:31Z","file_name":"thesis_portinale_Final (1).pdf","file_size":2532673,"creator":"cchlebak","relation":"main_file","date_updated":"2021-09-27T11:14:31Z","access_level":"open_access","checksum":"9789e9d967c853c1503ec7f307170279","content_type":"application/pdf"}],"has_accepted_license":"1","article_processing_charge":"No","day":"22","citation":{"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.","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.","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","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.","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.","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.","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"},"month":"09","file_date_updated":"2022-03-10T12:14:42Z","ddc":["515"],"oa_version":"Published Version"},{"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"isi":1,"intvolume":" 392","publisher":"Elsevier","scopus_import":"1","date_created":"2021-09-21T15:58:59Z","external_id":{"isi":["000707040300031"],"arxiv":["1610.00212"]},"date_published":"2021-09-21T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"TaHa"}],"article_type":"original","article_number":"107992","date_updated":"2023-08-14T06:54:35Z","publication":"Advances in Mathematics","keyword":["Chiral algebras","Chiral homology","Factorization algebras","Koszul duality","Ran space"],"year":"2021","oa":1,"article_processing_charge":"Yes (via OA deal)","volume":392,"has_accepted_license":"1","arxiv":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_updated":"2021-09-21T15:58:52Z","access_level":"open_access","checksum":"f3c0086d41af11db31c00014efb38072","content_type":"application/pdf","file_name":"1-s2.0-S000187082100431X-main.pdf","creator":"qho","relation":"main_file","file_size":840635,"file_id":"10034","date_created":"2021-09-21T15:58:52Z"}],"oa_version":"Published Version","month":"09","ddc":["514"],"file_date_updated":"2021-09-21T15:58:52Z","day":"21","citation":{"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.","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.","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","short":"Q.P. Ho, Advances in Mathematics 392 (2021).","ieee":"Q. P. Ho, “The Atiyah-Bott formula and connectivity in chiral Koszul duality,” Advances in Mathematics, vol. 392. Elsevier, 2021.","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"},"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","publication_status":"published","project":[{"name":"Algebro-Geometric Applications of Factorization Homology","call_identifier":"FWF","grant_number":"M02751","_id":"26B96266-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"eissn":["1090-2082"],"issn":["0001-8708"]},"doi":"10.1016/j.aim.2021.107992","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"}],"_id":"10033","author":[{"orcid":"0000-0001-6889-1418","id":"3DD82E3C-F248-11E8-B48F-1D18A9856A87","first_name":"Quoc P","full_name":"Ho, Quoc P","last_name":"Ho"}],"title":"The Atiyah-Bott formula and connectivity in chiral Koszul duality"},{"oa":1,"alternative_title":["ISTA Thesis"],"year":"2021","date_updated":"2023-10-17T09:24:07Z","page":"276","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"10044"},{"relation":"part_of_dissertation","status":"public","id":"10049"},{"id":"637","relation":"part_of_dissertation","status":"public"},{"id":"10041","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"6430"},{"status":"public","relation":"part_of_dissertation","id":"10048"}]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"GradSch"},{"_id":"KrPi"}],"date_created":"2021-09-23T07:31:44Z","date_published":"2021-09-23T00:00:00Z","publisher":"Institute of Science and Technology Austria","type":"dissertation","language":[{"iso":"eng"}],"_id":"10035","supervisor":[{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"title":"On the adaptive security of graph-based games","author":[{"first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","last_name":"Klein","full_name":"Klein, Karen"}],"doi":"10.15479/at:ista:10035","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"}],"project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"publication_identifier":{"issn":["2663-337X"]},"ec_funded":1,"status":"public","publication_status":"published","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","ddc":["519"],"file_date_updated":"2022-03-10T12:15:18Z","month":"09","citation":{"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","ieee":"K. Klein, “On the adaptive security of graph-based games,” Institute of Science and Technology Austria, 2021.","short":"K. Klein, On the Adaptive Security of Graph-Based Games, Institute of Science and Technology Austria, 2021.","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.","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."},"day":"23","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"creator":"cchlebak","relation":"main_file","file_size":2104726,"file_name":"thesis_pdfa.pdf","content_type":"application/pdf","checksum":"73a44345c683e81f3e765efbf86fdcc5","access_level":"open_access","date_updated":"2021-10-04T12:22:33Z","success":1,"date_created":"2021-10-04T12:22:33Z","file_id":"10082"},{"file_id":"10085","date_created":"2021-10-05T07:04:37Z","date_updated":"2022-03-10T12:15:18Z","access_level":"closed","checksum":"7b80df30a0e686c3ef6a56d4e1c59e29","content_type":"application/x-zip-compressed","file_name":"thesis_final (1).zip","relation":"source_file","file_size":9538359,"creator":"cchlebak"}],"degree_awarded":"PhD","article_processing_charge":"No","has_accepted_license":"1"},{"department":[{"_id":"KrPi"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2021-08-11T00:00:00Z","date_created":"2021-09-23T14:06:15Z","publisher":"Springer Nature","intvolume":" 12826","main_file_link":[{"url":"https://eprint.iacr.org/2021/945","open_access":"1"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","oa":1,"year":"2021","alternative_title":["LCNS"],"publication":"41st Annual International Cryptology Conference, Part II ","date_updated":"2023-09-07T13:32:11Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10035"}]},"page":"486-515","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.","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","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.","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."},"day":"11","month":"08","oa_version":"Preprint","conference":{"name":"CRYPTO: Annual International Cryptology Conference","start_date":"2021-08-16","location":"Virtual","end_date":"2021-08-20"},"article_processing_charge":"No","volume":12826,"title":"Limits on the Adaptive Security of Yao’s Garbling","author":[{"last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","last_name":"Klein","full_name":"Klein, Karen"},{"orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniel","full_name":"Wichs, Daniel","last_name":"Wichs"}],"_id":"10041","abstract":[{"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.","lang":"eng"}],"doi":"10.1007/978-3-030-84245-1_17","publication_identifier":{"eissn":["1611-3349"],"isbn":["978-3-030-84244-4"],"issn":["0302-9743"],"eisbn":["978-3-030-84245-1"]},"project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"acknowledgement":"We would like to thank the anonymous reviewers of Crypto’21 whose detailed comments helped us considerably improve the presentation of the paper.","status":"public","publication_status":"published","place":"Cham","ec_funded":1},{"date_published":"2021-07-08T00:00:00Z","conference":{"end_date":"2021-11-11","start_date":"2021-11-08","location":"Raleigh, NC, United States","name":"TCC: Theory of Cryptography Conference"},"oa_version":"Preprint","date_created":"2021-09-24T12:01:34Z","day":"08","department":[{"_id":"KrPi"}],"citation":{"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.","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.","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.","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.","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.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021."},"month":"07","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/926"}],"publisher":"International Association for Cryptologic Research","year":"2021","abstract":[{"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.","lang":"eng"}],"author":[{"first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen","full_name":"Klein, Karen","last_name":"Klein"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"}],"oa":1,"title":"On treewidth, separators and Yao's garbling","_id":"10044","status":"public","publication_status":"published","acknowledgement":"We would like to thank Daniel Wichs for helpful discussions on the landscape of adaptive security of Yao’s garbling. ","related_material":{"record":[{"id":"10409","relation":"later_version","status":"public"},{"id":"10035","status":"public","relation":"dissertation_contains"}]},"ec_funded":1,"article_number":"2021/926","publication":"19th Theory of Cryptography Conference 2021","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"date_updated":"2023-09-07T13:32:11Z"}]