[{"date_created":"2026-02-17T11:38:41Z","das_tickbox":"1","publication":"Nature Physics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The work was supported by the Simons Foundation (grant number 662960, to B.H.). Open access funding provided by Institute of Science and Technology (IST Austria).","dataavailabilitystatement":"Source data are available via Zenodo at https://doi.org/10.5281/zenodo.17514317 (ref. 51). The numerical simulations were carried out using the open-source codes openpipeflow41 and nsPipeflow45.","citation":{"mla":"Yang, Bowen, et al. “Discontinuous Transition to Shear Flow Turbulence.” Nature Physics, vol. 22, Springer Nature, 2026, pp. 424–29, doi:10.1038/s41567-025-03166-3.","apa":"Yang, B., Zhuang, Y., Yalniz, G., Vasudevan, M., Marensi, E., & Hof, B. (2026). Discontinuous transition to shear flow turbulence. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-025-03166-3","chicago":"Yang, Bowen, Yi Zhuang, Gökhan Yalniz, Mukund Vasudevan, Elena Marensi, and Björn Hof. “Discontinuous Transition to Shear Flow Turbulence.” Nature Physics. Springer Nature, 2026. https://doi.org/10.1038/s41567-025-03166-3.","ista":"Yang B, Zhuang Y, Yalniz G, Vasudevan M, Marensi E, Hof B. 2026. Discontinuous transition to shear flow turbulence. Nature Physics. 22, 424–429.","ama":"Yang B, Zhuang Y, Yalniz G, Vasudevan M, Marensi E, Hof B. Discontinuous transition to shear flow turbulence. Nature Physics. 2026;22:424-429. doi:10.1038/s41567-025-03166-3","short":"B. Yang, Y. Zhuang, G. Yalniz, M. Vasudevan, E. Marensi, B. Hof, Nature Physics 22 (2026) 424–429.","ieee":"B. Yang, Y. Zhuang, G. Yalniz, M. Vasudevan, E. Marensi, and B. Hof, “Discontinuous transition to shear flow turbulence,” Nature Physics, vol. 22. Springer Nature, pp. 424–429, 2026."},"arxiv":1,"publication_identifier":{"eissn":["1745-2481"],"issn":["1745-2473"]},"project":[{"grant_number":"662960","_id":"238598C6-32DE-11EA-91FC-C7463DDC885E","name":"Revisiting the Turbulence Problem Using Statistical Mechanics"}],"day":"01","language":[{"iso":"eng"}],"scopus_import":"1","publication_status":"published","publisher":"Springer Nature","date_updated":"2026-07-27T11:13:48Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2026-03-01T00:00:00Z","external_id":{"arxiv":["2311.11474"]},"doi":"10.1038/s41567-025-03166-3","article_type":"original","OA_place":"publisher","ddc":["532"],"oa":1,"month":"03","corr_author":"1","PlanS_conform":"1","license":"https://creativecommons.org/licenses/by/4.0/","author":[{"orcid":"0000-0002-4843-6853","id":"71b6ff4b-15b2-11ec-abd3-aef6b028cf7e","first_name":"Bowen","last_name":"Yang","full_name":"Yang, Bowen"},{"last_name":"Zhuang","full_name":"Zhuang, Yi","first_name":"Yi","id":"3677B57C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Yalniz, Gökhan","last_name":"Yalniz","first_name":"Gökhan","id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425","orcid":"0000-0002-8490-9312"},{"id":"3C5A959A-F248-11E8-B48F-1D18A9856A87","first_name":"Mukund","full_name":"Vasudevan, Mukund","last_name":"Vasudevan"},{"id":"0BE7553A-1004-11EA-B805-18983DDC885E","orcid":"0000-0001-7173-4923","full_name":"Marensi, Elena","last_name":"Marensi","first_name":"Elena"},{"first_name":"Björn","last_name":"Hof","full_name":"Hof, Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"type":"journal_article","title":"Discontinuous transition to shear flow turbulence","abstract":[{"text":"Depending on the type of flow, the transition to turbulence can take one of two forms: either turbulence arises from a sequence of instabilities or from the spatial proliferation of transiently chaotic domains, a process analogous to directed percolation. The former scenario is commonly referred to as a supercritical transition and frequently encountered in flows destabilized by body forces, whereas the latter subcritical transition is common in shear flows. Both cases are inherently continuous in a sense that the transformation from ordered laminar to fully turbulent fluid motion is only accomplished gradually with flow speed. Here we show that these established transition types do not account for the more general setting of shear flows subject to body forces. The combination of the two continuous scenarios leads to the attenuation of spatial coupling; with increasing forcing amplitude, the transition becomes increasingly sharp and eventually discontinuous. We argue that the suppression of laminar–turbulent coexistence and the approach towards a discontinuous phase transition potentially apply to a broad range of situations including flows subject to, for example, buoyancy, centrifugal or electromagnetic forces.","lang":"eng"}],"department":[{"_id":"GradSch"},{"_id":"BjHo"}],"OA_type":"hybrid","article_processing_charge":"Yes (via OA deal)","quality_controlled":"1","_id":"21295","page":"424-429","has_accepted_license":"1","volume":22,"file_date_updated":"2026-07-27T11:12:46Z","researchdata_availability":"yes","year":"2026","supplementarymaterial":"yes","file":[{"file_size":5152735,"file_id":"22420","access_level":"open_access","checksum":"0636abba74896c467a7237411fa2369b","success":1,"file_name":"2026_NaturePhysics_Yang.pdf","relation":"main_file","date_created":"2026-07-27T11:12:46Z","creator":"dernst","date_updated":"2026-07-27T11:12:46Z","content_type":"application/pdf"}],"status":"public","intvolume":" 22"},{"article_processing_charge":"Yes (via OA deal)","OA_type":"hybrid","page":"1483-1491","quality_controlled":"1","_id":"21483","title":"Imaging and genetic toolbox to study Arabidopsis embryogenesis","abstract":[{"text":"Embryogenesis in the model plant Arabidopsis thaliana provides a framework for understanding how cell polarity and patterning coordinate with hormonal signalling to establish the plant body plan. Following fertilisation, the zygote divides asymmetrically to generate apical and basal lineages, establishing the apical–basal axis that defines future shoot and root poles. Genetic and molecular analyses of classical mutants including gnom, monopteros (mp), bodenlos (bdl) and topless revealed that localised auxin biosynthesis, directional transport and downstream transcriptional responses are central to apical–basal axis establishment and organ initiation. The main components of this regulation are polarly localised PIN auxin transporters and downstream modules involving MONOPTEROS and WUSCHEL-RELATED HOMEOBOX transcription factors. Advances in microscopy have transformed the study of Arabidopsis embryogenesis: fluorescence-compatible clearing reagents and three-dimensional reconstructions now permit quantitative analyses of cell geometry, division orientation, and cytoskeletal dynamics. Live ovule imaging setups with confocal laser scanning and multiphoton microscopes enable real-time observation of embryo development, while laser-assisted cell ablation can be used to probe cell-to-cell communication and fate plasticity. Together, these methodological breakthroughs position Arabidopsis embryos as a prime model for dissecting the chemical and biophysical cues that shape plant development.","lang":"eng"}],"type":"journal_article","department":[{"_id":"JiFr"},{"_id":"GradSch"}],"supplementarymaterial":"no","year":"2026","file":[{"checksum":"67513dde983631bed9613fdaadbbee06","access_level":"open_access","success":1,"file_size":1708392,"file_id":"22424","relation":"main_file","file_name":"2026_NewPhytologist_Babic.pdf","content_type":"application/pdf","creator":"dernst","date_updated":"2026-07-27T11:46:25Z","date_created":"2026-07-27T11:46:25Z"}],"status":"public","intvolume":" 250","volume":250,"has_accepted_license":"1","issue":"3","pmid":1,"file_date_updated":"2026-07-27T11:46:25Z","researchdata_availability":"no","day":"01","scopus_import":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0028-646X"],"eissn":["1469-8137"]},"publication_status":"published","publisher":"Wiley","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The authors would like to acknowledge the many colleagues whose valuable contributions to the field could not be included in this review due to space limitations and reference constraints. Open Access funding provided by Institute of Science and Technology Austria/KEMÖ.","das_tickbox":"0","date_created":"2026-03-23T14:59:06Z","publication":"New Phytologist","citation":{"mla":"Babic, David, et al. “Imaging and Genetic Toolbox to Study Arabidopsis Embryogenesis.” New Phytologist, vol. 250, no. 3, Wiley, 2026, pp. 1483–91, doi:10.1111/nph.71072.","short":"D. Babic, M. Zupunski, J. Friml, New Phytologist 250 (2026) 1483–1491.","chicago":"Babic, David, Milan Zupunski, and Jiří Friml. “Imaging and Genetic Toolbox to Study Arabidopsis Embryogenesis.” New Phytologist. Wiley, 2026. https://doi.org/10.1111/nph.71072.","ista":"Babic D, Zupunski M, Friml J. 2026. Imaging and genetic toolbox to study Arabidopsis embryogenesis. New Phytologist. 250(3), 1483–1491.","ama":"Babic D, Zupunski M, Friml J. Imaging and genetic toolbox to study Arabidopsis embryogenesis. New Phytologist. 2026;250(3):1483-1491. doi:10.1111/nph.71072","ieee":"D. Babic, M. Zupunski, and J. Friml, “Imaging and genetic toolbox to study Arabidopsis embryogenesis,” New Phytologist, vol. 250, no. 3. Wiley, pp. 1483–1491, 2026.","apa":"Babic, D., Zupunski, M., & Friml, J. (2026). Imaging and genetic toolbox to study Arabidopsis embryogenesis. New Phytologist. Wiley. https://doi.org/10.1111/nph.71072"},"oa":1,"ddc":["580"],"month":"05","PlanS_conform":"1","corr_author":"1","doi":"10.1111/nph.71072","OA_place":"publisher","article_type":"original","author":[{"id":"db566d23-f6e0-11ea-865d-e6f270e968e7","last_name":"Babic","full_name":"Babic, David","first_name":"David"},{"id":"f6a21fce-573e-11f0-a150-a8d96aee2539","first_name":"Milan","last_name":"Zupunski","full_name":"Zupunski, Milan"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jiří","first_name":"Jiří"}],"date_published":"2026-05-01T00:00:00Z","date_updated":"2026-07-27T11:47:24Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"external_id":{"pmid":["41808651"]}},{"dataavailabilitystatement":"Scripts, Supplementary Datasets 1–7, and Tables S1, S2, S5 and S6 are also available at https://doi.org/10.15479/AT-ISTA-21116. Pipelines are available at https://git.ista.ac.at/llayanaf/transitions_diptera.","citation":{"chicago":"Layana Franco, Lorena Alexandra, Melissa A Toups, and Beatriz Vicoso. “Causes and Consequences of Sex-Chromosome Turnovers in Diptera.” Evolution Letters. Oxford University Press, 2026. https://doi.org/10.1093/evlett/qrag003.","short":"L.A. Layana Franco, M.A. Toups, B. Vicoso, Evolution Letters 10 (2026).","ama":"Layana Franco LA, Toups MA, Vicoso B. Causes and consequences of sex-chromosome turnovers in Diptera. Evolution Letters. 2026;10(3). doi:10.1093/evlett/qrag003","ista":"Layana Franco LA, Toups MA, Vicoso B. 2026. Causes and consequences of sex-chromosome turnovers in Diptera. Evolution Letters. 10(3), qrag003.","ieee":"L. A. Layana Franco, M. A. Toups, and B. Vicoso, “Causes and consequences of sex-chromosome turnovers in Diptera,” Evolution Letters, vol. 10, no. 3. Oxford University Press, 2026.","apa":"Layana Franco, L. A., Toups, M. A., & Vicoso, B. (2026). Causes and consequences of sex-chromosome turnovers in Diptera. Evolution Letters. Oxford University Press. https://doi.org/10.1093/evlett/qrag003","mla":"Layana Franco, Lorena Alexandra, et al. “Causes and Consequences of Sex-Chromosome Turnovers in Diptera.” Evolution Letters, vol. 10, no. 3, qrag003, Oxford University Press, 2026, doi:10.1093/evlett/qrag003."},"date_created":"2026-03-23T15:05:42Z","publication":"Evolution Letters","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by a grant from the Austrian Science Fund (FWF, grant number PAT 8748323) to B.V. We thank the Vicoso group for their feedback on an early version of the manuscript. We are grateful to Kamil Jaron and Julia Gries for helpful discussions and for sharing their unpublished work. Computational resources and support were provided by the Scientific Computing Unit at ISTA.","publication_status":"published","publisher":"Oxford University Press","publication_identifier":{"eissn":["2056-3744"]},"project":[{"grant_number":"PAT 8748323","_id":"8ed82125-16d5-11f0-9cad-fbcae312235b","name":"Sex chromosomes in evolution and development"}],"day":"01","language":[{"iso":"eng"}],"article_number":"qrag003","date_updated":"2026-07-27T12:00:11Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_published":"2026-06-01T00:00:00Z","author":[{"orcid":"0000-0002-1253-6297","id":"02814589-eb8f-11eb-b029-a70074f3f18f","first_name":"Lorena Alexandra","full_name":"Layana Franco, Lorena Alexandra","last_name":"Layana Franco"},{"id":"4E099E4E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9752-7380","last_name":"Toups","full_name":"Toups, Melissa A","first_name":"Melissa A"},{"full_name":"Vicoso, Beatriz","last_name":"Vicoso","first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306"}],"DOAJ_listed":"1","doi":"10.1093/evlett/qrag003","article_type":"original","OA_place":"publisher","ddc":["570"],"oa":1,"month":"06","corr_author":"1","department":[{"_id":"BeVi"},{"_id":"GradSch"}],"type":"journal_article","title":"Causes and consequences of sex-chromosome turnovers in Diptera","abstract":[{"lang":"eng","text":"Sex-chromosome systems are highly variable across animals, but how they transition from one to another is not well understood. Diptera have undergone multiple sex-chromosome turnovers and expansions while maintaining their general chromosomal content, which makes them an ideal clade to study such transitions. We analyzed more than 100 dipteran whole-genome assemblies and identified 4 new lineages that underwent sex-chromosome turnover (in addition to the 5 previously reported). We find that the majority of turnovers happened in the group Schizophora, which tend to have fewer genes on Muller element F (the chromosome homologous to the ancestral insect X chromosome) than lower dipterans, a factor previously hypothesized to facilitate turnover. Most derived X chromosomes have higher GC content than autosomes, consistent with a high prevalence of male achiasmy in Diptera. In addition, an excess of gene movement out of the X is detected for most of these new X chromosomes, and many of these moved genes have high testis expression in Drosophila, suggesting that out-of-X gene movement contributes to the long-term demasculinization of X chromosomes."}],"quality_controlled":"1","_id":"21486","OA_type":"gold","acknowledged_ssus":[{"_id":"ScienComp"}],"article_processing_charge":"Yes","file_date_updated":"2026-07-27T11:59:40Z","researchdata_availability":"yes","issue":"3","has_accepted_license":"1","volume":10,"file":[{"creator":"dernst","date_updated":"2026-07-27T11:59:40Z","date_created":"2026-07-27T11:59:40Z","content_type":"application/pdf","relation":"main_file","file_name":"2026_EvolutionLetters_Layana.pdf","success":1,"checksum":"7c929e78c369a5e6e064bcf263e955ad","access_level":"open_access","file_id":"22426","file_size":1895786}],"intvolume":" 10","status":"public","year":"2026","supplementarymaterial":"yes"},{"year":"2026","status":"public","doi_confirm":"1","file":[{"access_level":"closed","checksum":"2e148dad920e3f9b7c32796e0ba2e5f7","file_size":28479571,"file_id":"21856","file_name":"EIofinova_thesis_FinalVersion.zip","relation":"source_file","date_updated":"2026-05-11T08:36:01Z","date_created":"2026-05-11T08:36:01Z","creator":"eiofinov","content_type":"application/zip"},{"file_size":18137757,"file_id":"21877","checksum":"b10c2933f386f532b2dbf28b19c5525c","access_level":"open_access","success":1,"relation":"main_file","file_name":"2026_Iofinova_Eugenia_Thesis.pdf","date_created":"2026-05-13T13:10:48Z","creator":"eiofinov","date_updated":"2026-05-13T13:10:48Z","content_type":"application/pdf"}],"has_accepted_license":"1","file_date_updated":"2026-05-13T13:10:48Z","article_processing_charge":"No","acknowledged_ssus":[{"_id":"ScienComp"}],"_id":"21854","page":"237","type":"dissertation","abstract":[{"lang":"eng","text":"As neural-network-based models grow both in size and popularity, interest has grown in making the models smaller and more efficient to train. To that end, many methods have been proposed to prune models by reducing their number of nonzero parameters. Additionally, parameter-efficient fine-tuning, in which a much smaller number of parameters than the total contained in the model is updated during training, has become very popular, especially in the space of Large Language Models. At the same time, the increasingly routine deployment of machine learning in real-world applications has spurred a drive to make them more trustworthy - in the sense of, among other things, being unbiased, interpretable, and editable. In this thesis, we examine the interplay between efficiency and trustworthiness.\r\n\r\nFirst, we analyze the effects of model pruning on bias in computer vision models, demonstrating that increased sparsity leads to greater bias, largely as a function of increased model uncertainty in marginal cases. Based on this observation, we propose several bias mitigation techniques. Then, we demonstrate that example-specific model pruning can improve model interpretation methods while improving pruning efficiency to make example-specific model pruning feasible in real time. Then, we investigate the effectiveness of parameter-efficient and data-efficient model personalization via fine-tuning, demonstrating that it is highly feasible with very small computational and data resources. Finally, we consider efficiency in editing model knowledge using a custom synthetic data framework, demonstrating that parameter-efficient, low-rank fine-tuning frequently outperforms full-rank fine-tuning, and, additionally, that restricting which model blocks are fine-tuned frequently improves results. Together, the results in this thesis provide new insights and techniques for combining trustworthiness and efficiency during neural network inference and training.\r\n\r\n"}],"title":"On the utility and effects of efficiency in artificial neural networks","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"alternative_title":["ISTA Thesis"],"related_material":{"record":[{"relation":"part_of_dissertation","id":"14771","status":"public"},{"relation":"part_of_dissertation","id":"18121","status":"public"},{"id":"21858","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"21859"},{"id":"21857","status":"public","relation":"part_of_dissertation"}]},"OA_place":"publisher","doi":"10.15479/AT-ISTA-21854","degree_awarded":"PhD","month":"05","corr_author":"1","ddc":["000"],"oa":1,"author":[{"full_name":"Iofinova, Eugenia B","last_name":"Iofinova","first_name":"Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","orcid":"0000-0002-7778-3221"}],"oa_version":"Published Version","date_updated":"2026-07-27T12:50:04Z","publisher_comment":"In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not endorse any of ISTA's products or services. Internal or personal use of this material is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional purposes or for creating new collective works for resale or redistribution, please go to http://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from RightsLink. If applicable, University Microfilms and/or ProQuest Library, or the Archives of Canada may supply single copies of the dissertation.","date_published":"2026-05-11T00:00:00Z","supervisor":[{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"day":"11","project":[{"grant_number":"W1260-N35","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A","name":"Vienna Graduate School on Computational Optimization"}],"publication_status":"published","publisher":"Institute of Science and Technology Austria","das_tickbox":"1","date_created":"2026-05-11T08:43:22Z","acknowledgement":"The research in this Ph.D. was funded in whole\r\nor in part by the Austrian Science Fund (FWF) W1260-N35 (Vienna Graduate School for\r\nComputational Optimization). For open access purposes the author has applied a CC BY\r\npublic copyright license to any author accepted manuscript version arising from this submission\r\nwherever possible. Additionally, I am grateful to Alois Schlögl, Waleed Khalid, and the rest of\r\nthe ISTA Scientific Computing team for building and maintaining the infrastructure I used\r\nto run experiments. I’m also deeply grateful to the Alistarh group’s administrative assistant,\r\nChristine Francois, who always deals with our nonsense with common sense and a smile.\r\n","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"apa":"Iofinova, E. B. (2026). On the utility and effects of efficiency in artificial neural networks. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21854","ieee":"E. B. Iofinova, “On the utility and effects of efficiency in artificial neural networks,” Institute of Science and Technology Austria, 2026.","chicago":"Iofinova, Eugenia B. “On the Utility and Effects of Efficiency in Artificial Neural Networks.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21854.","short":"E.B. Iofinova, On the Utility and Effects of Efficiency in Artificial Neural Networks, Institute of Science and Technology Austria, 2026.","ama":"Iofinova EB. On the utility and effects of efficiency in artificial neural networks. 2026. doi:10.15479/AT-ISTA-21854","ista":"Iofinova EB. 2026. On the utility and effects of efficiency in artificial neural networks. Institute of Science and Technology Austria.","mla":"Iofinova, Eugenia B. On the Utility and Effects of Efficiency in Artificial Neural Networks. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21854."}},{"author":[{"full_name":"Nicolicioiu, Armand","last_name":"Nicolicioiu","first_name":"Armand"},{"last_name":"Iofinova","full_name":"Iofinova, Eugenia B","first_name":"Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","orcid":"0000-0002-7778-3221"},{"full_name":"Jovanovic, Andrej","last_name":"Jovanovic","first_name":"Andrej"},{"id":"47beb3a5-07b5-11eb-9b87-b108ec578218","first_name":"Eldar","last_name":"Kurtic","full_name":"Kurtic, Eldar"},{"id":"66374281-f394-11eb-9cf6-869147deecc0","first_name":"Mahdi","full_name":"Nikdan, Mahdi","last_name":"Nikdan"},{"last_name":"Panferov","full_name":"Panferov, Andrei","first_name":"Andrei","id":"2c18daae-4dbe-11ef-8491-98ce2d960f09"},{"last_name":"Markov","full_name":"Markov, Ilia","first_name":"Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425"},{"full_name":"Shavit, Nir","last_name":"Shavit","first_name":"Nir"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"}],"oa":1,"main_file_link":[{"url":"https://openreview.net/pdf?id=soFWnTqd23","open_access":"1"}],"corr_author":"1","month":"03","OA_place":"publisher","article_number":"81","date_published":"2026-03-06T00:00:00Z","date_updated":"2026-07-27T12:50:03Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Accepted Version","publication_status":"published","publisher":"OpenReview","conference":{"location":"Tübíngen, Germany","name":"CPAL: Conference on Parsimony and Learning","end_date":"2026-03-26","start_date":"2026-03-23"},"day":"06","language":[{"iso":"eng"}],"citation":{"apa":"Nicolicioiu, A., Iofinova, E. B., Jovanovic, A., Kurtic, E., Nikdan, M., Panferov, A., … Alistarh, D.-A. (2026). Panza: Investigating the feasibility of fully-local personalized text generation. Third Conference on Parsimony and Learning (Proceedings Track). Tübíngen, Germany: OpenReview.","ama":"Nicolicioiu A, Iofinova EB, Jovanovic A, et al. Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation. OpenReview; 2026.","chicago":"Nicolicioiu, Armand, Eugenia B Iofinova, Andrej Jovanovic, Eldar Kurtic, Mahdi Nikdan, Andrei Panferov, Ilia Markov, Nir Shavit, and Dan-Adrian Alistarh. Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation. Third Conference on Parsimony and Learning (Proceedings Track). OpenReview, 2026.","ista":"Nicolicioiu A, Iofinova EB, Jovanovic A, Kurtic E, Nikdan M, Panferov A, Markov I, Shavit N, Alistarh D-A. 2026. Panza: Investigating the feasibility of fully-local personalized text generation, OpenReview,p.","short":"A. Nicolicioiu, E.B. Iofinova, A. Jovanovic, E. Kurtic, M. Nikdan, A. Panferov, I. Markov, N. Shavit, D.-A. Alistarh, Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation, OpenReview, 2026.","ieee":"A. Nicolicioiu et al., Panza: Investigating the feasibility of fully-local personalized text generation. OpenReview, 2026.","mla":"Nicolicioiu, Armand, et al. “Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation.” Third Conference on Parsimony and Learning (Proceedings Track), 81, OpenReview, 2026."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2026-05-11T08:50:28Z","publication":"Third Conference on Parsimony and Learning (Proceedings Track)","status":"public","year":"2026","quality_controlled":"1","_id":"21857","article_processing_charge":"No","OA_type":"green","keyword":["LLMs","PEFT","LoRA","personalization","efficient ML"],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"21854"}]},"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"title":"Panza: Investigating the feasibility of fully-local personalized text generation","abstract":[{"text":"The availability of powerful open-source large language models (LLMs) opens exciting use cases, such as using personal data to fine-tune these models to imitate a user’s unique writing style. Two key requirements for this functionality are personalization–in the sense that the output should recognizably reflect the user’s own writing style—and privacy–users may justifiably be wary of uploading extremely personal data, such as their email archive, to a third-party service. In this paper, we demonstrate the feasibility of training and running such an assistant, which we call Panza, on commodity hardware, for the specific use case of email generation. Panza’s personalization features are based on a combination of parameter-efficient fine-tuning using a variant of the Reverse Instructions technique [1] and Retrieval-Augmented Generation (RAG) [2]. We demonstrate that this combination allows us to fine-tune an LLM to reflect a user’s writing style using limited data, while executing on extremely limited resources, e.g. on a free Google Colab instance. Our key methodological contribution is the first detailed study of evaluation metrics for this task, and\r\nof how different choices of system components–the use of RAG and of different fine-tuning approaches–impact the system’s performance. Additionally, we demonstrate that very little data - under 100 email samples - are sufficient to create models that convincingly imitate humans, showcasing a previously unknown attack vector in language models. We are releasing the full Panza code as well as three new email datasets licensed for research use.","lang":"eng"}],"type":"conference_poster"},{"article_processing_charge":"No","acknowledged_ssus":[{"_id":"ScienComp"}],"OA_type":"green","_id":"21859","abstract":[{"lang":"eng","text":"As artificial neural networks, and specifically large language models, have improved rapidly in capabilities and quality, they have increasingly been deployed in real-world applications, from customer service to Google search, despite the fact that they frequently make factually incorrect or undesirable statements. This trend has inspired practical and academic interest in model editing, that is, in adjusting the weights of the model to modify its likely outputs for queries relating to a specific fact or set of facts. This may be done either to amend a fact or set of facts, for instance, to fix a frequent error in the training data, or to suppress a fact or set of facts entirely, for instance, in case of dangerous knowledge. Multiple methods have been proposed to do such edits. However, at the same time, it has been shown that such model editing can be brittle and incomplete. Moreover the effectiveness of any model editing method necessarily depends on the data on which the model is trained, and, therefore, a good understanding of the interaction of the training data distribution and the way it is stored in the network is necessary and helpful to reliably perform model editing. However, working with large language models trained on real-world data does not allow us to understand this relationship or fully measure the effects of model editing. We therefore propose Behemoth, a fully synthetic data generation framework. To demonstrate the practical insights from the framework, we explore model editing in the context of simple tabular data, demonstrating surprising findings that, in some cases, echo real-world results, for instance, that in some cases restricting the update rank results in a more effective update."}],"title":"Behemoth: Benchmarking unlearning in LLMs using fully synthetic data","type":"preprint","related_material":{"record":[{"status":"public","id":"21854","relation":"dissertation_contains"}]},"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"year":"2026","status":"public","language":[{"iso":"eng"}],"project":[{"grant_number":"W1260-N35","name":"Vienna Graduate School on Computational Optimization","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"}],"day":"30","arxiv":1,"publication_status":"draft","acknowledgement":"EI thanks Weiwei Yang, Janardhan Kulkani, and Kate Lytvynets for their advice and support in\r\ndeveloping an earlier version of the Behemoth library. This research was supported by the Scientific\r\nService Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp).\r\nEI was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35.\r\n","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication":"arXiv","date_created":"2026-05-11T08:58:07Z","citation":{"mla":"Iofinova, Eugenia B., and Dan-Adrian Alistarh. “Behemoth: Benchmarking Unlearning in LLMs Using Fully Synthetic Data.” ArXiv, doi:10.48550/arXiv.2601.23153.","apa":"Iofinova, E. B., & Alistarh, D.-A. (n.d.). Behemoth: Benchmarking unlearning in LLMs using fully synthetic data. arXiv. https://doi.org/10.48550/arXiv.2601.23153","ieee":"E. B. Iofinova and D.-A. Alistarh, “Behemoth: Benchmarking unlearning in LLMs using fully synthetic data,” arXiv. .","ama":"Iofinova EB, Alistarh D-A. Behemoth: Benchmarking unlearning in LLMs using fully synthetic data. arXiv. doi:10.48550/arXiv.2601.23153","ista":"Iofinova EB, Alistarh D-A. Behemoth: Benchmarking unlearning in LLMs using fully synthetic data. arXiv, 10.48550/arXiv.2601.23153.","short":"E.B. Iofinova, D.-A. Alistarh, ArXiv (n.d.).","chicago":"Iofinova, Eugenia B, and Dan-Adrian Alistarh. “Behemoth: Benchmarking Unlearning in LLMs Using Fully Synthetic Data.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2601.23153."},"month":"01","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2601.23153"}],"oa":1,"OA_place":"repository","doi":"10.48550/arXiv.2601.23153","author":[{"orcid":"0000-0002-7778-3221","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","first_name":"Eugenia B","last_name":"Iofinova","full_name":"Iofinova, Eugenia B"},{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2026-01-30T00:00:00Z","oa_version":"Preprint","date_updated":"2026-07-27T12:50:03Z","external_id":{"arxiv":["2601.23153"]}},{"title":"Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames","abstract":[{"text":"This thesis investigates algorithmic certification and approximation methods for degenerate semidefinite programs (SDPs) and the singular roots of polynomial systems. In the first part, we present a hybrid symbolic-numeric algorithm for certifying the feasibility of weakly feasible, degenerate SDPs. By reformulating linear matrix inequalities (LMIs) into a structured polynomial system via facial reduction and incidence varieties, we guarantee the existence of an isolated exact solution. This algebraic reduction enables the certification of maximum-rank numerical approximations using methods from algebraic geometry.\r\n\r\nIn the second part, we address the severe ill-conditioning and loss of quadratic convergence that plague standard path-tracking methods near isolated singular roots. To overcome this, we propose tracking algorithms that achieve superlinear convergence without the computational bloat characteristic of classical deflation techniques. By modeling the solution path as a generalized fractional Puiseux series, our approach combines an explicitly derived algebraic predictor with a localized hyperplane desingularization phase during the corrector step. Furthermore, we introduce a continuous path-limit method and an extension of the geometric sequence rule to directly extract exact fractional exponents. This bypasses traditional heuristic trial-and-error methods and explicitly accommodates sparse series expansions. Numerical experiments confirm that our method significantly reduces the cumulative number of matrix inversions while achieving high-accuracy root approximations, even for heavily degenerate systems exhibiting higher coranks.","lang":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"21144"}]},"department":[{"_id":"GradSch"},{"_id":"VlKo"}],"article_processing_charge":"No","page":"89","_id":"21957","has_accepted_license":"1","file_date_updated":"2026-06-10T13:33:25Z","year":"2026","file":[{"file_size":40811933,"file_id":"21958","access_level":"closed","checksum":"b11a959e99d3dcf61040282b5c837141","relation":"source_file","file_name":"istaustriathesis_JZapata.zip","creator":"jzapata","date_updated":"2026-06-08T13:20:02Z","date_created":"2026-06-08T13:20:02Z","content_type":"application/zip"},{"file_size":2207892,"file_id":"21992","access_level":"open_access","checksum":"edf1e5899b2e31505cd1aa3fe8bd4b7f","success":1,"file_name":"4_Final_Thesis_JZapata_REX.pdf","relation":"main_file","date_created":"2026-06-10T13:33:25Z","creator":"jzapata","date_updated":"2026-06-10T13:33:25Z","content_type":"application/pdf"}],"doi_confirm":"1","status":"public","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","acknowledgement":"Funding: Vienna Graduate School on Computational Optimization (FWF), grant DOI: 10.55776/W1260.","date_created":"2026-06-08T13:29:52Z","das_tickbox":"1","citation":{"mla":"Zapata, Jeferson. Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21957.","ama":"Zapata J. Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames. 2026. doi:10.15479/AT-ISTA-21957","ista":"Zapata J. 2026. Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames. Institute of Science and Technology Austria.","short":"J. Zapata, Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames, Institute of Science and Technology Austria, 2026.","chicago":"Zapata, Jeferson. “Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21957.","ieee":"J. Zapata, “Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames,” Institute of Science and Technology Austria, 2026.","apa":"Zapata, J. (2026). Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21957"},"day":"09","project":[{"grant_number":"W1260-N35","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A","name":"Vienna Graduate School on Computational Optimization"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-079-4"]},"publisher":"Institute of Science and Technology Austria","publication_status":"published","date_published":"2026-06-09T00:00:00Z","date_updated":"2026-07-27T14:30:42Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"supervisor":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"}],"ddc":["500"],"oa":1,"corr_author":"1","month":"06","doi":"10.15479/AT-ISTA-21957","degree_awarded":"PhD","OA_place":"publisher","author":[{"first_name":"Jeferson","full_name":"Zapata, Jeferson","last_name":"Zapata","id":"00223538-AF8F-11E9-A4C7-F729E6697425"}]},{"year":"2026","file":[{"relation":"source_file","file_name":"2026_Riegler_Stefan_Thesis.zip","content_type":"application/x-zip-compressed","date_created":"2026-03-02T10:59:50Z","date_updated":"2026-03-02T10:59:50Z","creator":"sriegler","checksum":"2f1f44e8536c2538f94a440217452c9f","access_level":"closed","file_size":31430022,"file_id":"21386"},{"embargo_to":"open_access","checksum":"2e8dc39640bc26ae5684c944c619719b","access_level":"closed","embargo":"2027-02-27","file_size":11635090,"file_id":"21387","relation":"main_file","file_name":"2026_Riegler_Stefan_Thesis.pdf","content_type":"application/pdf","date_created":"2026-03-02T10:59:49Z","date_updated":"2026-03-02T10:59:49Z","creator":"sriegler"}],"status":"public","doi_confirm":"1","has_accepted_license":"1","file_date_updated":"2026-03-02T10:59:50Z","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"article_processing_charge":"No","_id":"21360","page":"185","type":"dissertation","title":"Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea species","department":[{"_id":"GradSch"},{"_id":"EvBe"}],"alternative_title":["ISTA Thesis"],"related_material":{"record":[{"relation":"research_data","status":"public","id":"21363"}]},"doi":"10.15479/AT-ISTA-21360","degree_awarded":"PhD","OA_place":"repository","ddc":["570","575","583"],"corr_author":"1","month":"02","license":"https://creativecommons.org/licenses/by-sa/4.0/","author":[{"orcid":"0000-0003-3413-1343","id":"FF6018E0-D806-11E9-8E43-0B14E6697425","first_name":"Stefan","full_name":"Riegler, Stefan","last_name":"Riegler"}],"date_updated":"2026-07-27T14:30:08Z","oa_version":"Published Version","tmp":{"short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"date_published":"2026-02-26T00:00:00Z","supervisor":[{"first_name":"Eva","last_name":"Benková","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["2663-337X"]},"day":"26","project":[{"name":"Breeding for coffee and cocoa root resilience in low input farming systems based on improved rootstocks","_id":"34afa094-11ca-11ed-8bc3-a375845a59fb","grant_number":"101060393"}],"language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","date_created":"2026-02-27T09:08:14Z","das_tickbox":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","acknowledgement":"I would like to acknowledge the Austrian Academy of Sciences (ÖAW) and European\r\nResearch Executive Agency (REA) for funding my research (DOC ÖAW Fellowship\r\n26130, Horizon Europe BOLERO Project 101060393). ","citation":{"apa":"Riegler, S. (2026). Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea species. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21360","ieee":"S. Riegler, “Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea species,” Institute of Science and Technology Austria, 2026.","ama":"Riegler S. Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea species. 2026. doi:10.15479/AT-ISTA-21360","short":"S. Riegler, Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea Species, Institute of Science and Technology Austria, 2026.","chicago":"Riegler, Stefan. “Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea Species.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21360.","ista":"Riegler S. 2026. Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea species. Institute of Science and Technology Austria.","mla":"Riegler, Stefan. Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea Species. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21360."}},{"author":[{"orcid":"0000-0003-3413-1343","id":"FF6018E0-D806-11E9-8E43-0B14E6697425","first_name":"Stefan","last_name":"Riegler","full_name":"Riegler, Stefan"}],"file":[{"file_size":63749444,"file_id":"21364","access_level":"closed","embargo_to":"open_access","checksum":"de9145fa166a28c588b5184a2d3d4fee","embargo":"2027-02-27","file_name":"SupplementaryTables.xlsx","relation":"main_file","date_created":"2026-02-27T09:11:33Z","creator":"sriegler","date_updated":"2026-02-27T09:11:33Z","content_type":"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet"},{"file_name":"ReadMe.txt","relation":"main_file","date_updated":"2026-02-27T09:13:11Z","creator":"sriegler","date_created":"2026-02-27T09:13:11Z","content_type":"text/plain","file_size":124,"file_id":"21365","checksum":"ce1f163551c96cee45943a8ea29720b6","access_level":"closed","embargo_to":"open_access","embargo":"2027-02-27"}],"status":"public","ddc":["575"],"month":"02","corr_author":"1","doi":"10.15479/AT-ISTA-21363","year":"2026","file_date_updated":"2026-02-27T09:13:11Z","has_accepted_license":"1","date_published":"2026-02-27T00:00:00Z","date_updated":"2026-07-27T14:30:07Z","oa_version":"Published Version","tmp":{"short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"publisher":"Institute of Science and Technology Austria","_id":"21363","day":"27","article_processing_charge":"No","citation":{"mla":"Riegler, Stefan. Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea Species. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21363.","apa":"Riegler, S. (2026). Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis thaliana and Coffea species. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21363","ama":"Riegler S. Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis thaliana and Coffea species. 2026. doi:10.15479/AT-ISTA-21363","chicago":"Riegler, Stefan. “Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea Species.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21363.","short":"S. Riegler, (2026).","ista":"Riegler S. 2026. Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis thaliana and Coffea species, Institute of Science and Technology Austria, 10.15479/AT-ISTA-21363.","ieee":"S. Riegler, “Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis thaliana and Coffea species.” Institute of Science and Technology Austria, 2026."},"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"21360"}]},"contributor":[{"contributor_type":"supervisor","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","last_name":"Benková","first_name":"Eva"}],"department":[{"_id":"GradSch"},{"_id":"EvBe"}],"title":"Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis thaliana and Coffea species","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","abstract":[{"text":"The data contains information on coffee differential gene expression as well as co-expression and trait correlations in two separate experiments. First, contrasting nitrogen supply, second, intra- and interspecific grafting.","lang":"eng"}],"date_created":"2026-02-27T09:18:41Z","type":"research_data"},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","acknowledgement":"During the work on this thesis, I was the recipient of a DOC Fellowship of the Austrian\r\nAcademy of Sciences at the Institute of Science and Technology Austria (grant no. PR10660EAW01).","date_created":"2026-07-14T08:08:51Z","das_tickbox":"1","citation":{"mla":"Becker, Lea Marie. Exploring Protein Dynamics Using Specific Labeling Approaches for Solid-State MAS NMR. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22334.","short":"L.M. Becker, Exploring Protein Dynamics Using Specific Labeling Approaches for Solid-State MAS NMR, Institute of Science and Technology Austria, 2026.","chicago":"Becker, Lea Marie. “Exploring Protein Dynamics Using Specific Labeling Approaches for Solid-State MAS NMR.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22334.","ama":"Becker LM. Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR. 2026. doi:10.15479/AT-ISTA-22334","ista":"Becker LM. 2026. Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR. Institute of Science and Technology Austria.","ieee":"L. M. Becker, “Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR,” Institute of Science and Technology Austria, 2026.","apa":"Becker, L. M. (2026). Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22334"},"project":[{"grant_number":"26777","name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches","_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0"}],"day":"13","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-084-8"]},"publisher":"Institute of Science and Technology Austria","publication_status":"published","date_published":"2026-07-13T00:00:00Z","date_updated":"2026-07-28T06:59:15Z","oa_version":"Published Version","tmp":{"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","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"supervisor":[{"last_name":"Schanda","full_name":"Schanda, Paul","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606"}],"oa":1,"ddc":["572"],"corr_author":"1","month":"07","doi":"10.15479/AT-ISTA-22334","degree_awarded":"PhD","OA_place":"publisher","author":[{"id":"36336939-eb97-11eb-a6c2-c83f1214ca79","orcid":"0000-0002-6401-5151","last_name":"Becker","full_name":"Becker, Lea Marie","first_name":"Lea Marie"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","title":"Exploring protein dynamics using specific labeling approaches for solid-state MAS NMR","abstract":[{"text":"Characterizing protein dynamics at the atomic level is essential for our understanding of biological mechanisms. Whether it is to facilitate metabolite transport, catalyze reactions, transmit signals, or regulate metabolism – proteins are constantly in motion and sample multiple conformational states to fulfill their function. Nuclear magnetic resonance (NMR) spectroscopy is particularly well suited to elucidate the dynamics of biomolecules on their complex free-energy landscape. In particular, solid-state magic-angle spinning (MAS) NMR enables the study of large molecular assemblies, protein crystals, or insoluble proteins at atomic resolution without an inherent molecular size limitation. MAS NMR experiments to probe protein dynamics are extremely versatile and sensitive to motional timescales from picoseconds to seconds. Over the past decades, technological advances, developments in experimental design, and new isotope-labeling approaches have further expanded the possibilities of this technique and significantly improved the accuracy of the determined motional parameters.\r\nFunctionally important sites of proteins often contain aromatic residues. Their side-chain motions have therefore long served as valuable indicators of mechanistically relevant dynamics in NMR studies. In this thesis, site-specifically labeled aromatic residues act as sensitive reporters for MAS NMR studies of protein dynamics. The first part addresses how different environments impact side-chain motion by probing ring flips of phenylalanines and tyrosines in crystalline proteins and amyloid fibrils. It provides important insights for the analysis of dynamics obtained in non-native protein environments and emphasizes the complex factors that determine the timescale of internal dynamics. In the second part, the focus shifts towards methodological questions regarding the investigation of protein dynamics by 19F MAS NMR. The fluorine nucleus exhibits promising characteristics for NMR studies but also presents significant challenges, which is why the full methodological potential of 19F MAS NMR has not been fully realized yet. This work demonstrates that paramagnetic doping can considerably reduce the measurement time and improve the sensitivity of fluorinated samples. Finally, 19F MAS NMR is evaluated as a tool for studying protein side-chain dynamics on the example of tryptophans. The results illustrate the challenges in analyzing such experiments and lay the foundation for further development of 19F MAS NMR relaxation studies.\r\nTaken together, this thesis highlights the potential of combining specific isotope labeling, MAS NMR, and complementary methods such as crystallography and computational simulations to elucidate internal protein dynamics. The further development of such integrative approaches will be crucial to improving our understanding of complex mechanisms and protein function.\r\n","lang":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"related_material":{"record":[{"relation":"part_of_dissertation","id":"12675","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"21777"},{"relation":"part_of_dissertation","id":"12114","status":"public"},{"status":"public","id":"22105","relation":"part_of_dissertation"}]},"department":[{"_id":"GradSch"},{"_id":"PaSc"}],"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"NMR"}],"article_processing_charge":"No","page":"205","_id":"22334","has_accepted_license":"1","file_date_updated":"2026-07-16T09:17:08Z","year":"2026","file":[{"file_size":99472908,"file_id":"22346","access_level":"closed","checksum":"8b85114eff543916c0e1445cd2189555","file_name":"2026_Becker_Lea_source_files.zip","relation":"source_file","date_updated":"2026-07-16T09:17:08Z","creator":"lbecker","date_created":"2026-07-16T09:17:08Z","content_type":"application/zip"},{"date_created":"2026-07-16T09:17:05Z","creator":"lbecker","date_updated":"2026-07-16T09:17:05Z","content_type":"application/pdf","file_name":"2026_Becker_Lea_Thesis.pdf","relation":"main_file","file_id":"22347","file_size":74647289,"success":1,"checksum":"6c526862bc6dbd1e4c80ecb34580bc58","access_level":"open_access"}],"status":"public","doi_confirm":"1"},{"author":[{"first_name":"Lea Marie","full_name":"Becker, Lea Marie","last_name":"Becker","orcid":"0000-0002-6401-5151","id":"36336939-eb97-11eb-a6c2-c83f1214ca79"},{"orcid":"0000-0002-9350-7606","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul","full_name":"Schanda, Paul","last_name":"Schanda"},{"first_name":"Christophe","full_name":"Chipot, Christophe","last_name":"Chipot"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","ddc":["572"],"oa":1,"corr_author":"1","month":"02","doi":"10.15479/AT-ISTA-21145","date_published":"2026-02-09T00:00:00Z","date_updated":"2026-07-28T06:59:15Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","day":"09","project":[{"grant_number":"26777","_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0","name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches"}],"citation":{"mla":"Becker, Lea Marie, et al. Additional Data for “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21145.","apa":"Becker, L. M., Schanda, P., & Chipot, C. (2026). Additional Data for “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21145","ama":"Becker LM, Schanda P, Chipot C. Additional Data for “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” 2026. doi:10.15479/AT-ISTA-21145","short":"L.M. Becker, P. Schanda, C. Chipot, (2026).","ista":"Becker LM, Schanda P, Chipot C. 2026. Additional Data for ‘Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes’, Institute of Science and Technology Austria, 10.15479/AT-ISTA-21145.","chicago":"Becker, Lea Marie, Paul Schanda, and Christophe Chipot. “Additional Data for ‘Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.’” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21145.","ieee":"L. M. Becker, P. Schanda, and C. Chipot, “Additional Data for ‘Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.’” Institute of Science and Technology Austria, 2026."},"contributor":[{"first_name":"Haohao","last_name":"Fu","contributor_type":"researcher"},{"last_name":"Tatman","first_name":"Benjamin","contributor_type":"researcher","id":"71cda2f3-e604-11ee-a1df-da10587eda3f"},{"contributor_type":"researcher","first_name":"Matthias","last_name":"Dreydoppel"},{"id":"9fb2a840-89e1-11ee-a8b7-cc5c7ba62471","contributor_type":"researcher","last_name":"Kapitonova","first_name":"Anna"},{"last_name":"Balazs","first_name":"Daniel","contributor_type":"researcher","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","orcid":"0000-0001-7597-043X"},{"contributor_type":"researcher","last_name":"Weininger","first_name":"Ulrich"},{"first_name":"Sylvain","last_name":"Engilberge","contributor_type":"researcher"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We thank Nikolai R. Skrynnikov and Olga O. Lebedenko (St. Petersburg) for insightful discussions and for performing exploratory MD simulations. We are grateful to Tobias Schubeis (Lyon) for advice with GB1 crystallization, and Rebecca Schmid for initial crystallization trials.\r\nWe thank Sebastian Falkner for assistance with constructing the structural model of the IgG:GB1 complex.\r\nThis research was supported by the Scientific Service Units (SSU) of Institute of Science and Technology Austria (ISTA) through resources provided by the Nuclear Magnetic Resonance and the Lab Support Facilities. We thank Petra Rovó and Margarita Valhondo Falcón for excellent support of the NMR facility.\r\nLea M. Becker is recipient of a DOC fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology Austria (grant no. PR10660EAW01). Christophe Chipot acknowledges the European Research Council (grant project 101097272 ``MilliInMicro'') and the Métropole du Grand Nancy (grant project ``ARC''). BM07-FIP2 is supported by the French ANR PIA3 (France 2030) EquipEx+ project MAGNIFIX under grant agreement ANR-21-ESRE-0011.","date_created":"2026-02-05T13:54:39Z","file":[{"file_name":"README.txt","relation":"table_of_contents","content_type":"text/plain","date_updated":"2026-02-05T13:52:37Z","creator":"lbecker","date_created":"2026-02-05T13:52:37Z","file_size":4263,"file_id":"21146","access_level":"open_access","checksum":"02a419cce8cea450bc952f35488d2df5"},{"content_type":"application/zip","date_created":"2026-02-05T13:52:41Z","date_updated":"2026-02-05T13:52:41Z","creator":"lbecker","relation":"main_file","file_name":"Research_Data.zip","success":1,"checksum":"b0b82b1aa73985b0b308a3fa52d21aea","access_level":"open_access","file_id":"21147","file_size":50647107}],"status":"public","year":"2026","file_date_updated":"2026-02-05T13:52:41Z","has_accepted_license":"1","_id":"21145","acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"article_processing_charge":"No","related_material":{"record":[{"status":"public","id":"20641","relation":"earlier_version"},{"relation":"used_in_publication","status":"public","id":"22105"}]},"department":[{"_id":"GradSch"},{"_id":"PaSc"}],"title":"Additional Data for \"Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes\"","abstract":[{"lang":"eng","text":"Protein conformational energy landscapes are shaped not only by intramolecular interactions but also by their environment. In protein crystals and protein-protein complexes, intermolecular contacts alter this energy landscape, but the exact nature of this alteration is difficult to decipher. Understanding how the crystal lattice affects protein dynamics is crucial for crystallography-based studies of motion, yet its influence on collective motions remains unclear. Aromatic ring flips in the hydrophobic core represent sensitive probes of such dynamics. Here, we compare the kinetics of aromatic ring flips in the protein GB1 in crystals, in complex with its binding partner IgG, and in solution, combining advanced isotope labeling with quantitative NMR methods. We show that rings in the core flip nearly a thousand times less frequently in crystals than in solution. Enhanced-sampling molecular dynamics simulations, based on a new crystal structure, reproduce these elevated barriers and reveal how the crystal restrains motions. "}],"type":"research_data"},{"citation":{"chicago":"Depope, Al. “From Sparse Selection to Risk Prediction: Approximate Message Passing for Proteomic Survival Models and Large-Scale Genomics.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22258.","ama":"Depope A. From sparse selection to risk prediction: Approximate message passing for proteomic survival models and large-scale genomics. 2026. doi:10.15479/AT-ISTA-22258","ista":"Depope A. 2026. From sparse selection to risk prediction: Approximate message passing for proteomic survival models and large-scale genomics. Institute of Science and Technology Austria.","short":"A. Depope, From Sparse Selection to Risk Prediction: Approximate Message Passing for Proteomic Survival Models and Large-Scale Genomics, Institute of Science and Technology Austria, 2026.","ieee":"A. Depope, “From sparse selection to risk prediction: Approximate message passing for proteomic survival models and large-scale genomics,” Institute of Science and Technology Austria, 2026.","apa":"Depope, A. (2026). From sparse selection to risk prediction: Approximate message passing for proteomic survival models and large-scale genomics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22258","mla":"Depope, Al. From Sparse Selection to Risk Prediction: Approximate Message Passing for Proteomic Survival Models and Large-Scale Genomics. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22258."},"acknowledgement":"This work was supported in part by the Swiss National Science Foundation through the\r\nEccellenza Grant \"Improving estimation and prediction of common complex disease risk\"\r\n(grant number PCEGP3_181181); the European Research Council through the grant\r\n\"Inference in High Dimensions: Light-speed Algorithms and Information Limits\" (grant\r\nnumber 101161364); and the Fondation Jean-Jacques et Felicia Lopez-Loreta through the\r\nPrix Lopez-Loretta 2019.\r\n","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","das_tickbox":"1","date_created":"2026-07-10T13:27:20Z","publication_status":"published","publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"},{"grant_number":"101161364","name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf"},{"grant_number":"PCEGP3_181181","_id":"9B8D11D6-BA93-11EA-9121-9846C619BF3A","name":"Improving estimation and prediction of common complex disease risk"}],"day":"11","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"last_name":"Robinson","full_name":"Robinson, Matthew Richard","first_name":"Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813"},{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco","last_name":"Mondelli"}],"date_published":"2026-07-11T00:00:00Z","oa_version":"Published Version","date_updated":"2026-07-28T07:08:15Z","author":[{"id":"0b77531d-dbcd-11ea-9d1d-a8eee0bf3830","first_name":"Al","full_name":"Depope, Al","last_name":"Depope"}],"month":"07","corr_author":"1","ddc":["576","610","006"],"oa":1,"OA_place":"publisher","doi":"10.15479/AT-ISTA-22258","degree_awarded":"PhD","alternative_title":["ISTA Thesis"],"keyword":["Approximate Message Passing","GWAS","Genomics","Proteomics","Survival modeling"],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"21488"}]},"department":[{"_id":"GradSch"},{"_id":"MaRo"},{"_id":"MaMo"}],"abstract":[{"text":"Uncovering the genetic architecture of complex traits and pinpointing causal molecular drivers require the ability to distinguish true signals from noise within massive, high-dimensional omics datasets. To extract meaningful biological insights from these datasets, such as identifying causal genetic variants and proteins, scalable and accurate inference methods are essential. To this end, this thesis develops novel Bayesian inference frameworks based on Vector Approximate Message Passing and demonstrates their effectiveness in the modeling of disease onset times and quantitative physical and clinical measures.\r\n\r\nFirst, we introduce gVAMP, a Bayesian framework tailored for Genome-Wide Association Studies that enables the joint modeling of quantitative complex traits across millions of genetic variants. gVAMP demonstrates superior accuracy in variable selection and out-of-sample polygenic risk prediction compared to state-of-the-art approaches. We model human height using 17 million whole-genome sequence variants from the UK Biobank, incorporating a vast number of rare variants and revealing novel associations. gVAMP achieves a prediction accuracy of approximately 46% for human height, representing the highest reported performance for this trait to date. \r\n\r\nSecond, we present vampW, a Bayesian framework for survival analysis applied to proteomic data. By effectively handling right-censoring and complex protein dependencies within the UK Biobank Pharma Proteomics Project dataset, vampW identifies 219 protein associations across 24 disease outcomes, the majority of which are not among the top marginal discoveries. We further adjust protein levels for exponential age effects, yielding 1,308 associations and highlighting the sensitivity of the analysis to the chosen age-correction methodology. Finally, vampW improves upon the variable selection capabilities of the commonly used (penalized) variants of the Cox proportional hazards model and delivers state-of-the-art out-of-sample prediction of disease onset times.\r\n\r\nCollectively, these methods provide powerful tools for dissecting the genetic architecture of complex traits and the proteomic drivers of disease onset. Furthermore, by delivering accurate polygenic risk scores and precise predictions of onset times, this work advances the capabilities of personalized medicine and clinical risk stratification.","lang":"eng"}],"title":"From sparse selection to risk prediction: Approximate message passing for proteomic survival models and large-scale genomics","type":"dissertation","page":"169","_id":"22258","article_processing_charge":"No","acknowledged_ssus":[{"_id":"ScienComp"}],"file_date_updated":"2026-07-13T14:56:41Z","has_accepted_license":"1","status":"public","doi_confirm":"1","file":[{"checksum":"9ab386790515628d957a194f30a7ccb4","access_level":"open_access","file_id":"22316","file_size":25109878,"date_created":"2026-07-13T14:52:19Z","creator":"adepope","date_updated":"2026-07-13T14:52:19Z","content_type":"application/pdf","relation":"main_file","file_name":"2026_Depope_Al_Thesis.pdf"},{"checksum":"8ed8fb63f76a695d5b6fec35343f4b90","access_level":"closed","file_id":"22317","file_size":1203199939,"creator":"adepope","date_updated":"2026-07-13T14:56:41Z","date_created":"2026-07-13T14:56:41Z","content_type":"application/zip","file_name":"2026_Depope_Al_Thesis.zip","relation":"source_file"}],"year":"2026"},{"department":[{"_id":"LaVe"},{"_id":"GradSch"}],"type":"journal_article","title":"A computationally efficient and accurate method for predicting conductance of single-molecule junctions","abstract":[{"text":"Despite significant progress in the field of molecular electronics over the last two decades, the quantitative prediction of metal-molecule-metal junction conductance remains a challenge. The standard computational framework combines density functional theory (DFT) with nonequilibrium Green’s functions (NEGF) using low-rung exchange-correlation functionals such as PBE, which overestimate the conductances. More advanced correction methods exist but require complex workflows and high computational cost, limiting their accessibility. Here, we introduce a physically motivated approach that approximates results obtained with high-rung functionals. Our method fits the PBE-calculated transmission to a Breit-Wigner form and subsequently refines the fit parameters using molecular orbital energies and metal densities of states computed for the isolated subsystems with high-rung functionals. This approach is applicable to a broad range of molecular junctions yielding conductance values in quantitative agreement with experiments. Our approach is simple, low-cost, and accurate, making it well-suited for routine and large-scale prediction of single-molecule junction conductance.","lang":"eng"}],"quality_controlled":"1","_id":"21980","page":"7429–7434","OA_type":"hybrid","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2026-06-16T09:11:35Z","pmid":1,"issue":"22","chemrxivid":1,"volume":26,"has_accepted_license":"1","file":[{"success":1,"checksum":"897551374cac28e0db26dcb0b676b8e7","access_level":"open_access","file_id":"22013","file_size":3362800,"creator":"dernst","date_created":"2026-06-16T09:11:35Z","date_updated":"2026-06-16T09:11:35Z","content_type":"application/pdf","relation":"main_file","file_name":"2026_NanoLetters_Gulyaev.pdf"}],"intvolume":" 26","status":"public","year":"2026","citation":{"short":"A. Gulyaev, J. Hazarika, Z.-F. Liu, L. Venkataraman, Nano Letters 26 (2026) 7429–7434.","chicago":"Gulyaev, Artem, Jyotisman Hazarika, Zhen-Fei Liu, and Latha Venkataraman. “A Computationally Efficient and Accurate Method for Predicting Conductance of Single-Molecule Junctions.” Nano Letters. American Chemical Society, 2026. https://doi.org/10.1021/acs.nanolett.6c01462.","ista":"Gulyaev A, Hazarika J, Liu Z-F, Venkataraman L. 2026. A computationally efficient and accurate method for predicting conductance of single-molecule junctions. Nano Letters. 26(22), 7429–7434.","ama":"Gulyaev A, Hazarika J, Liu Z-F, Venkataraman L. A computationally efficient and accurate method for predicting conductance of single-molecule junctions. Nano Letters. 2026;26(22):7429–7434. doi:10.1021/acs.nanolett.6c01462","ieee":"A. Gulyaev, J. Hazarika, Z.-F. Liu, and L. Venkataraman, “A computationally efficient and accurate method for predicting conductance of single-molecule junctions,” Nano Letters, vol. 26, no. 22. American Chemical Society, pp. 7429–7434, 2026.","apa":"Gulyaev, A., Hazarika, J., Liu, Z.-F., & Venkataraman, L. (2026). A computationally efficient and accurate method for predicting conductance of single-molecule junctions. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.6c01462","mla":"Gulyaev, Artem, et al. “A Computationally Efficient and Accurate Method for Predicting Conductance of Single-Molecule Junctions.” Nano Letters, vol. 26, no. 22, American Chemical Society, 2026, pp. 7429–7434, doi:10.1021/acs.nanolett.6c01462."},"das_tickbox":"1","date_created":"2026-06-10T07:27:19Z","publication":"Nano Letters","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported primarily by the Institute of Science and Technology Austria. L.V. was supported in part by the National Science Foundation (No. NSF-DMR 2241180). Z.-F.L. was supported by an NSF CAREER Award, No. DMR-2044552 and an Alfred P. Sloan Research Fellowship, No. FG-2024-21750.","publisher":"American Chemical Society","publication_status":"published","publication_identifier":{"eissn":["1530-6992"],"issn":["1530-6984"]},"day":"01","language":[{"iso":"eng"}],"scopus_import":"1","external_id":{"chemrxivid":["10.26434/chemrxiv.15001696"],"pmid":["42223342"]},"date_updated":"2026-07-28T09:57:28Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2026-06-01T00:00:00Z","author":[{"id":"83ed7901-7380-11f0-bf20-a0788d5e654d","last_name":"Gulyaev","full_name":"Gulyaev, Artem","first_name":"Artem"},{"first_name":"Jyotisman","full_name":"Hazarika, Jyotisman","last_name":"Hazarika","orcid":"0009-0007-2542-7878","id":"d87714c4-663d-11f0-bd06-caece19833e5"},{"first_name":"Zhen-Fei","full_name":"Liu, Zhen-Fei","last_name":"Liu"},{"id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","orcid":"0000-0002-6957-6089","full_name":"Venkataraman, Latha","last_name":"Venkataraman","first_name":"Latha"}],"doi":"10.1021/acs.nanolett.6c01462","article_type":"letter_note","OA_place":"publisher","oa":1,"ddc":["540"],"PlanS_conform":"1","month":"06","corr_author":"1"},{"publication_status":"published","publisher":"Institute of Science and Technology Austria","day":"18","project":[{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-081-7"]},"citation":{"ama":"Kleinhanns T. Unraveling the origin and evolution of defects to enable advanced thermoelectric performance. 2026. doi:10.15479/AT-ISTA-22017","chicago":"Kleinhanns, Tobias. “Unraveling the Origin and Evolution of Defects to Enable Advanced Thermoelectric Performance.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22017.","ista":"Kleinhanns T. 2026. Unraveling the origin and evolution of defects to enable advanced thermoelectric performance. Institute of Science and Technology Austria.","short":"T. Kleinhanns, Unraveling the Origin and Evolution of Defects to Enable Advanced Thermoelectric Performance, Institute of Science and Technology Austria, 2026.","ieee":"T. Kleinhanns, “Unraveling the origin and evolution of defects to enable advanced thermoelectric performance,” Institute of Science and Technology Austria, 2026.","apa":"Kleinhanns, T. (2026). Unraveling the origin and evolution of defects to enable advanced thermoelectric performance. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22017","mla":"Kleinhanns, Tobias. Unraveling the Origin and Evolution of Defects to Enable Advanced Thermoelectric Performance. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22017."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","das_tickbox":"1","date_created":"2026-06-18T08:00:03Z","author":[{"orcid":"0000-0003-1537-7436","id":"8BD9DE16-AB3C-11E9-9C8C-2A03E6697425","first_name":"Tobias","full_name":"Kleinhanns, Tobias","last_name":"Kleinhanns"}],"ddc":["546","530"],"corr_author":"1","month":"06","doi":"10.15479/AT-ISTA-22017","degree_awarded":"PhD","OA_place":"publisher","supervisor":[{"first_name":"Maria","last_name":"Ibáñez","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2026-06-18T00:00:00Z","date_updated":"2026-07-28T09:55:13Z","oa_version":"Published Version","page":"59","_id":"22017","article_processing_charge":"No","related_material":{"record":[{"relation":"part_of_dissertation","id":"15182","status":"public"},{"status":"public","id":"12237","relation":"part_of_dissertation"},{"id":"20326","status":"public","relation":"part_of_dissertation"}]},"alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"MaIb"}],"title":"Unraveling the origin and evolution of defects to enable advanced thermoelectric performance","type":"dissertation","file":[{"date_updated":"2026-06-30T09:17:15Z","creator":"tkleinha","date_created":"2026-06-30T09:17:15Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","file_name":"2026_Kleinhanns_Tobias_Thesis_Source_File.docx","access_level":"closed","checksum":"3df7e865a7d1da8972ccd8acb8b4c16c","file_id":"22226","file_size":15658266},{"embargo":"2026-12-18","embargo_to":"open_access","checksum":"40ec279272a963636ff29c964032dcba","access_level":"closed","file_id":"22232","file_size":9909375,"date_updated":"2026-07-01T07:35:17Z","creator":"tkleinha","date_created":"2026-07-01T07:35:17Z","content_type":"application/pdf","relation":"main_file","file_name":"2026_Kleinhanns_Tobias_Thesis_Main_File_A4.pdf"}],"status":"public","doi_confirm":"1","year":"2026","file_date_updated":"2026-07-01T07:35:17Z","has_accepted_license":"1"},{"abstract":[{"text":"We consider a class of two-dimensional tight binding models displaying conical intersections of the Bloch bands at the Fermi level. The setting includes the case of generic transitions between quantum Hall phases. We consider the longitudinal conductivity, as given by Kubo formula, describing the variation of the current after introducing a space-homogeneous electric field, in an adiabatic way. We obtain an explicit expression for the longitudinal conductivity, completely determined by the number of conical intersections and by the shape of the cones. In particular, the formula reproduces the known quantized values found for graphene and for the critical Haldane model. Furthermore, we discuss the validity of Kubo formula in presence of conical intersections in the spectrum, starting from the time-dependent Schrödinger equation. For electric fields which are weak and slowly varying in space and in time, we prove the validity of linear response from quantum dynamics.","lang":"eng"}],"title":"Longitudinal conductivity at integer quantum Hall transitions","type":"journal_article","department":[{"_id":"RoSe"},{"_id":"GradSch"}],"article_processing_charge":"No","OA_type":"green","_id":"22404","quality_controlled":"1","volume":116,"issue":"4","mathsc":["81V70"],"researchdata_availability":"not applicable","supplementarymaterial":"no","year":"2026","status":"public","intvolume":" 116","acknowledgement":"G. M. and M. P. acknowledge support by the European Research Council through the ERC-StG MaMBoQ, n. 802901. G. M. acknowledges financial support from the Independent Research Fund Denmark–Natural Sciences, grant DFF–10.46540/2032-00005B and from the European Research Council through the ERC CoG UniCoSM, grant agreement n.724939. M. P. acknowledges support from the MUR, PRIN 2022 project MaIQuFi cod. 20223J85K3. This work has been carried out under the auspices of the GNFM of INdAM. We thank the anonymous referees for comments on a previous version of this manuscript.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Letters in Mathematical Physics","date_created":"2026-07-26T22:01:40Z","das_tickbox":"1","citation":{"mla":"Marcelli, Giovanna, et al. “Longitudinal Conductivity at Integer Quantum Hall Transitions.” Letters in Mathematical Physics, vol. 116, no. 4, 82, Springer Nature, 2026, doi:10.1007/s11005-026-02087-3.","apa":"Marcelli, G., Pigozzi, L., & Porta, M. (2026). Longitudinal conductivity at integer quantum Hall transitions. Letters in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s11005-026-02087-3","short":"G. Marcelli, L. Pigozzi, M. Porta, Letters in Mathematical Physics 116 (2026).","chicago":"Marcelli, Giovanna, Lorenzo Pigozzi, and Marcello Porta. “Longitudinal Conductivity at Integer Quantum Hall Transitions.” Letters in Mathematical Physics. Springer Nature, 2026. https://doi.org/10.1007/s11005-026-02087-3.","ista":"Marcelli G, Pigozzi L, Porta M. 2026. Longitudinal conductivity at integer quantum Hall transitions. Letters in Mathematical Physics. 116(4), 82.","ama":"Marcelli G, Pigozzi L, Porta M. Longitudinal conductivity at integer quantum Hall transitions. Letters in Mathematical Physics. 2026;116(4). doi:10.1007/s11005-026-02087-3","ieee":"G. Marcelli, L. Pigozzi, and M. Porta, “Longitudinal conductivity at integer quantum Hall transitions,” Letters in Mathematical Physics, vol. 116, no. 4. Springer Nature, 2026."},"dataavailabilitystatement":"Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.","scopus_import":"1","language":[{"iso":"eng"}],"day":"01","arxiv":1,"publication_identifier":{"eissn":["1573-0530"],"issn":["0377-9017"]},"publisher":"Springer Nature","publication_status":"published","date_published":"2026-08-01T00:00:00Z","oa_version":"Preprint","date_updated":"2026-07-29T10:51:55Z","article_number":"82","external_id":{"arxiv":["2503.01381"]},"month":"08","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2503.01381","open_access":"1"}],"OA_place":"repository","article_type":"original","doi":"10.1007/s11005-026-02087-3","author":[{"first_name":"Giovanna","full_name":"Marcelli, Giovanna","last_name":"Marcelli"},{"id":"efb8f850-3208-11ee-ac71-8c4f5803b9c6","last_name":"Pigozzi","full_name":"Pigozzi, Lorenzo","first_name":"Lorenzo"},{"first_name":"Marcello","last_name":"Porta","full_name":"Porta, Marcello"}]},{"day":"13","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["3117-4604"]},"arxiv":1,"publisher":"EPI Sciences","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We would like to thank David Bartl and Jasmin Blanchette for frequent consultations.\r\nWe would also like to express gratitude to Henrik Böving for a help with generalization\r\nfrom extended rationals to extended linearly ordered fields and to Andrew Yang for the\r\nproof of Finset.univ_sum_of_zero_when_not. We would also like to acknowledge Antoine\r\nChambert-Loir, Apurva Nakade, Yaël Dillies, Richard Copley, Edward van de Meent, Markus\r\nHimmel, Mario Carneiro, and Kevin Buzzard.","das_tickbox":"0","date_created":"2026-07-29T09:06:55Z","publication":"Annals of Formalized Mathematics","citation":{"ista":"Dvorak M, Kolmogorov V. 2026. Duality theory in linear optimization and its extensions -- formally verified. Annals of Formalized Mathematics. 2, 14253.","ama":"Dvorak M, Kolmogorov V. Duality theory in linear optimization and its extensions -- formally verified. Annals of Formalized Mathematics. 2026;2. doi:10.46298/afm.14253","chicago":"Dvorak, Martin, and Vladimir Kolmogorov. “Duality Theory in Linear Optimization and Its Extensions -- Formally Verified.” Annals of Formalized Mathematics. EPI Sciences, 2026. https://doi.org/10.46298/afm.14253.","short":"M. Dvorak, V. Kolmogorov, Annals of Formalized Mathematics 2 (2026).","ieee":"M. Dvorak and V. Kolmogorov, “Duality theory in linear optimization and its extensions -- formally verified,” Annals of Formalized Mathematics, vol. 2. EPI Sciences, 2026.","apa":"Dvorak, M., & Kolmogorov, V. (2026). Duality theory in linear optimization and its extensions -- formally verified. Annals of Formalized Mathematics. EPI Sciences. https://doi.org/10.46298/afm.14253","mla":"Dvorak, Martin, and Vladimir Kolmogorov. “Duality Theory in Linear Optimization and Its Extensions -- Formally Verified.” Annals of Formalized Mathematics, vol. 2, 14253, EPI Sciences, 2026, doi:10.46298/afm.14253."},"ddc":["500"],"corr_author":"1","PlanS_conform":"1","month":"03","doi":"10.46298/afm.14253","article_type":"original","OA_place":"publisher","author":[{"id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","orcid":"0000-0001-5293-214X","full_name":"Dvorak, Martin","last_name":"Dvorak","first_name":"Martin"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"date_published":"2026-03-13T00:00:00Z","date_updated":"2026-07-29T10:50:17Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"external_id":{"arxiv":["2409.08119"]},"article_number":"14253","article_processing_charge":"Yes (in subscription journal)","OA_type":"hybrid","quality_controlled":"1","_id":"22607","title":"Duality theory in linear optimization and its extensions -- formally verified","abstract":[{"text":"Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over linearly ordered fields in Lean 4. Furthermore, we extend duality theory to the case when some coefficients are allowed to take \"infinite values\".\r\nCode: https://github.com/madvorak/duality/tree/v3.2.0","lang":"eng"}],"type":"journal_article","keyword":["Farkas lemma","linear programming","extended reals","calculus of inductive constructions"],"related_material":{"record":[{"relation":"earlier_version","id":"20071","status":"public"}]},"department":[{"_id":"VlKo"},{"_id":"GradSch"}],"supplementarymaterial":"no","year":"2026","intvolume":" 2","status":"public","has_accepted_license":"1","volume":2,"mathsc":["68V20","15A39","90C05"],"researchdata_availability":"no"},{"oa":1,"ddc":["511","000"],"corr_author":"1","month":"03","doi":"10.15479/AT-ISTA-21393","degree_awarded":"PhD","OA_place":"repository","author":[{"first_name":"Martin","full_name":"Dvorak, Martin","last_name":"Dvorak","orcid":"0000-0001-5293-214X","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425"}],"date_published":"2026-03-04T00:00:00Z","date_updated":"2026-07-29T12:56:52Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"supervisor":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"},{"first_name":"Jasmin","full_name":"Blanchette, Jasmin","last_name":"Blanchette"}],"day":"04","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-99078-074-9"],"issn":["2663-337X"]},"publication_status":"published","publisher":"Institute of Science and Technology Austria","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2026-03-04T09:26:46Z","citation":{"mla":"Dvorak, Martin. Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21393.","apa":"Dvorak, M. (2026). Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21393","ieee":"M. Dvorak, “Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids,” Institute of Science and Technology Austria, 2026.","short":"M. Dvorak, Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids, Institute of Science and Technology Austria, 2026.","ama":"Dvorak M. Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids. 2026. doi:10.15479/AT-ISTA-21393","chicago":"Dvorak, Martin. “Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21393.","ista":"Dvorak M. 2026. Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids. Institute of Science and Technology Austria."},"year":"2026","file":[{"success":1,"checksum":"cface6dc18152680962b5361575f6e4f","access_level":"open_access","file_id":"21394","file_size":1771231,"content_type":"application/pdf","date_created":"2026-03-04T08:56:15Z","date_updated":"2026-03-04T08:56:15Z","creator":"mdvorak","file_name":"2026_Dvorak_Martin_Thesis.pdf","relation":"main_file"},{"access_level":"closed","checksum":"290ddfacfb7e07fb07e6f0b334e67c90","file_id":"21395","file_size":864585,"date_updated":"2026-03-04T09:03:37Z","date_created":"2026-03-04T09:03:37Z","creator":"mdvorak","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","file_name":"2026_Dvorak_Martin_Thesis.docx"}],"status":"public","doi_confirm":"1","has_accepted_license":"1","file_date_updated":"2026-03-04T09:03:37Z","article_processing_charge":"No","page":"160","_id":"21393","title":"Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids","abstract":[{"text":"This thesis documents a voyage towards truth and beauty via formal verification of theorems. To this end, we develop libraries in Lean 4 that present definitions and results from diverse areas of MathematiCS (i.e., Mathematics and Computer Science). The aim is to create code that is understandable, believable, useful, and elegant. The code should stand for itself as much as possible without a need for documentation; however, this text redundantly documents our code artifacts and provides additional context that isn’t present in the code. This thesis is written for readers who know Lean 4 but are not familiar with any of the topics presented. We manifest truth and beauty in three formalized areas of MathematiCS.\r\n\r\nWe formalize general grammars in Lean 4 and use grammars to show closure of the class of type-0 languages under four operations; union, reversal, concatenation, and the Kleene star.\r\n\r\nOur second stop is the theory of optimization. Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over linearly ordered fields in Lean 4. Furthermore, we extend duality theory to the case when some coefficients are allowed to take “infinite values”. Additionally, we develop the basics of the theory of optimization in terms of the framework called General-Valued Constraint Satisfaction Problems, and we prove that, if a Rational-Valued Constraint Satisfaction Problem template has symmetric fractional polymorphisms of all arities, then its basic LP relaxation is tight.\r\n\r\nOur third stop is matroid theory. Seymour’s decomposition theorem is a hallmark result in matroid theory, presenting a structural characterization of the class of regular matroids. We aim to formally verify Seymour’s theorem in Lean 4. First, we build a library for working with totally unimodular matrices. We define binary matroids and their standard representations, and we prove that they form a matroid in the sense how Mathlib defines matroids. We define regular matroids to be matroids for which there exists a full representation rational matrix that is totally unimodular, and we prove that all regular matroids are binary. We define 1-sum, 2-sum, and 3 sum of binary matroids as specific ways to compose their standard representation matrices. We prove that the 1-sum, the 2-sum, and the 3-sum of regular matroids are a regular matroid, which concludes the composition direction of the Seymour’s theorem. The (more difficult) decomposition direction remains unproved.\r\n\r\nIn the pursuit of truth, we focus on identifying the trusted code in each project and presenting it faithfully. We emphasize the readability and believability of definitions rather than choosing definitions that are easier to work with. In search for beauty, we focus on the philosophical framework of Roger Scruton, who emphasizes that beauty is not a mere decoration but, most importantly, beauty is the means for shaping our place in the world and a source of redemption, where it can be viewed as a substitute for religion.","lang":"eng"}],"type":"dissertation","related_material":{"link":[{"description":"Full version of all definitions, statements, and proofs for Chapter 3.1 (Linear duality)","url":"https://github.com/madvorak/duality/tree/v3.5.0","relation":"software"},{"description":"Full version of all definitions, statements, and proofs for Chapter 3.2 (Valued Constraint Satisfaction Problems)","relation":"software","url":"https://github.com/madvorak/vcsp/tree/v8.2.0"},{"url":"https://github.com/Ivan-Sergeyev/seymour/tree/v1.2.0","relation":"software","description":"Full version of all definitions, statements, and proofs for Chapter 4 (Seymour project)"},{"relation":"software","url":"https://github.com/madvorak/chomsky/tree/v1.2.0","description":"Full version of all definitions, statements, and proofs for Chapter 5 (Theory of grammars)"},{"url":"https://github.com/madvorak/grammars","relation":"software","description":"Old version (Lean 3) of the project about grammars"},{"description":"Demonstration of (minimal) requirements for selected algebraic classes used in my Ph.D. thesis","url":"https://github.com/madvorak/preliminaries/blob/main/Preliminaries.lean","relation":"software"}],"record":[{"relation":"part_of_dissertation","status":"public","id":"13120"},{"status":"public","id":"20071","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"21398"}]},"alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"VlKo"}]},{"author":[{"first_name":"Aron","last_name":"Kerschbaumer","full_name":"Kerschbaumer, Aron","orcid":"0009-0002-2370-8661","id":"ade85a9c-3200-11ee-973b-91c1eb240410"},{"full_name":"Desaules, Jean-Yves Marc","last_name":"Desaules","first_name":"Jean-Yves Marc","id":"6c292945-a610-11ed-9eec-c3be1ad62a80","orcid":"0000-0002-3749-6375"},{"orcid":"0000-0003-0038-7068","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","first_name":"Marko","last_name":"Ljubotina","full_name":"Ljubotina, Marko"},{"first_name":"Maksym","full_name":"Serbyn, Maksym","last_name":"Serbyn","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"}],"DOAJ_listed":"1","doi":"10.1038/s41467-026-75598-1","OA_place":"publisher","article_type":"original","ddc":["530"],"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41467-026-75598-1"}],"PlanS_conform":"1","month":"07","corr_author":"1","date_updated":"2026-07-30T05:42:17Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_published":"2026-07-17T00:00:00Z","publication_status":"epub_ahead","publisher":"Springer Nature","publication_identifier":{"eissn":["2041-1723"]},"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020"}],"day":"17","language":[{"iso":"eng"}],"citation":{"ieee":"A. Kerschbaumer, J.-Y. M. Desaules, M. Ljubotina, and M. Serbyn, “Quasi-solitons in Rydberg atom chains,” Nature Communications. Springer Nature, 2026.","ama":"Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. Quasi-solitons in Rydberg atom chains. Nature Communications. 2026. doi:10.1038/s41467-026-75598-1","short":"A. Kerschbaumer, J.-Y.M. Desaules, M. Ljubotina, M. Serbyn, Nature Communications (2026).","ista":"Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. 2026. Quasi-solitons in Rydberg atom chains. Nature Communications.","chicago":"Kerschbaumer, Aron, Jean-Yves Marc Desaules, Marko Ljubotina, and Maksym Serbyn. “Quasi-Solitons in Rydberg Atom Chains.” Nature Communications. Springer Nature, 2026. https://doi.org/10.1038/s41467-026-75598-1.","apa":"Kerschbaumer, A., Desaules, J.-Y. M., Ljubotina, M., & Serbyn, M. (2026). Quasi-solitons in Rydberg atom chains. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-026-75598-1","mla":"Kerschbaumer, Aron, et al. “Quasi-Solitons in Rydberg Atom Chains.” Nature Communications, Springer Nature, 2026, doi:10.1038/s41467-026-75598-1."},"date_created":"2026-07-27T07:26:27Z","publication":"Nature Communications","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We acknowledge useful discussions with J.-S. Caux, E. Demler, J. Dubail, F. Essler, J. Feldmeier, S. Garratt, W. W. Ho, M. Lukin, Z. Papic, S. Rotter, F. Surace, and R. Vasseur. J.-Y.D. acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. M. L. acknowledges support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2111—390814868. We acknowledge support by the Erwin Schrödinger International Institute for Mathematics and Physics (ESI). This research was funded in part by the Austrian Science Fund (FWF) https://doi.org/10.55776/COE1 and the European Union—NextGenerationEU. This research was supported in part by grant NSF PHY2309135 to the Kavli Institute for Theoretical Physics (KITP).","status":"public","year":"2026","supplementarymaterial":"yes","ec_funded":1,"has_accepted_license":"1","quality_controlled":"1","_id":"22408","OA_type":"gold","article_processing_charge":"Yes","department":[{"_id":"MaSe"},{"_id":"GradSch"}],"type":"journal_article","title":"Quasi-solitons in Rydberg atom chains","abstract":[{"text":"Solitons—localized wave packets that travel without spreading—play a central role in understanding transport and properties of nonlinear systems. In quantum many-body systems, however, such robust excitations are typically destroyed by thermalization. Here, we theoretically demonstrate the existence of solitonic excitations in high-energy states of Rydberg atom chains in the regime of strong nearest-neighbor Rydberg blockade. These localized wave packets propagate directionally atop a special class of reviving initial states related to quantum many-body scars and are capable of carrying energy. Exhibiting long coherence times, these states constitute a form of non-ergodic quantum dynamics and can be efficiently implemented on Rydberg atom simulators. In this work, in addition to a phenomenological description of solitons, we identify their counterpart in a classical nonlinear dynamical system, demonstrate their potential use in quantum information transfer, and conjecture their relevance for anomalous energy transport reported in numerical studies of Rydberg atom arrays.","lang":"eng"}]},{"doi_confirm":"1","status":"public","file":[{"file_size":1986078,"file_id":"22588","access_level":"open_access","checksum":"c29880dd71fcc37f23ac6e2843066ede","success":1,"relation":"main_file","file_name":"Aleksa_Spasic_Thesis_final.pdf","date_created":"2026-07-27T13:00:07Z","date_updated":"2026-07-27T13:00:07Z","creator":"aspasic","content_type":"application/pdf"},{"file_name":"Thesis_final.docx","relation":"source_file","creator":"aspasic","date_updated":"2026-07-27T13:07:23Z","date_created":"2026-07-27T13:00:22Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","checksum":"4ebe3bd2d833d913c0756343cca5e5f0","file_size":1868853,"file_id":"22589"}],"year":"2026","file_date_updated":"2026-07-27T13:07:23Z","has_accepted_license":"1","page":"32","_id":"22399","article_processing_charge":"No","alternative_title":["ISTA Master’s Thesis"],"department":[{"_id":"GradSch"},{"_id":"GaTk"},{"_id":"CaGu"}],"abstract":[{"text":"Gaining an understanding of how biological regulation evolves is a fundamental research \r\nquestion in both evolutionary biology and molecular genetics. In order to gain more insight \r\ninto this topic, we focus on studying the simple gene regulatory system of the lac operon in \r\nE. coli. We show that simple population genetic models can shed light on evolution \r\nexperiments and that this combined approach of modelling the experimental system gives \r\ninsight to better understand the causes of evolutionary change in the experiment. We also \r\nstudy the natural diversity in the lac operon from 308 publicly available E. coli genomes that \r\ncome from various host species and different regions of the world. Evidence that selection is \r\ngenerally maintaining the function of the lac operon across the sample regardless of host \r\nspecies is provided and we show that different protein coding genes in the operon are under \r\ndifferent selective constraints on protein sequence preservation. A similar frameshift \r\nmutation found in experimental evolution studies is shown to be present in the sample we \r\nanalyzed, indicating that selectively relevant variants in evolution experiments are also \r\npresent in natural populations. We show that there is no simple phylogenetic relationship \r\nbetween host species, geographical location and the lac operon sequence. Finally, we argue \r\nthat a combined approach of comparative genomics, experimental evolution and theoretical \r\nmodelling contributes to a more complete understanding of molecular evolution. ","lang":"eng"}],"title":"Studying the evolutionary systems biology of the lac operon","type":"dissertation","author":[{"last_name":"Spasić","full_name":"Spasić, Aleksa","first_name":"Aleksa","id":"ecee9d38-4040-11ef-8843-b941efb445d6"}],"corr_author":"1","month":"07","ddc":["576"],"oa":1,"OA_place":"publisher","doi":"10.15479/AT-ISTA-22399","degree_awarded":"MS","supervisor":[{"first_name":"Calin C","last_name":"Guet","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tkačik","full_name":"Tkačik, Gašper","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455"}],"date_published":"2026-07-27T00:00:00Z","oa_version":"Published Version","date_updated":"2026-07-31T10:52:08Z","publication_status":"published","publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"day":"27","publication_identifier":{"issn":["2791-4585"]},"citation":{"apa":"Spasić, A. (2026). Studying the evolutionary systems biology of the lac operon. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22399","ieee":"A. Spasić, “Studying the evolutionary systems biology of the lac operon,” Institute of Science and Technology Austria, 2026.","ama":"Spasić A. Studying the evolutionary systems biology of the lac operon. 2026. doi:10.15479/AT-ISTA-22399","short":"A. Spasić, Studying the Evolutionary Systems Biology of the Lac Operon, Institute of Science and Technology Austria, 2026.","ista":"Spasić A. 2026. Studying the evolutionary systems biology of the lac operon. Institute of Science and Technology Austria.","chicago":"Spasić, Aleksa. “Studying the Evolutionary Systems Biology of the Lac Operon.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22399.","mla":"Spasić, Aleksa. Studying the Evolutionary Systems Biology of the Lac Operon. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22399."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2026-07-25T13:08:32Z","das_tickbox":"0"},{"title":"Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs","abstract":[{"text":"We prove discrete-to-continuum convergence for dynamical optimal transport on Zd\r\n -periodic graphs with cost functional having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer, Maas, and Portinale (Calc Var Partial Differential Equations 62(5), 2023), where the convergence behaviour of discrete boundary-value dynamical transport problems is proved under the stronger assumption of superlinear growth. Our result extends the known literature to some important classes of examples, such as scaling limits of 1 -Wasserstein transport problems. Similarly to what happens in the quadratic case, the geometry of the graph plays a crucial role in the structure of the limit cost function, as we discuss in the final part of this work, which includes some visual representations.","lang":"eng"}],"type":"journal_article","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20563"}]},"keyword":["optimal transport","discrete-to-continuum","homogenisation","linear growth","gamma-convergence"],"department":[{"_id":"GradSch"},{"_id":"JaMa"}],"isi":1,"article_processing_charge":"Yes","OA_type":"gold","page":"614-642","quality_controlled":"1","_id":"18706","volume":37,"has_accepted_license":"1","issue":"3","file_date_updated":"2026-07-23T05:55:03Z","researchdata_availability":"no","supplementarymaterial":"no","year":"2026","file":[{"date_updated":"2026-07-23T05:55:03Z","creator":"dernst","date_created":"2026-07-23T05:55:03Z","content_type":"application/pdf","relation":"main_file","file_name":"2026_EuropJourAppliedMath_Portinale.pdf","success":1,"access_level":"open_access","checksum":"d038f4d00cbfbde2672c17138eab21c9","file_id":"22386","file_size":612317}],"status":"public","intvolume":" 37","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"L.P. gratefully acknowledges fundings from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – GZ 2047/1, Projekt-ID 390685813. F.Q. gratefully acknowledges support from the Austrian Science Fund (FWF) project 10.55776/F65.","date_created":"2024-12-23T11:03:59Z","das_tickbox":"0","publication":"European Journal of Applied Mathematics","citation":{"ieee":"L. Portinale and F. Quattrocchi, “Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs,” European Journal of Applied Mathematics, vol. 37, no. 3. Cambridge University Press, pp. 614–642, 2026.","chicago":"Portinale, Lorenzo, and Filippo Quattrocchi. “Discrete-to-Continuum Limits of Optimal Transport with Linear Growth on Periodic Graphs.” European Journal of Applied Mathematics. Cambridge University Press, 2026. https://doi.org/10.1017/s0956792524000810.","ista":"Portinale L, Quattrocchi F. 2026. Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs. European Journal of Applied Mathematics. 37(3), 614–642.","ama":"Portinale L, Quattrocchi F. Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs. European Journal of Applied Mathematics. 2026;37(3):614-642. doi:10.1017/s0956792524000810","short":"L. Portinale, F. Quattrocchi, European Journal of Applied Mathematics 37 (2026) 614–642.","apa":"Portinale, L., & Quattrocchi, F. (2026). Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs. European Journal of Applied Mathematics. Cambridge University Press. https://doi.org/10.1017/s0956792524000810","mla":"Portinale, Lorenzo, and Filippo Quattrocchi. “Discrete-to-Continuum Limits of Optimal Transport with Linear Growth on Periodic Graphs.” European Journal of Applied Mathematics, vol. 37, no. 3, Cambridge University Press, 2026, pp. 614–42, doi:10.1017/s0956792524000810."},"day":"01","project":[{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0956-7925"],"eissn":["1469-4425"]},"publication_status":"published","publisher":"Cambridge University Press","date_published":"2026-06-01T00:00:00Z","date_updated":"2026-08-01T22:31:10Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","external_id":{"isi":["001381435800001"]},"oa":1,"ddc":["500"],"month":"06","PlanS_conform":"1","doi":"10.1017/s0956792524000810","article_type":"original","OA_place":"publisher","author":[{"last_name":"Portinale","full_name":"Portinale, Lorenzo","first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0009-0000-9773-1931","id":"3ebd6ba8-edfb-11eb-afb5-91a9745ba308","first_name":"Filippo","full_name":"Quattrocchi, Filippo","last_name":"Quattrocchi"}],"DOAJ_listed":"1"}]