[{"publisher":"Springer Nature","abstract":[{"text":"UTe2 exhibits the remarkable phenomenon of re-entrant superconductivity, whereby the zero-resistance state reappears above 40 tesla after being suppressed with a field of around 10 tesla. One potential pairing mechanism, invoked in the related re-entrant superconductors UCoGe and URhGe, involves transverse fluctuations of a ferromagnetic order parameter. However, the requisite ferromagnetic order—present in both UCoGe and URhGe—is absent in UTe2, and neutron scattering shows instead that the magnetic susceptibility is peaked at an antiferromagnetic wavevector. Here, we measure the magnetotropic susceptibility of UTe2 across two field-angle planes. This quantity is sensitive to the magnetic susceptibility in a direction transverse to the applied magnetic field—a quantity that is not accessed in conventional magnetization measurements. We observe a very large decrease in the magnetotropic susceptibility over a broad range of field orientations, indicating a large increase in the transverse magnetic susceptibility. Because our technique probes the magnetic susceptibility in the long wavelength (q = 0) limit, this suggests that the strong transverse susceptibility arises from ferromagnetic spin fluctuations. These ferromagnetic fluctuations are likely important for understanding the pairing mechanism in UTe2, as all three superconducting phases of UTe2 surround this region of enhanced susceptibility in the field-angle phase diagram.","lang":"eng"}],"PlanS_conform":"1","project":[{"_id":"bd968c70-d553-11ed-ba76-cde40b0aba64","name":"Gaining leverage with spin liquids and superconductors","grant_number":"101078696"}],"oa":1,"language":[{"iso":"eng"}],"month":"04","year":"2026","DOAJ_listed":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"last_name":"Zambra","orcid":"0000-0002-8806-5719","id":"467ed36b-dc96-11ea-b7c8-b043a380b282","first_name":"Valeska","full_name":"Zambra, Valeska"},{"full_name":"Nathwani, Amit","last_name":"Nathwani","id":"1a362536-4d02-11f1-8543-8351136efc50","first_name":"Amit"},{"id":"32c21954-2022-11eb-9d5f-af9f93c24e71","first_name":"Muhammad","last_name":"Nauman","orcid":"0000-0002-2111-4846","full_name":"Nauman, Muhammad"},{"last_name":"Lewin","first_name":"Sylvia K.","full_name":"Lewin, Sylvia K."},{"first_name":"Corey E.","last_name":"Frank","full_name":"Frank, Corey E."},{"last_name":"Butch","first_name":"Nicholas P.","full_name":"Butch, Nicholas P."},{"full_name":"Shekhter, Arkady","last_name":"Shekhter","first_name":"Arkady"},{"first_name":"B. J.","last_name":"Ramshaw","full_name":"Ramshaw, B. J."},{"full_name":"Modic, Kimberly A","orcid":"0000-0001-9760-3147","last_name":"Modic","first_name":"Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425"}],"date_published":"2026-04-29T00:00:00Z","date_updated":"2026-05-11T06:36:00Z","title":"Giant transverse magnetic fluctuations at the edge of re-entrant superconductivity in UTe2","external_id":{"arxiv":["2506.08984"]},"article_processing_charge":"Yes","department":[{"_id":"KiMo"},{"_id":"GradSch"}],"article_number":"3742","article_type":"original","volume":17,"citation":{"short":"V. Zambra, A. Nathwani, M. Nauman, S.K. Lewin, C.E. Frank, N.P. Butch, A. Shekhter, B.J. Ramshaw, K.A. Modic, Nature Communications 17 (2026).","ista":"Zambra V, Nathwani A, Nauman M, Lewin SK, Frank CE, Butch NP, Shekhter A, Ramshaw BJ, Modic KA. 2026. Giant transverse magnetic fluctuations at the edge of re-entrant superconductivity in UTe2. Nature Communications. 17, 3742.","apa":"Zambra, V., Nathwani, A., Nauman, M., Lewin, S. K., Frank, C. E., Butch, N. P., … Modic, K. A. (2026). Giant transverse magnetic fluctuations at the edge of re-entrant superconductivity in UTe2. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-71899-7\">https://doi.org/10.1038/s41467-026-71899-7</a>","ama":"Zambra V, Nathwani A, Nauman M, et al. Giant transverse magnetic fluctuations at the edge of re-entrant superconductivity in UTe2. <i>Nature Communications</i>. 2026;17. doi:<a href=\"https://doi.org/10.1038/s41467-026-71899-7\">10.1038/s41467-026-71899-7</a>","mla":"Zambra, Valeska, et al. “Giant Transverse Magnetic Fluctuations at the Edge of Re-Entrant Superconductivity in UTe2.” <i>Nature Communications</i>, vol. 17, 3742, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41467-026-71899-7\">10.1038/s41467-026-71899-7</a>.","ieee":"V. Zambra <i>et al.</i>, “Giant transverse magnetic fluctuations at the edge of re-entrant superconductivity in UTe2,” <i>Nature Communications</i>, vol. 17. Springer Nature, 2026.","chicago":"Zambra, Valeska, Amit Nathwani, Muhammad Nauman, Sylvia K. Lewin, Corey E. Frank, Nicholas P. Butch, Arkady Shekhter, B. J. Ramshaw, and Kimberly A Modic. “Giant Transverse Magnetic Fluctuations at the Edge of Re-Entrant Superconductivity in UTe2.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-71899-7\">https://doi.org/10.1038/s41467-026-71899-7</a>."},"doi":"10.1038/s41467-026-71899-7","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"8cb95b033ad2a1a7a8181f6f078c05b5","date_updated":"2026-05-11T06:32:12Z","file_size":1784917,"file_id":"21850","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2026_NatureComm_Zambra.pdf","creator":"dernst","success":1,"date_created":"2026-05-11T06:32:12Z"}],"acknowledged_ssus":[{"_id":"NanoFab"}],"quality_controlled":"1","file_date_updated":"2026-05-11T06:32:12Z","type":"journal_article","oa_version":"Published Version","status":"public","publication":"Nature Communications","corr_author":"1","related_material":{"record":[{"status":"public","id":"21174","relation":"research_data"}]},"date_created":"2026-05-10T22:02:15Z","arxiv":1,"ddc":["530"],"has_accepted_license":"1","acknowledgement":"We appreciate technical support from Salvatore Bagiante, Evgeniia Volobueva, Lubuna Shafeek, Ali Bangura, and Zoltán Köllö, and scientific discussions with Daniel Agterberg, Johnpierre Paglione, Qimiao Si, Josephine Yu and Yue Yu. V.Z., A.N., M.N., and K.A.M. acknowledge funding received from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (TROPIC-101078696). V.Z., A.N., M.N., and K.A.M. thank the ISTA Nanofabrication Facility for technical support. B.J.R. acknowledges funding from the Office of Basic Energy Sciences of the United States Department of Energy under award number DE-SC0020143 for data analysis and writing. The National High Magnetic Field Laboratory is supported by the National Science Foundation through NSF/DMR-2128556*, the State of Florida, and the U.S. Department of Energy. A.S. acknowledges support from the DOE/BES “Science of 100 T” grant. A.S. thanks Downtown Subscription in Santa Fe, NM, for their patience in hosting him. Sample preparation and characterization were supported by the NSF through DMR-2105191.","OA_type":"gold","scopus_import":"1","publication_identifier":{"eissn":["2041-1723"]},"_id":"21845","day":"29","intvolume":"        17","OA_place":"publisher","publication_status":"published"},{"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"article_processing_charge":"No","date_updated":"2026-05-19T11:20:28Z","title":"On the utility and effects of efficiency in artificial neural networks","author":[{"first_name":"Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","orcid":"0000-0002-7778-3221","last_name":"Iofinova","full_name":"Iofinova, Eugenia B"}],"date_published":"2026-05-11T00:00:00Z","year":"2026","page":"237","month":"05","language":[{"iso":"eng"}],"oa":1,"project":[{"grant_number":"W1260-N35","name":"Vienna Graduate School on Computational Optimization","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"}],"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-----------------“In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not endorse any of [name of university or educational entity]’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.”"}],"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","OA_place":"publisher","day":"11","supervisor":[{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"_id":"21854","ddc":["000"],"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","has_accepted_license":"1","date_created":"2026-05-11T08:43:22Z","related_material":{"record":[{"relation":"part_of_dissertation","id":"14771","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"18121"},{"status":"public","id":"21858","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"21859"},{"relation":"part_of_dissertation","id":"21857","status":"public"}]},"corr_author":"1","status":"public","oa_version":"Published Version","type":"dissertation","alternative_title":["ISTA Thesis"],"file_date_updated":"2026-05-13T13:10:48Z","acknowledged_ssus":[{"_id":"ScienComp"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"date_updated":"2026-05-11T08:36:01Z","file_size":28479571,"checksum":"2e148dad920e3f9b7c32796e0ba2e5f7","relation":"source_file","content_type":"application/zip","file_id":"21856","access_level":"closed","date_created":"2026-05-11T08:36:01Z","file_name":"EIofinova_thesis_FinalVersion.zip","creator":"eiofinov"},{"access_level":"open_access","creator":"eiofinov","file_name":"2026_Iofinova_Eugenia_Thesis.pdf","success":1,"date_created":"2026-05-13T13:10:48Z","checksum":"b10c2933f386f532b2dbf28b19c5525c","file_size":18137757,"date_updated":"2026-05-13T13:10:48Z","file_id":"21877","content_type":"application/pdf","relation":"main_file"}],"doi":"10.15479/AT-ISTA-21854","citation":{"chicago":"Iofinova, Eugenia B. “On the Utility and Effects of Efficiency in Artificial Neural Networks.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21854\">https://doi.org/10.15479/AT-ISTA-21854</a>.","ieee":"E. B. Iofinova, “On the utility and effects of efficiency in artificial neural networks,” Institute of Science and Technology Austria, 2026.","mla":"Iofinova, Eugenia B. <i>On the Utility and Effects of Efficiency in Artificial Neural Networks</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21854\">10.15479/AT-ISTA-21854</a>.","ama":"Iofinova EB. On the utility and effects of efficiency in artificial neural networks. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21854\">10.15479/AT-ISTA-21854</a>","ista":"Iofinova EB. 2026. On the utility and effects of efficiency in artificial neural networks. Institute of Science and Technology Austria.","apa":"Iofinova, E. B. (2026). <i>On the utility and effects of efficiency in artificial neural networks</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21854\">https://doi.org/10.15479/AT-ISTA-21854</a>","short":"E.B. Iofinova, On the Utility and Effects of Efficiency in Artificial Neural Networks, Institute of Science and Technology Austria, 2026."}},{"oa":1,"language":[{"iso":"eng"}],"month":"03","year":"2026","publisher":"OpenReview","abstract":[{"lang":"eng","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."}],"main_file_link":[{"open_access":"1","url":"https://openreview.net/pdf?id=soFWnTqd23"}],"author":[{"full_name":"Nicolicioiu, Armand","last_name":"Nicolicioiu","first_name":"Armand"},{"orcid":"0000-0002-7778-3221","last_name":"Iofinova","first_name":"Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","full_name":"Iofinova, Eugenia B"},{"full_name":"Jovanovic, Andrej","first_name":"Andrej","last_name":"Jovanovic"},{"first_name":"Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218","last_name":"Kurtic","full_name":"Kurtic, Eldar"},{"full_name":"Nikdan, Mahdi","id":"66374281-f394-11eb-9cf6-869147deecc0","first_name":"Mahdi","last_name":"Nikdan"},{"last_name":"Panferov","id":"2c18daae-4dbe-11ef-8491-98ce2d960f09","first_name":"Andrei","full_name":"Panferov, Andrei"},{"id":"D0CF4148-C985-11E9-8066-0BDEE5697425","first_name":"Ilia","last_name":"Markov","full_name":"Markov, Ilia"},{"last_name":"Shavit","first_name":"Nir","full_name":"Shavit, Nir"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"}],"date_published":"2026-03-06T00:00:00Z","title":"Panza: Investigating the feasibility of fully-local personalized text generation","date_updated":"2026-05-19T11:20:27Z","keyword":["LLMs","PEFT","LoRA","personalization","efficient ML"],"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","quality_controlled":"1","article_number":"81","citation":{"chicago":"Nicolicioiu, Armand, Eugenia B Iofinova, Andrej Jovanovic, Eldar Kurtic, Mahdi Nikdan, Andrei Panferov, Ilia Markov, Nir Shavit, and Dan-Adrian Alistarh. <i>Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation</i>. <i>Third Conference on Parsimony and Learning (Proceedings Track)</i>. OpenReview, 2026.","ieee":"A. Nicolicioiu <i>et al.</i>, <i>Panza: Investigating the feasibility of fully-local personalized text generation</i>. OpenReview, 2026.","ama":"Nicolicioiu A, Iofinova EB, Jovanovic A, et al. <i>Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation</i>. OpenReview; 2026.","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.","apa":"Nicolicioiu, A., Iofinova, E. B., Jovanovic, A., Kurtic, E., Nikdan, M., Panferov, A., … Alistarh, D.-A. (2026). <i>Panza: Investigating the feasibility of fully-local personalized text generation</i>. <i>Third Conference on Parsimony and Learning (Proceedings Track)</i>. Tübíngen, Germany: OpenReview.","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.","mla":"Nicolicioiu, Armand, et al. “Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation.” <i>Third Conference on Parsimony and Learning (Proceedings Track)</i>, 81, OpenReview, 2026."},"OA_type":"green","_id":"21857","day":"06","OA_place":"publisher","publication_status":"published","conference":{"end_date":"2026-03-26","name":"CPAL: Conference on Parsimony and Learning","start_date":"2026-03-23","location":"Tübíngen, Germany"},"type":"conference_poster","oa_version":"Accepted Version","publication":"Third Conference on Parsimony and Learning (Proceedings Track)","status":"public","corr_author":"1","related_material":{"record":[{"relation":"dissertation_contains","id":"21854","status":"public"}]},"date_created":"2026-05-11T08:50:28Z"},{"article_processing_charge":"No","external_id":{"arxiv":["2601.23153"]},"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"date_published":"2026-01-30T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2601.23153","open_access":"1"}],"author":[{"first_name":"Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","orcid":"0000-0002-7778-3221","last_name":"Iofinova","full_name":"Iofinova, Eugenia B"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-05-19T11:20:27Z","title":"Behemoth: Benchmarking unlearning in LLMs using fully synthetic data","project":[{"name":"Vienna Graduate School on Computational Optimization","grant_number":"W1260-N35","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"}],"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."}],"language":[{"iso":"eng"}],"year":"2026","month":"01","oa":1,"related_material":{"record":[{"status":"public","id":"21854","relation":"dissertation_contains"}]},"corr_author":"1","date_created":"2026-05-11T08:58:07Z","arxiv":1,"type":"preprint","publication":"arXiv","oa_version":"Preprint","status":"public","_id":"21859","publication_status":"draft","day":"30","OA_place":"repository","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","OA_type":"green","doi":"10.48550/arXiv.2601.23153","citation":{"mla":"Iofinova, Eugenia B., and Dan-Adrian Alistarh. “Behemoth: Benchmarking Unlearning in LLMs Using Fully Synthetic Data.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2601.23153\">10.48550/arXiv.2601.23153</a>.","ama":"Iofinova EB, Alistarh D-A. Behemoth: Benchmarking unlearning in LLMs using fully synthetic data. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2601.23153\">10.48550/arXiv.2601.23153</a>","ista":"Iofinova EB, Alistarh D-A. Behemoth: Benchmarking unlearning in LLMs using fully synthetic data. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2601.23153\">10.48550/arXiv.2601.23153</a>.","short":"E.B. Iofinova, D.-A. Alistarh, ArXiv (n.d.).","apa":"Iofinova, E. B., &#38; Alistarh, D.-A. (n.d.). Behemoth: Benchmarking unlearning in LLMs using fully synthetic data. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2601.23153\">https://doi.org/10.48550/arXiv.2601.23153</a>","chicago":"Iofinova, Eugenia B, and Dan-Adrian Alistarh. “Behemoth: Benchmarking Unlearning in LLMs Using Fully Synthetic Data.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2601.23153\">https://doi.org/10.48550/arXiv.2601.23153</a>.","ieee":"E. B. Iofinova and D.-A. Alistarh, “Behemoth: Benchmarking unlearning in LLMs using fully synthetic data,” <i>arXiv</i>. ."},"acknowledged_ssus":[{"_id":"ScienComp"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"JoFi"}],"author":[{"id":"1fcd8497-dba3-11ea-a45e-c6fbd715f7c7","first_name":"Thomas","orcid":"0009-0001-2346-5236","last_name":"Werner","full_name":"Werner, Thomas"}],"date_published":"2026-05-12T00:00:00Z","title":"Interfacing superconducting qubits with optical photons","date_updated":"2026-05-20T13:35:43Z","keyword":["Superconducting qubits","Quantum optics","Single photons and quantum effects","Nonlinear optics"],"ec_funded":1,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"language":[{"iso":"eng"}],"month":"05","page":"97","year":"2026","oa":1,"project":[{"grant_number":"101089099","name":"Cavity Quantum Electro Optics: Microwave photonics with nonclassical states","_id":"bdadfa0d-d553-11ed-ba76-fb85edbd456a"},{"grant_number":"899354","name":"Quantum Local Area Networks with Superconducting Qubits","call_identifier":"H2020","_id":"9B868D20-BA93-11EA-9121-9846C619BF3A"},{"grant_number":"758053","name":"A Fiber Optic Transceiver for Superconducting Qubits","call_identifier":"H2020","_id":"26336814-B435-11E9-9278-68D0E5697425"},{"_id":"5b807754-ab3d-11f0-914f-ff8c34502cc9","grant_number":"101248662","name":"Integrated optical coupling for low loss electro-optic interconnects"},{"grant_number":"101187231","name":"Cavity-Integrated Electro-Optics: Measuring, Converting and Manipulating Microwaves with Light","_id":"91aaf765-16d5-11f0-9cad-a8e7e44cccb7"},{"_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f","grant_number":"F07105","name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits"},{"name":"Open Superconducting Quantum Computers (OpenSuperQPlus)","grant_number":"101080139","_id":"bdb7cfc1-d553-11ed-ba76-d2eaab167738"},{"_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A","name":"NOMIS Fellowship Program"}],"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","abstract":[{"lang":"eng","text":"Atoms and photons, two things so different but yet so alike. The former, the building block of matter, something we learn about in school and imagine it as some tiny marbles encircled by other tinier marbles. The latter, an electromagnetic wave, a light particle or an excitation of the electromagnetic field. Quantum mechanics tells us about the properties of these two entities. And even if it sounds, looks and writes counter-intuitive, it has proven right for over a century now.\r\n\r\nIn this work, I elaborate on how we tested the laws of quantum mechanics and how we used them learn more about the tiny building blocks of nature and the fields they use to talk to each other. The atoms we use, are artificial. Superconducting qubits, small electrical circuits with quantized energy levels behave like electrons that transition between different orbitals in an atom. One of the qubits' advantages, is also a big disadvantage. We design the circuits' energy levels and fabricate them in a cleanroom. This allows for arbitrary spaced energy levels but in contrast to real atoms, prevents two superconducting qubits from being alike. Still, this qubit platform is one of the frontrunners for future quantum computing technology and testing fundamental physics due to their scalability.\r\n\r\nWe interface superconducting qubits, which operate in the GHz regime, with microwave photons. We use 3D aluminum cavities as mediators between qubits and photons. The cavities allow for non-destructive readout of the qubit state, they shield the qubits from noise at the qubit frequency and they give us an easy way to frequency-tune these joint systems.\r\n\r\nWe need to operate superconducting qubits and their cavities at millikelvin temperatures in dilution refrigerators. At higher temperatures, superconductivity suffers and even worse, the environment is filled with thermal noise photons. This poses a fundamental limitation on the scalability of superconducting qubit devices. Also connecting multiple devices in different fridges does not work over room temperature links because the microwave photons used for this purpose will be covered in noise and the quantum information they carry, will be unusable.\r\n\r\nInfrared photons do not suffer from this noise problem since there are close to zero thermal noise photons at their frequencies at room temperature. We cannot simply interface superconducting devices with optical photons due their frequency mismatch and the destructive effect of optical photons on superconductors. Therefore, we use microwave-to-optics transducers that allow to convert microwave photons into optical ones and vice-versa. The transducers that we use are macroscopic electro-optic transducers using the Pockels effect in a disk-shaped Lithium Niobate whispering gallery mode resonator. By using a strong optical pump, photons from the two frequency domains experience a beam-splitter interaction and get converted from one to the other.\r\n\r\nWe measure the generated optical photons using elaborate optical setups, optical heterodyning and single photon detectors to gain knowledge about the qubit state or the converted microwave photons. Bridging the microwave and the optical world allows us to take advantage of both of their strengths but it also requires deep knowledge about both of their working principles.\r\n\r\nIn this work, we describe two experiments that our group conducted to showcase the opportunities that arise from interfacing superconducting qubits with optical photons but also the pitfalls, one may encounter on the way.\r\n\r\nIn the first experiment, we managed to all-optically read out a superconducting qubit. We show that the assignment fidelity, the probability that a measurement of the qubit state matches the prepared state, is close to equal for all-optical, microwave-to-optics and conventional microwave readout. We show T1 and T2 measurements for all three readout types and give an analysis of the noise caused by the optics. Finally, we show that the infrared light does not affect the qubit performance in a negative way but that the heating it causes does. This is an important insight that we used in the next experiment.\r\n\r\nThe second experiment is the upconversion of itinerant single microwave photons to the optical domain. We show that we can generate single microwave photons from a qubit-cavity system. We upconvert these single photons, measure them with a single photon detector and reconstruct their shape. By conducting a single photon Rabi measurement, we show correlations between the microwave and the optical domain. And by thorough signal-to-noise measurements and noise analysis, we find that we can generate single infrared photons with high signal-to-noise ratio 5.1 and low transducer added noise (<0.012 quanta). We show that this measurement creates a path towards entanglement of a superconducting qubit and an optical photon and what parameters need to be improved to achieve it. Additionally, this experiment is a proof of principle for an on-demand infrared single photon source. More generally, it allows to link microwave quantum technology in general to the optical domain."}],"publication_identifier":{"issn":["2663-337X"]},"_id":"21863","day":"12","OA_place":"publisher","supervisor":[{"first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M"}],"publication_status":"published","ddc":["530","537","539"],"acknowledgement":"The author of this work was supported by the European Research Council under grant no.\r\n101089099 (ERC CoG cQEO) and the European Union’s Horizon 2020 research and innovation\r\nprogram under grant no. 899354 (FETopen SuperQuLAN).\r\nThis work was also supported by the European Research Council under grant nos. 758053\r\n(ERC StG QUNNECT), 101248662 (ERC POC CoupledEOT), and the European Innovation\r\nCouncil no. 101187231 (PathfinderOpen CIELO). This research was funded in whole or in part\r\nby the Austrian Science Fund (FWF) [10.55776/F71]. For open access purposes, the author\r\nhas applied a CC BY public copyright license to any author accepted manuscript version arising\r\nfrom this submission.\r\niii\r\nMy co-authors in the works mentioned later acknowledge generous support from the ISTFELLOW program, the NOMIS-ISTA fellowship, the Horizon Europe Program HORIZONCL4-2022-QUANTUM-01-SGA via Project No. 101113946 OpenSuperQPlus100 and a DOC fellowship of the Austrian Academy of Sciences at IST Austria.\r\n","has_accepted_license":"1","corr_author":"1","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"19073"},{"relation":"part_of_dissertation","status":"public","id":"21870"}]},"date_created":"2026-05-12T09:04:02Z","type":"dissertation","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","status":"public","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"LifeSc"},{"_id":"SSU"}],"file_date_updated":"2026-05-15T15:54:06Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"date_created":"2026-05-15T15:53:57Z","creator":"twerner","file_name":"2026_Werner_Thomas_Thesis.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"21879","file_size":9330516,"date_updated":"2026-05-15T15:53:57Z","checksum":"a5b4d8dba83f96e955a3625c0eebee98"},{"file_name":"2026_Werner_Thomas_Thesis.zip","creator":"twerner","date_created":"2026-05-15T15:54:06Z","access_level":"closed","file_id":"21880","relation":"source_file","content_type":"application/x-zip-compressed","checksum":"b41282beaacfb32472769b9e3b1758d8","date_updated":"2026-05-15T15:54:06Z","file_size":9370704}],"doi":"10.15479/AT-ISTA-21863","citation":{"chicago":"Werner, Thomas. “Interfacing Superconducting Qubits with Optical Photons.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21863\">https://doi.org/10.15479/AT-ISTA-21863</a>.","ieee":"T. Werner, “Interfacing superconducting qubits with optical photons,” Institute of Science and Technology Austria, 2026.","ama":"Werner T. Interfacing superconducting qubits with optical photons. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21863\">10.15479/AT-ISTA-21863</a>","apa":"Werner, T. (2026). <i>Interfacing superconducting qubits with optical photons</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21863\">https://doi.org/10.15479/AT-ISTA-21863</a>","ista":"Werner T. 2026. Interfacing superconducting qubits with optical photons. Institute of Science and Technology Austria.","short":"T. Werner, Interfacing Superconducting Qubits with Optical Photons, Institute of Science and Technology Austria, 2026.","mla":"Werner, Thomas. <i>Interfacing Superconducting Qubits with Optical Photons</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21863\">10.15479/AT-ISTA-21863</a>."}},{"project":[{"_id":"bdadfa0d-d553-11ed-ba76-fb85edbd456a","name":"Cavity Quantum Electro Optics: Microwave photonics with nonclassical states","grant_number":"101089099"},{"grant_number":"101248662","name":"Integrated optical coupling for low loss electro-optic interconnects","_id":"5b807754-ab3d-11f0-914f-ff8c34502cc9"},{"grant_number":"899354","name":"Quantum Local Area Networks with Superconducting Qubits","_id":"9B868D20-BA93-11EA-9121-9846C619BF3A","call_identifier":"H2020"},{"grant_number":"101187231","name":"Cavity-Integrated Electro-Optics: Measuring, Converting and Manipulating Microwaves with Light","_id":"91aaf765-16d5-11f0-9cad-a8e7e44cccb7"},{"name":"Integrating superconducting quantum circuits","grant_number":"F07105","call_identifier":"FWF","_id":"26927A52-B435-11E9-9278-68D0E5697425"},{"_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A","name":"NOMIS Fellowship Program"}],"abstract":[{"text":"Superconducting qubits are a leading candidate for utility-scale quantum computing due to their fast gate speeds and steadily decreasing error rates. The requirement for millikelvin operating temperatures, however, creates a significant scaling bottleneck. Modular architectures using optical fiber links could bridge separate cryogenic nodes, but superconducting circuits do not have coherent optical transitions and microwave-to-optical conversion has not been shown for any non-classical photon state. In this work, we demonstrate the on-demand generation and tomographic reconstruction of itinerant single microwave photons at 8.9 GHz from a superconducting qubit. We upconvert this non-Gaussian state with a transducer added noise below 0.012 quanta and count the converted telecom photons at 193.4 THz with a signal-to-noise ratio of up to 5.1$\\pm$1.1. We characterize the trade-offs between throughput and noise, and establish a viable path toward heralded entanglement distribution and gate teleportation. Looking ahead, these results empower existing superconducting devices to take a key role in distributed quantum technologies and heterogeneous quantum systems.","lang":"eng"}],"year":"2026","month":"01","language":[{"iso":"eng"}],"oa":1,"ec_funded":1,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"department":[{"_id":"JoFi"},{"_id":"GradSch"}],"external_id":{"arxiv":["2602.00928"]},"article_processing_charge":"No","date_updated":"2026-05-20T13:35:42Z","title":"Electro-optic conversion of itinerant Fock states","author":[{"full_name":"Werner, Thomas","id":"1fcd8497-dba3-11ea-a45e-c6fbd715f7c7","first_name":"Thomas","orcid":"0009-0001-2346-5236","last_name":"Werner"},{"full_name":"Riyazi, Erfan","first_name":"Erfan","id":"53322f94-5355-11ee-ae5a-ff6f81c87d51","last_name":"Riyazi"},{"full_name":"Hawaldar, Samarth","last_name":"Hawaldar","orcid":"0000-0002-1965-4309","first_name":"Samarth","id":"221708e1-1ff6-11ee-9fa6-85146607433e"},{"last_name":"Sahu","orcid":"0000-0001-6264-2162","first_name":"Rishabh","id":"47D26E34-F248-11E8-B48F-1D18A9856A87","full_name":"Sahu, Rishabh"},{"orcid":"0000-0003-1397-7876","last_name":"Arnold","first_name":"Georg M","id":"3770C838-F248-11E8-B48F-1D18A9856A87","full_name":"Arnold, Georg M"},{"first_name":"Paul Falthansl-Scheinecker","last_name":"Paul Falthansl-Scheinecker","full_name":"Paul Falthansl-Scheinecker, Paul Falthansl-Scheinecker"},{"last_name":"Naranjo","first_name":"Jennifer A. Sánchez","full_name":"Naranjo, Jennifer A. Sánchez"},{"full_name":"Loi, Dante","first_name":"Dante","last_name":"Loi"},{"first_name":"Lucky N.","last_name":"Kapoor","full_name":"Kapoor, Lucky N."},{"full_name":"Zemlicka, Martin","orcid":"0009-0005-0878-3032","last_name":"Zemlicka","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"full_name":"Qiu, Liu","id":"45e99c0d-1eb1-11eb-9b96-ed8ab2983cac","first_name":"Liu","last_name":"Qiu","orcid":"0000-0003-4345-4267"},{"id":"d67706f8-8eb1-11ee-ad1b-9c30dfa19e0b","first_name":"Andrei","last_name":"Militaru","full_name":"Militaru, Andrei"},{"orcid":"0000-0001-8112-028X","last_name":"Fink","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2602.00928","open_access":"1"}],"date_published":"2026-01-31T00:00:00Z","doi":"10.48550/arXiv.2602.00928","citation":{"mla":"Werner, Thomas, et al. “Electro-Optic Conversion of Itinerant Fock States.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2602.00928\">10.48550/arXiv.2602.00928</a>.","ista":"Werner T, Riyazi E, Hawaldar S, Sahu R, Arnold GM, Paul Falthansl-Scheinecker PF-S, Naranjo JAS, Loi D, Kapoor LN, Zemlicka M, Qiu L, Militaru A, Fink JM. Electro-optic conversion of itinerant Fock states. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2602.00928\">10.48550/arXiv.2602.00928</a>.","apa":"Werner, T., Riyazi, E., Hawaldar, S., Sahu, R., Arnold, G. M., Paul Falthansl-Scheinecker, P. F.-S., … Fink, J. M. (n.d.). Electro-optic conversion of itinerant Fock states. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2602.00928\">https://doi.org/10.48550/arXiv.2602.00928</a>","short":"T. Werner, E. Riyazi, S. Hawaldar, R. Sahu, G.M. Arnold, P.F.-S. Paul Falthansl-Scheinecker, J.A.S. Naranjo, D. Loi, L.N. Kapoor, M. Zemlicka, L. Qiu, A. Militaru, J.M. Fink, ArXiv (n.d.).","ama":"Werner T, Riyazi E, Hawaldar S, et al. Electro-optic conversion of itinerant Fock states. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2602.00928\">10.48550/arXiv.2602.00928</a>","ieee":"T. Werner <i>et al.</i>, “Electro-optic conversion of itinerant Fock states,” <i>arXiv</i>. .","chicago":"Werner, Thomas, Erfan Riyazi, Samarth Hawaldar, Rishabh Sahu, Georg M Arnold, Paul Falthansl-Scheinecker Paul Falthansl-Scheinecker, Jennifer A. Sánchez Naranjo, et al. “Electro-Optic Conversion of Itinerant Fock States.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2602.00928\">https://doi.org/10.48550/arXiv.2602.00928</a>."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2026-05-12T13:58:18Z","arxiv":1,"corr_author":"1","related_material":{"record":[{"status":"public","id":"21863","relation":"dissertation_contains"}]},"oa_version":"Preprint","publication":"arXiv","status":"public","type":"preprint","day":"31","OA_place":"repository","publication_status":"draft","_id":"21870","scopus_import":"1","acknowledgement":"We thank Fritz Diorico and Onur Hosten who suggested the filter cavity design, and gave important insights about the assembly and the testing of the FabryPerot filter cavities. Ekatrina Fedotova and Diego A.\r\nLancheros Naranjo worked on the filter cavity setup in\r\nthe early stages of this work. Gustavo Wiederhecker and\r\nYiewen Chu provided insights as to the origins of the\r\nobserved optical noise and Nicola Carlon Zambon suggested using telecom filters to mitigate it further. This\r\nwork was supported by the European Research Council under grant agreement no. 101089099 (ERC CoG\r\ncQEO), and 101248662 (ERC POC CoupledEOT), the\r\nEuropean Unions Horizon 2020 research and innovation\r\nprogram under grant agreement no. 899354 (FETopen\r\nSuperQuLAN), the European Innovation Council no.\r\n101187231 (PathfinderOpen CIELO), and the Austrian\r\nScience Fund (FWF) no. F7105 (SFB BeyondC). J.F.\r\nand L.K. acknowledge support from the Horizon Europe\r\nProgram HORIZON-CL4-2022-QUANTUM-01-SGA via\r\nProject No. 101113946 OpenSuperQPlus100. A.M. acknowledges support from the NOMIS-ISTA fellowship.","OA_type":"green"},{"author":[{"orcid":"0000-0002-8612-8202","last_name":"Kolisnyk","first_name":"Dmytro","id":"530a7320-5355-11ee-ae5a-82a46997aaa7","full_name":"Kolisnyk, Dmytro"},{"last_name":"Medina Ramos","orcid":"0000-0002-5383-2869","first_name":"Raimel A","id":"CE680B90-D85A-11E9-B684-C920E6697425","full_name":"Medina Ramos, Raimel A"},{"full_name":"Vasseur, Romain","last_name":"Vasseur","first_name":"Romain"},{"first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","last_name":"Serbyn","full_name":"Serbyn, Maksym"}],"date_published":"2026-05-22T00:00:00Z","title":"Tensor cross interpolation of purities in quantum many-body systems","date_updated":"2026-06-02T09:15:13Z","external_id":{"arxiv":["2503.17230"]},"article_processing_charge":"Yes","department":[{"_id":"MaSe"},{"_id":"GradSch"}],"DOAJ_listed":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ec_funded":1,"oa":1,"language":[{"iso":"eng"}],"year":"2026","month":"05","publisher":"Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften","abstract":[{"text":"A defining feature of quantum many-body systems is the exponential scaling of the Hilbert space with the number of degrees of freedom. This exponential complexity naïvely renders a complete state characterization, for instance via the complete set of bipartite Renyi entropies for all disjoint regions, a challenging task. Recently, a compact way of storing subregions' purities by encoding them as amplitudes of a fictitious quantum wave function, known as entanglement feature, was proposed. Notably, the entanglement feature can be a simple object even for highly entangled quantum states. However the complexity and practical usage of the entanglement feature for general quantum states has not been explored. In this work, we demonstrate that the entanglement feature can be efficiently learned using only a polynomial amount of samples in the number of degrees of freedom through the so-called tensor cross interpolation (TCI) algorithm, assuming it is expressible as a finite bond dimension MPS. We benchmark this learning process on Haar and random MPS states, confirming analytic expectations. Applying the TCI algorithm to quantum eigenstates of various one dimensional quantum systems, we identify cases where eigenstates have entanglement feature learnable with TCI. We conclude with possible applications of the learned entanglement feature, such as quantifying the distance between different entanglement patterns and finding the optimal one-dimensional ordering of physical indices in a given state, highlighting the potential utility of the proposed purity interpolation method.","lang":"eng"}],"PlanS_conform":"1","project":[{"_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899"}],"ddc":["530"],"acknowledgement":"We acknowledge useful discussions with Richard Küng\r\non the interpolation methods and error spreading, Ilia\r\nA. Luchnikov, Margarita Davydova, and, in particular, Hiroshi Shinaoka, Marc Ritter, Yuriel Nuñez\r\nfor useful discussions about TCI and the various\r\nworkarounds within the TensorCrossInterpolation.jl\r\nlibrary. We also acknowledge the comments of anonymous Referee B, that encouraged us to expand the\r\nmanuscript with discussion of additional applications\r\nof entanglement feature in Section 4.3. M.S. acknowledges discussions with D. V. Savostyanov at the 2nd\r\nInternational Quantum Tensor Networks (IQTN) plenary meeting at Flatiron Institute’s Center for Computational Quantum Physics (CCQ) for introduction\r\nto the TCI approach. D.K and M.S. acknowledge support by the European Research Council (ERC) under We acknowledge useful discussions with Richard Küng\r\non the interpolation methods and error spreading, Ilia\r\nA. Luchnikov, Margarita Davydova, and, in particular, Hiroshi Shinaoka, Marc Ritter, Yuriel Nuñez\r\nfor useful discussions about TCI and the various\r\nworkarounds within the TensorCrossInterpolation.jl\r\nlibrary. We also acknowledge the comments of anonymous Referee B, that encouraged us to expand the\r\nmanuscript with discussion of additional applications\r\nof entanglement feature in Section 4.3. M.S. acknowledges discussions with D. V. Savostyanov at the 2nd\r\nInternational Quantum Tensor Networks (IQTN) plenary meeting at Flatiron Institute’s Center for Computational Quantum Physics (CCQ) for introduction\r\nto the TCI approach. D.K and M.S. acknowledge support by the European Research Council (ERC) under We acknowledge useful discussions with Richard Küng\r\non the interpolation methods and error spreading, Ilia\r\nA. Luchnikov, Margarita Davydova, and, in particular, Hiroshi Shinaoka, Marc Ritter, Yuriel Nuñez\r\nfor useful discussions about TCI and the various\r\nworkarounds within the TensorCrossInterpolation.jl\r\nlibrary. We also acknowledge the comments of anonymous Referee B, that encouraged us to expand the\r\nmanuscript with discussion of additional applications\r\nof entanglement feature in Section 4.3. M.S. acknowledges discussions with D. V. Savostyanov at the 2nd\r\nInternational Quantum Tensor Networks (IQTN) plenary meeting at Flatiron Institute’s Center for Computational Quantum Physics (CCQ) for introduction\r\nto the TCI approach. D.K and M.S. acknowledge support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 850899).\r\nR.V. acknowledges partial support from the US Department of Energy, Office of Science, Basic Energy\r\nSciences, under award No. DE-SC0023999, and the\r\nSwiss National Science Foundation (grant 10008234).\r\nThis research was supported in part by grant NSF\r\nPHY-2309135 to the Kavli Institute for Theoretical\r\nPhysics (KITP)","has_accepted_license":"1","OA_type":"gold","publication_identifier":{"eissn":["2521-327X"]},"_id":"21917","intvolume":"        10","day":"22","OA_place":"publisher","publication_status":"published","type":"journal_article","status":"public","publication":"Quantum","oa_version":"Published Version","corr_author":"1","arxiv":1,"date_created":"2026-05-26T19:39:12Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","creator":"dernst","file_name":"2026_Quantum_Kolisnyk.pdf","date_created":"2026-06-02T09:12:11Z","success":1,"checksum":"f8ce78607ad06120cdf894dc8cef55da","file_size":3284798,"date_updated":"2026-06-02T09:12:11Z","file_id":"21939","content_type":"application/pdf","relation":"main_file"}],"quality_controlled":"1","file_date_updated":"2026-06-02T09:12:11Z","article_number":"2114","article_type":"original","citation":{"mla":"Kolisnyk, Dmytro, et al. “Tensor Cross Interpolation of Purities in Quantum Many-Body Systems.” <i>Quantum</i>, vol. 10, 2114, Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2026, doi:<a href=\"https://doi.org/10.22331/q-2026-05-22-2114\">10.22331/q-2026-05-22-2114</a>.","ista":"Kolisnyk D, Medina Ramos RA, Vasseur R, Serbyn M. 2026. Tensor cross interpolation of purities in quantum many-body systems. Quantum. 10, 2114.","apa":"Kolisnyk, D., Medina Ramos, R. A., Vasseur, R., &#38; Serbyn, M. (2026). Tensor cross interpolation of purities in quantum many-body systems. <i>Quantum</i>. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften. <a href=\"https://doi.org/10.22331/q-2026-05-22-2114\">https://doi.org/10.22331/q-2026-05-22-2114</a>","short":"D. Kolisnyk, R.A. Medina Ramos, R. Vasseur, M. Serbyn, Quantum 10 (2026).","ama":"Kolisnyk D, Medina Ramos RA, Vasseur R, Serbyn M. Tensor cross interpolation of purities in quantum many-body systems. <i>Quantum</i>. 2026;10. doi:<a href=\"https://doi.org/10.22331/q-2026-05-22-2114\">10.22331/q-2026-05-22-2114</a>","ieee":"D. Kolisnyk, R. A. Medina Ramos, R. Vasseur, and M. Serbyn, “Tensor cross interpolation of purities in quantum many-body systems,” <i>Quantum</i>, vol. 10. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2026.","chicago":"Kolisnyk, Dmytro, Raimel A Medina Ramos, Romain Vasseur, and Maksym Serbyn. “Tensor Cross Interpolation of Purities in Quantum Many-Body Systems.” <i>Quantum</i>. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2026. <a href=\"https://doi.org/10.22331/q-2026-05-22-2114\">https://doi.org/10.22331/q-2026-05-22-2114</a>."},"volume":10,"doi":"10.22331/q-2026-05-22-2114"},{"day":"07","OA_place":"publisher","publication_status":"published","supervisor":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Maas, Jan","last_name":"Maas","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"publication_identifier":{"issn":["2663-337X"]},"_id":"21918","ddc":["576"],"acknowledgement":"At different stages of my PhD, my work was supported by several grants: the\r\nDOC fellowship of the Austrian Academy of Sciences (26293, awarded to me),\r\nthe FWF-SFB grant (PT1032F06504 n. F65, awarded to Jan Maas), and the ERC\r\ngrant (PR1032ERC01 n. 716117, awarded to Jan Maas). I also appreciate the help\r\nfrom the Scientific Computing unit for their advice on the cluster usage.","has_accepted_license":"1","date_created":"2026-05-27T06:26:08Z","related_material":{"record":[{"id":"11447","status":"public","relation":"part_of_dissertation"},{"id":"12513","status":"deleted","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"21967","status":"public"},{"relation":"part_of_dissertation","id":"21968","status":"public"}]},"corr_author":"1","oa_version":"Published Version","status":"public","type":"dissertation","alternative_title":["ISTA Thesis"],"file_date_updated":"2026-06-11T12:14:53Z","acknowledged_ssus":[{"_id":"ScienComp"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"content_type":"application/x-zip-compressed","relation":"source_file","file_id":"21965","file_size":20549813,"date_updated":"2026-06-09T08:40:48Z","checksum":"0cff64ae74f0f9f2d7011700c82f700a","date_created":"2026-06-09T08:34:38Z","creator":"kkhudiak","file_name":"thesis.zip","access_level":"closed"},{"access_level":"closed","date_created":"2026-06-09T12:28:51Z","creator":"kkhudiak","file_name":"2026_Khudiakova_Ksenia_Thesis.pdf","embargo":"2027-06-10","embargo_to":"open_access","file_size":9387029,"date_updated":"2026-06-11T12:14:53Z","checksum":"547ae42de37cc86894af283f1664dbc8","content_type":"application/pdf","relation":"main_file","file_id":"21969"}],"doi":"10.15479/AT-ISTA-21918","citation":{"mla":"Khudiakova, Kseniia. <i>How Epistasis and Purifying Selection Shape Genetic Diversity</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21918\">10.15479/AT-ISTA-21918</a>.","ama":"Khudiakova K. How epistasis and purifying selection shape genetic diversity. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21918\">10.15479/AT-ISTA-21918</a>","apa":"Khudiakova, K. (2026). <i>How epistasis and purifying selection shape genetic diversity</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21918\">https://doi.org/10.15479/AT-ISTA-21918</a>","short":"K. Khudiakova, How Epistasis and Purifying Selection Shape Genetic Diversity, Institute of Science and Technology Austria, 2026.","ista":"Khudiakova K. 2026. How epistasis and purifying selection shape genetic diversity. Institute of Science and Technology Austria.","chicago":"Khudiakova, Kseniia. “How Epistasis and Purifying Selection Shape Genetic Diversity.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21918\">https://doi.org/10.15479/AT-ISTA-21918</a>.","ieee":"K. Khudiakova, “How epistasis and purifying selection shape genetic diversity,” Institute of Science and Technology Austria, 2026."},"department":[{"_id":"GradSch"},{"_id":"NiBa"},{"_id":"JaMa"}],"article_processing_charge":"No","title":"How epistasis and purifying selection shape genetic diversity","date_updated":"2026-06-12T12:43:35Z","author":[{"full_name":"Khudiakova, Kseniia","orcid":"0000-0002-6246-1465","last_name":"Khudiakova","id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","first_name":"Kseniia"}],"date_published":"2026-06-07T00:00:00Z","ec_funded":1,"tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"month":"06","page":"89","year":"2026","language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117"},{"grant_number":"26293","name":"The impact of deleterious mutations on small populations","_id":"34d33d68-11ca-11ed-8bc3-ec13763c0ca8"},{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD"},{"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"external_id":{"pmid":["42159315"]},"article_processing_charge":"Yes (via OA deal)","department":[{"_id":"GradSch"},{"_id":"PaSc"}],"author":[{"full_name":"Schneider, Jakob","last_name":"Schneider","first_name":"Jakob","id":"64368429-eb97-11eb-a6c2-c980b1f44415"},{"full_name":"Guillerm, Undina","last_name":"Guillerm","first_name":"Undina","id":"bb74f472-ae54-11eb-9835-bc9c22fb1183"},{"full_name":"Simoes Pereira, Caroline","id":"87266c4a-96d2-11ef-be2c-fe5633233ec3","first_name":"Caroline","last_name":"Simoes Pereira"},{"full_name":"Schanda, Paul","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606","last_name":"Schanda"}],"date_published":"2026-06-01T00:00:00Z","issue":"6","title":"Dynamic disorder is crucial for mitochondrial protein import","date_updated":"2026-06-02T07:26:34Z","PlanS_conform":"1","project":[{"grant_number":"I06223","name":"Structure and mechanism of the mitochondrial MIM insertase","_id":"bdb9578d-d553-11ed-ba76-ed5d39fce6f0"}],"publisher":"Wiley","abstract":[{"lang":"eng","text":"The import of proteins into mitochondria poses fundamental mechanistic challenges: aggregation-prone precursor proteins must be maintained in aqueous compartments and threaded through narrow pores without becoming stuck or mislocalized. Recent evidence from mitochondrial protein import studies and other chaperone systems underscores the critical role of dynamics in balancing sufficiently tight binding, promiscuity, specificity, and release. Dynamic binding of client precursor proteins to import machinery components arises naturally from the avidity of their interactions. Conformational entropy enhances their stability, while the multivalent nature of these interactions ensures that client transfer to downstream insertases occurs without a substantial energy barrier. Here, we discuss this emerging paradigm of dynamic protein handling, using examples where dynamic structures have been resolved and highlight outstanding questions."}],"language":[{"iso":"eng"}],"year":"2026","month":"06","oa":1,"corr_author":"1","pmid":1,"date_created":"2026-05-31T22:02:12Z","type":"journal_article","oa_version":"Published Version","publication":"Protein Science","status":"public","publication_identifier":{"issn":["0961-8368"],"eissn":["1469-896X"]},"_id":"21929","intvolume":"        35","day":"01","OA_place":"publisher","publication_status":"published","ddc":["572"],"OA_type":"hybrid","has_accepted_license":"1","acknowledgement":"We gratefully acknowledge research funding by the Austrian Science Fund (FWF), projects 10.55776/PAT1647625 and 10.55776/I6223. We thank Prof. Long Li (Peking University) for providing structural models and EM density for the TOM and TIM23 complexes, used to generate part of Figure 3. Open Access funding provided by Institute of Science and Technology Austria.","scopus_import":"1","doi":"10.1002/pro.70630","article_number":"e70630","article_type":"original","citation":{"chicago":"Schneider, Jakob, Undina Guillerm, Caroline Simoes Pereira, and Paul Schanda. “Dynamic Disorder Is Crucial for Mitochondrial Protein Import.” <i>Protein Science</i>. Wiley, 2026. <a href=\"https://doi.org/10.1002/pro.70630\">https://doi.org/10.1002/pro.70630</a>.","ieee":"J. Schneider, U. Guillerm, C. Simoes Pereira, and P. Schanda, “Dynamic disorder is crucial for mitochondrial protein import,” <i>Protein Science</i>, vol. 35, no. 6. Wiley, 2026.","mla":"Schneider, Jakob, et al. “Dynamic Disorder Is Crucial for Mitochondrial Protein Import.” <i>Protein Science</i>, vol. 35, no. 6, e70630, Wiley, 2026, doi:<a href=\"https://doi.org/10.1002/pro.70630\">10.1002/pro.70630</a>.","ama":"Schneider J, Guillerm U, Simoes Pereira C, Schanda P. Dynamic disorder is crucial for mitochondrial protein import. <i>Protein Science</i>. 2026;35(6). doi:<a href=\"https://doi.org/10.1002/pro.70630\">10.1002/pro.70630</a>","ista":"Schneider J, Guillerm U, Simoes Pereira C, Schanda P. 2026. Dynamic disorder is crucial for mitochondrial protein import. Protein Science. 35(6), e70630.","short":"J. Schneider, U. Guillerm, C. Simoes Pereira, P. Schanda, Protein Science 35 (2026).","apa":"Schneider, J., Guillerm, U., Simoes Pereira, C., &#38; Schanda, P. (2026). Dynamic disorder is crucial for mitochondrial protein import. <i>Protein Science</i>. Wiley. <a href=\"https://doi.org/10.1002/pro.70630\">https://doi.org/10.1002/pro.70630</a>"},"volume":35,"quality_controlled":"1","file_date_updated":"2026-06-02T07:23:12Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"21937","content_type":"application/pdf","relation":"main_file","checksum":"e0163459a7238fdcc3fc5e17bedcce9a","file_size":3897305,"date_updated":"2026-06-02T07:23:12Z","creator":"dernst","file_name":"2026_ProteinScience_Schneider.pdf","date_created":"2026-06-02T07:23:12Z","success":1,"access_level":"open_access"}]},{"project":[{"name":"Vienna Graduate School on Computational Optimization","grant_number":"W1260-N35","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"}],"degree_awarded":"PhD","publisher":"Institute of Science and Technology Austria","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"}],"language":[{"iso":"eng"}],"page":"89","month":"06","year":"2026","oa":1,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"author":[{"last_name":"Zapata","id":"00223538-AF8F-11E9-A4C7-F729E6697425","first_name":"Jeferson","full_name":"Zapata, Jeferson"}],"date_published":"2026-06-09T00:00:00Z","title":"Overcoming degeneracy and singularity : Techniques for semidefinite programs and homotopy continuation endgames","date_updated":"2026-06-12T10:37:00Z","doi":"10.15479/AT-ISTA-21957","citation":{"chicago":"Zapata, Jeferson. “Overcoming Degeneracy and Singularity : Techniques for Semidefinite Programs and Homotopy Continuation Endgames.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21957\">https://doi.org/10.15479/AT-ISTA-21957</a>.","ieee":"J. Zapata, “Overcoming degeneracy and singularity : Techniques for semidefinite programs and homotopy continuation endgames,” Institute of Science and Technology Austria, 2026.","ama":"Zapata J. Overcoming degeneracy and singularity : Techniques for semidefinite programs and homotopy continuation endgames. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21957\">10.15479/AT-ISTA-21957</a>","short":"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). <i>Overcoming degeneracy and singularity : Techniques for semidefinite programs and homotopy continuation endgames</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21957\">https://doi.org/10.15479/AT-ISTA-21957</a>","ista":"Zapata J. 2026. Overcoming degeneracy and singularity : Techniques for semidefinite programs and homotopy continuation endgames. Institute of Science and Technology Austria.","mla":"Zapata, Jeferson. <i>Overcoming Degeneracy and Singularity : Techniques for Semidefinite Programs and Homotopy Continuation Endgames</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21957\">10.15479/AT-ISTA-21957</a>."},"file_date_updated":"2026-06-10T13:33:25Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"content_type":"application/zip","relation":"source_file","file_id":"21958","file_size":40811933,"date_updated":"2026-06-08T13:20:02Z","checksum":"b11a959e99d3dcf61040282b5c837141","date_created":"2026-06-08T13:20:02Z","creator":"jzapata","file_name":"istaustriathesis_JZapata.zip","access_level":"closed"},{"relation":"main_file","content_type":"application/pdf","file_id":"21992","date_updated":"2026-06-10T13:33:25Z","file_size":2207892,"checksum":"edf1e5899b2e31505cd1aa3fe8bd4b7f","success":1,"date_created":"2026-06-10T13:33:25Z","file_name":"4_Final_Thesis_JZapata_REX.pdf","creator":"jzapata","access_level":"open_access"}],"corr_author":"1","related_material":{"record":[{"status":"public","id":"21144","relation":"part_of_dissertation"}]},"date_created":"2026-06-08T13:29:52Z","alternative_title":["ISTA Thesis"],"type":"dissertation","oa_version":"Published Version","status":"public","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-079-4"]},"_id":"21957","day":"09","OA_place":"publisher","publication_status":"published","supervisor":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"}],"ddc":["500"],"acknowledgement":"Funding: Vienna Graduate School on Computational Optimization (FWF), grant DOI: 10.55776/W1260.","has_accepted_license":"1"},{"publisher":"Institute of Science and Technology Austria","citation":{"ista":"Kerschbaumer A. 2026. Research Data: ‘Quasi-solitons in Rydberg atom chains’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-21960\">10.15479/AT-ISTA-21960</a>.","apa":"Kerschbaumer, A. (2026). Research Data: “Quasi-solitons in Rydberg atom chains.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21960\">https://doi.org/10.15479/AT-ISTA-21960</a>","short":"A. Kerschbaumer, (2026).","ama":"Kerschbaumer A. Research Data: “Quasi-solitons in Rydberg atom chains.” 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21960\">10.15479/AT-ISTA-21960</a>","mla":"Kerschbaumer, Aron. <i>Research Data: “Quasi-Solitons in Rydberg Atom Chains.”</i> Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21960\">10.15479/AT-ISTA-21960</a>.","ieee":"A. Kerschbaumer, “Research Data: ‘Quasi-solitons in Rydberg atom chains.’” Institute of Science and Technology Austria, 2026.","chicago":"Kerschbaumer, Aron. “Research Data: ‘Quasi-Solitons in Rydberg Atom Chains.’” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21960\">https://doi.org/10.15479/AT-ISTA-21960</a>."},"license":"https://creativecommons.org/licenses/by-nc/4.0/","abstract":[{"lang":"eng","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. \r\nThese 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."}],"project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"doi":"10.15479/AT-ISTA-21960","file":[{"access_level":"open_access","creator":"akerschb","file_name":"README.txt","date_created":"2026-06-15T22:01:57Z","success":1,"checksum":"133269a105e996c6c44fdd56128259c7","file_size":1940,"date_updated":"2026-06-15T22:01:57Z","file_id":"22010","content_type":"text/plain","relation":"main_file"},{"file_id":"22011","content_type":"application/zip","relation":"main_file","checksum":"759f9649c3919f4c4ad37a1d104ea32a","file_size":13259747,"date_updated":"2026-06-15T22:02:07Z","creator":"akerschb","file_name":"Soliton_Data.zip","success":1,"date_created":"2026-06-15T22:02:07Z","access_level":"open_access"}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","oa":1,"file_date_updated":"2026-06-15T22:02:07Z","year":"2026","month":"06","type":"research_data","tmp":{"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)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"status":"public","oa_version":"Published Version","ec_funded":1,"corr_author":"1","date_created":"2026-06-09T07:17:50Z","has_accepted_license":"1","date_published":"2026-06-16T00:00:00Z","author":[{"orcid":"0009-0002-2370-8661","last_name":"Kerschbaumer","id":"ade85a9c-3200-11ee-973b-91c1eb240410","first_name":"Aron","full_name":"Kerschbaumer, Aron"}],"title":"Research Data: \"Quasi-solitons in Rydberg atom chains\"","date_updated":"2026-06-16T08:00:38Z","contributor":[{"first_name":"Aron","id":"ade85a9c-3200-11ee-973b-91c1eb240410","contributor_type":"contact_person","orcid":"0009-0002-2370-8661","last_name":"Kerschbaumer"},{"last_name":"Serbyn","orcid":"0000-0002-2399-5827","contributor_type":"supervisor","first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"},{"contributor_type":"researcher","first_name":"Jean-Yves Marc","id":"6c292945-a610-11ed-9eec-c3be1ad62a80","orcid":"0000-0002-3749-6375","last_name":"Desaules"},{"last_name":"Ljubotina","first_name":"Marko","contributor_type":"researcher"}],"_id":"21960","article_processing_charge":"No","day":"16","OA_place":"repository","department":[{"_id":"GradSch"},{"_id":"MaSe"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"PreCl"}],"citation":{"mla":"Miranda, Osvaldo, et al. “Pten Orchestrates Neurogenic Radial Glia Lineage Progression and Tunes Neocortical Astrocyte Production.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.64898/2026.05.01.722191\">10.64898/2026.05.01.722191</a>.","ama":"Miranda O, Contreras X, Pauler F, et al. Pten orchestrates neurogenic radial glia lineage progression and tunes neocortical astrocyte production. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.64898/2026.05.01.722191\">10.64898/2026.05.01.722191</a>","ista":"Miranda O, Contreras X, Pauler F, Davaatseren A, Amberg N, Streicher C, Villalba Requena A, Heger A-M, Marie C, Hassan BA, Rülicke T, Hippenmeyer S. Pten orchestrates neurogenic radial glia lineage progression and tunes neocortical astrocyte production. bioRxiv, <a href=\"https://doi.org/10.64898/2026.05.01.722191\">10.64898/2026.05.01.722191</a>.","apa":"Miranda, O., Contreras, X., Pauler, F., Davaatseren, A., Amberg, N., Streicher, C., … Hippenmeyer, S. (n.d.). Pten orchestrates neurogenic radial glia lineage progression and tunes neocortical astrocyte production. <i>bioRxiv</i>. <a href=\"https://doi.org/10.64898/2026.05.01.722191\">https://doi.org/10.64898/2026.05.01.722191</a>","short":"O. Miranda, X. Contreras, F. Pauler, A. Davaatseren, N. Amberg, C. Streicher, A. Villalba Requena, A.-M. Heger, C. Marie, B.A. Hassan, T. Rülicke, S. Hippenmeyer, BioRxiv (n.d.).","chicago":"Miranda, Osvaldo, Ximena Contreras, Florian Pauler, Amarbayasgalan Davaatseren, Nicole Amberg, Carmen Streicher, Ana Villalba Requena, et al. “Pten Orchestrates Neurogenic Radial Glia Lineage Progression and Tunes Neocortical Astrocyte Production.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.64898/2026.05.01.722191\">https://doi.org/10.64898/2026.05.01.722191</a>.","ieee":"O. Miranda <i>et al.</i>, “Pten orchestrates neurogenic radial glia lineage progression and tunes neocortical astrocyte production,” <i>bioRxiv</i>. ."},"doi":"10.64898/2026.05.01.722191","ddc":["570"],"acknowledgement":"We thank Kay-Uwe Wagner (Wayne State University) for generously sharing Jak1/2–flox mouse lines; A.\r\nSommer (VBCF GmbH, NGS Unit) for technical support; N. Kim, V. Mick, S. Schnabl, S. Gobeil, and L.\r\nAndersen for technical assistance; all members of the Hippenmeyer lab for discussion and B. Novitch for\r\ncomments on earlier versions of the manuscript. This research was supported by the Scientific Service Units\r\n(SSU) of IST Austria through resources provided by the Imaging and Optics Facility (IOF), Lab Support-\r\n(LSF) and Preclinical Facilities (PCF). O.A.M received support from the Austrian Academy of Sciences\r\nÖAW (DOC 186584), and N.A. from FWF Elise Richter Program (Grant V1041T). This work was also\r\nsupported by IST Austria institutional funds; FWF SFB F78 (Neuro Stem Modulation) to S.H., and the\r\nEuropean Research Council (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme (grant agreement No 725780 LinPro) to S.H.","has_accepted_license":"1","OA_type":"green","_id":"21963","day":"05","OA_place":"repository","publication_status":"submitted","type":"preprint","oa_version":"Preprint","publication":"bioRxiv","status":"public","corr_author":"1","date_created":"2026-06-09T08:08:53Z","oa":1,"language":[{"iso":"eng"}],"year":"2026","month":"05","abstract":[{"text":"The cerebral cortex consists of immense numbers of neuronal and glial cell-types derived from radial glial progenitor (RGP) cells. How RGPs generate appropriate quantities of distinct cortical cell-types to safeguard a brain of correct size, is not well understood. However, genetic aberration in human, including mutations in PTEN, lead to cortical malformation such as macrocephaly, albeit with unknown etiology. Here we utilized Mosaic Analysis with Double Markers (MADM)-based clonal analysis and single cell phenotyping to decipher the role of Pten in neurogenic and gliogenic RGP lineage progression during cortical ontogeny. While neurogenic RGP lineage progression and projection neuron production was moderately altered in the absence of Pten, cortical astrocyte production was drastically increased. Through genetic epistasis experiments we show that the loss of Pten uncouples astrocyte generation from essential growth factor signaling hubs, funneling into MAPK. Collectively, our results suggest that Pten regulates RGP lineage progression with distinct sequential functions in cortical projection neurogenesis and astrocyte production to ensure the emergence of a correctly-sized cerebral cortex.","lang":"eng"}],"project":[{"name":"Stem Cell Modulation in Neural Development and Regeneration/ P05-Molecular Mechanisms of Neural Stem Cell Lineage Progression","grant_number":"F7805","_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E"},{"name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"author":[{"orcid":"0000-0001-6618-6889","last_name":"Miranda","first_name":"Osvaldo","id":"862A3C56-A8BF-11E9-B4FA-D9E3E5697425","full_name":"Miranda, Osvaldo"},{"full_name":"Contreras, Ximena","id":"475990FE-F248-11E8-B48F-1D18A9856A87","first_name":"Ximena","last_name":"Contreras"},{"full_name":"Pauler, Florian","last_name":"Pauler","orcid":"0000-0002-7462-0048","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","first_name":"Florian"},{"id":"70ADC922-B424-11E9-99E3-BA18E6697425","first_name":"Amarbayasgalan","last_name":"Davaatseren","full_name":"Davaatseren, Amarbayasgalan"},{"full_name":"Amberg, Nicole","id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87","first_name":"Nicole","orcid":"0000-0002-3183-8207","last_name":"Amberg"},{"full_name":"Streicher, Carmen","last_name":"Streicher","first_name":"Carmen","id":"36BCB99C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Villalba Requena, Ana","orcid":"0000-0002-5615-5277","last_name":"Villalba Requena","id":"68cb85a0-39f7-11eb-9559-9aaab4f6a247","first_name":"Ana"},{"last_name":"Heger","first_name":"Anna-Magdalena","id":"4B76FFD2-F248-11E8-B48F-1D18A9856A87","full_name":"Heger, Anna-Magdalena"},{"full_name":"Marie, Corentine","first_name":"Corentine","last_name":"Marie"},{"full_name":"Hassan, Bassem A.","first_name":"Bassem A.","last_name":"Hassan"},{"last_name":"Rülicke","first_name":"Thomas","full_name":"Rülicke, Thomas"},{"last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Hippenmeyer, Simon"}],"main_file_link":[{"url":"https://doi.org/10.64898/2026.05.01.722191","open_access":"1"}],"date_published":"2026-05-05T00:00:00Z","date_updated":"2026-06-16T08:57:20Z","title":"Pten orchestrates neurogenic radial glia lineage progression and tunes neocortical astrocyte production","article_processing_charge":"No","department":[{"_id":"SiHi"},{"_id":"PreCl"},{"_id":"GradSch"}],"tmp":{"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)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"ec_funded":1},{"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2026-06-01T00:00:00Z","author":[{"full_name":"Gulyaev, Artem","last_name":"Gulyaev","first_name":"Artem","id":"83ed7901-7380-11f0-bf20-a0788d5e654d"},{"full_name":"Hazarika, Jyotisman","first_name":"Jyotisman","id":"d87714c4-663d-11f0-bd06-caece19833e5","orcid":"0009-0007-2542-7878","last_name":"Hazarika"},{"full_name":"Liu, Zhen-Fei","last_name":"Liu","first_name":"Zhen-Fei"},{"full_name":"Venkataraman, Latha","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","first_name":"Latha","orcid":"0000-0002-6957-6089","last_name":"Venkataraman"}],"title":"A computationally efficient and accurate method for predicting conductance of single-molecule junctions","date_updated":"2026-06-16T09:13:30Z","issue":"22","article_processing_charge":"Yes (via OA deal)","external_id":{"pmid":["42223342"]},"department":[{"_id":"LaVe"},{"_id":"GradSch"}],"publisher":"American Chemical Society","abstract":[{"lang":"eng","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."}],"PlanS_conform":"1","oa":1,"language":[{"iso":"eng"}],"page":"7429–7434","month":"06","year":"2026","type":"journal_article","oa_version":"Published Version","publication":"Nano Letters","status":"public","pmid":1,"corr_author":"1","date_created":"2026-06-10T07:27:19Z","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.","has_accepted_license":"1","OA_type":"hybrid","ddc":["540"],"scopus_import":"1","_id":"21980","publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]},"publication_status":"published","day":"01","OA_place":"publisher","intvolume":"        26","article_type":"letter_note","volume":26,"citation":{"chicago":"Gulyaev, Artem, Jyotisman Hazarika, Zhen-Fei Liu, and Latha Venkataraman. “A Computationally Efficient and Accurate Method for Predicting Conductance of Single-Molecule Junctions.” <i>Nano Letters</i>. American Chemical Society, 2026. <a href=\"https://doi.org/10.1021/acs.nanolett.6c01462\">https://doi.org/10.1021/acs.nanolett.6c01462</a>.","ieee":"A. Gulyaev, J. Hazarika, Z.-F. Liu, and L. Venkataraman, “A computationally efficient and accurate method for predicting conductance of single-molecule junctions,” <i>Nano Letters</i>, vol. 26, no. 22. American Chemical Society, pp. 7429–7434, 2026.","ama":"Gulyaev A, Hazarika J, Liu Z-F, Venkataraman L. A computationally efficient and accurate method for predicting conductance of single-molecule junctions. <i>Nano Letters</i>. 2026;26(22):7429–7434. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.6c01462\">10.1021/acs.nanolett.6c01462</a>","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.","apa":"Gulyaev, A., Hazarika, J., Liu, Z.-F., &#38; Venkataraman, L. (2026). A computationally efficient and accurate method for predicting conductance of single-molecule junctions. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.nanolett.6c01462\">https://doi.org/10.1021/acs.nanolett.6c01462</a>","short":"A. Gulyaev, J. Hazarika, Z.-F. Liu, L. Venkataraman, Nano Letters 26 (2026) 7429–7434.","mla":"Gulyaev, Artem, et al. “A Computationally Efficient and Accurate Method for Predicting Conductance of Single-Molecule Junctions.” <i>Nano Letters</i>, vol. 26, no. 22, American Chemical Society, 2026, pp. 7429–7434, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.6c01462\">10.1021/acs.nanolett.6c01462</a>."},"doi":"10.1021/acs.nanolett.6c01462","file":[{"checksum":"897551374cac28e0db26dcb0b676b8e7","file_size":3362800,"date_updated":"2026-06-16T09:11:35Z","file_id":"22013","content_type":"application/pdf","relation":"main_file","access_level":"open_access","creator":"dernst","file_name":"2026_NanoLetters_Gulyaev.pdf","success":1,"date_created":"2026-06-16T09:11:35Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","file_date_updated":"2026-06-16T09:11:35Z"},{"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"department":[{"_id":"GradSch"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"arxiv":["2509.16169"]},"title":"An easier way to compute 2-cocycles coming from a reduction for semidirect products","date_updated":"2026-06-16T09:23:39Z","date_published":"2026-05-21T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.1016/j.geomphys.2026.105878","open_access":"1"}],"author":[{"id":"8a0e2993-7114-11f0-b60e-f50e633649d8","first_name":"Viacheslav","last_name":"Goncharov","full_name":"Goncharov, Viacheslav"}],"PlanS_conform":"1","abstract":[{"text":"For Hamiltonian actions of semidirect products G = FxH, we study 2-cocycles arising from residual Hamiltonian actions of F on Hamiltonian reductions for H. The motivation comes from the study of Teichmüller spaces for surfaces with boundary, which carry Hamiltonian actions of the Virasoro algebra. In this paper, we give a general setup for the problem, and we suggest an easier way to obtain the Gelfand-Fuchs 2-cocycles for Hamiltonian actions on Teichmüller spaces.","lang":"eng"}],"publisher":"Elsevier","month":"05","year":"2026","language":[{"iso":"eng"}],"oa":1,"arxiv":1,"date_created":"2026-06-10T07:29:13Z","corr_author":"1","publication":"Journal of Geometry and Physics","oa_version":"Published Version","status":"public","type":"journal_article","publication_status":"epub_ahead","OA_place":"publisher","intvolume":"       227","day":"21","_id":"21981","publication_identifier":{"issn":["0393-0440"],"eissn":["1879-1662"]},"scopus_import":"1","has_accepted_license":"1","OA_type":"hybrid","ddc":["000"],"doi":"10.1016/j.geomphys.2026.105878","citation":{"ama":"Goncharov V. An easier way to compute 2-cocycles coming from a reduction for semidirect products. <i>Journal of Geometry and Physics</i>. 2026;227. doi:<a href=\"https://doi.org/10.1016/j.geomphys.2026.105878\">10.1016/j.geomphys.2026.105878</a>","short":"V. Goncharov, Journal of Geometry and Physics 227 (2026).","apa":"Goncharov, V. (2026). An easier way to compute 2-cocycles coming from a reduction for semidirect products. <i>Journal of Geometry and Physics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.geomphys.2026.105878\">https://doi.org/10.1016/j.geomphys.2026.105878</a>","ista":"Goncharov V. 2026. An easier way to compute 2-cocycles coming from a reduction for semidirect products. Journal of Geometry and Physics. 227, 105878.","mla":"Goncharov, Viacheslav. “An Easier Way to Compute 2-Cocycles Coming from a Reduction for Semidirect Products.” <i>Journal of Geometry and Physics</i>, vol. 227, 105878, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.geomphys.2026.105878\">10.1016/j.geomphys.2026.105878</a>.","chicago":"Goncharov, Viacheslav. “An Easier Way to Compute 2-Cocycles Coming from a Reduction for Semidirect Products.” <i>Journal of Geometry and Physics</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.geomphys.2026.105878\">https://doi.org/10.1016/j.geomphys.2026.105878</a>.","ieee":"V. Goncharov, “An easier way to compute 2-cocycles coming from a reduction for semidirect products,” <i>Journal of Geometry and Physics</i>, vol. 227. Elsevier, 2026."},"volume":227,"article_type":"original","article_number":"105878","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"date_created":"2026-02-05T13:54:39Z","related_material":{"record":[{"status":"public","id":"20641","relation":"earlier_version"},{"id":"22105","status":"public","relation":"used_in_publication"}]},"corr_author":"1","oa_version":"Published Version","status":"public","type":"research_data","day":"09","_id":"21145","has_accepted_license":"1","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.","ddc":["572"],"doi":"10.15479/AT-ISTA-21145","citation":{"apa":"Becker, L. M., Schanda, P., &#38; Chipot, C. (2026). Additional Data for “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21145\">https://doi.org/10.15479/AT-ISTA-21145</a>","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, <a href=\"https://doi.org/10.15479/AT-ISTA-21145\">10.15479/AT-ISTA-21145</a>.","short":"L.M. Becker, P. Schanda, C. Chipot, (2026).","ama":"Becker LM, Schanda P, Chipot C. Additional Data for “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21145\">10.15479/AT-ISTA-21145</a>","mla":"Becker, Lea Marie, et al. <i>Additional Data for “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.”</i> Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21145\">10.15479/AT-ISTA-21145</a>.","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.","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. <a href=\"https://doi.org/10.15479/AT-ISTA-21145\">https://doi.org/10.15479/AT-ISTA-21145</a>."},"file_date_updated":"2026-02-05T13:52:41Z","acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"file":[{"access_level":"open_access","creator":"lbecker","file_name":"README.txt","date_created":"2026-02-05T13:52:37Z","checksum":"02a419cce8cea450bc952f35488d2df5","file_size":4263,"date_updated":"2026-02-05T13:52:37Z","file_id":"21146","content_type":"text/plain","relation":"table_of_contents"},{"date_updated":"2026-02-05T13:52:41Z","file_size":50647107,"checksum":"b0b82b1aa73985b0b308a3fa52d21aea","relation":"main_file","content_type":"application/zip","file_id":"21147","access_level":"open_access","date_created":"2026-02-05T13:52:41Z","success":1,"file_name":"Research_Data.zip","creator":"lbecker"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"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)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"department":[{"_id":"GradSch"},{"_id":"PaSc"}],"article_processing_charge":"No","date_updated":"2026-06-24T08:47:57Z","title":"Additional Data for \"Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes\"","contributor":[{"last_name":"Fu","contributor_type":"researcher","first_name":"Haohao"},{"contributor_type":"researcher","id":"71cda2f3-e604-11ee-a1df-da10587eda3f","first_name":"Benjamin","last_name":"Tatman"},{"contributor_type":"researcher","first_name":"Matthias","last_name":"Dreydoppel"},{"contributor_type":"researcher","id":"9fb2a840-89e1-11ee-a8b7-cc5c7ba62471","first_name":"Anna","last_name":"Kapitonova"},{"contributor_type":"researcher","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","first_name":"Daniel","last_name":"Balazs","orcid":"0000-0001-7597-043X"},{"last_name":"Weininger","first_name":"Ulrich","contributor_type":"researcher"},{"last_name":"Engilberge","first_name":"Sylvain","contributor_type":"researcher"}],"date_published":"2026-02-09T00:00:00Z","author":[{"full_name":"Becker, Lea Marie","id":"36336939-eb97-11eb-a6c2-c83f1214ca79","first_name":"Lea Marie","orcid":"0000-0002-6401-5151","last_name":"Becker"},{"full_name":"Schanda, Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul","orcid":"0000-0002-9350-7606","last_name":"Schanda"},{"full_name":"Chipot, Christophe","last_name":"Chipot","first_name":"Christophe"}],"project":[{"_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0","grant_number":"26777","name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches"}],"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. "}],"publisher":"Institute of Science and Technology Austria","month":"02","year":"2026","oa":1},{"volume":368,"citation":{"ama":"Kalinin N, Andersson JD. Learning rate scheduling with matrix factorization for private training. In: <i>7th Symposium on Foundations of Responsible Computing</i>. Vol 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">10.4230/LIPIcs.FORC.2026.2</a>","short":"N. Kalinin, J.D. Andersson, in:, 7th Symposium on Foundations of Responsible Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","ista":"Kalinin N, Andersson JD. 2026. Learning rate scheduling with matrix factorization for private training. 7th Symposium on Foundations of Responsible Computing. FORC: Symposium on Foundations of Responsible Computing, LIPIcs, vol. 368, 2:1-2:21.","apa":"Kalinin, N., &#38; Andersson, J. D. (2026). Learning rate scheduling with matrix factorization for private training. In <i>7th Symposium on Foundations of Responsible Computing</i> (Vol. 368). Cambridge, MA; United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">https://doi.org/10.4230/LIPIcs.FORC.2026.2</a>","mla":"Kalinin, Nikita, and Joel D. Andersson. “Learning Rate Scheduling with Matrix Factorization for Private Training.” <i>7th Symposium on Foundations of Responsible Computing</i>, vol. 368, 2:1-2:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">10.4230/LIPIcs.FORC.2026.2</a>.","chicago":"Kalinin, Nikita, and Joel D Andersson. “Learning Rate Scheduling with Matrix Factorization for Private Training.” In <i>7th Symposium on Foundations of Responsible Computing</i>, Vol. 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">https://doi.org/10.4230/LIPIcs.FORC.2026.2</a>.","ieee":"N. Kalinin and J. D. Andersson, “Learning rate scheduling with matrix factorization for private training,” in <i>7th Symposium on Foundations of Responsible Computing</i>, Cambridge, MA; United States, 2026, vol. 368."},"article_number":"2:1-2:21","doi":"10.4230/LIPIcs.FORC.2026.2","file":[{"date_created":"2026-06-29T06:55:23Z","success":1,"file_name":"2026_LIPIcsFORC_Kalinin.pdf","creator":"dernst","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"22149","date_updated":"2026-06-29T06:55:23Z","file_size":1231914,"checksum":"c661f016d3861a1c1b590b87a744d087"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2026-06-29T06:55:23Z","quality_controlled":"1","publication":"7th Symposium on Foundations of Responsible Computing","status":"public","oa_version":"Published Version","alternative_title":["LIPIcs"],"type":"conference","conference":{"end_date":"2026-06-05","name":"FORC: Symposium on Foundations of Responsible Computing","start_date":"2026-06-03","location":"Cambridge, MA; United States"},"date_created":"2026-06-28T22:01:34Z","arxiv":1,"corr_author":"1","scopus_import":"1","acknowledgement":"We thank Rasmus Pagh, Christoph Lampert and Jalaj Upadhyay for valuable\r\ncomments on an early draft. We thank Ryan Mckenna for a fruitful discussion on the experiment\r\ndesign. We thank Antti Honkela for sharing insights on learning rate scheduling and DP.\r\nNikita P. Kalinin: Funded in part by the Austrian Science Fund (FWF) [10.55776/COE12].\r\nJoel Daniel Andersson: Funded by the European Union. Views and opinions expressed are however\r\nthose of the author(s) only and do not necessarily reflect those of the European Union or the European\r\nResearch Council Executive Agency. Neither the European Union nor the granting authority can be\r\nheld responsible for them. This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct,\r\nNo. 101019564). Additional funding by Providentia, a Data Science Distinguished Investigator grant\r\nfrom Novo Nordisk Fonden, with additional support from VILLUM Investigator grant 54451.\r\n","OA_type":"gold","has_accepted_license":"1","ddc":["000"],"publication_status":"published","intvolume":"       368","day":"01","OA_place":"publisher","_id":"22146","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959774192"]},"abstract":[{"text":"We study differentially private model training with stochastic gradient descent under learning rate scheduling and correlated noise. Although correlated noise, in particular via matrix factorizations, has been shown to improve accuracy, prior theoretical work focused primarily on the prefix-sum workload. That workload assumes a constant learning rate, whereas in practice learning rate schedules are widely used to accelerate training and improve convergence. We close this gap by deriving general upper and lower bounds for a broad class of learning rate schedules in both single- and multi-epoch settings. Building on these results, we propose a learning-rate-aware factorization that achieves improvements over prefix-sum factorizations under both MaxSE and MeanSE error metrics. Our theoretical analysis yields memory-efficient constructions suitable for practical deployment, and experiments on CIFAR-10 and IMDB datasets confirm that schedule-aware factorizations improve accuracy in private training.","lang":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"}],"oa":1,"month":"06","year":"2026","language":[{"iso":"eng"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"das_tickbox":"0","ec_funded":1,"title":"Learning rate scheduling with matrix factorization for private training","keyword":["differential privacy","machine learning","matrix factorization"],"date_updated":"2026-06-29T06:56:34Z","date_published":"2026-06-01T00:00:00Z","supplementarymaterial":"no","author":[{"last_name":"Kalinin","id":"4b14526e-14d2-11ed-ba64-c14c9553d137","first_name":"Nikita","full_name":"Kalinin, Nikita"},{"full_name":"Andersson, Joel D","last_name":"Andersson","id":"4a893819-d954-11f0-89b1-e360bad9ccc5","first_name":"Joel D"}],"department":[{"_id":"ChLa"},{"_id":"GradSch"},{"_id":"MoHe"}],"researchdata_availability":"no","article_processing_charge":"No","external_id":{"arxiv":["2511.17994"]}},{"article_processing_charge":"No","department":[{"_id":"FrPe"},{"_id":"GradSch"}],"author":[{"full_name":"Muñoz Hermosilla, José M","last_name":"Muñoz Hermosilla","orcid":"0000-0002-1990-8508","first_name":"José M","id":"e1037a6d-646e-11ef-b402-e0ed9ab0901e"},{"full_name":"Miles, Evan","first_name":"Evan","last_name":"Miles"},{"last_name":"McCarthy","id":"22a2674a-61ce-11ee-94b5-d18813baf16f","first_name":"Michael","full_name":"McCarthy, Michael"},{"last_name":"Melo Velasco","id":"2611dec0-b9c6-11ed-9bea-a81c2b17a549","first_name":"Juan Vicente","full_name":"Melo Velasco, Juan Vicente"},{"last_name":"Hardmeier","first_name":"Florian","full_name":"Hardmeier, Florian"},{"last_name":"GANTAYAT","first_name":"PRATEEK","id":"02734268-3e8d-11ef-80a1-cec4a088d004","full_name":"GANTAYAT, PRATEEK"},{"id":"f06891fd-9f42-11ee-8632-a20971c43046","first_name":"Adrià","last_name":"Fontrodona-Bach","full_name":"Fontrodona-Bach, Adrià"},{"full_name":"Jouvet, Guillaume","last_name":"Jouvet","first_name":"Guillaume"},{"last_name":"Pellicciotti","orcid":"0000-0002-5554-8087","first_name":"Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","full_name":"Pellicciotti, Francesca"}],"date_published":"2026-07-02T00:00:00Z","title":"Constraining debris input to Oberaletsch Glacier using ensemble-based Lagrangian modelling","date_updated":"2026-07-02T06:42:37Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"language":[{"iso":"eng"}],"month":"07","year":"2026","oa":1,"publisher":"European Geosciences Union","_id":"22119","OA_place":"publisher","day":"02","publication_status":"published","ddc":["550"],"has_accepted_license":"1","OA_type":"gold","corr_author":"1","date_created":"2026-06-22T12:16:50Z","conference":{"name":"EGU General Assembly","start_date":"2026-05-03","location":"Vienna, Austria & Virtual","end_date":"2026-05-08"},"type":"conference_abstract","oa_version":"Published Version","publication":"EGU General Assembly 2026","status":"public","file_date_updated":"2026-07-02T06:22:50Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"22233","content_type":"application/pdf","relation":"main_file","checksum":"2ea3e691cfa53176d0e801b9172842d6","file_size":284023,"date_updated":"2026-07-02T06:22:50Z","creator":"dernst","file_name":"2026_EGU26_MunozHermosilla.pdf","success":1,"date_created":"2026-07-02T06:22:50Z","access_level":"open_access"}],"doi":"10.5194/egusphere-egu26-19367","article_number":"EGU26-19367","citation":{"apa":"Muñoz Hermosilla, J. M., Miles, E., McCarthy, M., Melo Velasco, J. V., Hardmeier, F., GANTAYAT, P., … Pellicciotti, F. (2026). Constraining debris input to Oberaletsch Glacier using ensemble-based Lagrangian modelling. In <i>EGU General Assembly 2026</i>. Vienna, Austria &#38; Virtual: European Geosciences Union. <a href=\"https://doi.org/10.5194/egusphere-egu26-19367\">https://doi.org/10.5194/egusphere-egu26-19367</a>","short":"J.M. Muñoz Hermosilla, E. Miles, M. McCarthy, J.V. Melo Velasco, F. Hardmeier, P. GANTAYAT, A. Fontrodona-Bach, G. Jouvet, F. Pellicciotti, in:, EGU General Assembly 2026, European Geosciences Union, 2026.","ista":"Muñoz Hermosilla JM, Miles E, McCarthy M, Melo Velasco JV, Hardmeier F, GANTAYAT P, Fontrodona-Bach A, Jouvet G, Pellicciotti F. 2026. Constraining debris input to Oberaletsch Glacier using ensemble-based Lagrangian modelling. EGU General Assembly 2026. EGU General Assembly, EGU26-19367.","ama":"Muñoz Hermosilla JM, Miles E, McCarthy M, et al. Constraining debris input to Oberaletsch Glacier using ensemble-based Lagrangian modelling. In: <i>EGU General Assembly 2026</i>. European Geosciences Union; 2026. doi:<a href=\"https://doi.org/10.5194/egusphere-egu26-19367\">10.5194/egusphere-egu26-19367</a>","mla":"Muñoz Hermosilla, José M., et al. “Constraining Debris Input to Oberaletsch Glacier Using Ensemble-Based Lagrangian Modelling.” <i>EGU General Assembly 2026</i>, EGU26-19367, European Geosciences Union, 2026, doi:<a href=\"https://doi.org/10.5194/egusphere-egu26-19367\">10.5194/egusphere-egu26-19367</a>.","ieee":"J. M. Muñoz Hermosilla <i>et al.</i>, “Constraining debris input to Oberaletsch Glacier using ensemble-based Lagrangian modelling,” in <i>EGU General Assembly 2026</i>, Vienna, Austria &#38; Virtual, 2026.","chicago":"Muñoz Hermosilla, José M, Evan Miles, Michael McCarthy, Juan Vicente Melo Velasco, Florian Hardmeier, PRATEEK GANTAYAT, Adrià Fontrodona-Bach, Guillaume Jouvet, and Francesca Pellicciotti. “Constraining Debris Input to Oberaletsch Glacier Using Ensemble-Based Lagrangian Modelling.” In <i>EGU General Assembly 2026</i>. European Geosciences Union, 2026. <a href=\"https://doi.org/10.5194/egusphere-egu26-19367\">https://doi.org/10.5194/egusphere-egu26-19367</a>."}},{"abstract":[{"text":"We revisit the computation of 3D generalized winding numbers, a useful measure for inside-outside classification on triangle meshes with gaps, self-intersections, and open boundaries. At the core of our new method is an analytical reduction of the surface integral that defines the winding number, resulting in a single ray-mesh intersection test and an elementary sum over boundary edges per evaluation. This construction is orders of magnitude more efficient than the state of the art in practice, which we show in an extensive performance benchmark. Conveniently, the method also reduces to the best-available asymptotic complexity in the worst case, and it introduces no approximations apart from floating-point errors. Our algorithm is conceptually simple to understand, straightforward to implement and debug, and it works reliably even on extremely noisy and corrupt input geometry.","lang":"eng"}],"publisher":"Association for Computing Machinery","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"PlanS_conform":"1","oa":1,"month":"07","year":"2026","language":[{"iso":"eng"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"das_tickbox":"0","date_updated":"2026-07-06T06:14:18Z","title":"Fast and exact winding numbers for triangle meshes","issue":"4","date_published":"2026-07-03T00:00:00Z","supplementarymaterial":"no","author":[{"full_name":"Xie, Peiyuan","first_name":"Peiyuan","id":"488e236c-6bad-11f0-9831-859175c78e8a","last_name":"Xie"},{"full_name":"Hafner, Christian","last_name":"Hafner","id":"400429CC-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"},{"full_name":"Wojtan, Christopher J","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","orcid":"0000-0001-6646-5546"}],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"article_processing_charge":"Yes (via OA deal)","researchdata_availability":"no","volume":45,"citation":{"mla":"Xie, Peiyuan, et al. “Fast and Exact Winding Numbers for Triangle Meshes.” <i>ACM Transactions on Graphics</i>, vol. 45, no. 4, 41, Association for Computing Machinery, 2026, doi:<a href=\"https://doi.org/10.1145/3811339\">10.1145/3811339</a>.","ama":"Xie P, Hafner C, Wojtan C. Fast and exact winding numbers for triangle meshes. <i>ACM Transactions on Graphics</i>. 2026;45(4). doi:<a href=\"https://doi.org/10.1145/3811339\">10.1145/3811339</a>","ista":"Xie P, Hafner C, Wojtan C. 2026. Fast and exact winding numbers for triangle meshes. ACM Transactions on Graphics. 45(4), 41.","apa":"Xie, P., Hafner, C., &#38; Wojtan, C. (2026). Fast and exact winding numbers for triangle meshes. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3811339\">https://doi.org/10.1145/3811339</a>","short":"P. Xie, C. Hafner, C. Wojtan, ACM Transactions on Graphics 45 (2026).","chicago":"Xie, Peiyuan, Christian Hafner, and Chris Wojtan. “Fast and Exact Winding Numbers for Triangle Meshes.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3811339\">https://doi.org/10.1145/3811339</a>.","ieee":"P. Xie, C. Hafner, and C. Wojtan, “Fast and exact winding numbers for triangle meshes,” <i>ACM Transactions on Graphics</i>, vol. 45, no. 4. Association for Computing Machinery, 2026."},"article_type":"original","article_number":"41","doi":"10.1145/3811339","file":[{"access_level":"open_access","success":1,"date_created":"2026-07-06T06:13:12Z","file_name":"2026_TransactionsGraphics_Xie.pdf","creator":"dernst","date_updated":"2026-07-06T06:13:12Z","file_size":5212838,"checksum":"7e36e69f377b680a893e65b620b43813","relation":"main_file","content_type":"application/pdf","file_id":"22249"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2026-07-06T06:13:12Z","quality_controlled":"1","publication":"ACM Transactions on Graphics","status":"public","oa_version":"Published Version","type":"journal_article","date_created":"2026-07-03T21:03:48Z","corr_author":"1","scopus_import":"1","acknowledgement":"We thank Sadashige Ishida and Ryusuke Sugimoto for their insightful discussions and proofreading and other members of the ISTA\r\nVisual Computing Group for their general feedback. This project was\r\nfunded in part by the European Research Council (ERC Consolidator\r\nGrant 101045083 CoDiNA).","OA_type":"hybrid","has_accepted_license":"1","ddc":["000"],"publication_status":"published","intvolume":"        45","day":"03","OA_place":"publisher","_id":"22241","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]}},{"language":[{"iso":"eng"}],"year":"2026","month":"07","oa":1,"project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"publisher":"Association for Computing Machinery","abstract":[{"text":"The appearance of simulated natural phenomena heavily depends on the way surfaces are textured. However, applying texture maps to dynamic deformable surfaces presents a significant challenge, due to ever-shifting differences in length scales involved. When these surfaces move and advect the texture along with them, their final appearance degrades as deformed regions dramatically distort their texture map. Modifications to the texture directly at the pixel level in response to the deformation may introduce ghosting artifacts and look unnatural. In the real world, the appearance of surface details on a deforming material changes through the interplay of physical processes such as rupturing, exposure of internal structure, or wrinkling. Motivated by these behaviors, in this work we explore how physical principles can guide the texturing methods based on the measure of surface deformation.\r\nWe present two novel wave-based procedural texturing algorithms which reproduce common physical properties like advection and self-similarity, enabling the plausible animation of deforming objects with extreme texture map distortions. Our algorithms are fully procedural, require no actual physics simulation, and store no state or history of deformation besides the input UV map, making them highly parallelizable on the GPU and efficient enough for real-time applications. We show the versatility of the method by animating physical phenomena with extreme deformations such as flowing lava, stretching putty and outpouring sludge.","lang":"eng"}],"researchdata_availability":"no","article_processing_charge":"Yes","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"date_published":"2026-07-01T00:00:00Z","supplementarymaterial":"yes","author":[{"full_name":"Kalinov, Aleksei","first_name":"Aleksei","id":"44b7120e-eb97-11eb-a6c2-e1557aa81d02","last_name":"Kalinov","orcid":"0000-0003-2189-3904"},{"full_name":"Ly, Mickaël","id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","first_name":"Mickaël","last_name":"Ly"},{"full_name":"Hafner, Christian","last_name":"Hafner","id":"400429CC-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","orcid":"0000-0001-6646-5546","last_name":"Wojtan","full_name":"Wojtan, Christopher J"}],"date_updated":"2026-07-06T10:30:34Z","keyword":["Procedural animation"],"title":"Physics-inspired procedural texturing of extremely deformable surfaces","issue":"4","das_tickbox":"0","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"file_date_updated":"2026-05-29T13:19:37Z","file":[{"creator":"akalinov","file_name":"tog454-article154-supplemental.mp4","success":1,"date_created":"2026-05-29T13:19:33Z","access_level":"open_access","file_id":"21924","content_type":"video/mp4","relation":"main_file","checksum":"ea165bf731ddd3045f83878dcb833672","file_size":77337231,"date_updated":"2026-05-29T13:19:33Z"},{"access_level":"open_access","date_created":"2026-05-29T13:19:37Z","success":1,"file_name":"tog454-article154-video.mp4","creator":"akalinov","date_updated":"2026-05-29T13:19:37Z","file_size":226633977,"checksum":"6274cfb15ea5ba7324b74afc7b0d9629","relation":"main_file","content_type":"video/mp4","file_id":"21925"},{"access_level":"open_access","file_name":"tog454-article154-supplemental.pdf","creator":"akalinov","date_created":"2026-05-29T13:19:33Z","success":1,"checksum":"9d41b322a7876be9a3311017b9973183","date_updated":"2026-05-29T13:19:33Z","file_size":6793867,"file_id":"21926","relation":"main_file","content_type":"application/pdf"},{"access_level":"open_access","creator":"akalinov","file_name":"tog454-article154-main-1.pdf","date_created":"2026-05-29T13:19:36Z","success":1,"checksum":"51bc60d2de867fbfa570652dec7993b4","file_size":84173392,"date_updated":"2026-05-29T13:19:36Z","file_id":"21927","content_type":"application/pdf","relation":"main_file"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/3811353","article_type":"original","article_number":"154","volume":45,"citation":{"ieee":"A. Kalinov, M. Ly, C. Hafner, and C. Wojtan, “Physics-inspired procedural texturing of extremely deformable surfaces,” <i>ACM Transactions on Graphics</i>, vol. 45, no. 4. Association for Computing Machinery, 2026.","chicago":"Kalinov, Aleksei, Mickaël Ly, Christian Hafner, and Chris Wojtan. “Physics-Inspired Procedural Texturing of Extremely Deformable Surfaces.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3811353\">https://doi.org/10.1145/3811353</a>.","apa":"Kalinov, A., Ly, M., Hafner, C., &#38; Wojtan, C. (2026). Physics-inspired procedural texturing of extremely deformable surfaces. <i>ACM Transactions on Graphics</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3811353\">https://doi.org/10.1145/3811353</a>","ista":"Kalinov A, Ly M, Hafner C, Wojtan C. 2026. Physics-inspired procedural texturing of extremely deformable surfaces. ACM Transactions on Graphics. 45(4), 154.","short":"A. Kalinov, M. Ly, C. Hafner, C. Wojtan, ACM Transactions on Graphics 45 (2026).","ama":"Kalinov A, Ly M, Hafner C, Wojtan C. Physics-inspired procedural texturing of extremely deformable surfaces. <i>ACM Transactions on Graphics</i>. 2026;45(4). doi:<a href=\"https://doi.org/10.1145/3811353\">10.1145/3811353</a>","mla":"Kalinov, Aleksei, et al. “Physics-Inspired Procedural Texturing of Extremely Deformable Surfaces.” <i>ACM Transactions on Graphics</i>, vol. 45, no. 4, 154, Association for Computing Machinery, 2026, doi:<a href=\"https://doi.org/10.1145/3811353\">10.1145/3811353</a>."},"_id":"21923","publication_identifier":{"issn":["0730-0301"]},"publication_status":"published","day":"01","OA_place":"publisher","intvolume":"        45","OA_type":"gold","acknowledgement":"We thank the anonymous reviewers for their helpful comments, the members of the Visual Computing Group at ISTA for their feedback. We also thank Jonathan Gagnon for their help with running the Lapped Textures codes and SideFX for the Houdini Education software licenses.\r\nImages in Fig. 2 by Kisoulou and Vultured on Unsplash, Michal Jarmoluk and Public Domain Pictures from Pixabay and Hawai‘i Volcanoes NPS on flickr. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing and was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA).","has_accepted_license":"1","ddc":["006"],"scopus_import":"1","corr_author":"1","date_created":"2026-05-29T13:25:16Z","type":"journal_article","conference":{"location":"Los Angeles, CA, United States","name":"SIGGRAPH: International Conference and Exhibition on Computer Graphics and Interactive Techniques","start_date":"2026-07-19","end_date":"2026-07-23"},"oa_version":"Published Version","status":"public","publication":"ACM Transactions on Graphics"},{"date_created":"2026-07-04T17:32:27Z","related_material":{"link":[{"relation":"research_data","url":"https://github.com/ISTA-Nanoelectronics/noise_paper_public"}]},"corr_author":"1","status":"public","oa_version":"Published Version","type":"research_data","day":"04","OA_place":"repository","doi_confirm":"1","_id":"22242","ddc":["530"],"has_accepted_license":"1","doi":"10.15479/AT-ISTA-22242","citation":{"ieee":"M. Borovkov, “Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices.” Institute of Science and Technology Austria, 2026.","chicago":"Borovkov, Maksim. “Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22242\">https://doi.org/10.15479/AT-ISTA-22242</a>.","mla":"Borovkov, Maksim. <i>Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22242\">10.15479/AT-ISTA-22242</a>.","ista":"Borovkov M. 2026. Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-22242\">10.15479/AT-ISTA-22242</a>.","apa":"Borovkov, M. (2026). Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22242\">https://doi.org/10.15479/AT-ISTA-22242</a>","short":"M. Borovkov, (2026).","ama":"Borovkov M. Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22242\">10.15479/AT-ISTA-22242</a>"},"file_date_updated":"2026-07-04T17:28:49Z","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","file":[{"file_id":"22243","content_type":"application/x-zip-compressed","relation":"main_file","checksum":"2a1ea297e01a7a202a6b144d69a46eef","file_size":3082596099,"date_updated":"2026-07-04T17:28:49Z","creator":"mborovko","file_name":"noise_paper_public_deposit.zip","date_created":"2026-07-04T17:28:49Z","success":1,"access_level":"open_access"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"department":[{"_id":"GradSch"},{"_id":"GeKa"}],"article_processing_charge":"No","contributor":[{"last_name":"Borovkov","id":"1fd0975f-8b61-11ed-b69e-d149334f28c5","contributor_type":"contact_person","first_name":"Maksim"}],"title":"Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices","date_updated":"2026-07-06T07:53:56Z","author":[{"full_name":"Borovkov, Maksim","first_name":"Maksim","id":"1fd0975f-8b61-11ed-b69e-d149334f28c5","last_name":"Borovkov"}],"date_published":"2026-07-04T00:00:00Z","project":[{"_id":"bdc2ca30-d553-11ed-ba76-cf164a5bb811","grant_number":"101115315","name":"Quantum bits with Kitaev Transmons"},{"grant_number":"F8606","name":"Center for Correlated Quantum Materials and Solid State Quantum Systems: Conventional  and unconventional topological superconductors","_id":"34a66131-11ca-11ed-8bc3-a31681c6b03e"},{"_id":"bd8bd29e-d553-11ed-ba76-f0070d4b237a","grant_number":"P36507","name":"Merging spin and superconducting qubits in planar Ge"},{"name":"Realization and Manipulation of a Planar hybrid superconducting Andreev spin qubit in Germanium","grant_number":"101150858","_id":"8ea8abf7-16d5-11f0-9cad-c41e56ec8bb3"},{"_id":"5b9e579c-ab3d-11f0-914f-88754c5b5a3f","grant_number":"PAT 7682124","name":"Superconducting spin qubits in planar Ge"}],"abstract":[{"lang":"eng","text":"This deposit contains the data and analysis code accompanying the publication \"Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting–Superconducting Devices\" (Borovkov et al.). The deposit includes the raw transport and current-noise measurements of three gate-defined quantum-dot devices as QCodes SQLite databases, the master table of the charge-noise (flank-method) analysis with the pointers linking every analyzed PSD trace to the raw data, the toy-model noise simulation datasets behind the supplementary figures, the archived analysis figures (PSD fits and lever-arm extractions), and the Python code reproducing the full analysis and all figures. The code is also maintained at https://github.com/ISTA-Nanoelectronics/noise_paper_public; instructions are provided in the README files."}],"publisher":"Institute of Science and Technology Austria","month":"07","year":"2026","oa":1}]